• Journal of the Korea Society of Computer and Information
• /
• v.21 no.4
• /
• pp.9-15
• /
• 2016

Symmetry is everywhere in the world around us from galaxy to microbes. From ancient times symmetry is considered to be a reflection of the harmony of universe. Symmetry is not only a significant clue for human cognitive process, but also useful information for computer vision such as image understanding system. Application areas include face detection and recognition, indexing of image database, image segmentation and detection, analysis of medical images, and so on. The technique used in this paper extracts edges, and the perpendicular bisector of any two edge points is considered to be a candidate axis of symmetry. The coefficients of candidate axis are accumulated in the coefficient space. Then the axis of symmetry is determined to be the line for which the coefficient histogram has maximum value. In this paper, an improved method is proposed that utilizes the directional information of edges, which is a byproduct of the edge detection process. Experiment on 20 test images shows that the proposed method performs 22.7 times faster than the original method. In another test on 5 images with 4% salt-and-pepper noise, the proposed method detects the symmetry successfully, while the original method fails. This result reveals that the proposed method enhances the speed and accuracy of detection process at the same time.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.7
• /
• pp.101-109
• /
• 2013

In this paper, a method to decide the number of additional edges to integrate two communities in social network by using modularity is studied. The modularity is a measure to be used to describe the quality of the community. By adding additional edges to the communities, the quality of the communities is enhanced, To integrate two communities, we propose methods to decide the number of additional edges by calculating the modularity. Also, the conditions that the proposed method is valid is investigated in a simple test graph and the efficiency of the proposed method is approved by integrating two communities in Zachary Karate Club network.

• Structural Engineering and Mechanics
• /
• v.5 no.4
• /
• pp.433-450
• /
• 1997

The objective of this work is to predict the failure loads, associated maximum transverse displacements, locations and the modes of failure, including the onset of delamination, of thin, flat, square symmetric laminates under the action of uni-axial compression. Two progressive failure analyses, one using Hashin criterion and the other using Tensor polynomial criteria, are used in conjunction with the finite element method. First order shear deformation theory and geometric nonlinearity in the von Karman sense have been employed. Five different types of lay-up sequence are considered for laminates with all edges simply supported. In addition, two boundary conditions, one with all edges fixed and other with mixed boundary conditions for $(+45/-45/0/90)_{2s}$ quasi-isotropic laminate have also been considered to study the effect of boundary restraints on the failure loads and the corresponding modes of failure. A comparison of linear and nonlinear results is also made for $({\pm}45/0/90)_{2s}$ quasi-isotropic laminate. It is observed that the maximum difference between the failure loads predicted by various criteria depend strongly on the laminate lay-ups and the flexural boundary restraints. Laminates with clamped edges are found to be more susceptible to failure due to the transverse shear and delamination, while those with the simply supported edges undergo total collapse at a load slightly higher than the fiber failure load.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.6
• /
• pp.72-80
• /
• 1998

A method is proposed for directional vector quantization using the wavelet packets. After partitioning the wavelet packet coefficients into 9 edges according to the corresponding directions, it encodes and transmits locally dominant edges. The directions of the edges are encoded with a variable length coding and conditional switching of codebooks, while the contents of them with the vector quantization followed by the variable length index coding. The proposed algorithm is superior to various conventional image coding algorithms in the sense of PSNR, which is relatively more significant at very low bit rate such as 0.1~0.3 bpp. As the proposed algorithm preserves the edges which is the most important for the human visual system, it also provides the reconstructed images of good subjective quality even at very low bit rate.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.1
• /
• pp.81-86
• /
• 2004

This paper describes self-localization of a mobile robot from the multiple candidates of landmarks in outdoor environment. Our robot uses omnidirectional vision system for efficient self-localization. This vision system acquires the visible information of all direction views. The robot uses feature of landmarks whose size is bigger than that of others in image such as building, sculptures, placard etc. Robot uses vertical edges and those merged regions as the feature. In our previous work, we found the problem that landmark matching is difficult when selected candidates of landmarks belonging to region of repeating the vertical edges in image. To overcome these problems, robot uses the merged region of vertical edges. If interval of vertical edges is short then robot bundles them regarding as the same region. Thus, these features are selected as candidates of landmarks. Therefore, the extracted merged region of vertical edge reduces the ambiguity of landmark matching. Robot compares with the candidates of landmark between previous and current image. Then, robot is able to find the same landmark between image sequences using the proposed feature and method. We achieved the efficient self-localization result using robust landmark matching method through the experiments implemented in our campus.

