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

SoutheastCon Conference

作者： Renato, ivanescu Constantin Mihai, Mocanu Univ Craiova Dept Comp & Informat Technol Craiova Romania

ISBN: (纸本)9781665406529

image data is expanding rapidly, along with technology development, so efficient solutions must be considered to achieve high, real-time performance in the case of processing large image datasets. parallel processing is increasingly used as an attractive alternative to improve the performance, when using existing distributed architectures but also for sequential commodity computers. It can provide speedup, efficiency, reliability, incremental growth, and flexibility. We present such an alternative and stress the effectiveness of the methods to accelerate computations on a small cluster of PCs compared to a single CPU. Our paper is focused on applying edge detection on large image data sets, as a fundamental and challenging task in image processing and computer vision. Five different techniques, mainly Sobel, Prewitt, LoG, Canny, and Roberts, are compared in a simple experimental setup that includes the OpenCV library functions for image pixels manipulation. Gaussian blur is used to reduce high-frequency components to manage the noise that edge detection is impacted by. Overall, this work is part of a more extensive investigation of image segmentation methods on large image datasets, but the results presented are relevant and show the effectiveness of our approach.

关键词： parallel image processing edge detection OpenCV MPI

来源：评论

学校读者我要写书评

暂无评论

Robustness and Accuracy in Pipelined Bi-conjugate Gradient Stabilized methods 24th

Robustness and Accuracy in Pipelined Bi-conjugate Gradient S...

引用

24th International Conference on Computational Science (ICCS)

作者： Havdiak, Mykhailo Aliaga, Jose, I Iakymchuk, Roman Ivan Franko Natl Univ Lviv Lvov Ukraine Univ Jaime I Castellon de La Plana Spain Umea Univ Umea Sweden Uppsala Univ Uppsala Sweden

ISBN: (纸本)9783031637582;9783031637599

In this article, we propose an accuracy-assuring technique for finding a solution for unsymmetric linear systems. Such problems are related to different areas such as image processing, computer vision, and computational fluid dynamics. parallel implementation of Krylov subspace methods speeds up finding approximate solutions for linear systems. In this context, the refined approach in pipelined BiCGStab enhances scalability on distributed memory machines, yielding to substantial speed improvements compared to the standard BiCGStab method. However, it's worth noting that the pipelined BiCGStab algorithm sacrifices some accuracy, which is stabilized with the residual replacement technique. This paper aims to address this issue by employing the ExBLAS-based reproducible approach. We validate the idea on a set of matrices from the SuiteSparse Matrix Collection.

关键词： Krylov subspace methods BiCGStab Residual replacement Numerical reliability ExBLAS HPC

来源：评论

学校读者我要写书评

暂无评论

parallel vs distributed Edge Detection for Large Medical image Datasets 10

Parallel vs Distributed Edge Detection for Large Medical Ima...

引用

10th E-Health and Bioengineering Conference, EHB 2022

作者： ivanescu, Renato Constantin Nagy, Rodica Ofiteru, Anca Istrate Comanescu, Cristina Manda, Alexandru Department of Computers and Information Technology University of Craiova Craiova Romania University of Medicine and Pharmacy of Craiova University of Craiova Craiova Romania

ISBN: (纸本)9781665485579

The medical routine of the future is strongly influenced by medical information technology. The quality and efficiency of medicine are at higher standards due to the image-based methods and the increase in computation power. parallel and distributed computing are attractive alternatives to improve processing performance in many areas of study and this paper investigates such solutions for increasing the throughput on large datasets in medical imaging. In this research, different edge detection techniques are used for image processing, as it is the most common and challenging task in the medical domain. The results are relevant and present the effectiveness of the two processing approaches compared to a single CPU for the acceleration of medical image processing. The CUDA processing platform using a hybrid streams-based programming model is the parallel approach. The distributed system is a Linux-based cluster, which uses message passing for communication and efficient load balancing between nodes for high performance. This paper highlights parallel computing as a very good solution for processing large image datasets in the medical domain. Good results were also obtained for the distributed system. © 2022 IEEE.

关键词： Computer operating systems

来源：评论

学校读者我要写书评

