An Efficient Adaptive Binary Range Coder and Its VLSI Architecture

Belyaev, Evgeny; Li, Kai; Gabbouj, Moncef; Li, Yunsong

doi:10.1109/tcsvt.2014.2372291

Cited by 21 publications

(15 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Different binary arithmetic coding algorithm seems to have different inefficient regions. For example, the algorithm of [19] appears to perform very well except for an inefficiency peak of about 10% at around p = 0.95. Conversely, the binary arithmetic coding algorithm of [20] seems to prefer the region of p around 0.9.…”

Section: B the Proposed Coding For Iid Binary Symbol Sourcesmentioning

confidence: 99%

A New Perspective on Improving the Lossless Compression Efficiency for Initially Acquired Images

Lin

2019

IEEE Access

View full text Add to dashboard Cite

A new lossless compression scheme of compressing the initially-acquired continuous-intensity images with a lossy compression algorithm to obtain higher compression efficiency is proposed. Even if a lossy algorithm is employed, for decoded original images, there is no loss of data in the same sense as the conventional lossless scheme. To realize the new idea, the compression efficiency of the existing lossy subband compression algorithm is improved at high bitrates. For the entropy coding part, a run-length based, symbol-grouping entropy coding method is introduced. For the quantization part, the entropy-constrained scalar quantization is implemented using a novel and simple thresholding method. Coding results show that bit savings of the proposed lossless scheme, which employs a lossy algorithm, over the conventional lossless scheme achieve a maximum of 27.2% and an average of 11.4% in our test.INDEX TERMS Lossless image compression, lossy subband image compression, compression efficiency at high bitrates, Golomb coding, run-length based entropy coding, entropy-constrained scalar quantization.

show abstract

Section: B the Proposed Coding For Iid Binary Symbol Sourcesmentioning

confidence: 99%

A New Perspective on Improving the Lossless Compression Efficiency for Initially Acquired Images

Lin

2019

IEEE Access

View full text Add to dashboard Cite

show abstract

“…The adaptive binary range coder (ABRC) reduced the burden in hardware implementation. Belyaev et al [23] reduced the bit capacity of multiplication for renormalization and avoided the utilization of multiple loops. The computational steps for decompression are more.…”

Section: Related Workmentioning

confidence: 99%

“…The coding efficiency also depends on the truncated bit plans as per adaptive binary range coder (ABRC) [23]. The pedestrian area (1920 9 1080) from the test video sequences is used to validate the coding efficiency.…”

Section: Encoding Performancementioning

confidence: 99%

“…But, the proposed AM VLSI-based JPEG2000 [37] FPGA-based binary arithmetic MQ-coder [21] Novel MQcoder [11] AMMQ-coder (proposed) Besides, the author separately computes the compression ratio for mother/daughter, Vassar, ballroom, pedestrian area and rush hour for the existing ABRC [23], M-coder, MQ-coder and the proposed AMMQ-coder architecture. Table 11 shows the compression ratio analysis for various datasets.…”

Section: Encoding Performancementioning

confidence: 99%

See 1 more Smart Citation

FPGA-based Auxiliary Minutest MQ-coder architecture of JPEG2000

Jayavathi¹,

Shenbagavalli²

2017

J Real-Time Image Proc

View full text Add to dashboard Cite

Embedded Block Coding with Optimized Truncation (EBCOT) used in JPEG2000 standard performs the sequential processing of code blocks for clear images. The employment of Matrix Quantizer (MQ) in EBCOT reduces the computational burden by generating the context decision pair from probabilistic estimation. But, it consumes huge devices and occupies large memory space that leads to the difficulties in hardware design. The bit truncation in MQ-coder reduces the computational complexities that lead to a reduction in the memory space occupation in the hardware platform. This paper proposes the Auxiliary Minutest MQ (AMMQ) architecture for bit truncation in the probability estimation of context decision pair making. The reduction in a number of bits minimizes the slice registers and lookup tables utilization that offers less flipflop consumption to achieve the compact chip development for JPEG2000 compression. Besides, the reduction in computational steps effectively minimizes the time delay and hence the high operating frequency. The comparative analysis of proposed AMMQ-coder architecture with the existing architectures regarding the memory assures the effectiveness of new way of bit truncation scheme in the JPEG2000 compression.

show abstract

“…In the BAC engine with low memory requirement, the multi-parameter probability update mechanism in [24] is used to estimate the probability for the next symbol. To reduce the memory consumption, a multiplication with low bit capacities is used in the coding interval subdivision instead of the large look-up table, since the multiplication cost can be comparable with the cost of using a look-up table in modern architectures [28].…”

Section: The Motivation Of Our Workmentioning

confidence: 99%

An enhanced entropy coding scheme for HEVC

Gao

Fan

Zhao

et al. 2016

Signal Processing: Image Communication

View full text Add to dashboard Cite

This paper presents a modification to Context-based Adaptive Binary Arithmetic Coding (CABAC) in High Efficiency Video Coding (HEVC), which includes an improved context modeling for transform coefficient levels and a binary arithmetic coding (BAC) engine with low memory requirement. In the improved context modeling for transform coefficient levels, the context model index for significance map is dependent on the number of the significant neighbors covered by a local template and its position within transform block (TB). To limit the total number of context models for significance map, TBs are split into different regions based on the coefficient position. The same region in different TBs shares the same context model set. For the first and second bins of the truncated unary scheme of absolute level minus one, their context model indices depend on the neighbors covered by a local template of the current transform coefficient level. Specifically, the context model index for the first bin is determined by the number of neighbors covered by the local template with absolute magnitude equal to 1 and larger than 1; for the second bin, its context model index is determined by the number of neighbors covered by the local template with absolute magnitude larger than 1 and larger than 2. Moreover, TB is also split into different regions to incorporate the coefficient position in the context modeling of the first bin in luma component. In the BAC engine with low memory requirement, the probability is estimated based on a multi-parameter probability update mechanism, in which the probability is updated with two different adaption speeds and use the average as the estimated probability for the next symbol.

show abstract

An Efficient Adaptive Binary Range Coder and Its VLSI Architecture

Cited by 21 publications

References 16 publications

A New Perspective on Improving the Lossless Compression Efficiency for Initially Acquired Images

A New Perspective on Improving the Lossless Compression Efficiency for Initially Acquired Images

FPGA-based Auxiliary Minutest MQ-coder architecture of JPEG2000

An enhanced entropy coding scheme for HEVC

Contact Info

Product

Resources

About