A Correlation Tracking Algorithm Based on Template Partition Motion Estimation

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.

WEIGHTED WEAK TYPE ESTIMATES INVOLVING SPACES GENERATED BY BLOCKS

The problem studied in this paper is how to establish weighted estimates of weak type near L^1 for those operators that are not of weak type(1,1).

Novel block-matching algorithms by subsampling both search candidates and pixels

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.

Arbitrary Decode-Forward Relaying with Re-Encoded Bits Selection Strategy for Polar Codes

In this paper,we propose an arbitrary decode-forward single-relay scheme for finite blocklength polar codes,which can be applied to the general symmetric discrete memoryless relay channel with orthogonal receiver components.The relay node decodes the received message.The relay node selectively re-encodes the message and transmits it to the destination node.Furthermore,in order to minimize the upper-bound of the block error probability,we propose a selection strategy to decide the proper re-encoded bit set by the relay.Simulation results are presented to illustrate the improvement in decoding performance of the proposed scheme compared to conventional relay schemes in both additive white Gaussian noise(AWGN)channel and Rayleigh fading channel(RFC).

Estimation of Fired Polynomial Effects of Mixed Models Based on PBIB

This paper discusses the estimation of fixed polynomial effects of mixed models based on PBIB, gives three concrete estimation, and analyses the condition of the design block while is orthogonal in these models. It also shows in mixed models that the three estimations of fixed polynomial effects T are identical under tile fact that the design block is orthogonal.