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

2015 IEEE 16th International Conference on Communication Technology(ICCT 2015)

作者： Xiang Zhang Naiyang Guan Zhigang Luo College of Computer National University of Defense Technology National Laboratory for Parallel and Distributed Processing National University of Defense Technology

Sparse coding has shown its great potential in learning image feature representation. Recent developed methods such as group sparse coding prefer discovering the group relationships among examples and have achieved the state-of-the-art results in image classification. However, they suffer from poor robustness shortcomings in practice. This paper proposes a robust weighted supervised sparse coding method(RWSSC) to address this ***, RWSSC distinguishes different classes' contributions to the sparse coding by a novel weighting strategy meanwhile removes the out liers by imposing1 l-regularization over the noisy entries. Benefitting from these strategies, RWSSC can effectively boost performance of sparse coding in image ***, we developed the block coordinate descent algorithm to optimize it, and proved its *** results of image classification on two popular datasets show that RWSSC outperforms the representative sparse coding methods in quantities.

关键词： Sparse coding Supervised learning image classification

来源：评论

学校读者我要写书评

暂无评论

Robust weighted supervised sparse coding for image classification

Robust weighted supervised sparse coding for image classific...

引用

International Conference on Communication Technology (ICCT)

作者： Xiang Zhang Naiyang Guan Zhigang Luo College of Computer National University of Defense Technology Changsha China National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9781467370066

Sparse coding has shown its great potential in learning image feature representation. Recent developed methods such as group sparse coding prefer discovering the group relationships among examples and have achieved the state-of-the-art results in image classification. However, they suffer from poor robustness shortcomings in practice. This paper proposes a robust weighted supervised sparse coding method (RWSSC) to address this deficiency. Particularly, RWSSC distinguishes different classes' contributions to the sparse coding by a novel weighting strategy meanwhile removes the out liers by imposing l1-regularization over the noisy entries. Benefitting from these strategies, RWSSC can effectively boost performance of sparse coding in image classification. Besides, we developed the block coordinate descent algorithm to optimize it, and proved its convergence. Experimental results of image classification on two popular datasets show that RWSSC outperforms the representative sparse coding methods in quantities.

关键词： Support vector machines Robustness Classification algorithms Dictionaries Manganese

来源：评论

学校读者我要写书评

暂无评论

基于MPI的大规模遥感影像金字塔并行构建方法

引用

地球信息科学学报 2015年第5期17卷 515-522页

作者：赫高进熊伟陈荦吴秋云景宁国防科学技术大学电子科学与工程学院长沙410073

影像金字塔是实现影像数据多分辨率组织的重要方式,是提高影像可视化性能的有效手段。传统串行金字塔构建算法,对大规模影像数据的构建性能已无法满足遥感影像快速浏览的预处理需求。故此,其成为一个亟待解决的问题,而利用多核、多节点... 详细信息

影像金字塔是实现影像数据多分辨率组织的重要方式,是提高影像可视化性能的有效手段。传统串行金字塔构建算法,对大规模影像数据的构建性能已无法满足遥感影像快速浏览的预处理需求。故此,其成为一个亟待解决的问题,而利用多核、多节点的高性能集群计算环境和并行机制是一个重要的技术途径。本文在共享外存的高性能集群环境下,提出使用消息传递接口(MPI)的金字塔并行构建算法,对构建遥感影像金字塔过程中的重采样与I/O过程进行并行处理,大大缩短了遥感影像金字塔构建时间。实验结果表明:(1)该算法比传统串行构建方法的加速效果明显,对于单波段遥感影像,其加速效果可达到GDAL的5倍以上,而对于多波段遥感影像,加速效果可达到GDAL的2倍以上;(2)遥感影像数据量越大,并行构建算法加速效果越显著,对于大规模的遥感影像,本文提出的金字塔并行构建算法的速度可达到GDAL的10倍左右。

关键词：遥感影像金字塔消息传递接口并行集群

来源：评论

学校读者我要写书评

暂无评论

New accelerated graph-based method of image segmentation applying minimum spanning tree

引用

IET image processing 2014年第4期8卷 239-251页

