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

IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

作者： Glentis, G. O. Jakobsson, A. Angelopoulos, K. Univ Peloponnese Dept Informat & Telecommun Sparti Greece Lund Univ Dept Math Stat Lund Sweden

ISBN: (纸本)9781479928934

In this work, we examine a computationally efficient block-updating scheme for estimating the spectral content of signals with missing samples. The work is an extension of our recent single-sample data interpolation updating of the Iterative Adaptive Approach (IAA), being reformulated to incorporate blocks of samples. The proposed implementation offers a substantial complexity reduction as compared to earlier presented updating schemes, without sacrificing the quality of the resulting spectral estimates more than marginally (if at all).

关键词： Spectrum estimation theory and methods Iterative Adaptive Approach (IAA) fast algorithms

来源：评论

学校读者我要写书评

暂无评论

Low-complexity multiplierless DCT approximations for low-power HEVC digital IP cores

Low-complexity multiplierless DCT approximations for low-pow...

引用

Geospatial InfoFusion and Video Analytics IV and Motion Imagery for ISR and Situational Awareness II

作者： Kulasekera, Sunera C. Madanayake, Arjuna Cintra, Renato J. Bayer, Fabio M. Potluri, Uma Univ Akron Dept Elect Engn Akron OH 44325 USA Univ Fed Pernambuco Dept Estatist Recife PE Brazil Univ Fed Santa Maria Dept Estatist Santa Maria RS Brazil Univ Fed Santa Maria LACESM Santa Maria RS Brazil

ISBN: (纸本)9781628410266

Image and video compression plays a major role in multimedia transmission. Specifically the discrete cosine transform (DCT) is the key tool employed in a vast variety of compression standards such as H.265/HEVC due to its remarkable energy compaction properties. Rapid growth in digital imaging applications, such as multimedia and automatic surveillance that operates with limited bandwidths has led to extensive development of video processing systems. The main objective of this paper is to discuss some DCT approximations equipped with fast algorithms which require minimum addition operations and zero multipliers or bit-shifting operations leading to significant reductions in chip area and power consumption compared to conventional DCT algorithms. We provide complete design details for several k x k, k = 8, 16 blocked 2-D algorithms for DCT computation with video evaluation using HEVC software encoder. Custom digital architectures are proposed, simulated and implemented on Xilinx FPGAs and verified in conjunction with software models.

关键词： Approximate DCT fast algorithms HEVC FPGA

来源：评论

学校读者我要写书评

暂无评论

Constant Geometry algorithms for Galois Field Expressions and Their Implementation on GPUs

Constant Geometry Algorithms for Galois Field Expressions an...

引用

44th IEEE International Symposium on Multiple-Valued Logic (ISMVL)

作者： Stankovi, Radomir S. Astola, Jaakko T. Moraga, Claudio Gajic, Dusan B. Fac Elect Engn Dept Comp Sci Nish 18000 Serbia Tampere Univ Technol Inst Signal Proc FIN-33101 Tampere Finland European Ctr Soft Comp Mieres 33600 Spain TU Dortmund Univ D-44221 Dortmund Germany

ISBN: (纸本)9781479935345

Galois field (GF) expressions are analytical representations of multiple-valued functions. For practical applications it is important to provide fast algorithms for computing coefficients in these expressions. From the FFT-theory point of view, these algorithms are Cooley-Tukey type algorithms based on the Good-Thomas factorization derived from the Kronecker product structure of the GF-transform matrices. These algorithms are good for reducing the number of operations in Central Processing Unit (CPU) implementations. When implemented over Graphics Processing Units (GPUs), the address arithmetic becomes an important factor determining the efficiency of the implementations, due to the differences between the CPU and GPU based architectures and the corresponding programming philosophies. In this paper, we define the constant geometry algorithms for computing the coefficients in GF-expressions by an analogy with the corresponding algorithms in Fourier analysis on finite Abelian groups. We performed an experimental verification of the proposed algorithms compared to the Cooley-Tukey algorithms over two GPU platforms (Nvidia and AMD) and two programming environments (CUDA and OpenCL) with the corresponding CPU implementations. The speedup achieved by constant geometry algorithms increases with the number of variables and, therefore, the constant geometry algorithms are more advantageous in the case of functions with a larger number of variables.

关键词： fast algorithms Galois field expressions GPU computing Spectral transforms

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT SPECTRAL ANALYSIS IN THE MISSING DATA CASE USING SPARSE ML METHODS 22

