Efficient Hardware Implementation Of Haar Wavelet Transform With Line-Based And Dual-Scan Image Memory Accesses

Image compression is of great importance in multimedia systems and applications because it drastically reduces bandwidth requirements for transmission and memory requirements for storage. An image compression algorithm JPEG2000 isbased on Discrete Wavelet Transform. In the hardware implementation of DiscreteWavelet Transform (DWT) and inverse DiscreteWavelet Transform (IDWT),the main problems are storage memory, internal processing buffer, and the limitation of the FPGA resources. Based on non-separable 2-D DWT, the method used to access the image memory has a direct impact on the internal buffer size,the power consumption and, the transformation speed. The need for internal buffer reduces the image memory access time. The main objectives of this thesis are as follows; to implement a 2-D Haar wavelet transform for large gray-scale image, to reduce the number of image memory access by implementing the 2- D Haar wavelet transform with a suitable combination between using external memory and internal memory, and targeting a low-power and high-speed architecture based on multi-levels non-separable discrete Haar wavelet transform. In this work, the proposed two architectures reduce the number of image memory access. The line-based architecture reduces the internal buffer by 2 x 0.5 x N where N presents the image size. This happens for the low-pass coefficients and for the high-pass coefficients. The dual-scan architecture does not use the internal memory. Overall both architectures work well on the Altera FPGA board at frequency 100 MHz

Rate-control algorithms for non-embedded wavelet-based image coding

During the last decade, there has been an increasing interest in the design of very fast wavelet image encoders focused on specific applications like interactive real-time image and video systems, running on power-constrained devices such as digital cameras, mobile phones where coding delay and/or available computing resources (working memory and power processing) are critical for proper operation. In order to reduce complexity, most of these fast wavelet image encoders are non-(SNR)-embedded and as a consequence, precise rate control is not supported. In this work, we propose some simple rate control algorithms for these kind of encoders and we analyze their impact to determine if, despite their inclusion, the global encoder is still competitive with respect to popular embedded encoders like SPIHT and JPEG2000. In this study we focus on the non-embedded LTW encoder, showing that the increase in complexity due to the rate control algorithm inclusion, maintains LTW competitive with respect to SPIHT and JPEG2000 in terms of R/D performance, coding delay and memory consumption. © Springer Science+Business Media, LLC 2011This work was funded by Spanish Ministry of education and Science under grant DPI2007-66796-C03-03.Lopez Granado, OM.; Onofre Martinez-Rach, M.; Pinol Peral, P.; Oliver Gil, JS.; Perez Malumbres, MJ. (2012). Rate-control algorithms for non-embedded wavelet-based image coding. Journal of Signal Processing Systems. 68(2):203-216. https://doi.org/10.1007/s11265-011-0598-6S203216682Antonini, M., Barlaud, M., Mathieu, P., & Daubechies, I. (1992). Image coding using wavelet transform. IEEE Transaction on Image Processing, 1(2), 205–220.Cho, Y., & Pearlman, W.A. (2007). Hierarchical dynamic range coding of wavelet subbands for fast and efficient image compression. IEEE Transactions on Image Processing, 16, 2005–2015.Chrysafis, C., Said, A., Drukarev, A., Islam, A., & Pearlman, W. (2000). SBHP—A low complexity wavelet coder. In IEEE international conference on acoustics, speech and signal processing.CIPR: http://www.cipr.rpi.edu/resource/stills/kodak.html . Center for Image Processing Research.Davis, P. J. (1975) Interpolation and approximation. Dover Publications.Grottke, S., Richter, T., & Seiler, R. (2006). Apriori rate allocation in wavelet-based image compression. In Second international conference on automated production of cross media content for multi-channel distribution, 2006. AXMEDIS ’06 (pp. 329–336). doi: 10.1109/AXMEDIS.2006.12 .Guo, J., Mitra, S., Nutter, B., & Karp, T. (2006). Backward coding of wavelet trees with fine-grained bitrate control. Journal of Computers, 1(4), 1–7. doi: 10.4304/jcp.1.4.1-7 .ISO/IEC 10918-1/ITU-T Recommendation T.81 (1992). Digital compression and coding of continuous-tone still image.ISO/IEC 15444-1 (2000). JPEG2000 image coding system.Kakadu, S. (2006). http://www.kakadusoftware.com .Kasner, J., Marcellin, M., & Hunt, B. (1999). Universal trellis coded quantization. IEEE Transactions on Image Processing, 8(12), 1677–1687. doi: 10.1109/83.806615 .Lancaster, P. (1986). Curve and surface fitting: An introduction. Academic Press.Oliver, J., & Malumbres, M. (2001). A new fast lower-tree wavelet image encoder. In Proceedings of international conference on image processing, 2001 (Vol. 3, pp. 780–783). doi: 10.1109/ICIP.2001.958236 .Oliver, J., & Malumbres, M. P. (2006). Low-complexity multiresolution image compression using wavelet lower trees. IEEE Transactions on Circuits and Systems for Video Technology, 16(11), 1437–1444.Pearlman, W. A. (2001). Trends of tree-based, set partitioning compression techniques in still and moving image systems. In Picture coding symposium.Said, A., & Pearlman, A. (1996). A new, fast and efficient image codec based on set partitioning in hierarchical trees. IEEE Transactions on Circuits, Systems and Video Technology, 6(3), 243–250.Table Curve 3D 3.0 (1998). http://www.systat.com. Systat Software Inc.Wu, X. (2001). The transform and data compression handbook, chap. Compression of wavelet transform coefficients, (pp. 347–378). CRC Press.Zhidkov, N., & Kobelkov, G. (1987). Numerical methods. Moscow: Nauka

