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

International conference on Future Computer and Communications (ICFCC 2009)

作者： Kamarposhty, Morteza Sabery Asadollahi, Hassan Teymoori, Mir Majid Islamic Azad Univ Firouzkuh Branch Dept Comp Tehran Iran Islamic Azad Univ Firouzkuh Branch Dept Elect Engn Tehran Iran

ISBN: (纸本)9780769535913

In this paper, a new method for line detection at sport images using multi-agent systems is proposed. For this purpose, we introduced some agents. Each agent can recognize special section of an image, for example one agent for recognition of sport image's background (green pixels) and another for recognition of images line (white pixels). The results show good performance with respect to other methods, for example, Hough algorithm. This method has many advantages such as simplicity and high speed implementation, availability of line and background separately, cancelation of unnecessary sections such as viewer sections and parallel implementation ability.

关键词： Line Detection Sport image Multi-Agent Systems Pipeline image processing

来源：评论

学校读者我要写书评

暂无评论

Massively parallel solving of 3D simplified PN equations on graphics processing units

Massively parallel solving of 3D simplified PN equations on ...

引用

International conference on Mathematics, Computational methods and Reactor Physics 2009, M and C 2009

作者： Kirschenmann, W. Plagne, L. Ploix, S. Ponçot, A. Vialle, S. EDF R and D 1 av. du Gal de Gaulle F-92141 Clamart France SUPELEC IMS Group AlGorille INRIA project Team 2 rue Edouard Belin F-57070 Metz Cedex France

ISBN: (纸本)9781615673490

This paper presents an efficient parallel implementation on Graphics processing Units (GPUs) for the Simplified PN (SPN) calculations in the 3D case. For a nuclear operator such as EDF, the time required to compute nuclear reactor core simulations is rather critical. The SPN method provides a convenient trade-off between accuracy and numerical complexity and is used in several industrial simulations. The parallelization of the algorithm should allow to reduce the computation time required to solve the eigenvalue problem. To solve the problem on distributed memory machines such as PC clusters, Domain Decomposition methods have been investigated. Complementary to this approach, this work aims at using emerging massively parallel processors such as the GPUs. Based on a fine grained parallelism, this solution offers the opportunity to achieve good performances at very low cost. Indeed, GPUs provide a large computational power and some specific optimizations allow to near the hardware limits. Our GPU implementation solves 3D SPN problems 30 times faster than its sequential CPU counterpart.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Non-rigid Registration for Large Sets of Microscopic images on Graphics Processors

引用

JOURNAL OF SIGNAL processing SYSTEMS FOR SIGNAL image AND VIDEO TECHNOLOGY 2009年第1-3期55卷 229-250页

作者： Ruiz, Antonio Ujaldon, Manuel Cooper, Lee Huang, Kun Ohio State Univ Biomed Informat Dept Columbus OH 43210 USA Univ Malaga Comp Architecture Dept E-29071 Malaga Spain

Microscopic imaging is an important tool for characterizing tissue morphology and pathology. 3D reconstruction and visualization of large sample tissue structure requires registration of large sets of high-resolution images. However, the scale of this problem presents a challenge for automatic registration methods. In this paper we present a novel method for efficient automatic registration using graphics processing units (GPUs) and parallel programming. Comparing a C++ CPU implementation with Compute Unified Device Architecture (CUDA) libraries and pthreads running on GPU we achieve a speed-up factor of up to 4.11x with a single GPU and 6.68x with a GPU pair. We present execution times for a benchmark composed of two sets of large-scale images: mouse placenta (16K x16K pixels) and breast cancer tumors (23K x62K pixels). It takes more than 12 hours for the genetic case in C++ to register a typical sample composed of 500 consecutive slides, which was reduced to less than 2 hours using two GPUs, in addition to a very promising scalability for extending those gains easily on a large number of GPUs in a distributed system.

关键词： Microscopic imaging image registration and segmentation Pattern analysis Feature detection Graphics processors High-performance computing

来源：评论

学校读者我要写书评

暂无评论

BAYESIAN SPARSE image RECONSTRUCTION FOR MRFM

BAYESIAN SPARSE IMAGE RECONSTRUCTION FOR MRFM

引用

IEEE International conference on Acoustics, Speech and Signal processing

作者： Dobigeon, Nicolas Hero, Alfred O. Tourneret, Jean-Yves Univ Michigan Dept EECS Ann Arbor MI 48109 USA Univ Toulouse IRIT INP ENSEEIHT F-31071 Toulouse France

