• Title/Summary/Keyword: RANSAC (Random Sample And Consensus)

Search Result 60, Processing Time 0.032 seconds

Robust Lane Detection Algorithm in Shadow Area by using Local Feature Point (그림자 영역에서 강인한 지역 특징점 기반의 차선인식 기법)

  • Kim, Tae-Dong;Yi, Kang;Jung, Kyeong-Hoon
    • 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 알고리즘에서 신뢰도가 높은 차선이 검출되면 그 주위에 특징점을 추출하기 위한 관심영역을 설정함으로써 안정적인 차선 검출이 가능하도록 하였다.

  • PDF

Fast Stitching Algorithm by using Feature Tracking (특징점 추적을 통한 다수 영상의 고속 스티칭 기법)

  • Park, Siyoung;Kim, Jongho;Yoo, Jisang
    • Journal of Broadcast Engineering
    • /
    • v.20 no.5
    • /
    • pp.728-737
    • /
    • 2015
  • Stitching algorithm obtain a descriptor of the feature points extracted from multiple images, and create a single image through the matching process between the each of the feature points. In this paper, a feature extraction and matching techniques for the creation of a high-speed panorama using video input is proposed. Features from Accelerated Segment Test(FAST) is used for the feature extraction at high speed. A new feature point matching process, different from the conventional method is proposed. In the matching process, by tracking region containing the feature point through the Mean shift vector required for matching is obtained. Obtained vector is used to match the extracted feature points. In order to remove the outlier, the RANdom Sample Consensus(RANSAC) method is used. By obtaining a homography transformation matrix of the two input images, a single panoramic image is generated. Through experimental results, we show that the proposed algorithm improve of speed panoramic image generation compared to than the existing method.

A Global Self-Position Localization in Wide Environments Using Gradual RANSAC Method (점진적 RANSAC 방법을 이용한 넓은 환경에서의 대역적 자기 위치 추정)

  • Jung, Nam-Chae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.11 no.4
    • /
    • pp.345-353
    • /
    • 2010
  • A general solution in global self-position location of robot is to generate multiple hypothesis in self-position of robot, which is to look for the most positive self-position by evaluating each hypothesis based on features of observed landmark. Markov Localization(ML) or Monte Carlo Localization(MCL) to be the existing typical method is to evaluate all pairs of landmark features and generated hypotheses, it can be said to be an optimal method in sufficiently calculating resources. But calculating quantities was proportional to the number of pairs to evaluate in general, so calculating quantities was piled up in wide environments in the presence of multiple pairs if using these methods. First of all, the positive and promising pairs is located and evaluated to solve this problem in this paper, and the newly locating method to make effective use of calculating time is proposed. As the basic method, it is used both RANSAC(RANdom SAmple Consensus) algorithm and preemption scheme to be efficiency method of RANSAC algorithm. The calculating quantity on each observation of robot can be suppressed below a certain values in the proposed method, and the high location performance can be determined by an experimental on verification.

Registration of Aerial Image with Lines using RANSAC Algorithm

  • Ahn, Y.;Shin, S.;Schenk, T.;Cho, W.
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.25 no.6_1
    • /
    • pp.529-536
    • /
    • 2007
  • Registration between image and object space is a fundamental step in photogrammetry and computer vision. Along with rapid development of sensors - multi/hyper spectral sensor, laser scanning sensor, radar sensor etc., the needs for registration between different sensors are ever increasing. There are two important considerations on different sensor registration. They are sensor invariant feature extraction and correspondence between them. Since point to point correspondence does not exist in image and laser scanning data, it is necessary to have higher entities for extraction and correspondence. This leads to modify first, existing mathematical and geometrical model which was suitable for point measurement to line measurements, second, matching scheme. In this research, linear feature is selected for sensor invariant features and matching entity. Linear features are incorporated into mathematical equation in the form of extended collinearity equation for registration problem known as photo resection which calculates exterior orientation parameters. The other emphasis is on the scheme of finding matched entities in the aide of RANSAC (RANdom SAmple Consensus) in the absence of correspondences. To relieve computational load which is a common problem in sampling theorem, deterministic sampling technique and selecting 4 line features from 4 sectors are applied.

Lane Detection System using CNN (CNN을 사용한 차선검출 시스템)

  • Kim, Jihun;Lee, Daesik;Lee, Minho
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.11 no.3
    • /
    • pp.163-171
    • /
    • 2016
  • Lane detection is a widely researched topic. Although simple road detection is easily achieved by previous methods, lane detection becomes very difficult in several complex cases involving noisy edges. To address this, we use a Convolution neural network (CNN) for image enhancement. CNN is a deep learning method that has been very successfully applied in object detection and recognition. In this paper, we introduce a robust lane detection method based on a CNN combined with random sample consensus (RANSAC) algorithm. Initially, we calculate edges in an image using a hat shaped kernel, then we detect lanes using the CNN combined with the RANSAC. In the training process of the CNN, input data consists of edge images and target data is images that have real white color lanes on an otherwise black background. The CNN structure consists of 8 layers with 3 convolutional layers, 2 subsampling layers and multi-layer perceptron (MLP) of 3 fully-connected layers. Convolutional and subsampling layers are hierarchically arranged to form a deep structure. Our proposed lane detection algorithm successfully eliminates noise lines and was found to perform better than other formal line detection algorithms such as RANSAC

