• Journal of the military operations research society of Korea
• /
• v.30 no.1
• /
• pp.30-47
• /
• 2004

This research considers a Network Diversion Problem (NDP) in the directed graph, which is to identify a minimum cost set of links to cut so that any communication paths from a designated source node to a destination node must include at least one link from a specified set of arcs which is called the diversion arcs. We identify a redundant constraint from an earlier formulation. The problem is known to be NP-hard, however a detailed proof has not been given. We provide the proof of the NP-hardness of this problem. We develop a tabu search algorithm that includes a preprocessing procedure with two steps for removing diversion arcs as well as reducing the problem size. Computational results of the algorithm on instances of general graphs and grid graphs are reported.

• Advances in robotics research
• /
• v.1 no.2
• /
• pp.127-140
• /
• 2014

This work presents an IR-based system for parking assistance and obstacle detection in the automotive field that employs the Microsoft Kinect camera for fast 3D point cloud reconstruction. In contrast to previous research that attempts to explicitly identify obstacles, the proposed system aims to detect "reachable regions" of the environment, i.e., those regions where the vehicle can drive to from its current position. A user-friendly 2D traversability grid of cells is generated and used as a visual aid for parking assistance. Given a raw 3D point cloud, first each point is mapped into individual cells, then, the elevation information is used within a graph-based algorithm to label a given cell as traversable or non-traversable. Following this rationale, positive and negative obstacles, as well as unknown regions can be implicitly detected. Additionally, no flat-world assumption is required. Experimental results, obtained from the system in typical parking scenarios, are presented showing its effectiveness for scene interpretation and detection of several types of obstacle.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.114-117
• /
• 2009

A new video inpainting algorithm is proposed for removing unwanted objects or error of sources from video data. In the first step, the block bundle is defined by the motion information of the video data to keep the temporal consistency. Next, the block bundles are arranged in the 3-dimensional graph that is constructed by the spatial and temporal correlation. Finally, we pose the inpainting problem in the form of a discrete global optimization and minimize the objective function to find the best temporal bundles for the grid points. Extensive simulation results demonstrate that the proposed algorithm yields visually pleasing video inpainting results even in a dynamic scene.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.1
• /
• pp.160-163
• /
• 2021

In this paper, we present a path search scheme for the safe movement of the swarm of unmanned systems in unknown dangerous areas. Some of the swarm searches for the primary and secondary paths before the majority of swarm move through dangerous areas. In terms of rapid movement from the dangerous area and preparation for an accident, the primary path is searched first in the destination's direction. The secondary path is searched by considering the distance between the paths to guarantee a safe distance. The computer simulations show that the proposed scheme is suitable for the swarm of unmanned systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.4
• /
• pp.370-379
• /
• 2014

Recently, the interest in optical network with multifiber link is continuing to rise since the network traffic has been growing exponentially. However, growing traffic in network leads to increasing the energy consumption of the network equipment. In this paper, we propose a dynamic routing and wavelength assignment (RWA) algorithm based on V-like cost function and layered graph to improve energy efficiency in IP over WDM network with multifiber link. The V-like cost function is used to decide the fiber cost according to the number of used wavelengths. The layered graph with multifiber link is used to select the energy efficient route and wavelength. The proposed RWA algorithm is compared and analyzed with conventional algorithm in view of average power consumption and blocking probability through OPNET modeler.

• Journal of the Korea Computer Graphics Society
• /
• v.16 no.4
• /
• pp.35-40
• /
• 2010

Due to the distribution of digital camera, many work for photo management has been studied. However, most work use a sequential grid layout which arranges photos considering one criterion of digital photo. This interface makes users have lots of scrolling and concentrate ability when they manage their photos. In this paper, we propose a clustering method based on a temporal sequence considering their color similarity in detail. First we cluster photos using Cooper's event clustering method. Second, we makes more detailed clusters from each clustered photo set, which are clustered temporal clustering before, using maximal clique finding algorithm of interval graph. Finally, we arrange each detailed dusters on a user screen with their overlap keeping their temporal sequence. In order to evaluate our proposed system, we conducted on user studies based on a simple questionnaire.

