• International Journal of Contents
• /
• v.6 no.3
• /
• pp.5-9
• /
• 2010

To manage large database system with video, effective video indexing and retrieval are required. A large number of video retrieval algorithms have been presented for frame-wise user query or video content query, whereas a few video identification algorithms have been proposed for video sequence query. In this paper, we propose an effective video identification algorithm for video sequence query that employs the Cauchy function of histograms between successive frames and the modified Hausdorff distance. To effectively match the video sequences with a low computational load, we make use of the key frames extracted by the cumulative Cauchy function and compare the set of key frames using the modified Hausdorff distance. Experimental results with several color video sequences show that the proposed algorithm for video identification yields remarkably higher performance than conventional algorithms such as Euclidean metric, and directed divergence methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.753-775
• /
• 2010

Greedy forwarding is a key mechanism of geographic routing using distance as a metric. As greedy forwarding only uses 1-hop neighbor node information, it minimizes routing overhead and is highly scalable. In existing greedy forwarding schemes, a node selects a next forwarding node based only on the distance. However, the signal strength in a realistic environment reduces exponentially depending on the distance, so that by considering only the distance, it may cause a large number of data packet retransmissions. To solve this problem, many greedy forwarding schemes have been proposed. However, they do not consider the unreliable and asymmetric characteristics of wireless links and thus cause the waste of limited battery resources due to the data packet retransmissions. In this paper, we propose a reliable and energy-efficient opportunistic greedy forwarding scheme for unreliable and asymmetric links (GF-UAL). In order to further improve the energy efficiency, GF-UAL opportunistically uses the path that is expected to have the minimum energy consumption among the 1-hop and 2-hop forwarding paths within the radio range. Comprehensive simulation results show that the packet delivery rate and energy efficiency increase up to about 17% and 18%, respectively, compared with the ones in PRR${\times}$Distance greedy forwarding.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.7
• /
• pp.809-813
• /
• 2010

Many studies on reverse skyline query processing have been done for company oriented services. The existing methods about reverse skyline are reverse skyline based on dynamic skyline. There is no reverse skyline query processing algorithm based on metric spaces for location-based services. In this paper we propose a reverse skyline query processing scheme that applies for a general skyline and considers distance spaces. The proposed method processes reverse skyline queries in the metric spaces using the existing spatial indexing scheme and considers both Monochromatic and Bichromatic environments. In order to show the superiority of the proposed scheme, we compare it with the basic skyline query processing scheme through performance evaluation. As a result, the proposed method excellent performance was about 5000 times more than conventional method.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.648-653
• /
• 2010

The non-metric multidimensional scaling (nMDS) is a method for analyzing the relation among objects by mapping them onto the Euclidean space. The nMDS is useful when it is difficult to use the concept of distance between pairs of objects due to non-metric dissimilarities between objects. The nMDS can be regarded as an optimization problem in which there are many local optima. Since the conventional nMDS algorithm utilizes the steepest descent method, it has a drawback in that the method can hardly find a better solution once it falls into a local optimum. To remedy this problem, in this paper, we applied the simulated annealing to the nMDS and proposed a new optimization algorithm which could search for a global optimum more effectively. We examined the algorithm using benchmarking problems and found that improvement rate of the proposed algorithm against the conventional algorithm ranged from 0.7% to 3.2%. In addition, the statistical hypothesis test also showed that the proposed algorithm outperformed the conventional one.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.10
• /
• pp.1147-1156
• /
• 1992

In this paper, in order to apply the $\pi/4$ shift QPSK to TCM, we propose the $\pi/8$ shift 8PSK modulation technique and the trellis-coded $\pi/8$ shift 8PSK performing signal set expansion and partition by phase difference. In addition, the Viterbi decoder with branch metrics of the squared Euclidean distance of the first phase difference as well as the Lth phase different is introduced in order to improve the bit error rate(BER) performance in differential detection of the trellis-coded $\pi/8$ shift 8PSK. The proposed Viterbi decoder is conceptually the same as the sliding multiple detection by using the branch metric with first and Lth order phase difference. We investigate the performance of the uncoded $\pi/4$ shift QPSK and the trellis-coded $\pi/8$ shift 8PSK with or without the Lth phase difference metric in an additive white Gaussian noise (AWGN) using the Monte Carlo simulation. The study shows that the $\pi/4$ shift QPSK with the Trellis-code i.e. the trellis-coded $\pi/8$ shift 8PSK is an attractive scheme for power and bandlimited systems and especially, the Viterbi decoder with first and Lth phase difference metrics improves BER performance. Also, the nest proposed algorithm can be used in the TC $\pi/8$ shift 8PSK as well as TCMDPSK.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.12
• /
• pp.653-662
• /
• 2016

