Back
Closest paths in graph drawings under an elastic metric
Authors:
- Mateusz Baran
Abstract
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.
- Record ID
- CUT5841d9c71a72434ca03d91e5d9efa130
- Publication categories
- ;
- Author
- Journal series
- International Journal of Applied Mathematics & Computer Science, ISSN 1641-876X
- Issue year
- 2018
- Vol
- 28
- No
- 2
- Pages
- 387-397
- Other elements of collation
- rys.; tab.; Bibliografia (na s.) - 394-396; Oznaczenie streszczenia - Streszcz. ang.; Numeracja w czasopiśmie - Vol. 28, Nr 2
- Keywords in English
- elastic shape analysis, pattern recognition, superpixel segmentation
- DOI
- DOI:10.2478/amcs-2018-0029 Opening in a new tab
- URL
- https://www.amcs.uz.zgora.pl/?action=paper&paper=1438 Opening in a new tab
- Language
- eng (en) English
- License
- Score (nominal)
- 25
- Additional fields
- Indeksowana w: Web of Science, Scopus
- Uniform Resource Identifier
- https://cris.pk.edu.pl/info/article/CUT5841d9c71a72434ca03d91e5d9efa130/
- URN
urn:pkr-prod:CUT5841d9c71a72434ca03d91e5d9efa130
* presented citation count is obtained through Internet information analysis, and it is close to the number calculated by the Publish or PerishOpening in a new tab system.