170 likes | 194 Views
This study introduces an adaptive tree similarity learning approach for image retrieval, combining text-based and content-based methods. Results show promising performance on a dataset of 17,000 heterogeneous images. The proposed scheme offers a simple implementation with fast convergence rate.
E N D
Adaptive tree similarity learning for image retrieval Source: ACM Multimedia Systems Journal (Springer), vol.9(2), Aug., 2003, pp.131-143 Author: Tao Wang, Yong Rui, Shi-min Hu, Jia-guang Sun Speaker: Yen-Chang Chiu Date: 2005/05/12
Outline • Introduction • Related work • Proposed scheme • Experimental Result • Conclusions
Introduction (1/2) • Image retrieval • Text-based image retrieval • Keyword (by human) • Content-based image retrieval (CBIR) • Features extraction (by computer): color, texture, shape, …
Related work (1/3) • I: number of feature M: number of image in DB • i-th feature vector of m-th image • i-th feature vector of the query image q • Difference feature vector between m and q
Related work (2/3) • Distance between m and q in terms of i-th feature where Wi is the low-level weights matrix of i-th feature vector • Overall distance between n and q where ui is high-level weights
Related work (3/3) • Convert between distance and similarity
Proposed method (1/5) • Relevance feedback techniques: • Learning mechanism Adaptive-filter based on LMS • Similarity model tree similarity model
Proposed method (5/5) • π*(n) : overall similarity between query image and image n SR: pattern set of relevant image SN: pettern set of irrelevant image
Experimental Result (1/4) • Test data set:『Corel』 image collection • Includes 17000 images • Heterogeneous (wide variety) • Queries: randomly generated 400 queries • Visual features: • Color moments • wavelet-based texture • water-fill edge feature
Experimental Result (3/4) • Precision: 檢索所得相關資料筆數 / 檢索所得之所有資料筆數 • Recall: 檢索所得之相關資料筆數 / 資料庫中所有相關資料筆數
Conclusions • Effective for CBIR • Simple implementation • Fast convergence rate and good performance