• Title/Summary/Keyword: Three-Point Algorithm

Search Result 531, Processing Time 0.039 seconds

Algorithm for Pairwise Collision Detection and Avoidace in 3-D (3차원 일대일 충돌 감지 및 회피 알리고리듬)

  • Kim, Kwang-Yeon;Park, Jung-Woo;Tahk, Min-Jea
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.36 no.10
    • /
    • pp.996-1002
    • /
    • 2008
  • This paper presents the development of a real-time algorithm for collision detection, collision avoidance and guidance to way-point. Three-dimensional point-mass aircraft models are used. For collision detection, time of closest point of approach(CPA) and distance at CPA are compared to threshold values. For collision avoidance, optimal acceleration input which maximizes the terminal relative distance is calculated based on optimal control theory. For guidance to way-point, proportional navigation guidance, the well-known method, is used. Two scenarios of encounter situation are illustrated to validate performance of proposed algorithm.

Slicing a Point Cloud (점군 절단 알고리즘)

  • Park, Hyeong-T.;Chang, Min-H.;Park, Sang-C.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.12 no.2
    • /
    • pp.146-152
    • /
    • 2007
  • Presented in the paper is an algorithm to generate a section curve by slicing a point cloud which may include tens of thousands of points. Although there are couple of previous results, they are very sensitive on the density variations and local noising points. In the paper, three technological requirements are identified; 1) dominant point sampling, 2) avoiding local vibration, and 3) robustness on the density changes. To satisfy these requirements, we propose a new slicing algorithm which is based on a node-circle diagram. The algorithm has been implemented and tested with various examples.

POLYNOMIAL CONVERGENCE OF PREDICTOR-CORRECTOR ALGORITHMS FOR SDLCP BASED ON THE M-Z FAMILY OF DIRECTIONS

  • Chen, Feixiang;Xiang, Ruiyin
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.5_6
    • /
    • pp.1285-1293
    • /
    • 2011
  • We establishes the polynomial convergence of a new class of path-following methods for semidefinite linear complementarity problems (SDLCP) whose search directions belong to the class of directions introduced by Monteiro [9]. Namely, we show that the polynomial iteration-complexity bound of the well known algorithms for linear programming, namely the predictor-corrector algorithm of Mizuno and Ye, carry over to the context of SDLCP.

Design and Implementation of Real-time three dimensional Tracking system of gazing point (삼차원 응시 위치의 실 시간 추적 시스템 구현)

  • 김재한
    • Proceedings of the IEEK Conference
    • /
    • 2003.07c
    • /
    • pp.2605-2608
    • /
    • 2003
  • This paper presents design and implementation methods of the real-time three dimensional tracking system of the gazing point. The proposed method is based on three dimensional data processing of eye images in the 3D world coordinates. The system hardware consists of two conventional CCD cameras for acquisition of stereoscopic image and computer for processing. And in this paper, the advantages of the proposed algorithm and test results ate described.

  • PDF

Study on the Transmit Power, MMSE Receiver Filter, and Access Point Selection Optimization Algorithm

  • Oh, Changyoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.9
    • /
    • pp.65-72
    • /
    • 2021
  • We consider the joint optimization problem of transmit power level, MMSE receiver filter and access point(AP) selection for multi access points environment. In the previous work, transmit power and MMSE receiver filter were jointly optimized[1] and transmit power and best access point were optimized jointly[2]. For each case, the algorithm was proposed and its convergence which guarantees the minimum total transmit power was proved. In this paper, we further improve the algorithm by jointly optimizing three parameters. More specifically, 1) we propose the algorithm by considering transmit power, MMSE receiver filter and access point selection jointly. 2) we prove that the proposed algorithm guarantees convergence with minimum transmit power consumption. In the simulation results, it is shown that proposed algorithm outperforms two other algorithms, i.e., 1) algorithm with transmit power and MMSE receiver filter, and 2) algorithm with transmit power and best access point selection.

