Computational and Mathematical Methods in MedicineVolume 2012 (2012), Article ID 935914, 7 pagesdoi:10.1155/2012/935914

Research Article

An Adaptive Coding Pass Scanning Algorithm for Optimal Rate Control in Biomedical Images

Hsi-Chin Hsin,¹ Tze-Yun Sung,² and Yaw-Shih Shieh²

¹Department of Computer Science and Information Engineering, National United University, Miaoli City 36003, Taiwan²Department of Electronics Engineering, Chung Hua University, Hsinchu City 30012, Taiwan

Received 13 June 2011; Accepted 15 August 2011

Academic Editor: Shengyong Chen

Copyright © 2012 Hsi-Chin Hsin et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

High-efficiency, high-quality biomedical image compression is desirable especially for the telemedicine applications. This paper presents an adaptive coding pass scanning (ACPS) algorithm for optimal rate control. It can identify the significant portions of an image and discard insignificant ones as early as possible. As a result, waste of computational power and memory space can be avoided. We replace the benchmark algorithm known as postcompression rate distortion (PCRD) by ACPS. Experimental results show that ACPS is preferable to PCRD in terms of the rate distortion curve and computation time.

1. Introduction

With the rapid growth of modern telemedicine techniques, high-efficiency image-processing algorithms are essentially in great demand [1, 2]. Wavelet transform (WT) [3–5] provides many desirable properties that are beneficial to the biomedical image applications. In general, the significant wavelet coefficients of an image are clustered within each subband; this property is the main idea behind the embedded block coding with optimized truncation (EBCOT) algorithm, which is the core of JPEG2000 [6, 7].

EBCOT adopts the post compression rate distortion (PCRD) algorithm for optimal rate control, which demands a large amount of memory space and leads to waste of computational power [8]. Du et al. utilized a fixed scan order to reduce the computation time [9], which however lacks adaptation. Vikram et al. proposed a scheme to estimate the rate distortion slopes of code blocks for adaptive rate control [10]. Fang et al. proposed a precompression scheme to avoid unneeded computations [11]. An et al. proposed a fractional upward shift for lossless image compression [12]. Auli-Llinas et al. proposed nonuniform adaptation for bit plane coding [13]. Balster et al. proposed inter-based adaptation to estimate the distortion value [14]. Xue et al. distributed the target bit rates adaptively to reduce the computational complexity [15].

This paper proposes an adaptive coding pass scanning (ACPS) algorithm to rearrange the coding passes of an image such that the most significant one has priority over others. In comparison with the complicated approach used in [10–15], which is either time consuming or hardware demanding, ACPS makes good use of the MQ table that is available at both encoder and decoder. As a result, there is no need to store and transmit any information about the contribution of coding passes, and it has the advantage of saving a lot of computation time, memory space and transmission time, which is preferable for many applications [16–20].

The remainder of this paper proceeds as follows. In Section 2, EBCOT is reviewed briefly. Section 3 describes the proposed ACPS algorithm. Experimental results are presented in Section 4. Conclusion is given in Section 5.

2. Review of EBCOT

The embedded block coding with optimized truncation (EBCOT) algorithm adopts wavelet transform for subband decomposition. It is a two-tier algorithm. Tier-1 performs bit plane coding (BPC) followed by arithmetic coding (AC). Tier-2 aims for optimal rate control. Figure 1 depicts the block diagram of EBCOT encoder. Three coding passes, namely the significance propagation (SP) pass, the magnitude refinement (MR) pass and the cleanup (CU) pass are defined in EBCOT. For a wavelet coefficient that is currently insignificant, if any of the 8 neighboring coefficients are significant, it is coded in the SP pass using the significance coding operation; otherwise, it is coded in the CU pass using the cleanup coding operation. If the coefficient becomes significant, its sign is then coded using the sign coding operation. The significant coefficients are recursively updated using the magnitude refinement coding operation in the MR pass. The bit streams of the coding passes can be further compressed by AC with the probability models stored in the MQ table.

Figure 1: Block diagram of the EBCOT encoder.

