• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.10a
• /
• pp.62-64
• /
• 1998

유전 알고리즘은 전통적인 등반 알고리즘을 이용하여 구하기 어려웠던 최적화 문제를 해결하기 위한 강인한 (Robust) 탐색 기법이다. 특히 목적함수가 (1)여러 개의 국부 최대치를 가지거나 (2)수학적으로 표현이 불가능하거나 어렵거나 (3) 목적함수에 교란항이 섞여 있을 경우도 우수한 탐색 능력을 갖는 것으로 알려져 있다. 본 논문에서는 군집성 분석(cluster analysis)을 이용하여 군집화함으로써 유전 알고리즘을 이용하여 나타나는 다양한 해집합을 형성하는 개체군을 그룹화하고, 각 군집에 부여된 군집 적합도에 따라서 최적해를 구함으로써 최적값에 근접시킬 수 있는 탐색 알고리즘을 제안하였으며, 시뮬레이션의 출력이 특정한 테스트 함수의 형태로 나타난다고 가정한 경우에 확률적으로 나타나는 시뮬레이션 모델의 출력을 최대화하는 문제에 대하여 적용하고 분석하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.808-810
• /
• 2005

분 논문에서는 워터마크가 삽입된 영상의 비가시성과 강인성을 보장하기 위하여 주파수 영역 기반인 FFT(Fast Fourier Transform)을 이용하였다. 그리고 영상에 삽입된 워터마크를 정확하게 추출하기 위하여 워터마크에 삽입하는 키 사이의 직교성을 유지할 수 있는 그람-슈미트 정규직교화를 이용하였다. 실험을 통해 살펴본 결과 영상의 특징에 관계없이 랜덤계열에 민감한 워터마크를 추출할 수 있는 정확성 및 신뢰성을 가짐을 알 수 있었다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.1
• /
• pp.58-64
• /
• 2016

In this paper presents Robust k-means clustering-based high-speed bar code decoding method to blur and lighting. for fast operation speed and robust decoding to blur, proposed method uses adaptive local threshold binarization methods that calculate threshold value by dividing blur region and a non-blurred region. Also, in order to prevent decoding fail from the noise, decoder based on k-means clustering algorithm is implemented using area data summed pixel width line of the same number of element. Results of simulation using samples taken at various worst case environment, the average success rate of proposed method is 98.47%. it showed the highest decoding success rate among the three comparison programs.

• Journal of Broadcast Engineering
• /
• v.6 no.1
• /
• pp.50-57
• /
• 2001

A digital watermarking is a newly developed scheme to embed invisible or inaudible information Into the host data in order to insist the copyright of the owner or the creator. This paper describes a robust data embedding scheme that employs inner product and adaptive quantization. Compared to the previous works for digital watermarking, our proposed scheme can embed relatively large amount of Information, since a secrete key Is not directly relaxed to the watermark data. A secret key is used for the design of random direction vectors. which are taken Inner product with the DCT transformed feature set data. In odder to achieve robustness against malicious attacks. we exploit the Properties of human visual system In designing the random direction vectors which behave as embedded noises. Experimental results show that we can recover the embedded information without utilizing the original host data. We also demonstrate that the ownership assertion is possible even though The watermarked data may undergo common signal processing operations, such as JPEG compression. clopping. and filtering.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.357-368
• /
• 2003

Evaluation of shape similarity for 3D models is essential in many areas - medicine, mechanical engineering, molecular biology, etc. Moreover, as 3D models are commonly used on the Web, many researches have been made on the classification and retrieval of 3D models. In this paper, we describe methods for 3D shape representation and major concepts of similarity evaluation, and analyze the key features of recent researches for shape comparison after classifying them into four categories including multi-resolution, topology, 2D image, and statistics based methods. In addition, we evaluated the performance of the reviewed methods by the selected criteria such as uniqueness, robustness, invariance, multi-resolution, efficiency, and comparison scope. Multi-resolution based methods have resulted in decreased computation time for comparison and increased preprocessing time. The methods using geometric and topological information were able to compare more various types of models and were robust to partial shape comparison. 2D image based methods incurred overheads in time and space complexity. Statistics based methods allowed for shape comparison without pose-normalization and showed robustness against affine transformations and noise.

