检索结果-内蒙古大学图书馆

successive elimination algorithm for binary block matching motion estimation

ELECTRONICS LETTERS 2000年第24期36卷 2007-2008页

作者： Wang, YK Tu, GF Univ Sci & Technol China Grad Sch Beijing Dept Elect Engn Beijing 100039 Peoples R China

A successive elimination algorithm for binary block matching motion estimation based on one-bit transform is presented. The principles of the proposed algorithm are mathematically formulated. Simulation results show that the proposed algorithm can significantly reduce the computation time without influencing the prediction performance.

关键词： motion estimation image matching binary block matching motion estimation successive elimination algorithm computer simulation one-bit transform

来源：评论

学校读者我要写书评

暂无评论

successive elimination algorithm for Constrained One-bit Transform Based Motion Estimation Using the Bonferroni Inequality

引用

IEEE SIGNAL PROCESSING LETTERS 2014年第10期21卷 1260-1264页

作者： Choi, Changryoul Jeong, Jechang Hanyang Univ Dept Elect & Comp Engn Seoul 133791 South Korea

The constrained one-bit transform (C1BT) was proposed to increase the motion estimation (ME) accuracy of the previous one-bit transform (1BT) especially for small motion blocks. Although making another bit-plane is very simple and efficient, its performance is even better than that of the two-bit transform (2BT) based ME. However, unlike the 1BT-based ME and the 2BT-based ME, the successive elimination algorithm (SEA) based on the triangle inequality for C1BT-based ME cannot be derived because C1BT matching error criterion does not satisfy the typical measure conditions. In this letter, a fast full-search block matching algorithm for C1BT-based ME is developed. The proposed algorithm evaluates lower bounds for constrained one-bit matching criterion based on the Bonferroni inequality to eliminate the impossible candidates faster and save computations substantially. Experimental results show that while the ME accuracy of the proposed algorithm is the same as that of the full search C1BT, the proposed algorithm reduces computational complexity significantly.

关键词： Bit-plane matching motion estimation successive elimination algorithm video coding

来源：评论

学校读者我要写书评

暂无评论

A multilevel successive elimination algorithm for block matching motion estimation

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2000年第3期9卷 501-504页

作者： Gao, XQ Duanmu, CJ Zou, CR SE Univ Dept Radio Engn Nanjing 210096 Peoples R China

An efficient algorithm is proposed to reduce the computation cost of block matching algorithms for motion estimation in video coding. Based on a new insight in block matching algorithms, we extend the successive elimination algorithm to a multilevel case. By using the sum norms of the blocks and the subblocks, tighter and tighter decision boundaries can be obtained for eliminating the search positions. The efficiency of the proposed algorithm combined with full search algorithm and several fast search algorithms is verified by simulation results.

关键词： block matching algorithm motion estimation successive elimination algorithm video coding

来源：评论

学校读者我要写书评

暂无评论

RATE DISTORTION-BASED MOTION ESTIMATION SEARCH ORDERING FOR RATE-CONSTRAINED successive elimination algorithmS

RATE DISTORTION-BASED MOTION ESTIMATION SEARCH ORDERING FOR ...

引用

IEEE International Conference on Image Processing

作者： Luc Trudeau Stephane Coulombe Christian Desrosiers Department of Software and IT Engineering Ecole de technologie superieure Universite du Quebec

ISBN: (纸本)9781479957521

In this paper, we propose a new class of search ordering algorithms to reduce the computational cost of motion estimation in video coding. We show that conventional search orderings, such as spiral search, can weaken the filtering criterion of rate-constrained successive elimination algorithms. Based on this new insight, we derive a new search ordering that takes into account the impact of the rate constraint. Our simulation results demonstrate that, on average, the amount of SAD operations required to encode the tested sequences, is reduced by 2.86%, when compared to the H.264 JM reference software's implementation of spiral search. For sequences with unpredictable motion, this reduction is greater than 5% and can exceed 10% when smaller block partitions are evaluated.

关键词： successive elimination algorithm Motion estimation H.264 Lagrange multiplier

来源：评论

