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

2nd International Conference on Computer Communications Control Technology

作者： Hamid, N. A. Darsono, A. M. Manap, N. A. Manap, R. A. Sulaiman, H. A. Univ Teknikal Malaysia Melaka Fac Elect & Comp Engn Melaka Malaysia

ISBN: (纸本)9781479979523

Implementation of the block matching algorithm (BMA) in a series of video codecs is due to its simplicity and high compression efficiency. Due to this, many fast search methods of BMAs are being introduced to increase the efficiency of the Motion Estimation process. This paper proposed a new algorithm, namely Adaptive Diamond Orthogonal Search algorithm (ADOS) which employs three different search pattern for its two main stages.. At initial step, an additional step is added to predetermine static block to further speed up the search process as it is beneficial to small motion video sequence contents. The performances of the ADSS are being compared with three selected established algorithms, namely Full Search (FS), Diamond Search (DS) and Hexagon-Diamond Search (HDS). Based on the simulation result, the proposed algorithm yields fewer search points while maintaining close video quality performance with other algorithms.

关键词： adaptive search diamond search pattern orthogonal search pattern motion estimation fast block matching algorithm

来源：评论

学校读者我要写书评

暂无评论

Modifying ARPS Method by Use of Global Motion Information for fast and Precise Motion Estimation 9

Modifying ARPS Method by Use of Global Motion Information fo...

引用

9th Iranian Conference on Machine Vision and Image Processing (MVIP)

作者： Fani, Mehrnaz Ghofrani, Fatemeh Yazdi, Mehran Shiraz Univ Sch Elect & Comp Engn Dept Commun & Elect Shiraz Iran

ISBN: (纸本)9781467385398

In this article we introduce a novel motion estimation method for video sequences. Proposed method can be employed as a part of video encoders, and decoders to increase the compression ratio, and decrease the temporal redundancies. In the presented method, first a global motion vector is computed for each frame, by use of a fast procedure. This step is in fact, the key to the whole algorithm, because its result affects the accuracy and computational load of the next steps. The obtained motion vector is then directly attributed to the blocks with the global motion. To deal with the blocks whose motions are not equal to the global motion, a fast-search method, dubbed M-ARPS (M-ARPS), is suggested. Finally, by performing thorough experiments we demonstrate the supremacy of the proposed method in relation to some popular block-based motion estimation algorithms.

关键词： fast block matching algorithm Global motion estimation ARPS GMI_M-ARPS

来源：评论

学校读者我要写书评

暂无评论

Modifying ARPS method by use of global motion information for fast and precise motion estimation

Modifying ARPS method by use of global motion information fo...

引用

Iranian Machine Vision and Image Processing (MVIP)

作者： Mehrnaz Fani Fatemeh Ghofrani Mehran Yazdi Dept. of Communications and Electronics Shiraz University Shiraz Iran

关键词： ARPS fast block matching algorithm GMI M-ARPS Global motion estimation motion estimation motion vector fasting compression ratio

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Orthogonal - Diamond Search algorithm for Motion Estimation 1

Performance Analysis of Orthogonal - Diamond Search Algorith...

引用

1st International Symposium on Technology Management and Emerging Technologies (ISTMET)

作者： Hamid, N. A. Darsono, A. M. Manap, N. A. Manap, R. A. Sulaiman, H. A. Univ Tekn Malaysia Melaka Fac Elect & Comp Engn Melaka Malaysia

ISBN: (纸本)9781479937042

In recent years, many fast block matching algorithm or known as BMA have been proposed and developed in order to reduce the computational cost while maintaining the quality of the video signal. In this paper, the algorithm proposed is called Orthogonal-Diamond Search (ODS) which employs an orthogonal-shaped search pattern in the first step and then is switched into diamond-shaped search pattern for the next step. The proposed algorithm and several established algorithms namely Three Step Search (TSS), New-Three-Step Search (NTSS), Four-Step Search (4SS), Diamond Search (DS) and Hexagon-Diamond Search (HDS) are implemented using MATLAB and their performance are being compared and analyzed in terms of number of search point, peak signal-to-noise ratio (PSNR) and computational complexity. Simulation result show that the proposed algorithm can find motion vector with fever number of search points while maintains close performance of video quality with other selected algorithms.

