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

Fast and Accurate Generalized Harmonic Analysis and Its Parallel Computation by GPU

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2009年第3期E92A卷 745-752页

作者： Noda, Hisayori Nishihara, Akinori Tokyo Inst Technol Dept Commun & Integrated Syst Tokyo 1528550 Japan

A fast and accurate method for Generalized Harmonic Analysis is proposed. The proposed method estimates the parameters of a sinusoid and subtracts it from a target signal one by one. The frequency of the sinusoid is estimated around a peak of Fourier spectrum using binary search. The binary search can control the trade-off between the frequency accuracy and the computation time. The amplitude and the phase ate estimated to minimize the squared SUM of the residue after extraction of estimated sinusoids front the target signal. Sinusoid parameters are recalculated to reduce errors introduced by the peak detection using windowed Discrete-Time Fourier Transform. Audio signals are analyzed by the proposed method. which confirms the accuracy compared to existing methods. The proposed algorithm has high degree of concurrency and is suitable to he implemented on graphical processing unit (GPU). The computational throughput can be made higher than the input audio signal rate.

关键词： generalized harmonic analysis graphical processing unit

来源：评论

学校读者我要写书评

暂无评论

Real-time feature-based image morphing for memory-efficient impostor rendering and animation on GPU

引用

VISUAL COMPUTER 2013年第2期29卷 131-140页

作者： Yuksel, Kamer Ali Yucebilgin, Alp Balcisoy, Selim Ercil, Aytul Sabanci Univ Fac Engn & Nat Sci Istanbul Turkey Univ Calif Santa Barbara Dept Comp Sci Eyes Lab 4 Santa Barbara CA 93106 USA Sabanci Univ Comp Sci & Engn Program Istanbul Turkey Univ Calif Santa Barbara Comp Sci Program Santa Barbara CA 93106 USA

Real-time rendering of large animated crowds consisting of thousands of virtual humans is important for several applications including simulations, games, and interactive walkthroughs but cannot be performed using complex polygonal models at interactive frame rates. For that reason, methods using large numbers of precomputed image-based representations, called impostors, have been proposed. These methods take advantage of existing programmable graphics hardware to compensate for computational expense while maintaining visual fidelity. Thanks to these methods, the number of different virtual humans rendered in real time is no longer restricted by computational power but by texture memory consumed for the variety and discretization of their animations. This work proposes a resource-efficient impostor rendering methodology that employs image morphing techniques to reduce memory consumption while preserving perceptual quality, thus allowing higher diversity or resolution of the rendered crowds. Results of the experiments indicated that the proposed method, in comparison with conventional impostor rendering techniques, can obtain 38 % smoother animations or 87 % better appearance quality by reducing the number of key-frames required for preserving the animation quality via resynthesizing them with up to 92 % similarity on real time.

关键词： Crowd simulation Impostor rendering Image and view morphing graphical processing unit

来源：评论

学校读者我要写书评

暂无评论

Efficient 3D DNS of gas-solid flows on Fermi GPGPU

引用

COMPUTERS & FLUIDS 2012年 70卷 86-94页

作者： Xiong, Qingang Li, Bo Xu, Ji Wang, Xiaowei Wang, Limin Ge, Wei Chinese Acad Sci Inst Proc Engn State Key Lab Multiphase Complex Syst Beijing 100190 Peoples R China Chinese Acad Sci Grad Univ Beijing 100049 Peoples R China

Three-dimensional (3D) gas-solid Direct Numerical Simulation (DNS) requires huge computational resources which imposes a great challenge to both current hardware and software conditions. In this article, an efficient implementation of 3D gas-solid DNS with Lattice Boltzmann Method and Discrete Element Method is developed on a Fermi GPGPU. An Immersed Moving Boundary approach is utilized to impose the no-slip condition at particle-fluid interfaces. Optimization strategies such as changing the sequence of collision and propagation in grid evolution and making multiple kernel executing concurrently are discussed in detail. This algorithm is demonstrated to be competitive both in terms of accuracy and performance. Approximately 131 Millions of Lattices Update Per Second have been achieved, indicating that this GPGPU implementation is very suitable for 3D gas-solid DNS. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Lattice Boltzmann Method Immersed Moving Boundary Direct Numerical Simulation graphical processing unit Gas-solid flows CUDA

