• Title/Summary/Keyword: Hough Transformation

Search Result 71, Processing Time 0.029 seconds

Fast Local Indoor Map Building Using a 2D Laser Range Finder (2차원 레이저 레이진 파이더를 이용한 빠른 로컬 실내 지도 제작)

  • Choi, Ung;Koh, Nak-Yong;Choi, Jeong-Sang
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 1999.10a
    • /
    • pp.99-104
    • /
    • 1999
  • This paper proposes an efficient method constructing a local map using the data of a scanning laser range finder. A laser range finder yields distance data of polar form, that is, distance data corresponding to every scanning directions. So, the data consists of directional angle and distance. We propose a new method to find a line fitting with a set of such data. The method uses Log-Hough Transformation. Usually, map building from these data requires some transformations between different coordinate systems. The new method alleviates such complication. Also, the method simplifies computation for line recognition and eliminates the slope quantization problems inherent in the classical Cartesian Hough transform method. To show the efficiency of the proposed method, it is applied to find a local map using the data from a laser range finder PLS(Proximity Laser Scanner, made by SICK).

  • PDF

The Study on Searching Algorithm of the center of Pupil for the Iris Recognition (홍채 인식을 위한 동공 중심점 탐색 알고리즘에 관한 연구)

  • Cho, Meen-Hwan;Hur, Jung-Youn
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.1 s.39
    • /
    • pp.19-25
    • /
    • 2006
  • Iris recognition is a bio metric personal identification which uses iris pattern of the pupil, and it is recognized as one of the best technology in personal identification and information security field. Before iris recognition, it is very important to search center of pupil. In recent years, there was developed many searching algorithms of center of pupil, but all most method are too many processing time. In this paper, we proposed a new method for searching center of pupil. This method is greatly reduced processing time about 30% compared with other algorithm using Hough transformation.

  • PDF

Invariant Image Matching using Linear Features (선형특징을 사용한 불변 영상정합 기법)

  • Park, Se-Je;Park, Young-Tae
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.12
    • /
    • pp.55-62
    • /
    • 1998
  • Matching two images is an essential step for many computer vision applications. A new approach to the scale and rotation invariant scene matching, using linear features, is presented. Scene or model images are described by a set of linear features approximating edge information, which can be obtained by the conventional edge detection, thinning, and piecewise linear approximation. A set of candidate parameters are hypothesized by mapping the angular difference and a new distance measure to the Hough space and by detecting maximally consistent points. These hypotheses are verified by a fast linear feature matching algorithm composed of a single-step relaxation and a Hough technique. The proposed method is shown to be much faster than the conventional one where the relaxation process is repeated until convergence, while providing matching performance robust to the random alteration of the linear features, without a priori information on the geometrical transformation parameters.

  • PDF

Aerial scene matching using linear features (선형특징을 사용한 항공영상의 정합)

  • 정재훈;박영태
    • Proceedings of the IEEK Conference
    • /
    • 1998.06a
    • /
    • pp.689-692
    • /
    • 1998
  • Matching two images is an essential step for many computer vision applications. A new approach to the scale and rotation invariant scene matching is presented. A set of andidate parameters are hypthesized by mapping the angular difference and a new distance measure to the hough space and by detecting maximally consistent points. The proposed method is shown to be much faster than the conventinal one where the relaxation process is repeated until convergence, while providing robust matching performance, without a priori information on the geometrical transformation parameters.

  • PDF

Automatic measurement of blade width using image processing techniques (영상처리에 의한 연삭면 너비 계측)

  • 김선일;박종구;박찬웅
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1990.10a
    • /
    • pp.799-804
    • /
    • 1990
  • In the blade grinding process, Blade image is captured. It is captured in the environment with vibration, using monochrome CCD camera with high speed electronic shutter. The image is preprocessed using LoG filter and zero crossing. We used Hough transformation to detect straight lines from the preprocessed image. From the equations of detected lines, we calculated width between lines caused by grinders. This paper proposes automatic measurement of blade width to automate the process control of blade grinding line.

  • PDF

Process Control of Gas Metal Arc Welding Using Neural Network (신경회로망을 이용한 GMA 용접의 공정제어)

  • 조만호;양상민;조택동;김옥현
    • Proceedings of the KWS Conference
    • /
    • 2002.05a
    • /
    • pp.68-70
    • /
    • 2002
  • A CCD camera with a laser strip was applied to realize the automation of welding process in GMAW. The Hough transformation was used to extract the laser stripe and to obtain specific weld points. In this study, a neural network based on the generalized delta rule algorithm was adapted for the process control of GMA, such as welding speed, arc voltage and wire feeding speed.

  • PDF

