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

An Efficient Reversible Digital Oil Painting Technique for Smartphone and Tablet Users

IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS 2022年第6期69卷 6420-6428页

作者： Dutta, Tanima Mohanty, Sabyasachi Gupta, Hari Prabhat Banaras Hindu Univ Indian Inst Technol Varanasi 221005 Uttar Pradesh India

With the increase in mobility in technology, artists are looking for ways to create paintings using their tablets and smartphones while on the move. Digital oil painting is a revolutionary technique where an artist uses digital paintbrush to simulate the traditional bristle paintbrush of a painting to get an oil paint image. In this article, we propose a novel realistic technique for reversible digital oil painting to accelerate the users to (re)paint an oil paint image to convey the surrounding atmosphere, express their emotions and feelings, or showcase a time of day or type of weather through that painting. Realism is all about accuracy. To repaint, the original image is retrieved from the existing oil paint image by reversing the pixels to its original value. We derive a mathematical expression to determine the probability of a pixel, with a set of neighbor pixels, being oil painted to get an oil paint image of the desired quality, which reduces the time and space complexities of the technique. We also develop prototypes on Android, Windows, and Ubuntu operating systems that successfully implement the proposed technique.

关键词： Oils Painting Paints partitioning algorithms Image color analysis Smart devices Meteorology Digital oil paints reversible painting smartphone usage spatial filtering

来源：评论

学校读者我要写书评

暂无评论

A Practical Energy/Power Reduction Approach for Parallel Decimal Multiplier

引用

IEEE ACCESS 2022年 10卷 11372-11381页

作者： Gorgin, Saeid Nejad, Helia Zareie Lee, Jeong-A Chosun Univ Dept Comp Engn Gwangju 61452 South Korea Iranian Res Org Sci & Technol Dept Elect Engn & Informat Technol Tehran *** Iran Islamic Azad Univ Qazvin Branch Comp & Informat Technol Engn Qazvin 341851416 Iran

Decimal computation is highly demanded in many human-centric applications such as banking, accounting, tax calculation, and currency conversion. Hence the design and implementation of radix-10 arithmetic units attract the attention of many researchers. Among the basic decimal arithmetic operations, multiplication is not only a frequent operation but also has high complexity and considerable power consumption. Therefore, this paper concentrates on this issue and studies a general design methodology that reduces power/energy consumption via localizing switching activity without compromising target performance. This method decomposes a digit multiplier into smaller ones, like Karatsuba's algorithm, while the multiplicand and the multiplier can be partitioned into different sizes. We take advantage of various size partitions in two types of symmetric and asymmetric, which final designs provide specific characteristics. All designs were implemented using VHDL and synthesized in the Design-Compiler toolbox with TSMC 130 nm Technology file. The results are significant;in respect to the original design, by a random test vector, 25% power reduction is achieved with no effect on latency and a negligible area penalty. Moreover, the experimental results indicate a potential for considerable reduction of power dissipation based on statistical properties of possible input data.

关键词： Arithmetic Switches Power demand partitioning algorithms Heuristic algorithms Hardware Licenses Decimal computation digital arithmetic low power design parallel multiplier

来源：评论

学校读者我要写书评

暂无评论

A Novel Approximate Spectral Clustering Algorithm With Dense Cores and Density Peaks

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2022年第4期52卷 2348-2360页

作者： Cheng, Dongdong Huang, Jinlong Zhang, Sulan Zhang, Xiaohua Luo, Xin Yangtze Normal Univ Coll Big Data & Intelligent Engn Chongqing 408100 Peoples R China Hiroshima Inst Technol Dept Informat & Commun Hiroshima 7315193 Japan Chinese Acad Sci Chongqing Key Lab Big Data & Intelligent Comp Chongqing 400714 Peoples R China Chinese Acad Sci Chongqing Inst Green & Intelligent Technol Chongqing Engn Res Ctr Big Data Applicat Smart Ci Chongqing 400714 Peoples R China Univ Chinese Acad Sci Chongqing Sch Chongqing 400714 Peoples R China

