Foveated object recognition by corner search

Here we describe a gray scale object recognition system based on foveated corner finding, the computation of sequential fixation points, and elements of Lowe’s SIFT transform. The system achieves rotational, transformational, and limited scale invariant object recognition that produces recognition d...

Full description

Bibliographic Details
Main Author: Arnow, Thomas Louis, 1946-
Format: Others
Language:English
Published: 2008
Subjects:
Online Access:http://hdl.handle.net/2152/3981
id ndltd-UTEXAS-oai-repositories.lib.utexas.edu-2152-3981
record_format oai_dc
spelling ndltd-UTEXAS-oai-repositories.lib.utexas.edu-2152-39812015-09-20T16:53:05ZFoveated object recognition by corner searchArnow, Thomas Louis, 1946-Computer visionPattern recognition systemsImage processingHere we describe a gray scale object recognition system based on foveated corner finding, the computation of sequential fixation points, and elements of Lowe’s SIFT transform. The system achieves rotational, transformational, and limited scale invariant object recognition that produces recognition decisions using data extracted from sequential fixation points. It is broken into two logical steps. The first is to develop principles of foveated visual search and automated fixation selection to accomplish corner search. The result is a new algorithm for finding corners which is also a corner-based algorithm for aiming computed foveated visual fixations. In the algorithm, long saccades move the fovea to previously unexplored areas of the image, while short saccades improve the accuracy of putative corner locations. The system is tested on two natural scenes. As an interesting comparison study we compare fixations generated by the algorithm with those of subjects viewing the same images, whose eye movements are being recorded by an eyetracker. The comparison of fixation patterns is made using an information-theoretic measure. Results show that the algorithm is a good locator of corners, but does not correlate particularly well with human visual fixations. The second step is to use the corners located, which meet certain goodness criteria, as keypoints in a modified version of the SIFT algorithm. Two scales are implemented. This implementation creates a database of SIFT features of known objects. To recognize an unknown object, a corner is located and a feature vector created. The feature vector is compared with those in the database of known objects. The process is continued for each corner in the unknown object until enough information has been accumulated to reach a decision. The system was tested on 78 gray scale objects, hand tools and airplanes, and shown to perform well.text2008-08-29T00:23:43Z2008-08-29T00:23:43Z2008-052008-08-29T00:23:43ZThesiselectronicb70705392http://hdl.handle.net/2152/3981244295068engCopyright is held by the author. Presentation of this material on the Libraries' web site by University Libraries, The University of Texas at Austin was made possible under a limited license grant from the author who has retained all copyrights in the works.
collection NDLTD
language English
format Others
sources NDLTD
topic Computer vision
Pattern recognition systems
Image processing
spellingShingle Computer vision
Pattern recognition systems
Image processing
Arnow, Thomas Louis, 1946-
Foveated object recognition by corner search
description Here we describe a gray scale object recognition system based on foveated corner finding, the computation of sequential fixation points, and elements of Lowe’s SIFT transform. The system achieves rotational, transformational, and limited scale invariant object recognition that produces recognition decisions using data extracted from sequential fixation points. It is broken into two logical steps. The first is to develop principles of foveated visual search and automated fixation selection to accomplish corner search. The result is a new algorithm for finding corners which is also a corner-based algorithm for aiming computed foveated visual fixations. In the algorithm, long saccades move the fovea to previously unexplored areas of the image, while short saccades improve the accuracy of putative corner locations. The system is tested on two natural scenes. As an interesting comparison study we compare fixations generated by the algorithm with those of subjects viewing the same images, whose eye movements are being recorded by an eyetracker. The comparison of fixation patterns is made using an information-theoretic measure. Results show that the algorithm is a good locator of corners, but does not correlate particularly well with human visual fixations. The second step is to use the corners located, which meet certain goodness criteria, as keypoints in a modified version of the SIFT algorithm. Two scales are implemented. This implementation creates a database of SIFT features of known objects. To recognize an unknown object, a corner is located and a feature vector created. The feature vector is compared with those in the database of known objects. The process is continued for each corner in the unknown object until enough information has been accumulated to reach a decision. The system was tested on 78 gray scale objects, hand tools and airplanes, and shown to perform well. === text
author Arnow, Thomas Louis, 1946-
author_facet Arnow, Thomas Louis, 1946-
author_sort Arnow, Thomas Louis, 1946-
title Foveated object recognition by corner search
title_short Foveated object recognition by corner search
title_full Foveated object recognition by corner search
title_fullStr Foveated object recognition by corner search
title_full_unstemmed Foveated object recognition by corner search
title_sort foveated object recognition by corner search
publishDate 2008
url http://hdl.handle.net/2152/3981
work_keys_str_mv AT arnowthomaslouis1946 foveatedobjectrecognitionbycornersearch
_version_ 1716820679864614912