DocumentCode
1386374
Title
Subspace methods for robot vision
Author
Nayar, Shree K. ; Nene, Sameer A. ; Murase, Hiroshi
Author_Institution
Dept. of Comput. Sci., Columbia Univ., New York, NY, USA
Volume
12
Issue
5
fYear
1996
fDate
10/1/1996 12:00:00 AM
Firstpage
750
Lastpage
758
Abstract
In contrast to the traditional approach, visual recognition is formulated as one of matching appearance rather than shape. For any given robot vision task, all possible appearance variations define its visual workspace. A set of images is obtained by coarsely sampling the workspace. The image set is compressed to obtain a low-dimensional subspace, called the eigenspace, in which the visual workspace is represented as a continuous appearance manifold. Given an unknown input image, the recognition system first projects the image to eigenspace. The parameters of the vision task are recognized based on the exact location of the projection on the appearance manifold. An efficient algorithm for finding the closest manifold point is described. The proposed appearance representation has several applications in robot vision. As examples, a precise visual positioning system, a real-time visual tracking system, and a real-time temporal inspection system are described
Keywords
data compression; eigenvalues and eigenfunctions; image coding; image recognition; robot vision; appearance variations; continuous appearance manifold; eigenspace; image set compression; low-dimensional subspace; precise visual positioning system; real-time temporal inspection system; real-time visual tracking system; robot vision; subspace methods; visual recognition; Brightness; Computer science; Feedback; Image recognition; Inspection; Intelligent robots; Real time systems; Robot vision systems; Robotics and automation; Shape;
fLanguage
English
Journal_Title
Robotics and Automation, IEEE Transactions on
Publisher
ieee
ISSN
1042-296X
Type
jour
DOI
10.1109/70.538979
Filename
538979
Link To Document