Bioinspired Polarized Optical Flow Enables Turbid Underwater Target Motion Estimation

Underwater target motion estimation is a challenge for ocean military and scientific research.In this work,we propose a method based on the combination of polarization imaging and optical flow for turbid underwater target detection.Polarization imaging can reduce the influence of backscattered light and obtain high-quality images underwater.The optical flow shows the motion and structural information of the target.We use polarized optical flow to obtain the optical flow field and estimate the target motion.The experimental results of different targets under varying water turbidity levels illustrate that our method is realizable and robust.The precision is verified by comparing the results with the precise displacement data and calculating two error measures.The proposed method based on polarized optical flow can obtain accurate displacement information and a good recognition effect.Moving target segmentation based on the Otsu method further proves the superiority of the polarized optical flow under turbid water.This study is valuable for target detection and motion estimation in scattering environments.

Fast global motion estimation and moving object extraction algorithm in image sequences

A novel and effective approach to global motion estimation and moving object extraction is proposed. First, the translational motion model is used because of the fact that complex motion can be decomposed as a sum of translational components. Then in this application, the edge gray horizontal and vertical projections are used as the block matching feature for the motion vectors estimation. The proposed algorithm reduces the motion estimation computations by calculating the onedimensional vectors rather than the two-dimensional ones. Once the global motion is robustly estimated, relatively stationary background can be almost completely eliminated through the inter-frame difference method. To achieve an accurate object extraction result, the higher-order statistics （HOS） algorithm is used to discriminate backgrounds and moving objects. Experimental results validate that the proposed method is an effective way for global motion estimation and object extraction.

6-DOF motion estimation using optical flow based on dual cameras

Because of its characteristics of simple algorithm and hardware, optical flow-based motion estimation has become a hot research field, especially in GPS-denied environment. Optical flow could be used to obtain the aircraft motion information, but the six-(degree of freedom)(6-DOF) motion still couldn't be accurately estimated by existing methods. The purpose of this work is to provide a motion estimation method based on optical flow from forward and down looking cameras, which doesn't rely on the assumption of level flight. First, the distribution and decoupling method of optical flow from forward camera are utilized to get attitude. Then, the resulted angular velocities are utilized to obtain the translational optical flow of the down camera, which can eliminate the influence of rotational motion on velocity estimation. Besides, the translational motion estimation equation is simplified by establishing the relation between the depths of feature points and the aircraft altitude. Finally, simulation results show that the method presented is accurate and robust.

A novel adjustable multiple cross-hexagonal search algorithm for fast block motion estimation

In this paper,we propose a novel adjustable multiple cross-hexagonal search(AMCHS) algorithm for fast block motion estimation. It employs adjustable multiple cross search patterns(AMCSP) in the first step and then uses half-way-skip and half-way-stop technique to determine whether to employ two hexagonal search patterns(HSPs) subsequently. The AMCSP can be used to find small motion vectors efficiently while the HSPs can be used to find large ones accurately to ensure prediction quality. Simulation results showed that our proposed AMCHS achieves faster search speed,and provides better distortion performance than other popular fast search algorithms,such as CDS and CDHS.

MULTI-RESOLUTION MOTION ESTIMATION AND COMPENSATION BASED ON ADJACENT PREDICTION OF FRAME DIFFERENCE IN WAVELET DOMAIN

Aiming at the higher bit-rate occupation of motion vector encoding and more time load of full-searching strategies, a multi-resolution motion estimation and compensation algorithm based on adjacent prediction of frame difference was proposed.Differential motion detection was employed to image sequences and proper threshold was adopted to identify the connected region.Then the motion region was extracted to carry out motion estimation and motion compensation on it.The experiment results show that the encoding efficiency of motion vector is promoted, the complexity of motion estimation is reduced and the quality of the reconstruction image at the same bit-rate as Multi-Resolution Motion Estimation(MRME) is improved.

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.

Gaussian particle filter based pose and motion estimation

Determination of relative three-dimensional （3D） position, orientation, and relative motion between two reference frames is an important problem in robotic guidance, manipulation, and assembly as well as in other fields such as photogrammetry. A solution to pose and motion estimation problem that uses two-dimensional （2D） intensity images from a single camera is desirable for real-time applications. The difficulty in performing this measurement is that the process of projecting 3D object features to 2D images is a nonlinear transformation. In this paper, the 3D transformation is modeled as a nonlinear stochastic system with the state estimation providing six degrees-of-freedom motion and position values, using line features in image plane as measuring inputs and dual quaternion to represent both rotation and translation in a unified notation. A filtering method called the Gaussian particle filter （GPF） based on the panicle filtering concept is presented for 3D pose and motion estimation of a moving target from monocular image sequences. The method has been implemented with simulated data, and simulation results are provided along with comparisons to the extended Kalman filter （EKF） and the unscented Kalman filter （UKF） to show the relative advantages of the GPF. Simulation results showed that GPF is a superior alternative to EKF and UKF.

