• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11a
• /
• pp.338-341
• /
• 2003

본 논문에서는 직선과 곡선으로 구성된 단순한 도면으로부터 곡선을 검출한 다음에 곡선을 원형 아크로 분할하는 방법을 제안한다. 본 논문의 방법에서는 먼저 선의 중심점을 찾은 다음에 연결된 중심점을 추적하여 선분을 검출한다. 그 다음에는 선분의 양 끝에서 선분의 방향을 이용하여 이웃한 선분을 검출하여 선분을 확장해 나간다. 선분을 확장한 다음에는 직선을 제거하고 곡선만 남긴 다음에 재귀적 분할 방법을 이용하여 곡선을 아크들의 집합으로 분할한다. 본 논문에서는 기존의 벡터화 소프트웨어와 벡터 기반 아크 분할 방법과 비교 실험을 수행하였다 실험 결과에 의하면 본 논문에서 제안된 방법이 기존의 방법에 비하여 교차점을 가지는 곡선에 대하여 보다 정확하게 아크로 분할하였다.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.509-518
• /
• 2009

In this paper, a mechanism that produces an approximation edges minimum spanning tree swiftly using virtual nodes called portals dividing given edges into same distance sub-edges. The approximation edges minimum spanning tree can be used in many useful areas as connecting communication lines, road networks and railroad systems. For 3000 random input edges, when portal distance is 0.3, tree building time decreased 29.74% while the length of the produced tree increased 1.8% comparing with optimal edge minimum spanning tree in our experiment. When portal distance is 0.75, tree building time decreased 39.96% while the tree length increased 2.96%. The result shows this mechanism might be well applied to the applications that may allow a little length overhead, but should produce an edge connecting tree in short time. And the proposed mechanism can produce an approximation edge minimum spanning tree focusing on tree length or on building time to meet user requests by adjusting portal distance or portal discard ratio as parameter.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.721-723
• /
• 2002

본 논문은 한 장의 사진으로부터 선분과 선분의 중점을 이용한 원시기하모델의 3차원 재구성 시스템을 제안한다. 이 시스템은 선분과 중점을 추출할 수 있는 미리 정의된 다면체를 원시기하모델로 사용하며 그 원시기하모델의 각 점을 사용자가 사진에 매핑 시키는 것으로서 3차원 재구성이 수행된다. 미리 정의된 원시기하모델의 사용은 사용자에게 기존의 소실점 입력 방식보다 직관적인 3차원 재구성을 가능하게 한다. 사진에 매핑된 원시기하모델이 포함하고 있는 2차원상의 선분과 선분의 중점으로부터 원시기하모델을 3차인 재구성한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.2
• /
• pp.415-420
• /
• 2016

A graph G=(V,E) is called an interval graph with a set V of vertices representing intervals on a line such that there is an edge $(i,j){\in}E$ if and only if intervals i and j intersect. In this paper, we are concerned in the vertex connectivity, one of various characteristics of the graph. Specifically, the vertex connectivity of an interval graph is represented by the overlapping of intervals. Also we propose an efficient algorithm to compute the vertex connectivity on the fully dynamic environment in which the vertices or the edges are inserted or deleted. Using a special kind of interval tree, we show how to compute the vertex connectivity and to maintain the tree in O(logn) time when a new interval is added or an existing interval is deleted.

• The KIPS Transactions:PartA
• /
• v.17A no.5
• /
• pp.213-220
• /
• 2010

In this paper, a mechanism connecting all input edges with minimum length through Steiner tree is proposed. Edges are convertible into communication lines, roads, railroads or trace of moving object. Proposed mechanism could be applied to connect these edges with minimum cost. In our experiments where input edge number and maximum connections per edge are used as input parameters, our mechanism made connection length decrease average 6.8%, while building time for a connecting solution increase average 192.0% comparing with the method using minimum spanning tree. The result shows our mechanism might be well applied to the applications where connecting cost is more important than building time for a connecting solution.

• Journal of Korea Multimedia Society
• /
• v.11 no.3
• /
• pp.292-300
• /
• 2008

An algorithm for detecting a line segment in an image is presented using incremental pixel extension. We use a different approach from conventional algorithms, such as the Hough transform approach and the line segment grouping approach. The Canny edge is calculated and an arbitrary point is selected among the edge elements. After the arbitrary point is selected, a base line approximating the line segment is calculated and edge pixels within an arbitrary radius are selected. A weighted value is assigned to each edge pixel, which is selected by using the error of the distance and the direction between the pixel and the base line. A line segment is extracted by Jilting a line using the weighted least square method after determining whether selected pixels are linked or delinked using the sum comparison of the weights. The proposed algorithm is compared with two other methods and results show that our algorithm is faster and can detect the real line segment.

• 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.

• Journal of Korea Multimedia Society
• /
• v.7 no.4
• /
• pp.579-591
• /
• 2004

This paper presents a new arc segmentation method which extracts curves from simple drawing consisted of straight lines and curves and segments them into circular arcs. First, it finds center points and finds line segments and curve segments by tracing connected center points. Next, it expands the segment by searching neighbor segment at the two endpoints. Next, it removes straight lines and segments the extracted curves into circular arcs by using the recursive subdivision method. The proposed method has been compared with previous vectorization software and vector based arc segmentation method. Experimental results show that the proposed method produces more correct results for the curves which contain intersection with other lines or curves.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.4
• /
• pp.168-176
• /
• 2005

We propose a method for 3-dimensionally reconstructing an object using a line that includes the midpoint information from a single image. A pre-defined polygon is used as the primitive and the recovery is processed from a single image. The 3D reconstruction is processed by mapping the correspondence point of the primitive model onto the photo. In the recent work, the reconstructions of camera parameters or error minimizing methods through iterations were used for model-based 3D reconstruction. However, we proposed a method for the 3D reconstruction of primitive that consists of the segments and the center points of the segments for the reconstruction process. This method enables the reconstruction of the primitive model to be processed using only the focal length of various camera parameters during the segment reconstruction process.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.05d
• /
• pp.574-578
• /
• 2002

층 단위로 가공하는 RP(Rapid Prototype) 시스템에서 가공되는 물체의 표면에서는 계단형의 윤곽이 나타난다. 이러한 문제점을 보완하기 위해 경사절단 방법으로 3D 모델을 가공하여 기존의 가공방법에 의해 발생하는 계단형 윤곽 모습과 표면 왜곡 둥의 문제를 보완할 수 있다. 최적의 경사선분의 집합을 구하기 위해 경사절단 선분의 길이와 중간층 점의 거리를 정의하여 이를 최소화하는 에너지 함수를 구현한다. 그러나 이 방법은 경사절단 선분이 에너지가 작아지는 방향으로만 움직이기 때문에 레이어의 윤곽이 복잡한 경우 최적의 위치가 아닌 다른 위치에서 더 이상 움직이지 않는 국부적 최적해(Local Minima)가 발생할 수 있다. 본 논문에서는 국부적 최적해를 벗어나기 위해 경사절단 선분 추출 알고리즘에 시뮬레이티드 어니얼링(Simulated Annealing) 방법을 적용하였다. 제안된 방법으로 테스트한 결과 복잡한 레이어 윤곽에서 생길 수 있는 국부적 최적해가 어느 정도 해결되었다.