• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.6
• /
• pp.112-122
• /
• 2009

In this paper, we present a novel space-frequency adaptive image restoration approach using vaguelette-wavelet decomposition (VWD). The proposed algorithm classifies a degraded image into flat and edge regions by using spatial information of the wavelet coefficient. For reducing the noise we perform an adaptive wavelet shrinkage process. At edge region candidates, we adopt entropy approach for estimating the noise and remove it by using relative between sub-bands. After shrinking wavelet coefficients process, we restore the degraded image using the VWD. The proposed algorithm can reduce the noise without affecting the sharpness details. Based on the experimental results, the proposed algorithm efficiently proved to be able to restore the degraded image while preserving details.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.101-103
• /
• 2016

Recently, the target object can be represented as sparse coefficient vector in visual tracking. Due to this reason, exploitation of the compressibility in the transform domain by using L1 minimization is needed. Further, L1 minimization is proposed to handle the occlusion problem in visual tracking, since tracking failures mostly are caused by occlusion. Furthermore, there is a weighted parameter in L1 minimization that influences the result of this minimization. In this paper, this parameter is analyzed for occlusion problem in visual tracking. Several coefficients that derived from median value of the target object, mean value of the arget object, the standard deviation of the target object are, 0, 0.1, and 0.01 are used as weighted parameter of L1 minimization. Based on the experimental results, the value which is equal to 0.1 is suggested as weighted parameter of L1 minimization, due to achieved the best result of success rate and precision performance parameter. Both of these performance parameters are based on one pass evaluation (OPE).

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.691-700
• /
• 1995

Most fractal image codings using fractal concept require long encoding time because a large amount of computation is needed to find an optimal affine transformation point. Such a problem can be solved by designing a block classifier fitted to characteristics of image blocks. In general, it is possible to predict more precise and various types of blocks in frequency domain than in spatial domain. In this paper, we propose a block classifier to predict the block type using characteristics of DCT(Discrete Cosine Transform). This classifier has merits to enhance the quality of decoded images as well as to reduce the encoding time meeting fractal features. AC coefficient values in frequency domain make it possible to predict various types of blocks. As the results, the number of comparisons between a range block and the correspoding domain blocks to reach an optimal affine transformation point can be reduced. Specially, signs of DCT coefficients help to find the optimal affine transformation point with only two isometric transformations by eliminating unnecessary isometric transformations among eight isometric transformations used in traditional fractal codings.

• 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.

• 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.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.6
• /
• pp.72-79
• /
• 2017

In this paper, we present a new saliency detection algorithm using the mutual information of wavelet subbands. Our method constructs an intermediate saliency map using the power operation and Gaussian blurring for high-frequency wavelet coefficients. After combining three intermediate saliency maps according to the direction of wavelet subband, we find the main directional components using entropy measure. The amount of mutual information of each subband is obtained centering on the subband having the minimum entropy The final saliency map is detected using Minkowski sum based on weights calculated by the mutual information. As a result of the experiment on CAT2000 and ECSSD databases, our method showed good detection results in terms of ROC and AUC with few computation times compared with the conventional methods.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.6
• /
• pp.100-105
• /
• 2017

This work presents an ECG biometric recognition system for the purpose of biometric authentication. ECG biometric approaches are divided into two major categories, fiducial-based and non-fiducial-based methods. This paper proposes a new non-fiducial framework using discrete cosine transform and a Random Forest classifier. When using DCT, most of the signal information tends to be concentrated in a few low-frequency components. In order to apply feature vector of Random Forest, DCT feature vectors of ECG heartbeats are constructed by using the first 40 DCT coefficients. RF is based on the computation of a large number of decision trees. It is relatively fast, robust and inherently suitable for multi-class problems. Furthermore, it trade-off threshold between admission and rejection of ID inside RF classifier. As a result, proposed method offers 99.9% recognition rates when tested on MIT-BIH NSRDB.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.6
• /
• pp.1419-1427
• /
• 2007

In this paper, we propose an algorithm which implements a multi-sided side match finite-state vector quantization(MSMVQ). After extracting the edge information from an image and classifying the image into edge blocks or non-edge blocks, we construct an edge map. We subdivide edge blocks into sixteen classes using discrete cosine transform(DCT) AC coefficients. Based on edge map information, a state codebook is made from the master codebook, and side match calculation is done for two-sided or three-sided current block of image. For reducing transmitted bits, a decision is made whether or not to encode the non-edge blocks among the pre-coded blocks by using the master codebook. Also for reducing allocation bits of codeword indices to decoder, a variable length coder is used. Considering the comparison with side match finite-state vector quantization(SMVQ) and two-sided SMVQ(TSMVQ) algorithm about Zelda, Lenna, Bridge and Peppers image, the new algorithm shows better picture quality than SMVQ and TSMVQ respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1713-1720
• /
• 1999

This paper presents a new key frame extraction technique, for scene change detection, using the proposed AHIM (Accumulative Histogram Intersection Measure) from the DC image constructed by DCT DC coefficients in the compressed video sequence that is video compression standard such as MPEG. For fast content-based browsing and video retrieval in a video database, we also provide a novel coarse-to-fine video indexing scheme. In the extracted key frame, we perform the region segmentation as a preprocessing. First, the segmented image is projected with the horizontal direction, then we transform the result into a histogram, which is saved as a database index. In the second step, we calculate the moments and change them into a distance value. From the simulation results, the proposed method clearly shows the validity and superiority in respect of computation time and memory space, and that in conjunction with other techniques for indexing, such as color, can provide a powerful framework for image indexing and retrieval.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1155-1166
• /
• 2016

In this paper, we propose a new embedded video compression scheme which uses three-dimensional rate-distortion optimization based block coder. After the proposed scheme removes temporal redundancy by applying the motion compensated temporal filtering(MCTF) on input video frames, two dimensional discrete wavelet transform is applied on video frames to remove spatial redundancy. The three-dimensional wavelet coefficients generated in this way are sorted according to their expected rate-distortion slope and encoded by using the three-dimensional block partition coding method. The proposed scheme also uses both the effective color video coding method which maintains embedded features, and the efficient bit-rate control method. Experimental results demonstrate that the proposed scheme not only produces embedded bit-streams, but also outperforms existing video compression schemes.