Home /Research /Subspace methods for robot vision
OTHER

Subspace methods for robot vision

Shree K. Nayar, S.A. Nene, Hiroshi Murase

Year
1996
Citations
206

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

Computer visionArtificial intelligenceWorkspaceSubspace topologyComputer scienceRobotEye trackingProjection (relational algebra)Machine visionMathematics

Related papers

Browse all OTHER papers