Sparse recovery for earth mover distance

2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

Volumn , Issue , 2010, Pages 1742-1744

  Gupta, Rishi ^a   Indyk, Piotr ^a   Price, Eric ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EARTH MOVER DISTANCES; EMPIRICAL EVALUATIONS; SPARSE APPROXIMATIONS; SPARSE RECOVERY;

RECOVERY;

EID: 79952387974     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2010.5707127     Document Type: Conference Paper

References (23)

1. R. G. Baraniuk, V. Cevher, M. F. Duarte, and C. Hegde. Model-based compressive sensing. IEEE Transactions on Information Theory, 56, No. 4:1982-2001, 2010.
2. R. Berinde, A. Gilbert, P. Indyk, H. Karloff, and M. Strauss. Combining geometry and combinatorics: a unified approach to sparse signal recovery. Allerton, 2008.
3. R. Berinde and P. Indyk. Sequential sparse matching pursuit. Allerton, 2009.
4. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. ICALP, 2002.
5. M. Charikar. Similarity estimation techniques from rounding. In STOC, pages 380-388, 2002.
6. G. Cormode and S. Muthukrishnan. Improved data stream summaries: The count-min sketch and its applications. Latin, 2004.
7. G. Cormode and S. Muthukrishnan. Combinatorial algorithms for compressed sensing. Sirocco, 2006.
8. E. J. Candès, J. Romberg, and T. Tao. Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure Appl. Math., 59(8):1208-1223, 2006.
9. M. Duarte, M. Davenport, D. Takhar, J. Laska, T. Sun, K. Kelly, and R. Baraniuk. Single-pixel imaging via compressive sampling. IEEE Signal Processing Magazine, 2008.
10. K. Do Ba, P. Indyk, E. Price, and D. Woodruff. Lower bounds for sparse recovery. SODA, 2010.
11. D. L. Donoho. Compressed Sensing. IEEE Trans. Info. Theory, 52(4):1289-1306, Apr. 2006.
12. S. Foucart, A. Pajor, H. Rauhut, and T. Ullrich. The gelfand widths of lp-balls for 0 < p ≤ 1. preprint, 2010.
13. G. Frahling and C. Sohler. Coresets in dynamic geometric data streams. STOC, 2005.
14. K. Grauman and T. Darrell. The pyramid match kernel: Discriminative classification with sets of image features. ICCV, 2005.
15. A. Gilbert and P. Indyk. Sparse recovery using sparse matrices. Proceedings of IEEE, 2010.
16. P. Indyk. Algorithms for dynamic geometric problems over data streams. STOC, 2004.
17. P. Indyk. Sketching, streaming and sublinear-space algorithms. Graduate course notes, available at http://stellar.mit.edu/S/course/6/fa07/6.895/, 2007.
18. P. Indyk and N. Thaper. Fast color image retrieval via embeddings. Workshop on Statistical and Computational Theories of Vision (at ICCV), 2003.
19. D. Lowe. Distinctive image features from scale-invariant keypoints. International Journal of Computer Vision, 60(2):91-110, 2004.
20. S. Lyu. Mercel kernels for object recognition with local features. CVPR, 2005.
21. S. Muthukrishnan. Data streams: Algorithms and applications (invited talk at soda'03). Available at http://athos.rutgers.edu/~muthu/stream-1-1.ps, 2003.
22. J. Romberg. Compressive sampling by random convolution. SIAM Journal on Imaging Science, 2009.
23. Y. Rubner, C. Tomasi, and L. Guibas. The earth mover's distance as a metric for image retrieval. International Journal of Computer Vision, 40(2):99-121, 2000. (Pubitemid 32136368)