Spectral clustering is becoming more and more popular because it has good performance in discovering clusters with varying characteristics. However, it suffers from high computational cost, unstable clustering results and noises. This work presents a novel approximate spectral clustering based on dense cores and density peaks, called DCDP-ASC. It first finds a reduced data set by introducing the concept of dense cores;then defines a new distance based on the common neighborhood of dense cores and calculates geodesic distances between dense cores according to the new defined distance;after that constructs a decision graph with a parameter-free local density and geodesic distance for obtaining initial centers;finally calculates the similarity between dense cores with their new defined geodesic distance, employs normalized spectral clustering method to divide dense cores, and expands the result on dense cores to the whole data set by assigning each point to its representative. The results on some challenging data sets and the comparison of our algorithm with some other excellent methods demonstrate that the proposed method DCDP-ASC is more advantageous in identifying complex structured clusters containing a lot of noises.

关键词： Clustering algorithms Manifolds Matrix decomposition Sparse matrices partitioning algorithms Approximation algorithms Level measurement Approximate spectral clustering common neighborhood-based distance dense cores density peaks geodesic distance

来源：评论

学校读者我要写书评

暂无评论

Set partitioning in Hierarchical Trees for Point Cloud Attribute Compression

引用

IEEE SIGNAL PROCESSING LETTERS 2021年 28卷 1903-1907页

作者： Souto, Andre L. Figueiredo, Victor F. Chou, Philip A. de Queiroz, Ricardo L. Univ Brasilia Elect Engn Dept BR-70910900 Brasilia DF Brazil Google Seattle WA 98013 USA Univ Brasilia Comp Sci Dept BR-70910900 Brasilia DF Brazil

We propose an embedded attribute encoding method for point clouds based on set partitioning in hierarchical trees (SPIHT). The encoder is used with the region-adaptive hierarchical transform, which has been a popular transform for point cloud coding and is included in the standard geometry-based point cloud coder (G-PCC). The result is an encoder that is efficient, scalable, and embedded. That is, higher compression is achieved by trimming the full bit-stream. G-PCC's RAHT coefficient prediction prevents the straightforward incorporation of SPIHT into G-PCC. However, our results over other RAHT-based coders are promising, improving over the original, non-predictive RAHT encoder, while providing the key functionality of being embedded.

关键词： Encoding Three-dimensional displays partitioning algorithms Image coding Transforms Sorting Standards Bit-plane encoding point cloud RAHT SPIHT

来源：评论

学校读者我要写书评

暂无评论

Split Computing based Quantized PoseNet Model for Distributed AI Architecture in IoT-Edge 15

Split Computing based Quantized PoseNet Model for Distribute...

引用

15th International Conference on Communication Systems and Networks (COMSNETS)

作者： Karjee, Jyotirmoy Naik, Praveen S. Anand, Kartik Byadgi, Chandrashekhar S. Dabbiru, Ramesh Babu Venkat Srinidhi, N. Samsung R&D Inst India Bangalore Karnataka India

ISBN: (纸本)9781665477062

In recent times, Internet of Things (IoT) devices is gaining popularity in advanced wireless technology (i.e., 5G). However, in 5G applications (say in edge platform), the IoT devices have limited computation & processing capabilities which makes it challenging to execute Deep Neural Network (DNN) models on them. To address this, we introduce Split Computing technology, to partition DNN inference layers based on the computational capabilities (such as bandwidth, battery level and processing power, etc.) of IoT and edge (computationally powerful) devices, respectively. To validate split computing, we propose a framework called Distributed Artificial Intelligence (DAI) architecture. We use the architecture for a fitness application (use-case) where we detect the pose of a person for our proposed Quantized Split PoseNet DNN (QSP-DNN) algorithm which partitions the DNN layers among IoT device and edge based on Wi-Fi bandwidth. We perform experiments to validate the QSP-DNN algorithm using DAI architecture. The QSP-DNN with DAI compares split execution (computed among IoT device & edge) for partial offload and full-offload executed on edge device. The result shows that using QSP-DNN in DAI architecture provides split execution performing 20.76 % improvement compared to the full offload case.

关键词： Performance evaluation Computational modeling Image edge detection Computer architecture Bandwidth Inference algorithms partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

An Efficient Framework for Clustered Federated Learning

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2022年第12期68卷 8076-8091页

作者： Ghosh, Avishek Chung, Jichan Yin, Dong Ramchandran, Kannan Univ Calif San Diego Halicioglu Data Sci Inst La Jolla CA 92093 USA Univ Calif Berkeley EECS Dept Berkeley CA 94720 USA DeepMind Mountain View CA 94043 USA

