Abstract
We consider a method for computing skeletal representations based on the average outward flux through a shrinking region, of the gradient of the Euclidean distance function to the object’s boundary. We show how the original method, developed by Dimitrov et al. (Proceedings of the IEEE conference on computer vision and pattern recognition, vol. 1, pp. 835–841, 2003) can be used to exploit a relationship between the average outward flux and the object angle at endpoints, branch points and regular points of the skeleton to reconstruct the boundary. Using this method, new measures for skeletal branch simplification are proposed based on two criteria: the uniqueness of an inscribed disk to a branch, and the average outward flux value. The simplified skeleton when abstracted as a directed graph is shown to be less complex than popular skeletal graphs in the literature, such as the shock graph, by several graph complexity measures, with little loss in representation power. We conclude the chapter by applying the simplified graph to a view-based object recognition experiment previously arranged for shock graphs. The results suggest that our new simplified graph yields recognition scores very close to shock graphs but with a smaller number of nodes, edges, and skeletal points.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.