• Journal of Korea Multimedia Society
• /
• v.12 no.7
• /
• pp.929-940
• /
• 2009

This paper presents multipurpose watermarking scheme in coutourlet transform domain for copyright protection, authentication and transform detection. Since contourlet transform can detect more multi direction edge and smooth contour than wavelet transform, the proposed scheme embeds multi watermarks in contourlet domain based on 4-level Laplacian pyramid and 2-level directional filter bank. In the first stage of the robust watermarking scheme for copyright protection, we generates the sequence of circle patterns according to watermark bits and projects these patterns into the average of magnitude coefficients of high frequency directional subbands. Then the watermark bit is embedded into variance distribution of the projected magnitude coefficients. In the second stage that is the semi-fragile watermarking scheme for authentication and transform detection, we embed the binary watermark image in the low frequency subband of higher level by using adaptive quantization modulation scheme. From the evaluation experiment using Checkmark 2.1, we verified that the proposed scheme is superior to the conventional scheme in a view of the robustness and the invisibility.

• Journal of Korea Multimedia Society
• /
• v.14 no.7
• /
• pp.858-865
• /
• 2011

In order to allow the user to efficiently browse, select, and retrieve a desired video part without having to deal directly with GBytes of compressed data, classification of shot motion characteristic has to be carried out as a preparation for such user interaction. The organization of video information for video database requires segmentation of a video into its constituent shots and their subsequent characterization in terms of content and camera movement in shot. In order to classify shot motion, it is a conventional way to use element of motion vector. However, there is a limit to estimate global camera motion because the way that uses motion vectors only represents local movement. For shot classification in terms of motion information, we propose a new scheme consisting of partial decoding of INTRA pictures and comparing the x, y displacement vector curve between the decoded I-frame and next P-frame in compressed video data.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.4
• /
• pp.20-28
• /
• 2000

The error diffusion algorithm is good for reproducing continuous image to binary image. However the reproduction of edge characteristic is weak in power spectrum analysts of display error. In this paper, an error diffusion method which include pre-filter algorithm for edge characteristic enhancement is proposed Pre-filter algorithm is organized horizontal and vertical directional differential value and weighting function of pre-filter First, it is obtained the horizontal and vertical differential value from the peripheral pixels in original image using $3{\times}3$ Sobel operator Secondly weighting function of pre-filter is composed by function including absolute value and sign of differential value The improved Error diffusion algorithm using pre-filter, present a good result visually which edge characteristic is enhanced. The difference between orignal image and halftoning image is compared with edge-enhanced error diffusion algorithm by measuring the radially averaged power spectrum density.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2369-2381
• /
• 1999

In this paper, we propose an iterative algorithm for reducing the blocking artifact in block transform-coded images by using a wavelet transform. In the proposed method, an image is considered as a set of one-dimensional horizontal and vertical signals and one-dimensional wavelet transform is utilized in which the mother wavelet is the first order derivative of a Gaussian like function. The blocking artifact is reduced by removing the blocking component, that causes the variance at the block boundary position in the first scale wavelet domain to be abnormally higher than those at the other positions, using a minimum mean square error (MMSE) filter in the wavelet domain. This filter minimizes the MSE between the ideal blocking component-free signal and the restored signal in the neighborhood of block boundaries in the wavelet domain. It also uses local variance in the wavelet domain for pixel adaptive processing. The filtering and the projection onto a convex set of quantization constraint are iteratively performed in alternating fashion. Experimental results show that the proposed method yields not only a PSNR improvement of about 0.56-1.07 dB, but also subjective quality nearly free of the blocking artifact and edge blur.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.12
• /
• pp.46-54
• /
• 1998

In this paper we propose a fast adaptive image restoration filter using DCT-based block classification for reducing block artifacts in compressed images. In order to efficiently reduce block artifacts, edge direction of each block is classified by using the DCT coefficients, and the constrained least square (CLS) on the observation that the quantization operation in a series of coding process is a nonlinear and many-to-one mapping operator. And then we propose an approximated version of constrained optimization technique as a restoration process for removing the nonlinear and space-varying degradation operator. For real-time implementation, the proposed restoration filter can be realized in the form of a truncated FIR filter, which is suitable for postprocessing reconstructed images in HDTV, DVD, or video conference systems.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.1
• /
• pp.53-59
• /
• 2011

