Skip to main content
SLU publication database (SLUpub)

Abstract

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

Published in

Publisher: IEEE Computer Society,Los Alamitos, CA, USA

Conference

5th International Symposium on Image and Signal Processing and Analysis

SLU Authors

  • Malmberg, Filip

    • Centre for Image Analysis, Swedish University of Agricultural Sciences

  • Svensson, Stina

    • Centre for Image Analysis, Swedish University of Agricultural Sciences

Publication identifier

  • DOI: https://doi.org/10.1109/ISPA.2007.4383723
  • ISBN: 978-953-184-116-0

Permanent link to this page (URI)

https://res.slu.se/id/publ/17137