• The KIPS Transactions:PartD
• /
• v.18D no.1
• /
• pp.9-22
• /
• 2011

In this paper we present an efficient solution to rotation?invariant boundary image matching. Computing the rotation-invariant distance between image time-series is a time-consuming process since it requires a lot of Euclidean distance computations for all possible rotations. In this paper we propose a novel solution that significantly reduces the number of distance computations using the envelope-based lower bound. To this end, we first present how to construct a single envelope from a query sequence and how to obtain a lower bound of the rotation-invariant distance using the envelope. We then show that the single envelope-based lower bound can reduce a number of distance computations. This approach, however, may cause bad performance since it may incur a larger lower bound by considering all possible rotated sequences in a single envelope. To solve this problem, we present a concept of rotation interval, and using the rotation interval we generalize the envelope-based lower bound by exploiting multiple envelopes rather than a single envelope. We also propose equi-width and envelope minimization divisions as the method of determining rotation intervals in the multiple envelope approach. Experimental results show that our envelope-based solutions outperform existing solutions by one or two orders of magnitude.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.43 no.6
• /
• pp.507-515
• /
• 2015

This paper proposes a filtering method for effective state vector estimation of highly maneuvering target. It is needed to hit the point called 'sweet spot' to increase the kill probability in missile interception. In paper, a filtering method estimates the length of a moving target tracked by a frequency modulated continuous wave (FMCW) radar. High resolution range profiles (HRRPs) is generated from the radar echo signal and then it's integrated into proposed filtering method. To simulate the radar measurement which is close to real, the study on the properties of scattering point of the missile-like target has been conducted with ISAR image for different angle. Also, it is hard to track the target efficiently with existing Kalman filters which has fixed measurement noise covariance matrix R. Therefore the proposed method continuously updates the covariance matrix R with sensor measurements and tracks the target. Numerical simulations on the proposed method shows reliable results under reasonable assumptions on the missile interception scenario.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10A
• /
• pp.1131-1138
• /
• 2004

In Hierarchical Mobile Ipv6 (HMIPv6) networks, the mobility anchor point (MAP) handles binding update (BU) procedures locally to reduce signaling overhead for mobility. However, as the number of mobile nodes (MNs) handled by the MAP increases, the MAP suffers from the overhead not only to handle signaling traffic but also to Process data tunneling traffic. Therefore, it is important to control the number of MNs serviced by the MAP, in order to mitigate the burden of the MAP. We propose an adaptive load control scheme, which consists of two sub-algorithms: threshold-based admission control algorithm and session-to-mobility ratio (SMR) based replacement algorithm. When the number of MNs at a MAP reaches to the full capacity, the MAP replaces an existing MN at the MAP, whose SMR is high, with an MN that just requests binding update. The replaced MN is redirected to its home agent. We analyze the proposed load control scheme using the .Markov chain model in terms of the new MN and the ongoing MN blocking probabilities. Numerical results indicate that the above probabilities are lowered significantly compared to the threshold-based admission control alone.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.1
• /
• pp.113-120
• /
• 2020

The multi-view video is a collection of multiple videos capturing the same scene at different viewpoints. Thus, there is an advantage of providing for user oriented view pointed video. This paper is suggested that the compression performance of layered depth image structure expression has improved by using more improved method. We confirm the data size of layer depth image by encoding H.264 technology and the each performances of reconstructed images. The H.264/AVC technology has easily extended for H.264 technology of video contents. In this paper, we suggested that layered depth structure can be applied for an efficient new image contents. We show that the huge data size of multi-view video image is decreased, and the higher performance of image is provided, and there is an advantage of for stressing error restoring.

• Journal of Korea Multimedia Society
• /
• v.9 no.8
• /
• pp.1010-1019
• /
• 2006

CAD system is a very important technology in designing the products which we are using today. This CAD technology has been enlarging its area into 3D CAD systems with the development of computer graphics technologies. In particular, such advances have been realized in special area such as the CAD system for designing shoes. However, because it is difficult to design a 3D CAD system, most CAD developments except for major CAD software companies usually have employed the AutoCAD which realizes 3D concepts. Also, many shoes' designers have been skilled with 2D shoe CAD systems and then they can make high achievements. Therefore, we design a new shoe CAD system with advantages of 2D CAD system and 3D CAD system. We also implement the scheme to transfer the data between 2D CAD system and 3D CAD system and also grading technologies to get patterns of various shoes size from a basic shoe's design.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.564-567
• /
• 2003