ISBN: (纸本)9781424423538

In this paper, we propose a Bayesian model and a Monte Carlo Markov chain (MCMC) algorithm for reconstructing images that consist of only few non-zero pixels. An appropriate distribution that promotes sparsity is proposed as prior distribution for the pixel values. The hyperparameters involved in the modeling are also assigned prior distributions, resulting in a hierarchical model. A Gibbs sampler allows us to draw samples distributed according the full posterior of interest. These samples are then used to approximate standard maximum a posteriori (MAP) estimator. By conducting some simulations, we show that the proposed estimator clearly outperforms previous estimators proposed in the literature.

关键词： Bayesian inference sparse representation MCMC methods MRFM

来源：评论

学校读者我要写书评

暂无评论

A Comparative Study of parallel Prefix Adders in FPGA Implementation of EAC

A Comparative Study of Parallel Prefix Adders in FPGA Implem...

引用

12th Euromicro conference on Digital System Design, Architectures, methods and Tools

作者： Liu, Feng Fariborz, F. F. Mohamed, Otmane Ait Chen, Gang Song, Xiaoyu Tan, Qingping National Lab. of Parallel Distributed Processing Hunan China ECE Department Concordia University Montreal QC Canada Lingcore Lab. Portland OR United States ECE Department Portland State University Portland OR United States

ISBN: (纸本)9780769537825

Several regular parallel trees have been proposed over the years to optimize logic depth, area, fan-out and interconnect count for logic circuits. In this paper, we propose a comparative study of different parallel prefix trees used in the design of a new end-around carry (EAC) adder targeting FPGA technology. This new adder is based on the fast 128-bit binary floating-point EAC adder which has been implemented in the IBM POWER6 microprocessor's fused multiply-add unit. The parallel prefix tree implemented on the IBM's EAC adder is a Kogge-Stone tree which has been chosen for its high performance and its low power consumption. Our comparative study highlights the main performance differences among fourteen different architecture configurations when targeting an FPGA EAC adder design. We focus on the area requirements and the critical path delay of these designs. Our experimental results show that there is one architecture configuration with the lower area requirement and the higher performance.

关键词： Adders

来源：评论

学校读者我要写书评

暂无评论

The architecture of a digital network for image analysis

The architecture of a digital network for image analysis

引用

作者： Brylski, Przemyslaw Strzelecki, Michale Institute of Electronics Technical University of Lodz Wolczanska 211/215 90-924 Lodz Poland

ISBN: (纸本)9781457714771

This article describes a new architecture for a parallel, digital image processor which performs several image processing tasks like segmentation, edge detection and noise removal. The architecture and algorithm modifications presented in this paper are aimed for reduction the FPGA area of a pixel, which represents basic image processing unit. The proposed modifications increase the functionality of the pixel array by enabling different image processing operations based on the region growing methods. © 2009 Division of Signal Processin.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Low complexity DCT-based distributed source coding with gray code for hyperspectral image

Low complexity DCT-based distributed source coding with gray...

引用

2009 International conference on Wireless Communications and Signal processing, WCSP 2009

作者： Wang, Jianrong Liu, Rongke Zhao, Hongbo Beijing University of Aeronautics and Astronautics Beijing China

ISBN: (纸本)9781424456680

Hyperspectral image compression demands simple onboard encoder. Contrary to most distributed source coding (DSC) compression methods in wavelet transform (WT) domain, we propose a low complexity discrete cosine transform (DCT)-based DSC paradigm with Gray code. We use a set-partitioning approach on reorganized DCT coefficients to extract bitplanes;then we apply Gray code to refinement bits;lastly low density parity check (LDPC)-based Slepian-Wolf coder is implemented to our DSC strategy. Hence the coding strategy shifts the complexity from encoder to decoder. Experimental results for AVIRIS (Airborne Visible/Infrared Imaging Spectrometer) data illustrate that the proposed scheme can improve up to 2dB better than DSC-based coder in WT domain, regardless of the using DCT-based coder worse than wavelet-based one. It also reaches up to 6dB by comparison with that independently using 2-Dimensional (2D) DCT-based coder. © 2009 IEEE.

关键词： image compression

来源：评论

学校读者我要写书评

暂无评论

Solving 3-Coloring Problem by Tissue P Systems with Cell Separation

Solving 3-Coloring Problem by Tissue P Systems with Cell Sep...