• The Journal of the Korea Contents Association
• /
• v.12 no.11
• /
• pp.1-8
• /
• 2012

The application of object recognition technology has been increased with a growing need to introduce automated system in industry. However, object transformed by noises and shadows appeared from illumination causes challenge problem in object detection and recognition. In this paper, an illumination invariant object detection using a DoG filter and adaptive threshold is proposed that reduces noises and shadows effects and reserves geometry features of object. And also, rotation invariant object recognition is proposed that has trained with neural network using classes categorized by object type and rotation angle. The simulation has been processed to evaluate feasibility of the proposed method that shows the accuracy of 99.86% and the matching speed of 0.03 seconds on ETRI database, which has 16,848 object images that has obtained in various lighting environment.

• The KIPS Transactions:PartB
• /
• v.15B no.4
• /
• pp.307-314
• /
• 2008

This paper presents a new robust watermarking method for curves that uses informed-detection. To embed watermarks, the presented algorithm parameterizes a curve using the B-spline model and acquires the control points of the B-spline model. For these control points, 2D mesh are created by applying Delaunay triangulation and then the mesh spectral analysis is performed to calculate the mesh spectral coefficients where watermark messages are embedded in a spread spectrum way. The watermarked coefficients are inversely transformed to the coordinates of the control points and the watermarked curve is reconstructed by calculating B-spline model with the control points. To detect the embedded watermark, we apply curve matching algorithm using inflection points of curve. After curve registration, we calculate the difference between the original and watermarked mesh spectral coefficients with the same process for embedding. By calculating correlation coefficients between the detected and candidate watermark, we decide which watermark was embedded. The experimental results prove the proposed scheme is more robust than previous watermarking schemes against print-scan process as well as geometrical distortions.

• 전자공학회논문지 IE
• /
• v.43 no.4
• /
• pp.37-42
• /
• 2006

This paper proposes a adaptive video watermarking algorithm according to bitrate and motion vector size in MPEG2 system. The watermark strength in the I-frames is adapted for quantization step size and the strength in the P-B-frames is adapted for quantization step size and motion vector of macroblock to make the watermark more robust against the accompanying degradation due to aggressively compression. A realtime watermark extraction is done directly in the DCT domain during MPEG decoding without full decoding of MPEG video. The experimental simulations show that the video quality results almost invisible difference between the watermarked frames and the original frames and the watermark is resistant to frame dropping, MPEG compression, GoP conversion and low pass filter attacks.

• Applied Chemistry for Engineering
• /
• v.9 no.2
• /
• pp.238-242
• /
• 1998

Wood powder filled phenolic resin composites of different composition were prepared and their mechanical properties were investigated for optimum conditions. The composites showed maximum mechanical strength when the phenolic resin content was 45 wt%. Polyurethane prepolymer(PU) was evaluated as a modifier of the phenolic resin composites. Blocking of the isocyanates in the PU with phenol was necessary for homogeneous mixing of raw materials for the components. Maximum mechanical strength of the PU modified composites was observed when the PU content was 5 wt%. It was found that the mechanical strength of the composites cured at $210^{\circ}C$ were higher than those of the composites cured at $150^{\circ}C$.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.203-216
• /
• 2004

Recent advances in video coding technology have resulted in rapid growth of application in mobile communication, With this explosive growth reliable transmission and error resilient technique become increasingly necessary to offer high quality multimedia service. In this paper, we present the result of our investigation on the error resilient performance evaluation of the MPEG-4 simple profile under the H.324/M and the H.264/AVC baseline under the IP packet networks. Especially, we have tested error resilient tools of MPEG-4 simple profile such as resynchronization marker insertion, data partitioning, and of H.264/AVC baseline such as the flexible macroblock ordering (FMO) scheme. The objective quality of decoded video is measured in terms of rate and PSNR under various random bit and burst error conditions.