2007
DOI: 10.1016/j.patcog.2006.08.005
|View full text |Cite
|
Sign up to set email alerts
|

Lossless compression of map contours by context tree modeling of chain codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2008
2008
2016
2016

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 30 publications
(7 citation statements)
references
References 16 publications
0
7
0
Order By: Relevance
“…For a clear distinction between data and no-data regions, the proposed techniques need to transmit the shape of the no-data regions. Since this does not influence the comparison among the proposed techniques, the transmission of the shape belonging to the no-data regions is considered as a complementary problem that is not addressed in this work (see, for instance, [20]). Table 1 reports the results obtained by the four proposed techniques for all the images of the RS corpus, and Table 2 for all the images of the Medical corpus.…”
Section: Resultsmentioning
confidence: 99%
“…For a clear distinction between data and no-data regions, the proposed techniques need to transmit the shape of the no-data regions. Since this does not influence the comparison among the proposed techniques, the transmission of the shape belonging to the no-data regions is considered as a complementary problem that is not addressed in this work (see, for instance, [20]). Table 1 reports the results obtained by the four proposed techniques for all the images of the RS corpus, and Table 2 for all the images of the Medical corpus.…”
Section: Resultsmentioning
confidence: 99%
“…We believe that our proposed symmetry detection methods are potentially useful for data compression. On the one hand because chain-code techniques are known for preserving information and allowing considerable data reduction (e.g., [29][30][31][32][33][34][35]). On the other hand because the basic strategy of data compression consists in reducing, as much as possible, redundant data, and symmetric elements are a type of redundancy (e.g., [36,17,37]).…”
Section: Data Compressionmentioning
confidence: 99%
“…Freeman chain code [22] method is used for finding contours, which is based on 8 connectivity of 3x3 windows of Freeman chain code. Two factors determine the success of the algorithm: The first factor is the direction of traverses either clockwise or anticlockwise.…”
Section: Contour Detectionmentioning
confidence: 99%