• Journal of the Korea Society of Computer and Information
• /
• v.15 no.10
• /
• pp.35-47
• /
• 2010

To complement inaccurate edge information and detect correctly the boundary of a vehicle in an image, an extended edge analysis technique is presented in this paper. The vehicle is detected using the bottom boundary generated by a vehicle and the road surface and the left and right side boundaries of the vehicle. The proposed extended edge analysis method extracts the horizontal edge by merging or dividing the nearby edges inside the region of interest set beforehand because various noises deteriorates the horizontal edge which can be a bottom boundary. The horizontal edge is considered as the bottom boundary and the vertical edges as the side boundaries of a vehicle if the extracted horizontal edge intersects with two vertical edges which satisfy the vehicle width condition at the height of the horizontal edge. This proposed algorithm is more efficient than the other existing methods when the road surface is complex. It is proved by the experiments executed on the roads having various backgrounds.

• Journal of KIISE:Software and Applications
• /
• v.36 no.11
• /
• pp.875-890
• /
• 2009

Metabolimics interprets an organism as a network of functional units and an organism is represented by a metabolic pathway i.e., well-displayed graph. So a software tool for drawing pathway is necessary to understand it comprehensively. These tools have a problem that edge-crossings exponentially increase as the number of nodes grows. To apply automatic graph layout techniques to the genome-scale metabolic flow, it is very important to reduce unnecessary edge-crossing on a metabolic pathway layout. In this paper, we design and implement 2.5D metabolic pathway layout modules. Metabolic pathways are represented hierarchically by making use of the '2-layered layout algorithm' in 3D. It enhances the readability and reduces unnecessary edge-crossings by using 3D layout modules instead of 2D layout algorithms.

• Journal of Advanced Marine Engineering and Technology
• /
• v.24 no.2
• /
• pp.82-89
• /
• 2000

Edge detection is the first step and very important step in image analysis. In this paper, proposed edge detection operators based on informations of edge types and it is different from other classical edge detection operators such as gradient and surface fitting operators. The first, we defined characteristics of edge types such as localization, thinness, length. The second, we defined valid edge types and ideal edge pixel positions in $3\times3$window based on edge characteristics of edge types. And we proposed edge detection algorithm and twelve windows based on valid edge types. In specially, proposed algorithm was shown better performence of edge detection than other operators such as gradient operator and the LoG(Laplacian of Gaussian) operator of zero crossings.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1337-1345
• /
• 1996

Edge detection is the first step and very important step in image nalyisi. In this paper, proposed edge detection algorithm based on informations of edge structures and it is different from other classical edge detection operators such asgradient and surface fitting algorithm. The firs, we defined characteristics of edge structures such as continuity, thinness, localization, length. The second, we defined valid edge structures and ideal edge pixel positions in $3\times3$ window based on edge characteristics of edge structures. And we proposed twelve windows for enhance dissimilarity regions based on valid edge structures and ideal edge pixel positions. In specially, proposed algorithm was shown better performance of edge detection than other operators such as gradient operator and the LoG(Laplacian of gradient) operator of zero crossings in noisy test image with $\sigma=30$.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.6
• /
• pp.71-79
• /
• 2013

Metabolic pathway, represented by well-displayed graph, have a complex binding structure, which makes the graphical representation hard to visualize. To apply automatic graph layout techniques to the genome-scale metabolic flow of metabolism domains, it is very important to reduce unnecessary edge crossing on a metabolic pathway layout. we proposed a metabolic pathway layout algorithm based on 3-layer layout. Our algorithm searches any meaningful component existing in a pathway, such as circular components, highly connected nodes, and the components are drawn in middle layer. Then the remaining subgraphs except meaningful components are drawn in upper and lower layer by utilizing a new radial layout algorithm. It reduces ultimately reduced the number of edge crossings. Our algorithm solve the problem that edge crossings exponentially increase as the number of nodes grows.

• The KIPS Transactions:PartA
• /
• v.18A no.6
• /
• pp.225-232
• /
• 2011

