• Journal of Broadcast Engineering
• /
• v.9 no.1
• /
• pp.64-73
• /
• 2004

A robust watermarking algorithm is proposed for 3D mesh models. Watermark is inserted into the 2D image which is extracted from the target 3D model. Each Pixel value of the extracted 2D image represents a distance from the predefined reference points to the face of the given 3D model. This extracted image is defined as “range image” in this paper. Watermark is embedded into the range image. Then, watermarked 3D mesh is obtained by modifying vertices using the watermarked range Image. In extraction procedure, the original model is needed. After registration between the original and the watermarked models, two range images are extracted from each 3D model. From these images. embedded watermark is extracted. Experimental results show that the proposed algorithm is robust against the attacks such as rotation, translation, uniform scaling, mesh simplification, AWGN and quantization of vertex coordinates.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1797-1805
• /
• 1993

An algorithm for the threshold decision from the maximum mismatching correlation value in a direct-sequence spread-spectrum system is presented. This algorithm is named the TDMMC(Threshold Decision from the Maximum Mismatching Correlation value). The purpose of the algorithm is to set the decision threshold in the system which will provide large probability of signal detection. Using this algorithm, the proper setting of the threshold for various SNRs is possible. An additional block called the Threshold Block is used to improve the system performance. The result from the computer simmulation has shown that appling the TDMMC to the noncoherent DS/SS-CSK system can achieve performance improvement.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.3
• /
• pp.461-469
• /
• 2001

Existing area-based stereo algorithms rely heavily on rectangular windows for computing correspondence. While the algorithms with the rectangular windows are efficient, they generate relatively large matching errors due to variations of disparity profiles near depth discontinuities and doesnt take into account local deformations of the windows due to projective distortion. In this paper, in order to deal with these problems, a new correlation function with 4 directional line masks, based on robust estimator, is proposed for the selection of potential matching points. These points is selected to consider depth discontinuities and reduce effects on outliers. The proposed matching method finds an arbitrarily-shaped variable window around a pixel in the 3d array which is constructed with the selected matching points. In addition, the method take into account the local deformation of the variable window with a constant disparity, and perform the estimation of sub-pixel disparities. Experiments with various synthetic images show that the proposed technique significantly reduces matching errors both in the vicinity of depth discontinuities and in continuously smooth areas, and also does not be affected drastically due to outlier and noise.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.5
• /
• pp.253-261
• /
• 2013

In this paper, we study the problem of controlling composite asynchronous sequential machines. The considered asynchronous machine consists of two input/state machines in cascade connection, where the output of the front machine is delivered to the input channel of the rear machine. The objective is to design a corrective controller realizing model matching such that the stable state behavior of the closed-loop system matches that of a reference model. Since the controller receives the state feedback of the rear machine only, there exists uncertainty about the present state of the front machine. We specify the existence condition for a corrective controller given the uncertainty. The design procedure for the proposed controller is described in a case study.

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

In this paper, we propose a new accurate and robust image mosaic technique of the mural underdrawing taken from the infra-red camera, which is based on multiple image registration and adaptive blending technique. The image mosaicing methods which have been developed so far have the following deficits. It is hard to generate a high resolution image when there are regions that do not have features or intensity gradients, and there is a trade-off in overlapping region size in view of registration and blending. We consider these issues as follows. First, in order to mosaic images with neither noticeable features nor intensity gradients, we use a projected supplementary pattern and pseudo color image for features in the image pieces which are registered. Second, we search the overlapping region size with minimum blending error between two adjacent images and then apply blending technique to minimum error overlapping region. Finally, we could find our proposed method is more effective and efficient for image mosaicing than conventional mosaic techniques and also is more adequate for the application of infra-red mural underdrawing mosaicing. Experimental results show the accuracy and robustness of the algorithm

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.761-764
• /
• 1998

본 논문에서는 CCCD 카메라로부터 획득한 영상시퀀스들에서 인접한 두 영상 사이의 차영상과 얼굴이 가지는 컬러정보를 이용하여 분리한 얼굴 영역에서 양쪽 눈과 입의 위치좌표를 특징점으로 이용하여 입력된 얼굴에 자동정합된 변형가능 템플리트(deformable template)를 가지고 연속된 다음 프레임에서 얼굴 전체를 트래킹하는 알고리듬을 제안한다. 실제 입력영상의 얼굴 영역과 변형 가능 템플리트의 차이를 비교하기 위해 텍스쳐 매핑(Texture mapping)을 도입하여 트래킹의 정확도를 살펴본다.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.11
• /
• pp.93-101
• /
• 1997

A Hausdorff distance (HD) is one of commonly used measures for object matching. It calculates the distance between two point sets of edges in two-dimensional binary images without establishing correspondences. This paper proposes three object matching algorithm using robust HD measures based on M-estimation, least trimmed square (LTS), and .alpha.-trimmed mean methods, which are more efficient than the conventional HD measures. By computer simulation with synthetic and real images, the matching performance of the conventional HD smeasures and proposed' robust ones is compared.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1384-1392
• /
• 1999

A high compression rate is required to transmit video sequences over low bit rate networks such as low bit rate communication channels. When highly compressed videos are transmitted over mobile channels of high error rate, bitstreams corrupted by channel errors are not only difficult to be decoded, but also have fatal effects on the other parts of the bitstreams. In this Paper, we propose an error concealment algorithm for recovering the blocks which can not be decoded due to damaged bitstreams. The proposed error concealment algorithm recovers the damaged blocks using the information of adjacent blocks which are correctly decoded. In the proposed algorithm, the motion vector of the damaged block is estimated using the overlapped block motion compensation(OBMC) and block boundary matching(BBM) techniques. Experiment results show that the proposed algorithm exhibits better performance in PSNR than existing error concealment methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.6
• /
• pp.1-8
• /
• 2007

In this paper, research on joint optimization of the image spatial registration and the exposure compensation is conducted. The exposure compensation is performed in a frame work of the intensity compensation based on the polynomial approximation of the relationship between images. This compensation is jointly combined with the registration problem employing the Gauss-Newton nonlinear optimization method. In this paper, to perform for a simple and stable optimization, the block-coordinate method is combined with the Gauss-Newton optimization and extensively compared with the traditional approaches. Furthermore, regression analysis is considered in the compensation part for a better stable performance. By combining the block-coordinate method with the Gauss-Newton optimization, we can obtain a compatible performance reducing the computational complexity and stabilizing the performance. In the numerical result for a particular image, we obtain a satisfactory result for 10 repeats of the iteration, which implies a 50% reduction of the computational complexity. The error is also further reduced by 1.5dB compared to the ordinary method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.3
• /
• pp.1-9
• /
• 2009

Using the projected 2-dimensional tilted images obtained from the transmission electron microscopy, we can reconstruct the 3-dimensional structures of objects, such as cells. As a preprocessing procedure, the tilted images should be registered and compensated in terms of the spatial position and the intensity difference, respectively. In this paper, we employ the fiducial marker-based approach to perform a registration, and introduce a simple intensity compensation scheme. Based on the transmissivity image formation model, we propose an algorithm that can compensate the components of the illumination and transmissivity of each image according to the tilted angle. Numerical analysis using real images obtained from the transmission electron microscopy are shown in this paper to show the performance of the proposed algorithm.