EBCOT applies the postcompression rate distortion (PCRD) algorithm for optimal rate control. Specifically, let be the code blocks of an image. is coded from the most significant bit plane to the least significant bit plane, and terminates at some point, says , resulting in a bit rate denoted by . All of the end points of coding passes are possible truncation points. The distortion incurred by discarding the coding passes after is denoted by . PCRD selects optimal truncation points by minimizing the total distortion given by with the following rate constraint: where is the target bit rate. As all of the code blocks including insignificant ones must be coded before PCRD, the drawbacks are wastes of computational power, execution time, and memory space.

3. Image Coding with Adaptive Coding Pass Scanning

For the telemedicine applications, the following question is often raised. Is there useful information available at both encoder and decoder based on which the contribution of coding passes can be obtained? If so, there is no need to transmit the scanning order of coding passes, from encoder to decoder, for optimal rate control. Motivated by the MQ coder, we propose a novel scheme to estimate the rate distortion slope (RDS) of coding passes. Only the coding passes with significant RDS are used to generate the final code stream, and the unneeded ones with insignificant RDS can be discarded before EBCOT tier-1. Thus, it has the advantage of saving computational power, memory space, and transmission time.

3.1. Adaptive Coding Pass Scanning Algorithm

In [16], we proposed the CBRDE algorithm to arrange the code blocks of an image adaptively. Specifically, let be a binary function of position in the th code block, at the th bit plane, and . The RDS of is defined as and are the distortion decreased and the coding bits increased for , respectively, is the expectation operation, is the entropy operation, and is the probability of less probable symbol (LPS), which can be obtained from the MQ table directly.

At each bit plane, each code block is coded with a sequence of three coding passes, that is, SP followed by MR and CU. All of the coding passes are possible truncation points. It is noted that more than 75% of the coding passes of an image are optimal truncation points, and more than 97% of which are either consecutive or one coding pass away from each other [21]. Motivated by the above, the adaptive coding pass scanning (ACPS) algorithm is thus proposed. As shown in Figure 2, if the RDS of the MR pass is greater than that of the SP pass, the MR pass should be performed immediately after the SP pass according to the PCRD algorithm, and the optimal segment should contain the SP and MR passes. However, unlike the CU pass, the MR pass may take place before the SP pass at each bit plane. In order to improve the compression performance, the above example is modified as follows. The scan order of SP and MR passes is rearranged such that the one with greater RDS should be coded first, which leads to the ACPS algorithm. Figure 3 depicts the flowchart of ACPS, in which CBRDE is used to estimate the RDS of coding passes.

Figure 2: RD curves formed by nonoptimal truncation point (empty circle), optimal truncation points (dark circles), and rearranged truncation point (double-ring circle) and are the RDS of the SP and MR passes in a code block.

Figure 3: Flowchart of the proposed ACPS algorithm.

3.2. Image Coder with ACPS

As a large amount of energy is in the LL subband, it should be coded first. For the coding passes of the non-LL subbands, the one with the greatest RDS should be coded as early as possible. Hence, we propose an image coder with ACPS. Block diagrams of the proposed encoder and decoder are shown in Figures 4 and 5, respectively. The encoding steps are as follows.

Figure 4: Block diagram of the proposed image encoder with ACPS.

Figure 5: Block diagram of the proposed image decoder with ACPS.

Step 1. Initialization. Decompose an image into wavelet subbands, quantize the transform coefficients, and divide each subband into code blocks. Initially, the fixed scan order [21] is used. More specifically, wavelet subbands are scanned in a zigzag order, from the lowest frequency subband to the highest frequency subband, the code blocks within each subband are scanned from left to right, top to bottom, the first coding pass for each code block is the CU pass, and the scan order at the next bit plane is the SP pass followed by the MR pass and the CU pass.

Step 2. Estimation of RDS. At the current bit plane, estimate the RDS of coding passes by CBRDE. ACPS is then used to rearrange the scan order of coding passes.

Step 3. Adaptive Scan of Coding Passes. As the LL subband contains lots of significant coefficients, the SP and MR passes in the LL subband are a top priority. All the SP and MR passes in the non-LL subbands have priority over the CU passes at the current bit plane.

