Pii: S0031-3203(01)00062-0

نویسندگان

Rong Zhao

W. I. Grosky

چکیده

In this paper, we present the results of a project that seeks to transform low-level features to a higher level of meaning. This project concerns a technique, latent semantic indexing (LSI), in conjunction with normalization and term weighting, which have been used for full-text retrieval for many years. In this environment, LSI determines clusters of co-occurring keywords, sometimes, called concepts, so that a query which uses a particular keyword can then retrieve documents perhaps not containing this keyword, but containing other keywords from the same cluster. In this paper, we examine the use of this technique for content-based image retrieval, using two di5erent approaches to image feature representation. We also study the integration of visual features and textual keywords and the results show that it can help improve the retrieval performance signi6cantly. ? 2001 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On-line recognition of cursive Korean characters using graph representation

The automatic recognition of cursive Korean characters is a di$cult problem, not only due to the multiple possible variations involved in the shapes of characters, but also because of the interconnections of neighboring graphemes within an individual character. This paper proposes a recognition method for Korean characters using graph representation. This method uses a time-delay neural network...

متن کامل

Application of planar shape comparison to object retrieval in image databases

متن کامل

Gaussian mixture parameter estimation with known means and unknown class-dependent variances

متن کامل

Finding approximate palindromes in strings

We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de nition is based on the usual edit operations of approximate pattern matching, and the algorithm we give, for a string of size n on a xed alphabet, runs in O(kn) time. We also discuss two implementationrelated improvement...

متن کامل