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

MapReduce analytics-based fast search algorithms

JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS 2020年第8期43卷 831-837页

作者： Wu, Ming-Te Kao Yuan Univ Dept Informat Technol Kaohsiung 82151 Taiwan

Using the motion estimation process is still one of the best technologies for video coding standards such as H.26X or MPEG-X. These standards have been supplied to video compression, but this area is still open algorithms. It can provide excellent coding efficiency while maintaining a low distortion. A new motion estimation of a full search algorithm with big data analytics in this research was proposed, which uses MapReduce analysis metrics. The developed method can not only be used to reduce the stored number of motion vectors compared with the full search algorithm but also to perform superior peak signal-to-noise ratio than other recent developed scheme, and achieve the same peak signal-to-noise ratio as the full search algorithm. Simulation exemplifies that our proposed scheme obtains better improvement than the full search algorithm and other well-known methods. The comparison of our proposed algorithms with other methods is evaluated both subjectively and qualitatively and the simulation demonstrated that our proposed method could obtain the desired reconstructed performance subjectively and objectively.

关键词： MapReduce fast search algorithms motion estimation big data analysis metrics full search algorithm block distortion measure peak signal to noise ratio mean square error Apache Hadoop map function

来源：评论

学校读者我要写书评

暂无评论

Combining Stochastic Filters with fast search Motion Estimation algorithms: Performance Analysis

Combining Stochastic Filters with Fast Search Motion Estimat...

引用

International Conference on Multimedia Computing and Systems (ICMCS)

作者： Tedmori, Sara Princess Sumaya Univ Technol Dept Comp Sci Amman Jordan

ISBN: (纸本)9781479938247

fast search motion estimation algorithms when compared to full search motion estimation algorithms often converge to a local minimum, providing a momentous reduction in computational cost. However, the motion vectors measurement process in fast search algorithms is subject to noise and matching errors. Researchers have investigated the use of mathematical tools used for stochastic estimation from noisy measurements, to seek optimal estimates. Amongst those tools, is the conventional Kalman filtering, which addresses the general problem of trying to estimate the state of a discrete-time controlled process that is governed by the linear stochastic difference. This research investigates the possible combinations of benchmark motion estimation algorithms and the Kalman filter. In this paper, the author presents an in-depth investigation and a detailed analysis on the use of the above combination, and seeks to establish conditions under which the application would be successful. Experimental results show that the above is possible only under certain conditions and constraints of certain properties of the video sequences being coded. Furthermore, a recommendation is made on when it is possible to use the adaptive Kalman filter instead of the conventional filter to enhance the motion vectors at the cost of extra complexity.

关键词： Motion Estimation Block Matching Kalman Filter Video Compression fast search algorithms

来源：评论

学校读者我要写书评

暂无评论

A Novel fast search Motion Estimation Algorithm In Video Coding

A Novel Fast Search Motion Estimation Algorithm In Video Cod...

引用

IEEE 23rd International Symposium on Industrial Electronics (ISIE)

作者： Alvar, Saeed Ranjbar Abdollahzadeh, Milad Seyedarabi, Hadi Univ Tabriz Fac Elect & Comp Engn Tabriz Iran

ISBN: (纸本)9781479923991

Full search (FS) motion estimation algorithm compares the current block with every possible block of the reference block to find the most accurate motion vector (MV) with the least matching error by the mean square error (MSE). Using FS motion estimation algorithm in real time applications is impractical because of the cumbersome computations. In order to decrease the amount of significant computation on a FS motion estimation algorithm a fast search algorithm is proposed. A fast search algorithm samples a few possible locations in a search block in order to find local minimum MSE. A fast search algorithm improves the processing time and also gives a good quality performance in terms of the quality in the reconstructed frame. The proposed fast search algorithm aims to remove computational redundancy by eliminating most highly impossible candidate locations. Experiments show that proposed algorithm reduces the computations greatly up to 99% and 22% compared to FS and diamond search (DS).

