A Measure of Q-convexity for Shape Analysis
In this paper, we study three basic novel measures of convexity for shape analysis. The convexity considered here is the so-called Q-convexity, that is, convexity by quadrants. The measures are based on the geometrical properties of Q-convex shapes and have the following features: (1) their values r...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2020
|
| Sorozat: | JOURNAL OF MATHEMATICAL IMAGING AND VISION
62 No. 8 |
| Tárgyszavak: | |
| doi: | 10.1007/s10851-020-00962-9 |
| mtmt: | 31491962 |
| Online Access: | http://publicatio.bibl.u-szeged.hu/36417 |
| Tartalmi kivonat: | In this paper, we study three basic novel measures of convexity for shape analysis. The convexity considered here is the so-called Q-convexity, that is, convexity by quadrants. The measures are based on the geometrical properties of Q-convex shapes and have the following features: (1) their values range from 0 to 1; (2) their values equal 1 if and only if the binary image is Q-convex; and (3) they are invariant by translation, reflection, and rotation by 90 degrees. We design a new algorithm for the computation of the measures whose time complexity is linear in the size of the binary image representation. We investigate the properties of our measures by solving object ranking problems and give an illustrative example of how these convexity descriptors can be utilized in classification problems. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 1121-1135 |
| ISSN: | 0924-9907 |