• Journal of the Korea Society of Computer and Information
• /
• v.18 no.9
• /
• pp.53-62
• /
• 2013

This paper proposes a method of automatically predicting the vanishing point for the purpose of detecting the road region from natural images. The proposed method stably detects the vanishing point in the road environment by analyzing the dominant orientation of the image and predicting the vanishing point to be at the position where the feature components of the image are concentrated. For this purpose, in the first stage, the image is partitioned into sub-blocks, an edge sample is selected randomly from within the sub-block, and RANSAC is applied for line fitting in order to analyze the dominant orientation of each sub-block. Once the dominant orientation has been detected for all blocks, we proceed to the second stage and randomly select line samples and apply RANSAC to perform the fitting of the intersection point, then measure the cost of the intersection model arising from each line and we predict the vanishing point to be located at the average point, based on the intersection point model with the highest cost. Lastly, quantitative and qualitative analyses are performed to verify the performance in various situations and prove the efficiency of the proposed algorithm for detecting the vanishing point.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2016.06a
• /
• pp.194-197
• /
• 2016

자동차 산업이 발전하면서 안정적인 주행과 운전자의 편의성을 위한 지능형운전자보조시스템인 ADAS (Advanced Driver Assistance System)가 이슈가 되고 있다. 차선인식의 결과에 따라 차선이탈 경고시스템의 성능이 달라지기 때문에 차선인식은 ADAS에서 매우 중요한 핵심적인 기술이라 할 수 있다. 이에 본 논문에서는 그림자 영역과 같이 밝기의 분포가 균일하지 않는 환경에서 강인하게 동작하는 차선인식 알고리즘을 제안하였다, 지역적인 밝기 특징을 고려하여 차선에 해당하는 특징점을 추출하며, 추출된 특징점 가운데 이상치(outlier)를 제거하기 위해 RANSAC (RANdom SAmple Consensus) 알고리즘을 이용하여 차선을 검출한다. 또한 RANSAC 알고리즘에서 신뢰도가 높은 차선이 검출되면 그 주위에 특징점을 추출하기 위한 관심영역을 설정함으로써 안정적인 차선 검출이 가능하도록 하였다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.331-339
• /
• 2013

LiDAR has been one of the widely used and important technologies for 3D modeling of ground surface and objects because of its ability to provide dense and accurate range measurement. The objective of this research is to develop a method for automatic detection and modeling of railroad power lines using high density LiDAR data and RANSAC algorithms. For detecting railroad power lines, multi-echoes properties of laser data and shape knowledge of railroad power lines were employed. Cuboid analysis for detecting seed line segments, tracking lines, connecting and labeling are the main processes. For modeling railroad power lines, iterative RANSAC and least square adjustment were carried out to estimate the lines parameters. The validation of the result is very challenging due to the difficulties in determining the actual references on the ground surface. Standard deviations of 8cm and 5cm for x-y and z coordinates, respectively are satisfactory outcomes. In case of completeness, the result of visual inspection shows that all the lines are detected and modeled well as compare with the original point clouds. The overall processes are fully automated and the methods manage any state of railroad wires efficiently.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.405-406
• /
• 2006

This paper proposes the new algorithm for the extraction of the corresponding points. Our algorithm is based on RANSAC(Random Sample Consensus) with EM(Expectation-Maximization). In the procedure of RANSAC, N-points are selected by the result of EM instead of the random selection. EM+SAC algorithm is applied to the correspondence for the mosaicing.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.103-107
• /
• 2013

In this paper, A real-time lane tracking algorithm is proposed for lane departure warning system. To eliminate perspective effect, input image is converted into Bird's View by inverse perspective mapping. Next, suitable features are extracted for lane detection. Lane feature that correspond to area of interest and RANSAC are used to detect lane candidates. And driving lane is decided by clustering of lane candidates. Finally, detected lane is tracked using the Kalman filter. Experimental results show that the proposed algorithm can be processed within 30ms and its detection rate is approximately 90% on the highway in a variety of environments such as day and night.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• pp.267-270
• /
• 2010