XML has weakness problems on document modulation and elimination of data Because of the XML gives priority to present data format, XML electrical signature, XML cryptography, or XML access control is provided to overcome those weakness problems. However, structured XML efficiency contravention problem occurred from XML encryption and absence of protection from DTD attack are still remains unsolved. In this paper, we provide XML scheme that satisfies both efficiency and encryption. DTD is unnecessary because XML scheme supports formatting(Well-Formed XML) XML documents and it also include meta information. Because of the XML scheme has possibility to generate each XML document dynamically and self efficiency investigator rule, it has an advantage on extendability of DID based encryption of XML documents.

• The KIPS Transactions:PartB
• /
• v.17B no.2
• /
• pp.139-148
• /
• 2010

This paper shows a reinforcement post-processing method and feedback algorithm for improvement of assigning method in classification. Especially, we focused on complex documents that are generally considered to be hard to classify. A basis factors in traditional classification system are training methodology, classification models and features of documents. The classification problem of the documents containing shared features and multiple meanings, should be deeply mined or analyzed than general formatted data. To address the problems of these document, we proposed a method to expand classification scheme using decision boundary detected automatically in our previous studies. The assigning method that a document simply decides to the top ranked category, is a main factor that we focus on. In this paper, we propose a post-processing method and feedback algorithm to analyze the relevance of ranked list. In experiments, we applied our post-processing method and one time feedback algorithm to complex documents. The experimental results show that our system does not need to change the classification algorithm itself to improve the accuracy and flexibility.

• KIISE Transactions on Computing Practices
• /
• v.22 no.3
• /
• pp.151-156
• /
• 2016

Cloud computing systems require a huge number of storage servers due to the growing implications of power bills, carbon emissions, and logistics of data centers. These considerations have motivated researchers to improve the energy efficiency of storage servers. Most servers use a lot of power irrespective of the amount of computing that they are doing, and one important goal is to redesign servers to be power-proportional. However, Research on large-scale storage systems is hampered by their cost. It is therefore desirable to develop a scalable test-bed for evaluating the power consumption of large-scale storage systems. We are building on open-source projects to construct a test-bed which will contribute to the assessment of power consumption in tiered storage systems. Integrating the cloud application platform can easily extend the proposed testbed laying a foundation for the design and evaluation of low-power storage servers.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.8
• /
• pp.369-376
• /
• 2016

Among various vehicle extraction techniques, OBPCA (Object-Based Point Cloud Analysis) calculates features quickly by coarse-grained rectangles from top-view of the vehicle candidates. However, it uses only a top-view rectangle to detect a vehicle. Thus, it is hard to extract rectangular objects with similar size. For this reason, accuracy issue has raised on the OBPCA method which influences on DEM generation and traffic monitoring tasks. In this paper, we propose a novel method which uses the most distinguishing vertical elevations to calculate additional features. Our proposed method uses same features with top-view, determines new thresholds, and decides whether the candidate is vehicle or not. We compared the accuracy and execution time between original OBPCA and the proposed one. The experiment result shows that our method produces 6.61% increase of precision and 13.96% decrease of false positive rate despite with marginal increase of execution time. We can see that the proposed method can reduce misclassification.

• Journal of Convergence for Information Technology
• /
• v.10 no.10
• /
• pp.65-70
• /
• 2020

With the appearance of Bitcoin that builds peer-to-peer networks for transaction of digital content and issuance of cryptocurrency, lots of blockchain networks have been developed to improve transaction performance. Recently, Joseph Lubin discussed Decentralization Transaction per Second (DTPS) against alleviating the value of biased TPS. However, this Lubin's trust model did not enough consider a security issue in scalability trilemma. Accordingly, we proposed a trust metric based on blockchain size, stale block rate, and average block size, using a sigmoid function and convex optimization. Via numerical analysis, we presented the optimal blockchain size of popular blockchain networks and then compared the proposed trust metric with the Lubin's trust model. Besides, Bitcoin based blockchain networks such as Litecoin were superior to Ethereum for trust satisfaction and data volume.