• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.931-934
• /
• 2003

DWT(Discrete Wavelet Transform)를 2차원 하드웨어로 구현하기 위해서 많은 하드웨어와 실행시간이 들기 때문에 효율적인 구조가 중요하다. 그래서, 이 논문에서는 2차원 DWT에 대한 효율적인 하드웨어 이용률과 크기의 감소, 완벽한 레지스터 이용률, 규칙적인 데이터 흐름으로 필터 길이의 확장을 쉽게 할 수 있도록 구조를 개선하고, 개선된 구조를 VHDL로 검증하였다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.27-32
• /
• 2005

An effective video watermarking algorithm is proposed to protect the copyright. The watermarking procedure is based on a three-dimensional discrete wavelet transform (3D DWT) and spread spectrum sequences. Two perceptual binary watermarks are preprocessed using mixing and pseudorandom permutation. After dividing the video sequence into video shots, the 3D DWT is performed, then the preprocessed watermarks are embedded into the 3D DWT coefficients, while considering robustness and invisibility, using two spread spectrum sequences defined as the user key. Experimental results show that the watermarked frames are subjectively indistinguishable from the original frames, plus the proposed video watermarking algorithm is sufficiently robust against such attacks as low pass filtering, frame dropping, frame average, and MPEG coding.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2012.05a
• /
• pp.340-342
• /
• 2012

Integral Imaging (II) is an attractive technique for three-dimensional (3D) image, video display and recording. Inherently, the high resolution II requires an enormous amount of data for storing and transmitting of 3D scenes. Compression techniques attempt to evade this issue. In this study, we made a comparative performance analysis of popular transforming/compression techniques such as the Discrete Cosine Transform (DCT) and the Discrete Wavelet Transform (DWT) in order to compress 3D-II. The standard baseline JPEG (Joint Photographic Experts Group) using DCT and JPEG 2000 using DWT methods were manipulated in our experiments. In our analysis, we have shown that the DWT based JPEG 2000 compression methodology could be a good alternative for 3D-II.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.5 s.305
• /
• pp.11-18
• /
• 2005

In this paper, we proposed a video watermarking algerian based on wavelet transform using statistical characteristic of video according to the energy distribution and the spread spectrum technique. In the proposed method, the original video is splitted by spatial difference metric and classified into the motion region and the motionless region according to the motion degree. The motion region is decomposed into 3-levels using 3D DWT and the motionless region is decomposed into 2-levels using 2D DWT The baseband of the wavelet-decomposed image is not utilized because of the image quality. So that the standard deviation of the highest subband coefficients except for the baseband is used to determine the threshold. Binary video watermarks preprocessed by the random permutation and the spread spectrum technique are embedded into selected coefficients. In computer experiments, the proposed algorithm was found to be more invisible and robust than the conventional algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.11
• /
• pp.993-1000
• /
• 2012

In this research, we proposed an efficient VLSI architecture of the lifting-based 2D DWT (Discrete Wavelet Transform) filter with 100% hardware utilization. The (9,7) filter structure has been applied and extendable to the filter length. We proposed a new block-based scheduling that computes the DWT for the lower levels on an "as-early-as-possible" basis, which means that the calculation for the lower level will start as soon as the data is ready. Since the proposed 2D DWT computes the outputs of all levels by one row-based scan, the intermediate results for other resolution levels should be kept in storage such as the Data Format Converter (DFC) and the Delay Control Unit (DCU) until they are used. When the size of input image is $N{\times}N$ and m is the filter length, the required storage for the proposed architecture is about 2mN. Since the proposed architecture processes the 2D DWT in horizontal and vertical directions at the same time with 4 input data, the total period for 2D DWT is $N^2(1-2^{-2J})/3$.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.12
• /
• pp.39-47
• /
• 2010

