• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.83-90
• /
• 2004

In this paper, we study the CCD(Clustering with Circular Distance) and the COD(Clustering with Obstructed Distance) problems to be considered when objects are being clustered in a circularly search space and a search space with the presence of obstacles. We also propose a now clustering algorithm for clustering efficiently objects that the insertion or the deletion is occurring frequently in multi-dimensional search space. The distance function for solving the CCD and COD Problems is defined in the Proposed clustering algorithm. This algorithm is included a clustering method to create clusters that have a high spatial locality by minimum computation time.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.6
• /
• pp.35-48
• /
• 1993

In this paper, a hierarchical motion vector estimation algorithm using pyramidal structure is proposed. Using a smaller measurement window at each level of a pyramid than that of the conventional scheme, the proposed algorithm, based on the TSS(three step search), reduces the computational complexity greatly with its performance comparable to that of the TSS. By increasing the number of cnadidate motion vectors which are to be used as the initial search points for motion vector estimation at the next level, the performance improves further. Then the computational complexity of the proposed hierarchical algorithm depends on the number of candidate motion vectors, with its PSNR (peak signal to noise ratio) ranging between those of the TSS and the full search method. The simulation results with two different block sizes and various test sequences are given and its hardware implementation is also sketched.

• Proceedings of the KIEE Conference
• /
• 2007.10a
• /
• pp.141-142
• /
• 2007

The world-wide various nations is doing the development competition of marine resources for solving supply and non balance of the resources in compliance with depleting the land resources. Currently for exploring marine resources, After confirming the location of the resources by controlling search equipment and sensor module in research vessel, the method which collects sample of searched resources and analyzes the quality and a contents of the resources in research vessel is been applying. This search method is structure which analyzes an ingredient in ship and decides the quality of the resources. And real-time processing for an effective resources search is been demanding. Therefore in this paper, we have developed a resources identification algorithm that can display the type feature of resources by real-time 3D Graphic.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.12
• /
• pp.1677-1685
• /
• 1988

In this paper, a new contour coding algorithm is investigated for use in region based image coding. Generally the contour data may be encoded by its chain codes or chain difference codes. But the data compression efficiency is low because of heavy burden for initial absolute coordinates of each chain. To alleviate this problem, the depth first search in graph traversal algorithm, is applied to the chain difference coding method. The proposed coding scheme is shown to be very efficient for contour images obtained by split-merge segmentation. Finally, we can reuce data about 60% in comparison with modified chain difference coding.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.11
• /
• pp.1417-1423
• /
• 1995

In this paper, we propose a full-search block-matching algorithm with early retirement, which can be applied to a 1-D systolic array of processing elements (PE's) for fast motion estimation. In the proposed algorithm, a PE is retired when its current accumulated sum is equal to or larger than the current minimum MAD. If all PE's are retired, the MAD calculation is stopped for the current array position and is started for the next one in the search window. Simulation results show that the optimum motion vector is always found with less computation, the total computation cycles for motion estimation are decreased to about 60%, and the power dissipation in the PE's is reduced to about 40-60%.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.5
• /
• pp.241-247
• /
• 2001

Network reconfiguration in distribution systems is realized by changing the status of sectionalizing switches, and is usually done for loss reduction of load balancing in the system. This paper presents an effective heuristic based switching scheme to solve the distribution feeder loss reduction problem. The proposed algorithm consists of two parts. One is to set up a decision tree to represent the various switching operations available. Another is to apply a proposed technique called cyclic best first search. the proposed algorithm identify the most effective the set of switch status configuration of distribution system for loss reduction. To demonstrate the validity of the proposed algorithm, numerical calculations are carried out the 32, 69 bus system models.

• Journal of Information Technology Services
• /
• v.7 no.4
• /
• pp.199-208
• /
• 2008

Tagging represents one of the Web 2.0 technology, and has an appropriate mechanism for the classification of dynamically changing Web informations. This technique is capable of searching the Web informations using the user specified tags, but still it has a limitation of providing only the limited informations to the tags. Therefore, in order to search the related informations easily, we need to extend this technique further to search not only the desired informations through the designated tags and also the related informations. In this paper, we first have designed and developed an algorithm that can get a desired tag cluster, which is capable of collecting the searched tags along with the related tags. We first performed a test to compare the difference between the user collected tag data through RSS and the reduced data. The second test focused on the accuracy of extracted related tags that depends on the similarity functions, such as the Pearson Correlation and Euclidean. Finally, we showed the final results visually using the graph algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.71.1-71
• /
• 2001

In this paper, an improved method of environment map building and a region search algorithm for mobile robot are presented. For the environment map building of mobile robot, measurement data of ultrasonic sensors and certainty grid representation is usually used. In this case, inaccuracies due to the uncertainty of ultrasonic data are included in the map. In order to solve this problem, an environment map building method using a Bayesian model was proposed previously[5]. In this study, we present an improved method of probability map building that uses infrared sensors and shift division Gaussian probability distribution with the existing Bayesian update method using ultrasonic sensors. Also, a region search algorithm for ...

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.12
• /
• pp.2221-2229
• /
• 2006

Optimal path search algorithm which is a killer application of mobile device to utilize location information should consider traffic flows of the roads as well as the distance between a departure and destination. The existing path search algorithms, however, are net able to cope efficiently with the change of the traffic flows. In this paper, we propose a new optimal path search algorithm. The algorithm takes the current flows into consideration in order to reduce the cost to get destination. It decomposes the road network into Fixed Grid to get variable heuristics. We also carry out the experiments with Dijkstra and Ar algorithm in terms of the execution time, the number of node accesses and the accuracy of path. The results obtained from the experimental tests show the proposed algorithm outperforms the others. The algorithm is highly expected to be useful in a advanced telematics systems.

• The Journal of the Korea Contents Association
• /
• v.9 no.11
• /
• pp.54-62
• /
• 2009

To avoid the redundant investment on the project selection process, it is necessary to check whether the submitted research topics have been proposed or carried out at other institutions before. This is possible through the search engines adopted by the keyword matching algorithm which is based on boolean techniques in national-sized research results database. Even though the accuracy and speed of information retrieval have been improved, they still have fundamental limits caused by keyword matching. This paper examines implemented TFIDF-based algorithm, and shows an experiment in search engine to retrieve and give the order of priority for similar and redundant documents compared with research proposals, In addition to generic TFIDF algorithm, feature weighting and K-Nearest Neighbors classification methods are implemented in this algorithm. The documents are extracted from NDSL(National Digital Science Library) web directory service to test the algorithm.