• Title/Summary/Keyword: conjugate point

Search Result 75, Processing Time 0.025 seconds

Strip Adjustment of Airborne Laser Scanner Data Using Area-based Surface Matching

  • Lee, Dae Geon;Yoo, Eun Jin;Yom, Jae-Hong;Lee, Dong-Cheon
    • 한국측량학회지
    • /
    • 제32권6호
    • /
    • pp.625-635
    • /
    • 2014
  • Multiple strips are required for large area mapping using ALS (Airborne Laser Scanner) system. LiDAR (Light Detection And Ranging) data collected from the ALS system has discrepancies between strips due to systematic errors of on-board laser scanner and GPS/INS, inaccurate processing of the system calibration as well as boresight misalignments. Such discrepancies deteriorate the overall geometric quality of the end products such as DEM (Digital Elevation Model), building models, and digital maps. Therefore, strip adjustment for minimizing discrepancies between overlapping strips is one of the most essential tasks to create seamless point cloud data. This study implemented area-based matching (ABM) to determine conjugate features for computing 3D transformation parameters. ABM is a well-known method and easily implemented for this purpose. It is obvious that the exact same LiDAR points do not exist in the overlapping strips. Therefore, the term "conjugate point" means that the location of occurring maximum similarity within the overlapping strips. Coordinates of the conjugate locations were determined with sub-pixel accuracy. The major drawbacks of the ABM are sensitive to scale change and rotation. However, there is almost no scale change and the rotation angles are quite small between adjacent strips to apply AMB. Experimental results from this study using both simulated and real datasets demonstrate validity of the proposed scheme.

IMT-2000 Test-bed 상에서 CS-ACELP 음성부호화기 실시간 구현 (Real-time Implementation of CS-ACELP Speech Coder for IMT-2000 Test-bed)

  • 김형중;최송인;김재원;윤병식
    • 한국정보통신학회논문지
    • /
    • 제2권3호
    • /
    • pp.335-341
    • /
    • 1998
  • 본 논문에서는 CS-ACELP(Conjugate Structure Algebraic Code Excited Linear prediction) 음성부호화기의 실시간 구현에 관하여 논한다. CS-ACELP 알고리즘은 ITU-T에서 G.729로 표준화되었다. CS-ACELP 음성부호화 알고리즘의 실시간 구현은 16비트 정수형 DSP 칩을 사용하였다. 16비트 정수형 DSP 칩상에 구현하기 위하여, CS-ACELP 알고리즘의 정수형 시뮬레이션을 사용하였다. CS-ACELP 음성부호화기에 포함된 입출력기능과 통신 기능을 설명한다. DSP Evaluation board를 사용하여 CS-ACELP 음성부호화기를 개발하였고 IMT-2000 Test-bed를 사용하여 검증하였다.

  • PDF

지중송전케이블 접속부에서의 열전달에 관한 연구 (A Study on Heat Transfer of an Underground Power Transmission Cable-Joint)

  • 박만흥;김재근;이재헌
    • 설비공학논문집
    • /
    • 제5권4호
    • /
    • pp.265-277
    • /
    • 1993
  • Recently, underground transmission system is growing continuously according to the electric power demand increase in the downtown area. Even if domestic cable makers are manufacturing 154kV oil filled cable and joint, the design technology of cable-joint has not been fully self-reliance. This study is aimed at the detail heat transfer analysis of 154kV cable-joint. So, that is cut into the five sections in order to analyze a conjugate natural convection in two dimensional $r-{\theta}$ coordinate. The streamline and temperature distributions are obtained for each sections. Also the changes of those are analyzed with respect to the variation of transmission currents and cable-joint surface heat transfer coefficients. The same analyses are also shown in view point of the maximum temperature of conductor and local equivalent conductivity.

  • PDF

ON BI-POINTWISE CONTROL OF A WAVE EQUATION AND ALGORITHM

  • Kim, Hong-Chul;Lee, Young-Il
    • Journal of applied mathematics & informatics
    • /
    • 제7권3호
    • /
    • pp.739-763
    • /
    • 2000
  • We are concerned with mathematical analysis related to the bi-pointwise control for a mixed type of wave equation. In particular, we are interested in the systematic build-up of the bi-pointwise control actuators;one at the boundary and the other at the interior point simultaneously. The main purpose is to examine Hilbert Uniqueness Method for the setting of bi-pointwise control actuators and to establish relevant algorithm based on our analysis. After discussing the weak solution for the state equation, we investigate bi-pointwise control mechanism and relevant mathematical analysis based on HUM. We then proceed to set up an algorithm based on the conjugate gradient method to establish bi-pointwise control actuators to halt the system.

불규칙활용에 대한 한국어 교육적 재고찰 (A Pedagogical Reconsideration of Irregular Conjugation of Korean Verbs)

  • 요시모토 하지메;나카지마 히토시
    • 한국어교육
    • /
    • 제23권1호
    • /
    • pp.101-122
    • /
    • 2012
  • To learn correctly how irregular verbs conjugate is one of the most important items which must be acquired by learners of Korean. Although a great deal of study has been made on irregular verbs, lots of problems seem to be remaining unsolved or even undescribed. The purpose of this paper is: (1) to give a definition of irregular conjugation of Korean from pedagogical point of view; (2) to describe an appearance of irregular verbs in the spoken and written context; (3) to show appropriate explanation how irregular verbs conjugate.

