Fast query point movement technique techniques for large CBIR systems

Authors: Presenter:

Contents Introduction  Proposed target search methods  Experiments  Conclusions  .

Introduction Content-based image retrieval (CBIR) received much research attention  Two types of search  Target search  To find a specific (target) image: a registered logo To retrieve a particular semantic class of images: skyscrapers Category search  .

Related Work  Query point movement techniques 4 .

Motivations  Existing target search techniques allow the re-retrieval of checked images. and have several disadvantages Local maximum traps No guarantee that returned images are the target images Slow convergence High resource requirements 5 .

Probleam statement Target search in content based image retrival systems refers to finding a specific image such as a particular registered spacific historical photograph. In our research propose a new index structure and query processing technique of Evaluate different visual features And Extend our methods to support video target search for minimize the effects of users inaccurate relevance feedback 6 .

Local maximum trap and slow convergence t Cluster 1 1 Cluster 2 s r 2 t s 7 .

Target Search System  Target Search System overview Find Target Terminate Relevance Feedback Not Find Target Target Search Methods Refined Query Qr User Evaluate Initial Random Images or Query Result Images Evaluate Q r 8 .

Four Proposed Target Search Methods  Our goals: Avoid local maximum traps Achieve fast convergence  Assumptions There is only one target image in the image set for a given target search Users can accurately identify the most relevant image from the returned images  The proposed four target search methods based on nonre-retrieval strategy Naïve random scan (NRS) method Local neighboring movement (LNM) method Neighboring divide and conquer (NDC) method Global divide and conquer (GDC) method 9 .

Naïve Random Scan Method Naïve random scan (NRS) method randomly retrieves k different images at a time until the user finds the target image.  NRS takes to reach the target image  NRS is only suitable for a small image set  10 .

LNM could take anywhere from to depending on the points distribution. LNM enumerates neighboring points of the refined query when encountering a local maximum. 11 . To find a target image.Local Neighboring Movement Method    Local neighboring movement (LNM) method constructs a refined query such that it moves towards neighboring relevant points and away from irrelevant ones.

12 . NDC could take anywhere from to depending on the points distribution.Neighboring Divide and Conquer Method 2 1 3 s 1 8 5 3 4 7 6 t   Neighboring divide and conquer (NDC) method constructs Voronoi diagrams to reduce the research space. To find a target image.

Global Divide and Conquer Method 2 4 s 3 1 3 t 5   Global divide and conquer (GDC) method uses a query point and k randomly sampled points (instead of neighboring points) to construct Voronoi diagrams To find a target image. GDC just take iterations 13 .

Experiments  Dataset 68040 images from the COREL library  Visual image features Colors: 9 features Texture: 10 features Edge Structure: 18 features  Sun UltraSPARC with 2GB memory 14 .

Liu 15 .

Sign up to vote on this title
UsefulNot useful