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

24th Euromicro International conference on parallel, distributed, and Network-Based processing (PDP)

作者： Majd, Amin Lotfi, Shahriar Sahebi, Golnaz Daneshtalab, Masoud Plosila, Juha Univ Turku Dept Informat Technol Turku Finland Univ Tabri Dept Comp Sci Tabriz Iran Royal Inst Technol KTH Stockholm Sweden

ISBN: (纸本)9781467387767

The importance of optimization and NP problems solving cannot be over emphasized. The usefulness and popularity of evolutionary computing methods are also well established. There are various types of evolutionary methods that arc mostly sequential, and some others have parallel implementation. We propose a method to parallelize Imperialist Competitive Algorithm (Multi-Population). The algorithm has been implemented with MPI on two platforms and have tested our algorithms on a shared- memory and message passing architecture. An outstanding performance is obtained, which indicates that the method is efficient concern to speed and accuracy. In the second step, the proposed algorithm is compared with a set of existing well known parallel algorithms and is indicated that it obtains more accurate solutions in a lower time.

关键词： optimization evolutionary computing parallel approaches ICA parallel programing multi-population super linear performance

来源：评论

学校读者我要写书评

暂无评论

A k-way Greedy Graph Partitioning with Initial Fixed Vertices for parallel Applications 24

A <i>k</i>-way Greedy Graph Partitioning with Initial Fixed ...

引用

24th Euromicro International conference on parallel, distributed, and Network-Based processing (PDP)

作者： Predari, Maria Esnard, Aurelien Univ Bordeaux LaBRI UMR 5800 INRIAHiePACS Project F-33400 Talence France

ISBN: (纸本)9781467387767

Graph partitioning is used to solve the problem of distributing computations to a number of processors, in order to improve the performance of time consuming applications in parallel environments. A common approach to solve this problem is based on a multilevel framework, where the graph is firstly coarsened to a smaller instance and then it is partitioned in a number of parts using recursive bisection (RB) based methods. However, in applications where initial fixed vertices are used to model additional constraints of the problem, RB based methods often fail to produce partitions of good quality. In this paper, we propose a new direct k-way greedy graph growing algorithm, called KGGGP, that overcomes this issue and succeeds to produce partition with better quality than RB while respecting the constraint of fixed vertices. In the experimental section, we present results which compare KGGGP against state-of-the-art methods for graphs available from the popular DIMACS'10 collection.

关键词： high-performance computing graph partitioning multi-level framework parallel simulations

来源：评论

学校读者我要写书评

暂无评论

distributed computing in image analysis using open source frameworks and application to image sharpness assessment of histological whole slide images

引用

DIAGNOSTIC PATHOLOGY 2011年第Suppl_sup期6卷 S16-S16页

作者： Zerbe, Norman Hufnagl, Peter Schluens, Karsten Charite Inst Pathol D-10117 Berlin Germany Univ Appl Sci Berlin D-12459 Berlin Germany

Background: Automated image analysis on virtual slides is evolving rapidly and will play an important role in the future of digital pathology. Due to the image size, the computational cost of processing whole slide images (WSIs) in full resolution is immense. Moreover, image analysis requires well focused images in high magnification. methods: We present a system that merges virtual microscopy techniques, open source image analysis software, and distributed parallel processing. We have integrated the parallel processing framework JPPF, so batch processing can be performed distributed and in parallel. All resulting meta data and image data are collected and merged. As an example the system is applied to the specific task of image sharpness assessment. imageJ is an open source image editing and processing framework developed at the NIH having a large user community that contributes image processing algorithms wrapped as plug-ins in a wide field of life science applications. We developed an imageJ plug-in that supports both basic interactive virtual microscope and batch processing functionality. For the application of sharpness inspection we employ an approach with non-overlapping tiles. Compute nodes retrieve image tiles of moderate size from the streaming server and compute the focus measure. Each tile is divided into small sub images to calculate an edge based sharpness criterion which is used for classification. The results are aggregated in a sharpness map. Results: Based on the system we calculate a sharpness measure and classify virtual slides into one of the following categories - excellent, okay, review and defective. Generating a scaled sharpness map enables the user to evaluate sharpness of WSIs and shows overall quality at a glance thus reducing tedious assessment work. Conclusions: Using sharpness assessment as an example, the introduced system can be used to process, analyze and parallelize analysis of whole slide images based on open source software.

