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

23rd IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Strandmark, Petter Kahl, Fredrik Lund Univ Ctr Math Sci S-22100 Lund Sweden

ISBN: (纸本)9781424469840

Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve the maximum flow/minimum cut problem in parallel by splitting the graph into multiple parts and hence, further increase the computational efficacy of graph cuts. Optimality of the solution is guaranteed by dual decomposition, or more specifically, the solutions to the subproblems are constrained to be equal on the overlap with dual variables. We demonstrate that our approach both allows (i) faster processing on multi-core computers and (ii) the capability to handle larger problems by splitting the graph across multiple computers on a distributed network. Even though our approach does not give a theoretical guarantee of speedup, an extensive empirical evaluation on several applications with many different data sets consistently shows good performance. An open source implementation of the dual decomposition method is also made publicly available.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Scalability in privacy-preserving data aggregation for wireless sensor networks

Scalability in privacy-preserving data aggregation for wirel...

引用

IEEE International Symposium on parallel and distributed processing With Applications

作者： Bista, Rabindra Shin, Young-Sung Chang, Jae-Woo Dept. of Computer Engineering Center for Advanced Image and Information Technology Chonbuk National University Chonju Chonbuk 561-756 Korea Republic of

ISBN: (纸本)9780769541907

In this paper, we propose a new privacy preserving data aggregation scheme for WSNs. Our scheme applies additive property of complex numbers in order to combine sensor data and preserve data privacy during transmission to the sink node. In addition, for supporting scalability, we propose a novel mechanism in which a special set of real numbers are assigned to sensor nodes as their IDs so that a single bit is sufficient to hold ID of a sensor node during transmission of aggregated data to the sink node. For this, we, first, generate fixed size signatures for the IDs of all sensor nodes and then superimpose the signatures during data aggregation phase. By analytical evaluations, we show that our scheme is more scalable and energy efficient than the existing methods to achieve data privacy and transmit IDs of sensor nodes along with the aggregated data to the sink node. © 2010 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Multiple-Person Tracking devoted to distributed multi Smart Camera Networks

Multiple-Person Tracking devoted to distributed multi Smart ...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems

作者： Zuriarrain, Iker Ignacio Aizpurua, Jose Lerasle, Frederic Arana, Nestor Univ Mondragon Signal Treatment & Commun Res Grp Arrasate Mondragon 20500 Spain CNRS LAAS F-31077 Toulouse France Univ Toulouse UPS INSA INPISAELAAS F-31077 Toulouse France

ISBN: (纸本)9781424466757

Camera networks are an important component of modern complex systems, be it for surveillance, human/machine interaction or healthcare. Having smart cameras that can, by themselves, perform part of the data processing improves scalability both in processing and network resources. In this paper, we present the HYBRID algorithm for multiple person tracking intended for implementation on a smart camera platform, along with the development methodology to implement said algorithm in an FPGA-based smart camera. The HYBRID strategy outperforms the well-known Markov Chain Monte Carlo based particle filter (MCMC-PF) in terms of (i) parallelization capabilities as the MCMC-PF sequentially processes the particles, and (ii) tracking performances (i.e., robustness and precision).

关键词： FPGA-based smart camera HYBRID algorithm MCMC-PF sequentially process Markov Chain Monte Carlo based particle filter Markov processes Monte Carlo methods cameras complex system data processing distributed multismart camera network field programmable gate arrays healthcare human-machine interaction image processing man-machine systems mobile robots multiple person tracking network resources parallelization capability particle filtering (numerical methods) surveillance target tracking

来源：评论

学校读者我要写书评

暂无评论

A connectionist knowledge based system using coarse-coded distributed representations 10

A connectionist knowledge based system using coarse-coded di...

引用

International Conference and Workshop on Emerging Trends in Technology 2010, ICWET 2010

作者： Sanjeevi, S.G. Bhattacharyya, P. Dept. of Comp. Science and Engineering N.I.T. Warangal Warangal India Dept. of Comp. Science and Engineering IIT Bombay Mumbai-400076 India

ISBN: (纸本)9781605588124

Traditionally reasoning systems have been implemented using symbolic methods of artificial intelligence. Connectionist methods of implementing reasoning systems form an alternative paradigm. Among the connectionist reasoning systems two types of representational methods can be used. They are i) localist and ii) distributed representational methods. In the literature, some localist methods for reasoning were used in connectionist systems. Since those systems used localist representations, advantages of distributed representations are not obtainable by them. In this paper, we describe the design and implementation of a connectionist knowledge based system which integrates a connectionist predicate logic reasoning system and a connectionist semantic network. The system uses distributed coarse-coded representations. The connectionist predicate logic system supports both simple rules as well as a complex rule having multiple conjunctions. distributed representations have advantages of increased fault tolerance, graceful degradation of performance;neural plausibility, cognitive modeling and parallel distributed processing. The system besides showing above features allows the communication between these two connectionist systems and makes it possible to access the information of attributes and corresponding values from the connectionist semantic network for the entities used in the connectionist predicate logic system. Copyright 2010 ACM.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Low cost VLSI discrete wavelet transform and FIR filters architectures for very high-speed signal and image processing

