• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4C
• /
• pp.217-225
• /
• 2011

In this paper, we propose an adaptive de-interlacing algorithm that is based on the degree of local complexity. The conventional intra field de-interlacing algorithms show the different performance according to the ways which find the edge direction. Furthermore, FDD (Fine Directional De-interlacing) algorithm has the better performance than other algorithms but the computational complexity of FDD algorithm is too high. In order to alleviate these problems, the proposed algorithm selects the most efficient de-interacing algorithm among LA (Line Average), MELA (Modified Edge-based Line Average), and LCID (Low-Complexity Interpolation Method for De-interlacing) algorithms which have low complexity and good performance. The proposed algorithm is trained by the DoLC (Degree of Local Complexity) for selection of the algorithms mentioned above. Simulation results show that the proposed algorithm not only has the low complexity but also performs better objective and subjective image quality performances compared with the conventional intra-field methods.

• Journal of the Korea Society for Simulation
• /
• v.14 no.3
• /
• pp.147-154
• /
• 2005

In conventional approaches such as a functinal approach or a parametric approach to online signature verification, which could not deal with the local shape of signature, much various important informations inherent in the local part of signature shape have been overlooked. In this paper, we try a structural approach in which a signature is represented as a structural form of handwriting primitives and the local parts along a signature handwriting can be selectively compared according to their discrimination power in the process of signature verification, As a result, the error rate is diminished in the case that the weights of subpattern units is applied into comparing process, which is the degree of discrimination power of local part. And also, the global variation and complexity of each signature extracted from the analysis of local shape is found useful in determining the decision threshold more precisely.

• Journal of Broadcast Engineering
• /
• v.22 no.3
• /
• pp.375-380
• /
• 2017

This paper has proposed a single image based fog degree quantification method by measuring both transmission and local contrast. The proposed method estimates the foggy expected regions from transmission, and then assesses the size of regions of which transmission values are foggy expected ones and the range of local contrast value on such regions. Compared with fog degree gauged by the scattering coefficient measurement sensor, the proposed method quantifies the fog degree with more than 95% accuracy for images containing various objects and environments. We also developed a technique that measures the local contrast values in process of measuring transmission values. So, the proposed method does not increase complexity compared to the existing transmission method.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.7
• /
• pp.41-47
• /
• 2015

The bandwidth minimization problem (BMP) has been classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. This paper suggests polynomial time heuristic algorithm is to find the solution of bandwidth minimization problem. To find the minimum bandwidth ${\phi}^*=_{min}{\phi}(G)$, ${\phi}(G)=_{max}\{{\mid}f(v_i)-f(v_j):v_i,v_j{\in}E\}$ for given graph G=(V,E), m=|V|,n=|E|, the proposed algorithm sets the maximum degree vertex $v_i$ in graph G into global central point (GCP), and labels the median value ${\lceil}m+1/2{\rceil}$ between [1,m] range. The graph G is partitioned into subgroup, the maximum degree vertex in each subgroup is set to local central point (LCP), and we adjust the label of LCP per each subgroup as possible as minimum distance from GCP. The proposed algorithm requires O(mn) time complexity for label to all of vertices. For various twelve graph, the proposed algorithm can be obtains the same result as known optimal solution. For one graph, the proposed algorithm can be improve on known solution.

• Smart Media Journal
• /
• v.11 no.9
• /
• pp.39-46
• /
• 2022

The WK-recursive network proposed by Vecchia and Sanges[1] is widely used in the design and implementation of local area networks and parallel processing architectures. It provides a high degree of regularity and scalability, which conform well to a design and realization of distributed systems involving a large number of computing elements. In this paper, the routing of a message is investigated on the WK-recursive network, which is key to the performance of this network. We present an efficient shortest path algorithm on the WK-recursive network, which is simpler than Chen and Duh[2] in terms of design complexity.

• The KIPS Transactions:PartB
• /
• v.15B no.6
• /
• pp.501-506
• /
• 2008

The classical snake algorithm has a problem in detecting the boundary of an object with deep concavities. While the GVF method can successfully detect boundary concavities, it consumes a lot of time computing the energy map. In this paper, we propose an algorithm to reduce the computation time and improve performance in detecting the boundary of an object with high concavity. We define the degree of complexity of object boundary as the local curvature. If the value of the local curvature is greater than a threshold value, new snake points are added. Simulation results on several different test images show that our method performs well in detecting object boundary and requires less computation time.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.12
• /
• pp.1337-1344
• /
• 2014

The objective of an echo canceller connected to any end of a communication line such as digital subscriber line (DSL) is to compensate the outgoing transmit signal in the receiving path that the hybrid circuit leaks. The echo canceller working in a full duplex environment is an adaptive system driven by the local signal. Conventional echo canceller that implement the least mean square (LMS) algorithm provides a low computational burden but poor convergence properties. The length of the echo canceller will directly affect both the degree of performance and the convergence speed of the adaptation process. To cancel long time-varying echoes, the number of tap coefficients of a conventional echo canceller must be large, which decreases the convergence speed of the adaptive filter. This paper proposes an alternative technique for the echo cancellation in a telecommunication channel. The new technique employs the bi-directional least mean square (LMS) algorithm for adaptively computing the optimal set of the coefficients of the echo canceller, which is composed of weighted combination of both feedforward and feedback algorithms. Finally, Simulation results as well as mathematical analysis demonstrates that the proposed echo canceller has faster convergence speed than the conventional LMS echo canceller with nearly equivalent complexity of computation.

