Abstract
This paper proposes a new, efficient, figure from ground discrimination method. This algorithm is based on the assumption that background data features can be more easily detected than figure data features, thus emphasizing the background detection task (and implying the name of the method). Along the iterative labeling process, data features are sequentially and permanently labeled as “background,” while more global information is being collected to assist with the coming decisions, until the process converges. This procedure creates a bootstrap mechanism which improves performance in very cluttered scenes. The method can be applied to many perceptual grouping cues, and an application to smoothness-based classification of edge points is given. A fast implementation using a kd-tree allows one to work on large, realistic images.
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.