Abstract
Categorical classification for real-world images is a typical problem in the field of computer vision. This task is extremely easy for a human due to our visual cortex systems. However, developing a similarity recognition model for computer is still a difficult issue. Although numerous approaches have been proposed for solving the tough issue, little attention is given to the pixel-wise techniques for recognition and classification. In this paper, we present an innovative method for recognizing real-world images based on pixel matching between images. A method called two-dimensional continuous dynamic programming (2DCDP) is adopted to optimally capture the corresponding pixels within nonlinearly matched areas in an input image and a reference image representing an object without advance segmentation procedure. Direction pattern (a set of scalar patterns based on quantization of vector angles) is made by using a vector field constructed by the matching pixels between a reference image and an input image. Finally, the category of the test image is deemed to be that which has the strongest correlation with the orientation patterns of the input image and its reference image. Experimental results show that the proposed method achieves a competitive and robust performance on the Caltech 101 image dataset.
Original language | English |
---|---|
Pages (from-to) | 256-268 |
Number of pages | 13 |
Journal | Journal of Computer and System Sciences |
Volume | 79 |
Issue number | 2 |
DOIs | |
Publication status | Published - Mar 2013 |
Externally published | Yes |
Keywords
- Categorical classification
- Direction pattern
- Full pixel matching
- Segmentation-free
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Networks and Communications
- Computational Theory and Mathematics
- Applied Mathematics