This paper describes a test case generation algorithm for Simulink/Stateflow models based on the Rapidly exploring Random Tree (RRT) algorithm that has been successfully applied to path finding. An important factor influencing the performance of the RRT algorithm is the metric used for calculating the distance between the nodes in the RRT space. Since a test case for a Simulink/Stateflow (SL/SF) model is an input sequence to check a specific condition (called a test target in this paper) at a specific status of the model, it is necessary to drive the model to the status before checking the condition. A status maps to a node of the RRT. It is usually necessary to check various conditions at a specific status. For example, when the specific status represents an SL/SF model state from which multiple transitions are made, we must check multiple conditions to measure the transition coverage. We propose a unique distance calculation metric, based on the observation that the test targets are gathered around some specific status such as an SL/SF state, named key nodes in this paper. The proposed metric increases the probability that an RRT is extended from key nodes by imposing penalties to non-key nodes. A test case generation algorithm utilizing the proposed metric is proposed. Three models of Electrical Control Units (ECUs) embedded in a commercial vehicle are used for the performance evaluation. The performances are evaluated in terms of penalties and compared with those of the algorithm using a typical RRT algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.71-76
• /
• 2007

Object detection process which makes decision on the existence of meaningful objects in a given image is a crucial part of image recognition in computer vision system. Hausdorff distance metric has been used in object detection and shows good results in applications such as face recognition. It defines the dissimilarity between two sets of points and is used to find the object that is most similar to the given model. This paper proposes a Hausdorff distance based detection method that uses directional information of points to improve detection accuracy when the sets of points are derived from edge extraction as is in usual cases. In this method, elastic energy needed to make two directional points coincident is used as a measure of similarity.

• Journal of the Korean Mathematical Society
• /
• v.50 no.5
• /
• pp.917-931
• /
• 2013

It is known that being hierarchical is a necessary and sufficient condition for a poset to admit MacWilliams identity. In this paper, we completely characterize the structures of posets which have an association scheme structure whose relations are indexed by the poset distance between the points in the space. We also derive an explicit formula for the eigenmatrices of association schemes induced by such posets. By using the result of Delsarte which generalizes the MacWilliams identity for linear codes, we give a new proof of the MacWilliams identity for hierarchical linear poset codes.

• Bulletin of the Korean Mathematical Society
• /
• v.30 no.1
• /
• pp.91-97
• /
• 1993

In this article, we consider the case that S is a topologically complete subspace of $R^{k}$ , and that .GAMMA. is a set of monotone functions on S into S. It is obtained the sugficient condition for the existence of a unique invariant probability to which $P^{(n}$/(x,dy) converges exponentially fast in a metric stronger than the Kolmogorov's distance. This extends the earlier results of Bhattacharya and Lee (1988) who considered the case .GAMMA. a set of nondecreasing functions.tions.

• Journal of the Korea Society for Simulation
• /
• v.32 no.1
• /
• pp.45-54
• /
• 2023

Under combat simulation environment when inputting the detection performance data of the real system into the simulated object the given data affects the simulation analysis result. ACQUIRE-Target Task Performance Metric (TTPM)-Target Angular Size (TAS) model is used as a target acquisition model to simulate the detection ability of entities in the main combat simulation tool. This model estimates the decomposition curve of the object sensor and output the detection distance according to the target type. However, it is not easy to apply the performance of the new detection object that the user wants to input to the target acquisition model. Users want to input the detection distance into the target acquisition model, but the target acquisition model requires sensor decomposition curve data according to encounter conditions. In this paper, we propose a method of inversely deriving the sensor decomposition curve data of the target acquisition model by taking the detection distance to the target as an input. Here, the sensor decomposition curve data simultaneously satisfies each detection distance for three types of targets: personnel, ground vehicles, and aircraft. Finally, the detection distance of various reconnaissance equipment is applied to the detection object, and the detection effect according to the reconnaissance equipment is analyzed.