• DocumentCode
    1577118
  • Title

    Redundancy in All Pairs Fast Marching Method

  • Author

    Bertelli, L. ; Sumengen, B. ; Manjunath, B.S.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA
  • fYear
    2006
  • Firstpage
    3033
  • Lastpage
    3036
  • Abstract
    In this paper, we analyze the redundancy in calculating all pairs of geodesic distances on a rectangular grid. Fast marching method is an efficient way to estimate the geodesic distances from a point. But when calculated for all the points on the grid, this introduces certain redundancy. Our analysis shows that over 90% of the distances are actually recalculated. We propose a novel solution which exploits this redundancy to reduce the number of distances evaluated using the fast marching method and enforces the symmetry of the distance matrix. Experimental results show the improved accuracy obtained with our implementation.
  • Keywords
    differential geometry; image segmentation; redundancy; all pairs geodesic distance calculation; fast marching method; image segmentation; pairwise similarity; rectangular grid; redundancy; Cost function; Geophysics computing; Image processing; Image segmentation; Informatics; Joining processes; Kernel; Level measurement; Pixel; Symmetric matrices; Fast marching method; geodesic distance; image segmentation; similarity measure;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Image Processing, 2006 IEEE International Conference on
  • Conference_Location
    Atlanta, GA
  • ISSN
    1522-4880
  • Print_ISBN
    1-4244-0480-0
  • Type

    conf

  • DOI
    10.1109/ICIP.2006.313006
  • Filename
    4107209