Abstract
This paper introduces a novel method to efficiently discover landmark images in large image collections. Each cluster is considered a combination of several sub-clusters, which are composed of images taken from different viewpoints of an identical landmark. For each sub-cluster, we find its local centre represented by a group of similar images and define it as the bundling centre (BC). Therefore, we start image discovery by identifying the BCs and accomplish the task by efficiently growing and merging those sub-clusters represented by different BCs. In our proposed method, we use a min-Hash-based method to build a sparse graph to avoid time-consuming, full-scale, exhaustive pairwise image matching. Based on the information provided by the sparse graph, BCs are identified as local dense neighbours sharing high intra-similarity. We have also proposed a weighted voting method to grow these BCs with high accuracy. More importantly, the fixed local centres ensure that each sub-cluster contains identical landmarks and generates results with high precision. In addition, compared to a single representative (iconic) image, the group of similar images obtained by each BC can provide more comprehensive cluster information and, thus, overcome the problem of low recall caused by information lost during visual word quantisation. We present the experimental results of three datasets and show that, without query expansion, our method can boost the landmark image discovery performances of current techniques.
Similar content being viewed by others
References
Avrithis Y, Kalantidis Y, Tolias G, Spyrou E (2010) Retrieving landmark and non-landmark images from community photo collections. In: Proceedings of the international conference on multimedia, MM ’10, p 153
Avrithis Y, Kalantidis Y, Tolias G, Spyrou E (2010) Retrieving landmark and non landmark images from community photo collections categories and subject descriptors. In: Proceedings of the international conference on multimedia, pp 153–162
Berg T, Berg A (2009) Finding iconic images. In: 2009 IEEE computer society conference on computer vision and pattern recognition workshops. IEEE, New York, pp 1–8
Cao Y, Wang C, Li Z, Zhang L, Zhang L (2010) Spatial-bag-of-features. In: CVPR. IEEE, New York, pp 3352–3359
Chum O, Matas J (2010) Large-scale discovery of spatially relatedimages. In: IEEE transactions on pattern analysis and machine intelligence, vol 32, pp 371–377
Chum O, Matas J, Kittler J (2003) Locally optimized RANSAC. In: DAGM, pp 236–243
Chum O, Perdoch M, Matas J (2009) Geometric min-Hashing: finding a ( thick ) needle in a haystack. In: CVPR, pp 17–24
Chum O, Philbin J, Sivic J, Isard M, Zisserman A (2007) Total recall: automatic query expansion with a generative feature model for object retrieval. In: ICCV, pp 1–8
Crandall D, Backstrom L, Huttenlocher D, Kleinberg J (2009) Mapping the world’s photos. In: 18th international conference on world wide web, pp 761–770
Gammeter S, Bossard L, Quack T, Gool LV (2009) I know what you did last summer: object-level auto-annotation of holiday snaps. In: ICCV. IEEE, New York, pp 614–621
Indyk P, Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. In: ACM symposium on theory of computing. ACM, New York, pp 604–613
Kennedy L, Naaman M, Ahern S, Nair R, Rattenbury T (2007) How flickr helps us make sense of the world. In: Proceedings of the 15th international conference on multimedia, MULTIMEDIA ’07, p 631
Lee DC, Ke Q, Isard M (2010) Partition min-hash for partial duplicate image discovery. In: ECCV
Li X, Wu C, Zach C, Lazebnik S, Frahm J (2008) Modeling and recognition of landmark image collections using iconic scene graphs. In: ECCV, pp 427–440
Liu H, Latecki L, Yan S (2010) Robust clustering as ensembles of affinity relations. In: NIPS, pp 1–9
Panoramio - Photos of the World. N.p., n.d. http://www.panoramio.com/map/#lt=54.570981&ln=-2.051696&z=11&k=2&a=1&tab=1&pl=all. Accessed 30 Mar 2015
Papadopoulos S, Zigkolis C, Kowmpatsiaris Y (2011) Cluster based landmark and event detection collections for tagged photo collection. IEEE Multimed 18(1):52–63
Philbin J (2008) Object mining using a matching graph on very large image collections. In: Indian conference on computer vision, graphics and image processing
Philbin J, Chum O, Isard M, Sivic J, Zisserman A (2008) Lost in quantization: improving particular object retrieval in large scale image databases. In CVPR. IEEE, New York, pp 1–8
Philbin J, Chum O, Isard M, Sivic J, Zisserman A (2007) Object retrieval with large vocabularies and fast spatial matching. In: Proceedings of the IEEE conference on computer vision and pattern recognition, 2007, Minneapolis, MN, 17–22 June 2007
Philbin J, Sivic J, Zisserman A (2010) Geometric latent Dirichlet allocation on a matching graph for large scale image datasets. Int J Comput Vis 95(2):138–153
Qiu G, Morris J, Fan X (2007) Visual guided navigation for image retrieval. Pattern Recognit 40(6):1711–1721
Quack T, Leibe B, Van Gool L (2008) World-scale mining of objects and events from community photo collections. In: CIVR. ACM Press, New York, p 47
Simon I, Snavely N, Seitz SM (2007) Scene summarization for online image collections. In: ICCV. IEEE, New York
Sivic J, Zisserman A (2003) Video Google: a text retrieval approach to object matching in videos. In: ICCV, vol 2, pp 1470—-1477
Wang X-J, Zhang L, Liu C (2013) Duplicate discovery on 2 billion internet images. In: 2013 IEEE conference on computer vision and pattern recognition workshops. IEEE, New York, pp 429–436
Weiss Y, Torralba A, Fergus R (2008) Spectral hashing. In: NIPS, no. 1, pp 1–8
Weyand T, Hosang J, Leibe B (2012) An evaluation of two automatic landmark building discovery algorithms for city reconstruction. Trends Topics Comput Vis 6554:310–323
Weyand T, Leibe B (2011) Discovering favorite views of popular places with iconoid shift. In: ICCV. IEEE, New York, pp 1132–1139
Yang C, Peng J, Fan J (2012) Image collection summarization via dictionary learning for sparse representation. In: CVPR. IEEE, New York, pp 1122–1129
Zhang Q, Fu H, Qiu G (2013) Tree partition voting min-hash for partial duplicate image discovery. In: IEEE international conference on multimedia and expo (ICME), pp 1–6
Zheng Y, Zhao M, Song Y, Adam H, Buddermeier U, Bissacco A, Brucher F, Chua T-S, Neven H (2009) Tour the world: building a web-scale landmark recognition engine. In: CVPR. IEEE, New York, pp 1085–1092
Zhong W, Ke Q, Isard M, Sun J (2009) Bundling features for large scale partial-duplicate web image search. In: CVPR. IEEE, New York, pp 25–32
Zhou W, Lu Y, Li H, Song Y, Tian Q (2010) Spatial coding for large scale partial-duplicate web image search. In: Proceedings of the international conference on multimedia, MM ’10. ACM Press, New York, p 511
Acknowledgments
This work is partially supported by Ningbo Science and Technology Bureau (Project No. 2012B10055 and 2013D10008) and by the International Doctoral Innovation Centre (IDIC) at the University of Nottingham Ningbo China.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, Q., Qiu, G. Bundling centre for landmark image discovery. Int J Multimed Info Retr 5, 35–50 (2016). https://doi.org/10.1007/s13735-015-0091-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13735-015-0091-2