• Bulletin of the Korean Mathematical Society
• /
• v.33 no.1
• /
• pp.119-126
• /
• 1996

In this paper we study the asymptotic behavior of the edge independence number of a random (n,n)-tree. The tools we use include the matrix-tree theorem, the probabilistic method and Hall's theorem. We begin with some definitions. An (n,n)_tree T is a connected, acyclic, bipartite graph with n light and n dark vertices (see [Pa92]). A subset M of edges of a graph is called independent(or matching) if no two edges of M are adfacent. A subset S of vertices of a graph is called independent if no two vertices of S are adjacent. The edge independence number of a graph T is the number $\beta_1(T)$ of edges in any largest independent subset of edges of T. Let $\Gamma(n,n)$ denote the set of all (n,n)-tree with n light vertices labeled 1, $\ldots$, n and n dark vertices labeled 1, $\ldots$, n. We give $\Gamma(n,n)$ the uniform probability distribution. Our aim in this paper is to find bounds on $\beta_1$(T) for a random (n,n)-tree T is $\Gamma(n,n)$.

• Journal of the Korean institute of surface engineering
• /
• v.50 no.1
• /
• pp.17-23
• /
• 2017

This work demonstrates arc generation and anodic film formation behaviors on Al1050 alloy during PEO (plasma electrolytic oxidation) treatment under a constant direct current in an alkaline electrolyte containing silicate, carbonate and borate ions. Only one big arc more than 2 mm diameter was generated first at the edges and it was moving on the fresh surface or staying occasionally at the edges, resulting in the local burning due to generation of an extremely big orange colored arc at the edges. Central region of the flat surface was not fully covered with PEO films even after sufficiently long treatment time because of the local burning problem. The anodic oxides formed on the flat surface by arcing once were found to consist of a number of small oxide nodules with spherical shape of $3{\sim}6{\mu}m$ size and irregular shapes of about $5{\sim}10{\mu}m$ width and $10{\sim}20{\mu}m$ length. The anodic oxide nodules showed uniform thickness of about $3{\mu}m$ and rounded edges. These experimental results suggest that one big arc observed on the specimen surface under the application of a constant direct current is composed of a number of small micro-arcs less than $20{\mu}m$ size.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.499-510
• /
• 2007

Shortest path tree(SPT) construction is essential in high performance routing in an interior network using link state protocols. When some links have new state values, SPTs may be rebuilt, but the total rebuilding of the SPT in a static way for a large computer network is not only computationally expensive, unnecessary modifications can cause routing table instability. This paper presents a new update algorithm, dynamic shortest path tree(DSPT) that is computationally economical and that maintains the unmodified nodes mostly from an old SPT to a new SPT. The proposed algorithm reduces redundancy using a dynamic update approach where an edge becomes the significant edge when it is extracted from a built edge list Q. The average number of significant edges are identified through probability analysis based on an arbitrary tree structure. An update derived from significant edges is more efficient because the DSPT algorithm neglect most other redundant edges that do not participate in the construction of a new SPT. Our complexity analysis and experimental results show that DSPT is faster than other known methods. It can also be extended to solve the SPT updating problem in a graph with negative weight edges.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5C
• /
• pp.514-520
• /
• 2009

This paper proposes a new deinterlacing algorithm which improves the performance of the spatial filter. Extracting exact edges is very important element of deinterlacing performance. So the proposed algorithm has interpolated locally adaptive-thresholded binary image, and extracted exact edges from the interpolated binary image. The values of pixels on edges extracted from binary image are interpolated using neighborhood lines on the same edge. With computer simulations for a variety of images, it is shown that the proposed algorithm is much better than traditional methods.

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