Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 684615, 7 pages
http://dx.doi.org/10.1155/2013/684615
Research Article

Content-Based Image Retrial Based on Hadoop

School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510000, China

Received 9 July 2013; Accepted 22 August 2013

Academic Editor: Ming Li

Copyright © 2013 DongSheng Yin and DeBo Liu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. W. Niblack, R. Barber, W. Equitz et al., “QBIC project: querying images by content, using color, texture, and shape,” in Storage and Retrieval for Image and Video Databases, pp. 173–187, February 1993. View at Google Scholar · View at Scopus
  2. D. G. Lowe, “Distinctive image features from scale-invariant keypoints,” International Journal of Computer Vision, vol. 60, no. 2, pp. 91–110, 2004. View at Publisher · View at Google Scholar · View at Scopus
  3. Y. Ke and R. Sukthankar, “PCA-SIFT: a more distinctive representation for local image descriptors,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '04), pp. II506–II513, July 2004. View at Scopus
  4. M. Grabner, H. Grabner, and H. Bischof, “Fast Approximated SIFT,” in Proceedings of the Asian Conference on Computer Vision, pp. 918–927, Hyderabad, India, 2006.
  5. B. Smith, “An approach to graphs of linear forms,” unpublished.
  6. H. Bay, A. Ess, T. Tuytelaars, and L. Van Gool, “Speeded-Up Robust Features (SURF),” Computer Vision and Image Understanding, vol. 110, no. 3, pp. 346–359, 2008. View at Publisher · View at Google Scholar · View at Scopus
  7. T. White, Hadoop: The Definitive Guide, O'Reilly Media, 2009.
  8. A. Gionis, P. Indyk, and R. Motwani, “Similarity search in high dimension via hashing,” in Proceedings of the International Conference on Very Large Databases, 1999.
  9. P. Indyk and R. Motwani, “Approximate nearest neighbors: towards removing the curse of dimensionality,” in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 604–613, Dallas, Tex, USA, May 1998. View at Scopus
  10. A. Andoni and P. Indyk, “E2LSH_0. 1 User Manual,” June 2005.
  11. J. Yang, M. Li, Z. Chen, and Y. Chen, “Cutting affine moment invariants,” Mathematical Problems in Engineering, vol. 2012, Article ID 928161, 12 pages, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. J. Yang, G. Chen, and M. Li, “Extraction of affine invariant features using fractal,” Advances in Mathematical Physics, vol. 2013, Article ID 950289, 8 pages, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH