ACM Home Page
Please provide us with feedback. Feedback
Coevolutionary feature synthesized EM algorithm for image retrieval
Full text PdfPdf (709 KB)
Source International Multimedia Conference archive
Proceedings of the 13th annual ACM international conference on Multimedia table of contents
Hilton, Singapore
SESSION: Content 4: image analysis and retrieval table of contents
Pages: 696 - 705  
Year of Publication: 2005
ISBN:1-59593-044-2
Authors
Rui Li  University of California, Riverside, CA
Bir Bhanu  University of California, Riverside, CA
Anlei Dong  University of California, Riverside, CA
Sponsors
ACM: Association for Computing Machinery
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 35,   Citation Count: 2
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/1101149.1101304
What is a DOI?

ABSTRACT

As a commonly used unsupervised learning algorithm in Content-Based Image Retrieval (CBIR), Expectation-Maximization (EM) algorithm has several limitations, especially in high dimensional feature spaces where the data are limited and the computational cost varies exponentially with the number of feature dimensions. Moreover, the convergence is guaranteed only at a local maximum. In this paper, we propose a unified framework of a novel learning approach, namely Coevolutionary Feature Synthesized Expectation-Maximization (CFS-EM), to achieve satisfactory learning in spite of these difficulties. The CFS-EM is a hybrid of coevolutionary genetic programming (CGP) and EM algorithm. The advantages of CFS-EM are: 1) it synthesizes low-dimensional features based on CGP algorithm, which yields near optimal nonlinear transformation and classification precision comparable to kernel methods such as the support vector machine (SVM); 2) the explicitness of feature transformation is especially suitable for image retrieval because the images can be searched in the synthesized low-dimensional space, while kernel-based methods have to make classification computation in the original high-dimensional space; 3) the unlabeled data can be boosted with the help of the class distribution learning using CGP feature synthesis approach. Experimental results show that CFS-EM outperforms pure EM and CGP alone, and is comparable to SVM in the sense of classification. It is computationally more efficient than SVM in query phase. Moreover, it has a high likelihood that it will jump out of a local maximum to provide near optimal results and a better estimation of parameters.


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
T. Hertz, N. Shental, A. Bar-Hillel and D. Weinshall, "Enhancing image and video retrieval: learning via equivalence constraint," IEEE Conf. on CVPR, pp. 668--674, 2003.
 
5
Q. Tian, J. Yu, Q. Xue and N. Sebe, "A new analysis of the value of unlabeled data in semi-supervised learning for image retrieval," ICME, 2004.
 
6
 
7
 
8
 
9
10
 
11
P. Wu, B. S. Manjunath, and H. D. Shin, "Dimensionality reduction for image search and retrieval," Proc. Int Conf. Image Processing, 2000.
 
12
D. D. Lee and H. S. Seung, "Learning the parts of objects by non-negative matrix factorization," Nature, vol. 401, pp. 788--791, 1999.
 
13
S. Z. Li, X.W. Hou, H.J. Zhang and Q.S. Cheng, "Learning spatially localized, parts-based representation," IEEE Conf. on CVPR, pp. 207--212, 2001.
14
 
15
 
16
 
17
A. Torralba, K.P. Murphy and W.T. Freeman, "Sharing features: efficient boosting procedures for multiclass," IEEE Conf. on CVPR pp. 762--769, 2004.
 
18
19
 
20
 
21
A. Dempster, N. Laird, and D. Rubin, "Maximum Likelihood Estimation from Incomplete Data Via the EM algorithm," J. Royal Statistical Soc. B, vol.39, pp.1--38, 1977.
 
22
G. McLachlan and D. Peel, Finite Mixture Models. New York John Wiley & Sons, 1997.
 
23
 
24
 
25
X.S. Zhou, Y. Rui, and T.S. Huang, Exploration of Visual Data, Kluwer Academic Publishers, 2003.
 
26
 
27
A.E. Eiben, R. Hinterding, and Z. Michalewicz, "Parameter control in evolutionary algorithms", IEEE Transactions on Evolutionary Computation, 3(2): 124--141, 1999.
 
28