Restricted Hypercube-Like (RHL) graphs are a graph class that widely includes useful interconnection networks such as crossed cube, Mobius cube, Mcube, twisted cube, locally twisted cube, multiply twisted cube, and generalized twisted cube. In this paper, we show that for an m-dimensional RHL graph G, $m{\geq}4$, with an arbitrary faulty edge set $F{\subset}E(G)$, ${\mid}F{\mid}{\leq}m-2$, graph $G{\setminus}F$ has a hamiltonian path between any distinct two nodes s and t if dist(s, V(F))${\neq}1$ or dist(t, V(F))${\neq}1$. Graph $G{\setminus}F$ is the graph G whose faulty edges are removed. Set V(F) is the end vertex set of the edges in F and dist(v, V(F)) is the minimum distance between vertex v and the vertices in V(F).

• Journal of Digital Contents Society
• /
• v.15 no.2
• /
• pp.209-217
• /
• 2014

It is very important to classify a lot of table-form documents into the same type of classes or to extract information filled in the template automatically. For these, it is necessary to accurately analyze table-form structure. This paper proposes an algorithm to extract corner points based on line edge segments and to classify the type of junction from table-form images. The algorithm preprocesses image through binarization, skew correction, deletion of isolated small area of black color because that they are probably generated by noises.. And then, it processes detections of edge block, line edges from a edge block, corner points. The extracted corner points are classified as 9 types of junction based on the combination of horizontal/vertical line edge segments in a block. The proposed method is applied to the several unconstraint document images such as tax form, transaction receipt, ordinary document containing tables, etc. The experimental results show that the performance of point detection is over 99%. Considering that almost corner points make a correspondence pair in the table, the information of type of corner and width of line may be useful to analyse the structure of table-form document.

• The KIPS Transactions:PartB
• /
• v.11B no.2
• /
• pp.149-158
• /
• 2004

This study proposes a method for segmentation and recognition of traffic signs using shape information and edge image in real image. It first segments traffic sign candidate regions by connected component algorithm from binary images, obtained by utilizing the RGB color ratio of each pixel in the image, and then extracts actual traffic signs based on their symmetries on X- and Y-axes. Histogram equalization is performed for unsegmented candidate regions caused by low contrast in the image. In the recognition stage, it utilizes shape information including projection profiles on X- and Y-axes, moment, and the number of crossings and distance which concentric circular patterns and 8-directional rays from region center intersects with edges of traffic signs. It finally performs recognition by measuring similarity with the templates in the database. It will be shown from several experimental results that the system is robust to environmental factors, such as light and weather condition.

• Proceedings of the Korean Society Of Semiconductor Equipment Technology
• /
• 2007.06a
• /
• pp.76-80
• /
• 2007

반도체 제조공정에서 매엽식 습식 식각 공정은 기판을 회전하면서 상하 면에 약액을 분사하는 형태로 박막을 식각한다. 이 때 기판은 척을 이용하여 고정되는 데 기판과 척이 접촉하는 가장자리 부분에서 약액의 흐름이 정체되거나 일정하지 못해 잔류막질이 남게 되고, 후속 공정에서 기판 오염의 문제를 야기하게 된다. 본 논문에서는 이러한 문제를 해결하기 위해 기판을 파지하는 여러 개의 척을 2개조로 나누어 교대로 파지하도록 하는 기능을 제시하였다. 2개 조의 척들은 자성체를 사용하여 고속 회전 중에 비접촉 방식으로 구동하였고 실제 약액 처리론 수행하여 효과를 관찰하였다. 결과적으로 기존 고정형 파지 방식에 비해 교차형이 기판 베벨면이나 에지면에서의 잔류 막질 제거에 탁월한 효과가 있음을 확인하였다.

• Journal of Korea Game Society
• /
• v.20 no.3
• /
• pp.75-84
• /
• 2020

This paper introduces an interactive indirect illumination algorithm which considers indirect visibility. First, a small number of rays are emitted on hemisphere of the current pixel to obtain the first intersection. If this point is directly illuminated by the light source, its illuminated color is collected. Second, in order to approximate the indirect visibility, a 3D ray marching algorithm, which is based on a hierarchy structure, is used to accelerate the ray-voxel intersection. Third, the indirect images are denoised by an edge-avoiding filtering with a local means replacement method.