Step 4. EBCOT tier-1 Encoding. After rearranging the coding passes at the current bit plane, EBCOT tier-1 is used to produce the code streams that can be transmitted to decoder immediately. For the next bit plane, go to step 2, and continue the steps in order. Terminate at any point while the accumulated bit rate reaches the target bit rate.To show the potential of ACPS, the following correct rate is utilized. Let the SP, MR, and CU passes in the th code block at the th bit plane be represented as , , and , respectively. and denote the location indices of , for the estimated scan order and the true scan order, respectively. We measure the correct rate of ACPS below: where is the total number of coding passes at the th bit plane. The results of images shown in Figure 6 are given in Table 1. It is noted that the correct rates for the first two bit planes are extremely high due to the suitable initialization using [21]. For the first few bit planes after the non-LL subbands become significant, the correct rates are less than 70%, because the MQ table is not quite reliable due to only a small number of significant coefficients appearing. However, the correct rates become higher as the MQ table becomes more reliable. The overall correct rate is approximately 80%. It justifies the soundness of ACPS.

Table 1: The correct rates of ACPS.

Image
Spine
Chest
Fetus
Head

Bit-plane 1
100%
100%
100%
100%

Bit-plane 2
100%
100%
100%
100%

Bit-plane 3
66.7%
66.7%
66.7%
63.7%

Bit-plane 4
70.3%
70.3%
74.5%
78.5%

Bit-plane 5
85.1%
71.9%
79.2%
69.5%

Bit-plane 6
70.4%
74.9%
78.5%
73.9%

Bit-plane 7
73.4%
78.3%
77.9%
76.7%

Bit-plane 8
79.2%
74.3%
73.1%
77.9%

(a)

(b)

(c)

(d)

Figure 6: Test images; (a) Spine (MRI), (b) Chest (X-ray), (c) Fetus (ultrasonic), and (d) Head (CT).

4. Experimental Results in Biomedical Image Processing

The proposed image coder with ACPS has been evaluated on various biomedical images. The experimental results of biomedical images shown in Figure 6, namely, spine, chest, fetus, and head, are given in this paper, which are representative of magnetic resonance image (MRI), X-ray, ultrasound, and computed tomography (CT) images, respectively. The 9/7-wavelet filters adopted by the JPEG2000 standard are used. The distortion is defined as the peak-signal-to-noise ratio (PSNR), together with the rate of bits per pixel (bpp) forms the rate distortion (RD) curve.

The RD curves of Spine and Chest images using ACPS and PCRD are comparable and more convex than that using the fixed scan order [21], as shown in Figures 7 and 8, respectively, where the horizontal and vertical axes are the bpp rates and PSNR values. For fetus and head images, ACPS is preferable to both PCRD and the fixed scan order, as shown in Figures 9 and 10, respectively.

Figure 7: RD curves of Spine MRI image using the fixed scan order [21] (solid line), PCRD (dashed line), and ACPS (dotted line).

Figure 8: RD curves of Chest X-ray image using the fixed scan order [21] (solid line), PCRD (dashed line), and ACPS (dotted line).

Figure 9: RD curves of Fetus ultrasonic image using the fixed scan order [21] (solid line), PCRD (dashed line), and ACPS (dotted line).

Figure 10: RD curves of Head CT image using the fixed scan order [21] (solid line), PCRD (dashed line), and ACPS (dotted line).

Since ACPS takes the place of PCRD, lots of insignificant coding passes can be discarded as early as possible, waste of computation time and memory space can be avoided, and a great improvement in speed results. As shown in Table 2, the speed-up ranges from 30% to 50%.

Table 2: Improvement in speed using ACPS compared to PCRD.

Image
Speed up

Spine (MRI)
32.7%

Chest (X-ray)
33.1%

Fetus (ultrasonic)
52.7%

Head (CT)
53.6%

5. Conclusion

In EBCOT, the code blocks of an image are independently coded with three coding passes, that is, SP followed by MR and CU passes. Any coding passes are possible truncation points, based on which, optimal truncation points can be obtained by using the PCRD algorithm. It requires that all the coding passes are coded and stored in the tier-1 of EBCOT; however, lots of insignificant coding passes are not needed, which in turn are discarded after PCRD. Instead of computing the true RDS, ACPS makes use of the estimated RDS. It is based on the MQ table, which is available at both encoder and decoder; thus, there is no need to transmit the scan order of the significant coding passes. Experimental results in biomedical image processing show that a great improvement in speed can be obtained by replacing PCRD with ACPS.

Acknowledgment

The National Science Council of Taiwan, Grant no. NSC-99-2221-E-239-034, supported this work.

References

S. Y. Chen, “Cardiac deformation mechanics from 4D images,” Electronics Letters, vol. 43, no. 11, pp. 609–611, 2007.

