• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.8
• /
• pp.129-136
• /
• 1994

In this paper an adaptive moving method of the search region tracking the motion is proposed. The search region in BMA is determined by the capability of hardware implementation and the degree of motion. But once determined nothing can be changed during coding procedure. In this paper we predict the level of motion of the current block using motion vectors of previous frames without overhead information and change the location of the search region according to the level of the motion predicted. In short the proposed method can be archieved the dsirable effect such that the size of search region gets large when the motion is large. Results of experiments show that prediction efficiency has been improved by using adaptive moving method resulting in reduced prediction error in the blocks with large motion.

• Journal of KIISE:Databases
• /
• v.35 no.6
• /
• pp.495-504
• /
• 2008

Recently, there has been much work on supporting keyword search not only for text documents, but a]so for structured data such as relational data, XML data, and RDF data. In this paper, we propose an efficient keyword search method for RDF data. The proposed method first groups related nodes and edges in RDF data graphs to reduce data sizes for efficient keyword search and to allow relevant information to be returned together in the query answers. The proposed method also utilizes the semantics in RDF data to measure the relevancy of nodes and edges with respect to keywords for search result ranking. The experimental results based on real RDF data show that the proposed method reduces RDF data about in half and is at most 5 times faster than the previous methods.

• The Journal of the Korea Contents Association
• /
• v.11 no.5
• /
• pp.9-14
• /
• 2011

This paper presents a new fast motion estimation method where search ranges are determined by the probabilities of motion vector differences (MVDs), which is an adaptive/dynamic search range (ASR) method. The MVDs' distribution is investigated and its parameter is estimated by the maximum likelihood estimator. With the estimated distribution, we show that the search ranges can be efficiently restricted by a prefixed probability for MVDs. Experimental results showed that the performance of the proposed method is very similar to that of the full search algorithm in PSNR but it enables significant reduction in the computational complexity. In addition, they revealed that the proposed method determine the search ranges much more efficiently than the conventional ASR methods.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.3
• /
• pp.368-373
• /
• 2007

In recent year s there have been increasing interests in real-time object tracking with image information. This dissertation presents a real-time object tracking method through the object recognition based on neural networks that have robust characteristics under various illuminations. This dissertation proposes a global search and a local search method to track the object in real-time. The global search recognizes a target object among the candidate objects through the entire image search, and the local search recognizes and track only the target object through the block search. This dissertation uses the object color and feature information to achieve fast object recognition. The experiment result shows the usefulness of the proposed method is verified.

• The Journal of Society for e-Business Studies
• /
• v.21 no.4
• /
• pp.1-14
• /
• 2016

Semantic search is known as a series of activities and techniques to improve the search accuracy by clearly understanding users' search intent without big cognitive efforts. Usually, semantic search engines requires ontology and semantic metadata to analyze user queries. However, building a particular ontology and semantic metadata intended for large amounts of data is a very time-consuming and costly task. This is why commercialization practices of semantic search are insufficient. In order to resolve this problem, we propose a novel semantic search method which takes advantage of our previous semantic tensor space model. Since each term is represented as the 2nd-order 'document-by-concept' tensor (i.e., matrix), and each concept as the 2nd-order 'document-by-term' tensor in the model, our proposed semantic search method does not require to build ontology. Nevertheless, through extensive experiments using the OHSUMED document collection and SCOPUS journal abstract data, we show that our proposed method outperforms the vector space model-based search method.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.13-16
• /
• 2000

In this paper, we propose hybrid control method of neural network using the 3-point search algorithm. Proposed control method is searched the weight using the 3-point search algorithm for off-line then control the on-line. In order to verify the usefulness of the proposed method, we simulated the proposed control method with one link manipulator system and confirmed the excellency.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.119-122
• /
• 2003

This paper presents an efficient huffman decoding method based on the multiple branch technique. In the proposed search method, the internal node which does not contain a leaf node are removed for decrease the searching time and the memory consumption. The proposed search method gives 44％ of improved in searching time and 34％ of decreased in memory requirement compared to the binary search method.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.488-491
• /
• 1995

The paper presents a new global maximum search method for multimodal unknown functions of two variables. The search method is composed of two stages and sequentially samples the candidate point in a subdomain selected using a priority function in each stage. The search domain is auto-similarly divided into triangular subdomains, or cells, during the search process. A measure of accuracy of local maximum search is introduced to check if a local search has converged to a specified accuracy or the maximum of a local peak cannot be the global maximum. A criterion for switching from the first to the second stage, is proposed using a ratio of the observed peak width to the largest cell in the domain. By numerical simulations, the required number of trials is evaluated for some function models with different peak parameters, and the switching criterion is optimally determined. The results show that the proposed method obtains global maximum points with certainty and saves largely computation time even for functions with extremely steep peaks.

• Journal of Ocean Engineering and Technology
• /
• v.23 no.1
• /
• pp.122-128
• /
• 2009

In this study, damage detection method using harmony search method and frequency response is proposed. In order to verify this method, the following approaches are implemented. Firstly, damage detection method using harmony search was developed. To detect damage, objective functions that minimize difference with natural frequency and modal strain energy from undamaged and damaged model are used. Secondly, efficiency of developed damage detection method was verified by damage detection of beam structure. And results of harmony search and micro genetic algorithm are compared and evaluated. Thirdly, numerical model was implemented for harbor caisson structure and damage scenario was determined. Lastly, damage detection was performed by proposed method and utility of proposed method is verified.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2008.04a
• /
• pp.139-144
• /
• 2008

In this study, damage detection method using harmony search method and frequency response is proposed. In order to verify this method, the following approaches are implemented. Firstly, damage detection method using harmony search is developed. To detect damage, objective function that minimize difference with natural frequency and modal strain energy from undamaged and damaged model is used. Secondly, finite element model for beam structure is created. And damage scenario is determined. Lastly, damage detection is performed by proposed method and utility of proposed method is verified.