• Journal of Broadcast Engineering
• /
• v.13 no.1
• /
• pp.128-136
• /
• 2008

In this paper, we propose a variable step search fast motion estimation algorithm using local statistics of neighboring motion vectors. Using the degree of correlation between neighboring motion vectors, motion search range is adaptively adjusted to reduce unnecessary search points. Based on the adjusted search range, motion vector is obtained by variable search step. Experimental results show that the proposed algorithm has the capability to dramatically reduce the search points and computing cost for motion estimation, comparing to fast full spiral search motion estimation and other fast motion estimation.

• Nuclear Engineering and Technology
• /
• v.55 no.1
• /
• pp.310-323
• /
• 2023

The k-eigenvalue neutronics/thermal-hydraulics coupling calculation is a key issue for reactor design and analysis. Jacobian-free Newton-Krylov (JFNK) method, featured with super-linear convergence rate and high efficiency, has been attracting more and more attention to solve the multi-physics coupling problem. However, it may converge to the high-order eigenmode because of the multiple solutions nature of the k-eigenvalue form of multi-physics coupling issue. Based on our previous work, a modified JFNK with a line search method is proposed in this work, which can find the fundamental eigenmode together with thermal-hydraulics feedback in a wide range of initial values. In detail, the existing modified JFNK method is combined with the line search strategy, so that the intermediate iterative solution can avoid a sudden divergence and be adjusted into a convergence basin smoothly. Two simplified 2-D homogeneous reactor models, a PWR model, and an HTR model, are utilized to evaluate the performance of the newly proposed JFNK method. The results show that the performance of this proposed JFNK is more robust than the existing JFNK-based methods.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.321-328
• /
• 2003

This Paper Proposes a size-variable block matching algorithm for motion vector extraction. The Proposed algorithm dynamically determines the search area and the size of a block. We exploit the constraint of small velocity changes of a block along the time to determine the origin of the search area. The range of the search area is adjusted according to the motion coherency of spatially neighboring blocks. The process of determining the sire of a block begins matching with a small block. If the matching degree is not good enough, we expand the size of a block a little bit and then repeat the matching process until our matching criterion Is satisfied. The experimental results show that the proposed algorithm can yield very accurate block motion vectors. Our algorithm outperforms other algorithms in terms of the estimated motion vectors, though our algorithm requires some computational overhead.

• Journal of Broadcast Engineering
• /
• v.12 no.2
• /
• pp.128-136
• /
• 2007

Since the multi-view video is a set of video sequences captured by multiple array cameras for the same three-dimensional scene, it can provide multiple viewpoint images using geometrical manipulation and intermediate view generation. Although multi-view video allows us to experience more realistic feeling with a wide range of images, the amount of data to be processed increases in proportion to the number of cameras. Therefore, we need to develop efficient coding methods. One of the possible approaches to multi-view video coding is to generate an intermediate image using view interpolation method and to use the interpolated image as an additional reference frame. The previous view interpolation method for multi-view video coding employs fixed size block matching over the pre-determined disparity search range. However, if the disparity search range is not proper, disparity error may occur. In this paper, we propose an efficient view interpolation method using initial disparity estimation, variable block-based estimation, and pixel-level estimation using adjusted search ranges. In addition, we propose a multi-view video coding method based on H.264/AVC to exploit the intermediate image. Intermediate images have been improved about $1{\sim}4dB$ using the proposed method compared to the previous view interpolation method, and the coding efficiency have been improved about 0.5 dB compared to the reference model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2464-2479
• /
• 2014

Multi-view video coding is an international encoding standard that attains good performance by fully utilizing temporal and inter-view correlations. However, it suffers from high computational complexity. This paper presents a fast encoder design to reduce the level of complexity. First, when the temporal correlation of a group of pictures is sufficiently strong, macroblock-based inter-view prediction is not employed for the non-anchor pictures of B-views. Second, when the disparity between two adjacent views is above some threshold, frame-based inter-view prediction is disabled. Third, inter-view prediction is not performed on boundary macroblocks in the auxiliary views, because the references for these blocks may not exist in neighboring views. Fourth, finer partitions of inter-view prediction are cancelled for macroblocks in static image areas. Finally, when estimating the disparity of a macroblock, the search range is adjusted according to the mode size distribution of the neighboring view. Compared with reference software, these techniques produce an average time reduction of 83.65%, while the bit-rate increase and peak signal-to-noise ratio loss are less than 0.54% and 0.05dB, respectively.