• Title/Summary/Keyword: Information input algorithm

Search Result 2,444, Processing Time 0.029 seconds

Active Vibration Control of Plate using PZT (압전세라믹 액츄에이터를 이용한 평판의 능동 진동 제어)

  • Kim, Joon-Kook;Choi, Soo-Young;Cho, Yong-Suk;Park, Ki-Heon
    • Proceedings of the KIEE Conference
    • /
    • 2004.07d
    • /
    • pp.2389-2391
    • /
    • 2004
  • This paper is concerned with the active vibration control of plate system using electromagnetic force actuator. The transfer function from the force input to the bending displacement was obtained via modal analysis results. Control algorithm are proposed and implemented on the experimental setups to show their efficacy. In this paper, the genetic algorithm is used to design a $H_2$ controller. Effectiveness and performance of the designed controller were verified by simulation and experiment results.

  • PDF

Rotated face detection based on sharing features (특징들의 공유에 의한 기울어진 얼굴 검출)

  • Song, Young-Mo;Ko, Yun-Ho
    • Proceedings of the IEEK Conference
    • /
    • 2009.05a
    • /
    • pp.31-33
    • /
    • 2009
  • Face detection using AdaBoost algorithm is capable of processing images rapidly while having high detection rates. It seemed to be the fastest and the most robust and it is still today. Many improvements or extensions of this method have been proposed. However, previous approaches only deal with upright faces. They suffer from limited discriminant capability for rotated faces as these methods apply the same features for both upright and rotated faces. To solve this problem, it is necessary that we rotate input images or make independently trained detectors. However, this can be slow and can require a lot of training data, since each classifier requires the computation of many different image features. This paper proposes a robust algorithm for finding rotated faces within an image. It reduces the computational and sample complexity, by finding common features that can be shared across the classes. And it will be able to apply with multi-class object detection.

  • PDF

Study on Effective Lane Detection Using Hough Transform and Lane Model (허프변환과 차선모델을 이용한 효과적인 차선검출에 관한 연구)

  • Kim, Gi-Seok;Lee, Jin-Wook;Cho, Jae-Soo
    • Proceedings of the IEEK Conference
    • /
    • 2009.05a
    • /
    • pp.34-36
    • /
    • 2009
  • This paper proposes an effective lane detection algorithm using hugh transform and lane model. The proposed lane detection algorithm includes two major components, i.e., lane marks segmentation and an exact lane extraction using a novel postprocessing technique. The first step is to segment lane marks from background images using HSV color model. Then, a novel postprocessing is used to detect an exact lane using Hugh transform and lane models(linear and curved lane models). The postprocessing consists of three parts, i.e, thinning process, Hugh Transform and filtering process. We divide input image into three regions of interests(ROIs). Based on lane curve function(LCF), we can detect an exact lane from various extracted lane lines. The lane models(linear and curved lane mode]) are used in order to judge whether each lane segment is fit or not in each ROIs. Experimental results show that the proposed scheme is very effective in lane detection.

  • PDF

Implementation of Speech Recognition Security System Using Speaker Defendent Algorithm (화자 종속 알고리즘을 이용한 음성 인식 보안 시스템 구현)

  • 김영현;문철홍
    • Proceedings of the IEEK Conference
    • /
    • 2003.11a
    • /
    • pp.65-68
    • /
    • 2003
  • In this paper, a speech recognition system using a speaker defendant algorithm is implemented on the PC. Results are loaded on a LDM display system that employs Intel StrongArm SA-1110. This research has completed so that this speech recognition system may correct its shortcomings. Sometimes a former system is operated by similar speech, not a same one. To input a vocalization is processed two times to solve mentioned defects. When references are creating, variable start-point and end-point are given to make efficient references. This references and new references are changed into feature parameter, LPC and MFCC. DTW is excuted using feature parameter. This security system will give user permission under fore execution have same result.

  • PDF

Speaker Verification System Using Support Vector Machine with Genetic Algorithms (유전자 알고리즘을 결합한 Support Vector Machine의 화자인증에서의 성능분석)

  • 최우용;이경희;반성범
    • Proceedings of the IEEK Conference
    • /
    • 2003.11a
    • /
    • pp.557-560
    • /
    • 2003
  • Voice is one of the promising biometrics because it is one of the most convenient ways human would distinguish someone from others. The target of speaker verification is to divide the client from imposters. Support Vector Machine(SVM) is in the limelight as a binary classifier, so it can work well in speaker verification. In this paper, we combined SVM with genetic algorithm(GA) to reduce the dimensionality of input feature. Experiments were conducted with Korean connected digit database using different feature dimensions. The verification accuracy of SVM with GA is slightly lower than that of SVM, but the proposed algorithm has greater strength in the memory limited systems.

  • PDF