다수상품 유통문제를 위한 내부점 방법에서의 Warm-Start (Warm-Start of Interior Point Methods for Multicommodity Network Flow Problem)

  • 임성묵;이상욱;박순달
    • 경영과학
    • /
    • 제21권1호
    • /
    • pp.77-86
    • /
    • 2004
  • In this paper, we present a methodology for solving the multicommodity network flow problems using interior point methods. In our method, the minimum cost network flow problem extracted from the given multicommodity network flow problem is solved by primal-dual barrier method in which normal equations are solved partially using preconditioned conjugate gradient method. Based on the solution of the minimum cost network flow problem, a warm-start point is obtained from which Castro's specialized interior point method for multicommodity network flow problem starts. In the computational experiments, the effectiveness of our methodology is shown.

BLASCHKE PRODUCTS AND RATIONAL FUNCTIONS WITH SIEGEL DISKS

  • Katagata, Koh
    • 대한수학회지
    • /
    • 제46권1호
    • /
    • pp.151-170
    • /
    • 2009
  • Let m be a positive integer. We show that for any given real number ${\alpha}\;{\in}\;[0,\;1]$ and complex number $\mu$ with $|\mu|{\leq}1$ which satisfy $e^{2{\pi}i{\alpha}}{\mu}^m\;{\neq}\;1$, there exists a Blaschke product B of degree 2m + 1 which has a fixed point of multiplier ${\mu}^m$ at the point at infinity such that the restriction of the Blaschke product B on the unit circle is a critical circle map with rotation number $\alpha$. Moreover if the given real number $\alpha$ is irrational of bounded type, then a modified Blaschke product of B is quasiconformally conjugate to some rational function of degree m + 1 which has a fixed point of multiplier ${\mu}^m$ at the point at infinity and a Siegel disk whose boundary is a quasicircle containing its critical point.

다중조류계산을 이용한 전압붕괴 임계점의 On-Line 계산 (On-Line Calculation of the Critical Point of Voltage Collapse Based on Multiple Load Flow Solutions)

  • 남해곤;김동준
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1993년도 하계학술대회 논문집 A
    • /
    • pp.134-136
    • /
    • 1993
  • This paper presents a novel and efficient method to calculate the critical point of voltage collapse. Conjugate gradient and modified Newton-Raphson methods are employed to calculate two pairs of multiple load flow solutions for two operating conditions, i.e., both +mode and -mode voltages for two loading conditions respectively. Then these four voltage magnitude-load data sets of the bus which is most susceptible to voltage collapse, are fitted to third order polynomial using Lagrangian interpolation in order to represent approximate nose curve (P-V curve). This nose curve locates first estimate of the critical point of voltage collapse. The procedure described above is repeated near the critical point and the new estimate will be very close to the critical point. The proposed method is tested for the eleven bus Klos-Kerner system, with good accuracy and fast computation time.

  • PDF

THE CRITICAL PODS OF PLANAR QUADRATIC POLYNOMIAL MAPS OF TOPOLOGICAL DEGREE 2

  • Misong Chang;Sunyang Ko;Chong Gyu Lee;Sang-Min Lee
    • 대한수학회보
    • /
    • 제60권3호
    • /
    • pp.659-675
    • /
    • 2023
  • Let K be an algebraically closed field of characteristic 0 and let f be a non-fibered planar quadratic polynomial map of topological degree 2 defined over K. We assume further that the meromorphic extension of f on the projective plane has the unique indeterminacy point. We define the critical pod of f where f sends a critical point to another critical point. By observing the behavior of f at the critical pod, we can determine a good conjugate of f which shows its statue in GIT sense.

BioFET 시뮬레이션을 위한 CUDA 기반 병렬 Bi-CG 행렬 해법 (CUDA-based Parallel Bi-Conjugate Gradient Matrix Solver for BioFET Simulation)

  • 박태정;우준명;김창헌
    • 전자공학회논문지CI
    • /
    • 제48권1호
    • /
    • pp.90-100
    • /
    • 2011
  • 본 연구에서는 연산 부하가 매우 큰 Bio-FET 시뮬레이션을 위해 낮은 비용으로 대규모 병렬처리 환경 구축이 가능한 최신 그래픽 프로세서(GPU)를 이용해서 선형 방정식 해법을 수행하기 위한 병렬 Bi-CG(Bi-Conjugate Gradient) 방식을 제안한다. 제안하는 병렬 방식에서는 반도체 소자 시뮬레이션, 전산유체역학(CFD), 열전달 시뮬레이션 등을 포함한 다양한 분야에서 많은 연산량이 집중되어 전체 시뮬레이션에 필요한 시간을 증가시키는 포아송(Poisson) 방정식의 해를 병렬 방식으로 구한다. 그 결과, 이 논문의 테스트에서 사용된 FDM 3차원 문제 공간에서 단일 CPU 대비 연산 속도가 최대 30 배 이상 증가했다. 실제 구현은 NVIDIA의 태슬라 아키텍처(Tesla Architecture) 기반 GPU에서 범용 목적으로 병렬 프로그래밍이 가능한 NVIDIA사의 CUDA(Compute Unified Device Architecture) 환경에서 수행되었으며 기존 연구가 주로 32 비트 정밀도(single floating point) 실수 범위에서 수행된 것과는 달리 본 연구는 64 비트 정밀도(double floating point) 실수 범위로 수행되어 Bi-CG 해법의 수렴성을 개선했다. 특히, CUDA는 비교적 코딩이 쉬운 반면, 최적화가 어려운 특성이 있어 본 논문에서는 제안하는 Bi-CG 해법에서의 최적화 방향도 논의한다.