• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.1
• /
• pp.38-46
• /
• 2004

Image segmentation is the task which partitions the image into meaningful regions and considered to be one of the most important steps in computer vision and image processing. Image segmentation is also widely used in object-based video compression such as MPEG-4 to extract out the object regions from the given frame. Watershed algorithm is frequently used to obtain the more accurate region boundaries. But, it is well known that the watershed algorithm is extremely sensitive to gradient noise and usually results in oversegmentation. To solve such a problem, we propose an image segmentation method which is robust to noise by using stabilized inverse diffusion equation (SIDE) and is more efficient in segmentation by employing multiresolution approach. In this paper, we apply both the region projection method using labels of adjacent regions and the region merging method based on region adjacency graph (RAG). Experimental results on noisy image show that the oversegmenation is reduced and segmentation efficiency is increased.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.6
• /
• pp.94-104
• /
• 1984

Based on a new concept of connection index of a weighted graph, a new efficient houris tic algorithm of 0(v.e) for network partitioning is presented, where v and e are the number of nodes and edges, respectively. Experimental results show that our algorithm is very efficient and yields an optimal or near optimal solution for a number of partitioning problems tested. Some applications of the proposed algorithm are suggested and its computer implementation is described in detail.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.1
• /
• pp.37-42
• /
• 2024

This paper suggests polynomial time algorithm for cutwidth minimization problem that classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. To find the minimum cutwidth CW_f(G)=max_𝜈∈_VCW_f(𝜈)for given graph G=(V,E),m=｜V｜, n=｜E｜, the proposed algorithm divides neighborhood N_G[𝜈_i] of the maximum degree vertex 𝜈_i in graph G into left and right and decides the vertical cut plane with minimum number of edges pass through the vertex 𝜈_i firstly. Then, we split the left and right N_G[𝜈_i] into horizontal sections with minimum pass through edges. Secondly, the inner-section vertices are connected into line graph and the inter-section lines are connected by one line layout. Finally, we perform the optimization process in order to obtain the minimum cutwidth using vertex moving method. Though the proposed algorithm requires O(n²) time complexity, that can be obtains the optimal solutions for all of various experimental data

• The Journal of the Korea institute of electronic communication sciences
• /
• v.12 no.3
• /
• pp.451-456
• /
• 2017

Semantic segmentation, which is the most basic and complicated problem in computer vision, classifies each pixel of an image into a specific object and performs a task of specifying a label. MRF and CRF, which have been studied in the past, have been studied as effective methods for improving the accuracy of pixel level labeling. In this paper, we propose a semantic partitioning method that combines CNN, a kind of deep running, which is in the spotlight recently, and CRF, a probabilistic model. For learning and performance verification, Pascal VOC 2012 image database was used and the test was performed using arbitrary images not used for learning. As a result of the study, we showed better partitioning performance than existing semantic partitioning algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.6
• /
• pp.179-186
• /
• 2011

This paper suggests the minimum number of vertex guards algorithm. Given n rooms, the exact number of minimum vertex guards is proposed. However, only approximation algorithms are presented about the maximum number of vertex guards for polygon and orthogonal polygon without or with holes. Fisk suggests the maximum number of vertex guards for polygon with n vertices as follows. Firstly, you can triangulate with n-2 triangles. Secondly, 3-chromatic vertex coloring of every triangulation of a polygon. Thirdly, place guards at the vertices which have the minority color. This paper presents the minimum number of vertex guards using dominating set. Firstly, you can obtain the visibility graph which is connected all edges if two vertices can be visible each other. Secondly, you can obtain dominating set from visibility graph or visibility matrix. This algorithm applies various art galley problems. As a results, the proposed algorithm is simple and can be obtain the minimum number of vertex guards.

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.69-88
• /
• 2000

One of the most important factors on the performance of the distributed systems is the effective distribution of the software components, There have been a lot of researches on partitioning and allocating the task-based system, while the studies on the allocating the objects of the object-oriented system into the distributed object environments are very little relatively. In this paper. we defines the graph model for partitioning the existing C++ application and allocating the C++ objects into CORBA-base distributed system, In addition, we propose a distributed object allocation algorithm based on this graph model. The performance of distributed systems is determined by the concurrency between objects, the load balance among the processors and the communication cost on the networks. To search for the solutions optimizing the above three factors simultaneously, the object allocation algorithm of this paper is based on the Niched Pareto Genetic Algorithm (NPGA). We performed the experiment on the typical C++ application and CORBA system to prove the effectiveness of our graph model and our object allocation algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.1
• /
• pp.142-151
• /
• 2015