In filtering of urban lidar data, low outliers or opening underground areas may cause errors that some ground points are labelled as non-ground objects. To solve such a problem, this paper proposes an automated method which consists of RANSAC algorithm, one-dimensional labeling, and morphology filter. All processes are conducted along the lidar scan line profile for efficient computation. Lidar data over Dajeon, Korea is used and the final results are evaluated visually. It is shown that the proposed method is quite promising in urban dem generation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.226-230
• /
• 2002

This paper proposes a method of improvement of accuracy of projective transformation matrix for Image Mosaicing. Using shift theorem, we extracted global translation components between images and using translation components, we found matching points between images so we solve general matching point problem we extracted highly trusted matching point using RANSAC algorithm. we normalized matching point coordinates and improved accuracy of projective transformation matrix.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.4
• /
• pp.144-159
• /
• 2014

Techniques for making a single panoramic image using multiple pictures are widely studied in many areas such as computer vision, computer graphics, etc. The panorama image can be applied to various fields like virtual reality, robot vision areas which require wide-angled shots as an useful way to overcome the limitations such as picture-angle, resolutions, and internal informations of an image taken from a single camera. It is so much meaningful in a point that a panoramic image usually provides better immersion feeling than a plain image. Although there are many ways to build a panoramic image, most of them are using the way of extracting feature points and matching points of each images for making a single panoramic image. In addition, those methods use the RANSAC(RANdom SAmple Consensus) algorithm with matching points and the Homography matrix to transform the image. The SURF(Speeded Up Robust Features) algorithm which is used in this paper to extract featuring points uses an image's black and white informations and local spatial informations. The SURF is widely being used since it is very much robust at detecting image's size, view-point changes, and additionally, faster than the SIFT(Scale Invariant Features Transform) algorithm. The SURF has a shortcoming of making an error which results in decreasing the RANSAC algorithm's performance speed when extracting image's feature points. As a result, this may increase the CPU usage occupation rate. The error of detecting matching points may role as a critical reason for disqualifying panoramic image's accuracy and lucidity. In this paper, in order to minimize errors of extracting matching points, we used $3{\times}3$ region's RGB pixel values around the matching points' coordinates to perform intermediate filtering process for removing wrong matching points. We have also presented analysis and evaluation results relating to enhanced working speed for producing a panorama image, CPU usage rate, extracted matching points' decreasing rate and accuracy.

• Journal of Korean Society for Geospatial Information Science
• /
• v.22 no.4
• /
• pp.3-11
• /
• 2014

Recently, rapid urbanization has necessitated continuous updates in digital map to provide the latest and accurate information for users. However, conventional aerial photogrammetry has some restrictions on periodic updates of small areas due to high cost, and as-built drawing also brings some problems with maintaining quality. Alternatively, this paper proposes a scheme for efficient and accurate update of digital map using point cloud data acquired by Terrestrial Laser Scanner (TLS). Initially, from the whole point cloud data, the building sides are extracted and projected onto a 2D image to trace out the 2D building footprints. In order to register the footprint extractions on the digital map, 2D Affine model is used. For Affine parameter estimation, the centroids of each footprint groups are randomly chosen and matched by means of a modified RANSAC algorithm. Based on proposed algorithm, the experimental results showed that it is possible to renew digital map using building footprint extracted from TLS data.

• Korean Journal of Remote Sensing
• /
• v.30 no.6
• /
• pp.787-795
• /
• 2014

This paper presents an image registration using Triangulation-based Local Transformation (TLT) applied to the remaining matched points after elimination of the matched points with gross error. The corners extracted using geometric mean-based corner detector are matched using Pearson's correlation coefficient and then accepted as initial matched points only when they satisfy the Left-Right Consistency (LRC) check. We finally accept the remaining matched points whose RANdom SAmple Consensus (RANSAC)-based global transformation (RGT) errors are smaller than a predefined outlier threshold. After Delaunay triangulated irregular networks (TINs) are created using the final matched points on reference and sensed images, respectively, affine transformation is applied to every corresponding triangle and then all the inner pixels of the triangles on the sensed image are transformed to the reference image coordinate. The proposed algorithm was tested using KOMPSAT-2 images and the results showed higher image registration accuracy than the RANSAC-based global transformation.