Fast motion estimation algorithm for H.264/AVC based on centered prediction

H.264/AVC video coding standard can achieve roughly half of the bit-savings over MPEG2 and MPEG4 for a given quality. However, this comes at a cost in considerably increased complexity at the encoder and thus increases the difficulty in hardware implementation. The high redundancy that exists between the successive frames of a video sequence makes it possible to achieve a high data compression ratio. Motion estimation （ME） plays an important role in motion compensated video coding. A fast motion estimation algorithm for H.264/AVC is proposed based on centered prediction, called centered prediction based fast mixed search algorithm （CPFMS）. It makes use of the spatial and temporal correlation in motion vector （MV） fields and feature of all-zero blocks to accelerate the searching process. With the initialized searching point prediction, adaptive search window changing and searching direction decision, CPFMS is provided to reduce computation in block-matching process. The experimental results show that the speed of CPFMS is nearly 12 times of FS with a negligible peak signal-noise ratio （PSNR） loss. Also, the efficiency of CPFMS outperforms some popular fast algorithms such as hybrid unsymmetrical cross multi-hexagongrid search and a novel multidirectional gradient descent search evidently.

MODIFIED CLT-DOMAIN MOTION ESTIMATION BASED ON PHASE CORRELATION

In this paper, a Modified Complex Lapped Transform domain Motion Estimation (MCLT-ME) method to estimate the motion of video sequence is proposed. The proposed method is based on phase correlation of current window region and corresponding window region, and provides a significant improvement in motion estimation.

A Stoppable Clock Based Four Step Search Block-Matching Motion Estimation Architecture

Motion Estimation （ME） is considerate one of the most important compression methods. However, ME involves high computational complexity. The main goal is to reduce power conception and the execution time without reducing image quality. In this paper, the authors have proposed high parallel processing architecture is presented for four-step search block-matching motion estimation. The proposed method is based on the stoppable clock models. The architecture has been simulated and synthesized with VHDL and ASIC （CMOS 45 nm）. Synthesize results show that the proposed architecture reduces the power consumption and achieves a high performance for real time motion estimation.

Multiresolution Video Watermarking Algorithm Exploiting the Block-Based Motion Estimation

This paper presents a novel technique for embedding a digital watermark into video frames based on motion vectors and discrete wavelet transform (DWT). In the proposed scheme, the binary image watermark is divided into blocks and each watermark block is embedded several times in each selected video frame at different locations. The block-based motion estimation algorithm is used to select the video frame blocks having the greatest motion vectors magnitude. The DWT is applied to the selected frame blocks, and then, the watermark block is hidden into these blocks by modifying the coefficients of the Horizontal sub-bands (HL). Adding the watermark at different locations in the same video frame makes the scheme more robust against different types of attacks. The method was tested on different types of videos. The average peak signal to noise ratio (PSNR) and the normalized correlation (NC) are used to measure the performance of the proposed method. Experimental results show that the proposed algorithm does not affect the visual quality of video frames and the scheme is robust against a variety of attacks.

Fast Sub-Pixel Motion Estimation Algorithm For H.264

A novel fast sub-pixel search algorithm is proposed to accelerate sub-pixel search. Based on the features of predicted motion vector (PMV) and texture direction observed, the proposed method effectively filters out impossible points and thus decreases 11 searched points in average during the sub-pixel search stage. A threshold is also adopted to early terminate the sub-pixel search. Simulation results show that the proposed method can achieve up to 4.8 times faster than full sub-pixel motion search scheme (FSPS) with less than 0.025 dB PSNR losses and 2.2% bit-length increases.

Fast Approaches for Sub-pixel Precision Variable Block Size Motion Estimation

The new features of H. 264 video coding standard make the motion estimation module much more time consuming than before. Especially, the motion search is required for each of the 4 modes for inter prediction. In order to reduce the computational complexity, we analyze the statistics of results of motion estimation, such as the continuity of best modes of blocks in successive frames and the chance to give up a sub-partition mode （smaller than 16 × 16） after integer-pixel motion estimation, from which we suggest to make mode prediction based on the motion information of the previous frame and skip sub-pixel motion estimation in subpartition mode selectively. According to the experimental result, the proposed algorithm can save 75 % of the computational time with a slight degradation （0.03 dB） on PSNR compared with the pseudocode of fast search motion estimation in JM12.2.