关键词： motion estimation block matching full search fast search algorithms motion vector

来源：评论

学校读者我要写书评

暂无评论

fast search Algorithm for Video Coding 9

Fast Search Algorithm for Video Coding

引用

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

作者： Jalalpour, Majid Aghagolzadeh, Ali Babol Univ Technol Fac Elect & Comp Engn Babol Sar Iran

ISBN: (纸本)9781467385398

Block-matching is the most popular technique for motion estimation / compensation in video coding standards. Full search (FS) is the most accurate and simple technique in blockmatching algorithms (BMAs) however it is impractical because of a very laborious computations. Some efficient fast algorithms were proposed to decrease the amount of computation in comparison with FS algorithm. In a fast search algorithm, the aim is to limit the search points while the result must be as close as possible to FS result. The proposed algorithm in this paper intends to reduce the computational cost by targeting most possible locations that may lead to achieve minimum block distortion (MBD). The simulation results show that the proposed algorithm decrease the number of calculations (up to 24%) in comparison with Diamond search while it achieves even higher PSNR for most of standard video sequences.

关键词： block-matching fast search algorithms Diamond search motion estimation

来源：评论

学校读者我要写书评

暂无评论

Design methodology for on-chip bus architectures using system-on-chip network protocol

引用

IET CIRCUITS DEVICES & SYSTEMS 2012年第2期6卷 85-94页

作者： Lee, J. Korea Natl Univ Transportat Dept Elect Engn Seoul South Korea

As the number of IP cores that can be integrated into a single chip has increased significantly in recent years, various types of multi-layered bus architectures are now being used. However, a reckless use of bus layers may lead to an excessive number of wires and low-resource utilisation. To reduce such waste, researches have studied automated on-chip bus design methods for optimal architecture synthesis. This study expands the existing studies in two aspects. First, it considers all possible topologies and redefines the existing exploration problem, whereas the existing studies assume only a few types of topologies. Second, the study includes an exploration process based on a new on-chip bus protocol, system-on-chip network protocol (SNP), as well as processes based on existing protocols to solve the redefined problem. After the time complexity is investigated, it is found that the problem is NP-hard. Accordingly, this study proposes fast search algorithms that can be applied to each of the exploration steps. The proposed algorithms are implemented as a software program of exploration. The overall reduction ratio of the time complexity reaches about three millionths, with a maximal 16% increase in communication time (CT). Considering todays design life cycle, this seems to be a good trade-off.

关键词： life cycle design software program optimal architecture synthesis NP-hard problem fast search algorithms computational complexity on-chip bus protocol search problems system-on-chip automated on-chip bus design methods system-on-chip network protocol IP cores protocols communication time time complexity on-chip bus architectures integrated circuit design wires low-resource utilisation system buses multilayered bus architectures

来源：评论

学校读者我要写书评

暂无评论

Improvement of correlation-based centroiding methods for point source Shack-Hartmann wavefront sensor

引用

OPTICS COMMUNICATIONS 2018年 411卷 187-194页

作者： Li, Xuxu Li, Xinyang Wang, Caixia Chinese Acad Sci Inst Opt & Elect Key Lab Adapt Opt Chengdu 610209 Sichuan Peoples R China Univ Chinese Acad Sci Beijing 100039 Peoples R China

This paper proposes an efficient approach to decrease the computational costs of correlation-based centroiding methods used for point source Shack-Hartmann wavefront sensors. Four typical similarity functions have been compared, i.e. the absolute difference function (ADF), ADF square (ADF(2)), square difference function (SDF), and cross-correlation function (CCF) using the Gaussian spot model. By combining them with fast search algorithms, such as three-step search (TSS), two-dimensional logarithmic search (TDL), cross search (CS), and orthogonal search (OS), computational costs can be reduced drastically without affecting the accuracy of centroid detection. Specifically, OS reduces calculation consumption by 90%. A comprehensive simulation indicates that CCF exhibits a better performance than other functions under various light-level conditions. Besides, the effectiveness of fast search algorithms has been verified. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Shack-Hartmann wavefront sensor Centroiding methods Correlation methods Point source fast search algorithms