• Spatial Information Research
• /
• v.21 no.5
• /
• pp.63-72
• /
• 2013

This paper analyzed the flood propagation characteristics of each flood elevation due to failure of embankment in Muju Namdae Stream using recursive call algorithm. A flood propagation order by the flood elevation was estimated by setting destruction point at Beonggu and Chasan small dam through recursive call algorithm and then, the number of grids of each flood propagation order and accumulated inundation area were calculated. Based on the flood propagation order and the grid size of DEM, flood propagation time could be predicted each flood elevation. As a result, the study could identify the process of flood propagation through distribution characteristic of the flood propagation order obtained from recursive call algorithm, and could provide basic data for protection from flood disaster by selecting the flood vulnerable area through the gradient pattern of the graph for accumulated inundation area each flood propagation order. In addition, the prediction of the flood propagation time for each flood water level using this algorithm helped provide valuable information to calculate the evacuation path and time during the flood season by predicting the flood propagation time of each flood water level.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.4
• /
• pp.99-106
• /
• 2024

The problem of the bridges(Hasjiwokakero, Hasi) puzzle, which connects the bridge(edge) required by the island(vertex) without crossing the horizontal and vertical straight bridges except for the diagonal to form a connected network, is a barren ground for research without any related research. For this problem, there is no algorithm that presents a generalized exponential time brute-force or branch-and-bound method. This paper obtained the initial solution of the lattice graph by drawing a grid without diagonal lines for a given BP, removing unnecessary edges, and supplementing essential bridges. Next, through insufficient island pair path matching, the method of adding insufficient edges to the route and deleting the crossed surplus edges(bridges) was adopted. Applying the proposed algorithm to 24 benchmarking experimental data showed that accurate solutions can be obtained for all problems.

• Geophysics and Geophysical Exploration
• /
• v.12 no.1
• /
• pp.105-113
• /
• 2009

The interpretation of observed waveform characteristics identified in refraction and wide-angle reflection data increases confidence in the crustal structure model obtained. When calculating traveltimes and raypaths, wavefront methods on a regular grid based on graph theory are robust even with complicated structures, but basically compute only first arrivals. In this paper, we develop new algorithms to compute traveltimes and raypaths not only for first arrivals, but also for fast and later reflection arrivals, later refraction arrivals, and converted waves between P and S, using the modified wavefront method based on slowness network nodes mapped on a multi-layer model. Using the new algorithm, we can interpret reflected arrivals, Pg-later arrivals, strong arrivals appearing behind Pn, triplicated Moho reflected arrivals (PmP) to obtain the shape of the Moho, and phases involving conversion between P and S. Using two models of an ocean-continent transition zone and an oceanic ridge or seamount, we show the usefulness of this algorithm, which is confirmed by synthetic seismograms using the 2D Finite Difference Method (2D-FDM). Characteristics of arrivals and raypaths of the two models differ from each other in that using only first-arrival traveltime data for crustal structure analysis involves risk of erroneous interpretation in the ocean-continent transition zone, or the region around a ridge or seamount.

• ETRI Journal
• /
• v.45 no.4
• /
• pp.650-665
• /
• 2023

A novel smart metering technique capable of anomaly detection was proposed for real-time home power management system. Smart meter data generated in real-time were obtained from 900 households of single apartments. To detect outliers and missing values in smart meter data, a deep learning model, the autoencoder, consisting of a graph convolutional network and bidirectional long short-term memory network, was applied to the smart metering technique. Power management based on the smart metering technique was executed by multi-objective optimization in the presence of a battery storage system and an electric vehicle. The results of the power management employing the proposed smart metering technique indicate a reduction in electricity cost and amount of power supplied by the grid compared to the results of power management without anomaly detection.