• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(4)
• /
• pp.183-186
• /
• 2000

Motion estimation technique has been used to increase video compression rates in motion video applications. One of the important algorithms to implement the motion estimation technique is search algorithm. Among many search algorithms, the H.263 adopted the Nearest Neighbors algorithm for fast search. In this paper, motion estimation block for the Nearest Neighbors algorithm is designed on FPGA and coded using VHDL and simulated under the Xilinx foundation environments. In the experiment results, we verified that the algorithm was properly designed and performed on the Xilinx FPGA(XCV300Q240)

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 2004년도 전력전자학술대회 논문집(2)
• /
• pp.926-930
• /
• 2004

This paper presents a comparison of the characteristics by two types of switched reluctance motor (SRM) drives using search coils, Exterior pole search coil and Interior central pole search coil, which are used for estimation of the rotor position. The advantages and disadvantages of the two types of drive methods are also described.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2044-2047
• /
• 2003

In this paper, we propose efficient motion vector refinement algorithm for frame-rate reduction transcoding. The proposed algorithm is to set the search range for motion refinement based on the incoming motion vector. The algorithm calculates the importance of motion vector of the skipped frame and then selects two motion vector to set search range. Through this process, we determine the accuracy of incoming motion vector and set the search range lot refinement adaptively by means of the accuracy. In experiments, we show efficiency of our algorithm to reduce the search points for refinement.

• 한국경영과학회지
• /
• 제10권2호
• /
• pp.75-82
• /
• 1985

Reorganization is essential part of data base maintenanc work and the reasonable reorganization points can be determined from the trade-off between reorganization cost and performance degradation. There has been many reorganization models so far, but none of these models have assumed nonlinear search cost function. This paper presents the existensions of two existing linear reorganization models for the case where the search cost function is quadratic. The higher performance of these extended models was shown in quadratic search cost function case.

• 한국경영과학회지
• /
• 제19권1호
• /
• pp.201-206
• /
• 1994

The linear search problem is concerned with finding a hiden target on the real line R. The position of the target governed by some probability distribution. It is desired to find the target in the least expected search time. This problem has been formulated as an optimization problem by a number of authors without making use of Markov Decision Process (MDP) theory. It is the aim of the paper to give a (MDP) formulation to the search problem which we feel is both natural and easy to follow.

• 한국통신학회논문지
• /
• 제21권2호
• /
• pp.313-325
• /
• 1996

This paper presents a new architecture for full-search block-matching motion estimation. The architecture is based on linear systolic arrays. High speed operation is obtained by feeding reference data, search data, and control signals into the linear systolic array in a pipelined fashion. Input data are fed into the linear systolic array at a half of the processor speed, reducing the required data bandwidth to half. The proposed architecture has a good scalability with respect to the number of processors and input bandwidth when the size of reference block and search range change.

• 대한전기학회논문지
• /
• 제40권2호
• /
• pp.135-143
• /
• 1991

The setting problem of protective devices in power distribution systems is a combinatorial search problem involving a lot of trial & errors to search for a proper solution which has a great impact for the system reliability. This paper discusses the nature of the problem and proposes a scheme to prune the decision tree achieving the efficient search for a setting solution by applying heuristic rules which utilize pattern informations of backup and primary devices. Its effectiveness is demonstrated through many tests on real systems.

• 한국통신학회논문지
• /
• 제25권9B호
• /
• pp.1604-1608
• /
• 2000

The three-step search (TSS) algorithm for block motion estimation has been widely used in real-time video coding due to the simplicity of the algorithm significant reduction of computationl cost and good performance. In this paper an improved three-step search (ITS) algorithm is proposed to improve the performance of the TSS algorithm. Simulation results show that in terms of motion compensation errors the proposed ITSS outperforms some popular fast search algorithms while it has the lower computational complexity.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 1997년도 추계학술대회논문집; 한국과학기술회관; 6 Nov. 1997
• /
• pp.184-189
• /
• 1997

This paper introduces a new combined method by genetic algorithm and random tabu search method as optimization algorithm. Genetic algorithm can search the global optimum and tabu search method is very fast in speed. The optimizing ability of new combined method is identified by comparing other optimizing algorithm and used for optimum design of damping plate.

• Kyungpook Mathematical Journal
• /
• 제59권1호
• /
• pp.175-190
• /
• 2019

In this paper, we provide results for the search number of the Cartesian product of graphs. We consider graphs on opposing ends of the spectrum: paths and cliques. Our main result determines the pathwidth of the product of cliques and provides a lower bound for the search number of the product of cliques. A consequence of this result is a bound for the search number of the product of arbitrary graphs G and H based on their respective clique numbers.