Distributed Representation of Geometrically Correlated Images with Compressed Linear Measurements

This paper addresses the problem of distributed coding of images whose correlation is driven by the motion of objects or positioning of the vision sensors. It concentrates on the problem where images are encoded with compressed linear measurements. We propose a geometry-based correlation model in order to describe the common information in pairs of images. We assume that the constitutive components of natural images can be captured by visual features that undergo local transformations (e.g., translation) in different images. We first identify prominent visual features by computing a sparse approximation of a reference image with a dictionary of geometric basis functions. We then pose a regularized optimization problem to estimate the corresponding features in correlated images given by quantized linear measurements. The estimated features have to comply with the compressed information and to represent consistent transformation between images. The correlation model is given by the relative geometric transformations between corresponding features. We then propose an efficient joint decoding algorithm that estimates the compressed images such that they stay consistent with both the quantized measurements and the correlation model. Experimental results show that the proposed algorithm effectively estimates the correlation between images in multi-view datasets. In addition, the proposed algorithm provides effective decoding performance that compares advantageously to independent coding solutions as well as state-of-the-art distributed coding schemes based on disparity learning

An assessment of technology alternatives for telecommunications and information management for the space exploration initiative

On the 20th anniversary of the Apollo 11 lunar landing, President Bush set forth ambitious goals for expanding human presence in the solar system. The Space Exploration Initiative (SEI) addresses these goals beginning with Space Station Freedom, followed by a permanent return to the Moon, and a manned mission to Mars. A well designed, adaptive Telecommunications, Navigation, and Information Management (TNIM) infrastructure is vital to the success of these missions. Utilizing initial projections of user requirements, a team under the direction of NASA's Office of Space Operations developed overall architectures and point designs to implement the TNIM functions for the Lunar and Mars mission scenarios. Based on these designs, an assessment of technology alternatives for the telecommunications and information management functions was performed. This technology assessment identifies technology developments necessary to meet the telecommunications and information management system requirements for SEI. Technology requirements, technology needs and alternatives, the present level of technology readiness in each area, and a schedule for development are presented

Vector Quantization of True-Color Images

Vector quantization (VQ) has recently emerged as a powerful and efficient technique for digital speech and image coding. The goal of such a process is data compression: to minimize communication channel capacity or digital storage memory requirements while maintaining an acceptable fidelity level of the data. A review of various VQ algorithms and their respective design considerations as applied to color images is given. Fidelity measurements and signal-to-noise ratio calculations are discussed. A modified mean-residual vector quantizer using the LBG design algorithm with color signal preprocessing is described. The algorithm is developed to yield a bit rate of 0.709 bits per pixel per color with the goal of easy implementation even using a simple microcomputer . Photographic and numeric results of original versus compressed-uncompressed color images are presented. Several modifications to the described algorithm are tested with good results

Self Designing Pattern Recognition System Employing Multistage Classification

Recently, pattern recognition/classification has received a considerable attention in diverse engineering fields such as biomedical imaging, speaker identification, fingerprint recognition, etc. In most of these applications, it is desirable to maintain the classification accuracy in the presence of corrupted and/or incomplete data. The quality of a given classification technique is measured by the computational complexity, execution time of algorithms, and the number of patterns that can be classified correctly despite any distortion. Some classification techniques that are introduced in the literature are described in Chapter one. In this dissertation, a pattern recognition approach that can be designed to have evolutionary learning by developing the features and selecting the criteria that are best suited for the recognition problem under consideration is proposed. Chapter two presents some of the features used in developing the set of criteria employed by the system to recognize different types of signals. It also presents some of the preprocessing techniques used by the system. The system operates in two modes, namely, the learning (training) mode, and the running mode. In the learning mode, the original and preprocessed signals are projected into different transform domains. The technique automatically tests many criteria over the range of parameters for each criterion. A large number of criteria are developed from the features extracted from these domains. The optimum set of criteria, satisfying specific conditions, is selected. This set of criteria is employed by the system to recognize the original or noisy signals in the running mode. The modes of operation and the classification structures employed by the system are described in details in Chapter three. The proposed pattern recognition system is capable of recognizing an enormously large number of patterns by virtue of the fact that it analyzes the signal in different domains and explores the distinguishing characteristics in each of these domains. In other words, this approach uses available information and extracts more characteristics from the signals, for classification purposes, by projecting the signal in different domains. Some experimental results are given in Chapter four showing the effect of using mathematical transforms in conjunction with preprocessing techniques on the classification accuracy. A comparison between some of the classification approaches, in terms of classification rate in case of distortion, is also given. A sample of experimental implementations is presented in chapter 5 and chapter 6 to illustrate the performance of the proposed pattern recognition system. Preliminary results given confirm the superior performance of the proposed technique relative to the single transform neural network and multi-input neural network approaches for image classification in the presence of additive noise

Information-Theoretic Multiclass Classification Based on Binary Classifiers: On Coding Matrix Design, Reliability and Maximum Number of Classes

In this paper, we consider the multiclass classification problem based on sets of independent binary classifiers. Each binary classifier represents the output of a quantized projection of training data onto a randomly generated orthonormal basis vector thus producing a binary label. The ensemble of all binary labels forms an analogue of a coding matrix. The properties of such kind of matrices and their impact on the maximum number of uniquely distinguishable classes are analyzed in this paper from an information-theoretic point of view. We also consider a concept of reliability for such kind of coding matrix generation that can be an alternative to other adaptive training techniques and investigate the impact on the bit error probability. We demonstrate that it is equivalent to the considered random coding matrix without any bit reliability information in terms of recognition rat