关键词： Virtual Slide Focus Measure Virtual Microscopy Stream Server Slide image

来源：评论

学校读者我要写书评

暂无评论

parallel nearest neighbour clustering algorithm (PNNCA) for segmenting retinal blood vessels

Parallel nearest neighbour clustering algorithm (PNNCA) for ...

引用

International conference on parallel and distributed Computing and Networks

作者： Salem, Sameh A. Nandi, Asoke K. Univ Liverpool Dept Elect & Elect Engn Signal Proc & Commun Grp Liverpool L69 3GJ Merseyside England

ISBN: (纸本)9780889866379

In this paper, the design and implementation of a recently developed clustering algorithm NNCA [1], Nearest Neighhour Clustering Algorithm, is proposed in conjunction with a Fast K Nearest Neighbour (FKNN) strategy for further reduction in processing time. The parallel algorithm (PNNCA) has the ability to cluster pixels of retinal images into those belonging to blood vessels and others not belonging to blood vessels in a reasonable time.

关键词： parallel processing retinal image segmentation data clustering unsupervised classification computer clusters

来源：评论

学校读者我要写书评

暂无评论

A proposal of parallel strategy for global wavelet-based registration of remote-sensing images

引用

6th International conference on Algorithms and Architectures for parallel processing

作者： Zhou, HF Tang, Y Yang, XJ Liu, HZ Natl Univ Def Technol Sch Comp Changsha Peoples R China

ISBN: (纸本)3540292357

With the increasing importance of multiple multiplatform remote sensing missions, digital image registration has been applied into many fields, and specially plays a very important role in remotely sensed data processing. Firstly a brief introduction of existing parallel methods of wavelet-based global registration is given. And then the communication optimization for GP method is described. The optimized algorithm is named Group-Optimized-parallel (GOP for short). To find out the reason of occasionally lower efficiency of GOP than other methods, a more careful analysis is presented in theory and proved in experiments. Moreover, we give a quantitative criterion, called Remainder Items, to choose the best solution in different input conditions.

关键词： image processing

来源：评论

学校读者我要写书评

暂无评论

Intensity-based image registration using multiple distributed agents

引用

KNOWLEDGE-BASED SYSTEMS 2008年第3期21卷 256-264页

作者： Tait, Roger J. Schaefer, Gerald Hopgood, Adrian A. De Montfort Univ Fac Comp Sci & Engn Leicester LE1 9BH Leics England Nottingham Trent Univ Sch Comp & Informat Nottingham NG11 8NS England Aston Univ Sch Engn & Appl Sci Birmingham B4 7ET W Midlands England

image registration is the process of geometrically aligning images taken from different sensors, viewpoints or instances in time. It plays a key role in the detection of defects or anomalies for automated visual inspection. A multiagent distributed blackboard system has been developed for intensity-based image registration. The images are divided into segments and allocated to agents on separate processors, allowing parallel computation of a similarity metric that measures the degree of likeness between reference and sensed images after the application of a transform. The need for a dedicated control module is removed by coordination of agents via the blackboard. Tests show that additional agents increase speed, provided the communication capacity of the blackboard is not saturated. The success of the approach in achieving registration, despite significant misalignment of the original images, is demonstrated in the detection of manufacturing defects on screen-printed plastic bottles and printed circuit boards. (c) 2007 Elsevier B.V. All rights reserved.

关键词： DARBS distributed blackboard system parallel processing image registration similarity metric

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Splitting-Up Conjugate Gradient Method on GPUs 24

Evaluation of Splitting-Up Conjugate Gradient Method on GPUs

引用

24th Euromicro International conference on parallel, distributed, and Network-Based processing (PDP)

作者： Wakatani, Akiyoshi Konan Univ Fac Intelligence & Informat Kobe Hyogo Japan

ISBN: (纸本)9781467387767

This paper describes the implementation of a preconditioned CG (Conjugate Gradient) method on GPUs and evaluates the performance compared with CPUs. Our CG method utilizes SP (Splitting-Up) preconditioner, which is suitable for parallel processing because other dimensions except for one dimension are independent. In order to enhance the memory bandwidth to the global memory of GPUs, our implementation utilizes a pseudo matrix transposition before and after a tridiagonal matrix solver, which results in coalesced memory accesses. In addition, the number of pseudo matrix transpositions can be reduced to only one by using a rotation configuration technique. By these techniques, the speedups of our approach can be enhanced by up to 102.2%.

