Abstract
This paper presents an improvement over a previous contour closure algorithm. Assuming that edge points are given as input, the proposed approach consists of two steps. Similarly than the previous approach, the minimum spanning tree of a partially connected graph is initially computed. Then, a morphological filter removes noisy links and finally open contours are closed by minimizing a linking cost function. Advantages of the proposed technique lie in the lack of user defined thresholds and non-dependency of edge point density. Experimental results with synthetic and real range images are presented showing encouraging results with uniform and non-uniform edge points’ distribution.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