This paper proposes a method for detection of objects temporally stop moving in video sequences taken by a moving camera. Even though the consequence of missed detection of those objects could be catastrophic in terms of application level requirements, not much attention has been paid in conventional approaches. In the proposed method, we introduce cues for consistent detection and tracking of objects: motion potential, position potential, and color distribution similarity. Integration of the three cues in the graph-cut algorithm makes possible to detect objects that temporally stop moving and are newly appearing. Experiment results prove that the proposed method can not only detect moving objects but also track objects stop moving.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.21 no.3
• /
• pp.281-285
• /
• 2008

Eigenvalue reduction schemes approximate the lower eigenmodes that represent the global behavior of the structures. In the previous study, we proposed a two-level condensation scheme (TLCS) for the construction of a reduced system. And we have improved previous TLCS with combination of the iterated improved reduced system method (IIRS) to increase accuracy of the higher modes intermediate range. In this study, we apply previous improved TLCS to multi-level sub-structuring scheme. In the first step, the global system is recursively partitioned into a hierarchy of sub-domain. In second step, each uncoupled sub-domain is condensed by the improved TLCS. After assembly process of each reduced sub-eigenvalue problem, eigen-solution is calculated by Lanczos method (ARPACK). Finally, Numerical examples demonstrate performance of proposed method.

• Journal of KIISE
• /
• v.43 no.9
• /
• pp.1026-1033
• /
• 2016

Path-finding on a grid map is a problem generally addressed in the fields of robotics, intelligent agents, and computer games. As technology advances, virtual game worlds tend to be represented more accurately and more realistically, resulting in an excessive increase in the number of grid tiles and in path-search time. In this study, we propose a path-finding algorithm that allows a prompt response to real-time queries by constructing a reduced state space and by precomputing all possible paths in an offline preprocessing stage. In the preprocessing stage, we vertically decompose free space on the grid map, construct a connectivity graph where nodes are the decomposed regions, and store paths between all pairs of nodes in matrix form. In the real-time query stage, we first find the nodes containing the query points and then retrieve the corresponding stored path. The proposed method is simulated for a set of maps that has been used as a benchmark for grid-based path finding. The simulation results show that the state space and the search time decrease significantly.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06c
• /
• pp.319-323
• /
• 2007

실세계의 여러 문제들은 마르코프 결정 문제(Markov decision problem, MDP)로 표현될 수 있고, 이 MDP는 모델이 알려진 경우에는 평가치 반복(value iteration) 이나 모델이 알려지지 않은 경우에도 강화 학습(reinforcement learning) 알고리즘 등을 사용하여 풀 수 있다. 하지만 이들 알고리즘들은 시간 복잡도가 높아 크기가 큰 실세계 문제에 적용하기 쉽지 않아, MDP를 계층적으로 분할하거나, 여러 단계를 묶어서 수행하는 등의 시간적 추상화(temporal abstraction) 방법이 제안되어 왔다. 이러한 시간적 추상화 방법들의 문제점으로는 시간적 추상화의 디자인에 따라 MDP의 풀이 성능이 크게 달라질 수 있으며, 많은 경우 사용자가 이 디자인을 직접 제공해야 한다는 것들이 있다. 최근 사용자의 간섭이 필요 없이 자동적으로 시간적 추상화를 만드는 방법들이 제안된 바 있으나, 이들 방법들 역시 결과물에 대한 이론적인 성능 보장(performance guarantee)은 제공하지 못하고 있다. 본 연구에서는 이러한 문제점을 해결하기 위해 MDP의 구조와 그 풀이 성능을 연관짓는 복잡도 척도에 대해 살펴본다. 이를 위해 MDP로부터 얻은 상태 경로 그래프(state trajectory graph)의 위상적 성질들을 여러 네트워크 척도(network measurements) 들을 이용하여 측정하고, 이와 MDP의 풀이 성능과의 관계를 다양한 상황에 대해 실험적, 이론적으로 분석해 보았다.