学校读者我要写书评

暂无评论

The efficient optimal and suboptimal motion estimation algorithms

引用

SIGNAL IMAGE AND VIDEO PROCESSING 2015年第6期9卷 1265-1270页

作者： Paramkusam, Adapa Venkata Reddy, V. S. K. JNTUH MR Coll Engn & Technol Elect & Commun Hyderabad Andhra Pradesh India

The new fast full-search motion estimation algorithm for optimal motion estimation is proposed in this paper. This algorithm presents fast computing method that calculates the tighter boundaries faster by exploiting the computational redundancy. The proposed algorithm, first, determines the possible motion vectors (PMVs) that are not rejected by the first two tighter boundaries to facilitate the prediction of the best initial motion vector (IMV) for the follow-up search. Thereafter, an optimal motion vector (OMV) will be traced out in the PMV set. The IMV greatly helps in the early rejection of impossible candidate blocks while tracing the OMV. Experimental results show that the proposed algorithm outperforms the other previous optimal motion estimation algorithms in reducing the number of computations on several video sequences. The proposed algorithm achieves about 156-456 speed-up gain over full search on several video sequences. But, the state-of-the-art algorithms such as adaptive MSEA and Winner Update algorithm with Integral image algorithms can achieve only about 72-382 speed-up gain over full search on the same video sequences. Finally, the proposed new fast full-search motion estimation algorithm is modified to suboptimal motion estimation algorithm, resulting only in a trivial average peak signal-to-noise ratio drop of about 0.2 dB, but it achieves a very fast computational speed.

关键词： successive elimination algorithm Fast full-search motion estimation Suboptimal motion estimation

来源：评论

学校读者我要写书评

暂无评论

A partial norm based early rejection algorithm for fast motion estimation

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2005年第3期E88A卷 626-632页

作者： Hong, WG Kim, YR Oh, TM Ko, SJ Myongji Coll Dept Informat Media Engn Seodaemun Ku Seoul 120766 South Korea Myongji Coll Dept Comp Sci & Informat Seodaemun Ku Seoul 120766 South Korea Korea Univ Dept Elect Engn Sungbuk Ku Seoul 136701 South Korea

Recently, many algorithms have been proposed for fast full search motion estimation. Among them, successive elimination algorithm (SEA) and its modified algorithms significantly speed up the performance of the full search algorithm. By introducing the inequality equation between the norm and the mean absolute difference (MAD) of two matching blocks, the SEA can successively eliminate invalid candidate blocks without any loss in estimation accuracy. In this paper, we propose a partial norm based early rejection algorithm (PNERA) for fast block motion estimation. The proposed algorithm employs the sum of partial norms from several subblocks of the block. Applying the sum of partial norms to the inequality equation, we can significantly reduce the computational complexity of the full search algorithm. In an attempt to reduce the computational load further, the modified algorithms using partial norm distortion elimination (PNDE) and subsampling methods are also proposed. Experimental results show that the proposed algorithm is about 4 to 9 times faster than the original exhaustive full search, and is about 3 to 4 times faster than the SEA.

关键词： block motion estimation successive elimination algorithm halfway-stop technique partial norms

来源：评论

学校读者我要写书评

暂无评论

Content-aware fast motion estimation algorithm

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2008年第4期19卷 256-269页

作者： Chen, Yi-Wen Hsiao, Ming-Ho Chen, Hua-Tsung Liu, Chi-Yu Lee, Suh-Yin Natl Chiao Tung Univ Coll Comp Sci Hsinchu Taiwan

In this paper, we propose the Content-Aware Fast Motion Estimation algorithm (CAFME) that can reduce computation complexity of motion estimation (ME) in H.264/AVC while maintaining almost the same coding efficiency. Motion estimation can be divided into two phases: searching phase and matching phase. In searching phase.. we propose the Simple Dynamic Search Range algorithm (SDSR) based on video characteristics to reduce the number of search points (SP). In matching phase, we integrate the successive elimination algorithm (SEA) and the integral frame to develop a new SEA for H.264/AVC video compression standard, called successive elimination algorithm with Integral Frame (SEAIF). Besides, we also propose the Early Termination algorithm (ETA) to early terminate the motion estimation of current block. We implement the proposed algorithm in the reference software JM9.4 of H.264/AVC and the experimental results show that our proposed algorithm can reduce the number of search points about 93.1%, encoding time about 42%, while maintaining almost the same bitrate and PSNR. (c) 2008 Elsevier Inc. All rights reserved.