Neutral-point Voltage Balancing Strategy for Three-level Converter based on Disassembly of Zero Level

  • Wang, Chenchen;Li, Zhitong;Xin, Hongliang
    • Journal of Power Electronics
    • /
    • v.19 no.1
    • /
    • pp.79-88
    • /
    • 2019
  • The neutral-point (NP) voltage of three-phase three-level NP-clamped converters is needed for balance. To maintain NP potential and suppress ripple, a novel NP voltage balancing strategy is proposed in this work. The mechanism of NP voltage variation is studied first. Then, the relationship between the disassembly of zero level (O level) and NP current is studied comprehensively. On these bases, two methods for selecting one of three output phases for the disassembly of its O level are presented. Finally, simulation and experimental results verify the validity and practicability of the proposed algorithms.

Surface Extraction from Point-Sampled Data through Region Growing

  • Vieira, Miguel;Shimada, Kenji
    • International Journal of CAD/CAM
    • /
    • v.5 no.1
    • /
    • pp.19-27
    • /
    • 2005
  • As three-dimensional range scanners make large point clouds a more common initial representation of real world objects, a need arises for algorithms that can efficiently process point sets. In this paper, we present a method for extracting smooth surfaces from dense point clouds. Given an unorganized set of points in space as input, our algorithm first uses principal component analysis to estimate the surface variation at each point. After defining conditions for determining the geometric compatibility of a point and a surface, we examine the points in order of increasing surface variation to find points whose neighborhoods can be closely approximated by a single surface. These neighborhoods become seed regions for region growing. The region growing step clusters points that are geometrically compatible with the approximating surface and refines the surface as the region grows to obtain the best approximation of the largest number of points. When no more points can be added to a region, the algorithm stores the extracted surface. Our algorithm works quickly with little user interaction and requires a fraction of the memory needed for a standard mesh data structure. To demonstrate its usefulness, we show results on large point clouds acquired from real-world objects.

Design of Face Recognition Algorithm based Optimized pRBFNNs Using Three-dimensional Scanner (최적 pRBFNNs 패턴분류기 기반 3차원 스캐너를 이용한 얼굴인식 알고리즘 설계)

  • Ma, Chang-Min;Yoo, Sung-Hoon;Oh, Sung-Kwun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.6
    • /
    • pp.748-753
    • /
    • 2012
  • In this paper, Face recognition algorithm is designed based on optimized pRBFNNs pattern classifier using three-dimensional scanner. Generally two-dimensional image-based face recognition system enables us to extract the facial features using gray-level of images. The environmental variation parameters such as natural sunlight, artificial light and face pose lead to the deterioration of the performance of the system. In this paper, the proposed face recognition algorithm is designed by using three-dimensional scanner to overcome the drawback of two-dimensional face recognition system. First face shape is scanned using three-dimensional scanner and then the pose of scanned face is converted to front image through pose compensation process. Secondly, data with face depth is extracted using point signature method. Finally, the recognition performance is confirmed by using the optimized pRBFNNs for solving high-dimensional pattern recognition problems.

Modified Unipolar Carrier-Based PWM Strategy for Three-Level Neutral-Point-Clamped Voltage Source Inverters

  • Srirattanawichaikul, Watcharin;Premrudeepreechacharn, Suttichai;Kumsuwan, Yuttana
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.2
    • /
    • pp.489-500
    • /
    • 2014
  • This paper presents a simple modified unipolar carrier-based pulsewidth modulation (CB-PWM) strategy for the three-level neutral-point-clamped (NPC) voltage source inverter (VSI). Analytical expressions for the relationship between modulation reference signals and output voltages are derived. The proposed modulation technique for the three-level NPC VSI includes the maximum and minimum of the three-phase sinusoidal reference voltages with zero-sequence voltage injection concept. The proposed modified CB-PWM strategy incorporates a novel method that requires only of one triangular carrier wave for generate the gating pulses in three-level NPC VSI. It has the advantages of being simplifying the algorithm with no need of complex two/multi-carrier pulsewidth modulation or space vector modulation (SVM) and it's also simple to implement. The possibility of the proposed CB-PWM technique has been verified though computer simulation and experimental results.