作者： Fabijanska, Anna Goclawski, Jaroslaw Lodz Univ Technol Inst Appl Comp Sci Lodz Poland

In this paper problem of graph based image segmentation is considered. In particular, attention is paid to minimal spanning tree based algorithm proposed by Felzenszwalb and Huttenlocher (FH). Although the method yields high quality results for various classes of images, its application is limited mainly to off-line processing. Its due to the very long execution time of the FH method, which in the case of high resolution images, requires processing of millions of vertices and edges contained within the resulting graph. Therefore, some improvements to the FH method are proposed in this paper. The modifications aim at the reduction of algorithm execution time and the usage of computer host memory. These goals are achieved both by reducing the size of input image graph and by applying the methods of GPU parallel computing at initial stages of the algorithm. As the reduction of graph size is obtained by processing meta-pixels representing homogenous regions, the new method is most suitable for the segmentation of images including rare, structurally complex objects distributed over nonuniform background. Results obtained by the introduced approach are compared with the results of the original FH method and other popular graph-based approaches to image segmentation. The comparison includes both the accuracy of image segmentation and the execution time. Analysis of the results clearly shows, that the proposed approach in many cases can significantly accelerate segmentation process without a noticeable loss of image segmentation quality.

关键词： graph theory image segmentation trees (mathematics) image segmentation minimum tree accelerated graph-based method FH algorithm Felzenszwalb and Huttenlocher algorithm

来源：评论

学校读者我要写书评

暂无评论

Oscillatory Neural Networks: In Problems of parallel Information processing

引用

2014年

作者： Margarita G. Kuzmina Eduard A. Manykin Evgeny S. Grichuk

ISBN: (数字)9783110269208

ISBN: (纸本)9783110268355

Understanding of the human brain functioning currently represents a challenging problem. In contrast to usual serial computers and complicated hierarchically organized artificial man-made systems, decentralized, parallel and distributed information processing principles are inherent to the brain. Besides adaptation and learning, which play a crucial role in brain functioning, oscillatory neural activity, synchronization and resonance accompany the brain work. Neural-like oscillatory network models, designed by the authors for image processing, allow to elucidate the capabilities of dynamical, synchronization-based types of image processing, presumably exploited by the brain. The oscillatory network models, studied by means of computer modeling and qualitative analysis, are presented and discussed in the book. Some other problems of parallel distributed information processing are also considered, such as a recall process from network memory for large-scale recurrent associative memory neural networks, performance of oscillatory networks of associative memory, dynamical oscillatory network methods of image processing with synchronization-based performance, optical parallel information processing based on the nonlinear optical phenomenon of photon echo, and modeling random electric fields of quasi-monochromatic polarized light beams using systems of superposed stochastic oscillators. This makes the book highly interesting to researchers dealing with various aspects of parallel information processing.

关键词： Human information processing. Neural networks (Neurobiology)

来源：评论

学校读者我要写书评

暂无评论

Using local utility maximization to detect social networks communities

Using local utility maximization to detect social networks c...

引用

CSI International Symposium on Computer Science and Software Engineering (CSSE)

作者： Ardavan Afshar Bahareh Ashenagar Negar Foroutan Eghlidi Mansour Zolghadri Jahromi Ali Hamzeh Department of Computer Science and Engineering & IT Shiraz University Shiraz Iran Shiraz University Shiraz Fars IR

ISBN: (纸本)9781467391825

Community detection has recently turned to be one of the most popular research topics in social networks analysis. Majority of community detection methods already considered in the literature try to optimize a global metric through a centralized decision maker. These approaches are too time-consuming in huge networks. Several of methods need initial parameters such as number and size of communities in order to find out the problems; however, they are not always reachable. In this paper, we propose a local utility maximization approach for community identification as a distributed framework in which each community acts as a selfish agent to maximize its utility function based on some predefined actions. Our framework has some crucial characteristic features. The first feature is the local approach that is easily implemented through parallel computing concepts, while the second is an economical interpretation of utility measurement. Experimental results on output benchmark datasets show that our proposed method can perform as well as the existing centralized approaches that already exist in the literature to detect non-overlapping communities.

关键词： Social network services Measurement image edge detection Symmetric matrices Eigenvalues and eigenfunctions Computer science parallel processing