关键词： motion estimation successive elimination algorithm integral frame search range H.264/AVC SAD motion vector computational complexity

来源：评论

学校读者我要写书评

暂无评论

Fast motion estimation for surveillance video compression

引用

SIGNAL IMAGE AND VIDEO PROCESSING 2013年第6期7卷 1103-1112页

作者： Akram, Muhammad Izquierdo, Ebroul Queen Mary Univ London London England Univ Engn & Technol Lahore Pakistan

In this article, novel approaches to perform efficient motion estimation specific to surveillance video compression are proposed. These includes (i) selective (ii) tracker-based and (iii) multi-frame-based motion estimation. In selective approach, motion vector search is performed for only those frames that contain some motion activity. In another approach, contrary to performing motion estimation on the encoder side, motion vectors are calculated using information of a surveillance video tracker. This approach is quicker but for some scenarios it degrades the visual perception of the video compared with selective approach. In an effort to speed up multi-frame motion estimation, we propose a fast multiple reference frames-based motion estimation technique for surveillance videos. Experimental evaluation shows that significant reduction in computational complexity can be achieved by applying the proposed strategies.

关键词： Motion estimation Fast full search Multiple reference frames successive elimination algorithm Surveillance video Fast motion estimation

来源：评论

学校读者我要写书评

暂无评论

FAST MULTIFRAME MOTION ESTIMATION FOR SURVEILLANCE VIDEOS

FAST MULTIFRAME MOTION ESTIMATION FOR SURVEILLANCE VIDEOS

引用

IEEE International Conference on Image Processing

作者： Akram, Muhammad Izquierdo, Ebroul Queen Mary Univ London Sch Elect Engn & Comp Sci London England

ISBN: (纸本)9781424479948

We propose a fast multiple reference frames based motion estimation technique for surveillance videos. In the very first reference frame of each motion vector search, successive elimination algorithm is used to find the best motion vector in the search window. For the remaining reference frames, a difference between current and previous reference frames is performed to indentify candidate matching blocks in the current reference frame. Different block matching strategies are proposed to find the optimum motion vector. Experimental evaluation shows that significant reduction in computational complexity can be achieved by applying the proposed strategy.

关键词： motion estimation fast full search multiple reference frames successive elimination algorithm

来源：评论

学校读者我要写书评

暂无评论

A Spatial Prediction-Based Motion-Compensated Frame Rate Up-Conversion

引用

FUTURE INTERNET 2019年第2期11卷 26-26页

作者： Li, Yanli Ma, Wendan Han, Yue Xinyang Normal Univ Sch Comp & Informat Technol Xinyang 464000 Peoples R China Xinyang Normal Univ Henan Key Lab Anal & Applicat Educ Big Data Xinyang 464000 Peoples R China

In Multimedia Internet of Things (IoT), in order to reduce the bandwidth consumption of wireless channels, Motion-Compensated Frame Rate Up-Conversion (MC-FRUC) is often used to support the low-bitrate video communication. In this paper, we propose a spatial predictive algorithm which is used to improve the performance of MC-FRUC. The core of the proposed algorithm is a predictive model to split a frame into two kinds of blocks: basic blocks and absent blocks. Then an improved bilateral motion estimation is proposed to compute the Motion Vectors (MVs) of basic blocks. Finally, with the spatial correlation of Motion Vector Field (MVF), the MV of an absent block is predicted based on the MVs of its neighboring basic blocks. Experimental results show that the proposed spatial prediction algorithm can improve both the objective and the subjective quality of the interpolated frame, with a low computational complexity.

关键词： motion-compensated frame interpolation spatial correlation bilateral motion estimation successive elimination algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：