1 / 17

Visual query processing for efficient image retrieval using a SOM-based filter-refinement scheme

Visual query processing for efficient image retrieval using a SOM-based filter-refinement scheme. Presenter : JHOU, YU-LIANG Authors : Zhiwen Yu, Hau -San Wong, Jane You, Guoqiang Han 2012,Information Sciences. Outlines. Motivation Objectives Methodology

hunter
Télécharger la présentation

Visual query processing for efficient image retrieval using a SOM-based filter-refinement scheme

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Visual query processing for efficient image retrieval using a SOM-based filter-refinement scheme Presenter : JHOU, YU-LIANGAuthors : Zhiwen Yu, Hau-San Wong, Jane You, Guoqiang Han2012,Information Sciences

  2. Outlines • Motivation • Objectives • Methodology • Experiments • Conclusions • Comments

  3. Motivation • Content-based image retrieval is one of the most effective ways of retrieving visual data. • However, When a large number of pictures the relevance feedback process is a tedious and time consuming and requires high computational cost.

  4. Objectives • To make the query process more robust. • To make image retrieval more intuitive and effective.

  5. Methodology-Framework

  6. Methodologylocal membership function the neuron is in a d-level local neighborhood (ii) the distance between the weight vector of the neuron and the input vector is not greater than the s-th smallest distance among all the distances between the input vector and the weight vectors of the neurons in the neighborhood

  7. MethodologyHierarchical tree

  8. MethodologyCandidate retrieval

  9. MethodologyVisualizing query processing

  10. MethodologyVisualizing query processing

  11. Experiments- dataset

  12. Experimental setting (i) the feature vectors of the query images are identical distributed is denoted as AVAC (i) (ii) the feature vectors of the query images are randomly distributed is denoted as AVAC (r)

  13. Experiments

  14. Experiments

  15. Experiments

  16. Conclusions • We adopt our new approach can improve the accuracyand efficiency of the process.

  17. Comments • Advantages More accuracyand efficiency. Applications -Self organizing map -Image retrieval

More Related