A flexible hardware architecture for 2-D discrete wavelet transform: design and FPGA implementation

The Discrete Wavelet Transform (DWT) is a powerful signal processing tool that has recently gained widespread acceptance in the field of digital image processing. The multiresolution analysis provided by the DWT addresses the shortcomings of the Fourier Transform and its derivatives. The DWT has proven useful in the area of image compression where it replaces the Discrete Cosine Transform (DCT) in new JPEG2000 and MPEG4 image and video compression standards. The Cohen-Daubechies-Feauveau (CDF) 5/3 and CDF 9/7 DWTs are used for reversible lossless and irreversible lossy compression encoders in the JPEG2000 standard respectively. The design and implementation of a flexible hardware architecture for the 2-D DWT is presented in this thesis. This architecture can be configured to perform both the forward and inverse DWT for any DWTfamily, using fixed-point arithmetic and no auxiliary memory. The Lifting Scheme method is used to perform the DWT instead of the less efficient convolution-based methods. The DWT core is modeled using MATLAB and highly parameterized VHDL. The VHDL model is synthesized to a Xilinx FPGA to prove hardware functionality. The CDF 5/3 and CDF 9/7 versions of the DWT are both modeled and used as comparisons throughout this thesis. The DWT core is used in conjunction with a very simple image denoising module to demonstrate the potential of the DWT core to perform image processing techniques. The CDF 5/3 hardware produces identical results to its theoretical MATLAB model. The fixed point CDF 9/7 deviates very slightly from its floating-point MATLAB model with a ~59dB PSNR deviation for nine levels of DWT decomposition. The execution time for performing both DWTs is nearly identical at -14 clock cycles per image pixel for one level of DWT decomposition. The hardware area generated for the CDF 5/3 is -16,000 gates using only 5% of the Xilinx FPGA hardware area, 2.185 MHz maximum clock speed and 24 mW power consumption. The simple wavelet image denoising techniques resulted in cleaned images up to -27 PSNR

Development of Lifting-based VLSI Architectures for Two-Dimensional Discrete Wavelet Transform

Two-dimensional discrete wavelet transform (2-D DWT) has evolved as an essential part of a modem compression system. It offers superior compression with good image quality and overcomes disadvantage of the discrete cosine transform, which suffers from blocks artifacts that reduces the quality of the inage. The amount of computations involve in 2-D DWT is enormous and cannot be processed by generalpurpose processors when real-time processing is required. Th·"efore, high speed and low power VLSI architecture that computes 2-D DWT effectively is needed. In this research, several VLSI architectures have been developed that meets real-time requirements for 2-D DWT applications. This research iaitially started off by implementing a software simulation program that decorrelates the original image and reconstructs the original image from the decorrelated image. Then, based on the information gained from implementing the simulation program, a new approach for designing lifting-based VLSI architectures for 2-D forward DWT is introduced. As a result, two high performance VLSI architectures that perform 2-D DWT for 5/3 and 9/7 filters are developed based on overlapped and nonoverlapped scan methods. Then, the intermediate architecture is developed, which aim a·: reducing the power consumption of the overlapped areas without using the expensive line buffer. In order to best meet real-time applications of 2-D DWT with demanding requirements in terms of speed and throughput parallelism is explored. The single pipelined intermediate and overlapped architectures are extended to 2-, 3-, and 4-parallel architectures to achieve speed factors of 2, 3, and 4, respectively. To further demonstrate the effectiveness of the approach single and para.llel VLSI architectures for 2-D inverse discrete wavelet transform (2-D IDWT) are developed. Furthermore, 2-D DWT memory architectures, which have been overlooked in the literature, are also developed. Finally, to show the architectural models developed for 2-D DWT are simple to control, the control algorithms for 4-parallel architecture based on the first scan method is developed. To validate architectures develcped in this work five architectures are implemented and simulated on Altera FPGA. In compliance with the terms of the Copyright Act 1987 and the IP Policy of the university, the copyright of this thesis has been reassigned by the author to the legal entity of the university, Institute of Technology PETRONAS Sdn bhd. Due acknowledgement shall always be made of the use of any material contained in, or derived from, this thesis

