• Journal of the Korea Computer Industry Society
• /
• v.5 no.5
• /
• pp.755-760
• /
• 2004

In this paper, an advanced successive elimination algorithm was proposed using mean absolute difference of neighboring search points. By using mean absolute difference of neighboring search points, the search point in motion estimation can be eliminated effeciently without matching evaluation that requires very intensive computations. By using adaptive MAD calculation algorithm, the candidate matching block can be eliminated early. So, the number of the proposed algrorithm was verified by experimental results.

• Journal of Korea Multimedia Society
• /
• v.8 no.7
• /
• pp.889-897
• /
• 2005

This paper presents a new fast motion estimation algorithm for multi-reference frames. We first analyze the experimental results of the successive elimination algorithm, which is a fast version of full search algorithm, being applied to Multi-reference frames. Based on the analysis, a new scheme for alleviating its computational burden is introduced. In the proposed method, the motion vector for the immediately previous reference frame is found by applying the successive elimination algorithm, while the motion vector for other reference frames is estimated by extrapolation of the already obtained motion vector. Adaptively restricting the motion search area to the local area centered on the estimated motion vector, the proposed method provides dramatic computational complexity reduction but slight quality degradation. The proposed method is evaluated by experiments for some image sequences.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.13 no.2
• /
• pp.152-156
• /
• 2013

This paper presents a fast-lock dual-loop successive approximation register-controlled duty-cycle corrector (SARDCC) circuit using a mixed (binary+sequential) search algorithm. A wider duty-cycle correction range, higher operating frequency, and higher duty-cycle correction accuracy have been achieved by utilizing the dual-loop architecture and the binary search SAR that achieves the fast duty-cycle correcting property. By transforming the binary search SAR into a sequential search counter after the first DCC lock-in, the proposed dual-loop SARDCC keeps the closed-loop characteristic and tracks variations in process, voltage, and temperature (PVT). The measured duty cycle error is less than ${\pm}0.86%$ for a wide input duty-cycle range of 15-85 % over a wide frequency range of 0.5-2.0 GHz. The proposed dual-loop SARDCC is fabricated in a 0.18-${\mu}m$, 1.8-V CMOS process and occupies an active area of $0.075mm^2$.

• Journal of the Korean Society for information Management
• /
• v.12 no.1
• /
• pp.143-161
• /
• 1995

This paper defines online search strategy as a global approach to the resolution of online searching. Five search strategy models including Brief Search. Building Blocks Strategies. Successive Facet Strategies, Successive Fractions Approach, and Citation Pearl Growing, are critically reviewed. Applicability and adaptability of each strategy are examined in the real concrete online searching environment.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.1043-1052
• /
• 2003

In this paper, we present a fast motion estimation algorithm to reduce the computations of block matching algorithm for motion estimation in video coding. The proposed algorithm is based on Multi-level Successive Elimination Algorithm and Efficient Multi-level Successive Elimination Algorithms. The best estimate of the motion vectors can be obtained by hierarchical search point sampling and thus the proposed algorithm can decrease the number of matching evaluations that require very intensive computations. The efficiency of the proposed algorithm was verified by experimental results.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.3
• /
• pp.32-40
• /
• 1999

In this paper, we present a fast block matching motion estimation algorithm based on successive elimination algorithm (SEA). Based on the characteristic of center-biased motion vector distribution in the search area, the proposed method improves the performance of the SEA with a reduced the number of the search positions in the search area, In addition, to reduce the computational load, this method is combined with both the reduced bits mean absolute difference (RBMAD) matching criterion which can be reduced the computation complexity of pixel comparison in the block matching and pixel decimation technique which reduce the number of pixels used in block matching. Simulation results show that the proposed method provides better performance than existing fast algorithms and similar to full-search block motion estimation algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.638-648
• /
• 2000

This paper introduces a new technique for block is matching motion estimation. Since the temporal correlation of the image sequence, the motion vector of a block is highly related to the motion vector of the same coordinate block in the previous image frame. If we can obtain useful and enough information from the motion vector of the same coordinate block of the previous frame, the total number of search points used to find the motion vector of the current block may be reduced significantly. Using that idea, an efficient predicted direction search algorithm (PDSA) for block matching algorithm is proposed. Based on the direction of the blocks of the two successive previous frames, if the direction of the to successive blocks is same, the first search point of the proposed PDSA is moved two pixels to the direction of the block. The searching process after moving the first search point is processed according to the fixed search patterns. Otherwise, full search is performed with search area $\pm$2. Simulation results show that PSNR values are improved up to the 3.4dB as depend on the image sequences and improved about 1.5dB on an average. Search times are reduced about 20% than the other fast search algorithms. Simulation results also show that the performance of the PDSA scheme gives better subjective picture quality than the other fast search algorithms and is closer to that of the FS(Full Search) algorithm.

• Advances in Energy Research
• /
• v.4 no.4
• /
• pp.255-274
• /
• 2016

This paper presents a novel symbiotic organisms search (SOS) algorithm to optimize both real power loss (RPL) and voltage stability limit (VSL) of a transmission network by controlling the variables such as unified power flow controller (UPFC) location, UPFC series injected voltage magnitude and phase angle and transformer taps simultaneously. Mathematically, this issue can be formulated as nonlinear equality and inequality constrained multi objective, multi variable optimization problem with a fitness function integrating both RPL and VSL. The symbiotic organisms search (SOS) algorithm is a nature inspired optimization method based on the biological interactions between the organisms in ecosystem. The advantage of SOS algorithm is that it requires a few control parameters compared to other meta-heuristic algorithms. The proposed SOS algorithm is applied for solving optimum control variables for both single objective and multi-objective optimization problems and tested on New England 39 bus test system. In the single objective optimization problem only RPL minimization is considered. The simulation results of the proposed algorithm have been compared with the results of the algorithms like interior point successive linear programming (IPSLP) and bacteria foraging algorithm (BFA) reported in the literature. The comparison results confirm the efficacy and superiority of the proposed method in optimizing both single and multi objective problems.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.1 s.307
• /
• pp.1-8
• /
• 2006

This paper presents a fast full search algorithm for motion estimation applicable to multiple reference images. The proposed method is an extended version of the rate constrained successive elimination algorithm (RSEA) for multiple reference frame applications. We will show that motion estimation for the reference images temporally preceding the first reference image can be less intensive in computation compared with that for the first reference image. for computational reduction, we will drive a new condition to lead the smaller number of candidate blocks for the best matched block. Simulation results explain that our method reduces computation complexity although it has the same quality as RSEA.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.1
• /
• pp.147-156
• /
• 2004

In this paper, a new fast motion estimation algorithm which is based on the Block Sum Pyramid Algorithm(BSPA) is presented. The Spiral Diamond Mesh Search scheme and Partial Distortion Elimination scheme of Efficient Multi-level Successive Elimination Algorithm were improved and then the improved schemes were applied to the BSPA. The motion estimation accuracy of the proposed algorithm is nearly 100% and the cost of Block Sum Pyramid Algorithm was reduced in the proposed algorithm. The efficiency of the proposed algorithm was verified by experimental results.