z-logo
open-access-imgOpen Access
Sparse Patch-Histograms for Object Classification in Cluttered Images
Author(s) -
Thomas Deselaers,
Andre Hegerath,
Daniel Keysers,
Hermann Ney
Publication year - 2006
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-44412-2
DOI - 10.1007/11861898_21
Subject(s) - computer science , artificial intelligence , histogram , object (grammar) , pattern recognition (psychology) , computer vision , cognitive neuroscience of visual object recognition , set (abstract data type) , object detection , bin , contrast (vision) , position (finance) , image (mathematics) , algorithm , finance , economics , programming language
We present a novel model for object recognition and detection that follows the widely adopted assumption that objects in images can be represented as a set of loosely coupled parts. In contrast to former models, the presented method can cope with an arbitrary number of object parts. Here, the object parts are modelled by image patches that are extracted at each position and then efficiently stored in a histogram. In addition to the patch appearance, the positions of the extracted patches are considered and provide a significant increase in the recognition performance. Additionally, a new and efficient histogram comparison method taking into account inter-bin similarities is proposed. The presented method is evaluated for the task of radiograph recognition where it achieves the best result published so far. Furthermore it yields very competitive results for the commonly used Caltech object detection tasks.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom