Search

High-order data are modeled using matrices whose entries are numerical arrays of a fixed size. These arrays, called t-scalars, form a commutative ring under the convolution product. Matrices with elements in the ring of t-scalars are referred to as t-matrices. The t-matrices can be scaled, added and multiplied in the usual way. There are t-matrix generalizations of positive matrices, orthogonal matrices and Hermitian symmetric matrices. With the t-matrix model, it is possible to generalize many well-known matrix algorithms. In particular, the t-matrices are used to generalize the singular value decomposition (SVD), high-order SVD (HOSVD), principal component analysis (PCA), two-dimensional PCA (2DPCA) and Grassmannian component analysis (GCA). The generalized t-matrix algorithms, namely TSVD, THOSVD, TPCA, T2DPCA and TGCA, are applied to low-rank approximation, reconstruction and supervised classification of images. Experiments show that the t-matrix algorithms compare favorably with standard matrix algorithms. [ABSTRACT FROM AUTHOR]

Visible and infrared image registration is required for multi-sensor fusion and cooperative processing. However, traditional single-sensor image registration methods are generally not feasible as multi-sensor images are often loosely related and show different properties in imaging. This paper presents a coarse-to-fine procedure for registering visible and infrared images based on stable region features and edginess. Zernike moments are used to describe salient region features for a coarse registration, and an entropy optimal process based on edginess is used to refine the registration to achieve a more accurate result. Experiments show that the proposed method provides more robust and accurate registration than the existing methods. [ABSTRACT FROM AUTHOR]