来源：评论

学校读者我要写书评

暂无评论

Reconfigurable architectures and processors for real-time video motion estimation

引用

JOURNAL OF REAL-TIME IMAGE PROCESSING 2007年第4期2卷 191-205页

作者： Dias, Tiago Roma, Nuno Sousa, Leonel Ribeiro, Miguel INESC ID IST SiPS P-1000029 Lisbon Portugal INESC ID ISEL SiPS P-1000029 Lisbon Portugal INESC ID SiPS P-1000029 Lisbon Portugal

With the recent proliferation of multimedia applications, several fast block matching motion estimation algorithms have been proposed in order to minimize the processing time in video coding. While some of these algorithms adopt pre-defined search patterns that directly reflect the most probable motion structures, other data-adaptive approaches dynamically configure the search pattern to avoid unnecessary computations and memory accesses. Either of these approaches leads to rather difficult hardware implementations, due to their configurability and adaptive nature. As a consequence, two different but quite configurable architectures are proposed in this paper. While the first architecture reflects an innovative mechanism to implement motion estimation processors that support fast but regular search algorithms, the second architecture makes use of an application specific instruction set processor (ASIP) platform, capable of implementing most data-adaptive algorithms that have been proposed in the last few years. Despite their different natures, these two architectures provide highly configurable hardware platforms for real-time motion estimation. By considering a wide set of fast and adaptive algorithms, the efficiency of these two architectures was compared and several motion estimators were synthesized in a Virtex-II Pro XC2VP30 FPGA from Xilinx, integrated within a ML310 development platform. Experimental results show that the proposed architectures can be easily reconfigured in run-time to implement a wide set of real-time motion estimation algorithms.

关键词： Motion estimation fast search algorithms Video coding Reconfigurable devices Application specific instruction set processors

来源：评论

学校读者我要写书评

暂无评论

Adaptive motion estimation algorithm for H.264/AVC

Adaptive motion estimation algorithm for H.264/AVC

引用

15th International Conference on Digital Signal Processing

作者： Momcilovic, Svetislay Roma, Nuno Sousa, Leonel Univ Tecn Lisboa INESC ID Rua Alves Redol 9 P-1000029 Lisbon Portugal

ISBN: (纸本)9781424408818

A new adaptive motion estimation algorithm is proposed ill this paper. When compared with other fast search approaches. such as the H.264/AVC oriented EPZS algorithm, this algorithm significantly speeds Lip the motion estimation procedure and Substantially decreases the memory requirements. Moreover, it also makes use of significantly fewer memory accesses, still maintaining its coding quality performances in what concerns both the obtained bit rate and PSNR. As a consequence, the proposed algorithm proves to be specially adequate to be implemented in most embedded systems with restricted computational and power requirements that are often adopted by portable and battery supplied devices.

关键词： video coding motion estimation fast search algorithms

来源：评论

学校读者我要写书评

暂无评论

fast algorithms for the estimation of motion vectors

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 1999年第3期8卷 435-438页

作者： Wang, HS Mersereau, RM Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA

In this correspondence, a fast motion estimation algorithm, based on the successive elimination algorithm (SEA) of Li and Salari [1], is studied. This fast motion estimation algorithm finds the same displacement vectors as the exhaustive search algorithm with a reduced computational load. A modified fast motion estimation algorithm introducing negligible distortion into a transform coder, but providing for a further computational load reduction, is developed. Implementation issues are also discussed and compared. Results show that the number of searching operations can be reduced dramatically with the help of fast motion estimation algorithms.

关键词： fast search algorithms motion vectors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：