• 한국정보디스플레이학회:학술대회논문집
• /
• 2007.08a
• /
• pp.993-996
• /
• 2007

Depending on applications where transmission bandwidth, wire distance, power consumption and EMI environments vary, design trade-offs must be made to optimize the display interface. After introducing the digital display interface architecture, topics such as cost, EMI, signal integrity, scalability and content protection are discussed with available techniques. Implementation issues are discussed regarding their cost and design complexity. Existing standards are reviewed and comparison on their strengths and shortcomings are discussed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.7
• /
• pp.1642-1653
• /
• 1996

This paper covers feature extraction for automatic handwritten signature verification. Several major feature selection techniques are investigated from a practical perspective to realise an optimal signature verification system, and customised feature set selection based on set-on-set distance measurement is presented. The experimental results have proved the proposed methods to be efficient, offering considerably improved verification performance compared to conventional methods. Also, they dramatically reduce the processing complexity in the verification system.

• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.265-272
• /
• 2005

In this paper, we propose a technique which is speedily searching for correspondent points of two images using Voronoi-Distance, as an image registration method for feature based image mosaics. It extracts feature points in two images by the SUSAN corner detector, and then create not only the Voronoi Surface which has distance information among the feature points in the base image using a priority based Voronoi distance algorithm but also select the model area which has the maximum variance value of coordinates of the feature points in the model image. We propose a method for searching for the correspondent points in the Voronoi surface of the base image overlapped with the model area by use of the partitive search algorithm using queues. The feature of the method is that we can rapidly search for the correspondent points between adjacent images using the new Voronoi distance algorithm which has $O(width{\times}height{\times}logN)$ time complexity and the the partitive search algerian using queues which reduces the search range by a fourth at a time.

• Journal of Computing Science and Engineering
• /
• v.3 no.4
• /
• pp.195-215
• /
• 2009

Worst-case execution time (WCET) analysis is critical for hard real-time systems to ensure that different tasks can meet their respective deadlines. While significant progress has been made for WCET analysis of instruction caches, the data cache timing analysis, especially for set-associative data caches, is rather limited. This paper proposes an approach to safely and tightly bounding data cache performance by computing the worst-case stack distance of data cache accesses. Our approach can not only be applied to direct-mapped caches, but also be used for set-associative or even fully-associative caches without increasing the complexity of analysis. Moreover, the proposed approach can statically categorize worst-case data cache misses into cold, conflict, and capacity misses, which can provide useful insights for designers to enhance the worst-case data cache performance. Our evaluation shows that the proposed data cache timing analysis technique can safely and accurately estimate the worst-case data cache performance, and the overestimation as compared to the observed worst-case data cache misses is within 1% on average.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.215-236
• /
• 2017

Obtaining accurate location information is important in practical applications of wireless sensor networks (WSNs). The distance vector hop (DV-Hop) is a frequently-used range-free localization algorithm in WSNs, but it has low localization accuracy. Moreover, despite various improvements to DV-Hop-based localization algorithms, maintaining a balance between high localization accuracy and good stability and convergence is still a challenge. To overcome these shortcomings, we proposed an improved DV-Hop localization algorithm based on the bat algorithm (IBDV-Hop) for WSNs. The IBDV-Hop algorithm incorporates optimization methods that enhance the accuracy of the average hop distance and fitness function. We also introduce a nonlinear dynamic inertial weight strategy to extend the global search scope and increase the local search accuracy. Moreover, we develop an updated solutions strategy that avoids premature convergence by the IBDV-Hop algorithm. Both theoretical analysis and simulation results show that the IBDV-Hop algorithm achieves higher localization accuracy than the original DV-Hop algorithm and other improved algorithms. The IBDV-Hop algorithm also exhibits good stability, search capability and convergence, and it requires little additional time complexity and energy consumption.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.4
• /
• pp.221-226
• /
• 2004

