A correlation tracking algorithm based on template partition motion estimation proposed for improving real time performance of the conventional correlation matching algorithms. The target trajectory fitted using the l...A correlation tracking algorithm based on template partition motion estimation proposed for improving real time performance of the conventional correlation matching algorithms. The target trajectory fitted using the least square with equal space in whole interval and the target prediction point is found out. According to the requirements of block motion estimation(BME) algorithm,the template divided into some macro blocks. The searching process is conducted by using diamond search algorithm around the prediction point and the optimal motion vector of each block is calculated. A point corresponding to the motion vector with the best matching is taken as a rough matching point of the template. The relation of relative position between the block with matching point and the searching area determined to decide whether to conduct precise matching search or to construct a new search area in the gradient direction. The target tracking experiment results show that over 70% time cost can be reduced caompared with the conventional correlation matching algorithm based on full search method.展开更多
A new faster block-matching algorithm （BMA） by using both search candidate and pixd sulzsamplings is proposed. Firstly a pixd-subsampling approach used in adjustable partial distortion search （APDS） is adjusted to...A new faster block-matching algorithm （BMA） by using both search candidate and pixd sulzsamplings is proposed. Firstly a pixd-subsampling approach used in adjustable partial distortion search （APDS） is adjusted to visit about half points of all search candidates by subsampling them, using a spiral-scanning path with one skip. Two sdected candidates that have minimal and second minimal block distortion measures are obtained. Then a fine-tune step is taken around them to find the best one. Some analyses are given to approve the rationality of the approach of this paper. Experimental results show that, as compared to APDS, the proposed algorithm can enhance the block-matching speed by about 30% while maintaining its MSE performance very close to that of it. And it performs much better than many other BMAs such as TSS, NTSS, UCDBS and NPDS.展开更多
基金Sponsored by the National Defense Pre-Research Foundation of China
文摘A correlation tracking algorithm based on template partition motion estimation proposed for improving real time performance of the conventional correlation matching algorithms. The target trajectory fitted using the least square with equal space in whole interval and the target prediction point is found out. According to the requirements of block motion estimation(BME) algorithm,the template divided into some macro blocks. The searching process is conducted by using diamond search algorithm around the prediction point and the optimal motion vector of each block is calculated. A point corresponding to the motion vector with the best matching is taken as a rough matching point of the template. The relation of relative position between the block with matching point and the searching area determined to decide whether to conduct precise matching search or to construct a new search area in the gradient direction. The target tracking experiment results show that over 70% time cost can be reduced caompared with the conventional correlation matching algorithm based on full search method.
基金This project was supported by the National Natural Science Foundation of China (60272099) .
文摘A new faster block-matching algorithm （BMA） by using both search candidate and pixd sulzsamplings is proposed. Firstly a pixd-subsampling approach used in adjustable partial distortion search （APDS） is adjusted to visit about half points of all search candidates by subsampling them, using a spiral-scanning path with one skip. Two sdected candidates that have minimal and second minimal block distortion measures are obtained. Then a fine-tune step is taken around them to find the best one. Some analyses are given to approve the rationality of the approach of this paper. Experimental results show that, as compared to APDS, the proposed algorithm can enhance the block-matching speed by about 30% while maintaining its MSE performance very close to that of it. And it performs much better than many other BMAs such as TSS, NTSS, UCDBS and NPDS.
