• 전자공학회논문지S
• /
• 제34S권2호
• /
• pp.52-62
• /
• 1997

To reconstruct the complete 3-D shape of an object, seveal range images form different viewpoints should be merged into a single model. The process of extraction of the transformation parameters between multiple range views is calle dregistration. In this paper, we propose a new algorithm to find the transformation parameters between multiple range views. Th eproposed algorithm consists of two step: initial estimation and iteratively update the transformation. To guess the initial transformation, we modify the principal axes by considering the projection effect, due to the difference fo viewpoints. Then, the following process is iterated: in order to extract the exact transformation parameters between the range views: For every point of the common region, find the nearest point among the neighborhood of the current corresponding point whose correspondency is defined by the reverse calibration of the range finder. Then, update the transformation to satisfy the new correspondencies. In order to evaluate the performance the proposed registration algorithm, some experiments are performed on real range data, acquired by space encoding range finder. The experimental results show that the proposed initial estimation accelerate the following iterative registration step.

• Journal of applied mathematics & informatics
• /
• 제11권1_2호
• /
• pp.201-213
• /
• 2003

In this paper we present a second order PVT (parallel variable transformation) algorithm converging to second order stationary points for minimizing smooth functions, based on the first order PVT algorithm due to Fukushima (1998). The corresponding stopping criterion, descent condition and descent step for the second order PVT algorithm are given.

• Journal of the Korean Data and Information Science Society
• /
• 제16권2호
• /
• pp.195-205
• /
• 2005

In decision tree analysis, C4.5 and CART algorithm have some problems of computational complexity and bias on variable selection. But QUEST algorithm solves these problems by dividing the step of variable selection and split point selection. When input variables are continuous, QUEST algorithm uses ANOVA F-test under the assumption of normality and homogeneity of variances. In this paper, we investigate the influence of violation of normality assumption and effect of the transformation of variables in the QUEST algorithm. In the simulation study, we obtained the empirical powers of variable selection and the empirical bias of variable selection after transformation of variables having various type of underlying distributions.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2002년도 추계종합학술대회
• /
• pp.226-230
• /
• 2002

본 논문은 영상 모자이킹을 위한 사영 변환 행렬의 정밀도를 개선하는 방법을 제안한다. Shift Theorem을 이용하여 영상간의 전역 이동 성분을 추출하고 구해진 이동 성분을 이용하여 영상간의 일치점을 찾음으로서 기존의 일치점 검출의 문제점을 해결하였다. 일치점 집합을 RANSAC 알고리즘을 적용하여 신뢰도가 높은 일치점을 추출함으로서 잡음의 영향에 강인하도록 하였으며 일치점의 좌표를 정규화 하여 사영변환 행렬의 정밀도를 개선하였다.

• 대한전기학회논문지:전력기술부문A
• /
• 제51권8호
• /
• pp.409-416
• /
• 2002

This paper presents a fault location algorithm using direct 3-phase circuit analysis for distribution power networks. The unbalanced feature of distribution networks due to single phase loads or asymmetric operation prohibits us from using the conventional symmetrical component transformation. Even though the symmetrical component transformation provides us with a very easy tool in three phase network analysis, it is limited to balanced systems in utilizing its strong point, which is not suitable for distribution networks. In this paper, a fault location algorithm using direct 3-phase circuit analysis is developed. The algorithm is derived and it Is shown that the proposed method if we use matrix inverse lemma, is not more difficult then the conventional methods using symmetrical component transformation. Since the symmetrical component transformation is not used in the suggested method, unbalanced networks also can be handled with the same difficulty as balanced networks. The case study results show the correctness and effectiveness of the proposed algorithm.

• 한국정보처리학회논문지
• /
• 제6권11호
• /
• pp.3140-3149
• /
• 1999

Skew correction for document images can be using a rotational transformation of pixel coordinates. In this paper we propose a method which corrects the document skew, by an amount of $\theta$ degrees, using block information, where the block is defined as a rectangular area containing adjacent black pixels. Processing speed of the proposed method is faster than that of the method using pixel transformation, since the number of floating-point operations can be reduced significantly. In the proposed method, we rotate only the four corner points of each block, and then identify the pixels inside the block. Two methods for inside pixel identification are proposed; the first method finds two points intersecting the boundary of the rotated block in each row, and determines the pixels between the two intersection points as the inside pixel. The second method finds boundary points based on Bresenham's line drawing algorithm, using fixed-point operation, and fills the region surrounded by these boundaries as black pixels. We have measured the performance of the proposed method by experimenting it with 2,016 images of various English and Korean documents. We have also proven the superiority of our algorithm through performance comparison with respect to existing methods based on pixel transformation.