We address the problem of federated learning (FL) where users are distributed and partitioned into clusters. This setup captures settings where different groups of users have their own objectives (learning tasks) but by aggregating their data with others in the same cluster (same learning task), they can leverage the strength in numbers in order to perform more efficient federated learning. For this new framework of clustered federated learning, we propose the Iterative Federated Clustering Algorithm (IFCA), which alternately estimates the cluster identities of the users and optimizes model parameters for the user clusters via gradient descent. We analyze the convergence rate of this algorithm first in a linear model with squared loss and then for generic strongly convex and smooth loss functions. We show that in both settings, with good initialization, IFCA is guaranteed to converge, and discuss the optimality of the statistical error rate. In particular, for the linear model with two clusters, we can guarantee that our algorithm converges as long as the initialization is slightly better than random. When the clustering structure is ambiguous, we propose to train the models by combining IFCA with the weight sharing technique in multi-task learning. In the experiments, we show that our algorithm can succeed even if we relax the requirements on initialization with random initialization and multiple restarts. We also present experimental results showing that our algorithm is efficient in non-convex problems such as neural networks. We demonstrate the benefits of IFCA over the baselines on several clustered FL benchmarks.

关键词： Clustering algorithms Collaborative work Convergence Data models partitioning algorithms Distributed databases Task analysis Federated learning clustering alternating minimization

来源：评论

学校读者我要写书评

暂无评论

Area partitioning by Intelligent UAVs for effective path planning using Evolutionary algorithms

Area Partitioning by Intelligent UAVs for effective path pla...

引用

International Conference on Computer Communication and Informatics (ICCCI)

作者： Akshya. J P.L.K. Priyadarsini School of Computing SASTRA Deemed to be University Thanjavur India

ISBN: (纸本)9781728158754;9781728192994

Unmanned Aerial Vehicles (UAVs) have emerged as one of the most researched topics in recent times. They are being deployed in ample applications without any human intervention. The use of autonomous UAVs has given rise to many new challenges. Path planning has always been one of the most critical problems when it comes to the deployment of UAVs in real-time applications. The current work focuses on the area partitioning algorithm considering a few significant parameters such as static obstacles and altitude of UAVs. For any given geographic area, the proposed area partitioning algorithm finds a division of the entire area of interest by effectively partitioning into rectangles. The algorithm merges two or more equal-sized rectangles based on the obstacle position, resulting in a rectilinear partitioning of the area. Two mid-points are computed for each partition and are further used for the computation of an optimal path. An optimal path for the UAV is found by constructing a graph from the mid-points, posing the problem as Travelling Salesperson Problem(TSP), and finding a solution using Firefly Algorithm(FA) and Particle Swarm Optimization(PSO). Effective comparison is done to find the optimal path using both techniques. The obtained results show that FA outperforms PSO.

关键词： Heuristic algorithms Path planning Unmanned aerial vehicles Real-time systems partitioning algorithms Particle swarm optimization Informatics

来源：评论

学校读者我要写书评

暂无评论

Cluster-Based Multi-Carrier Hybrid Beamforming for Massive Device Terahertz Communications

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2022年第5期70卷 3407-3420页

作者： Yuan, Hang Yang, Nan Ding, Xuhui Han, Chong Yang, Kai An, Jianping Beijing Inst Technol Sch Informat & Elect Beijing 100081 Peoples R China Australian Natl Univ Sch Engn Canberra ACT 2600 Australia Beijing Inst Technol Sch Cyberspace Sci & Technol Beijing 100081 Peoples R China Shanghai Jiao Tong Univ Univ Michigan Shanghai Jiao Tong Univ UM SJTU Joi Shanghai 200240 Peoples R China

We propose a cluster-based multi-carrier beam division multiple access (MC-BDMA) scheme to enable massive device terahertz (THz) communications with the dynamic-subarray hybrid beamforming (HBF) architecture. This scheme is motivated by a limitation of conventional HBF architectures, i.e., the number of users cannot exceed the number of radio frequency (RF) chains. By exploiting the unique properties of THz channels, such as high distance-and-frequency dependence, high sparsity, and small angular spread, we propose multiple users in the same cluster to be supported by a single RF chain with distance-aware multi-carrier modulation. Moreover, we propose different clusters to be divided by BDMA that is accomplished through HBF design. In our proposed scheme, we first design a novel antenna selection and subarray partition algorithm for the dynamic-subarray HBF architecture to compensate for performance loss caused by diverse channels among users. We then design an algorithm for multi-carrier HBF which maximizes the achievable throughput and eliminates the inter-beam interference. Numerical results show that our proposed cluster-based MC-BDMA scheme with the dynamic-subarray HBF architecture provides an almost 100% spectral efficiency gain and a 60% energy efficiency gain over the conventional non-cluster HBF scheme in massive device communications.