Noise reduction using wavelet cycle spinning: analysis of useful periodicities in the z-transform domain

Cycle spinning (CS) and a'trous algorithms are different implementations of the undecimated wavelet transform (UWT). Both algorithms can be used for UWT and even though the resulting wavelet coefficients are different, they keep a correspondence. This paper describes an analysis of the CS algorithm performed in the z-transform domain, showing the similarities and differences with the a'trous implementation. CS generates more wavelet coefficients than a'trous, but the number of significative and different coefficients is the same in both cases because of the occurrence of a periodic repetition in CS coefficients. Mathematical expressions for the relationship between CS and a'trous coefficients and for CS coefficient periodicities are provided in the z-transform domain. In some wavelet denoising applications, periodicities (present in the coefficients of the CS procedure) can also be found in the performance measure of the processed signals. In particular, in ultrasonic CS denoising applications, periodicities have been appreciated in the signal-to-noise ratio (SNR) of the ultrasonic denoised signals. These periodicities can be used to optimize the number of CS coefficients for an efficient implementation. Two examples showing the periodicities in the SNR are included. A selection of several reduced sets of CS wavelet coefficients has been utilized in the examples, and the SNRs resulting after denoising are analyzed.This work was partially supported by Spanish MCI Project DPI2011-22438 and MEC Project TIN2013-47272-C2-1-R. The translation of this paper was funded by the Universitat Politecnica de Valencia, Spain.Rodríguez-Hernández, MA.; San Emeterio, JL. (2016). Noise reduction using wavelet cycle spinning: analysis of useful periodicities in the z-transform domain. Signal, Image and Video Processing. 10(3):519-526. https://doi.org/10.1007/s11760-015-0762-8S519526103Daubechies, I.: Ten Lectures on Wavelets. SIAM, Philadelphia (1992)Mallat, S.: A Wavelet Tour of Signal Processing. Academic Press, New York (1999)Kovacevic, J., Goyal, V.K., Vetterli, M.: Signal Processing Fourier and Wavelet Representations. http://www.fourierandwavelets.org/SPFWR_a3.1_2012.pdf (2012)Burrus, C.S., Gopinath, R.A., Guo, H.: Introduction to Wavelets and Wavelet Transforms. Prentice-Hall, New Jersey (1998)Kamilov, U., Bostan, E., Unser, M.: Wavelet shrinkage with consistent cycle spinning generalizes total variation denoising. IEEE Signal Process. Lett. 19(4), 187–190 (2012)Kumar, B.K.S.: Image denoising based on non-local means filter and its method noise thresholding. Signal Image Video Process. 7, 1211–1227 (2013)Rezazadeh, S., Coulombe, S.: A novel discrete wavelet transform framework for full reference image quality assessment. Signal Image Video Process. 7, 559–573 (2013)Atto, A.M., Pastor, D., Mercier, G.: Wavelet shrinkage: unification of basic thresholding functions and thresholds. Signal Image Video Process. 5, 11–28 (2011)Yektaii, M., Ahmad, M.O., Bhattacharya, P.: A method for preserving the classifiability of digital images after performing a wavelet-based compression. Signal Image Video Process. 8, 169–180 (2014)Kanumuri, T., Dewal, M.L., Anand, R.S.: Progressive medical image coding using binary wavelet transforms. Signal Image Video Process. 8, 883–899 (2014)Kubinyi, M., Kreibich, O., Neuzil, J., Smid, R.: EMAT noise suppression using information fusion in stationary wavelet packets. IEEE Trans. Ultrason. Ferroelectr. Freq. Control 58, 1027–1036 (2011)Abbate, A., Koay, J., Frankel, J., Schroeder, S.C., Das, P.: Signal detection and noise suppression using a wavelet transform signal processor: application to ultrasonic flaw detection. IEEE Trans. Ultrason. Ferroelectr. Freq. Control 44, 14–26 (1997)Pardo, E., San Emeterio, J.L., Rodriguez, M.A., Ramos, A.: Noise reduction in ultrasonic NDT using undecimated wavelet transforms. Ultrasonics 44, e1063–e1067 (2006)Pardo, E., Emeterio, J.L., Rodriguez, M.A., Ramos, A.: Shift invariant wavelet denoising of ultrasonic traces. Acta Acust. United Acust. 94, 685–693 (2008)Shensa, M.J.: The discrete wavelet transform: wedding the a trous and Mallat algorithms. IEEE Trans. Signal Process. 40, 2464–2482 (1992)Coifman, R., Donoho, D.: Translation invariant de-noising. In: Antoniadis, A., Oppenheim, G. (eds.) Wavelets and Statistics, Lecture Notes in Statistics, pp. 125–150. Springer, Berlin (1995)Mallat, S.G.: A theory for multiresolution signal decomposition: the wavelet representation. IEEE Trans. Pattern Anal. Mach. Intell. 2, 674–693 (1989)Beylkin, G., Coifman, R., Rokhlin, V.: Fast wavelet transforms and numerical algorithms. Commun. Pure Appl. Math. 44, 141–183 (1991)Beylkin, G.: On the representation of operators in bases of compactly supported wavelets. SIAM J. Numer. Anal. 6(6), 1716–1740 (1992)Vaidyanathan, P.P.: Multirate Systems and Filter Banks. Prentice Hall, Englewood Cliffs (1992)Donoho, D.L., Johnstone, I.M.: Ideal spatial adaptation by wavelet shrinkage. Biometrika 81, 425–455 (1994)Donoho, D.L., Johnstone, I.M.: Adapting to unknown smoothness via wavelet shrinkage. J. Am. Stat. Assoc. 90, 1200–1224 (1995)Donoho, D.L., Johnstone, I.M., Kerkyacharian, G., Picard, D.: Wavelet shrinkage: Asymptotia? J. R. Stat. Soc. Ser. B 57, 301–369 (1995)Karpur, P., Shankar, P.M., Rose, J.L., Newhouse, V.L.: Split spectrum processing: optimizing the processing parameters using minimization. Ultrasonics 25, 204–208 (1997)Lazaro, J.C., San Emeterio, J.L., Ramos, A., Fernandez, J.L.: Influence of thresholding procedures in ultrasonic grain noise reduction using wavelets. Ultrasonics 40, 263–267 (2002)Donoho, D.L.: De-noising by soft thresholding. IEEE Trans. Inf. Theory 41, 613–627 (1995)Johnstone, I.M., Silverman, B.W.: Wavelet threshold estimators for data with correlated noise. J. R. Stat. Soc. 59, 319–351 (1997

