• 제목/요약/키워드: Three-Point Algorithm

검색결과 534건 처리시간 0.031초

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

  • 김광연;박정우;탁민제
    • 한국항공우주학회지
    • /
    • 제36권10호
    • /
    • pp.996-1002
    • /
    • 2008
  • 본 논문에서는 3차원 일대일 충돌 감지, 충돌 회피 및 경로점 유도를 위한 알고리듬에 대해 다룬다. 항공기는 질점 모델로 가정하였다. 충돌 감지는 최근접점까지 남은 시간과 그 때의 거리를 기준 값과 비교하여 수행하였다. 충돌 회피는 최적 제어 이론을 이용하여 최종 시간에서의 상대 거리를 최대화하는 가속도 입력을 계산하여 수행하였다. 경로점 유도는 잘 알려진 비례항법유도를 적용하였다. 제안된 알고리듬의 성능은 두 개의 시나리오를 통하여 검증하였다.

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

  • 박형태;장민호;박상철
    • 한국CDE학회논문집
    • /
    • 제12권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
    • /
    • 제29권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.

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

  • Oh, Changyoon
    • 한국컴퓨터정보학회논문지
    • /
    • 제26권9호
    • /
    • pp.65-72
    • /
    • 2021
  • 다중 엑세스포인트에 적용하는 전송전력, 최소평균제곱오차(MMSE) 수신필터와 최적의 엑세스 포인트 선택 최적화문제를 살펴본다. 지난 연구에서는 전송전력과 MMSE 수신필터 최적화문제[1]와 전송전력과 최적의 엑세스포인트 선택문제[2]를 다루었다. 각각의 문제에 대한 알고리즘을 제안하고 알고리즘의 전송전력의 최소값에 수렴함을 증명하였다. 본 논문에서는 세 가지 변수를 함께 최적화하여 알고리즘의 성능을 개선한다. 구체적으로, 1) 전송전력, MMSE 수신필터, 엑세스포인트 선정을 동시에 고려하여 알고리즘을 제안한다. 2) 또한, 제안하는 알고리즘이 최적화 전송전력값에 수렴하는 것이 보장하는 것을 증명한다. 제안하는 알고리즘이 기존에 제안되었던 두 개의 알고리즘인 1)전송전력과 MMSE 수신필터 최적화 알고리즘, 2) 전송전력 최적화 알고리즘보다 전송전력 소모량에서 성능이 우수함을 실험을 통해서 확인하였다.

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

  • 김재한
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 V
    • /
    • 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

Surface Extraction from Point-Sampled Data through Region Growing

  • Vieira, Miguel;Shimada, Kenji
    • International Journal of CAD/CAM
    • /
    • 제5권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.

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
    • /
    • 제19권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.

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

  • 마창민;유성훈;오성권
    • 한국지능시스템학회논문지
    • /
    • 제22권6호
    • /
    • pp.748-753
    • /
    • 2012
  • 본 논문에서는 최적 pRBFNNs 패턴분류기 기반 3차원 스캐너를 이용한 얼굴인식 알고리즘을 설계한다. 일반적으로 2차원 영상을 이용한 얼굴인식 시스템은 사진의 명암도를 이용하여 얼굴의 특징을 추출하게 된다. 그렇기 때문에 빛이나 조명, 또는 얼굴 포즈와 같은 환경 변화들은 시스템의 성능을 저하시킨다. 따라서 본 논문에서 제안된 얼굴인식 알고리즘은 2차원 얼굴인식 시스템의 한계를 극복하기 위하여 3차원 스캐너를 사용하여 설계한다. 먼저 3차원 스캐너를 이용하여 얼굴 형상을 스캔하고 스캔된 얼굴 형상은 포즈 보상 과정을 통하여 정면으로 변환된다. 그 후에 Point Signature 기법을 사용하여 얼굴의 깊이 정보를 추출하고 마지막으로 고차원 패턴인식 문제에 대한 해결을 위하여 최적화된 pRBFNNs (Polynomial-based Radial Basis Function Neural Networks) 모델을 사용하여 인식성능을 확인한다.

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
    • /
    • 제9권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.