GPCA: An efficient dimension reduction scheme for image compression and retrieval

KDD-2004 - Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2004, Pages 354-363

  Ye, Jieping ^a   Janardan, Ravi ^a   Li, Qi ^b  

^a UNIVERSITY OF MINNESOTA   (United States)

^b UNIVERSITY OF DELAWARE   (United States)

Author keywords

Dimension reduction; Image compression; Principal Component Analysis; Singular Value Decomposition; Tensor product; Vector space

Indexed keywords

DIMENSION REDUCTION; GENERALIZED PRINCIPAL COMPONENT ANALYSIS (GPCA); SINGULAR VALUE DECOMPOSITION (SVD); TENSOR PRODUCT; VECTOR SPACE;

COMPUTATIONAL METHODS; DATA ACQUISITION; DIGITAL IMAGE STORAGE; IMAGE COMPRESSION; IMAGE QUALITY; PRINCIPAL COMPONENT ANALYSIS; QUERY LANGUAGES; VECTORS;

IMAGE RETRIEVAL;

EID: 12244299439     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. D. Achlioptas and F. McSherry. Fast computation of low rank matrix approximations. In ACM STOC Conference Proceedings, pages 611-618, 2001.
2. C. C. Aggarwal. On the effects of dimensionality reduction on high dimensional similarity search. In ACM PODS Conference Proceedings, Santa Barbara, California, USA, 2001.
3. C. C. Aggarwal. Hierarchical subspace sampling: A unified framework for high dimensional data reduction, selectivity estimation, and nearest neighbor search. In ACM SIGMOD Conference Proceedings, Madison, Wisconsin, USA, 2002.
4. P. Aigrain, H.J. Zhang, and D. Petkovic. Content-based representation and retrieval of visual media: A state-of-the-art review. Multimedia Tools and Applications, 3(3):179-202, 1996.
5. V. Castelli, A. Thomasian, and C.S. Li. CSVD: Clustering and singular value decomposition for approximate similarity searches in high dimensional space. IEEE TKDE, 15(3):671-685, 2003.
6. H. Cho, I.S. Dhillon, Y. Guan, and S. Sra. Minimum sum-squared residue co-clustering of gene expression data. In SIAM Data Mining Conference proceedings, pages 114-125, 2004.
7. P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay. Clustering in large graphs and matrices. In SODA Conference Proceedings, pages 291-299, 1999.
8. C. Faloutsos and K.I. Lin. FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In ACM SIGMOD Conference Proceedings, pages 163-174, San Jose, California, 1995.
9. A. Frieze, R. Kannan, and S. Vempala. Fast Monte-Carlo algorithms for finding low-rank approximations. In ACM FOCS Conference Proceedings, pages 370-378, 1998.
10. G. H. Golub and C. F. Van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, MD, USA, third edition, 1996.
11. H. Jin, B. C. Ooi, H. T. Shen, C. Yu, and A.Y. Zhou. An adaptive and efficient dimensionality reduction algorithm for high-dimensionality indexing. In ICDE Conference Proceedings, Bangalore, India, 2003.
12. I. T. Jolliffe. Principal Component Analysis. Springer-Verlag, New York, 1986.
13. R. Ng and A. Sedighian. Evaluating multi-dimensional indexing structures for images transformed by principal component analysis. In Proc. of the SPIE, number 2670, pages 50-61, 1994.
14. K. V. Ravi Kanth, D. Agrawal, A. E. Abbadi, and A. Singh. Dimensionality reduction for similarity searching in dynamic databases. In ACM SIGMOD Conference Proceedings, pages 166-176, 1998.
15. L. Sirovich and M. Kirby. Low-dimensional procedure for the characterization of human faces. Journal of Optical Society of America, 4(3):519-524, 1987.
16. M. Turk and A. Pentland. Eigenfaces for recognition. Journal of Cognitive Neuroscience, 3(1):71-86, 1991.
17. J. Ye. Generalized low rank approximations of matrices. In ICML Conference Proceedings, 2004.