Dong-Qing Zhang
ABSTRACT
Detecting Image Near-Duplicate (IND) is an important problem in a variety of applications, such as copyright infringement detection and multimedia linking. Traditional image similarity models are often difficult to identify IND due to their inability to capture scene composition and semantics. We present a part-based image similarity measure derived from stochastic matching of Attributed Relational Graphs that represent the compositional parts and part relations of image scenes. Such a similarity model is fundamentally different from traditional approaches using low-level features or image alignment. The advantage of this model is its ability to accommodate spatial attributed relations and support supervised and unsupervised learning from training data. The experiments compare the presented model with several prior similarity models, such as color histogram, local edge descriptor, etc. The presented model outperforms the prior approaches with large margin.
- http://www-nlpir.nist.gov/projects/trecvid/. Web site 2004.Google Scholar
- J. Allan, J. Carbonell, G. Doddington, J. Yamron, and Y. Yang. Topic detection and tracking pilot study: Final report. In Proceedings of the DARPA Broadcast News Transcription and Understanding Workshop, 1998. 1998.Google Scholar
- E. Chang, J. Wang, C. Li, and G. Wiederhold. Rime: A replicated image detector for the world wide web. In Proceedings of SPIE Mulimedia Storage and Archiving Systems III IEEE, Nov. 1998.Google ScholarCross Ref
- S.-K. Chang. Principles of pictorial information systems design Prentice-Hall,Inc., 1989. Google ScholarDigital Library
- R. Fergus, P. Perona, and A. Zisserman. Object class recognition by unsupervised scale-invariant learning. In Proceedings of the IEEE Computer Vision and Pattern Recognition Conference pages 66--73. IEEE, 2003.Google ScholarCross Ref
- A. Hampapur. Comparison of distance measures for video copy detection. In Proceedings of ICME 2001 pages 188--192. IEEE, August 2001.Google ScholarCross Ref
- H. G. Barrow and R. Popplestone. Relational descriptions in picture processing. Machine Intelligence 6:377--396, 1971.Google Scholar
- A. Jaimes. Conceptual structures and computational methods for indexing and organization of visual information. Ph.D. Thesis, Department of Electrical Engineering, Columbia University February 2003. Google ScholarDigital Library
- N. Jojic, N. Petrovic, and T. Huang. Scene generative models for adaptive video fast forward. In International Conference on Image Processing (ICIP), Barcelona, Spain, 2003 IEEE, 2003.Google ScholarCross Ref
- C.-Y. Lin, B.L. Tseng, M. Naphade, A. Natsev, and J. R. Smith. Videoal: A novel end-to-end mpeg-7 automatic labeling system. In IEEE Intl. Conf. on Image Processing (ICIP) IEEE, September 2003.Google Scholar
- R. C. Wilson and E. R. Hancock. Structual matching by discrete relaxation.IEEE Trans. Pattern Anal. Mach. Intell. 19:1--2, 1997. Google ScholarDigital Library
- J. R. Smith, M. Naphade, and A. Natsev. Multimedia semantic indexing using model vectors. In IEEE Intl. Conf. on Multimedia and Expo (ICME) IEEE, 2003. Google ScholarDigital Library
- J. Shi and J. Malik. Self inducing relational distance and its application to image segmentation. Lecture Notes in Computer Science 1406:528, 1998. Google ScholarDigital Library
- J. R. Smith and C.-S. Li. Image classi cation and querying using composite region templates. Journal of Computer Vision and Image Understanding 2000. Google ScholarDigital Library
- S. Smith. A new class of corner finder. In Proc. 3rd British Machine Vision Conference pages 139--148, 1992.Google ScholarCross Ref
- J. S. Yedidia and W. T. Freeman. Understanding belief propagation and its generalizations. In Exploring Artificial Intelligence in the New Millennium pages Chap. 8, pp.239--236, January 2003. Google ScholarDigital Library
- D.-Q. Zhang and S.-F. Chang. Stochastic attributed relational graph matching for image near-duplicate detection. DVMM Techinical Report, Dept. of E. E., Columbia University July 2004.Google Scholar
Index Terms
- Detecting image near-duplicate by stochastic attributed relational graph matching with learning
Recommendations
Variable-Length Signature for Near-Duplicate Image Matching
We propose a variable-length signature for near-duplicate image matching in this paper. An image is represented by a signature, the length of which varies with respect to the number of patches in the image. A new visual descriptor, viz., probabilistic ...
Near-duplicate keyframe retrieval by semi-supervised learning and nonrigid image matching
Near-duplicate keyframe (NDK) retrieval techniques are critical to many real-world multimedia applications. Over the last few years, we have witnessed a surge of attention on studying near-duplicate image/keyframe retrieval in the multimedia community. ...
Region-Based Near-Duplicate Image Retrieval with Geometric Consistency
ACPR '13: Proceedings of the 2013 2nd IAPR Asian Conference on Pattern RecognitionState-of-the-art near-duplicate image retrieval systems take the image as a whole by the bag-of-words (BOW) representation. Feature quantization on large image database always reduces the discriminative power of image features, and the global BOW ...
Comments