• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1193-1200
• /
• 2005

In this paper, we proposed an image hiding method which decreases the amount of calculation encrypting partial data rather than the whole image data using a discrete wavelet transform and a linear scalar quantization which have been adopted as the main technique in JPEG2000 standard and then implemented the proposed algorithm to hardware. A chaotic system was used instead of encryption algorithms to reduce further amount of calculation. It uses a method of random changing method using the chaotic system of the data in a selected subband. For ciphering the quantization index it uses a novel image encryption algorithm of cyclical shifting to the right or left direction and encrypts two quantization assignment method (Top-down coding and Reflection coding), made change of data less. The experiments have been performed with the proposed methods implemented in software for about 500 images. The hardware encryption system was synthesized to find the gate-level circuit with the Samsung $0.35{\mu}m$ Phantom-cell library and timing simulation was performed, which resulted in the stable operation in the frequency above 100MHz.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7A
• /
• pp.1028-1036
• /
• 2000

In this paper, an error-resilient image compression technique using wavelet transform is proposed. The zerotree technique that uses properties of statistics, energy and directions of wavelet coefficients in the space-frequency domain shows effective compression results. Since it is highly sensitive to the propagation of channel errors, evena single bit error degrades the whole image quality severely. In the proposed algorithm, the image is encoded by the SPIHT(Set Partitioning in Hierarchical Trees) algorithm using the zerotree coding technique. Encoded bitstreams are partitioned into some blocks using the subband correlations and then fixed-length blocks are made by using the effective bit reorganization algorithm. finally, an effective bit allocation technique is used to limit error propagation in each block. Therefore, in low BER the proposed algorithm shows similar compression performance to the zerotree compression technique and in high BER it shows better performance in terms of PSNR than the conventional methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10A
• /
• pp.1177-1188
• /
• 2004

This paper describes and analyzes the performance of MB-OFDM UWB system that is suggested as one of standards in IEEE 802.15 TG3a for UWB application. UMBchannel model that has been contributed in IEEE 802.15 SG3a is a wideband channel model of 6Ghz bandwidth, so we modify it to have 3 subband channels that are obtained by filtering conventional U Channel, considering center frequency hopping and system bandwidth. From simulations, we compare performances of MB-OFDM system in AWGN and WB channel and verify the frequency and time domain diversity gains from time End frequency spreading technique. We also compare and analyze the performance of proposed SFBC MB-OFDM with that of conventional MB-OFDM system. Simulation results show SFBC MB-OFDM system outperforms conventional MB-OFDM system about 1.5dB of Eb/No at target BER of 10$^{-m4}$./.

• ETRI Journal
• /
• v.21 no.1
• /
• pp.1-27
• /
• 1999

We present a new description of envelope-function equation of the superlattice (SL). The SL wave function and corresponding effective-mass equation are formulated in terms of a linear combination of Bloch states of the constituent material with smaller band gap. In this envelope-function formalism, we review the fundamental concept on the motion of a wave packet in the SL structure subjected to steady and uniform electric fields F. The review confirms that the average of SL crystal momentums K = ($k_x,k_y,q$), where ($K_x,k_y$) are bulk inplane wave vectors and q SL wave vector, included in a wave packet satisfies the equation of motion = $_0+Ft/h$; and that the velocity and acceleration theorems provide the same type of group velocity and definition of the effective mass tensor, respectively, as in the Bulk. Finally, Schlosser and Marcus's method for the band theory of metals has been by Altarelli to include the interface-matching condition in the variational calculation for the SL structure in the multi-band envelope-function approximation. We re-examine this procedure more thoroughly and present variational equations in both general and reduced forms for SLs, which agrees in form with the proposed envelope-function formalism. As an illustration of the application of the present work and also for a brief investigation of effects of band-parameter difference on the subband energy structure, we calculate by the proposed variational method energies of non-strained $GaAs/Al_{0.32}Ga_{0.68}As$ and strained $In_{0.63}Ga_{0.37}As/In_{0.73}Ga_{0.27}As_{0.58}P_{0.42}SLs$ with well/barrier widths of $60{\AA}/500{\AA}$ and 30${\AA}/30{\AA}$, respectively.

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

