• Title/Summary/Keyword: Three-Point Algorithm

Search Result 538, Processing Time 0.036 seconds

A Preprocessing Algorithm for Layered Depth Image Coding (계층적 깊이영상 정보의 압축 부호화를 위한 전처리 방법)

  • 윤승욱;김성열;호요성
    • Journal of Broadcast Engineering
    • /
    • v.9 no.3
    • /
    • pp.207-213
    • /
    • 2004
  • The layered depth image (LDI) is an efficient approach to represent three-dimensional objects with complex geometry for image-based rendering (IBR). LDI contains several attribute values together with multiple layers at each pixel location. In this paper, we propose an efficient preprocessing algorithm to compress depth information of LDI. Considering each depth value as a point in the two-dimensional space, we compute the minimum distance between a straight line passing through the previous two values and the current depth value. Finally, the minimum distance replaces the current attribute value. The proposed algorithm reduces the variance of the depth information , therefore, It Improves the transform and coding efficiency.

Hybrid Constrained Extrapolation Experimental Design (하이브리드형 제약 외삽실험 계획법)

  • Kim, Young-Il;Jang, Dae-Heung
    • Communications for Statistical Applications and Methods
    • /
    • v.19 no.1
    • /
    • pp.65-75
    • /
    • 2012
  • In setting an experimental design for the prediction outside the experimental region (extrapolation design), it is natural for the experimenter to be very careful about the validity of the model for the design because the experimenter is not certain whether the model can be extended beyond the design region or not. In this paper, a hybrid constrained type approach was adopted in dealing model uncertainty as well as the prediction error using the three basic principles available in literature, maxi-min, constrained, and compound design. Furthermore, the effect of the distance of the extrapolation design point from the design region is investigated. A search algorithm was used because the classical exchange algorithm was found to be complex due to the characteristic of the problem.

An Enhanced Text-Prompt Speaker Recognition Using DTW (DTW를 이용한 향상된 문맥 제시형 화자인식)

  • 신유식;서광석;김종교
    • The Journal of the Acoustical Society of Korea
    • /
    • v.18 no.1
    • /
    • pp.86-91
    • /
    • 1999
  • This paper presents the text-prompt method to overcome the weakness of text-dependent and text-independent speaker recognition. Enhanced dynamic time warping for speaker recognition algorithm is applied. For the real-time processing, we use a simple algorithm for end-point detection without increasing computational complexity. The test shows that the weighted-cepstrum is most proper for speaker recognition among various speech parameters. As the experimental results of the proposed algorithm for three prompt words, the speaker identification error rate is 0.02%, and when the threshold is set properly, false rejection rate is 1.89%, false acceptance rate is 0.77% and verification total error rate is 0.97% for speaker verification.

  • PDF

Fault Location for Incomplete-Journey Double-Circuit Transmission Lines on Same Tower Based on Identification of Fault Branch

  • Wang, Shoupeng;Zhao, Dongmei;Shang, Liqun
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.5
    • /
    • pp.1754-1763
    • /
    • 2017
  • This paper analyses the characteristics of incomplete-journey double-circuit transmission lines on the same tower formed by single-circuit lines and double-circuit lines, and then presents a fault location algorithm based on identification of fault branch. With the relationship between the three-phase system and the double-circuit line system, a phase-mode transformation matrix for double-circuit lines can be derived. Based on the derived matrix, the double-circuit lines with faults can be decoupled, and then the fault location for an incomplete-journey double-circuit line is achieved by using modal components in the mode domain. The algorithm is divided into two steps. Firstly, the fault branch is identified by comparing the relationships of voltage amplitudes at the bonding point. Then the fault location, on the basis of the identification result, is calculated by using a two-terminal method, and only the fault distance of the actual fault branch can be obtained. There is no limit on synchronization of each terminal sampling data. The results of ATP-EMTP simulation show that the proposed algorithm can be applied within the entire line and can accurately locate faults in different fault types, fault resistances, and fault distances.

Joint Position Control using ZMP-Based Gain Switching Algorithm for a Hydraulic Biped Humanoid Robot (유압식 이족 휴머노이드 로봇의 ZMP 기반 게인 스위칭 알고리즘을 이용한 관절 위치 제어)

  • Kim, Jung-Yup;Hodgins, Jessica K.
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.15 no.10
    • /
    • pp.1029-1038
    • /
    • 2009
  • This paper proposes a gain switching algorithm for joint position control of a hydraulic humanoid robot. Accurate position control of the lower body is one of the basic requirements for robust balance and walking control. Joint position control is more difficult for hydraulic robots than it is for electric robots because of an absence of reduction gear and better back-drivability of hydraulic joints. Backdrivability causes external forces and torques to have a large effect on the position of the joints. External ground reaction forces therefore prevent a simple proportional-derivative (PD) controller from realizing accurate and fast joint position control. We propose a state feedback controller for joint position control of the lower body, define three modes of state feedback gains, and switch the gains according to the Zero Moment Point (ZMP) and linear interpolation. Dynamic equations of hydraulic actuators were experimentally derived and applied to a robot simulator. Finally, the performance of the algorithm is evaluated with dynamic simulations.

