Mser
Version 1 (Alexander Shishkov, 2013-04-04 11:22 am)
1 | 1 | h1. MSER |
|
---|---|---|---|
2 | 1 | ||
3 | 1 | h2. OpenCV functions for MSER extraction |
|
4 | 1 | ||
5 | 1 | (From the source code: src/cv/cvmser.cpp): |
|
6 | 1 | ||
7 | 1 | # there are two different implementation of MSER: one for grey image, one for color image |
|
8 | 1 | # the grey image algorithm is taken from: Linear Time Maximally Stable Extremal Regions; the paper claims to be faster than union-find method; it actually get 1.5~2m/s on my centrino L7200 1.2GHz laptop. |
|
9 | 1 | # the color image algorithm is taken from: Maximally Stable Colour Regions for Recognition and Match; it should be much slower than grey image method ( 3~4 times ); the chi_table.h file is taken directly from paper's source code which is distributed under GPL. |
|
10 | 1 | # though the name is *contours*, the result actually is a list of point set. |
|
11 | 1 | ||
12 | 1 | h2. Parameters description |
|
13 | 1 | ||
14 | 1 | (From the source code: features2d/features2d.hpp): |
|
15 | 1 | ||
16 | 1 | <pre> |
|
17 | 1 | int delta; //! delta, in the code, it compares (size_{i}-size_{i-delta})/size_{i-delta} |
|
18 | 1 | ||
19 | 1 | int maxArea; //! prune the area which bigger than maxArea |
|
20 | 1 | ||
21 | 1 | int minArea; //! prune the area which smaller than minArea |
|
22 | 1 | ||
23 | 1 | float maxVariation; //! prune the area have simliar size to its children |
|
24 | 1 | ||
25 | 1 | float minDiversity; //! trace back to cut off mser with diversity < min_diversity |
|
26 | 1 | ||
27 | 1 | The next few params for MSER of color image: |
|
28 | 1 | ||
29 | 1 | int maxEvolution; //! for color image, the evolution steps |
|
30 | 1 | ||
31 | 1 | double areaThreshold; //! the area threshold to cause re-initialize |
|
32 | 1 | ||
33 | 1 | double minMargin; //! ignore too small margin |
|
34 | 1 | ||
35 | 1 | int edgeBlurSize; //! the aperture size for edge blur |
|
36 | 1 | </pre> |