Robust sparse hashing

Proceedings - International Conference on Image Processing, ICIP

Volumn , Issue , 2012, Pages 2417-2420

  Cherian, Anoop ^a   Morellas, Vassilios ^a   Papanikolopoulos, Nikolaos ^a  

^a University of Minnesota   (United States)

Author keywords

Nearest neighbors; Robust optimization; Sparse coding

Indexed keywords

DESCRIPTORS; DICTIONARY LEARNING; NEAREST NEIGHBORS; NEW APPROACHES; NOISE-TOLERANT; QUERY POINTS; ROBUST OPTIMIZATION; SCALE INVARIANT FEATURE TRANSFORMS; SPARSE CODES; SPARSE CODING; UNCERTAIN DATAS;

IMAGE PROCESSING;

QUERY PROCESSING;

EID: 84875865475     PISSN: 15224880     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIP.2012.6467385     Document Type: Conference Paper

References (8)

1. P. Indyk and R. Motwani, "Approximate nearest neighbors: towards removing the curse of dimensionality," Proc. of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 604-613, 1998.
2. M. Elad and M. Aharon, "Image denoising via learned dictionaries and sparse representation," Computer Vision and Pattern Recognition, vol. 1, pp. 895-900, 2006.
3. I. Ramirez, F. Lecumberry, and G. Sapiro, "Universal priors for sparse modeling," in Workshop on Comp. Adv. in Multi-Sensor Adaptive Processing, 2009, pp. 197-200.
4. A. Cherian, S. Sra, and N. Papanikolopoulos, "Denoising Sparse Noise via Online Dictionary Learning," in Intl. Conf. on Acoustics Speech and Signal Processing, 2011.
5. C. Caraminis, H. Xu, and S. Mannor, Optmization for Machine Learning, chapter Robust Optimization in Machine Learning, MIT Press, 2011.
6. S.P. Boyd and L. Vandenberghe, Convex optimization, Cambridge Univ Pr, 2004.
7. M. Rojas, S.A. Santos, and D.C. Sorensen, "LSTRS: Matlab software for large-scale trust-region subproblems and regularization," ACM Trans. Math. Software, vol. 34, no. 2, pp. 11, 2008.
8. H Jegou, M Douze, and C Schmid, "Product quantization for nearest neighbor search," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 1, pp. 117-128, 2011.