Fast motion estimation algorithm of video stabilization system

A real-time electronic image stabilization motion estimation method based on fast sub- block gray projection algorithm is proposed. In the method, each image is divided into a number of sub-blocks, and sub-blocks are sifted with their gray gradients. After removing sub-blocks whose gray gradients are lower than the given threshold, the calculation amount of projection is reduced and the motion estimation accuracy is improved. Then gray projection is done in each remained sub- block, and global motion vector of the image is calculated according to the local motion vectors of sub-blocks and the affine motion model. The drawbacks as the local motions reducing the global mo- tion estimation accuracy and traditional gray projection algorithm could not deal with rotation are re- solved well by this algorithm. The experiment results show that the algorithm is more accurate and efficient than the gray projection algorithm.

Global motion estimation with Gabor wavelet transform

A novel algorithm of global motion estimation is proposed. First, through Gabor wavelet transform （GWT）, a kind of energy distribution of image is obtained and checkpoints are selected according to a probability decision approach proposed. Then, the initialized motion vectors are obtained via a hierarcbal block-matching based on these checkpoints. Finally, by employing a 3-parameter motion model, precise parameters of global motion are found. From the experiment, the algorithm is reliable and robust.

New Diamond Block Based Gradient Descent Search Algorithm for Motion Estimation in the MPEG- 4 Encoder

Motion estimation is an important part of the MPEG- 4 encoder, due to its significant impact on the bit rate and the output quality of the encoder sequence. Unfortunately this feature takes a significant part of the encoding time especially when the straightforward full search(FS) algorithm is used. In this paper, a new algorithm named diamond block based gradient descent search (DBBGDS) algorithm, which is significantly faster than FS and gives similar quality of the output sequence, is proposed. At the same time, some other algorithms, such as three step search (TSS), improved three step search (ITSS), new three step search (NTSS), four step search (4SS), cellular search (CS) , diamond search (DS) and block based gradient descent search (BBGDS), are adopted and compared with DBBGDS. As the experimental results show, DBBGDS has its own advantages. Although DS has been adopted by the MPEG- 4 VM, its output sequence quality is worse than that of the proposed algorithm while its complexity is similar to the proposed one. Compared with BBGDS, the proposed algorithm can achieve a better output quality.

Hybrid Slip Model for Near-Field Ground Motion Estimation Based on Uncertainty of Source Parameters

The hybrid slip model used to generate a finite fault model for near-field ground motion estimation and seismic hazard assessment was improved to express the uncertainty of the source form of a future earthquake.In this process, source parameters were treated as normal random variables, and the Fortran code of hybrid slip model was modified by adding a random number generator so that the code could generate many finite fault models with different dimensions and slip distributions for a given magnitude.Furth...

An Object-Based Fast Motion Estimation Algorithm in MPEG-4

This paper presented an object-based fast motion estimation (ME) algorithm for object-based texture coding in moving picture experts group four (MPEG-4), which takes full advantage of the shape information of video object. Compared with the full search (FS) algorithm, the proposed algorithm can significantly speed the ME process. The speed of ME using the proposed algorithm is faster than that using new three-step search (NTSS), four-step search (4SS), diamond search (DS), and block-based gradient descent search (BBGDS) algorithms with similar motion compensation (MC) errors. The proposed algorithm can be combined with other fast ME algorithm to make the ME process faster.

Reduced bit low power VLSI architectures for motion estimation

Low power and real time very large scale integration （VLSI） architectures of motion estimation （ME） algorithms for mobile devices and applications are presented. The power reduction is achieved by devising a novel correction recovery mechanism based on algorithms which allow the use of reduced bit sum of absolute difference （RBSAD） metric for calculating matching error and conversion to full resolution sum of absolute difference （SAD） metric whenever necessary. Parallel and pipelined architectures for high throughput of full search ME corresponding to both the full resolution SAD and the generalized RBSAD algorithm are synthe- sized using Xilinx Synthesis Tools （XST）, where the ME designs based on reduced bit （RB） algorithms demonstrate the reduction in power consumption up to 45% and/or the reduction in area up to 38%.

H.264 MOTION ESTIMATION ALGORITHM BASED ON VIDEO SEQUENCES ACTIVITY

Motion estimation is an important part of H.264/AVC encoding progress, with high com- putational complexity. Therefore, it is quite necessary to find a fast motion estimation algorithm for real-time applications. The algorithm proposed in this letter adjudges the macroblocks activity degree first; then classifies different video sequences, and applies different search strategies according to the result. Experiments show that this method obtains almost the same video quality with the Full Search (FS) algorithm but with reduced more than 95% computation cost.