暂无评论

An image generator based on neural networks in GPU

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2022年第25期81卷 36353-36374页

作者： Silva, Thiago W. Reis, Halamo Melcher, Elmar U. K. Lima, Antonio M. N. Brito, Alisson, V Fed Univ Campina Grande UFCG Campina Grande Paraiba Brazil Fed Univ Ceara UFC Quixada Brazil Fed Univ Paraiba UFPB Joao Pessoa Paraiba Brazil

Existing image databases contain a few diversity of images. Likewise, there is no specific image base available in other situations, leading to the need to undertake additional efforts in capturing images and creating datasets. Many of these datasets contain only a single object in each image, but often the scenario in which projects must operate in production requires several objects per image. Thus, it is necessary to expand original datasets into more complex ones with specific combinations to achieve the goal of the application. This work proposes a technique for image generation to extend an initial dataset. It has been designed generically to work with various images and create a data set from some initial images. The generated set of images is used in a distributed environment. It is possible to perform image generation in this environment, producing datasets with specific images to work in certain applications. The generation of images consists of two methods: generation by deformation and generation by a neural network. With the proposed methods, this work sought to bring as main contributions the specification and implementation of an image generating component so that it is possible to easily integrate it with possible heterogeneous devices capable of parallel computing, such as General Purpose Graphics processing Unit (GPGPU). In comparison with the existing methods to the proposed one, this one proposes to use the image generator enlarging an initial image bank with the combination of two methods. Some experiments are presented doing generation with handwritten digits to validate the proposed approach. The generator was designed with CUDA and GPU-optimized libraries as TensorFlow-specific modules. The results obtained can optimize the integration process with the simulation of possible stimuli choices, avoiding problems in the generation of image phase tests.

关键词： image generation GPU Neural network Generation by deformation Functional verification

来源：评论

学校读者我要写书评

暂无评论

Efficient Allocation of image Recognition and LLM Tasks on Multi-GPU System 15th

Efficient Allocation of Image Recognition and LLM Tasks on...

引用

15th International Conference on parallel processing and Applied Mathematics, PPAM 2024

作者： Lawenda, Marcin Samborski, Krzesimir Khloponin, Kyrylo Szustak, Lukasz Poznan Supercomputing and Networking Center Jana Pawla II 10 Poznań61-139 Poland Czestochowa University of Technology Dąbrowskiego 69 Częstochowa42-201 Poland

ISBN: (纸本)9783031857027

This work is concerned with the evaluation of the performance of parallelization of learning and tuning processes for image classification and large language models. For machine learning model in image recognition, various parallelization methods are developed based on different hardware and software scenarios: simple data parallelism, distributed data parallelism, and distributed processing. A detailed description of presented strategies is given, highlighting the challenges and benefits of their application. Furthermore, the impact of different dataset types on the tuning process of large language models is investigated. Experiments show to what extent the task type affects the iteration time in a multi-GPU environment, offering valuable insights into the optimal data utilization strategies to improve model performance. Furthermore, this study leverages the built-in parallelization mechanisms of PyTorch that can facilitate these tasks. Furthermore, performance profiling is incorporated into the study to thoroughly evaluate the impact of memory and communication operations during the training/tuning procedure. Test scenarios are developed and tested with numerous benchmarks on the NVIDIA H100 architecture showing efficiency through selected metrics. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Multimodal Interaction Fusion Network for Cloth-Changing Person Re-Identification 22

Multimodal Interaction Fusion Network for Cloth-Changing Per...

引用

22nd IEEE International Symposium on parallel and distributed processing with Applications, ISPA 2024

作者： Yuan, Caihong Xu, Yuanchen Guan, Zhijie Chen, Xiaopan Zhu, Xiaoke Liang, Wenjuan Henan University School of Computer and Information Engineering Kaifeng China Henan Engineering Research Center of Intelligent Technology and Application Henan Province Spatial Information Processing Engineering Technology Research Center Kaifeng China

ISBN: (纸本)9798331509712

