• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.499-502
• /
• 2001

Fractal image coding suffers from the long search time of domain pool although it provides many properties including the high compression ratio. We find that the normalized variance of a block is independent of contrast, brightness. Using this observation, we introduce a self similar block searching method employing the d-dimensional nearest neighbor searching. This method takes Ο(log/N) time for searching the self similar domain blocks for each range block where N is the number of domain blocks. PSNR (Peak Signal Noise Ratio) of this method is similar to that of the full search method that requires Ο(N) time for each range block. Moreover, the image quality of this method is independent of the number of edges in the image.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.3
• /
• pp.147-152
• /
• 2008

Ant System(AS) is new meta heuristic for hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem. In this paper, AS is applied to the Multicast Routing Problem. Multicast Routing is modeled as the NP-complete Steiner tree problem. This is the shortest path from source node to all destination nodes. We proposed new AS to resolve this problem. The proposed method selects the neighborhood node to consider all costs of the edge and the next node in state transition rule. Also, The edges which are selected elite agents are updated to additional pheromone. Simulation results of our proposed method show fast convergence and give lower total cost than original AS and $AS_{elite}$.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.5
• /
• pp.179-186
• /
• 2014

Current networks such as social network, web page link, traffic network are big data which have the large numbers of nodes and edges. Many applications such as social network services and navigation systems use these networks. Since big networks are not fit into the memory, existing in-memory based analysis techniques cannot provide high performance. Frontier-Expansion-Merge (FEM) framework for graph search operations using three corresponding operators in the relational database (RDB) context. FEM exploits an index table that stores pre-computed partial paths for efficient shortest path discovery. However, the index table of FEM has low hit ratio because the indices are determined by distances of indices rather than the possibility of containing a shortest path. In this paper, we propose an method that construct index table using high degree nodes having high hit ratio for efficient shortest path discovery. We experimentally verify that our index technique can support shortest path discovery efficiently in real-world datasets.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.46 no.5
• /
• pp.15-21
• /
• 2009

Deformity detection in a Light Emitting Diode (LED) is an important aspect for improving its quality. These LED deformities can be checked through several methods. This paper details the automatic deformity detection inspection system of a LED using the LabVIEW Builder 3.6 software. This software has a graphical user interface which makes it easy to observe and modify the behavior of its element. The LabVIEWs essential elements are also presented and explained aside from its image acquisition system. Details on how to build an inspection system and how to implement vision inspection algorithm which mainly consists of edge detection, geometry point location, and distance measurement are included in this paper.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.3
• /
• pp.298-303
• /
• 2014

In this paper, we proposed a robust object extraction and tracking algorithm in the IR image sequence acquired in the sea environment. In order to extract size-invariant object, we detect horizontal and vertical edges by using DWT and combine it to generate saliency map. To extract object region, binarization technique is applied to saliency map. The correspondences between objects in consecutive frames are defined by the calculating minimum weighted Euclidean distance as a matching measure. Finally, object trajectories are determined by considering false correspondences such as entering object, vanishing objects and false object and so on. The proposed algorithm can find trajectories robustly, which has shown by experimental results.

• The Journal of the Korea Contents Association
• /
• v.3 no.4
• /
• pp.23-28
• /
• 2003

This paper describes, in order to extract contour from topographic map image, an adaptive segment-length thresholding using a threshold depended on target image. First of all, after recognizing the primary symbols and detecting two edges from the projection histogram of the elevation value area, the threshold value is determined by the distance between the edges. Then, the subdivision is peformed by searching a branch point and erasing its neighboring Hack pixels. And contour components are extracted by segment-length thresholding. The experimental result shows that the final image contains non-contour component of 2.41% and contour one of 97.59%.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.11a
• /
• pp.146-149
• /
• 2014