In many face recognition applications such as security systems, it is assumed that upright faces are given to the system. In order for the system to be used in more general environments, the system should be able to deal with the rotated faces properly. It is a generally used approach to rotate the face detection window and apply face detector repeatedly to detect a rotated face in the given image. But such an approach requires a lot of computation time. In this paper, a method of extracting the axis of symmetry for a given set of points is proposed. The axis of symmetry for the edge points in the face detection window is extracted in a way that is fast and accurate, and the face detector is applied only for that direction. It is shown that the mean and standard deviation of the symmetry detection error is $0^{\circ}$ and $3^{\circ}$ respectively, for the database used.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.12
• /
• pp.107-119
• /
• 1999

There is no authentic solution in a face detection problem though it is an important part of pattern recognition and has many diverse application fields. The reason is that there are many unpredictable deformations due to facial expressions, view point, rotation, scale, gender, age, etc. To overcome these problems, we propose an algorithm based on feature-based method, which is well known to be robust to these deformations. We detect a face by calculating a similarity between the formation of real face feature and candidate feature formation which consists of eyebrow, eye, nose, and mouth. In this paper, we use a steerable filter instead of general derivative edge detector in order to get more accurate feature components. We applied deformable template to verify the detected face, which overcome the weak point of feature-based method. Considering the low detection rate because of face detection method using whole input images, we design an adaptive skin-color filter which can be applicable to a diverse skin color, minimizing target area and processing time.

• Journal of Korea Multimedia Society
• /
• v.13 no.3
• /
• pp.410-416
• /
• 2010

This paper presents the auto-extraction method that searches for the Mapping points in the calibration algorithm of the image acquired by the wide angle CCD camera. In this algorithm, we remove the noise from the distorted image and then obtain the edge image. Proposed method extracts the distortion point, comparing the threshold value of the histogram of the horizontal and vertical pixel lines in edge image. This processing step can be directly applied to the original image of the wide angle CCD camera output. Proposed method results are compared with hand-worked result image using the two wide angle CCD cameras having different angles with the difference value of the result images respectively. Experimental results show that proposed method can allocate the distortion-calibration constant of the wide angle CCD camera regardless of lens type, distortion shape and image type.

• Journal of Internet Computing and Services
• /
• v.15 no.5
• /
• pp.95-105
• /
• 2014

In this paper, we present a novel ant-based hierarchical clustering algorithm, where ants repeatedly hop from one node to another over a weighted directed graph of k-nearest neighborhood obtained from a given dataset. We introduce a notion of node pheromone, which is the summation of amount of pheromone on incoming arcs to a node. The node pheromone can be regarded as a relative density measure in a local region. After a finite number of ants' hopping, we remove nodes with a small amount of node pheromone from the directed graph, and obtain a group of strongly connected components as clusters. We iteratively do this removing process from a low value of threshold to a high value, yielding a hierarchy of clusters. We demonstrate the performance of the proposed algorithm with synthetic and real data sets, comparing with traditional clustering methods. Experimental results show the superiority of the proposed method to the traditional methods.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.4
• /
• pp.302-312
• /
• 2001

As the data transfer rate between chips gets higher, both crosstalk and SSN (Simultaneous Switching Noise) deteriorate seriously the performance of a system. The proposed interface scheme uses P-CTR and N-CTR(Positive/Negative Constant Transition Rate) which encodes data at both falling and rising edges, where the transition directions of N-CTR and P-CTR are opposite. And the proposed bus system places two P-CTR drivers and two N-CTR drivers alternatively. In the proposed P/N-CTR interface scheme, the signals of neighboring interconnection lines at both sides of a bus will not switch simultaneously in the same direction, which leads to reduction in the maximum crosstalk and SSN compared to conventional interfaces. For verification of noise reduction of the proposed interface scheme, the scheme is applied to several kinds of bit-wide buses with various interconnection structures, and HSPICE simulation was performed with 0.35 ${\mu}{\textrm}{m}$ SPICE parameters. The simulation results show that in the 32-bit or less wide bus, the maximum SSN and crosstalk are reduced to at least 26.78% and 50%, respectively in comparison with the conventional interface scheme.