Professional Documents
Culture Documents
ABSTRACT Principally, the OBA technique tries to allocate the optimum
number of bits for each of the quantizers to achieve maximum
The quantization process is the most significant part of any reduction in the Mean Square Error (MSE) between the
image transform coder, which solely governs the loss char- original and reconstructed signal. Initially, the Lagrange
acteristics during compression of the images. Hence, several multiplier method was used to obtain the required OBA so-
quantization techniques have been developed to achieve lution for the TCs [5]. In Lagrange multiplier method, the
better quantization performance for the image transform optimal bit allocation is performed based on the Variance
coders. The Optimum Non-negative Integer Bit Allocation characteristics of the transform coefficients; in which the
(ONIBA) is one of the impotent techniques that provide transform coefficient with higher variance will get higher bits
optimal quantization bits based on the Variance characteris- as compared to the coefficients that have low variances. The
tics of the transform coefficients for the best possible quan-
final OBA solution obtained from the Lagrange multiplier
tization in the image coders. However, the variance feature is
method is real-valued optimum bits but for the practical cases,
not supposed to be the best indicator for all types of variations
they must be non-negative integer values. Therefore, several
in the images. As a result, the performance of existing
ONIBA techniques can be improved by the utilization of other techniques have been proposed in the literature to obtain the
feature that can accurately estimate the image activities. OBA solution in the form of Optimum Non-negative Integer
Therefore, this paper presents a new Gradient Feature-based Bits (ONIBs). The technique that provides the required
ONIBA (GFONIBA) algorithm to achieve better quantization ONIBs for the OBA problem is commonly known as Opti-
for the DCT based image transform coders as compared to the mum Non-negative Integer Bit Allocation (ONIBA) Algo-
recent ONIBA algorithms. Extensive experiments are carried rithm. The first ONIBA algorithm was proposed by Fox [6],
out to validate the quantization performance of the proposed which is also known as a greedy algorithm. Subsequently,
GFONIBA algorithm. The results show that the proposed Feber and Zeger [7] proposed a low complexity ONIBA al-
GFONIBA algorithm outperforms and provide a significant gorithm for the TCs. Recently, in 2015, Hetam and Shirazi
gain in the reconstructed image quality as compared to the proposed a new version of the ONIBA algorithm, which not
recent ONIBA algorithms. only offers the lowest computational complexity for the op-
timal bit generation but also addresses the zero variance
Key words: DCT based transform coding, Image compres- conditions [8].
sion, Optimum bit allocation, Quantization.
Moreover, similar to the Lagrange multiplier method, all the
1. INTRODUCTION
existing ONIBA algorithms strongly depend on the Variance
Discrete Cosine Transform (DCT) based Transform Coding characteristics of the transform coefficients for the bit allo-
(TC) is the most important and popular technique for the cation process. That is, from the very first Real-valued solu-
tion of the OBA problem to its current ONIBA solution, the
signal coding and compression applications [1]-[3]. Usually,
in the lossy version of DCT-TCs, the quantization process of Variance characteristics of the transform coefficients has
the signal plays a crucial role and solely governs the recon- been utilized as an image activity indicator. However, in
struction quality of the coder [4]. In past decade, several 1999, Kim et al. [9], demonstrated that the variance feature
techniques have been developed to achieve better quantiza- provides a poor statistical measure of the image activity and
hence it has a weak impact on the bit allocation process.
tion of the DCT coefficients. Among the existing techniques,
the Optimum Bit Allocation (OBA) is the most significant Consequently, we can improve the quantization performance
approach that provides the optimum bits for the quantization of the existing ONIBA algorithms by the proper selection of
of DCT coefficients within the specified bit-budget [5]. the image activity feature. Therefore, in this work, the authors
present an improved ONIBA algorithm that utilizes image
gradient as an input image activity feature in place of the
1
Vikrant Singh Thakur et al., International Journal of Networks and Systems, 7(6), August – September 2018, 1 - 7
conventional variance feature. The ultimate aim of the pro- responsible for the loss of information during lossy com-
posed Gradient Feature-based ONIBA (GFONIBA) algo- pression. Thus, first, it is important to properly model the
rithm is to achieve the better quantization performance for the input and output relationship of the DCT quantizers. In case
DCT based image transform coders. The basic idea is to of the DCT based coders, the NOBs of size 8×8 are treated as
replace the variance feature based bit allocation process by the an independent source for the quantization process. Hence,
gradient feature based bit allocation. Hence, initially, the the total inputs available for the quantization are limited to
proposed gradient feature is applied for the Lagrange multi- 8×8 = 64, which requires M = 64 scalar quantizers to ac-
plier based optimal bit allocation and then subsequently ap- complish the quantization of a DCT transformed NOB. Let us
plied to the recent ONIBA algorithm proposed by Hetam and define the inputs available for the quantization as [5],
Shirazi [8]. Several experiments are then performed to F f 1 , f 2 ....... f M (1)
evaluate the quantization performance of the proposed
GFONIBA algorithm against the recent ONIBA algorithm of Where, f1 , f 2 ....... f M , are the DCT coefficients to be quantize
(())
[8] on the ground of two popular image quality indexes PSNR that are taken in raster scan order form a DCT NOB. Next, to
and MSSIM. The results obtained for the three standard test quantize the input source given in (1) we need k 1, 2, , M
images show that the proposed GFONIBA algorithm provides uniform scalar quantizers. Let us first determine an expres-
much better quantization of the DCT coefficients as compared sion for the distortion, and then we can find the bit allocation
to the existing ONIBA techniques. that minimizes the distortion using the conventional La-
grange multiplier method [5]. Suppose, R is the average
2. PROPOSED GRADIENT FEATURE BASED ONIBA number of bits per sample given to the encoder for the quan-
(GFONIBA) ALGORITHM FOR THE DCT BASED tization of DCT coefficients and if the encoder used Rk
IMAGE TRANSFORM CODER number of bits for the quantization of the kth DCT coefficient,
then
This section first presents a detailed formulation of the OBA
M
problem for the DCT based image transform coders. In the 1
next step, we present the mathematical description of the
R
M
Rk (2)
k 1
Lagrange multiplier based optimum bit allocation technique
The reconstruction error variance for the kth quantizer r2k is
which is the first OBA solution. In the last part of this section,
we present the brief description of the recent ONIBA tech- related to its input variance 2k by [5],
nique along with the development of the proposed GFONIBA
r2 k 2 2 R k 2 (3)
algorithm. k k
2
Vikrant Singh Thakur et al., International Journal of Networks and Systems, 7(6), August – September 2018, 1 - 7
3
Vikrant Singh Thakur et al., International Journal of Networks and Systems, 7(6), August – September 2018, 1 - 7
Then (12) becomes, Using (22) and (23) along with the interpretation of Theorem
1, we now present the final steps of the proposed GFONIBA
B 1 k
R k* (U 0 ) log 2 (15) algorithm as given in Algorithm 1. The proposed GFONIBA
M 2 G (U 0 ) algorithm shown in Algorithm 1 provides the desired ONIBA
solution based on the proposed gradient feature.
4
Vikrant Singh Thakur et al., International Journal of Networks and Systems, 7(6), August – September 2018, 1 - 7
Algorithm 1. Proposed GFONIBA Algorithm for the DCT based image proposed GFONIBA algorithm and the ONIBA algorithm of
transform coders.
Hetam and Shirazi [8], are tabulated in Table 1 to Table 6.
Table 1: PSNR comparison for test image Lena.
Step 1: Check 1 , 2,. , k are non-zero. If some of k s are
PSNR in db
zero, set Rk* 0 for the corresponding sources and set
ONIBA Algo- PSNR
k ' number of remaining j s. Then rename the rest of j s Bitrate Proposed
S. No. rithm given by Gain
as 1 , 2,. , k ' .
in bpp GFONIBA in dB
Hetam and
Step 2: Sort the remaining input sources to the quantizers with respect to
Algorithm
Shirazi [8]
their gradients k ' s in the ascending order. 1 0.2 28.204 29.107 0.903
Step 3: Set m 0, B0 ( m ) 0, and compute Rk*. 2 0.4 32.234 33.307 1.073
Step 4: While R *m 1 U ' m 0 set m m 1 and find B0 ( m) and 3 0.6 34.535 35.640 1.105
R*m1 U ' m recursively using (22) and (23). 4 0.8 35.869 36.969 1.099
5 1 37.045 38.168 1.123
Step 5: Set n m, U (n) {n 1,, M } and in Ref. 7 (Th. III.3) set
6 1.2 38.205 39.161 0.956
R * R* U ( n ) to find R* U ( n ) . Then set R* R* U ( n) . 7 1.4 38.885 39.909 1.024
8 1.6 39.561 40.640 1.078
4. RESULTS AND DISCUSSIONS 9 1.8 40.471 41.394 0.923
This section presents an extensive performance evaluation of 10 2 41.095 42.153 1.058
the proposed GFONIBA algorithm against the recent ONIBA Average PSNR Gain in dB 1.034
algorithm given by Hetam and Shirazi [8] on the ground of Table 2: PSNR comparison for test image Peppers.
image quality indexes PSNR [10]-[11] and MSSIM [12]. In PSNR in db
order to test the practical quantization performance of both ONIBA Algo- PSNR
the algorithms, they have been tested using the baseline JPEG Bitrate Proposed
S. No. rithm given by Gain
in bpp GFONIBA in dB
codec shown in Fig. 1. Meanwhile, for the proper evaluation Hetam and
of the quantization performance and its effect on the image Algorithm
Shirazi [8]
compression, both the algorithms have been tested for three 1 0.2 27.271 28.765 1.494
different greyscale test images each of size 512×512 as shown 2 0.4 31.792 32.944 1.152
in Figure 2. 3 0.6 33.661 34.695 1.034
4 0.8 34.767 35.421 0.654
5 1 35.577 36.301 0.725
6 1.2 36.313 36.911 0.598
7 1.4 36.799 37.434 0.635
8 1.6 37.227 38.054 0.827
9 1.8 37.655 38.766 1.111
10 2 38.468 39.478 1.009
Average PSNR Gain in dB 0.924
Table 3: PSNR comparison for test image F16_Jet.
(a) (b)
PSNR in db
PSNR
Bitrate ONIBA Algo- Proposed
S. No. Gain
in bpp rithm given by GFONIBA
Hetam and in dB
Algorithm
Shirazi [8]
1 0.2 27.054 27.815 0.761
2 0.4 31.288 32.608 1.320
3 0.6 33.826 35.256 1.430
4 0.8 35.609 37.110 1.501
5 1 37.239 38.790 1.551
(c) 6 1.2 38.429 39.996 1.567
Figure 2: Standard grayscale test images, (a) Lena.png, (b) Pep- 7 1.4 39.609 41.059 1.450
pers.png, and (c) F16_Jet.png. 8 1.6 40.425 42.011 1.586
9 1.8 41.439 42.942 1.503
Finally, after the compression and reconstruction of all the 10 2 42.382 43.873 1.491
three test images on various compression rates (in bpp), the Average PSNR Gain in dB 1.416
obtained values of PSNR and MSSIM parameters for the
5
Vikrant Singh Thakur et al., International Journal of Networks and Systems, 7(6), August – September 2018, 1 - 7
Table 4: MSSIM index comparison for Lena image. From, the final PSNR comparisons shown in Table 1 to Table
MSSIM index 3, it is clearly evident that the proposed GFONIBA algorithm
Percentage outperforms for all the three test images and provides average
Bitrate ONIBA Algo- Gain in
S. No. Proposed PSNR gains in the range of 0.9 to 1.5 dB as compared to the
in bpp rithm given by GFONIBA MSSIM recent ONIBA algorithm developed by Hetam and Shirazi.
Hetam and index
Algorithm Now, moving to the MSSIM index comparison shown from
Shirazi [8]
Table 4 to Table 6, the proposed GFONIBA algorithm again
1 0.2 0.769 0.791 2.859
provides better MSSIM values as compared to the recent
2 0.4 0.868 0.879 1.290
ONIBA algorithm with the average percentage gain of about
3 0.6 0.902 0.912 1.068 0.5 to 1.2 percent.
4 0.8 0.920 0.928 0.797
5 1 0.933 0.940 0.739 The above comparative analysis clearly justifies that the
6 1.2 0.944 0.948 0.470 proposed gradient feature based ONIBA algorithm can pro-
7 1.4 0.950 0.955 0.503 vide significantly better quantization of the DCT coefficient
8 1.6 0.956 0.961 0.593 as compared to the existing ONIBA algorithms. Conse-
9 1.8 0.962 0.966 0.467 quently, the proposed GFONIBA algorithm is a better alter-
10 2 0.966 0.971 0.496 native of the existing variance feature-based quantization
Average percentage gain in the MSSIM 0.928 techniques for the DCT based image transform coders.
6
Vikrant Singh Thakur et al., International Journal of Networks and Systems, 7(6), August – September 2018, 1 - 7