来源：评论

学校读者我要写书评

暂无评论

Development of a CUDA Implementation of the 3D FDTD Method

引用

IEEE ANTENNAS AND PROPAGATION MAGAZINE 2012年第5期54卷 186-195页

作者： Livesey, Matthew Stack, James Francis, Jr. Costen, Fumie Nanri, Takeshi Nakashima, Norimasa Fujino, Seiji Accenture Manchester M90 4AN Lancs England Remcom Inc State Coll PA 16823 USA Univ Manchester Sch Elect & Elect Engn Manchester M13 9PL Lancs England RIKEN Biores Infrastruct Construct Team Adv Technol Support Div Adv Sci Inst Wako Saitama 3510198 Japan Kyushu Univ Res Inst Informat Technol Higashi Ku Fukuoka 8128581 Japan Fukuoka Inst Technol Fac Informat Engn Higashi Ku Fukuoka 8110295 Japan

The use of general-purpose computing on a GPU is an effective way to accelerate the FDTD method. This paper introduces flexibility to the theoretically best available approach. It examines the performance on both Tesla- and Fermi-architecture GPUs, and identifies the best way to determine the GPU parameters for the proposed method.

关键词： Finite difference methods time domain analysis hardware acceleration high performance computing parallel programming parallel architectures GPU graphical processing unit

来源：评论

学校读者我要写书评

暂无评论

Level-set segmentation of pulmonary nodules in megavolt electronic portal images using a CT prior

引用

MEDICAL PHYSICS 2010年第11期37卷 5703-5710页

作者： Schildkraut, J. S. Prosser, N. Savakis, A. Gomez, J. Nazareth, D. Singh, A. K. Malhotra, H. K. Carestream Hlth Inc Rochester NY 14615 USA Rochester Inst Technol Rochester NY 14623 USA Roswell Pk Canc Ctr Buffalo NY 14263 USA

Purpose: Pulmonary nodules present unique problems during radiation treatment due to nodule position uncertainty that is caused by respiration. The radiation field has to be enlarged to account for nodule motion during treatment. The purpose of this work is to provide a method of locating a pulmonary nodule in a megavolt portal image that can be used to reduce the internal target volume (ITV) during radiation therapy. A reduction in the ITV would result in a decrease in radiation toxicity to healthy tissue. Methods: Eight patients with nonsmall cell lung cancer were used in this study. CT scans that include the pulmonary nodule were captured with a GE Healthcare LightSpeed RT 16 scanner. Megavolt portal images were acquired with a Varian Trilogy unit equipped with an AS1000 electronic portal imaging device. The nodule localization method uses grayscale morphological filtering and level-set segmentation with a prior. The treatment-time portion of the algorithm is implemented on a graphical processing unit. Results: The method was retrospectively tested on eight cases that include a total of 151 megavolt portal image frames. The method reduced the nodule position uncertainty by an average of 40% for seven out of the eight cases. The treatment phase portion of the method has a subsecond execution time that makes it suitable for near-real-time nodule localization. Conclusions: A method was developed to localize a pulmonary nodule in a megavolt portal image. The method uses the characteristics of the nodule in a prior CT scan to enhance the nodule in the portal image and to identify the nodule region by level-set segmentation. In a retrospective study, the method reduced the nodule position uncertainty by an average of 40% for seven out of the eight cases studied. (C) 2010 American Association of Physicists in Medicine. [DOI: 10.1118/1.3495538]

关键词： level-set segmentation electronic portal imaging device pulmonary nodule computed tomography radiation oncology computer-aided detection digitally reconstructed radiograph graphical processing unit

来源：评论

学校读者我要写书评

暂无评论

Hardware and software architectures for computationally efficient three-dimensional ultrasonic data compression

