An observation about circular shortest paths: Dealing with additional constraints using branch and bound
Vallotton, P., Lovell, D. R., & Newman, J. (2011) An observation about circular shortest paths: Dealing with additional constraints using branch and bound. In Proceedings of 2011 Internation Conference on Digital Image Computing Techniques and Applications (DICTA), IEEE Computer Society, pp. 513-517.
Circular shortest paths represent a powerful methodology for image segmentation. The circularity condition ensures that the contour found by the algorithm is closed, a natural requirement for regular objects. Several implementations have been proposed in the past that either promise closure with high probability or ensure closure strictly, but with a mild computational efficiency handicap. Circularity can be viewed as a priori information that helps recover the correct object contour. Our "observation" is that circularity is only one among many possible constraints that can be imposed on shortest paths to guide them to a desirable solution. In this contribution, we illustrate this opportunity under a volume constraint but the concept is generally applicable. We also describe several adornments to the circular shortest path algorithm that proved useful in applications. © 2011 IEEE.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Conference Paper|
|Keywords:||Circular shortest path, contour tracing, droplet detection, graph algorithms, Hessiann matrix, image analysis, image constraints, matrix, Algorithms, Linear programming, Wireless sensor networks, Graph theory|
|Divisions:||Current > Schools > School of Electrical Engineering & Computer Science
Current > QUT Faculties and Divisions > Science & Engineering Faculty
|Deposited On:||07 Jan 2015 03:15|
|Last Modified:||19 Jan 2015 05:05|
Repository Staff Only: item control page