Matrix factorizations for reversible integer implementation of orthonormal M-band wavelet transforms
Signal Processing - Special section: Advances in signal processing-assisted cross-layer designs
Letters: A block cipher based on chaotic neural networks
Neurocomputing
Infinity-norm rotation transforms
IEEE Transactions on Signal Processing
Reversible resampling of integer signals
IEEE Transactions on Signal Processing
A hybrid M-channel filter bank and DCT framework for H.264/AVC intra coding
Multimedia Tools and Applications
Improved reversible integer-to-integer color transforms
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Stabilization and optimization of PLUS factorization and its application in image coding
Journal of Visual Communication and Image Representation
Integer KLT design space exploration for hyperspectral satellite image compression
ICHIT'11 Proceedings of the 5th international conference on Convergence and hybrid information technology
Selective image encryption based on pixels of interest and singular value decomposition
Digital Signal Processing
High capacity reversible data hiding scheme based upon discrete cosine transformation
Journal of Systems and Software
IScIDE'11 Proceedings of the Second Sino-foreign-interchange conference on Intelligent Science and Intelligent Data Engineering
A data hiding scheme based upon DCT coefficient modification
Computer Standards & Interfaces
Hi-index | 35.69 |
Reversible integer mapping is essential for lossless source coding by transformation. A general matrix factorization theory for reversible integer mapping of invertible linear transforms is developed. Concepts of the integer factor and the elementary reversible matrix (ERM) for integer mapping are introduced, and two forms of ERM-triangular ERM (TERM) and single-row ERM (SERM)-are studied. We prove that there exist some approaches to factorize a matrix into TERMs or SERMs if the transform is invertible and in a finite-dimensional space. The advantages of the integer implementations of an invertible linear transform are (i) mapping integers to integers, (ii) perfect reconstruction, and (iii) in-place calculation. We find that besides a possible permutation matrix, the TERM factorization of an N-by-N nonsingular matrix has at most three TERMs, and its SERM factorization has at most N+1 SERMs. The elementary structure of ERM transforms is the ladder structure. An executable factorization algorithm is also presented. Then, the computational complexity is compared, and some optimization approaches are proposed. The error bounds of the integer implementations are estimated as well. Finally, three ERM factorization examples of DFT, DCT, and DWT are given