• 자동차안전학회지
• /
• 제14권2호
• /
• pp.39-44
• /
• 2022

This paper presents LiDAR static obstacle map based vehicle position correction algorithm for urban autonomous driving. Real Time Kinematic (RTK) GPS is commonly used in highway automated vehicle systems. For urban automated vehicle systems, RTK GPS have some trouble in shaded area. Therefore, this paper represents a method to estimate the position of the host vehicle using AVM camera, front camera, LiDAR and low-cost GPS based on Extended Kalman Filter (EKF). Static obstacle map (STOM) is constructed only with static object based on Bayesian rule. To run the algorithm, HD map and Static obstacle reference map (STORM) must be prepared in advance. STORM is constructed by accumulating and voxelizing the static obstacle map (STOM). The algorithm consists of three main process. The first process is to acquire sensor data from low-cost GPS, AVM camera, front camera, and LiDAR. Second, low-cost GPS data is used to define initial point. Third, AVM camera, front camera, LiDAR point cloud matching to HD map and STORM is conducted using Normal Distribution Transformation (NDT) method. Third, position of the host vehicle position is corrected based on the Extended Kalman Filter (EKF).The proposed algorithm is implemented in the Linux Robot Operating System (ROS) environment and showed better performance than only lane-detection algorithm. It is expected to be more robust and accurate than raw lidar point cloud matching algorithm in autonomous driving.

• 제어로봇시스템학회논문지
• /
• 제15권5호
• /
• pp.465-472
• /
• 2009

This paper proposes a multimodal information transformation system that converts the image information to the voice information to provide the sight impaired people with walking area and obstacles, which are extracted by an acquired image from a single CCD camera. Using a chain-code line detection algorithm, the walking area is found from the vanishing point and boundary of a sidewalk on the edge image. And obstacles are detected by Gabor filter of extracting vertical lines on the walking area. The proposed system expresses the voice information of pre-defined sentences, consisting of template words which mean walking area and obstacles. The multi-modal information transformation system serves the useful voice information to the sight impaired that intend to reach their destination. The experiments of the proposed algorithm has been implemented on the indoor and outdoor environments, and verified its superiority to exactly provide walking parameters sentences.

• Journal of Astronomy and Space Sciences
• /
• 제28권3호
• /
• pp.183-192
• /
• 2011

The current study analyzes the effects of the scaling parameters of the batch unscented transformation on precision satellite orbit determination. Satellite laser ranging (SLR) data are used in the orbit determination algorithm, which consists of dynamics model, observation model and filtering algorithm composed of the batch unscented transformation. TOPEX/Poseidon SLR data are used by utilizing the normal point (NP) data observed from ground station. The filtering algorithm includes a repeated series of processes to determine the appropriate scaling parameters for the batch unscented transformation. To determine appropriate scaling parameters, general ranges of the scaling parameters of ${\alpha}$, ${\beta}$, k, $\lambda$ are established. Depending on the range settings, each parameter was assigned to the filtering algorithm at regular intervals. Appropriate scaling parameters are determined for observation data obtained from several observatories, by analyzing the relationship between tuning properties of the scaling parameters and estimated orbit precision. The orbit determination of satellite using the batch unscented transformation can achieve levels of accuracy within several tens of cm with the appropriate scaling parameters. The analyses in the present study give insights into the roles of scaling parameters in the batch unscented transformation method.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제54권12호
• /
• pp.723-731
• /
• 2005

The $4{\times}4$ homogeneous transformation matrix is a compact representation of orientation and position of an object in robotics and computer graphics. A coordinate transformation is accomplished through the successive multiplications of homogeneous matrices, each of which represents the orientation and position of each corresponding link. Thus, for real time control applications in robotics or animation in computer graphics, the fast multiplication of homogeneous matrices is quite demanding. In this paper, a parallel-architecture vector processor is designed for this purpose. The processor has several key features. For the accuracy of computation for real application, the operands of the processors are floating point numbers based on the IEEE Standard 754. For the parallelism and reduction of hardware redundancy, the processor takes column vectors of homogeneous matrices as multiplication unit. To further improve the throughput, the processor structure and its control is based on a pipe-lined structure. Since the designed processor can be used as a special purpose coprocessor in robotics and computer graphics, additionally to special matrix/matrix or matrix/vector multiplication, several other useful instructions for various transformation algorithms are included for wide application of the new design. The suggested instruction set will serve as standard in future processor design for Robotics and Computer Graphics. The design is verified using FPGA implementation. Also a comparative performance improvement of the proposed design is studied compared to a uni-processor approach for possibilities of its real time application.