A Study on Improvement of Retrieval Algorithm for Audio Response Service (음성정보 서비스의 검색 알고리즘 개선 연구)

  • Jeong, Yoo-Hyeon;Kim, Soon-Hyop
    • The Journal of the Acoustical Society of Korea
    • /
    • v.16 no.5
    • /
    • pp.92-95
    • /
    • 1997
  • Thlephone pushbuttons simply consist of 0~9 digits, #, and ${\ast}$). So it is difficulty for user to input the various query command for information retrieval of audio response sevice. We suggest the new retrieval algorithm for audio response service using Korean initial sounds sequences. User those who do not know the retrieval code can retrieve the audio response service by pushing the telephone digit buttons which correspond to initial sounds of its name.

  • PDF

Efficient MPEG-2 Video Transcoding with Scan Format Conversion (스캔 포맷 변환을 지원하는 효율적인 MPEG-2 동영상 트랜스코딩)

  • 송병철;천강욱
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.2040-2043
    • /
    • 2003
  • General-purpose MPEG-2 video transcoders must be able to achieve any conversion between 18 ATSC (Advanced television system committee) video formats for DTV (digital television), e.g., scan format, size format, and frame rate format conversion. Especially, scan format conversion is hard to implement because frame rate and size format conversion often happen together. This paper proposes a fast motion estimation(ME) algorithm for MPEG-2 video transcoding supporting scan format conversion. Firstly, we extract and compose a set of candidate motion vectors (MV's) from the input bit-stream to comply with the re-encoding format. Secondly, the best MV is chosen among several candidate MV's by using a weighted median selector. Simulation results show that the proposed ME algorithm reduces significantly transcoding complexity with a minor PSNR degradation.

  • PDF

3D Head Pose Estimation Using The Stereo Image (스테레오 영상을 이용한 3차원 포즈 추정)

  • 양욱일;송환종;이용욱;손광훈
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.1887-1890
    • /
    • 2003
  • This paper presents a three-dimensional (3D) head pose estimation algorithm using the stereo image. Given a pair of stereo image, we automatically extract several important facial feature points using the disparity map, the gabor filter and the canny edge detector. To detect the facial feature region , we propose a region dividing method using the disparity map. On the indoor head & shoulder stereo image, a face region has a larger disparity than a background. So we separate a face region from a background by a divergence of disparity. To estimate 3D head pose, we propose a 2D-3D Error Compensated-SVD (EC-SVD) algorithm. We estimate the 3D coordinates of the facial features using the correspondence of a stereo image. We can estimate the head pose of an input image using Error Compensated-SVD (EC-SVD) method. Experimental results show that the proposed method is capable of estimating pose accurately.

  • PDF

RC Tree Delay Estimation (RC tree의 지연시간 예측)

  • 유승주;최기영
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.12
    • /
    • pp.209-219
    • /
    • 1995
  • As a new algorithm for RC tree delay estimation, we propose a $\tau$-model of the driver and a moment propagation method. The $\tau$-model represents the driver as a Thevenin equivalent circuit which has a one-time-constant voltage source and a linear resistor. The new driver model estimates the input voltage waveform applied to the RC more accurately than the k-factor model or the 2-piece waveform model. Compared with Elmore method, which is a lst-order approximation, the moment propagation method, which uses $\pi$-model loads to calculate the moments of the voltage waveform on each node of RC trees, gives more accurate results by performing higher-order approximations with the same simple tree walking algorithm. In addition, for the instability problem which is common to all the approximation methods using the moment matching technique, we propose a heuristic method which guarantees a stable and accureate 2nd order approximation. The proposed driver model and the moment propagation method give an accureacy close to SPICE results and more than 1000 times speedup over circuit level simulations for RC trees and FPGA interconnects in which the interconnect delay is dominant.

  • PDF

The Design of a Code-String Matching Processor using an EWLD Algorithm (EWLD 알고리듬을 이용한 코드열 정합 프로세서의 설계)

  • 조원경;홍성민;국일호
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.4
    • /
    • pp.127-135
    • /
    • 1994
  • In this paper we propose an EWLD(Enhanced Weighted Levenshtein Distance) algorithm to organize code-string pattern matching linear array processor based on the mappting to an one-dimensional array from a two-dimensional matching matrix, and design a processing element(PE) of the processor, N PEs are required instead of NS02T in the processor because of the mapping. Data input and output between PEs and all internal operations of each PE are performed in bit-serial fashion. The bit-serial operation consists of the computing of word distance (WD) by comparison and the selection of optimal code transformation path, and takes 22 clocks as a cycle. The layout of a PE is designed based on the double metal $1.5\mu$m CMOS rule. About 1,800 transistors consistute a processing element and 2 PEs are integrated on a 3mm$\times$3mm sized chip.

  • PDF