关键词： Motion Estimation fast block matching algorithm Orthogonal Diamond Search

来源：评论

学校读者我要写书评

暂无评论

A New Orthogonal - Diamond Search algorithm for Motion Estimation 1

A New Orthogonal - Diamond Search Algorithm for Motion Estim...

引用

1st International Conference on Computer, Communications, and Control Technology (I4CT)

作者： Hamid, N. A. Darsono, A. M. Manap, N. A. Manap, R. A. Sulaiman, H. A. Univ Tekn Malaysia Melaka Fac Elect & Comp Engn Ctr Telecommun Res & Innovat CeTRI Melaka Malaysia

ISBN: (纸本)9781479945559

Many fast block matching algorithm or BMA have been proposed and developed in recent years in order to reduce the computational cost while maintaining the quality of the video signal. In this paper, a new Orthogonal-Diamond Search (ODS) is proposed which employs an orthogonal-shaped search pattern in the first step and then is switched into small diamond-shaped search pattern for the next step. The proposed algorithm and several established algorithms, namely Full Search (FS), Three-Step Search (TSS) and Diamond Search (DS) are implemented using MATLAB and their performance are being compared and analyzed in terms of computational complexity, peak signal-to-noise ratio (PSNR), and number of search points. Simulation result shows that the proposed algorithm can find motion vector with fewer number of search points while maintains close performance of video quality with other selected algorithms.

关键词： Motion Estimation fast block matching algorithm Orthogonal Diamond Search

来源：评论

学校读者我要写书评

暂无评论

High Efficiency Architecture Design of Real-Time QFHD for H.264/AVC fast block Motion Estimation

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2011年第11期21卷 1646-1658页

作者： Tsai, Tsung-Han Pan, Yu-Nan Natl Cent Univ Dept Elect Engn Tao Yuan 32001 Taiwan

Motion estimation (ME) in the MPEG-4 AVC/JVT/H. 264 video coding standard employs seven permitted block sizes to improve the rate-distortion performance. This novel feature achieves significant coding gain over coding a macroblock using the fixed block size. However, ME is computationally intensive with the complexity increasing linearly with the number of the allowed block sizes. This paper presents an architecture for a combined fast ME algorithm with the predict hexagon search (PHS) and the edge information mode decision (EIMD). The EIMD algorithm utilizes edge information to predict the best block size quickly and precisely. The PHS algorithm searches the best motion vector efficiently. The analytical results reveal that the EIMD+PHS algorithm is 2.4-25 times faster than other popular fast ME algorithms. Additionally, the EIMD+PHS algorithm is 600-2000 times faster than JM10.2, and the peak signal-to-noise ratio degradation is less than 0.15 dB. The proposed architecture applies a large search range and low operation frequency as compared with other popular ME architectures. The proposed architecture only needs 19.4 MHz operating frequency to achieve real-time execution for the general specification of the standard-definition television (720 x 480) used with four reference frames and the search range of 256 x 256. The proposed architecture only requires 116.6 MHz operating frequency to achieve real-time execution for the ultrahigh specification of the quad full high definition (3840 x 2160) used with one reference frame and the search range of 256 x 256. The gate count of the proposed architecture is 300 K, and the memory usage is 12.6 kB.

关键词： fast block matching algorithm H.264 high efficiency architecture motion estimation QFHD

来源：评论

学校读者我要写书评

暂无评论

A novel 3-D predict hexagon search algorithm for fast block motion estimation on H.264 video coding

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2006年第12期16卷 1542-1549页

作者： Tsai, Tsung-Han Pan, Yu-Nan Natl Cent Univ Dept Elect Engn Chungli 300 Taiwan

