Variable block-size transform image coder

1990 ◽  
Vol 38 (11) ◽  
pp. 2073-2078 ◽  
Author(s):  
I. Dinstein ◽  
K. Rose ◽  
A. Heiman
Keyword(s):  
Block Size ◽  
Variable Block ◽  
Image Coder

Image Compression Using Vector Quantization with Variable Block Size Division

2010 ◽  
Vol 130 (8) ◽  
pp. 1431-1439 ◽  
Author(s):  
Hiroki Matsumoto ◽  
Fumito Kichikawa ◽  
Kazuya Sasazaki ◽  
Junji Maeda ◽  
Yukinori Suzuki
Keyword(s):  
Image Compression ◽  
Vector Quantization ◽  
Block Size ◽  
Variable Block

scholarly journals A Stochastic Model for Block Segmentation of Images Based on the Quadtree and the Bayes Code for It

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 991
Author(s):  
Yuta Nakahara ◽  
Toshiyasu Matsushima
Keyword(s):  
Computational Cost ◽  
Block Size ◽  
Input Image ◽  
Generative Model ◽  
Image Size ◽  
Variable Block ◽  
General Data ◽  
The Difference ◽  
Segmentation Of Images ◽  
Target Data

In information theory, lossless compression of general data is based on an explicit assumption of a stochastic generative model on target data. However, in lossless image compression, researchers have mainly focused on the coding procedure that outputs the coded sequence from the input image, and the assumption of the stochastic generative model is implicit. In these studies, there is a difficulty in discussing the difference between the expected code length and the entropy of the stochastic generative model. We solve this difficulty for a class of images, in which they have non-stationarity among segments. In this paper, we propose a novel stochastic generative model of images by redefining the implicit stochastic generative model in a previous coding procedure. Our model is based on the quadtree so that it effectively represents the variable block size segmentation of images. Then, we construct the Bayes code optimal for the proposed stochastic generative model. It requires the summation of all possible quadtrees weighted by their posterior. In general, its computational cost increases exponentially for the image size. However, we introduce an efficient algorithm to calculate it in the polynomial order of the image size without loss of optimality. As a result, the derived algorithm has a better average coding rate than that of JBIG.

High speed SAD architecture for variable block size motion estimation in HEVC encoder

2016 ◽  
Author(s):  
Vu Nam Dinh ◽  
Hoang Anh Phuong ◽  
Duong Viet Duc ◽  
Phung Thi Kieu Ha ◽  
Pham Van Tien ◽  
...  
Keyword(s):  
Motion Estimation ◽  
High Speed ◽  
Block Size ◽  
Variable Block
Sign in / Sign up

Export Citation Format

Share Document