A Real-time Lane Tracking Using Inverse Perspective Mapping (역투영 변환을 이용한 고속도로 환경에서의 실시간 차선 추적)

  • Yeo, Jae-yun;Koo, Kyung-mo;Cha, Eui-young
    • 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.

  • PDF

Image registration using outlier removal and triangulation-based local transformation (이상치 제거와 삼각망 기반의 지역 변환을 이용한 영상 등록)

  • Ye, Chul-Soo
    • 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.

A Performance Analysis of the SIFT Matching on Simulated Geospatial Image Differences (공간 영상 처리를 위한 SIFT 매칭 기법의 성능 분석)

  • Oh, Jae-Hong;Lee, Hyo-Seong
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.29 no.5
    • /
    • pp.449-457
    • /
    • 2011
  • As automated image processing techniques have been required in multi-temporal/multi-sensor geospatial image applications, use of automated but highly invariant image matching technique has been a critical ingredient. Note that there is high possibility of geometric and spectral differences between multi-temporal/multi-sensor geospatial images due to differences in sensor, acquisition geometry, season, and weather, etc. Among many image matching techniques, the SIFT (Scale Invariant Feature Transform) is a popular method since it has been recognized to be very robust to diverse imaging conditions. Therefore, the SIFT has high potential for the geospatial image processing. This paper presents a performance test results of the SIFT on geospatial imagery by simulating various image differences such as shear, scale, rotation, intensity, noise, and spectral differences. Since a geospatial image application often requires a number of good matching points over the images, the number of matching points was analyzed with its matching positional accuracy. The test results show that the SIFT is highly invariant but could not overcome significant image differences. In addition, it guarantees no outlier-free matching such that it is highly recommended to use outlier removal techniques such as RANSAC (RANdom SAmple Consensus).

Automated Geometric Correction of Geostationary Weather Satellite Images (정지궤도 기상위성의 자동기하보정)

  • Kim, Hyun-Suk;Hur, Dong-Seok;Rhee, Soo-Ahm;Kim, Tae-Jung
    • Proceedings of the KSRS Conference
    • /
    • 2007.03a
    • /
    • pp.70-75
    • /
    • 2007
  • 2008년 12월에 우리나라 최초의 통신해양기상위성(Communications, Oceanography and Meteorology Satellite, COMS)이 발사될 예정이다. 통신해양기상위성의 영상데이터의 기하보정을 위하여 다음과 같은 연구를 수행하였다. 기상위성은 정지궤도상에 위치하여 전지구적인 영상을 얻는다. 영상의 전지구적인 해안선은 구름 등으로 가려져서 명확한 정보를 제공할 수 없게 된다. 구름 등으로 방해되지 않는 명확한 해안선 정보를 얻기 위하여 구름 추출을 한다. 실시간으로 기상정보를 얻는 기상위성의 특성상 정합에 전체 영상을 사용하면 수행시간이 다소 소요된다. 정합시 전체 영상에서 정합을 위한 후보점 추출을 위하여 GSHHS(Global Self-consistent Hierarchical High-resolution Shoreline)의 해안선 데이터베이스를 사용하여 211 개 의 랜드마크 칩들을 구축하였다. 이때 구축된 랜드마크 칩은 실험에 사용한 GOES-9의 위치 동경 155도를 반영하여 구축하였다. 전체 영상에서 구축된 랜드마크 칩들의 위치를 중심으로 구름추출을 수행한다. 전체 211 개의 후보점 중 구름이 제거된 나머지 후보점에 대하여 정합을 수행한다. 랜드마크 칩과 위성영상 간의 정합 중 참정합과 오정합이 존재하는데 자동으로 오정합을 검출하기 위하여 강인추정기법 (RANSAC, Random Sample Consensus)을 사용한다. 이때 자동으로 판별되어 오정합이 제거된 정합결과로 최종적인 기하보정을 수행한다. 기하보정을 위한 센서모델은 GOES-9 위성의 센서특정을 고려하여 개발되었다. 정합 및 RANSAC결과로 얻어진 기준점으로 정밀 센서모델을 수립하여 기하보정을 실시하였다. 이때 일련의 수행과정을 통신해양기상위성의 실시간 처리요구사항에 맞도록 속도를 최적화하여 진행되도록 개발하였다.

  • PDF

Matching Points Filtering Applied Panorama Image Processing Using SURF and RANSAC Algorithm (SURF와 RANSAC 알고리즘을 이용한 대응점 필터링 적용 파노라마 이미지 처리)

  • Kim, Jeongho;Kim, Daewon
    • 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.