Low cost VLSI discrete wavelet transform and FIR filters arc...

引用

作者： Maamoun, Mountassar Bradai, Rafik Meraghni, Abdelhamid Beguenane, Rachid Department of Electronics University of Blida Blida Algeria Kouba Algeria Department of Electrical Computer Engineering Royal Military College of Canada Kingston Canada

ISBN: (纸本)9781424490233

This paper presents new VLSI architectures for finite impulse response (FIR) filters and discrete wavelet transform, intended for very high-speed signal and image processing. The proposed architectures, based on combining pipeline and parallel arithmetic methods, provide a new and very fast convolution approach with a reduced critical path. The key to this is a clever use of D-latches and multipliers which are efficiently distributed. Furthermore, an advanced discrete wavelet transform (DWT) approach, with an area-efficient architecture, is designed to produce one output in every clock cycle. As a result, a very high-speed is attained. The proposed structure can increase the work frequency (85%) at a low cost of additional hardware elements (55%). The systems are verified, using JPEG2000 coefficients filters, on Xilinx Field Programmable Gate Array (FPGA) devices. © 2010 IEEE.

关键词： FIR filters

来源：评论

学校读者我要写书评

暂无评论

Integration of gpgpu methods into a pet reconstruction system

Integration of gpgpu methods into a pet reconstruction syste...

引用

9th IASTED International Conference on parallel and distributed Computing and Networks, PDCN 2010

作者： Schaetz, Sebastian Kucera, Markus Department of Computer Science and Mathematics University of Applied Sciences Regensburg Germany

ISBN: (纸本)9780889868205

Positron emission tomography (PET) is a medical imaging modality that allows the detection of tissue with particular properties or the observation of metabolic processes in living organisms over time. It plays a vital role in cancer diagnosis and heart examination and represents a promising method for early diagnosis of dementia. With the advancement of scanner technology as well as an ever increasing demand for higher quality images and higher patient throughput the image reconstruction system can become a bottleneck of a PET system. To meet this demand for more computing power in the reconstruction system a novel way to speed up the image reconstruction process for modern PET systems is presented. A common graphics processing device in conjunction with the Compute Unified Device Architecture (CUDA) is used to speed up existing algorithms for the CPU. Projectors for full 3D reconstruction are ported to the CUDA device and new algorithms are implemented where necessary. The main focus of this port is to speed up the calculation and to maintain the numerical accuracy of the result. On the basis of the CPU reconstruction system a new system that uses GPU projectors is implemented. With this modification a two-fold speed up is achieved compared to the highly optimized CPU implementation running on 4 CPU cores. Different optimization methods are explored and applied where suitable. The results calculated by GPU and CPU projectors are numerically identical allowing them to be interchanged. The system is validated and the algorithms are integrated into the reconstruction system of Siemens Healthcare Molecular Imaging PET scanners.

关键词： Three dimensional

来源：评论

学校读者我要写书评

暂无评论

parallel processing for Secret image Sharing

Parallel Processing for Secret Image Sharing

引用

International Symposium on parallel and distributed processing with Applications, ISPA

作者： Wen-Pinn Fang Department of Computer Science and Information Engineering Yuanpei University Hsinchu Taiwan

Secret image sharing is a method to transmit and store an image safely. The security of secret image sharing is based on the fact that the values are operated in the finite field and the number of pixels is high enough to ensure security. However, the time complexity to encode and decode a secret image is not acceptable in real-time application. There are some papers discussing how to upgrade the efficiency of encoding phase while few papers exploring how to decrease the decoding phase time. This paper proposes a method to achieve to speed up decoding phase by parallel processing.

关键词： Decoding Cryptography Complexity theory parallel processing Pixel Finite element methods Conferences

来源：评论

学校读者我要写书评

暂无评论

Size-fractionated characterization and quantification of nanoparticle release rates from a consumer spray product containing engineered nanoparticles

引用

JOURNAL OF NANOPARTICLE RESEARCH 2010年第7期12卷 2481-2494页

作者： Hagendorfer, Harald Lorenz, Christiane Kaegi, Ralf Sinnet, Brian Gehrig, Robert Goetz, Natalie V. Scheringer, Martin Ludwig, Christian Ulrich, Andrea EMPA Swiss Fed Labs Mat Testing & Res CH-8600 Dubendorf Switzerland ETHZ Swiss Fed Inst Technol Zurich CH-8093 Zurich Switzerland EAWAG Swiss Fed Inst Aquat Sci & Technol CH-8600 Dubendorf Switzerland Paul Scherrer Inst CH-5232 Villigen Switzerland Ecole Polytech Fed Lausanne Swiss Fed Inst Technol Lausanne CH-1015 Lausanne Switzerland