Cloth-Changing Person Re-Identification (CC-ReID) refers to the technology that can identify the same individual in surveillance scenarios, even after changing their clothes. The core of CC-ReID is to exact cloth-irrelevant identity features. Existing methods usually extract them from body contours, skeletons, human faces, etc. However, information extracted from a single modality is often insufficient. Therefore, we propose a novel Multimodal Interaction Fusion (MIF) framework that could facilitate the deep integration of multimodal information, thereby enhancing the generalization ability of CC-ReID. Specifically, we design a triple-interaction collaborative module that strategically integrates features captured from body posture, original RGB images, and clothes-erased images, maximizing the advantages of each modality and overcoming their limitations. Additionally, we develop an Adapt-Blend Pool (ABP) module that effectively improves pooling methods to enhance the model's ability to process images with complex backgrounds and varied features. Following training, our framework effectively harnesses a variety of modal inputs to capture identity representations independent of clothing accurately. Extensive experimental results on PRCC, LTCC, and VC-Clothes datasets demonstrate the effectiveness of the proposed method. © 2024 IEEE.

关键词： image enhancement

来源：评论

学校读者我要写书评

暂无评论

Fast parallel Bayesian Network Structure Learning 36

Fast Parallel Bayesian Network Structure Learning

引用

36th IEEE International parallel and distributed processing Symposium (IEEE IPDPS)

作者： Jiang, Jiantong Wen, Zeyi Mian, Ajmal Univ Western Australia Dept Comp Sci & Software Engn Nedlands WA Australia

ISBN: (纸本)9781665481069

Bayesian networks (BNs) are a widely used graphical model in machine learning for representing knowledge with uncertainty. The mainstream BN structure learning methods require performing a large number of conditional independence (CI) tests. The learning process is very time-consuming, especially for high-dimensional problems, which hinders the adoption of BNs to more applications. Existing works attempt to accelerate the learning process with parallelism, but face issues including load unbalancing, costly atomic operations and dominant parallel overhead. In this paper, we propose a fast solution named Fast-BNS on multi-core CPUs to enhance the efficiency of the BN structure learning. Fast-BNS is powered by a series of efficiency optimizations including (i) designing a dynamic work pool to monitor the processing of edges and to better schedule the workloads among threads, (ii) grouping the CI tests of the edges with the same endpoints to reduce the number of unnecessary CI tests, (iii) using a cache-friendly data storage to improve the memory efficiency, and (iv) generating the conditioning sets on-the-fly to avoid extra memory consumption. A comprehensive experimental study shows that the sequential version of Fast-BNS is up to 50 times faster than its counterpart, and the parallel version of Fast-BNS achieves 4.8 to 24.5 times speedup over the state-of-the-art multi-threaded solution. Moreover, Fast-BNS has a good scalability to the network size as well as sample size.

关键词： Schedules Uncertainty Instruction sets Scalability Memory management parallel processing Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Deep Neural Network Training With distributed K-FAC

引用

IEEE TRANSACTIONS ON parallel AND distributed SYSTEMS 2022年第12期33卷 3616-3627页

作者： Pauloski, J. Gregory Huang, Lei Xu, Weijia Chard, Kyle Foster, Ian T. Zhang, Zhao Univ Chicago Dept Comp Sci Chicago IL 60637 USA Texas Adv Comp Ctr Austin TX 78758 USA

Scaling deep neural network training to more processors and larger batch sizes is key to reducing end-to-end training time;yet, maintaining comparable convergence and hardware utilization at larger scales is challenging. Increases in training scales have enabled natural gradient optimization methods as a reasonable alternative to stochastic gradient descent and variants thereof. Kronecker-factored Approximate Curvature (K-FAC), a natural gradient method, preconditions gradients with an efficient approximation of the Fisher Information Matrix to improve per-iteration progress when optimizing an objective function. Here we propose a scalable K-FAC algorithm and investigate K-FAC's applicability in large-scale deep neural network training. Specifically, we explore layer-wise distribution strategies, inverse-free second-order gradient evaluation, and dynamic K-FAC update decoupling, with the goal of preserving convergence while minimizing training time. We evaluate the convergence and scaling properties of our K-FAC gradient preconditioner, for image classification, object detection, and language modeling applications. In all applications, our implementation converges to baseline performance targets in 9-25% less time than the standard first-order optimizers on GPU clusters across a variety of scales.

