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

• 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 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 KIPS Transactions:PartA
• /
• v.18A no.5
• /
• pp.215-224
• /
• 2011

In this paper, a mechanism connecting all weighted migration routes with minimum cost with EGOSST is proposed. Weighted migration routes may be converted to weighted input edges considered as not only traces but also traffics or trip frequencies of moving object on communication lines, roads or railroads. Proposed mechanism can be used in more wide and practical area than mechanisms considering only moving object traces. In our experiments, edge number, maximum weight for input edges, and detail level for grid are used as input parameters. The mechanism made connection cost decrease average 1.07% and 0.43% comparing with the method using weight minimum spanning tree and weight steiner minimum tree respectively. When grid detail level is 0.1 and 0.001, while each execution time for a connecting solution increases average 97.02% and 2843.87% comparing with the method using weight minimum spanning tree, connecting cost decreases 0.86% and 1.13% respectively. This shows that by adjusting grid detail level, proposed mechanism might be well applied to the applications where designer must grant priority to reducing connecting cost or shortening execution time as well as that it can provide good solutions of connecting migration routes with weights.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.44 no.6
• /
• pp.11-20
• /
• 2007

This paper proposes a new efficient method to detect ellipses using a segment merging based Randomized Hough Transform. The key idea of the proposed method is to separate single line segments from an edge image, to estimate ellipses from any pair of the single line segments using Randomized Hough Transform (RHT), and to merge the ellipses. This algorithm is able to accuracy estimate the number of ellipses and largely improves the computational time by reducing iterations.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1998.03a
• /
• pp.89-92
• /
• 1998

압연철판의 생산라인에 있는 카메라에 입력되는 영상정보를 Image Frame Grabber를 이용하지 않고 Video Overlay Board를 사용하여 라인에 입력되는 압연철판을 분석하여 외곽선을 가로지른 선분의 길이가 기준에 준할 때 정확한 절단정보를 발생시킴으로 기존에 사용해온 작업자의 대략적인 지식을 이용한 절단에서 발생되는 압연 철판의 손실을 최소화시키며 불량률을 줄인다. 그리고 발생되는 정보를 DB화시킴으로 생산품의 정확한 재고량을 관리하는 시스템을 개발한다.

• KIPS Transactions on Software and Data Engineering
• /
• v.10 no.4
• /
• pp.125-132
• /
• 2021

As the layers of artificial neural network deepens, and the dimension of data used as an input increases, there is a problem of high arithmetic operation requiring a lot of arithmetic operation at a high speed in the learning and recognition of the neural network (NN). Thus, this study proposes a data dimensionality reduction method to reduce the dimension of the input data in the NN. The proposed Line-segment Feature Analysis (LFA) algorithm applies a gradient-based edge detection algorithm using median filters to analyze the line-segment features of the objects existing in an image. Concerning the extracted edge image, the eigenvalues corresponding to eight kinds of line-segment are calculated, using 3×3 or 5×5-sized detection filters consisting of the coefficient values, including [0, 1, 2, 4, 8, 16, 32, 64, and 128]. Two one-dimensional 256-sized data are produced, accumulating the same response values from the eigenvalue calculated with each detection filter, and the two data elements are added up. Two LFA256 data are merged to produce 512-sized LAF512 data. For the performance evaluation of the proposed LFA algorithm to reduce the data dimension for the recognition of handwritten numbers, as a result of a comparative experiment, using the PCA technique and AlexNet model, LFA256 and LFA512 showed a recognition performance respectively of 98.7% and 99%.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.11a
• /
• pp.129-132
• /
• 2006

본 논문에서는 카메라 영상으로부터 사각형 형태의 마커를 검출하고 인식하는 방법을 제안한다. 본 논문에서는 사각형 형태의 마커 검출을 위하여 입력 영상을 이진 영상으로 변환하고 객체들의 윤곽선을 추출한 다음에 윤곽선을 선분으로 근사화 한다. 근사화된 선분으로부터 기하학적 특징을 이용하여 사각형을 찾는다. 마커의 사각형 영역을 찾은 다음에는 워핑 기법을 이용하여 사각형 마커 영상으로부터 특징 벡터를 추출하고 표준 마커에 대한 특징 벡터와의 최소 거래법에 의해 마커의 종류를 인식한다. 인식 실험 결과 마커의 종류가 50개일 때에 최대 98%의 인식률을 얻을 수 있었다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.369-374
• /
• 2010

The shortest path between two points inside a simple polygon P is a minimum-length path among all paths connecting them which don't pass by the exterior of P. A linear time algorithm for computing the shortest path in a general simple polygon requires triangulating a polygon as preprocessing. The linear time triangulating is known to very complex to understand and implement it. It is also inefficient in case that the input without very large size is given because its time complexity has a big constant factor. In this paper, we present the customized shortest path algorithm for a segment-visible polygon which is a simple polygon weakly visible from an internal line segment. Our algorithm doesn't require triangulating as preprocessing and consists of simple procedures such as construction of convex hulls, so it is easy to implement and runs very fast in linear time.