TY - GEN
T1 - Bundling centre for landmark image discovery
AU - Zhang, Qian
AU - Qiu, Guoping
N1 - Publisher Copyright:
© Copyright 2015 ACM.
PY - 2015/6/22
Y1 - 2015/6/22
N2 - This paper introduces a novel method to efficiently discover/cluster landmark images in large image collection. We consider each cluster as a combination of several sub-clusters, which is composed of images taken from different view points of the 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). We therefore start the image discovery/clustering 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 min-hash based method to build a sparse graph so as to avoid the time-consuming full-scale exhaustive pairwise image matching. Based on the information provided by the sparse graph, BCs are identified as local dense neighbors sharing high intra-similarity. We have also proposed a weighted voting method to efficiently grow these BCs with high accuracy. More importantly, the fixed local centres can ensure each sub-cluster contains identical landmark and generate result 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 quantization. We present experimental results on two landmark datasets and show that, without query expansion, our method can boost landmark image discovery/clustering performances of state of the art techniques.
AB - This paper introduces a novel method to efficiently discover/cluster landmark images in large image collection. We consider each cluster as a combination of several sub-clusters, which is composed of images taken from different view points of the 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). We therefore start the image discovery/clustering 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 min-hash based method to build a sparse graph so as to avoid the time-consuming full-scale exhaustive pairwise image matching. Based on the information provided by the sparse graph, BCs are identified as local dense neighbors sharing high intra-similarity. We have also proposed a weighted voting method to efficiently grow these BCs with high accuracy. More importantly, the fixed local centres can ensure each sub-cluster contains identical landmark and generate result 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 quantization. We present experimental results on two landmark datasets and show that, without query expansion, our method can boost landmark image discovery/clustering performances of state of the art techniques.
KW - Landmark image discovery
KW - Min-hash
KW - Sparse matching graph
UR - http://www.scopus.com/inward/record.url?scp=84962339734&partnerID=8YFLogxK
U2 - 10.1145/2671188.2749295
DO - 10.1145/2671188.2749295
M3 - Conference contribution
AN - SCOPUS:84962339734
T3 - ICMR 2015 - Proceedings of the 2015 ACM International Conference on Multimedia Retrieval
SP - 179
EP - 186
BT - ICMR 2015 - Proceedings of the 2015 ACM International Conference on Multimedia Retrieval
PB - Association for Computing Machinery, Inc
T2 - 5th ACM International Conference on Multimedia Retrieval, ICMR 2015
Y2 - 23 June 2015 through 26 June 2015
ER -