Minimal Cost-Path for Path-Based Distances
2007 (English)In: Proceedings of 5th International Symposium on Image and Signal Processing and Analysis (ISPA 2007), 2007, 379-384 p.Conference paper (Refereed)
Distance functions defined by the minimal cost-path using weights and neighbourhood sequences (n.s.) are considered for the constrained distance transform (CDT). The CDT is then used to find one minimal cost-path between two points. The behaviour of some path-based distance functions is analyzed and a new error function is introduced. It is concluded that the weighted n.s.-distance with two weights (3 x 3 neighbourhood) and the weighted distance with three weights (5 x 5 neighbourhood) have similar properties in terms of minimal cost-path computation, while the former is more efficient to compute.
Place, publisher, year, edition, pages
2007. 379-384 p.
Computer Vision and Robotics (Autonomous Systems)
IdentifiersURN: urn:nbn:se:uu:diva-12585DOI: doi:10.1109/ISPA.2007.4383723ISBN: 978-953-184-116-0OAI: oai:DiVA.org:uu-12585DiVA: diva2:40354