Selective Ridge Matching for Poor Quality Fingerprint verification (열악한 지문 영상의 검증을 위한 선택적 융선 정합 기법)

  • 최호석;박영태
    • Proceedings of the IEEK Conference
    • /
    • 2001.06d
    • /
    • pp.9-12
    • /
    • 2001
  • Point pattern matching schemes for finger print recognition do not guarantee robust matching performance for finger print images of poor quality. We present a finger print recognition scheme, where transformation parameter of matched ridge pairs are estimated by Hough transform and the matching hypothesis is verified by a new measure of the matching degree using selective directional information. Proposed method may exhibit extremely low FAR(False Accept Ratio) while maintaining low reject ratio even for the images of poor quality because of the robustness to the variation of minutia points.

  • PDF

Automatic Blade Measurement for Grinding Process Automation (연마 공정 자동화를 위한 연삭면 자동 계측)

  • Kim, Seon-Il;Park, Jong-Gu;Park, Chan-Ung;Yang, Yun-Mo
    • 한국기계연구소 소보
    • /
    • s.19
    • /
    • pp.141-147
    • /
    • 1989
  • Using monochrome CCD camera with high speed electronic shutter. blade image is captured in the environment with vibration. The image is preprocessed using LoG filter and zero crossing. We used Hough transformation method to detect straight lines and obtained width between lines caused by grinders. This paper proposes automatic blade measuring method to automate the process control of blade grinding.

  • PDF

Crosswalk Detection using Feature Vectors in Road Images (특징 벡터를 이용한 도로영상의 횡단보도 검출)

  • Lee, Geun-mo;Park, Soon-Yong
    • The Journal of Korea Robotics Society
    • /
    • v.12 no.2
    • /
    • pp.217-227
    • /
    • 2017
  • Crosswalk detection is an important part of the Pedestrian Protection System in autonomous vehicles. Different methods of crosswalk detection have been introduced so far using crosswalk edge features, the distance between crosswalk blocks, laser scanning, Hough Transformation, and Fourier Transformation. However, most of these methods failed to detect crosswalks accurately, when they are damaged, faded away or partly occluded. Furthermore, these methods face difficulties when applying on real road environment where there are lot of vehicles. In this paper, we solve this problem by first using a region based binarization technique and x-axis histogram to detect the candidate crosswalk areas. Then, we apply Support Vector Machine (SVM) based classification method to decide whether the candidate areas contain a crosswalk or not. Experiment results prove that our method can detect crosswalks in different environment conditions with higher recognition rate even they are faded away or partly occluded.

The estimation of camera calibration parameters using the properties of vanishing point at the paved and unpaved road (무한원점의 성질을 이용한 포장 및 비포장 도로에서의 카메라 교정 파라메터 추정)

  • Jeong, Jun-Ik;Jeong, Myeong-Hee;Rho, Do-Whan
    • Proceedings of the KIEE Conference
    • /
    • 2006.10c
    • /
    • pp.178-180
    • /
    • 2006
  • In general, camera calibration has to be gone ahead necessarily to estimate a position and an orientation of the object exactly using a camera. Autonomous land system in order to run a vehicle autonomously needs a camera calibration method appling a camera and various road environment. Camera calibration is to prescribe the confrontation relation between third dimension space and the image plane. It means to find camera calibration parameters. Camera calibration parameters using the paved road and the unpaved road are estimated. The proposed algorithm has been detected through the image processing after obtaining the paved road and the unpaved road. There is able to detect easily edges because the road lanes exist in the raved road. Image processing method is two. One is a method on the paved road. Image is segmentalized using open, dilation, and erosion. The other is a method on the unpaved road. Edges are detected using blur and sharpening. So it has been made use of Hough transformation in order to detect the correct straight line because it has less error than least-square method. In addition to, this thesis has been used vanishing point' principle. an algorithm suggests camera calibration method using Hough transformation and vanishing point. When the algorithm was applied, the result of focal length was about 10.7[mm] and RMS errors of rotation were 0.10913 and 0.11476 ranges. these have the stabilized ranges comparatively. This shows that this algorithm can be applied to camera calibration on the raved and unpaved road.

  • PDF