Automatic target recognition using a feature-decomposition and data-decomposition modular neural network.

A modular neural network classifier has been applied to the problem of automatic target recognition using forward-looking infrared (FLIR) imagery. The classifier consists of several independently trained neural networks. Each neural network makes a decision based on local features extracted from a specific portion of a target image. The classification decisions of the individual networks are combined to determine the final classification. Experiments show that decomposition of the input features results in performance superior to a fully connected network in terms of both network complexity and probability of classification. Performance of the classifier is further improved by the use of multiresolution features and by the introduction of a higher level neural network on the top of the individual networks, a method known as stacked generalization. In addition to feature decomposition, we implemented a data-decomposition classifier network and demonstrated improved performance. Experimental results are reported on a large set of real FLIR images.

A modular neural network vector predictor for predictive image coding.

In this paper, we present a modular neural network vector predictor that improves the predictive component of a predictive vector quantization (PVQ) scheme. The proposed vector prediction technique consists of five dedicated predictors (experts), where each expert predictor is optimized for a particular class of input vectors. An input vector is classified into one of five classes, based on its directional variances. One expert predictor is optimized for stationary blocks, and each of the other four expert predictors are optimized to predict horizontal, vertical, 45 degrees , and 135 degrees diagonally oriented edge-blocks, respectively. An integrating unit is then used to select or combine the outputs of the experts in order to form the final output of the modular network. Therefore, no side information is transmitted to the receiver about the selected predictor or the integration of the predictors. Experimental results show that the proposed scheme gives an improvement of 1.7 dB over a single multilayer perceptron (MLP) predictor. Furthermore, if the information about the predictor selection is sent to the receiver, the improvement could be up to 3 dB over a single MLP predictor. The perceptual quality of the predicted images is also significantly improved.

Nonlinear vector prediction using feed-forward neural networks.

The performance of a classical linear vector predictor is limited by its ability to exploit only the linear correlation between the blocks. However, a nonlinear predictor exploits the higher order correlations among the neighboring blocks, and can predict edge blocks with increased accuracy. We have investigated several neural network architectures that can be used to implement a nonlinear vector predictor, including the multilayer perceptron (MLP), the functional link (FL) network, and the radial basis function (RBF) network. Our experimental results show that a neural network predictor can predict the blocks containing edges with a higher accuracy than a linear predictor.

Object recognition using multilayer Hopfield neural network.

An object recognition approach based on concurrent coarse-and-fine matching using a multilayer Hopfield neural network is presented. The proposed network consists of several cascaded single-layer Hopfield networks, each encoding object features at a distinct resolution, with bidirectional interconnections linking adjacent layers. The interconnection weights between nodes associating adjacent layers are structured to favor node pairs for which model translation and rotation, when viewed at the two corresponding resolutions, are consistent. This interlayer feedback feature of the algorithm reinforces the usual intralayer matching process in the conventional single-layer Hopfield network in order to compute the most consistent model-object match across several resolution levels. The performance of the algorithm is demonstrated for test images containing single objects, and multiple occluded objects. These results are compared with recognition results obtained using a single-layer Hopfield network.

Advances in residual vector quantization: a review.

Advances in residual vector quantization (RVQ) are surveyed. Definitions of joint encoder optimality and joint decoder optimality are discussed. Design techniques for RVQs with large numbers of stages and generally different encoder and decoder codebooks are elaborated and extended. Fixed-rate RVQs, and variable-rate RVQs that employ entropy coding are examined. Predictive and finite state RVQs designed and integrated into neural-network based source coding structures are revisited. Successive approximation RVQs that achieve embedded and refinable coding are reviewed. A new type of successive approximation RVQ that varies the instantaneous block rate by using different numbers of stages on different blocks is introduced and applied to image waveforms, and a scalar version of the new residual quantizer is applied to image subbands in an embedded wavelet transform coding system.

Scalar-vector quantization of medical images.

A new coding scheme based on the scalar-vector quantizer (SVQ) is developed for compression of medical images. The SVQ is a fixed rate encoder and its rate-distortion performance is close to that of optimal entropy-constrained scalar quantizers (ECSQs) for memoryless sources. The use of a fixed-rate quantizer is expected to eliminate some of the complexity of using variable-length scalar quantizers. When transmission of images over noisy channels is considered, our coding scheme does not suffer from error propagation that is typical of coding schemes using variable-length codes. For a set of magnetic resonance (MR) images, coding results obtained from SVQ and ECSQ at low bit rates are indistinguishable. Furthermore, our encoded images are perceptually indistinguishable from the original when displayed on a monitor. This makes our SVQ-based coder an attractive compression scheme for picture archiving and communication systems (PACS). PACS are currently under study for use in an all-digital radiology environment in hospitals, where reliable transmission, storage, and high fidelity reconstruction of images are desired.

Predictive residual vector quantization [image coding].

This paper presents a new vector quantization technique called predictive residual vector quantization (PRVQ). It combines the concepts of predictive vector quantization (PVQ) and residual vector quantization (RVQ) to implement a high performance VQ scheme with low search complexity. The proposed PRVQ consists of a vector predictor, designed by a multilayer perceptron, and an RVQ that is designed by a multilayer competitive neural network. A major task in our proposed PRVQ design is the joint optimization of the vector predictor and the RVQ codebooks. In order to achieve this, a new design based on the neural network learning algorithm is introduced. This technique is basically a nonlinear constrained optimization where each constituent component of the PRVQ scheme is optimized by minimizing an appropriate stage error function with a constraint on the overall error. This technique makes use of a Lagrangian formulation and iteratively solves a Lagrangian error function to obtain a locally optimal solution. This approach is then compared to a jointly designed and a closed-loop design approach. In the jointly designed approach, the predictor and quantizers are jointly optimized by minimizing only the overall error. In the closed-loop design, however, a predictor is first implemented; then the stage quantizers are optimized for this predictor in a stage-by-stage fashion. Simulation results show that the proposed PRVQ scheme outperforms the equivalent RVQ (operating at the same bit rate) and the unconstrained VQ by 2 and 1.7 dB, respectively. Furthermore, the proposed PRVQ outperforms the PVQ in the rate-distortion sense with significantly lower codebook search complexity.

Next-state functions for finite-state vector quantization.

The finite-state vector quantization scheme called dynamic finite-state vector quantization (DFSVQ) is investigated with regard to its subcodebook construction. In the DFSVQ, each input block is encoded by a small codebook called the subcodebook which is created from a much larger codebook called supercodebook. Each subcodebook is constructed by selecting, using a reordering procedure, a set of appropriate code-vectors from the supercodebook. The performance of the DFSVQ depends on this reordering procedure; therefore, several reordering procedures are introduced and their performance are evaluated. The reordering procedures investigated, are based on the conditional histogram of the code-vectors, index prediction, vector prediction, nearest neighbor design, and the frequency usage of the code-vectors. The performance of the reordering procedures are evaluated by comparing their hit ratios (the number of blocks encoded by the subcodebook) and their computational complexity. Experimental results are presented and it is found that the reordering procedure based on the vector prediction performs the best when compared with the other reordering procedures.

Hopfield network for stereo vision correspondence.

An optimization approach is used to solve the correspondence problem for a set of features extracted from a pair of stereo images. A cost function is defined to represent the constraints on the solution, which is then mapped onto a two-dimensional Hopfield neural network for minimization. Each neuron in the network represents a possible match between a feature in the left image and one in the right image. Correspondence is achieved by initializing (exciting) each neuron that represents a possible match and then allowing the network to settle down into a stable state. The network uses the initial inputs and the compatibility measures between the matched points to find a stable state.