This paper proposes a fully-utilized block-based 2D DWT architecture, which consists of four 1D DWT filters with two-channel QMF PR Lattice structure. For 100% hardware utilization, we propose a new method which processes four input values at the same time. On the contrary to the image-based 2D DWT which requires large memories, we propose a block-based 2D DWT so that we only need 2MN-3N of storages, where M and N stand for filter lengths and width of the image respectively. Furthermore, the proposed architecture processes in horizontal and vertical directions simultaneously so that it computes the DWT for an $N{\times}N$ image within a period of $N^2(1-2^{-2J})/3$. Compared to existing approaches, the proposed architecture shows 100% of hardware utilization and high throughput rate. However, the proposed architecture may suffer from the long critical path delay due to the cascaded lattices in 1D DWT filters. This problem can be mitigated by applying the pipeline technique with maximum four level. The proposed architecture has been designed with VerilogHDL and synthesized using DongbuAnam $0.18{\mu}m$ standard cell.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.691-694
• /
• 2003

This paper proposes an 3D face image watermarking method based on discrete wavelet transform(DWT). First, 3D face image are transformed by DWT and inserted gaussian watermark into frequency domain. To increase the robustness and perceptual invisibility of watermark, the proposed algorithm is combined with the characteristics of 3D face image and human visual system. The proposed method is invisible and blind watermarking which the original image is not required. Simulation results show that the proposed method is robust to the general attack such as JPEG compression, enhancement, noise, cropping, and filtering etc.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6A
• /
• pp.618-627
• /
• 2002

In processing images using 2 dimensional Discrete Wavelet Transform(2D-DWT), the method to process the pixels around the image boundary may affect the quality of image and the cost to implement in hardware and software. This paper proposed an effective method to treat the boundary pixels, which is apt to implement in hardware and software without losing the quality of the image costly. This method processes the 2-D image as 1-D array so that 2-D DWT is performed by considering the image with the serial-sequential data structure (Serial-Sequential Processing). To show the performance and easiness in implementation of the proposed method, an image compression codec which compresses image and reconstructs it has been implemented and experimented. It included log-scale fried quantizer, but the entropy coder was not implemented. From the experimental results, the proposed method showed the SNR of almost the same SNR(Signal to Noise Ratio) to the Periodic Expansion(PE) method when the compression ratio(excluding entropy coding) of 2:1, 15.3% higher than Symmetric Expansion(SE) method, and 9.3% higher than 0-pixel Padding Expansion(ZPE) method. Also PE method needed 12.99% more memory space than the proposed method. By considering only the compression process, SE and ZPE methods needed additional operations than the proposed one. In hardware implementation, the proposed method in this paper had 5.92% of overall circuit as the control circuit, while SE, PE, and ZPE method has 22%, 21,2%, and 11.9% as the control circuit, respectively. Consequently, the proposed method can be thought more effective in implementing software and hardware without losing any image quality in the usual image processing applications.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.49-52
• /
• 2000

This paper is to propose an algorithm to reduce the calculation time to perform the 2-dimensional Discrete Wavelet Transform(2DWT). We call this algorithm as Reduced 2-dimensional Discrete Wavelet Transformation(R2DWT). This algorithm uses a modified Mallat-tree such that in each level, the column transform is performed only with the low-pass filtered row transform result. The resulting number of sub-band regions is 2L＋1, meanwhile the original(2DWT) has 3L＋1 sub-regions, where L is the transform level. To show the proposed algorithm is useful without much loss in SNR(Signal-to-Noise Ratio), we performed experiments with various images. The results showed that above 5:1 in compression ratio, the proposed algorithm has less than 0.SdB difference in SNR from 2DWT with about 25% reduction in calculation time.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.269-270
• /
• 2007

In previous work[1], each codeblock is coded using a context which is adaptively selected from three kinds of scanning directions after 3D DWT. But some subbands still have correlations among the coefficients in horizontal, vertical or temporal direction. In this paper, we propose a new 3D DWT-based video compression technique in which the difference of coefficients is calculated in one of three directions for every codeblocks and coded by a context adaptively selected for each codeblock. Experimental results show that the proposed compression technique outperforms measurably and visually compared to the conventional DWT-based techniques.