GitXplorerGitXplorer
l

Selective-Search

public
0 stars
0 forks
0 issues

Commits

List of commits on branch master.
Unverified
537fb5a2d13fb2c1c99ecfab4093c6b5d8bf101d

Add files via upload

CChialiuliu committed 6 years ago
Unverified
0b6110113ff6f92a1dc06d8cc95b4a646d74cfe8

Add files via upload

CChialiuliu committed 6 years ago
Unverified
91c72ba0b672475df4f824d4a2a8d3b356f0c864

Update README.md

CChialiuliu committed 6 years ago
Unverified
42f43af97d885812780646de481432e954ef322a

Delete compare.jpg

CChialiuliu committed 6 years ago
Unverified
35827b974cb6bd32f94996ce5fb07e2d8e432323

Add files via upload

CChialiuliu committed 6 years ago
Unverified
84b8446983583bbde805774373ce5e9333164c75

Delete compare.jpg

CChialiuliu committed 6 years ago

README

The README file for this repository.

Selective-Search

  • This approach is used to get region proposals in Fast-RCNN.
  • for more detail

Setup

  • Windows 10
  • Python 3.6

Result

Detail

1. Selective Search uses graph-based image segmentation to get initial regions, first.
In my practice, I just used the function of graph-based image segmentation in openCV.

2. Calculate similarities between each neighboring region.

Following are 4 similarity approaches in this paper.

A. color similarity:

  In order to measure the similarity in color, this approach can measure color distribution  
  of each region.  
  Calculate color histogram of each region, than sum up the minimize interval between both  
  neighboring regions.  

  We can easily get the color similarity after merge two region by using following algorithm.

B. texture similarity:

  Similar objects have more similar texture features, so we measure the texture similarities  
  between each neighboring region to merge complete object.  
  In this paper, they use SIFT to get image textures.  
  In my practice, I used LBP instead.  

C. size similarity:

  To avoid all regions be merged by a big region.  

D. fill similarity:

  Merge the regions which has the least hole after merging.  

Following are two bounding boxes with same widths and heights, show what is the least hole.

3. Merge the highest similarity of two regions, iteratively.