| Naslov: | An efficient chain code with Huffman coding |
|---|
| Avtorji: | ID Liu, Yong Kui (Avtor)
ID Žalik, Borut (Avtor) |
|---|
| Datoteke: |  http://dx.doi.org/10.1016/j.patcog.2004.08.017
|
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Neznano |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: | FERI - Fakulteta za elektrotehniko, računalništvo in informatiko
|
|---|
| Opis: | This paper presents a new chain code based on the eight-direction Freeman code. Each element in the chain is coded as a relative angle difference between it and the previous element. Statistical analysis showed that the probabilities of the Freeman codes differ importantly. Therefore, the Huffman coding was applied. The proposed chain code requires 1.97 bits/code, its chainlength is small, it allows representation of non-closed patterns and is rotationally independent. |
|---|
| Ključne besede: | computer science, pattern recognition, chain code, Huffman code, object representations, chain code compression |
|---|
| Leto izida: | 2005 |
|---|
| PID: | 20.500.12556/DKUM-27218  |
|---|
| UDK: | 004.93 |
|---|
| COBISS.SI-ID: | 9270294 |
|---|
| ISSN pri članku: | 0031-3203 |
|---|
| NUK URN: | URN:SI:UM:DK:IK0TNCUE |
|---|
| Datum objave v DKUM: | 01.06.2012 |
|---|
| Število ogledov: | 2051 |
|---|
| Število prenosov: | 109 |
|---|
| Metapodatki: |    |
|---|
| Področja: | Ostalo
|
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