In the upcoming video coding standard MPEG-4 AVC/JVT/H.264, motion estimation is allowed to use multiple references and multiple block sizes to improve the rate-distortion performance. However, full exhaustive search of all block sizes is computational intensive with complexity increasing linearly to the number of allowed reference frames and block sizes. In block motion estimation, a search pattern with a different shape or size has a very important impact on search speed and distortion performance. Based on an in-depth examination for the influence of search pattern on speed performance, a novel search algorithm, three-dimensional predict hexagon search (3DPHS), is proposed in this paper. The 3DPHS depends on the characteristics of motion vector distribution;it can predict the object movement in horizontal and vertical direction with a novel search pattern. The proposed algorithm also considers the characteristics of multiple reference frames and multiple block sizes in H.264. The analysis results show that the speed improvement of 3DPHS over some popular fast search algorithms is about 25%-75%. The compression quality is almost the same compared with Full Search.

关键词： fast block matching algorithm H.264 motion estimation

来源：评论

学校读者我要写书评

暂无评论

A fast block matching motion estimation algorithm using optimal search patterns

A fast block matching motion estimation algorithm using opti...

引用

Conference on Visual Communications and Image Processing 2001

作者： Lim, DK Ho, YS Kwangju Inst Sci & Technol Kwangju 500712 South Korea

ISBN: (纸本)0819439886

For video compression, motion estimation is popularly employed to exploit temporal correlation existing in video sequences. If we employ the full search block matching algorithm for estimating motion vectors, it requires very heavy computational complexity. Although several fast block matching algorithms have been proposed to solve this problem, they sacrifice their reconstructed image quality. In this paper, we derive optimal search patterns for fast block matching motion estimation. By analyzing the block matching algorithm as a function of the block size and the shape, we find optimal search patterns for initial motion estimation. The proposed idea can provide an analytical ground for the current MPEG-2 proposals. In addition, we propose a new fast motion estimation algorithm using adaptive search patterns, considering matching criteria and statistical properties of object displacement. In order to select an appropriate search pattern, we exploit the relationship between the motion vector and the frame difference of each block. By changing the search pattern adaptively, we can improve the motion prediction accuracy, while reducing the required computational complexity compared to other fast block matching algorithms.

关键词： motion estimation fast block matching algorithm diamond search advanced zonal search

来源：评论

学校读者我要写书评

暂无评论

Feature-bit-plane matching technique for estimation of motion vectors

引用

ELECTRONICS LETTERS 1998年第11期34卷 1090-1091页

作者： Zhang, JJ Ahmad, MO Swamy, MNS Concordia Univ Dept Elect & Comp Engn Ctr Commun & Signal Proc Montreal PQ H3G 1M8 Canada

The authors describe a fast block matching algorithm based on a feature-bit-plane matching scheme in which two types of transformed planes characterising the spatial distribution of pixel intensities of a frame are employed. Simulation results show that this method provides a prediction accuracy similar to that of the full-search method, while requiring only similar to 10% of the computation needed by the latter.

关键词： motion estimation fast block matching algorithm motion vectors estimation feature-bit-plane matching technique Computational complexity Optical information, image and video signal processing Pattern recognition Computer vision and image processing techniques image matching computational complexity

来源：评论

学校读者我要写书评

暂无评论

FEATURE-BASED block matching algorithm USING INTEGRAL PROJECTIONS

引用

ELECTRONICS LETTERS 1989年第1期25卷 29-30页

作者： KIM, JS PARK, RH Sogang Univ. Seoul South Korea

A fast block matching algorithm using integral projections for the estimation of motion vectors is proposed. In the calculation of the cost function, the proposed algorithm using integral projections as features can reduce the motion estimation computations by a factor of 3 by converting the operations of two-dimensional arrays into those of one-dimensional arrays. Also, the proposed method is not sensitive to additive noise. Simulation results based on the sequence of original image and the sequences of noisy image with different standard deviation are presented.

关键词： 1D arrays 2D arrays computational complexity computerised picture processing estimation of motion vectors fast block matching algorithm feature based block matching algorithm integral projections motion estimation computations noise insensitive method video signals

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：