• Nuclear Engineering and Technology
• /
• v.53 no.6
• /
• pp.1979-1990
• /
• 2021

Evacuation Time Estimate (ETE) can provide decision-makers with a likelihood to implement evacuation of a population with radiation exposure risk by a nuclear power plant. Thus, the ETE is essential for developing an emergency response preparedness. However, studies on ETE have not been conducted adequately in Korea to date. In this study, different cohorts were selected based on assumptions. Existing local data were collected to construct a multi-model network by TSIS-CORSIM code. Furthermore, several links were aggregated to make simple calculations, and post-processing was conducted for dealing with the stochastic property of TSIS-CORSIM. The average speed of each cohort was calculated by the link aggregation and post-processing, and the evacuation time was estimated. As a result, the average cohort-based evacuation time was estimated as 2.4-6.8 h, and the average clearance time from ten simulations in 26 km was calculated as 27.3 h. Through this study, uncertainty factors to ETE results, such as classifying cohorts, degree of model complexity, traffic volume outside of the network, were identified. Various studies related to these factors will be needed to improve ETE's methodology and obtain the reliability of ETE results.

• Korean Journal of Ecology and Environment
• /
• v.46 no.3
• /
• pp.319-331
• /
• 2013

Recent climate change, which is mostly ascribed to anthropogenic activities, is believed to be a major factor leading to biodiversity decreases and ecosystem service deteriorations. I have reviewed recent studies on climate change effects for many ecological processes involved with plants, in order to improve our understanding of the nature of ecological complexity. Plants in general have better growth and productivity under high levels of $CO_2$, although the long term effects of such $CO_2$ fertilizers are still controversial. Over the last 30 years, the Earth has been greening, particularly at higher latitudes of the Northern Hemisphere, perhaps due to a relaxation of climatic constraints. Human appropriation of net primary productivity (NPP), which corresponds up to 1/3 of global NPP, is ultimately responsible for climate change and biodiversity decreases. Climate change causes phenological variations in plants, especially in regards to spring flowering and fall leaf coloring. Many plants migrate polewards and towards higher altitudes to seek more appropriate climates. On the other hand, tree mortality and population declines have recently been reported in many continents. Landscape disturbance not only hinders the plant migration, but also makes it difficult to predict the plants' potential habitats. Plant and animal population declines, as well as local extinctions, are largely due to the disruption of species interactions through temporal mismatching. Temperature and $CO_2$ increase rates in Korea are higher than global means. The degree of landscape disturbances is also relatively high. Furthermore, long-term data on individual species responses and species interactions are lacking or quite limited in Korea. This review emphasizes the complex nature of species responses to climate change at both global and local scales. In order to keep pace with the direction and speed of climate change, it is urgently necessary to observe and analyze the patterns of phenology, migration, and trophic interactions of plants and animals in Korea's landscape.

• Korean Security Journal
• /
• no.26
• /
• pp.121-144
• /
• 2011

The Framework Act on the Management of Disasters and Safety 2004(FAMDS) currently underpins Korean civil protection system, and under this FAMDS, Korean civil protection establishes a three-tiered government structure for dealing with crises and disasters: central government, provincial & metropolitan government, and local government tiers. In particular, the concept of Integrated Emergency Management(IEM) emphasizes that emergency response organizations should work and act together to respond to crises and disasters effectively, based on the coordination and cooperation model, not the command and control model. In tune with this trend, civil protection matters are, first, dealt with by local responders at the local level without direct involvement of central or federal government in the UK or USA. In other words, central government intervention is usually implemented in the UK and the USA, only when the scale or complexity of a civil protection issue is so vast, and thus requires a degree of central government coordination and support, resting on the severity and impact of the event. In contrast, it appears that civil protection mechanism in Korea has adopted a rigid centralized system within the command and control model, and for this reason, central government can easily interfere with regional or local command and control arrangements; there is a high level of central government decision-making remote from a local area. The principle of subsidiarity tends to be ignored. Under these circumstances, it is questionable whether such top-down arrangements of civil protection in Korea can manage uncertainty, unfamiliarity and unexpectedness in the age of Risk Society and Post-modern society, where interactive complexity is increasingly growing. In this context, the study argues that Korean civil protection system should move towards the decentralized model, based on coordination and cooperation between responding organizations, loosening the command and control structure, as with the UK or the USA emergency management arrangements. For this argument, the study basically explores mechanisms of civil protection arrangements in Korea under current legislation, and then finally attempts to make theoretical suggestions for the future of the Korean civil protection system.