引用

IET CIRCUITS DEVICES & SYSTEMS 2016年第1期10卷 54-61页

作者： Govindan, Pramod Wang, Boyang Ravi, Prashaanth Saniie, Jafar IIT Dept Elect & Comp Engn Chicago IL 60616 USA

Ultrasonic industrial and medical imaging applications involve acquisition of large amount of volumetric data in real time. Therefore, data storage becomes critical in many current day applications which utilise ultrasound technology. Compressing the acquired data allows possessing minimal storage and also helps to rapidly transmit information to remote locations for expert analysis. The objective of this study is to design computationally efficient architectures for implementing discrete wavelet transform-based ultrasonic three-dimensional (3D) data compression algorithm on a reconfigurable ultrasonic system-on-chip (SoC) hardware platform. In this study, hardware and software architectures of the 3D ultrasonic compression algorithm are realised using Xilinx Zynq all programmable SoC. This study demonstrates that, compressing 33 MB of experimental ultrasonic 3D data into 0.42 MB (98.7% compression) requires only 84 ms for hardware architecture, and 1 min for software architecture, making both designs highly suitable for real-time ultrasonic imaging applications. Furthermore, the 3D compression is implemented by using Open Computing Language (OpenCL) targeted on Nvidia GT 750M graphical processing unit. OpenCL implementation of ultrasonic 3D compression algorithm completes the execution in <1 sec. This approach provides improved computational performance as that of hardware architecture, and comparable flexibility as that of software implementation.

关键词： volumetric data hardware architecture ultrasonic imaging Xilinx Zynq data compression medical imaging application system-on-chip software architecture industrial application discrete wavelet transform realtime ultrasonic imaging application graphical processing unit SoC hardware platform graphics processing units three-dimensional ultrasonic data compression reconfigurable ultrasonic system-on-chip data storage 3D ultrasonic data compression algorithm open computing language OpenCL discrete wavelet transforms ultrasound technology Nvidia GT 750M

来源：评论

学校读者我要写书评

暂无评论

Parallel intelligent algorithm analysis of optimization arrangement on mistuned blades based on compute unified device architecture

引用

PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART G-JOURNAL OF AEROSPACE ENGINEERING 2019年第6期233卷 2207-2218页

作者： Zhao, Tianyu Li, Hongxin Sun, Huagang Northeastern Univ Sch Sci Shenyang 110819 Liaoning Peoples R China AVIC Shenyang Engine Design & Res Inst Shenyang Liaoning Peoples R China Mech Tech Res Inst Shijiazhuang Hebei Peoples R China

This paper sets up a parameterized model of engine-bladed disk system. Then a method of mistuned parameter identification is proposed, which consists of static frequency test of blades, dichotomy, and finite element analysis. Dynamic genetic ant colony optimization combined algorithm is presented which is used as a bladed arrangement optimization method. It combines the advantage of ant colony algorithm and genetic algorithm. By this way, the local and global search ability is introduced and the disadvantage of a single algorithm is overcome. The improved parallel algorithm comes up with graphics processing unit based on compute unified device architecture and its performance is analyzed. The results show that using optimization results can reduce the amplitude and localization of forced vibration response of bladed-disk system. At the same time, optimization based on compute unified device architecture framework can improve computing speed. Providing support for engineering application in terms of effectiveness and efficiency.

关键词： Mistuning blade arrangement genetic ant colony optimization algorithm parallel algorithm graphical processing unit compute unified device architecture

来源：评论

学校读者我要写书评

暂无评论

GPU-accelerated parallel image reconstruction strategies for magnetic particle imaging

引用

PHYSICS IN MEDICINE AND BIOLOGY 2024年第13期69卷 135005-135005页

作者： Quelhas, Klaus N. Henn, Mark-Alexander Farias, Ricardo Tew, Weston L. Woods, Solomon, I NIST Phys Measurement Lab Gaithersburg MD 20899 USA Univ Fed Rio de Janeiro Syst Engn & Comp Sci Program Rio De Janeiro Brazil NIST Informat Technol Lab Gaithersburg MD USA Univ Maryland Adelphi MD USA

