Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
The properties and applications of chain codes are studied around the world for many years. One of the most important uses is the ability to use them (chain codes) to describe objects contours and therefore for the comparison of objects. In previous work author presented Levenstein distance modification which allows to compare Brownian strings. In this paper, author focuses on expanding studies on developed distance and confirmation that the obtained measure is truly the mathematical metric.
Czasopismo
Rocznik
Tom
Strony
7--17
Opis fizyczny
Bibliogr. 10 poz.
Twórcy
autor
- Katolicki Uniwersytet Lubelski Jana Pawła II, Katedra Analizy Obrazów, al. Racławickie 14, 20-950 Lublin
Bibliografia
- [1] Freeman, H., On the encoding of arbitrary geometric configurations, 1961.
- [2] Freeman, H., Computer Processing of Line-Drawing Images, 1974.
- [3] Bons, J. H. and Kegel, A., On the Digital Processing and Transmission of Handwriting and Sketching, 1977.
- [4] Hwang, Y. T.,Wang, Y. C., and Wang, S. S., An efficient shape coding scheme and its codec design, 2001.
- [5] Liu, Y. K. and Zalik, B., An efficient chain code with Huffman coding, 2005.
- [6] Bribiesca, E., A new chain code, 1999.
- [7] Grzeszczuk, R. P. and Levin, D. N., “Brownian strings”: Segmenting images with stochastically deformable contours, 1997.
- [8] Kass, M., Witkin, W., and D., T., Snakes: Active Contour Models, 1988.
- [9] Grzeszczuk, R. P., Eddins, S., and DeFanti, T., A Region Fill Algorithm Based on Crack Contour Boundaries, 1992.
- [10] Bartyzel, K., Invariant Levenstein Distance for Comparison of Brownian Strings, 2010.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-92907f22-8361-4a32-9ab0-f582d7c05f2f