A fuzzy search block-matching chip for motion estimation
Integration, the VLSI Journal
Phase information and space filling curves in noisy motion estimation
IEEE Transactions on Image Processing
Predicting software project effort: A grey relational analysis based method
Expert Systems with Applications: An International Journal
Block motion estimation using modified two-bit transform
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Fast motion estimation using spatio temporal filtering
ICIAR'06 Proceedings of the Third international conference on Image Analysis and Recognition - Volume Part I
Nearest neighbor selection for iteratively kNN imputation
Journal of Systems and Software
Analyzing software effort estimation using k means clustered regression approach
ACM SIGSOFT Software Engineering Notes
Grey relational effort analysis technique using robust regression methods for individual projects
International Journal of Computational Intelligence Studies
Hi-index | 0.00 |
Due to the temporal and spatial correlation of the image sequence, the motion vector of a block is highly related to the motion vectors of its adjacent blocks in the same image frame. If we can obtain useful and enough information from the adjacent motion vectors, the total number of search points used to find the motion vector of the block may be reduced significantly. Using that idea, an efficient gray prediction search (GPS) algorithm for block motion estimation is proposed in this paper. Based on the gray system theory, the GPS can determine the motion vectors of image blocks quickly and correctly. The experimental results show that the proposed algorithm performs better than other search algorithms, such as 3SS, CS, PHODS, 4SS, BBGDS, SES and PSA, in terms of six different measures: (1) average mean square error per pixel; (2) average peak signal-to-noise ratio; (3) average prediction errors per pixel; (4) average entropy of prediction errors; (5) average percentage of unpredictable pels per frame; and (6) average search points per block