A Confidence Ranked Co-Occurrence Approach for Accurate Object Recognition in Highly Complex Scenes

Angın, Pelin
Bhargava, Bharat
Real-time and accurate classification of objects in highly complex scenes is an important problem for the Computer Vision community due to its many application areas. While boosting methods with the sliding window approach provide fast processing and accurate results for particular object categories, they cannot achieve the desired performance for more involved categories of objects. Recent research in Computer Vision has shown that exploiting object context through relational dependencies between object categories leads to improved accuracy in object recognition. While efforts in collective classification in images have resulted in complex algorithms suitable for offline processing, the real-time nature of the problem requires the use of simpler algorithms. In this paper, we propose a simple iterative algorithm for collective classification of all objects in an image, exploiting the global co-occurrence frequencies of object categories. The proposed algorithm uses multiple detectors trained using Gentle Boosting, where the category of the most confident estimate is propagated through the co-occurrence relations to determine the categories of the remaining unclassified objects. Experiments on a real-world dataset demonstrate the superiority of our approach over using Gentle Boosting alone as well as classic collective classification approaches modeling the full joint distribution for each object in the scene.