 |
My ICIP 2006 Schedule
Note: Your custom schedule will not be saved unless you create a new account or login to an existing account.
Paper Detail
| Paper: | WP-P1.11 |
| Session: | Visual Object/Event Detection, Segmentation, and Classification |
| Time: | Wednesday, October 11, 14:20 - 17:00 |
| Presentation: |
Poster |
| Topic: |
Image & Video Segmentation: Other |
| Title: |
REDUNDANCY IN ALL PAIRS FAST MARCHING METHOD |
| Authors: |
Luca Bertelli; University of California, Santa Barbara | | | | | Baris Sumengen; University of California, Santa Barbara | | | | | B. S. Manjunath; University of California, Santa Barbara | | |
| 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. |
|
