Recursive Block Coding for Image Data Compression

Farrelle, Paul Michael

doi:10.1007/978-1-4613-9676-5

Cited by 44 publications

(19 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…These variances are then used with a bit allocation algorithm to find the bit allocation map. The following integer bit allocation algorithm [13] has been used. 4a) n *~(n * + 1)…”

Section: B Bit Allocation and Quantizationmentioning

confidence: 99%

Image coding using Periodic Walsh Piecewise-Linear transform

Belgassem

2009

2009 International Conference on Multimedia Computing and Systems

View full text Add to dashboard Cite

The analysis of image coding using Periodic Walsh Piecewise-Linear (PWL) transform will be presented in this paper. The coding method employs an integer bit allocation scheme and Llyod-Max quantizers. Experimental results have shown that best results are obtained by modeling the de coefficient using a one-sided Gaussian distribution and the ac coefficients by using a Laplacian distribution. Comparison of coding real images using the periodic Walsh piecewise-linear transform and some orthogonal transforms will be given. Computer simulation results indicate that the image coding efficiency of the periodic Walsh piecewise-linear transform is close to that of Walsh and Haar transforms from the PSNR viewpoint.transforms commonly used, the Cosine transform has been shown to possess a superior energy compaction property [10].In this paper, we will present the results of coding real images using Periodic Walsh Piecewise-Linear PWL transform. Comparison with the some orthogonal transform coding is also considered. In section II, we will briefly present the Periodic Walsh Piecewise-Linear transform. Section III introduces the two-dimensional image transformation. In section IV, a description of the coding method will be given. Simulations and experimental results are introduced in section IV. Concluding remarks are drawn in section V.

show abstract

“…These variances are then used with a bit allocation algorithm to find the bit allocation map. The following integer bit allocation algorithm [13] has been used. 4a) n *~(n * + 1)…”

Section: B Bit Allocation and Quantizationmentioning

confidence: 99%

Image coding using Periodic Walsh Piecewise-Linear transform

Belgassem

2009

2009 International Conference on Multimedia Computing and Systems

View full text Add to dashboard Cite

show abstract

“…The scalar quality measures [11] assessed in this study are listed in Table 1. All of the measures are bivariate, that is, they measure the differences between corresponding samples in the original image, f , and the (reconstructed) compressed image, f. The study also evaluated graphical image quality measures, such as histograms and Hosaka plots [12], against the results. However, the dimensional inconsistency between the graphical measures and the NIIRS rating did not facilitate correlation.…”

Section: Assessment Studymentioning

confidence: 99%

NIIRS and Objective Image Quality Measures

Hermiston

Booth

1999

Computer Analysis of Images and Patterns

View full text Add to dashboard Cite

Abstract. The introduction of image distortion during compression is of widespread concern, to the extent that the nature and size of the distortion may influence the choice of codec. The ability to quantify the distortion for particular applications is therefore highly desirable, particularly when options for new compression standards (such as JPEG 2000) are being considered. We report on the performance of several degradation measures that have been evaluated on optical imagery having previously undergone compression by the JPEG, wavelet and VQ codecs. The results show the relationship between the subjective National Imagery Interpretability Rating Scale (NIIRS) and several numerical image quality measures. An insight is provided into factors influencing NIIRS evaluation.

show abstract

“…In order to obtain the best possible reconstructed images that are of uniform quality throughout, the QMs for the DCT and the DST blocks must be jointly optimized as a function of the desired overall target bit rate. This is known as bit rate optimization and is unique to algorithms based on RBC [16].…”

Section: Introductionmentioning

confidence: 98%

<title>Low-bit-rate compression using recursive block coding techniques</title>

Venkatraraman

Farrelle

1994

Visual Information Processing III

View full text Add to dashboard Cite

The hybrid JPEG/recursive block coding (JPEG/RBC) algorithm introduced in [1] considerably reduces the tile effect and produces visually pleasing images. This paper proposes its use in low bit rate image coding and presents a quantization matrix (QM) design for the DST blocks that can be used for a wide range of low DST bit rates. The data rate optimization problem encountered in the JPEG/RBC algorithm is discussed and an empirical ratio of the bit rates for the DCT and the DST blocks is obtained for low bit rate image coding. Subjective evaluation [2] of images coded at low bit rates placed JPEG/RBC in the top group of three algorithms among those submitted for possible inclusion as the next generation bandwidth compression (BWC) algorithm in the National Imagery Transmission Format Standard (NITFS).

show abstract

Recursive Block Coding for Image Data Compression

Cited by 44 publications

References 0 publications

Image coding using Periodic Walsh Piecewise-Linear transform

Image coding using Periodic Walsh Piecewise-Linear transform

NIIRS and Objective Image Quality Measures

<title>Low-bit-rate compression using recursive block coding techniques</title>

Contact Info

Product

Resources

About