2019
DOI: 10.3390/app9040782
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Encoding Algorithm Using Local Path on Huffman Encoding Algorithm for Compression

Abstract: Keywords: encoding algorithm; compression; Huffman encoding algorithm; arithmetic coding algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
4
2

Relationship

0
10

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 27 publications
0
5
0
Order By: Relevance
“…The proposed method consists of two DCNNs, C-DCNN, R-DCNN, huffman encoding (HE) [16] and decoding. During compression, the input image is represented compactly to preserve salient information of the medical image.…”
Section: Proposed Image Compression Methodsmentioning
confidence: 99%
“…The proposed method consists of two DCNNs, C-DCNN, R-DCNN, huffman encoding (HE) [16] and decoding. During compression, the input image is represented compactly to preserve salient information of the medical image.…”
Section: Proposed Image Compression Methodsmentioning
confidence: 99%
“…In the extreme case, we can convert a network to a binary connect model, where all parameters are þ1orÀ1 [80]. Last but not least, some information encoding methods, such as Huffman encoding, that represents frequent clusters with fewer bits and rare clusters with more bits [81], can also be used as quantization techniques, since they are efficient encoding strategies.…”
Section: Model Compressionmentioning
confidence: 99%
“…The approach in the algorithm assigns symbols from the alphabet while changing the coded words according to their frequency. Higher frequency codes are indicated with shorter codes for a higher compression result [22].…”
Section: Huffman Encoding Algorithmmentioning
confidence: 99%