|
ABSTRACT
This paper introduces a content-based information retrieval method inspired by the ideas of spreading activation models. In response to a given query,the proposed approach computes document ranks as their final activation values obtained upon completion of a diffusion process. This diffusion process,in turn,is dual in the sense that it models the spreading of the query 's initial activation simultaneously in two similarity domains: low-level feature-based and high-level semantic.The formulation of the diffusion process relies on an approximation that makes it possible to compute the final activation as a solution to a linear system of differential equations via a matrix exponential without the need to resort to an iterative simulation.The latter calculation is performed efficiently by adapting a sparse routine based on Krylov sub-space projection method.The empirical performance of the described dual diffusion model has been evaluated in terms of precision and recall on the task of content-based digital image retrieval in query-by-example scenario. The obtained experimental results demonstrate that the proposed method achieves better overall performance compared to traditional feature-based approaches. This performance improvement is attained not only when both similarity domains are used, but also when a diffusion model operates only on the feature-based similarities.
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
|
J.-Y. Bouguet, C. Dulong, I. Kozintsev, and Y. Wu. Requirements for benchmarking personal image retrieval systems. In S. Santini, R. Schettini, and T.Gevers, editors, Proceedings of SPIE Photonics West, Electronic Imaging volume 6061. SPIE, 2006.
|
| |
4
|
C.-C. Chang and C.-J. Lin. LIBSVM: a library for support vector machines 2001. Software available at http://www.csie.ntu.edu.tw/¿cjlin/libsvm.
|
| |
5
|
|
| |
6
|
|
| |
7
|
|
| |
8
|
S. Deerwester, S. Dumais, G. Furnas, T. Landauer, and R. Harshman. Indexing by latent semantic analisys.Journal of the American Society of Information Science 41(6):391--407, 1990.
|
| |
9
|
|
| |
10
|
B. Haasdonk and C. Bahlmann. Learning with distance substitution kernels. In 26th Pattern Recognition Symposium of the German Association for Pattern Recognition (DAGM 2004)Tübingen, Germany, 2004. Springer Verlag.
|
| |
11
|
|
| |
12
|
|
| |
13
|
J. Kandola, J. Shawe-Taylor, and N. Cristianini. Learning semantic similarity. In S. T. S. Becker and K. Obermayer, editors, Advances in Neural Information Processing Systems 15 pages 657--664. MIT Press, Cambridge, MA, 2003.
|
| |
14
|
|
 |
15
|
|
 |
16
|
|
| |
17
|
B. R. Munson, D. F. Young,and T. H. Okiishi. Fundamentals of Fluid Mechanics John Wiley & Sons,1990.
|
| |
18
|
|
| |
19
|
P. Resnik. Using information content to evaluate semantic similarity in a taxonomy. In International Joint Conference for Artificial Intelligence (IJCAI-95) pages 448--453, 1995.
|
| |
20
|
D. E. Rumelhart and D. A. Norman. Representation in memory. In Steven's handbook of experimental psychology volume 2, pages 511--587. Wiley, 1988.
|
| |
21
|
|
 |
22
|
|
| |
23
|
|
 |
24
|
|
| |
25
|
|
| |
26
|
D. M. J. Tax. Ddtools, the data description toolbox for matlab, June 2006. version 1.5.3.
|
| |
27
|
|
|