• International journal of advanced smart convergence
• /
• v.13 no.2
• /
• pp.88-93
• /
• 2024

The main problem with existing edge detection techniques is that they have many limitations in detecting edges for complex and diverse images that exist in the real world. This is because only edges of a defined shape are discovered based on an accurate definition of the edge. One of the methods to solve this problem is the cost minimization method. In the cost minimization method, cost elements and cost functions are defined and used. The cost function calculates the cost for the candidate edge model generated according to the candidate edge generation strategy, and if the cost is found to be satisfactory, the candidate edge model becomes the edge for the image. In this study, we proposed an enhanced candidate edge generation strategy to discover edges for more diverse types of images in order to improve the shortcoming of the cost minimization method, which is that it only discovers edges of a defined type. As a result, improved edge detection results were confirmed.

• Journal of Internet of Things and Convergence
• /
• v.8 no.1
• /
• pp.59-64
• /
• 2022

Existing edge discovery techniques only found edges of defined shapes based on precise definitions of edges. Therefore, there are many limitations in finding edges for images of complex and diverse shapes that exist in the real world. A method for solving these problems and discovering various types of edges is a cost minimization method. In this method, the cost function and cost factor are defined and used. This cost function calculates the cost of the candidate edge model generated according to the candidate edge generation strategy. If a satisfactory result is obtained, the corresponding candidate edge model becomes the edge for the image. In this study, a new candidate edge generation strategy was proposed to discover edges for images of more diverse shapes in order to improve the disadvantage of only finding edges of a defined shape, which is a problem of the cost minimization method. In addition, the contents of improvement were confirmed through a simple simulation that reflected these points.

• 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 Korea Multimedia Society
• /
• v.17 no.2
• /
• pp.143-151
• /
• 2014

In images degraded by bad weather, edges representing object boundaries become weak and faint. In this paper we present an image enhancement method, which increases image visibility by making edges as clear as possible. First, we choose edge candidate regions by finding local maxima and minima in an image intensity field, and then build a histogram using image intensities of pixels located at the two sides of candidate edges. Second, we decompose this histogram into multiple modes, which are determined by local minima in the histogram. Once modes are computed, we find modes connected by edges in the image intensity field and build link chains of connected modes. Finally we choose the longest link chain of modes and make the distances between every connected modes as large as possible. The darkest mode and the brightest mode should be within the image intensity range. This stretch makes edges clear and increases image visibility. Experiments show that the proposed method real-time enhances images degraded by bad weather as good as well known time-consuming methods.

• Journal of Korea Multimedia Society
• /
• v.18 no.10
• /
• pp.1216-1224
• /
• 2015

In this paper, a detection algorithm for the removal of needle in oriental clinic is presented. First, in the proposed method, the candidate areas of each needle penetrated are selected by using the RGB color information of needle head, and the false candidates are removed by considering their area size. Next, two main edges of the needle are extracted through using the edges of selected candidate areas and their radon transformation. The final verification of penetrated needle is accomplished by using the morphological analysis of these two edge lines. In the experiments, the detection rate of proposed method reaches to 99% for the 36 images containing 294 needles.

• Journal of Information Processing Systems
• /
• v.9 no.1
• /
• pp.141-156
• /
• 2013

In this paper we propose a method to detect human faces in color images. Many existing systems use a window-based classifier that scans the entire image for the presence of the human face and such systems suffers from scale variation, pose variation, illumination changes, etc. Here, we propose a lighting insensitive face detection method based upon the edge and skin tone information of the input color image. First, image enhancement is performed, especially if the image is acquired from an unconstrained illumination condition. Next, skin segmentation in YCbCr and RGB space is conducted. The result of skin segmentation is refined using the skin tone percentage index method. The edges of the input image are combined with the skin tone image to separate all non-face regions from candidate faces. Candidate verification using primitive shape features of the face is applied to decide which of the candidate regions corresponds to a face. The advantage of the proposed method is that it can detect faces that are of different sizes, in different poses, and that are making different expressions under unconstrained illumination conditions.

• The Journal of Engineering Research
• /
• v.6 no.2
• /
• pp.109-117
• /
• 2004

In this paper, we propose an object contour tracking algorithm using snakes in stereo image sequences. The proposed technique is composed of two steps. In the first step, the candidate Snake points are determined from the motion information in 3-D disparity space. In the second step, the energy of Snake function is calculated to check whether the candidate Snake points converge to the edges of the interested objects. The energy of Snake function is calculated from the candidate Snake points using the disparity information obtained by patch matching. The performance of the proposed technique is evaluated by applying it to various sample images. Results prove that the proposed technique can track the edges of objects of interest in the stereo image sequences even in the cases of complicated background images or additive components.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.9
• /
• pp.69-76
• /
• 2011

According to the related reports, about 60 percents of ship collisions have resulted from operating mistake caused by human factor. Specially, the report said that negligence of observation caused 66.8 percents of the accidents due to a human factor. Hence automatic detection and tracking of an object from an IR images are crucial for safety navigation because it can relieve officer's burden and remedies imperfections of human visual system. In this paper, we present a method to detect an object such as ship, rock and buoy from a sea IR image. Most edge directions of the sea image are horizontal and most vertical edges come out from the object areas. The presented method uses them as a characteristic for the object detection. Vertical edges are extracted from the input image and isolated edges are eliminated. Then morphological closing operation is performed on the vertical edges. This caused vertical edges that actually compose an object be connected and become an object candidate region. Next, reference object regions are extracted using horizontal edges, which appear on the boundaries between surface of the sea and the objects. Finally, object regions are acquired by sequentially integrating reference region and object candidate regions.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.59
• /
• pp.1-10
• /
• 2000

The traveling salesman problem is a representative NP-Complete problem. It needs lots of time to get a solution as the number of city increase. So, we need an efficient heuristic algorithm that gets good solution in a short time. Almost edges that participate in optimal path have somewhat low value cost. This paper discusses the property of nearest neighbor and 3-opt. This paper uses nearest neighbor's property to select candidate edge. Candidate edge is a set of edge that has high probability to improve cycle path. We insert edge that is one of candidate edge into intial cycle path. As two cities are connected. It does not satisfy hamiltonian cycle's rule that every city must be visited and departed only one time. This paper uses 3-opt's method to sustain hamiltonian cycle while inserting edge into cycle path. This paper presents a highly efficient heuristic algorithm verified by numerous experiments.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.582-591
• /
• 2009

The pyramid graph is an interconnection network topology based on regular square mesh and tree structures. In this paper, we adopt a strategy of classification into two disjoint groups of edges in regular square mesh as a base sub-graph constituting of each layer in the pyramid graph. Edge set in the mesh can be divided into two disjoint sub-sets called as NPC(represents candidate edge for neighbor-parent) and SPC(represents candidate edge for shared-parent) whether the parents vertices adjacent to two end vertices of the corresponding edge have a relation of neighbor or shared in the upper layer of pyramid graph. In addition, we also introduce a notion of shrink graph to focus only on the NPC-edges by hiding SPC-edges in the original graph within the shrunk super-vertex on the resulting graph. In this paper, we analyze that the lower and upper bound on the number of NPC-edges in a Hamiltonian cycle constructed on $2^n\times2^n$ mesh is $2^{2n-2}$ and $3*(2^{2n-2}-2^{n-1})$ respectively. By expanding this result into the pyramid graph, we also prove that the maximum number of NPC-edges containable in a Hamiltonian cycle is $4^{n-1}-3*2^{n-1}$-2n+7 in the n-dimensional pyramid.