关键词： Iterative methods matrix transposition coalesced memory access memory bandwidth: preconditioning

来源：评论

学校读者我要写书评

暂无评论

Large-scale grid computing for content-based image retrieval

引用

ASLIB PROCEEDINGS 2010年第4-5期62卷 438-446页

作者： Town, Chris Harrison, Karl Univ Cambridge Comp Lab Cambridge CB2 3QG England Imense Ltd Cambridge England Univ Birmingham Sch Phys & Astron Birmingham W Midlands England

Purpose - Content-based image retrieval (CBIR) technologies offer many advantages over purely text-based image search. However, one of the drawbacks associated with CBIR is the increased computational cost arising from tasks such as image processing, feature extraction, image classification, and object detection and recognition. Consequently CBIR systems have suffered from a lack of scalability, which has greatly hampered their adoption for real-world public and commercial image search. At the same time, paradigms for large-scale heterogeneous distributed computing such as grid computing, cloud computing, and utility-based computing are gaining traction as a way of providing more scalable and efficient solutions to large-scale computing tasks. Design/methodology/approach - This paper presents an approach in which a large distributed processing grid has been used to apply a range of CBIR methods to a substantial number of images. By massively distributing the required computational task across thousands of grid nodes, very high through-put has been achieved at relatively low overheads. Findings - This has allowed one to analyse and index about 25 million high resolution images thus far, while using just two servers for storage and job submission. The CBIR system was developed by Imense Ltd and is based on automated analysis and recognition of image content using a semantic ontology. It features a range of image-processing and analysis modules, including image segmentation, region classification, scene analysis, object detection, and face recognition methods. Originality/value - In the case of content-based image analysis, the primary performance criterion is the overall through-put achieved by the system in terms of the number of images that can be processed over a given time frame, irrespective of the time taken to process any given image. As such, grid processing has great potential for massively parallel content-based image retrieval and other tasks with similar p

关键词： Data handling Pattern recognition Data analysis Virtual work

来源：评论

学校读者我要写书评

暂无评论

Automatic refinement for Event-B through annotated patterns 25

Automatic refinement for Event-B through annotated patterns

引用

25th Euromicro International conference on parallel, distributed and Network-Based processing (PDP)

作者： Siala, Badr Bodeveix, Jean-Paul Filali, Mamoun Bhiri, Mohamed Tahar Univ Sfax Sfax Tunisia Univ Toulouse IRIT UPS Toulouse France Univ Toulouse IRIT CNRS Toulouse France

In this paper, we investigate how patterns could be used in order to generate Event-B refinements automatically through DSL(s) for temporal, timed or distribution patterns. Our ulimate goal is to generate code for a c... 详细信息

ISBN: (纸本)9781509060580

关键词： BIP correct by construction distributed systems Event-B Formal methods patterns

来源：评论

学校读者我要写书评

暂无评论

Encoding MPEG-2 video batches using a multiprocessor machine

Encoding MPEG-2 video batches using a multiprocessor machine

引用

SPIE conference on parallel and distributed methods for image processing II

作者： Kafil, M Ahmad, I Liou, ML Hong Kong Univ Sci & Technol Dept Comp Sci Kowloon Hong Kong

ISBN: (纸本)0819429074

We present a parallel MPEG-2 video encoder on the Intel Paragon parallel computer. Given a video sequence or a set of sequences, the aim of the encoder is to achieve the maximum possible encoding rate. To achieve this aim, the parallel encoder works by a combined scheduling of processors, I/O nodes, and disks, enabling the system to work in a highly balanced fashion through matching of the encoding and I/O rates. An efficient data layout scheme for video frames is also proposed in order for I/O to sustain the desired data transfer rates. Using a small percentage of processors as the I/O nodes, the utilization of the system is also high. More importantly, our encoder is scalable and with an increase in the number of processors will result in a proportional increase in the encoding rate. Given any machine configuration (that is, the number of compute processors, I/O processors, and disks), our propose strategy can logically partition the system and match the I/O and encoding rates to reach the ideal encoding rate. The experimental results indicate about two-fold gain in performance compared to the previous studies. Our approach is useful for compressing a large video sequence or batches of sequences.

关键词： MPEG-2 video encoding parallel processing scheduling Intel Paragon

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：