2012
DOI: 10.1016/j.image.2012.07.008
|View full text |Cite
|
Sign up to set email alerts
|

Directional difference chain codes with quasi-lossless compression and run-length encoding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 15 publications
(11 citation statements)
references
References 21 publications
0
11
0
Order By: Relevance
“…Through comparing the performance of descriptors computed for local interest regions, Mikolajczyk also proposed an extension of the SIFT descriptor that outperforms the original method [12]. Liu presented a contour-based representation of binary objects in raster images [13]. For existing studies using chain codes to represent the image signal, the chain code might be too small to reflect micro-features that can involve considerable data [14].…”
Section: Related Workmentioning
confidence: 99%
“…Through comparing the performance of descriptors computed for local interest regions, Mikolajczyk also proposed an extension of the SIFT descriptor that outperforms the original method [12]. Liu presented a contour-based representation of binary objects in raster images [13]. For existing studies using chain codes to represent the image signal, the chain code might be too small to reflect micro-features that can involve considerable data [14].…”
Section: Related Workmentioning
confidence: 99%
“…To unify the compressions of the chain codes, a Universal Chain Code Compression (UCCC) algorithm has recently been demonstrated [23]. Nunes et al [4] and Liu et al [24] proposed near-lossless approaches, where both used Huffman coding.…”
Section: Memory Requirementsmentioning
confidence: 99%
“…Sánchez-Cruz [19] also proposed a newer compression method for F8 by finding repetitive substrings within the chain code. Liu et al [20] have recently proposed another quasi-lossless chain code compression method, which replaces less frequent angular differences (i.e. 135 and 180 ) in DDCC with pairs of more frequent ones.…”
Section: Related Work On Chain Code Compressionmentioning
confidence: 99%