- Tytuł:
- Closest paths in graph drawings under an elastic metric
- Autorzy:
- Baran, M.
- Powiązania:
- https://bibliotekanauki.pl/articles/330666.pdf
- Data publikacji:
- 2018
- Wydawca:
- Uniwersytet Zielonogórski. Oficyna Wydawnicza
- Tematy:
-
elastic shape analysis
pattern recognition
superpixel segmentation
analiza kształtu
rozpoznawanie wzorca
segmentacja obrazu
superpiksel - Opis:
- This work extends the dynamic programming approach to calculation of an elastic metric between two curves to finding paths in pairs of graph drawings that are closest under this metric. The new algorithm effectively solves this problem when all paths between two given nodes in one of these graphs have the same length. It is then applied to the problem of pattern recognition constrained by a superpixel segmentation. Segmentations of test images, obtained without statistical modeling given two shape endpoints, have good accuracy.
- Źródło:
-
International Journal of Applied Mathematics and Computer Science; 2018, 28, 2; 387-397
1641-876X
2083-8492 - Pojawia się w:
- International Journal of Applied Mathematics and Computer Science
- Dostawca treści:
- Biblioteka Nauki
Artykuł