Abstract
When recognizing partially visible objects in a scene, a good global decision should be made based on locally gathered features for their recognition, since global information is corrupted. This local to global nature of occlusion recognition leads us to spectral matching technique. Unfortunately, spectral matching algorithms are not desirable for noisy data set from cluttered scene. In this paper, a top-down procedure is introduced into spectral matching for the recognition of occluded objects. Based on the two-stage strategy, both appearance and geometric information are taken into consideration. It is shown that the improvement has been made for spectral algorithms to recognize occluded objects.
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.