S. Y. Chen, J. Zhang, Q. Guan, and S. Liu, “Detection and amendment of shape distortions based on moment invariants for active shape models,” IET Image Processing, vol. 5, no. 3, pp. 273–285, 2011.

C. Cattani, “Harmonic wavelet approximation of random, fractal and high frequency signals,” Telecommunication Systems, vol. 43, no. 3-4, pp. 207–217, 2010.

C. Cattani and A. Kudreyko, “Harmonic wavelet method towards solution of the Fredholm type integral equations of the second kind,” Applied Mathematics and Computation, vol. 215, no. 12, pp. 4164–4171, 2010.

C. Cattani, “Shannon wavelets for the solution of integrodifferential equations,” Mathematical Problems in Engineering, vol. 2010, Article ID 408418, 22 pages, 2010.

D. Taubman, “High performance scalable image compression with EBCOT,” IEEE Transactions on Image Processing, vol. 9, no. 7, pp. 1158–1170, 2000.

T. Acharya and P.-S. Tsai, JPEG2000 Standard for Image Compression, Wiley-Interscience, New York, NY, USA, 2005.

M. Dyer, S. Nooshabadi, and D. Taubman, “Design and analysis of system on a chip encoder for JPEG2000,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 19, no. 2, Article ID 4703231, pp. 215–225, 2009.

W. Du, J. Sun, and Q. Ni, “Fast and efficient rate control approach for JPEG2000,” IEEE Transactions on Consumer Electronics, vol. 50, no. 4, pp. 1218–1221, 2004.

K. N. Vikram, V. Vasudevan, and S. Srinivasan, “Rate-distortion estimation for fast JPEG2000 compression at low bit-rates,” Electronics Letters, vol. 41, no. 1, pp. 16–18, 2005.

H. C. Fang, Y. W. Chang, T. C. Wang, C. T. Huang, and L. G. Chen, “High-performance JPEG 2000 encoder with rate-distortion optimization,” IEEE Transactions on Multimedia, vol. 8, no. 4, Article ID 1658028, pp. 645–653, 2006.

J. An and Z. Cai, “Efficient rate control for lossless mode of JPEG2000,” IEEE Signal Processing Letters, vol. 15, pp. 409–412, 2008.

F. Aulí-Llinàs and M. W. Marcellin, “Distortion estimators for bitplane image coding,” IEEE Transactions on Image Processing, vol. 18, no. 8, pp. 1772–1781, 2009.

E. J. Balster and W. F. Turri, “Fast PCRD-Opt computation in JPEG2000,” in Proceedings of the International Conference on Signals and Electronic Systems (ICSES '10), pp. 431–434, Gliwice, Poland, September 2010.

J. Xue, C. Li, and N. Zheng, “Proto-object based rate control for JPEG2000: an approach to content-based scalability,” IEEE Transactions on Image Processing, vol. 20, no. 4, pp. 1177–1184, 2011.

H. C. Hsin and T. Y. Sung, “Context-based rate distortion estimation and its application to wavelet image coding,” WSEAS Transactions on Information Science and Applications, vol. 6, no. 6, pp. 988–993, 2009.

S. Y. Chen, H. Tong, and C. Cattani, “Markov models for image labeling,” Mathematical Problems in Engineering, vol. 2012, Article ID 814356, 18 pages, 2012.

S. Y. Chen, H. Tong, Z. Wang, S. Liu, M. Li, and B. Zhang, “Improved generalized belief propagation for vision processing,” Mathematical Problems in Engineering, vol. 2011, Article ID 416963, 12 pages, 2011.

M. Li and W. Zhao, “Representation of a stochastic traffic bound,” IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 9, Article ID 5342414, pp. 1368–1372, 2010.

M. Li, W. S. Chen, and L. Han, “Correlation matching method for the weak stationarity test of LRD traffic,” Telecommunication Systems, vol. 43, no. 3-4, pp. 181–195, 2010.

F. Aulí-Llinàs, J. Serra-Sagristà, J. L. Monteagudo-Pereira, and J. Bartrina-Rapesta, “Efficient rate control for JPEG2000 coder and decoder,” in Proceedings of the Data Compression Conference (DCC '06), pp. 282–291, Snowbird, Utah, USA, March 2006.