최근 자동차 산업과 IT 기술의 융합이 활발해지면서 스마트카, 자율주행 자동차(무인 자동차)와 같은 지능형 자동차 개발이 활발히 진행되고 지능형 자동차의 비전 기반 기술개발도 활발히 진행되고 있다. 고속도로와 같이 포장된 도로나 자갈길과 같은 비포장 도로에서도 운전자의 승차감을 고려한 능동적 안전시스템과 안정적인 자율주행 자동차의 주행능력을 보장하는 기술들 중 도로 유형을 판단하는 것이 중요 요소 중 하나이다. 따라서 본 논문에서는 가중치 기반 클러스터링 기술을 이용하여 도로표면 유형을 분류하는 알고리즘을 제안한다. 아스팔트, 자갈길, 흙길, 눈길의 도로표면 영상 데이터를 히스토그램의 분포도와 최고점 위치, 에지 영상의 에지량, 채도성분을 이용하여 특징값을 추출하고 클러스터를 구성한다. 분류할 입력 도로표면 영상에 대해 특징값을 분석한 후 탐색범위 내 선택된 각 클러스터의 벡터와의 거리를 측정하여 가중치를 계산하고 가중치가 높은 클러스터를 분류하여 입력 영상에 대한 도로표면을 결정한다. 실험결과 제안하는 방법이 각 도로표면 영상의 특징값과 이를 이용한 가중치만을 이용하여 약 91.25%의 정확도로 도로의 표면을 분류해 내는 것을 볼 수 있었다.

• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.551-562
• /
• 2000

Content-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. GContent-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. Generally, the query image produced by a user is different from the intended target image. To overcome this problem, many image retrieval systems use the spatial relationships of the objects, instead of pixel coordinates of the objects. In this paper, a query-converting algorithm for an image retrieval system, which uses the spatial relationship of every two objects as an image feature, is proposed. The proposed algorithm converts the query image into a graph that has the minimum number of edges, by eliminating every transitive edge. Since each edge in the graph represents the spatial relationship of two objects, the elimination of unnecessary edges makes the retrieval process more efficient. Experimental results show that the proposed algorithm leads the smaller number of comparison in searching process as compared with other algorithms that do not guarantee the minimum number of edges.

• Journal of Digital Contents Society
• /
• v.3 no.2
• /
• pp.197-209
• /
• 2002

If we reduce the number of vertexes to decrease bit rate in polygon-based shape coding, the distortion of approximated contour increases rapidly. On the other hand, if we reduce the distortion, the number of vertexes increases rapidly and many bits are required to encode the vertexes. To improve this problem, in this paper we propose the approximation vertex search method. The encoder in the proposed method searches the type of distortion patterns that is the most similar to the shape which polygon edge and contour segment form and then encodes it. And then, the decoder mathematically finds the approximated vertexes from decoded distortion pattern information. Therefore, the proposed algorithm results in encoding many vertexes at a low bit rate and having the smoother shape than conventional method. As shown in computer simulation, the proposed method has less distortion than conventional method. It costs less bit rate by $10{\sim}20%$ than conventional algorithm in same distortion.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.181-188
• /
• 2005

Chinese Postman Problem (CPP) is a problem that finds a shortest tour traversing all edges or arcs at least once in a given network. The Chinese Postman Problem on Mixed networks (MCPP) is a Practical generalization of the classical CPP and it has many real-world applications. The MCPP has been shown to be NP-complete. In this paper, we transform a mixed network into a symmetric network using virtual arcs that are shortest paths by Floyd's algorithm. With the transformed network, we propose a Genetic Algorithm (GA) that converges to a near optimal solution quickly by a multi-directional search technique. We study the chromosome structure used in the GA and it consists of a path string and an encoding string. An encoding method, a decoding method, and some genetic operators that are needed when the MCPP is solved using the Proposed GA are studied. . In addition, two scaling methods are used in proposed GA. We compare the performance of the GA with an existing Modified MDXED2 algorithm (Pearn et al. , 1995) In the simulation results, the proposed method is better than the existing methods in case the network has many edges, the Power Law scaling method is better than the Logarithmic scaling method.