• Title/Summary/Keyword: Information input algorithm

Search Result 2,444, Processing Time 0.031 seconds

Pose Invariant 3D Face Recognition (포즈 변화에 강인한 3차원 얼굴인식)

  • 송환종;양욱일;이용욱;손광훈
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.2000-2003
    • /
    • 2003
  • This paper presents a three-dimensional (3D) head pose estimation algorithm for robust face recognition. Given a 3D input image, we automatically extract several important 3D facial feature points based on the facial geometry. To estimate 3D head pose accurately, we propose an Error Compensated-SVD (EC-SVD) algorithm. We estimate the initial 3D head pose of an input image using Singular Value Decomposition (SVD) method, and then perform a Pose refinement procedure in the normalized face space to compensate for the error for each axis. Experimental results show that the proposed method is capable of estimating pose accurately, therefore suitable for 3D face recognition.

  • PDF

SELF-TRAINING SUPER-RESOLUTION

  • Do, Rock-Hun;Kweon, In-So
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.355-359
    • /
    • 2009
  • In this paper, we describe self-training super-resolution. Our approach is based on example based algorithms. Example based algorithms need training images, and selection of those changes the result of the algorithm. Consequently it is important to choose training images. We propose self-training based super-resolution algorithm which use an input image itself as a training image. It seems like other example based super-resolution methods, but we consider training phase as the step to collect primitive information of the input image. And some artifacts along the edge are visible in applying example based algorithms. We reduce those artifacts giving weights in consideration of the edge direction. We demonstrate the performance of our approach is reasonable several synthetic images and real images.

  • PDF

A Force Control of Robot Manipulator Based on the Iterative Learning Control (반복 학습을 이용한 로봇 매니퓨레이터의 힘 제어)

  • 김대환;한창수;김갑순
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1994.10a
    • /
    • pp.577-583
    • /
    • 1994
  • The purpose of this paper is to study the force control law which can be implemented on a non-modified robot system. The external force control algorithm proposed in this paper can be designed by means of a classical and modern control law. We showed the validation and the possibility of muti-dimensional force control idea through the simulation and experiments. Also, the Iterative learning control is studied for compensating errors due to thr disturbances and nonlinear effects. The previous information(control input, error) was used to determine the control input of next trial. The experimental result show the vaidity of this algorithm.

  • PDF

Implementation of 3D Moving Target-Tracking System based on MSE and BPEJTC Algorithms

  • Ko, Jung-Hwan;Lee, Maeng-Ho;Kim, Eun-Soo
    • Journal of Information Display
    • /
    • v.5 no.1
    • /
    • pp.41-46
    • /
    • 2004
  • In this paper, a new stereo 3D moving-target tracking system using the MSE (mean square error) and BPEJTC (binary phase extraction joint transform correlator) algorithms is proposed. A moving target is extracted from the sequential input stereo image by applying a region-based MSE algorithm following which, the location coordinates of a moving target in each frame are obtained through correlation between the extracted target image and the input stereo image by using the BPEJTC algorithm. Through several experiments performed with 20 frames of the stereo image pair with $640{\times}480$ pixels, we confirmed that the proposed system is capable of tracking a moving target at a relatively low error ratio of 1.29 % on average at real time.

The Sequential GHT for the Efficient Pattern Recognition (효율적 패턴 인식을 위한 순차적 GHT)

  • 김수환;임승민;이규태;이태원
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.28B no.5
    • /
    • pp.327-334
    • /
    • 1991
  • This paper proposes an efficient method of implementing the generalized Hough transform (GHT), which has been hindered by an excessive computing load and a large memory requirement. The conventional algorithm requires a parameter space of 4 dimensions in detection a rotated, scaled, and translated object in an input image. Prior to the application of GHT to the input image, the proposed method determines the angle of rotation and the scaling factor of the test image using the proportion of the edge components between the reference image and test image. With the rotation angle and the scaling factor already determined, the parameter spaceis to be reduced to a simple array of 2 dimensions by applying the unit GHT only one time. The experiments with the image of airplanes reveal that both of the computing time and the requires memory size are reduced by 95 percent, without any degradatationof accuracy, compared with the conventional GHT algorithm.

  • PDF