Power system has recently used Double-circuit Line and Multi-circuit Line in the industrial development. This has an advantage of system stability and reliability, but the complexity of the system has a disadvantage that makes it difficult to protect the power line. Double-circuit Line has two operation conditions in the Single-circuit operation and Double-circuit operation, so it has mutual impedance. To make it possible for the remaining single-line to operate independently while there is a fault with first line or when maintenance is needed, a trip region for the single-circuit operation should be set in order to set the relay trip region. An optimal trip region for each operation, a different operational conditions for the relay setting should be calculated. In this paper, trip regions of each operation condition have been compared by considering mutual impedance and fault resistance that led to the calculation of fault impedance. Also, as we know that one of the advantages in the distance relay is the back-up protection, we calculated the trip region(Zone-2) in consideration of the mutual impedance.

• ETRI Journal
• /
• v.26 no.2
• /
• pp.101-111
• /
• 2004

This paper presents a near-optimum blind decision feedback equalizer (DFE) for the receivers of Advanced Television Systems Committee (ATSC) digital television. By adopting a modified trellis decoder (MTD) with a trace- back depth of 1 for the decision device in the DFE, we obtain a hardware-efficient, blind DFE approaching the performance of an optimum DFE which has no error propagation. In the MTD, the absolute distance is used rather than the squared Euclidean distance for the computation of the branch metrics. This results in a reduction of the computational complexity over the original trellis decoding scheme. Compared to the conventional slicer, the MTD shows an outstanding performance improvement in decision error probability and is comparable to the original trellis decoder using the Euclidean distance. Reducing error propagation by use of the MTD in the DFE leads to the improvement of convergence performance in terms of convergence speed and residual error. Simulation results show that the proposed blind DFE performs much better than the blind DFE with the slicer, and the difference is prominent at the trellis decoder following the blind DFE.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7A
• /
• pp.1017-1027
• /
• 2000

In this paper, we propose a new coding method based on the distance between vertex segments for vertex positions in the vertex-based shape coding. The pixel lines are divided into the segments of a fixed length, and the segments that have vertex pixels are called vertex segments. We analyze the probability distribution of the relative distance between vertex segments and prove that it depends only on the ratio between the number of vertices and the number of segments. Considering the coding efficiency and implementation complexity, we choose a particular ratio to make a code table. For each input image, the segment size is chosen according tothe ratio, and the relative segment distances are entropy coded. It is shown that the proposed method is efficient for the images with many vertices.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.53 no.4
• /
• pp.221-221
• /
• 2004

Power system has recently used Double-circuit Line and Multi-circuit Line in the industrial development. This has an advantage of system stability and reliability, but the complexity of the system has a disadvantage that makes it difficult to protect the power line. Double-circuit Line has two operation conditions in the Single-circuit operation and Double-circuit operation, so it has mutual impedance. To make it possible for the remaining single-line to operate independently while there is a fault with first line or when maintenance is needed, a trip region for the single-circuit operation should be set in order to set the relay trip region. An optimal trip region for each operation, a different operational conditions for the relay setting should be calculated. In this paper, trip regions of each operation condition have been compared by considering mutual impedance and fault resistance that led to the calculation of fault impedance. Also, as we know that one of the advantages in the distance relay is the back-up protection, we calculated the trip region(Zone-2) in consideration of the mutual impedance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.12
• /
• pp.8649-8653
• /
• 2015

A number of video indexing and retrieval algorithms have been proposed to manage large video databases efficiently. The video similarity measure is one of most important technical factor for video content management system. In this paper, we propose the luminance characteristics model to measure the video similarity efficiently. Most algorithms for video indexing have been commonly used histograms, edges, or motion features, whereas in this paper, the proposed algorithm is employed an efficient similarity measure using the luminance projection. To index the video sequences effectively and to reduce the computational complexity, we calculate video similarity using the key frames extracted by the cumulative measure, and compare the set of key frames using the modified Hausdorff distance. Experimental results show that the proposed luminance projection model yields the remarkable improved accuracy and performance than the conventional algorithm such as the histogram comparison method, with the low computational complexity.