• Title/Summary/Keyword: 선분 매칭

Search Result 5, Processing Time 0.026 seconds

Line Segments Matching Framework for Image Based Real-Time Vehicle Localization (이미지 기반 실시간 차량 측위를 위한 선분 매칭 프레임워크)

  • Choi, Kanghyeok
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.21 no.2
    • /
    • pp.132-151
    • /
    • 2022
  • Vehicle localization is one of the core technologies for autonomous driving. Image-based localization provides location information efficiently, and various related studies have been conducted. However, the image-based localization methods using feature points or lane information has a limitation that positioning accuracy may be greatly affected by road and driving environments. In this study, we propose a line segment matching framework for accurate vehicle localization. The proposed framework consists of four steps: line segment extraction, merging, overlap area detection, and MSLD-based segment matching. The proposed framework stably performed line segment matching at a sufficient level for vehicle positioning regardless of vehicle speed, driving method, and surrounding environment.

On-Line Recognition of Cursive Hangeul by Extended DP Matching Method (擴張된 DP 매칭법에 依한 흘림체 한글 온라인 認識)

  • Lee, Hee-Dong;Kim, Tae-Kyun;Agui, Takeshi;Nakajima, Masayuki
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.1
    • /
    • pp.29-37
    • /
    • 1989
  • This paper presents an application of the extended DP matching method to the on-line recognition of cursive Hangeul (Korean characters). We decrease the number of matching's objects by performing rough classification matching which makes the best use of features in the first and the last segment of Hangeul. By adding the extraction function of the basic character patterns to DP matching method, we try to calculate precisely the difference among Hangeul. The extraction of the basic character patterns is done by examining the features of segments in character. Applying the extended DP matching method to the on-line recognition of cursive Hangeul, absorption of writing motion and stable separation of strokes can be performed with flexibility.

  • PDF

The Implementation of Content-based Image Retrieval System Using Contours and Lines (윤곽과 선분을 이용한 내용기반 화상정보 검색시스템의 구현)

  • Jeong, Won-Il;Gu, Jeong-Hyeon;Choe, Gi-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.3
    • /
    • pp.683-695
    • /
    • 1996
  • In this paper, we implemented the content-based image retrieval system that indexes and retrieves the images by acquiring contour information of images and by extracting lines from the object. For this purpose, we proposed the advanced line extraction algorithm called FSLHT(Flexible SLHT) which covers drawback of SLHT(Straight Line Hough Transform)andapplied aDP(Dynamic Programming)algorithm to getadesirable similarity ofimages by lines. We estimated the contour features as a key value of sampled region to compensate for the problem that image contours are heavily depend on the noise. When performing the Hough transform we calculated the directionality based on the perceptual organization and transformed according to this direction to overcome the problem of time consuming and discontinuity.

  • PDF

Efficient From Document Classification Large using Partial Matching Method (부분 매칭 방법을 이용한 효율적인 서식 문서 분류)

  • Byeon, Yeong-Cheol;Choe, Yeong-U;Kim, Gyeong-Hwan;Lee, Il-Byeong
    • The KIPS Transactions:PartB
    • /
    • v.8B no.1
    • /
    • pp.1-9
    • /
    • 2001
  • 본 논문에서는 서식 문서를 짧은 처리 시간에 정확히 분류함으로써 실제 환경에서 응용할 수 있는 서식 분류 방법을 제안한다. 제안하는 방법은 서식 문서 이미지 전체를 다루기보다는 처리하고자 하는 서식 문서에서 서식 구조가 많이 다른 곳을 찾아서 매칭 영역으로 결정하고, 그 영역들에 대해서만 비교를 수행함으로써 계산 시간을 줄이고 인식률을 높인다. 선분 추출 시 오류를 고려하기 위하여 기존 인쇄 문자와 채워진 데이터, 그리고 매칭 영역의 크기 정보를 페널티 함수로 반영하여 매칭 영역 선택 시 고려한다. 본 방법은 구조적으로 많이 다르고, 양질의 특징을 포함하는 적은 수의 매칭 영역을 선택함으로써 처리 시간을 줄일 수 있음은 물론 높은 서식 분류율을 얻을 수 있다.

  • PDF

Curvature stroke modeling for the recognition of on-line cursive korean characters (온라인 흘림체 한글 인식을 위한 곡률획 모델링 기법)

  • 전병환;김무영;김창수;박강령;김재희
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.11
    • /
    • pp.140-149
    • /
    • 1996
  • Cursive characters are written on an economical principle to reduce the motion of a pen in the limit of distinction between characters. That is, the pen is not lifted up to move for writing a next stroke, the pen is not moved at all, or connected two strokes chance their shapes to a similar and simple shape which is easy to be written. For these reasons, strokes and korean alphabets are not only easy to be changed, but also difficult to be splitted. In this paper, we propose a curvature stroke modeling method for splitting and matching by using a structural primitive. A curvature stroke is defined as a substroke which does not change its curvanture. Input strokes handwritten in a cursive style are splitted into a sequence of curvature strokes by segmenting the points which change the direction of rotation, which occur a sudden change of direction, and which occur an excessive rotation Each reference of korean alphabets is handwritten in a printed style and is saved as a sequence of curvature strikes which is generated by splitting process. And merging process is used to generate various sequences of curvature strikes for matching. Here, it is also considered that imaginary strokes can be written or omitted. By using a curvature stroke as a unit of recognition, redundant splitting points in input characters are effectively reduced and exact matching is possible by generating a reference curvature stroke, which consists of the parts of adjacent two korean alphasbets, even when the connecting points between korean alphabets are not splitted. The results showed 83.6% as recognition rate of the first candidate and 0.99sec./character (CPU clock:66MHz) as processing time.

  • PDF