This study describes methods developed for reliable quantification of size- and element-specific release of engineered nanoparticles (ENP) from consumer spray products. A modified glove box setup was designed to allow controlled spray experiments in a particle-minimized environment. Time dependence of the particle size distribution in a size range of 10-500 nm and ENP release rates were studied using a scanning mobility particle sizer (SMPS). In parallel, the aerosol was transferred to a size-calibrated electrostatic TEM sampler. The deposited particles were investigated using electron microscopy techniques in combination with image processing software. This approach enables the chemical and morphological characterization as well as quantification of released nanoparticles from a spray product. The differentiation of solid ENP from the released nano-sized droplets was achieved by applying a thermo-desorbing unit. After optimization, the setup was applied to investigate different spray situations using both pump and gas propellant spray dispensers for a commercially available water-based nano-silver spray. The pump spray situation showed no measurable nanoparticle release, whereas in the case of the gas spray, a significant release was observed. From the results it can be assumed that the homogeneously distributed ENP from the original dispersion grow in size and change morphology during and after the spray process but still exist as nanometer particles of size < 100 nm. Furthermore, it seems that the release of ENP correlates with the generated aerosol droplet size distribution produced by the spray vessel type used. This is the first study presenting results concerning the release of ENP from spray products.

关键词： Nanoparticle release Nano-silver Engineered nanoparticles Propellant gas spray Pump spray Consumer products SMPS Electrostatic TEM sampler Electron microscopy image analysis Environment, health and safety (EHS)

来源：评论

学校读者我要写书评

暂无评论

On the parallelisation of MCMC-based image processing

On the parallelisation of MCMC-based image processing

引用

IEEE International Symposium on parallel and distributed processing Workshops and Phd Forum (IPDPSW)

作者： Jonathan M. R. Byrd Stephen A. Jarvis Abhir H. Bhalerao Department of Computer Science University of Warwick Coventry UK

ISBN: (纸本)9781424465330

The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov Chain Monte Carlo (MCMC) simulations are widely used for approximate counting problems, Bayesian inference and as a means for estimating very high-dimensional integrals. As such MCMC has found a wide variety of applications in fields including computational biology and physics, financial econometrics, machine learning and image processing. Whilst divide and conquer is an obvious means to simplify image processing tasks, "naively" dividing an image into smaller images to be processed separately results in anomalies and breaks the statistical validity of the MCMC algorithm. We present a method of grouping the spatially local moves and temporarily partitioning the image to allow those moves to be processed in parallel, reducing the runtime whilst conserving the properties of the MCMC method. We calculate the theoretical reduction in runtime achievable by this method, and test its effectiveness on a number of different architectures. Experiments are presented that show reductions in runtime of 38% using a dual-core dual-processor machine. In circumstances where absolute statistical validity are not required, an algorithm based upon, but not strictly adhering to, MCMC may suffice. For such situation two additional algorithms are presented for partitioning of images to which MCMC will be applied. Assuming preconditions are met, these methods may be applied with minimal risk of anomalous results. Although the extent of the runtime reduction will be data dependent, the experiments performed showed the runtime reduced to 27% of its original value.

关键词： image processing Runtime Partitioning algorithms Availability Computer architecture Computer simulation Monte Carlo methods Biological system modeling Computational modeling Bayesian methods

来源：评论

学校读者我要写书评

暂无评论

A Grid Version of the Fusion Code FAFNER

A Grid Version of the Fusion Code FAFNER

引用

Euromicro Conference on parallel, distributed and Network-Based processing

作者： Manuel A. Rodríguez-Pascual José Guasp Francisco Castejón Antonio J. Rubio-Montero Ignacio M. Llorente Rafael Mayo CIEMAT Madrid Spain Spanish National Laboratory of Fusion EURATOM-CIEMAT Association for Fusion Madrid Spain Distributed Systems Architecture Research Group Universidad Complutense de Madrid Madrid Spain

FAFNER is code developed by Lister which simulates by Monte Carlo methods the Neutral Beam Injection (NBI) technology, one of the most extended heating methods for fusion devices. To the date, FAFNER has been usually run at CIEMAT adapted to the TJ-ii helical axis stellarator on shared memory Cray architecture machines. From this version, FAFNER has been ported to the Grid in the framework of the EGEE Project. At the same time, this work is the first step of a more ambitious target since the code can be now coupled to many others such as ion transport tools. In this paper, all these preliminary advances are described as well as the performance and portability gains obtained.

关键词： Heating Grid computing Plasma simulation Structural beams Fusion reactor design Plasma devices Plasma applications Fusion reactors Particle beams Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：