Random projection and orthonormality for lossy image compression

There exist many lossy image compression techniques, some of which are based on dimensionality reduction. In this paper, a method for lossy image compression is introduced which utilizes the dimensionality reduction technique known as Random Projection. Random Projection has proven itself as an effective technique for reducing the dimensionality of data, particularly when dimensionality d is moderately high (e.g., d<1500). Image columns or rows are treated as vectors in feature space which are thereby reduced in size to a user specified dimension k where [email protected]?d. The condition of orthonormality is utilized thereby establishing a technique applicable to image compression. Although the compression is lossy, experiments indicate that the recovered image is effectively restored. Visual data is shown in the form of comparison between original and recovered image. Quantitative data includes the compression ratio achieved, the peak signal-to-noise ratio, and the root mean square error.

[1]  Stephen A. Martucci,et al.  Symmetric convolution and the discrete sine and cosine transforms , 1993, IEEE Trans. Signal Process..

[2]  Shen-Chuan Tai,et al.  Medical image compression by discrete cosine transform spectral similarity strategy , 2001, IEEE Transactions on Information Technology in Biomedicine.

[3]  R. Hartley.  A More Symmetrical Fourier Analysis Applied to Transmission Problems , 1942, Proceedings of the IRE.

[4]  William H. Press,et al.  Numerical recipes in C. The art of scientific computing , 1987 .

[5]  M. M. Anguh,et al.  A Truncation method for computing slant transforms with applications to image processing , 1995, IEEE Trans. Commun..

[6]  I. Hacihaliloglu,et al.  DCT and DWT based image compression in remote sensing images , 2004, IEEE Antennas and Propagation Society Symposium, 2004..

[7]  M. J. Narasimha,et al.  On the Computation of the Discrete Cosine Transform , 1978, IEEE Trans. Commun..

[8]  Douglas L. Jones,et al.  On computing the discrete Hartley transform , 1985, IEEE Trans. Acoust. Speech Signal Process..

[9]  Alain Mérigot,et al.  Global discrete cosine transform for image compression , 2001, Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467).

[10]  P. W. Jones,et al.  Digital Image Compression Techniques , 1991 .

[11]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[12]  Tor A. Ramstad,et al.  Hybrid KLT-SVD image compression , 1997, 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[13]  B. Noble.  Applied Linear Algebra , 1969 .

[14]  Piotr Indyk,et al.  Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[15]  R. Bracewell.  Discrete Hartley transform , 1983 .

[16]  Santosh S. Vempala,et al.  An algorithmic theory of learning: Robust concepts and random projection , 1999, Machine Learning.

[17]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[18]  Tamara G. Kolda,et al.  A semidiscrete matrix decomposition for latent semantic indexing information retrieval , 1998, TOIS.

[19]  Wojciech Szpankowski,et al.  Semi-discrete matrix transforms (SDD) for image and video compression , 2002, Proceedings DCC 2002. Data Compression Conference.

[20]  B. J. Falkowski,et al.  Transformation kernels and algorithms for the generation of forward and inverse Hadamard ordered multi-polarity generalized Walsh transforms , 1994, Proceedings of 1994 37th Midwest Symposium on Circuits and Systems.

[21]  Hao Chen,et al.  Hyperspectral image data unsupervised classification using Gauss-Markov random fields and PCA principle , 2002, IEEE International Geoscience and Remote Sensing Symposium.

[22]  K. R. Rao,et al.  A Fast Computational Algorithm for the Discrete Sine Transform , 1980, IEEE Trans. Commun..

[23]  Naoki Saito,et al.  The polyharmonic local sine transform: A new tool for local image analysis and synthesis without edge effect☆ , 2006 .

[24]  Milan Sonka,et al.  Image Processing, Analysis and Machine Vision , 1993, Springer US.

[25]  Heikki Mannila,et al.  Random projection in dimensionality reduction: applications to image and text data , 2001, KDD '01.

[26]  Samuel Kaski,et al.  Dimensionality reduction by random mapping: fast similarity computation for clustering , 1998, 1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227).

[27]  Peter Frankl,et al.  The Johnson-Lindenstrauss lemma and the sphericity of some graphs , 1987, J. Comb. Theory B.

[28]  Gerald Kaiser,et al.  The fast Haar transform , 1998 .

[29]  J. L. Crowley,et al.  Robust tracking and compression for video communication , 1999, Proceedings International Workshop on Recognition, Analysis, and Tracking of Faces and Gestures in Real-Time Systems. In Conjunction with ICCV'99 (Cat. No.PR00378).

[30]  I. Daubechies.  Orthonormal bases of compactly supported wavelets , 1988 .

[31]  Mei Tian,et al.  An investigation into using singular value decomposition as a method of image compression , 2005, 2005 International Conference on Machine Learning and Cybernetics.

[32]  Jacek M. Zurada,et al.  Computational Intelligence: Imitating Life , 1994 .

[33]  Dan Roth,et al.  On generalization bounds, projection profile, and margin distribution , 2002, ICML.

[34]  Dimitris Achlioptas,et al.  Database-friendly random projections , 2001, PODS.

[35]  Sanjoy Dasgupta,et al.  Experiments with Random Projection , 2000, UAI.

[36]  Chulhee Lee,et al.  Principal component analysis with pre-emphasis for compression of hyperspectral imagery , 2005, Proceedings. 2005 IEEE International Geoscience and Remote Sensing Symposium, 2005. IGARSS '05..