Welcome to the InfoSci Platform
Reference Hub6
Content-Based Multimedia Retrieval Using Feature Correlation Clustering and Fusion

Content-Based Multimedia Retrieval Using Feature Correlation Clustering and Fusion

Hsin-Yu Ha, Fausto C. Fleites, Shu-Ching Chen
Copyright: © 2013 |Volume: 4 |Issue: 2 |Pages: 19
ISSN: 1947-8534|EISSN: 1947-8542|EISBN13: 9781466632202|DOI: 10.4018/jmdem.2013040103
Cite Article Cite Article

MLA

Ha, Hsin-Yu, et al. "Content-Based Multimedia Retrieval Using Feature Correlation Clustering and Fusion." IJMDEM vol.4, no.2 2013: pp.46-64. http://doi.org/10.4018/jmdem.2013040103

APA

Ha, H., Fleites, F. C., & Chen, S. (2013). Content-Based Multimedia Retrieval Using Feature Correlation Clustering and Fusion. International Journal of Multimedia Data Engineering and Management (IJMDEM), 4(2), 46-64. http://doi.org/10.4018/jmdem.2013040103

Chicago

Ha, Hsin-Yu, Fausto C. Fleites, and Shu-Ching Chen. "Content-Based Multimedia Retrieval Using Feature Correlation Clustering and Fusion," International Journal of Multimedia Data Engineering and Management (IJMDEM) 4, no.2: 46-64. http://doi.org/10.4018/jmdem.2013040103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Nowadays, only processing visual features is not enough for multimedia semantic retrieval due to the complexity of multimedia data, which usually involve a variety of modalities, e.g. graphics, text, speech, video, etc. It becomes crucial to fully utilize the correlation between each feature and the target concept, the feature correlation within modalities, and the feature correlation across modalities. In this paper, the authors propose a Feature Correlation Clustering-based Multi-Modality Fusion Framework (FCC-MMF) for multimedia semantic retrieval. Features from different modalities are combined into one feature set with the same representation via a normalization and discretization process. Within and across modalities, multiple correspondence analysis is utilized to obtain the correlation between feature-value pairs, which are then projected onto the two principal components. K-medoids algorithm, which is a widely used partitioned clustering algorithm, is selected to minimize the Euclidean distance within the resulted clusters and produce high intra-correlated feature-value pair clusters. Majority vote is applied to subsequently decide which cluster each feature belongs to. Once the feature clusters are formed, one classifier is built and trained for each cluster. The correlation and confidence of each classifier are considered while fusing the classification scores, and mean average precision is used to evaluate the final ranked classification scores. Finally, the proposed framework is applied on NUS-wide Lite data set to demonstrate the effectiveness in multimedia semantic retrieval.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.