ACM Home Page
Please provide us with feedback. Feedback
Leveraging user query log: toward improving image data clustering
Full text PdfPdf (374 KB)
Source
Conference On Image And Video Retrieval archive
Proceedings of the 2008 international conference on Content-based image and video retrieval table of contents
Niagara Falls, Canada
SESSION: Tagging, training and classification table of contents
Pages 27-36  
Year of Publication: 2008
ISBN:978-1-60558-070-8
Authors
Hao Cheng  University of Central Florida, Orlando, FL, USA
Kien A. Hua  University of Central Florida, Orlando, FL, USA
Khanh Vu  University of Central Florida, Orlando, FL, USA
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 122,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1386352.1386360
What is a DOI?

ABSTRACT

Image clustering is useful in many retrieval and classification applications. The main goal of image clustering is to partition a given dataset into salient clusters such that the images in each cluster appear visually similar to each other compared with those in other clusters. In this paper, we propose a semi-supervised clustering algorithm, which leverages the accumulated user query log to guide the clustering process. Guided by the log file, our method arranges images into small groups and constructs a graph that captures the dissimilar relations between the groups. Each group is assigned to a feasible cluster. Our analysis reveals that the probability of image points being assigned to the correct clusters is much higher by our new proposal, compared to conventional methods. Our algorithm can produce image clusters close to the ground truth and satisfying the semantic relations between the images inferred from the query log. Experimental results further confirm the superiority of our design.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
 
5
S. Aksoy and R. M. Haralick. Graph-theoretic clustering for image grouping and retrieval. In Conference on Computer Vision and Pattern Recognition, CVPR '99, pages 1063--, 1999.
 
6
 
7
8
 
9
Y. Chen, J. Z. Wang, and R. Krovetz. Clue: cluster-based retrieval of images by unsupervised learning. IEEE Transactions on Image Processing, 14(8):1187--1201, 2005.
 
10
 
11
I. Davidson and S. S. Ravi. Clustering with constraints: Feasibility issues and the k-means algorithm. In SDM '05: SIAM International Conference on Data Mining, 2005.
 
12
I. Davidson and S. S. Ravi. Identifying and generating easy sets of constraints for clustering. In Proceedings, The Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence Conference, 2006.
13
14
 
15
C. Elkan. Using the triangle inequality to accelerate K-Means. In Machine Learning, Proceedings of the Twentieth International Conference (ICML 2003), pages 147--153, 2003.
 
16
J. Goldberger, S. Gordon, and H. Greenspan. Unsupervised image-set clustering using an information theoretic framework. IEEE Transactions on Image Processing, 15(2):449--458, 2006.
17
 
18
 
19
20
 
21
E. T. Jaynes. Probability Theory: The Logic of Science. Cambridge University Press, 2003.
 
22
 
23
 
24
R. M. Neal and G. E. Hinton. A view of the EM algorithm that justifies incremental, sparse, and other variants. pages 355--368, 1999.
 
25
W. M. Rand. Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association, 66:622--626, 1971.
 
26
S. T. Roweis and L. K. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500):2323--2326, December 2000.
 
27
Y. Rui, T. Huang, M. Ortega, and S. Mehrotra. Relevance feedback: a power tool for interactive content-based image retrieval. Circuits and Systems for Video Technology, IEEE Transactions on, 8(5):644--655, Sep 1998.
 
28
N. Shental, A. Bar-Hillel, and D. W. Tomer Hertz. Computing gaussian mixture models with EM using equivalence constraints. In NIPS '03: Advances in Neural Information Processing Systems, 2003.
 
29
 
30
J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319--2323, December 2000.
 
31
K. Vu, H. Cheng, and K. Hua. Image retrieval in multipoint queries. International Journal of Imaging Systems and Technology, Special Issue on Multimedia Information Retrieval, To appear.
 
32
K. Wagstaff, S. Basu, and I. Davidson. When is constrained clustering beneficial, and why?. In AAAI'06: Proceedings, The Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence Conference, 2006.
 
33
 
34
 
35
Y. Wu, Q. Tian, and T. S. Huang. Discriminant-EM algorithm with application to image retrieval. In 2000 Conference on Computer Vision and Pattern Recognition (CVPR 2000), pages 1222--1227, 2000.
 
36
M.-C. Yeh, I.-H. Lee, G. Wu, Y. Wu, and E. Y. Chang. Manifold learning, a promised land or work in progress? In Proceedings of the 2005 IEEE International Conference on Multimedia and Expo, ICME 2005, pages 1154--1157, 2005.
 
37
38
39


Collaborative Colleagues:
Hao Cheng: colleagues
Kien A. Hua: colleagues
Khanh Vu: colleagues