Wyniki wyszukiwania - BazTech

Ograniczanie wyników

3 Journal of Applied Computer Science

3 Bartyzel K.

Powiadomienia systemowe

Sesja wygasła!
Sesja wygasła!
Sesja wygasła!

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: chain code

Sortuj według:

Ogranicz wyniki do:

Basic mechanisms of Brownian string analysis and manipulation

Bartyzel K.

Journal of Applied Computer Science

2018

Vol. 26, nr 2

7--22

The paper presents the possibilities of using Brownian Strings as an example of Active Contour Model for linguistic description of objects in an image. Having only a notation composed of a combination of characters RULD we can calculate the statistics of the object, such as its surface area, width and height, centroid, and even image moments. The part is thoroughly discussed. The requirements for a combination of characters RULD to be called a Brownian contour are also presented and analysed carefully.

Invariant Levenstein Distance as an example of the Hausdorff Distance

Bartyzel K.

Journal of Applied Computer Science

2014

Vol. 22, nr 2

7--17

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.

Invariant Levenstein Distance for Comparison of Brownian Strings

Bartyzel K.

Journal of Applied Computer Science

2010

Vol. 18, nr 1

7-17

The paper describes a new way of comparing Brownian contours. The Brownian strings, one of the main chain symbolic structures, are an image segmentation technique where a stochastically deformable contour fits around an object. In this technique the chain code can be interpreted as a simple method for linguistic description of the object. The Levenstein distance, which is one of the known textual strings comparison method, was generalised in a way that it is able to become insensitive to rotation and mirror reflection of compared shapes.