关键词： Radio frequency Computer architecture Array signal processing partitioning algorithms Heuristic algorithms Wireless communication Switches Terahertz communications massive device communications multi-carrier hybrid beamforming dynamic beam division multiple access

来源：评论

学校读者我要写书评

暂无评论

Heterogeneity-Aware Gradient Coding for Tolerating and Leveraging Stragglers

引用

IEEE TRANSACTIONS ON COMPUTERS 2022年第4期71卷 779-794页

作者： Wang, Haozhao Guo, Song Tang, Bin Li, Ruixuan Yang, Yutong Qu, Zhihao Wang, Yi Huazhong Univ Sci & Technol Sch Comp Sci & Technol Wuhan 430074 Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China Hong Kong Polytech Univ Shenzhen Res Inst Shenzhen 518057 Peoples R China Hohai Univ Coll Comp & Informat Nanjing 211100 Peoples R China Peng Cheng Lab Shenzhen 518066 Peoples R China

Distributed gradient descent has been widely adopted in the machine learning field because considerable computing resources are available when facing the huge volume of data. Specifically, the gradient over the whole data is cooperatively computed by multiple workers. However, its performance can be severely affected by slow workers, namely stragglers. Recently, coding-based approaches have been introduced to mitigate the straggler problem, but they could hardly deal with the heterogeneity among workers. Besides, they always discard the results of stragglers causing huge resource waste. In this article, we first investigate how to tolerate stragglers by discarding their results and then seek to leverage the stragglers. For tolerating stragglers, we propose a heterogeneity-aware coding scheme that encodes gradients adaptive to the computing capability of workers. Theoretically, this scheme is optimal for stragglers tolerance. Relying on the scheme, we further propose an algorithm called DHeter-aware to exploit the gradients of stragglers which we called delayed gradients. Moreover, theoretical results characterized for DHeter-aware exhibits the same convergence rate as the gradient descent without delayed gradients. Experiments on various tasks and clusters demonstrate that our coding scheme outperforms all the state-of-the-art methods and the DHeter-aware further accelerates the coding scheme by achieving 25 percent time savings.

关键词： Encoding Task analysis Clustering algorithms partitioning algorithms Machine learning Training Convergence Distributed architecture distributed systems gradient coding

来源：评论

学校读者我要写书评

暂无评论

A Coverage-Aware Distributed k-Connectivity Maintenance Algorithm for Arbitrarily Large k in Mobile Sensor Networks

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2022年第1期30卷 62-75页

作者： Akram, Vahid Khalilpour Dagdeviren, Orhan Tavli, Bulent Ege Univ Int Comp Inst TR-35040 Izmir Turkey TOBB Univ Econ & Technol Elect & Elect Engn Dept TR-06510 Ankara Turkey

Mobile sensor networks (MSNs) have emerged from the interaction between mobile robotics and wireless sensor networks. MSNs can be deployed in harsh environments, where failures in some nodes can partition MSNs into disconnected network segments or reduce the coverage area. A k-connected network can tolerate at least k-1 arbitrary node failures without losing its connectivity. In this study, we present a coverage-aware distributed k-connectivity maintenance (restoration) algorithm that generates minimum-cost movements of active nodes after a node failure to preserve a persistent k value subject to a coverage conservation criterion. The algorithm accepts a coverage conservation ratio (as a trade-off parameter between coverage and movements) and facilitates coverage with the generated movements according to this value. Extensive simulations and testbed experiments reveal that the proposed algorithm restores k-connectivity more efficiently than the existing restoration algorithms. Furthermore, our algorithm can be utilized to maintain k-connectivity without sacrificing the coverage, significantly.

关键词： Topology Robot sensing systems Maintenance engineering Network topology Upper bound Time complexity partitioning algorithms Mobile sensor networks k-connectivity distributed algorithm connectivity maintenance restoration reliability fault tolerance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：