Return-Path: Delivered-To: apmail-lucene-java-user-archive@www.apache.org Received: (qmail 64868 invoked from network); 4 May 2008 15:14:31 -0000 Received: from hermes.apache.org (HELO mail.apache.org) (140.211.11.2) by minotaur.apache.org with SMTP; 4 May 2008 15:14:31 -0000 Received: (qmail 8972 invoked by uid 500); 4 May 2008 15:14:24 -0000 Delivered-To: apmail-lucene-java-user-archive@lucene.apache.org Received: (qmail 8933 invoked by uid 500); 4 May 2008 15:14:24 -0000 Mailing-List: contact java-user-help@lucene.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: java-user@lucene.apache.org Delivered-To: mailing list java-user@lucene.apache.org Received: (qmail 8920 invoked by uid 99); 4 May 2008 15:14:24 -0000 Received: from athena.apache.org (HELO athena.apache.org) (140.211.11.136) by apache.org (qpsmtpd/0.29) with ESMTP; Sun, 04 May 2008 08:14:24 -0700 X-ASF-Spam-Status: No, hits=1.2 required=10.0 tests=SPF_NEUTRAL X-Spam-Check-By: apache.org Received-SPF: neutral (athena.apache.org: local policy) Received: from [208.97.132.119] (HELO spunkymail-a6.g.dreamhost.com) (208.97.132.119) by apache.org (qpsmtpd/0.29) with ESMTP; Sun, 04 May 2008 15:13:39 +0000 Received: from [192.168.0.3] (adsl-074-229-189-244.sip.rmo.bellsouth.net [74.229.189.244]) by spunkymail-a6.g.dreamhost.com (Postfix) with ESMTP id DAE47109F25 for ; Sun, 4 May 2008 08:13:51 -0700 (PDT) Message-Id: <71DA30C5-903F-4EA4-87D4-216ED3F87EE0@apache.org> From: Grant Ingersoll To: java-user@lucene.apache.org In-Reply-To: <481DBBB5.3060800@aol.com> Content-Type: text/plain; charset=US-ASCII; format=flowed; delsp=yes Content-Transfer-Encoding: 7bit Mime-Version: 1.0 (Apple Message framework v919.2) Subject: Re: Lucene Indexing structure Date: Sun, 4 May 2008 11:13:49 -0400 References: <4812EF79.4050906@aol.com> <481DBBB5.3060800@aol.com> X-Mailer: Apple Mail (2.919.2) X-Virus-Checked: Checked by ClamAV on apache.org Would a Function Query (ValueSourceQuery, see the org.apache.lucene.search.function package) work in this case? -Grant On May 4, 2008, at 9:35 AM, Vaijanath N. Rao wrote: > Hi Chris, > > Sorry for the cross-posting and also for not making clear the > problem. Let me try to explain the problem at my hand. > > I am tying to write a CBIR (Content Based Image Reterival) frame > work using lucene. As each document have entities such as title, > description, author and so on. I am decomposing each image and > extracting features like color histogram, texture and other > important attributes from every image and indexing it in lucene such > a way that each of this attribute is a field. I convert the float > values as string for every feature that I have extracted from the > image. > > While searching for similar image I extract the same set of features > for the query Image and than query lucene to get all those images > which have atleast one of the features, than I do the re-ranking > according to the difference of the features. Once the re-ranking is > done I submit the result. > Here is where I need help, I need to know an optimal way to store > the values, so that searching take less time and I don't have to re- > ranking. Is there any way I can compare array of values rather than > one value. What I essentially need is to get the query of type, > give me all those features which are less than K distance from the > current feature. > > --Thanks and Regagrds > Vaijanath > > Chris Hostetter wrote: >> : Hi Lucene-user and Lucene-dev, >> >> Please do not cross post -- java-user is the suitable place for >> your question. >> >> : Obviously there is something wrong with the above approach (as to >> get the >> : correct document we need to get all the documents and than do the >> required >> : distance calculation), but that' due to lack of my knowledge of >> Luce and >> : lucene's Index storage. >> : : What I want to know how to improve upon the exsisting >> architecture other than >> : making number of fields in the lucene equalling to total number of >> : feature*size of each feature. >> >> I suspect one of the reasons you haven't gotten much of a response >> yet is that people may not understand your problem statement -- I >> know nothing of Image Processing and even after googling "Color >> Histogram" I don't really understand how the examples you gave >> represent Color Histograms, or what it would mean to search on it >> with your example input. >> >> Perhaps you could describe in more detail what exactly some sample >> data looks like, why certian objects should match certain queries, >> (and just as importantly: why other objects shouldn't match, and >> give examples of one one object is a "better" match then another >> object for each example query. >> >> don't worry about Lucene Document/Field/QueryParse specifics -- >> just explain the concepts you are dealing with. >> >> >> >> -Hoss >> >> > > > --------------------------------------------------------------------- > To unsubscribe, e-mail: java-user-unsubscribe@lucene.apache.org > For additional commands, e-mail: java-user-help@lucene.apache.org > -------------------------- Grant Ingersoll Lucene Helpful Hints: http://wiki.apache.org/lucene-java/BasicsOfPerformance http://wiki.apache.org/lucene-java/LuceneFAQ --------------------------------------------------------------------- To unsubscribe, e-mail: java-user-unsubscribe@lucene.apache.org For additional commands, e-mail: java-user-help@lucene.apache.org