来源：评论

学校读者我要写书评

暂无评论

SU-C-207A-06: On-Line Beam Range Verification with Multiple Scanning Particle Beams: Initial Feasibility Study with Simulations

引用

Medical Physics 2016年第6PART3期43卷 3325-3325页

作者： Y Zhong X Sun W Lu X Jia J Wang Y Shao The University of Texas Southwestern Medical Ctr. Dallas TX

Purpose: To investigate the feasibility and requirement for intra-fraction on-line multiple scanning particle beam range verifications (BRVs) with in-situ PET imaging, which is beyond the current single-beam BRV with extra factors that will affect the BR measurement accuracy, such as beam diameter, separation between beams, and different image counts at different BRV positions. methods: We simulated a 110-MeV proton beam with 5-mm diameter irradiating a uniform PMMA phantom by GATE simulation, which generated nuclear interaction-induced positrons. In this preliminary study, we simply duplicated these positrons and placed them next to the initial protons to approximately mimic the two spatially separated positron distributions produced by two beams parallel to each other but with different beam ranges. These positrons were then imaged by a PET (∼2-mm resolution, 10% sensitivity, 320×320×128 mm^3 FOV) with different acquisition times. We calculated the positron activity ranges (ARs) from reconstructed PET images and compared them with the corresponding ARs of original positron distributions. Results: Without further image data processing and correction, the preliminary study show the errors between the measured and original ARs varied from 0.2 mm to 2.3 mm as center-to-center separations and range differences were in the range of 8–12 mm and 2–8 mm respectively, indicating the accuracy of AR measurement strongly depends on the beam separations and range differences. In addition, it is feasible to achieve ≤ 1.0-mm accuracy for both beams with 1-min PET acquisition and 12 mm beam separation. Conclusion: This study shows that the overlap between the positron distributions from multiple scanning beams can significantly impact the accuracy of BRVs of distributed particle beams and need to be further addressed beyond the established method of single-beam BRV, but it also indicates the feasibility to achieve accurate on-line multi-beam BRV with further improved method.

关键词： Positron beams Positrons Positron emission tomography image reconstruction Protons Electric measurements Spatial dimensions Nuclear interactions Data processing

来源：评论

学校读者我要写书评

暂无评论

Building High Performance System for processing a Daily Large Volume of Chinese Satellites imagery 4

Building High Performance System for Processing a Daily Larg...

引用

Conference on High-Performance Computing in Remote Sensing iv

作者： Deng, Huawu Huang, Shicun Wang, Qi Pan, Zhiqiang Xin, Yubin Natl Capital Off PCI Geomat Quebec City PQ J9J 0L6 Canada

ISBN: (纸本)9781628413106

The number of Earth observation satellites from China increases dramatically recently and those satellites are acquiring a large volume of imagery daily. As the main portal of image processing and distribution from those Chinese satellites, the China Centre for Resources Satellite Data and Application (CRESDA) has been working with PCI Geomatics during the last three years to solve two issues in this regard: processing the large volume of data (about 1,500 scenes or 1 TB per day) in a timely manner and generating geometrically accurate orthorectified products. After three-year research and development, a high performance system has been built and successfully delivered. The high performance system has a service oriented architecture and can be deployed to a cluster of computers that may be configured with high end computing power. The high performance is gained through, first, making image processing algorithms into parallel computing by using high performance graphic processing unit (GPU) cards and multiple cores from multiple CPUs, and, second, distributing processing tasks to a cluster of computing nodes. While achieving up to thirty (and even more) times faster in performance compared with the traditional practice, a particular methodology was developed to improve the geometric accuracy of images acquired from Chinese satellites (including HJ-1 A/B, ZY-1-02C, ZY-3, GF-1, etc.). The methodology consists of fully automatic collection of dense ground control points (GCP) from various resources and then application of those points to improve the photogrammetric model of the images. The delivered system is up running at CRESDA for pre-operational production and has been and is generating good return on investment by eliminating a great amount of manual labor and increasing more than ten times of data throughput daily with fewer operators. Future work, such as development of more performance-optimized algorithms, robust image matching methods and application workflows