引用

4th International conference on Bio-Inspired Computing

作者： Wang, Shuo Miao, Zhengke Shi, Xiaolong Zhang, Zheng Huazhong Univ Sci & Technol Key Lab Image Proc & Intelligent Control Dept Control Sci & Engn Wuhan 430074 Hubei Peoples R China Xuzhou Normal Univ Dept Math Xian 221009 Peoples R China

ISBN: (纸本)9781424438655

Tissue P systems are a class of distributed and parallel computing models inspired by intercellular communication and cooperation between neurons. An interesting variant of tissue P systems is known as tissue P systems with cell separation, which is endowed with the ability of generating an exponential workspace in a linear time and in this way getting the possibility to solve computationally hard problems in polynomial time. In this paper, a uniform solution to 3-coloring problem by tissue P systems with cell separation is presented, which is linear in terms of the number of vertices and the number of edges.

关键词： Separation

来源：评论

学校读者我要写书评

暂无评论

Two and Three-Dimensional image Deconvolution on Graphics Hardware 18

Two and Three-Dimensional Image Deconvolution on Graphics Ha...

引用

IMACS World Congress/Modelling and Simulation Society-of-Australia-and-New-Zealand (MSSANZ)/18th MODSIM09 Biennial conference on Modelling and Simulation

作者： Domanski, Luke Vallotton, Pascal Wang, Dadong CSIRO Math & Informat Sci Biotech Imaging Canberra ACT Australia

ISBN: (纸本)9780975840078

The process of image formation in an optical microscope or similar imaging device results in a distortion of the true object image due to diffraction effects and out-of-focus blurring. This distortion can greatly limit the resolution of the imaging device, particularly in the case of 3D microscopy where the axial resolution is impeded by the contribution of out-of-focus signal from an extended area of the object outside a recorded focal plane. Fortunately the image formation process can be modelled as a convolution of the original object with the impulse response of the device, that is, the image of a point energy source. As such, an approximation of the original object image can be derived through an inversion of this model - a deconvolution. Unfortunately the inclusion of random noise in the image recording process makes direct methods of inverting this model less than ideal as they are prone to amplification of noise. A class of popular approaches is to use iterative methods which try to account for the noise and progress towards an acceptable approximation of the real image. These methods are often computationally intensive, requiring a reapplication of the image formation model to successive estimates of the real image. In addition, biological and medical research organisations are collecting 3D image data on an increasingly large scale, and there is a demand to process this data in a timely manner. In this paper we investigate the use of graphics processing units (GPUs) to accelerate the execution of one such iterative algorithm, the Richardson-Lucy (RL) algorithm. Modern GPUs are highly parallel commodity processors containing hundreds of cores and capable of executing thousands of threads concurrently. GPUs can be utilised to accelerate a wide variety of compute intensive algorithms. As their programmability has improved over the past decade, significant effort has been invested in performing general purpose computing on GPUs (GPGPU). Until recently GPGPU al

关键词： graphics processing units (GPU) parallel processing image restoration deconvolution microscopy Fast Fourier Transform

来源：评论

学校读者我要写书评

暂无评论

PSPIKE: A parallel Hybrid Sparse Linear System Solver

引用

15th International Euro-Par conference on parallel Computing

作者： Manguoglu, Murat Sameh, Ahmed H. Schenk, Olaf Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA Univ Basel Comp Sci Dept CH-4056 Basel Switzerland

ISBN: (纸本)9783642038686

The availability of huge-scale computing platforms comprised of tells of thousands of multicore processors motivates the need for the next generation of highly scalable sparse linear system solvers. These solvers must optimize parallel performance, processor (serial) performance;as well as memory requirements, while being robust across broad classes of applications and systems. In this paper, we present;a new parallel solver that combines the desirable characteristics of direct methods (robustness) and effective iterative solvers (low computational cost), while alleviating their drawbacks (memory requirements, lack of robustness). Our proposed hybrid solver is based on tire general sparse solver PARDISO;and the "Spike" family of hybrid solvers. The resulting algorithm, called PSPIKE, is as robust as direct solvers, more reliable than classical preconditioned Krylov subspace methods, and much more scalable than direct sparse solvers. We support;our performance and parallel scalability claims using detailed experimental studies and comparison with direct solvers, as well as classical preconditioned Krylov methods.

关键词： Hybrid Solvers Direct Solvers Krylov Subspace methods Sparse Linear Systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：