Image interpolation in the wavelet domain usually takes advantage of the probabilistic models for the intrascale statistics and the interscale dependency. In this paper, we adopt the linear model for the absolute values of wavelet coefficients of interpolated image across scale to estimate the variances of extrapolated bands. The proposed algorithm uses randomly generated wavelet coefficients based on the estimated parameters for probabilistic model. Random number generation according to the estimated probabilistic model may induce the 'salt and pepper' noise in subbands. We reduce the noise power by Wiener filtering. We observe that the proposed method generates the histogram of the subband coefficients similar to the that of original image. Experimental results show that our method outperforms the previous wavelet-domain interpolation method as well as the conventional bicubic method.

• Journal of IKEEE
• /
• v.21 no.1
• /
• pp.39-45
• /
• 2017

Image compression is now essential for applications such as transmission and storage in data bases. For video and digital image applications the use of long tap filters, while not providing any significant coding gain, may increase the hardware complexity. We use a wavelet transform in order to obtain a set of bi-orthogonal sub-classes of images; First, the design of short kernel symmetric analysis is presented in 1-dimensional case. Second, the original image is decomposed at different scales using a subband filter banks. Third, this paper is presented a technique for obtaining 2-dimensional bi-orthogonal filters using McClellan transform. It is shown that suggested wavelet bases is well used on wavelet transform for image compression. From performance comparison of bi-orthogonal filter, we actually use filters close to ortho-normal filters on application of wavelet bases to image analysis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.714-725
• /
• 1997

This paper proposes an image compression method using the wavelet transform and bit-plane coding of wavelet coefficients. The hierarchical application of wavelet transform to an image produces one low resoluation(the subband with lowest frequency) image and several high frequency subbands. In the proposed method, the low resolution image is compressed by a lossless method at 8 bits per each coefficient. However, the high frequency subbands are decomposed into 8 bit planes. With an adptive block coding method, the decomposed bit planes are effectively compressed using localized edge information in each bit plane. In addition, the propsoed method can control bit rates by selectively eliminating lessimportant subbands of low significant bit planes. Experimental results show that the proposed scheme has better performance in the peak signal to noise ratio (PSNR) and compression rate than conventional image coding methods using the wavelet transform and vector quantization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11C
• /
• pp.1518-1526
• /
• 2004

In this paper, an algorithm using wavelet transform for detecting a cut that is a radical scene transition point, and fade and dissolve that are gradual scene transition points is proposed. The conventional methods using wavelet transform for this purpose is using features in both spatial and frequency domain. But in the proposed algorithm, the color space of an input image is converted to YUV and then luminance component Y is transformed in frequency domain using 2-level lifting. Then, the histogram of only low frequency subband that may contain some spatial domain features is compared with the previous one. Edges obtained from other higher bands can be divided into global, semi-global and local regions and the histogram of each edge region is compared. The experimental results show the performance improvement of about 17% in recall and 18% in precision and also show a good performance in fade and dissolve detection.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2C
• /
• pp.113-123
• /
• 2007

In Ubiquitous communication environment, various conversions of images are essential, and most digital images are compressed by standard methods such as the Joint Photographic Expert Group (JPEG) and Motion Picture Expert Group (MPEG) which are based on the discrete cosine transform (DCT). In this paper, various image resizing algorithms in the DCT domain are analyzed, and a new image resizing algorithm, which shows superior performance compared with the conventional methods, is proposed. For arbitrary-ratio image resizing in the DCT domain, several blocks of $8{\times}8$ DCT coefficients are converted into one block using the conversion formula in the proposed algorithm, and the size of the inverse discrete cosine transform (IDCT) is decided optimally. The performance is analyzed by comparing the peak signal to noise ratio (PSNR) between original images and converted images. The performance of the proposed algorithm is better than that of the conventional algorithm, since the correlation of pixels in images is utilized more efficiently.

• The KIPS Transactions:PartB
• /
• v.12B no.4 s.100
• /
• pp.421-428
• /
• 2005

A new method of Semi-fragile image watermarking which ensures the integrity of the contents of digital image is presented. Proposed watermarking scheme embeds watermark in the form of quantization noise on the wavelet transform coefficients in a specific mid frequency subbands selected from a wavelet packet decomposition based on energy distribution of wavelet transform coefficients. By controlling the strength of embedded watermark using HVS (Human Visual System) characteristic, it is imperceptible by a human viewer while robust against non-malicious attack such as compression for storage and/or transmission. When an attack is applied on the original image, it is highly probable that wavelet transform coefficients not only at the exact attack positions but also the neighboring ones are modified. Therefore, proposed authentication method utilizes whether both current coefficient and its neighbors are damaged. together. So it can efficiently detect and accurately localize attacks inflicted on the content of original image. Decision threshold for authentication can be user controlled for different application areas as needed.