Feature extraction using random walks

Proceedings - 2009 IEEE Youth Conference on Information, Computing and Telecommunication, YC-ICT2009

Volumn , Issue , 2009, Pages 498-501

  Deng, Yue ^a   Dai, Qionghai ^a   Zhang, Zengke ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Commute time; Random walk; Spectral graphic; Subspace learning

Indexed keywords

EUCLIDEAN; FEATURE EXTRACTION ALGORITHMS; PHYSICAL MODEL; RANDOM WALK; SUBSPACE LEARNING;

FACE RECOGNITION; TIME DOMAIN ANALYSIS;

FEATURE EXTRACTION;

EID: 77950892752     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/YCICT.2009.5382449     Document Type: Conference Paper

References (9)

1. Richard O. Duda, Pattern Classification (2nd ed.), 1997.
2. AM Martłnez and AC Kak, "Pca versus lda," IEEE Transactions on Pattern Analysis and machine Intelligence, 2001.
3. S. Rosenberg, "The laplacian on a riemmannian and manifold," 1997.
4. H. Xiaofei, Y. Shuicheng, H. Yuxiao, P. Niyogi, and Z. Hong-Jiang, "Face recognition using laplacianfaces," IEEE Transactions on Pattern Analysis and machine Intelligence, 2005.
5. M Belkin and P Niyogi, "Laplacian eigenmaps and spectral techniques for embedding and clustering," Advances in Neural Information Processing Systems, 2001.
6. Q. Huaijun and E. R. Hancock, "Clustering and embedding using commute times," IEEE Transactions on Pattern Analysis and machine Intelligence, 2007.
7. S Yan, D Xu, B Zhang, and HJ Zhang, "Graph embedding: A general framework for dimensionality reduction," IEEE Transactions on Pattern Analysis and machine Intelligence, 2007.
8. BJ Frey and D Dueck, "Clustering by passing messages between data points," Science, 2007.
9. Prasad Tetail, "Random walks and the effective resistance of networks," Journal of Theoritical Probability, vol.4, no.1, pp. 101-109, 1991.