Blind MMSE Equalization of FIR/IIR Channels Using Oversampling and Multichannel Linear Prediction

  • Chen, Fangjiong;Kwong, Sam;Kok, Chi-Wah
    • ETRI Journal
    • /
    • v.31 no.2
    • /
    • pp.162-172
    • /
    • 2009
  • A linear-prediction-based blind equalization algorithm for single-input single-output (SISO) finite impulse response/infinite impulse response (FIR/IIR) channels is proposed. The new algorithm is based on second-order statistics, and it does not require channel order estimation. By oversampling the channel output, the SISO channel model is converted to a special single-input multiple-output (SIMO) model. Two forward linear predictors with consecutive prediction delays are applied to the subchannel outputs of the SIMO model. It is demonstrated that the partial parameters of the SIMO model can be estimated from the difference between the prediction errors when the length of the predictors is sufficiently large. The sufficient filter length for achieving the optimal prediction is also derived. Based on the estimated parameters, both batch and adaptive minimum-mean-square-error equalizers are developed. The performance of the proposed equalizers is evaluated by computer simulations and compared with existing algorithms.

  • PDF

Deconvolution Based on the Reconstruction of Residue Polynomials (나머지 다정식의 재구성에 의한 디컨볼루션)

  • 유수현;김재구
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.22 no.6
    • /
    • pp.19-27
    • /
    • 1985
  • In most engineering problems the output of linear system could be expressed by a con-volution of finite input and impulse response. In this paper, the deconvolution algorithm based on the reconstruction of residue polynomials to get a convolution factor, impvlse response or system input, were considered. Two techniques, using a matrix and Euclid's algorithm were discussed. In the illustrated examples, the result showed high accuracy about 10-10 RMS error.

  • PDF

A Local Weight Learning Neural Network Architecture for Fast and Accurate Mapping (빠르고 정확한 변환을 위한 국부 가중치 학습 신경회로)

  • 이인숙;오세영
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.28B no.9
    • /
    • pp.739-746
    • /
    • 1991
  • This paper develops a modified multilayer perceptron architecture which speeds up learning as well as the net's mapping accuracy. In Phase I, a cluster partitioning algorithm like the Kohonen's self-organizing feature map or the leader clustering algorithm is used as the front end that determines the cluster to which the input data belongs. In Phase II, this cluster selects a subset of the hidden layer nodes that combines the input and outputs nodes into a subnet of the full scale backpropagation network. The proposed net has been applied to two mapping problems, one rather smooth and the other highly nonlinear. Namely, the inverse kinematic problem for a 3-link robot manipulator and the 5-bit parity mapping have been chosen as examples. The results demonstrate the proposed net's superior accuracy and convergence properties over the original backpropagation network or its existing improvement techniques.

  • PDF

A Study on TCVQ Using Orthogonal Spline Wavelet (직교 스플라인 웨이브렛 변환을 이용한 TCVQ 설계에 관한 연구)

  • 류중일;김인겸;김성만;정현민;박규태
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.11
    • /
    • pp.1383-1392
    • /
    • 1995
  • In this paper, the method to incorporate TCVQ(Trellis Copded Vector Quantizer) into the encoding of the wavelet trans formed(WT) image followed by a variable length coding(VLC) or an entropy coding(EC) is considered. By WT, an original image is separated into 10 bands with various resolutions and directional components. TCVQ used to compress these WT coefficients is a finite state machine that encodes the input source on the basis of the current input and the current state. Wavelet basis used in this paper is designed by orthogonal spline function. A modified set partitioning algorithm to Wang's is also presented. A simple modification to Wang's algorithm gives a highly time-efficient result. Proposed WT-TCVQ encoder shows a very competitive result, giving 37.46dB in PSNR at 1.002bpp when encoding 512$\times$512 LENA.

  • PDF

Bottleneck-based Siam-CNN Algorithm for Object Tracking (객체 추적을 위한 보틀넥 기반 Siam-CNN 알고리즘)

  • Lim, Su-Chang;Kim, Jong-Chan
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.1
    • /
    • pp.72-81
    • /
    • 2022
  • Visual Object Tracking is known as the most fundamental problem in the field of computer vision. Object tracking localize the region of target object with bounding box in the video. In this paper, a custom CNN is created to extract object feature that has strong and various information. This network was constructed as a Siamese network for use as a feature extractor. The input images are passed convolution block composed of a bottleneck layers, and features are emphasized. The feature map of the target object and the search area, extracted from the Siamese network, was input as a local proposal network. Estimate the object area using the feature map. The performance of the tracking algorithm was evaluated using the OTB2013 dataset. Success Plot and Precision Plot were used as evaluation matrix. As a result of the experiment, 0.611 in Success Plot and 0.831 in Precision Plot were achieved.