Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/12743
Nаziv: | General coding scheme for families of digital curve segments | Аutоri: | Zunic J. Acketa D. |
Dаtum izdаvаnjа: | 1-јан-1998 | Čаsоpis: | Graphical Models and Image Processing | Sažetak: | This paper deals with sets consisting of digital curve segments which are presented on an n × n grid. The main result is a general coding scheme which can be applied to the sets of digital curve segments, which may consist even of digital curve segments that result from digitization of curves of different kinds. If h is an upper bound for the number of intersection points of two digitized curves, then h + 3 integer parameters are sufficient for the coding. The proposed coding scheme preserves an asymptotically optimal coding (the minimum possible number of bits is used) when h is assumed to be a constant. If it is allowed that h tends to infinity (when n tends to infinity, too), then the number of bits used for the coding is O(h2 · log n). In addition, the authors show that the coding of digital curve segments by their least-squares polynomial fits is possible. It turns out that such a coding is a special case of the general coding scheme proposed here. | URI: | https://open.uns.ac.rs/handle/123456789/12743 | ISSN: | 10773169 | DOI: | 10.1006/gmip.1998.0482 |
Nаlаzi sе u kоlеkciјаmа: | PMF Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
14
prоvеrеnо 12.08.2023.
Prеglеd/i stаnicа
19
Prоtеklа nеdеljа
18
18
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.