Optimum Design of a Composite T-tail Configuration for Maximum Flutter Speed Using Genetic Algorithm (유전자 알고리즘을 이용한 T-형 복합재료 날개의 플러터 속도 최적설계)

  • Alexander, Boby;Oh, Se-Won;Kim, Dong-Hyun
    • Proceedings of the Korean Society For Composite Materials Conference
    • /
    • 2005.11a
    • /
    • pp.173-178
    • /
    • 2005
  • In this paper, an efficient and robust analysis system for the flutter optimization of laminated composite wings has been developed using the coupled computational method based on the genetic algorithm. General three-dimensional doublet-lattice method is efficiently used to compute generalized aerodynamic forces of T-tail configuration in the frequency domain. Structural dynamic analyses of laminated composite T-tail models are conducted using finite clement method. The classical P-k flutter analysis technique is applied to effectively solve the aeroelastic governing equations in the frequency domain. Optimum design studies using genetic algorithm have been conducted in order to obtain maximum flutter stability of a composite T-tail configuration. The results show that flutter stability can be significantly increased using composite materials with proper optimum design concepts even for the same weight and shape condition. In the view point of engineering design, it is also importantly shown that the optimization of the vertical wing part is highly effective comparing to the optimization of horizontal wing part.

  • PDF

A Feature Tracking Algorithm Using Adaptive Weight Adjustment (적응적 가중치에 의한 특징점 추적 알고리즘)

  • Jeong, Jong-Myeon;Moon, Young-Shik
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.11
    • /
    • pp.68-78
    • /
    • 1999
  • A new algorithm for tracking feature points in an image sequence is presented. Most existing feature tracking algorithms often produce false trajectories, because the matching measures do not precisely reflect motion characteristics. In this paper, three attributes including spatial coordinate, motion direction and motion magnitude are used to calculate the feature point correspondence. The trajectories of feature points are determined by calculation the matching measure, which is defined as the minimum weighted Euclidean distance between two feature points. The weights of the attributes are updated reflecting the motion characteristics, so that the robust tracking of feature points is achieved. The proposed algorithm can find the trajectories correctly which has been shown by experimental results.

  • PDF

Audio Mixer Algorithm for Enhancing Speech Quality of Multi-party Audio Telephony (다자간 음성통화 품질 향상을 위한 오디오 믹서 알고리즘)

  • Ryu, Sang-Hyeon;Kim, Hyoung-Gook
    • The Journal of the Acoustical Society of Korea
    • /
    • v.32 no.6
    • /
    • pp.541-547
    • /
    • 2013
  • The speech quality of multi-party audio telephony between two, three or more participants is decreased by audio volume imbalance, audio volume saturation and noise level increase. To solve this issue, this paper proposes an advanced audio mixing algorithm for software-based multi-point control unit. Our approach is based on the combined voice activity detection and gain control technique that consists of a set of algorithms that classify audio signals, estimate audio volumes, adjust gain factors and mix audio signals of all channels. The proposed audio mixing algorithm is computationally efficient, delivers high-quality speech, and is suitable for use in any practical multi-party audio telephony.

Improvement of ECG P wave Detection Performance Using CIR(Contextusl Information Rule-base) Algorithm (Contextual information 을 이용한 P파 검출에 관한 연구)

  • 이지연;김익근
    • Journal of Biomedical Engineering Research
    • /
    • v.17 no.2
    • /
    • pp.235-240
    • /
    • 1996
  • The automated ECG diagnostic systems that are odd in hospitals have low performance of P-wave detection when faced with some diseases such as conduction block. So, the purpose of this study was the improvement of detection performance in conduction block which is low in P-wave detection. The first procedure was removal of baseline drift by subtracting the median filtered signal of 0.4 second length from the original signal. Then the algorithm detected R peak and T end point and cancelled the QRS-T complex to get'p prototypes'. Next step was magnification of P prototypes with dispersion and detection of'p candidates'in the magnified signal, and then extraction of contextual information concerned with P-waves. For the last procedure, the CIR was applied to P candidates to confirm P-waves. The rule base consisted of three rules that discriminate and confirm P-waves. This algorithm was evaluated using 500 patient's raw data P-wave detection perFormance was in- creased 6.8% compared with the QRS-T complex cancellation method without application of the rule base.

  • PDF

A Study on Automatic Extraction of Buildings Using LIDAR with Aerial Imagery (LIDAR 데이터와 항공사진을 이용한 건물의 자동추출에 관한 연구)

  • 이영진;조우석
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2003.04a
    • /
    • pp.471-477
    • /
    • 2003
  • This paper presents an algorithm that automatically extracts buildings among many different features on the earth surface by fusing LIDAR data with panchromatic aerial images. The proposed algorithm consists of three stages such as point level process, polygon level process, parameter space level process. At the first stage, we eliminate gross errors and apply a local maxima filter to detect building candidate points from the raw laser scanning data. After then, a grouping procedure is performed for segmenting raw LIDAR data and the segmented LIDAR data is polygonized by the encasing polygon algorithm developed in the research. At the second stage, we eliminate non-building polygons using several constraints such as area and circularity. At the last stage, all the polygons generated at the second stage are projected onto the aerial stereo images through collinearity condition equations. Finally, we fuse the projected encasing polygons with edges detected by image processing for refining the building segments. The experimental results showed that the RMSEs of building corners in X, Y and Z were ${\pm}$8.1cm, ${\pm}$24.7cm, ${\pm}$35.9cm, respectively.

  • PDF