关键词： Training parallel processing Program processors Convergence Computational modeling Data models Deep learning Optimization methods neural networks scalability high-performance computing

来源：评论

学校读者我要写书评

暂无评论

Speed Up Federated Learning in Heterogeneous Environments: A Dynamic Tiering Approach

引用

IEEE INTERNET OF THINGS JOURNAL 2025年第5期12卷 5026-5035页

作者： Mahmoud Sajjadi Mohammadabadi, Seyed Zawad, Syed Yan, Feng Yang, Lei Univ Nevada Reno Dept Comp Sci & Engn Reno NV 89557 USA IBM Res Almaden Res Dept San Jose CA 95120 USA Univ Houston Comp Sci Dept Houston TX 77004 USA Univ Houston Elect & Comp Engn Dept Houston TX 77004 USA

Federated learning (FL) enables collaborative training of a model while keeping the training data decentralized and private. However, in Internet of Things systems, inherent heterogeneity in processing power, communication bandwidth, and task size can significantly hinder the efficient training of large models. Such heterogeneity would render vast variations in the training time of clients, lengthening overall training and wasting resources of faster clients. To tackle these heterogeneity challenges, we propose dynamic tiering-based FL (DTFL), a novel system that leverages distributed optimization principles to improve the edge learning performance. Based on clients' resources, DTFL dynamically offloads part of the global model to the server, alleviating resource constraints on slower clients and speeding up training. By leveraging split learning, DTFL offloads different portions of the global model to clients in different tiers and enables each client to update the models in parallel via local-loss-based training. This helps reduce the computation and communication demand on resource-constrained devices, mitigating the straggler problem. DTFL introduces a dynamic tier scheduler that uses tier profiling to estimate the expected training time of each client based on their historical training time, communication speed, and dataset size. The dynamic tier scheduler assigns clients to suitable tiers to minimize the overall training time in each round. We theoretically prove the convergence properties of DTFL and validate its effectiveness by training large models (ResNet-56 and ResNet-110) across varying numbers of clients (from 10 to 200) using the popular image datasets (CIFAR-10, CIFAR-100, CINIC-10, and HAM10000) under both I.I.D and non-I.I.D systems. DTFL seamlessly integrates various privacy measures without sacrificing performance. Extensive experimental results show that compared with state-of-the-art FL methods, DTFL can significantly reduce the training time b

关键词： Training Computational modeling Internet of Things Servers Federated learning Accuracy Dynamic scheduling Performance evaluation Optimization Load modeling distributed optimization edge computing federated learning (FL) heterogeneous devices split learning (SL)

来源：评论

学校读者我要写书评

暂无评论

Generative Enhancement-based Similarity Prediction Hashing for image Retrieval 29

Generative Enhancement-based Similarity Prediction Hashing f...

引用

29th IEEE International Conference on parallel and distributed Systems, ICPADS 2023

作者： Cao, Yuan Meng, Fanlei Wu, Xiangyu Wang, Zijie Ocean University of China School of Computer Science and Technology Qingdao China

ISBN: (纸本)9798350330717

Hashing is frequently used in approximate nearest neighbor search due to its storage and search efficiency. On account of the bottleneck of traditional learning to hash methods, deep-based learning to hash has gained quite a popularity among researchers recently. While such methods show a promising performance gain by utilizing deep neural networks into its end-to-end training process to generate compact binary codes, the intrinsic connections between components make it unfeasible to optimize the architecture significantly. Subject to noise interference and absence of similarity labels of training data, normal unsupervised deep models even carry a noticeable deviation at representation learning stage. By integrating Generative Adversarial Network, this paper presents a novel architecture for generating compact hash codes from an extended set derived from original images while using the benefit of similarity prediction. Extensive experiments conducted on three benchmarks, NUS-WIDE, CIFAR-10, and MS-COCO illustrate that our method outperforms state-of-the-art image retrieval models and generates high-quality binary hash codes seamlessly. © 2023 IEEE.

关键词： generative model hashing image retrieval unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：