Pattern recognition using Hilbert space

Ying Liu

doi:10.1117/12.131517

1 November 1992 Pattern recognition using Hilbert space

Ying Liu

Proceedings Volume 1825, Intelligent Robots and Computer Vision XI: Algorithms, Techniques, and Active Vision; (1992) https://doi.org/10.1117/12.131517
Event: Applications in Optical Science and Engineering, 1992, Boston, MA, United States

Abstract

In this paper, we develop a new learning approach, the Hilbert learning. This approach is similar to Fractal learning, but the Fractal part is replaced by Hilbert space. Like the Fractal learning, the first stage is to encode an image to a small vector in the internal space of a learning system. The next stage is to quantize the internal parameter space. The internal space of a Hilbert learning system is defined as follows: A pattern can be interpreted as a representation of a vector in a Hilbert space. Any vectors in a Hilbert space can be expanded. If a vector happens to be in a subspace of a Hilbert space where the dimension L of the subspace is low (order of 10), the vector can be specified by its norm, an L-vector, and the Hermitian operator which spans the Hilbert space. This establishes a mapping from an image space to the internal space P. This mapping converts an input image to a 4-tuple: t (epsilon) P equals (Norm, T, N, L-vector), where T is an operator parameter space, N is a set of integers which specifies the boundary condition. The encoding is implemented by mapping an input pattern into a point in its internal space. We assume that a system uses local search algorithm, i.e., the system adjusts its internal data locally. The search is first conducted for an operator in a parameter space of operators, then an error function (delta) (t) is computed. The algorithm stops at a local minimum of (delta) (t). Finally, the input training set divides the internal space by a quantization procedure.

Citation Download Citation

Ying Liu "Pattern recognition using Hilbert space", Proc. SPIE 1825, Intelligent Robots and Computer Vision XI: Algorithms, Techniques, and Active Vision, (1 November 1992); https://doi.org/10.1117/12.131517

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
15 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Fractal analysis

Computer vision technology

Machine vision

Robot vision

Robots

Space operations

Computer programming

Show All Keywords

Keywords/Phrases

Search In:

Publication Years