RETRO (vipl) functions


LIBRARY ROUTINE

llrfclass - Localized Receptive Field Classifier

LIBRARY CALL

int llrfclass (
	xvimage *image,
	xvimage *cc_img,
	xvimage *var_img,
	xvimage *wt_img,
	xvimage **class_img,
	int border)

INPUT

OUTPUT

RETURN VALUE

TRUE (1) on success, FALSE (0) on failure

DESCRIPTION

lrfclass classifies an image using the Localized Receptive Field classifier (LRF). The Localized Receptive Field (LRF) is based on a single layer of self-organizing, "localized receptive field" units, followed by a single layer perceptron. The single layer of perceptron units use the LMS or Adaline learning rule to adjust the weights. The weights are adjusted or "trained" using the companion program, "lrftrain". After training the weights, using the "lrftrain" program, a number of similar images may be quickly classified with this program based on the training data set.

LRF network theory

The basic network model of the LRF consists of a two layer topology. The first layer of "receptive field" nodes are trained using a clustering algorithm, such as K-means, or some other algorithm which can determine the receptive field centers. Each node in the first layer computes a receptive field response function, which should approach zero as the distance from the center of the receptive field is increased. The second layer of the LRF model sums the weighted outputs of the first layer, which produces the output or response of the network. A supervised LMS rule is used to train the weights of the second layer nodes. The response function of the LRF network is formulated as follows:

f(x) = SUM(Ti * Ri(x))

where,

Ri(x) = Q( ||x - xi|| / Wi )

x - is a real valued vector in the input space, Ri - is the ith receptive field response function, Q - is a radially symmetric functio with a single maximum at the origin, decreasing to zero at large radii, xi - is the center of the ith receptive field, Wi - is the width of the ith receptive field, Ti - is the weight associated with each receptive field

The receptive field response functions ( Ri(x) ), should be formulated such that they decrease rapidly with increasing radii. This ensures that the response functions provide highly localized representations of the input space. The response function used in this algorithm is modeled after the gaussian, and uses the trace of the covariance matrix to set the widths of the receptive field centers.

The number of receptive field response nodes in the first layer of the LRF is determined by the number of cluster centers in the "cluster center" image. The number of output classes, and hence the number of output nodes in the second (ie. last) layer of the LRF, is determined by the number of desired classes that was specified in the "supervised" classification phase of the clustering. This information is contained in the last band of the cluster center image. The number of weights in the network is determined by the number of receptive field response nodes and the number of output nodes. That is,

#Wts = (#rf_response_nodes * #output_nodes) + #output_nodes

The resulting output image is classified with the desired number of classes specified in the last band of the "cluster center" (-i2) image. The number of desired classes corresponds to the number of output nodes in the last layer of the LRF network. This classified image is of data storage type INTEGER.

This routine was written with the help of and ideas from Dr. Don Hush, University of New Mexico, Dept. of EECE.

ADDITIONAL INFORMATION

none

EXAMPLES

none

SIDE EFFECTS

none

RESTRICTIONS

All input images MUST be of data storage type FLOAT. The resulting classified image (-o) is of data storage type INTEGER.

MODIFICATION

none

FILES

$RETRO/objects/library/vipl/src/llrfclass.c

SEE ALSO

vipl(3)

COPYRIGHT

Copyright (C) 1993 - 1997, Khoral Research, Inc. ("KRI") All rights reserved.