Objective. Image reconstruction is a fundamental step in magnetic particle imaging (MPI). One of the main challenges is the fact that the reconstructions are computationally intensive and time-consuming, so choosing an algorithm presents a compromise between accuracy and execution time, which depends on the application. This work proposes a method that provides both fast and accurate image reconstructions. Approach. Image reconstruction algorithms were implemented to be executed in parallel in graphics processing units (GPUs) using the CUDA framework. The calculation of the model-based MPI calibration matrix was also implemented in GPU to allow both fast and flexible reconstructions. Main results. The parallel algorithms were able to accelerate the reconstructions by up to about 6 , 100 times in comparison to the serial Kaczmarz algorithm executed in the CPU, allowing for real-time applications. Reconstructions using the OpenMPIData dataset validated the proposed algorithms and demonstrated that they are able to provide both fast and accurate reconstructions. The calculation of the calibration matrix was accelerated by up to about 37 times. Significance. The parallel algorithms proposed in this work can provide single-frame MPI reconstructions in real time, with frame rates greater than 100 frames per second. The parallel calculation of the calibration matrix can be combined with the parallel reconstruction to deliver images in less time than the serial Kaczmarz reconstruction, potentially eliminating the need of storing the calibration matrix in the main memory, and providing the flexibility of redefining scanning and reconstruction parameters during execution.

关键词： magnetic particle imaging image reconstruction parallel computing graphical processing unit CUDA.

来源：评论

学校读者我要写书评

暂无评论

GPU based simulation of reactive mixtures with detailed chemistry in combination with tabulation and an analytical Jacobian

引用

COMPUTERS & CHEMICAL ENGINEERING 2014年 71卷 521-531页

作者： Dijkmans, Thomas Schietekat, Carl M. Van Geem, Kevin M. Marin, Guy B. Univ Ghent Chem Technol Lab B-9052 Zwijnaarde Belgium

Incorporating detailed chemistry in solvers still remains a daunting and intractable task due to the prohibitive computational cost. However the combination of advanced mathematical solution techniques such as tabulation and calculating the analytical Jacobian in combination with efficient computational techniques that use the graphical processing unit (GPU) to do calculations can drastically speedup the simulation. These techniques are not mutually exclusive as is demonstrated for an ordinary differential equation (ODE) problem describing the classical adiabatic, constant-volume ignition of an equimolar methane/air mixture. Acceleration with up to a factor 120 can be obtained with the new algorithm compared to the algorithm employed in the reference solver. Maximum speedup is obtained in the case where the analytical Jacobian and the rates are calculated using the GPU when using intrinsic compiler functions to calculate transcendental functions which are used to calculate thermodynamic and kinetic coefficients. This is because the GPU can calculate transcendental functions significantly more efficient than a CPU. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： graphical processing unit Analytical Jacobian Ordinary differential equations Chemical kinetics Tabulation Efficiency

来源：评论

学校读者我要写书评

暂无评论

Rough surface scattering simulations using graphics cards

引用

APPLIED SURFACE SCIENCE 2010年第18期256卷 5640-5643页

作者： Klapetek, Petr Valtr, Miroslav Poruba, Ales Necas, David Ohlidal, Miloslav Czech Metrol Inst Brno 63800 Czech Republic Solartec SRO Roznov Pod Radhostem 75661 Czech Republic Dept Phys Elect Brno 61137 Czech Republic Brno Univ Technol Brno Czech Republic

In this article we present results of rough surface scattering calculations using a graphical processing unit implementation of the Finite Difference in Time Domain algorithm. Numerical results are compared to real measurements and computational performance is compared to computer processor implementation of the same algorithm. As a basis for computations, atomic force microscope measurements of surface morphology are used. It is shown that the graphical processing unit capabilities can be used to speedup presented computationally demanding algorithms without loss of precision. (C) 2010 Elsevier B.V. All rights reserved.

关键词： FDTD graphical processing unit

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：