EFFICIENT SPECTRAL ANALYSIS IN THE MISSING DATA CASE USING S...

引用

22nd European Signal Processing Conference (EUSIPCO)

作者： Glentis, George-Othon Karlsson, Johan Jakobsson, Andreas Li, Jian Univ Peloponnese Dept Informat & Telecommun Tripoli Greece KTH Royal Inst Technol Dept Math Stockholm Sweden Lund Univ Dept Math Stat S-22100 Lund Sweden Univ Florida Dept Elect & Comp Engn Gainesville FL 32611 USA

ISBN: (纸本)9780992862619

Given their wide applicability, several sparse high-resolution spectral estimation techniques and their implementation have been examined in the recent literature. In this work, we further the topic by examining a computationally efficient implementation of the recent SMLA algorithms in the missing data case. The work is an extension of our implementation for the uniformly sampled case, and offers a notable computational gain as compared to the alternative implementations in the missing data case.

关键词： Spectral estimation theory and methods Sparse Maximum Likelihood methods fast algorithms

来源：评论

学校读者我要写书评

暂无评论

fast BI-PARTITION MODE SELECTION FOR 3D HEVC DEPTH INTRA CODING

FAST BI-PARTITION MODE SELECTION FOR 3D HEVC DEPTH INTRA COD...

引用

IEEE International Conference on Multimedia and Expo

作者： Zhouye Gu Jianhua Zheng Nam Ling Philipp Zhang Santa Clara University Hisilicon Technologies

ISBN: (纸本)9781479947607

This paper proposes a fast mode decision algorithm for 3D High Efficiency Video Coding (3D-HEVC) depth intra coding. In the current 3D-HEVC design, it is observed that for most of the cases, full Rate-Distortion (RD) cost search of Bi-partition mode could be skipped since most coding units (CUs) of depth map are very flat or smooth while Bi-partition modes are designed for CUs with edge or sharp transition. Using the rough RD cost value calculated by HEVC Rough Mode Decision as a selection threshold, we propose a fast Bi-partition modes selection algorithm to speed up the encoding process. The test result for the proposed fast algorithm reports 34.4% encoding time saving with 0.3% bitrate increasing on synthesized view for All-Intra test case. Moreover, by simply varying the selection threshold, we can make a tradeoff between encoding time saving and bitrate loss based on the requirement of different applications.

关键词： Video Coding 3D-HEVC Bi-Partition mode Intra Coding fast algorithms

来源：评论

学校读者我要写书评

暂无评论

Quantum Calculations in Solution for Large to Very Large Molecules: A New Linear Scaling QM/Continuum Approach

引用

JOURNAL OF PHYSICAL CHEMISTRY LETTERS 2014年第6期5卷 953-958页

作者： Lipparini, Filippo Lagardere, Louis Scalmani, Giovanni Stamm, Benjamin Cances, Eric Maday, Yvon Piquemal, Jean-Philip Frisch, Michael J. Mennucci, Benedetta Univ Paris 06 Univ Sorbonne Lab Jacques Louis Lions UMR 7598 F-75005 Paris France Univ Paris 06 Univ Sorbonne Lab Chim Theor UMR 7616 F-75005 Paris France Univ Paris 06 Univ Sorbonne Inst Calcul & Simulat F-75005 Paris France Gaussian Inc Wallingford CT 06492 USA CNRS UMR 7598 & 7616 F-75005 Paris France Univ Paris Est CERMICS Ecole Ponts F-77455 Marne La Vallee 2 France Univ Paris Est INRIA F-77455 Marne La Vallee 2 France Inst Univ France Paris France Brown Univ Div Appl Maths Providence RI 02912 USA Univ Pisa Dipartimento Chim & Chim Ind I-56126 Pisa Italy

We present a new implementation of continuum solvation models for semiempirical Hamiltonians that allows the description of environmental effects on very large molecular systems. In this approach based on a domain decomposition strategy of the COSMO model (ddCOSMO), the solution to the COSMO equations is no longer the computational bottleneck but becomes a negligible part of the overall computation time. In this Letter, we analyze the computational impact of COSMO on the solution of the SCF equations for large to very large molecules, using semiempirical Hamiltonians, for both the new ddCOSMO implementation and the most recent, linear scaling one, based on the fast multipole method. A further analysis is on the simulation of the UV/visible spectrum of a light-harvesting pigment-protein complex. All of the results show how the new ddCOSMO algorithm paves the way to routine computations for large molecular systems in the condensed phase.