关键词： High Performance Computing (HPC) parallel Computing distributed Computing GPU CPU System Satellite imagery Orthorectification Geometric Accuracy Ground Control Points (GCP)

来源：评论

学校读者我要写书评

暂无评论

基於田口法與FPGA平行運算辨識物件顏色之影像處理

基於田口法與FPGA平行運算辨識物件顏色之影像處理

引用

作者：李彥儀虎尾科技大學

学位级别：碩士

本论文研究主要目的为运用田口统计分析与FPGA(Field programmable gate array)平行运算平台，进行分析不同物件颜色之影像辨识与处理。FPGA硬体平台使用DE2-115发展板，其内含处理器为Altera Cyclone iv的FPGA晶片，并利用其平行机制... 详细信息

本论文研究主要目的为运用田口统计分析与FPGA(Field programmable gate array)平行运算平台，进行分析不同物件颜色之影像辨识与处理。FPGA硬体平台使用DE2-115发展板，其内含处理器为Altera Cyclone iv的FPGA晶片，并利用其平行机制的特性，於每时脉循环可同时完成多重平行运算作业，因此超越数位讯号处理器(Digital signal processor，简称DSP)的计算速度，硬体层级控制Input/Output(I/O)与其他硬体比较更可缩短响应时间。物件颜色阀值方面则是以Red/Green/Blue(RGB)空间为色域基础，并将整体影像转为二值化以利於分离目标色彩与其它色彩，本实验以Red、Green及Blue的物件作为辨识目标，并透过各物件有效像素色彩值的统计，接着使用田口品质方法将辨识阀值上调与下调一定的裕度後，排列成全因子的形式并再度重新进行最佳化色彩辨识，以探讨是否提高物件辨识的精准度。最後尝试将全因子的排列方式写入FPGA平台，并将阀值的有效像素值显示於七段显示器上，与依照色码表所找出的手动阀值辨识结果做比对及验证，且使用田口品质方法进行S/N比以及变异数分析的运算，找出各因子所造成的贡献度。所有影像部分皆以VGA或是VEEK-MT作为输出平台；程式方面使用Quartus II 11.1进行编译，而硬体描述语言部份则是使用Verilog HDL的方式来实现以上的方法；田口品质方法以望大型来计算有效像素值的S/N信号杂音比。变异数分析红色物件的辨识结果，最佳化组合为R1G3B2，主要趋势影响最大的是B因子，贡献度也是B因子较多为78.73824%，误差比例为8.472%；绿色物件的最佳化组合为R2G1B3，主要趋势影响最大的是G因子，其贡献度也最多为62.44788%，误差比例为8.626%；蓝色物件的最佳化组合为R3G3B3，影响主要趋势最高的也是G因子，贡献度为36.40271%，但其误差高达35.018%

关键词： FPGA 平行運算影像處理田口品質方法最佳化分析

来源：评论

学校读者我要写书评

暂无评论

The framework of P systems applied to solve optimal watermarking problem

引用

SIGNAL processing 2014年 101卷 256-265页

作者： Peng, Hong Wang, Jun Perez-Jimenez, Mario J. Riscos-Nunez, Agustin Xihua Univ Ctr Radio Adm & Technol Dev Chengdu 610039 Peoples R China Xihua Univ Sch Elect & Informat Engn Chengdu 610039 Peoples R China Univ Seville Dept Comp Sci & Artificial Intelligence Res Grp Nat Comp E-41012 Seville Spain

Membrane computing (known as P systems) is a novel class of distributed parallel computing models inspired by the structure and functioning of living cells and organs, and its application to the real-world problems has become a hot topic in recent years. This paper discusses an interesting open problem in digital watermarking domain, optimal watermarking problem, and proposes a new optimal image watermarking method under the framework of P systems. A special membrane structure is designed and its cells as parallel computing units are used to find the optimal watermarking parameters for image blocks. Some cells use the position-velocity model to evolve watermarking parameters of image blocks, while another cell evaluates the objects in the system. In addition to the evolution rules, communication rules are used to exchange and share information between the cells. Simulation experiments on large image set compare the proposed framework with other existing watermarking methods and demonstrate its superiority. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Membrane computing P systems image watermarking Optimal watermarking problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：