Enhancing Sketch-Based Image Retrieval by Re-Ranking and Relevance - - PowerPoint PPT Presentation

enhancing sketch based image retrieval by re ranking and
SMART_READER_LITE
LIVE PREVIEW

Enhancing Sketch-Based Image Retrieval by Re-Ranking and Relevance - - PowerPoint PPT Presentation

Enhancing Sketch-Based Image Retrieval by Re-Ranking and Relevance Feedback Heechan Shin CS688 Student paper presentation Enhancing Sketch-Based Image Retrieval by Re-Ranking and Relevance Feedback ( IEEE TIP 16 ) 2018-12-03 2 Contents


slide-1
SLIDE 1

2018-12-03

Enhancing Sketch-Based Image Retrieval by Re-Ranking and Relevance Feedback

Heechan Shin CS688 Student paper presentation

“Enhancing Sketch-Based Image Retrieval by Re-Ranking and Relevance Feedback” ( IEEE TIP 16 )

slide-2
SLIDE 2

2

Contents

  • Problems & Related work
  • Solution
  • Image Grouping
  • Visual Feature Verification
  • Contour-Based Relevance Feedback
  • Experimental Result
  • Conclusion
slide-3
SLIDE 3

3

Problems

  • Sketch Based Image Retrieval (SBIR)

What a user want to find What a user queries

How to measure the relevance of an image and a query sketch?

slide-4
SLIDE 4

4

Problems

  • To solve the problem..
  • Contour matching
  • Local feature matching

Angular Radial Partitioning(ARP) Edgel index

Edgel index : Cao, Yang, et al. "Edgel index for large-scale sketch-based image search." (2011): 761-768. ARP : Chalechale, Abdolah, Alfred Mertins, and G. Naghdy. "Edge image description using angular radial partitioning." IEE Proceedings-Vision, Image and Signal Processing 151.2 (2004): 93-101.

slide-5
SLIDE 5

5

Related work

  • Angular Radial Partitioning (ARP)

Image Partitioning Pixels in each partition Fourier transformed

slide-6
SLIDE 6

6

Related work

  • Edgel index ( Edgel : edge pixel )
slide-7
SLIDE 7

7

Problems

  • Sketch should be fairly close to the image.
  • Irrelevant image may be retrieved.

Re-ranking and finding relevant images are important!

slide-8
SLIDE 8

8

Solution

  • Contribution
  • Optimizing module with the search result of any SBIR framework

Any SBIR Optimizing module

  • f this paper

Initial result Final result

slide-9
SLIDE 9

9

Solution

  • Image Grouping
  • Fining more relevant images
  • RVFV
  • Removing irrelevant images
  • CBRF
  • Making new queries to find

relevant images using contours

slide-10
SLIDE 10

10

Solution

  • Image Grouping
  • Fining more relevant images
  • RVFV
  • Removing irrelevant images
  • CBRF
  • Making new queries to find

relevant images using contours

slide-11
SLIDE 11

11

Solution

  • Relevant Images Grouping for Relevant Feedback

Initial result (size N) Select images (size R) (R < N) Find near-duplicated images using existing image matching approach (ex, binary edge-SIFT) Cluster near-duplicated images (size of cluster K) (K <= R) Relevant group

Rank high

slide-12
SLIDE 12

12

Solution

  • Re-ranking via Visual Feature Verification (RVFV)

Ranked images (size N)

Top ranked image (Standard image, )

Calculate similarity score to  Similarity score  =   ,  ,  = 1~ (ex.  =   ,  = 1.0)   ( , )   ( , )   ( , )   ( , ) 1 2 3 N … Re-ranked images according to  (size N) Select top M images

slide-13
SLIDE 13

13

Solution

  • Similarity score 
  • : SIFT descriptor of image A
  • L2 norm of two descriptor  −  

 = 2 − Σ   

since  

 +    = 2, 

 ,  = Σ

  

  • 

 

,  = Σ

 ,     ℎ  ,    

 

        

 

      ℎ

slide-14
SLIDE 14

14

Solution

  • Contour-Based Relevance Feedback

Re-ranked images (size M) … Create contour from image (size M)

Relevant Feedback Score   ∶ Σ



 ,  ×    ;  = 1, … , 

 ℎ                    

New query New query New query

slide-15
SLIDE 15

15

Solution

  • Contour-Based Relevance Feedback
  • Relevant Feedback Score

  ∶ Σ



 ,  ×    ;  = 1, … , 

 ℎ                    

  • 

  : Initial score of image 

  • 

 , 

: Score after first RVFV of image , when a query is contour

  • f image 
  • Final score   = 1 −  × 

  +  ×   ;  = 1, … , 

  • With   , we have new ranked list
slide-16
SLIDE 16

16

Solution

  • Image Grouping
  • Fining more relevant images
  • RVFV
  • Removing irrelevant images
  • CBRF
  • Making new queries to find

relevant images using contours

slide-17
SLIDE 17

17

Solution

  ( , )   ( , )   ( , )   ( , )

1 2 3 N

… …

New query New query New query

  ( , )   ( , )   ( , )   ( , )

1 2 3 N

slide-18
SLIDE 18

18

Experimental Result

  • Experimental setting
  • Dataset
  • SBIR_100K Dataset : 1,240 images for 31 sketches and 100,000 noise images
  • Authors’ own Dataset : from Google keyword search 296,562 images with 68,647

sketch-describable images + 523 sketches

slide-19
SLIDE 19

19

Experimental Result

  • Result 1. Performance Evaluation

Result of authors’ dataset Result of SBIR_100K dataset

slide-20
SLIDE 20

20

Experimental Result

  • Result 2. Computational cost

+1.28s +0.91s

slide-21
SLIDE 21

21

Conclusion

  • Image Grouping
  • Find which images are more relevant
  • Re-ranking via Visual Feature Verification (RVFV)
  • Filter out irrelevant images
  • Contour-Based Relevance Feedback (CBRF)
  • Explore deeply to retrieve what does not be found with original SBIR
  • Improved result with low time cost