Map online system using internet-based image catalogue

Digital maps carry along its geodata information such as coordinate that is important in one particular topographic and thematic map. These geodatas are meaningful especially in military field. Since the maps carry along this information, its makes the size of the images is too big. The bigger size, the bigger storage is required to allocate the image file. It also can cause longer loading time. These conditions make it did not suitable to be applied in image catalogue approach via internet environment. With compression techniques, the image size can be reduced and the quality of the image is still guaranteed without much changes. This report is paying attention to one of the image compression technique using wavelet technology. Wavelet technology is much batter than any other image compression technique nowadays. As a result, the compressed images applied to a system called Map Online that used Internet-based Image Catalogue approach. This system allowed user to buy map online. User also can download the maps that had been bought besides using the searching the map. Map searching is based on several meaningful keywords. As a result, this system is expected to be used by Jabatan Ukur dan Pemetaan Malaysia (JUPEM) in order to make the organization vision is implemented

Child labour: the case study in Bangladesh

Child labour involves of person that age below than 17 years old. Child labour often happen in poor countries such as Bangladesh. In Bangladesh, the issue of child labour might be the biggest issue. Bangladesh come up with Bangladesh Labour Act (BLA) that did not allow any person age below from fourteen years old to work (Nawshin et al, 2019). One of the aim or purpose of this act is to prevent teen workers in order to get the proper payment of any work. This is because when organization use child labour, they might be paid at lower rate because children usually do not have much responsible in their family compared to teen workers. This indirectly cause an economic matter in a family