Quantized embeddings of scale-invariant image features for mobile augmented reality

2012 IEEE 14th International Workshop on Multimedia Signal Processing, MMSP 2012 - Proceedings

Volumn , Issue , 2012, Pages 1-6

  Li, Mu ^a   Rane, Shantanu ^b   Boufounos, Petros ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b MITSUBISHI ELECTRIC RESEARCH LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUGMENTED REALITY APPLICATIONS; BIT ALLOCATION SCHEME; BIT RATE CONSTRAINT; DATA-BASE SERVERS; EMBEDDINGS; EXPERIMENTAL STUDIES; IMAGE FEATURES; MOBILE AUGMENTED REALITY; NEAREST NEIGHBOR SEARCH; QUANTIZATION SCHEMES; QUERY IMAGES; RANDOM MEASUREMENT; RANDOM PROJECTIONS; RETRIEVAL ACCURACY; SCALE-INVARIANT; THEORETICAL RESULT;

AUGMENTED REALITY; COMMERCE; DATABASE SYSTEMS; MOBILE DEVICES; MULTIMEDIA SIGNAL PROCESSING; QUERY PROCESSING;

IMAGE RETRIEVAL;

EID: 84870584808     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MMSP.2012.6343406     Document Type: Conference Paper

References (24)

1. D. G. Lowe, "Distinctive image features from scale-invariant keypoints," International Journal of Computer Vision, vol. 60, pp. 91-110, 2004.
2. H. Bay, A. Ess, T. Tuytelaars, and L. V. Gool, "Speeded-up robust features (SURF)," Computer Vision and Image Understanding, vol. 110, no. 3, pp. 346-359, 2008.
3. A. Oliva and A. Torralba, "Modeling the shape of the scene: A holistic representation of the spatial envelope," International Journal of Computer Vision, vol. 42, pp. 145-175, 2001.
4. J. Sivic and A. Zisserman, "Efficient visual search of videos cast as text retrieval," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 31, no. 4, pp. 591-606, Apr. 2009.
5. K. Mikolajczyk and C. Schmid, "A performance evaluation of local descriptors," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 10, pp. 1615-1630, Oct. 2005.
6. A. Torralba, R. Fergus, and Y. Weiss, "Small codes and large image databases for recognition," in Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on, Jun. 2008, pp. 1-8.
7. Y. Weiss, A. Torralba, and R. Fergus, "Spectral hashing," in Advances in Neural Information Processing Systems 21, D. Koller, D. Schuurmans, Y. Bengio, and L. Bottou, Eds., 2009, pp. 1753-1760.
8. H. Jegou, F. Perronnin, M. Douze, J. Sanchez, P. Perez, and C. Schmid, "Aggregating local images descriptors into compact codes," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. PP, no. 99, p. 1, 2011.
9. C. Yeo, P. Ahammad, and K. Ramchandran, "Coding of image feature descriptors for distributed rate-efficient visual correspondences," International Journal of Computer Vision, vol. 94, pp. 267-281, 2011, 10.1007/s11263-011-0427-1.
10. C. Strecha, A. Bronstein, M. Bronstein, and P. Fua, "LDAHash: Improved matching with smaller descriptors," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 34, no. 1, pp. 66-78, Jan. 2012.
11. V. Chandrasekhar, G. Takacs, D. Chen, S. Tsai, Y. Reznik, R. Grzeszczuk, and B. Girod, "Compressed histogram of gradients: A low-bitrate descriptor," International Journal of Computer Vision, vol. 96, pp. 384-399, 2012.
12. A. Andoni and P. Indyk, "Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions," Commun. ACM, vol. 51, no. 1, pp. 117-122, Jan. 2008.
13. C. Yeo, P. Ahammad, and K. Ramchandran, "Rate-efficient visual correspondences using random projections," in IEEE International Conference on Image Processing, Oct. 2008, pp. 217-220.
14. K. Min, L. Yang, J. Wright, L. Wu, X.-S. Hua, and Y. Ma, "Compact projection: Simple and efficient near neighbor search with practical memory requirements," in Computer Vision and Pattern Recognition (CVPR), 2010 IEEE Conference on, Jun. 2010, pp. 3477-3484.
15. W. Johnson and J. Lindenstrauss, "Extensions of Lipschitz mappings into a Hilbert space," Contemporary Mathematics, vol. 26, pp. 189-206, 1984.
16. S. Dasgupta and A. Gupta, "An elementary proof of a theorem of Johnson and Lindenstrauss," Random Structures & Algorithms, vol. 22, no. 1, pp. 60-65, 2003.
17. P. Indyk and R. Motwani, "Approximate nearest neighbors: towards removing the curse of dimensionality," in ACM Symposium on Theory of computing, 1998, pp. 604-613.
18. D. Achlioptas, "Database-friendly Random Projections: Johnsonlindenstrauss With Binary Coins," Journal of Computer and System Sciences, vol. 66, pp. 671-687, 2003.
19. J. N. Laska, P. T. Boufounos, M. A. Davenport, and R. G. Baraniuk, "Democracy in action: Quantization, saturation, and compressive sensing," Applied and Computational Harmonic Analysis, vol. 31, no. 3, pp. 429-443, Nov. 2011.
20. Y. Plan and R. Vershynin, "One-bit compressed sensing by linear programming," Arxiv preprint arXiv:1109.4299, 2011.
21. -, "Dimension reduction by random hyperplane tessellations," Arxiv preprint arXiv:1111.4452, 2011.
22. L. Jacques, J. N. Laska, P. T. Boufounos, and R. G. Baraniuk, "Robust 1-bit compressive sensing via binary stable embeddings of sparse vectors," Arxiv preprint arXiv:1104.3160, Apr. 2011.
23. H. Shao, T. Svoboda, and L. V. Gool, "ZuBuD: Zurich Buildings database for image based recognition," Computer Vision Lab, Swiss Federal Institute of Technology, Switzerland, Tech. Rep. 260, Apr. 2003. [Online]. Available: http://www.vision.ee.ethz.ch/showroom/zubud/
24. S. Lloyd, "Least squares quantization in PCM," Information Theory, IEEE Transactions on, vol. 28, no. 2, pp. 129-137, Mar. 1982.