关键词： computational spectroscopy continuum solvation domain decomposition fast algorithms multiscale methods quantum chemistry

来源：评论

学校读者我要写书评

暂无评论

fast exhaustive-search equivalent pattern matching through norm ordering

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2013年第5期24卷 592-601页

作者： Yousef, Mohamed Hussain, Khaled F. Assiut Univ Fac Comp & Informat Assiut Egypt

Pattern matching is a fundamental problem in computer vision, and image and video processing. Exhaustive-search equivalent algorithms yield the same results as exhaustively searching all patterns in the image but significantly faster. In this paper, we propose a novel exhaustive-search equivalent algorithm that is combined with a number of state-of-art algorithms to provide a significantly faster alternative in the problem of finding nearest pattern according to a predefined distance measure. Our technique also shows high resilience to both blurring and JPEG compression types of noise. This is demonstrated in the paper with results from over 15 million runs for each compared algorithm. (C) 2013 Elsevier Inc. All rights reserved.

关键词： Pattern matching Template matching fast algorithms Full search equivalent algorithm NOM Evaluation order Nearest Neighbor Image processing

来源：评论

学校读者我要写书评

暂无评论

Number-theoretic properties of hyperelliptic fields and the torsion problem in Jacobians of hyperelliptic curves over the rational number field

引用

RUSSIAN MATHEMATICAL SURVEYS 2014年第1期69卷 1-34页

作者： Platonov, V. P. Russian Acad Sci Res Inst Syst Studies Moscow 117901 Russia Russian Acad Sci Steklov Math Inst Moscow 117901 Russia

In the past four years a theory has been developed for finding fundamental units in hyperelliptic fields, and on basis of this theory innovative and efficient algorithms for computing them have been constructed and implemented. A new local-global principle was discovered which gives a criterion for the existence of non-trivial units in hyperelliptic fields. The natural connection between the problem of computing fundamental units and the problem of torsion in Jacobian varieties of hyperelliptic curves over the rational number field has led to breakthrough results in the solution of this problem. The main results in the present survey were largely obtained using a symbiosis of deep theory, efficient algorithms, and supercomputing. Such a symbiosis will play an ever increasing role in the mathematics of the 21st century.

关键词： fundamental units hyperelliptic fields local-global principle Jacobian varieties hyperelliptic curves torsion problem in Jacobians fast algorithms continued fractions

来源：评论

学校读者我要写书评

暂无评论

A novel extension of the SB-FFT: Sub-segment inverse fast Fourier transform (SS-IFFT) with different applications

引用

JOURNAL OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING 2013年第3-4期13卷 361-375页

作者： Hossen, Abdulnasir Heute, Ulrich Sultan Qaboos Univ Dept Elect & Comp Engn Muscat Oman Univ Kiel Inst Network & Syst Theory Kiel Germany

In this paper we present a new fast approximate inverse FFT for short-time signal applications. This approach is derived from the sub-band FFT (SB-FFT) and it is called Sub-Segment IFFT (SS-IFFT). SS-IFFT uses the idea of decomposing the input signal into two segments (early and late) according to their order of occurence in time. An approximation can be done by implementing the IFFT of one of the two-segments according to a pre-known information about the time-domain characteristics of the signal. Such an approximation leads to fast computation at the cost of less accuracy. Both the reduction in complexity and the approximation errors of the new algorithm are investigated in this paper. The SS-IFFT has an adaptive capability like the forward SB-FFT. The idea of SS-IFFT is extended also to the two dimensional case. The algorithm is also tested by using different filters other than the Hadamard filters used in the SB-FFT. Different applications of the new technique are included in speech analysis, echo detection, FIR filter design, and ECG compression.

关键词： fast algorithms SB-FFT SS-IFFT complexity approximation errors different wavelets filters speech analysis echo detection FIR filters design ECG compression

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT SPECTRAL ANALYSIS IN THE MISSING DATA CASE USING SPARSE ML METHODS

EFFICIENT SPECTRAL ANALYSIS IN THE MISSING DATA CASE USING S...

引用

European Signal Processing Conference

作者： George-Othon Glentis Johan Karlsson Andreas Jakobsson Jian Li Dept. of Informatics and Telecommunications University of Peloponnese Dept. of Mathematics KTH Royal Institute of Technology Dept. of Mathematical Statistics Lund University Dept. of Electrical and Computer Engineering University of Florida

ISBN: (纸本)9781479946037

关键词： Spectral estimation theory and methods Sparse Maximum Likelihood methods fast algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：