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

arXiv 2024年

作者： Xia, Kun Duch, Wlodzislaw Sun, Yu Xu, Kedi Fang, Weili Luo, Hanbin Zhang, Yi Sang, Dong Xu, Xiaodong Wang, Fei-Yue Wu, Dongrui The Ministry of Education Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Zhejiang Lab Hangzhou311121 China The Department of Informatics School of Physics Astronomy and Informatics Neurocognitive Laboratory Center for Modern Interdisciplinary Technologies Nicolaus Copernicus University Torun Poland The Ministry of Education Key Laboratory for Biomedical Engineering Zhejiang University Hangzhou China The Zhejiang University School of Medicine National Clinical Research Center for Child Health Hangzhou China Department of Biomedical Engineering Zhejiang University Hangzhou China The School of Civil and Hydraulic Engineering Huazhong University of Science and Technology Wuhan430074 China The College of Public Administration Huazhong University of Science and Technology Wuhan430074 China The NetsUnion Clearing Corporation Beijing100045 China The State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100049 China

A brain-computer interface (BCI) establishes a direct communication pathway between the human brain and a computer. It has been widely used in medical diagnosis, rehabilitation, education, entertainment, etc. Most research so far focuses on making BCIs more accurate and reliable, but much less attention has been paid to their privacy. Developing a commercial BCI system usually requires close collaborations among multiple organizations, e.g., hospitals, universities, and/or companies. Input data in BCIs, e.g., electroencephalogram (EEG), contain rich privacy information, and the developed machine learning model is usually proprietary. Data and model transmission among different parties may incur significant privacy threats, and hence privacy protection in BCIs must be considered. Unfortunately, there does not exist any contemporary and comprehensive review on privacy-preserving BCIs. This paper fills this gap, by describing potential privacy threats and protection strategies in BCIs. It also points out several challenges and future research directions in developing privacy-preserving BCIs. © 2024, CC BY.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Distributed synchronous and asynchronous algorithms for semi-definite programming with diagonal constraints

arXiv

引用

arXiv 2021年

作者： Jiang, Xia Zeng, Xianlin Sun, Jian Chen, Jie Key Laboratory of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing100081 China Beijing Institute of Technology Chongqing Innovation Center Chongqing401120 China Ministry of Education Beijing100081 China School of Electronic and Information Engineering Tongji University Shanghai200082 China

This paper develops distributed synchronous and asynchronous algorithms for the large-scale semi-definite programming with diagonal constraints, which has wide applications in combination optimization, image processing and community detection. The information of the semi-definite programming is allocated to multiple interconnected agents such that each agent aims to find a solution by communicating to its neighbors. Based on low-rank property of solutions and the Burer-Monteiro factorization, we transform the original problem into a distributed optimization problem over unit spheres to reduce variable dimensions and ensure positive semi-definiteness without involving semi-definite projections, which are computationally expensive. For the distributed optimization problem, we propose distributed synchronous and asynchronous algorithms, both of which reduce computational burden and storage space compared with existing centralized algorithms. Specifically, the distributed synchronous algorithm almost surely escapes strict saddle points and converges to the set of optimal solutions to the optimization problem. In addition, the proposed distributed asynchronous algorithm allows communication delays and converges to the set of critical points to the optimization problem under mild conditions. By applying proposed algorithms to image segmentation applications, we illustrate the efficiency and convergence performance of the two proposed algorithms. © 2021, CC BY.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Distributed stochastic gradient tracking algorithm with variance reduction for non-convex optimization

arXiv

引用

arXiv 2021年

This paper proposes a distributed stochastic algorithm with variance reduction for general smooth non-convex finite-sum optimization, which has wide applications in signal processing and machine learning communities. In distributed setting, large number of samples are allocated to multiple agents in the network. Each agent computes local stochastic gradient and communicates with its neighbors to seek for the global optimum. In this paper, we develop a modified variance reduction technique to deal with the variance introduced by stochastic gradients. Combining gradient tracking and variance reduction techniques, this paper proposes a distributed stochastic algorithm, GT-VR, to solve large-scale non-convex finite-sum optimization over multi-agent networks. A complete and rigorous proof shows that the GT-VR algorithm converges to first-order stationary points with O(k1) convergence rate. In addition, we provide the complexity analysis of the proposed algorithm. Compared with some existing first-order methods, the proposed algorithm has a lower O(PMΕ−1) gradient complexity under some mild condition. By comparing state-of-the-art algorithms and GT-VR in experimental simulations, we verify the efficiency of the proposed algorithm. © 2021, CC BY.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Distributed proximal gradient algorithm for non-smooth non-convex optimization over time-varying networks

arXiv

引用

arXiv 2021年

This note studies the distributed non-convex optimization problem with non-smooth regularization, which has wide applications in decentralized learning, estimation and control. The objective function is the sum of different local objective functions, which consist of differentiable (possibly non-convex) cost functions and non-smooth convex functions. This paper presents a distributed proximal gradient algorithm for the non-smooth non-convex optimization problem over time-varying multi-agent networks. Each agent updates local variable estimate by the multi-step consensus operator and the proximal operator. We prove that the generated local variables achieve consensus and converge to the set of critical points with convergence rate O(1/T). Finally, we verify the efficacy of proposed algorithm by numerical simulations. © 2021, CC BY.

关键词： Time varying networks

来源：评论

学校读者我要写书评

暂无评论

The Multi-Blockchain Based Data Trading Markets with Novel Pricing Mechanisms

SSRN

引用

SSRN 2022年

作者： Li, Juanjuan Li, Junqing Wang, Xiao Qin, Rui Yuan, Yong Wang, Fei-Yue The State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China Qingdao Academy of Intelligent Industries Qingdao266109 China School of Mathematics Renmin University of China Beijing100872 China Macao Institute of Systems Engineering Macau University of Science and Technology Macau 999078 China

Aiming to deal with the challenge of data security and data pricing in data trading markets, we propose the novel multi-blockchain-based framework and design the related pricing mechanisms. Specifically, data recording and trading are conducted separately in the Data Blockchain (DChain) and the Value Blockchain (VChain). Based on these blockchains, two-layer data trading markets are established to manage the initial data trading in the primary market and the data resale in the secondary market. Pricing mechanisms are proposed to protect the formulated data trading markets against strategic trading behaviors and balance the payoffs of both suppliers and users. In the regular data trading on VChain-S2D, two auction models are used to deal with users' strategic bidding in terms of the demand scale, where the incentive-compatible Vickrey-Clarke-Groves (VCG) model is dedicated to the low-demand trading scenario, while the nearly incentive-compatible Monopolistic Price (MP) model is for the high-demand trading scenario. In the temporary data trading on VChain-D2S, a reverse auction mechanism named Two-Stage Obscure Selection (TSOS) is designed to regulate both suppliers' quoting and users' valuation strategies. Moreover, experiments are carried out to validate our theoretical analysis. Our work is expected to enhance the data security and improve the trading efficiency. © 2022, The Authors. All rights reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

MatchMesh: Knowledge-based 3D Point Cloud Meshing Using Divide-and-conquer Deformation

MatchMesh: Knowledge-based 3D Point Cloud Meshing Using Divi...

引用

2020 IEEE International Conference on Networking, Sensing and control, ICNSC 2020

作者： Tang, Ying Sun, Shengtao Wu, Ben Department of Electrical and Computer Engineering Rowan University GlassboroNJ08028 United States State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China Institute of Smart Education Qingdao Academy of Intelligent Industries Qingdao China

ISBN: (纸本)9781728168531

The reconstruction of surface mesh from point cloud is compute-intensive but also very important step in the remanufacturing and personalization industries. With more 3D scanners providing lower cost and higher resolution, further detailed point clouds can be gathered without so much effort as before. In manufacturing, there are databases which contain the origin 3D design models of the products. How to utilize the design model data for swift production of related products remains a problem for remanufacturing and customization. In order to develop a knowledge-based way of handling this problem, editing or deforming an existing mesh to match the target is an effective way of easing the workload. In this paper, we introduce a divide-and -conquer process which segments the depth scan data and then find the best match in the database as its source of deformation. The segmentation is performed on 3D point level using global features extracted by 3D CNN. After that we find best match to our knowledge with the same features to acquire a fast meshing of the target object by deforming the existing parts from the match. The deformation of parts are being done sequentially. For further performance improvement, we present a deformation training method employing transfer learning on segment editing process. © 2020 IEEE.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Solving A Class of Nonsmooth Resource Allocation Problems with Directed Graphs though Distributed Smooth Multi-Proximal Algorithms

arXiv

引用

arXiv 2020年

作者： Wei, Yue Shang, Chengsi Fang, Hao Zeng, Xianlin Dou, Lihua Pardalos, Panos Peng Cheng Laboratory China The Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing Institute of Technology China Graduate School at Shenzhen Tsinghua University China Industrial and Systems Engineering University of Florida United States

In this paper, two distributed multi-proximal primal-dual algorithms are proposed to deal with a class of distributed nonsmooth resource allocation problems. In these problems, the global cost function is the summation of local convex and nonsmooth cost functions, each of which consists of one twice differentiable function and multiple nonsmooth functions. Communication graphs of underling multi-agent systems are directed and strongly connected but not necessarily weighted-balanced. The multi-proximal splitting is designed to deal with the difficulty caused by the unproximable property of the summation of those nonsmooth functions. Moreover, it can also guarantee the smoothness of proposed algorithms. Auxiliary variables in the multi-proximal splitting are introduced to estimate subgradients of nonsmooth functions. Theoretically, the convergence analysis is conducted by employing Lyapunov stability theory and integral input-to-state stability (iISS) theory with respect to set. It shows that proposed algorithms can make states converge to the optimal point that satisfies resource allocation conditions. Copyright © 2020, The Authors. All rights reserved.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Nonparametric Different-Feature Selection Using Wasserstein Distance

Nonparametric Different-Feature Selection Using Wasserstein ...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Wenbo Zheng Fei-Yue Wang Chao Gou State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences School of Intelligent Systems Engineering Sun Yat-sen University

ISBN: (数字)9781728192284

ISBN: (纸本)9781728185361

In this paper, we propose a feature selection method that characterizes the difference between two kinds of probability distributions. The key idea is to view the feature selection problem as a sparsest k-subgraph problem that considers Wasserstein distance between the studied two probability distributions. Our method does not presume any specific parametric models on the data distribution and is non-parametric. It outperforms existing Kullback-Leibler divergence based approaches, since we do not require two distributions to overlap. This relaxation makes our method work in many problems in which Kullback-Leibler divergence based methods fail. We also design a fast calculation algorithm using dynamic programming. Our experimental results show that our method outperforms the current method in both computation accuracy and speed.

关键词： Heuristic algorithms Conferences Tools Feature extraction Probability distribution Dynamic programming Parametric statistics

来源：评论

学校读者我要写书评

暂无评论

Deep Rank-Consistent Pyramid Model for Enhanced Crowd Counting

arXiv

引用

arXiv 2022年

作者： Gao, Jiaqi Huang, Zhizhong Lei, Yiming Shan, Hongming Wang, James Z. Wang, Fei-Yue Zhang, Junping The Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China The Institute of Science and Technology for Brain-inspired Intelligence MOE Frontiers Center for Brain Science Fudan University Shanghai200433 China The Shanghai Center for Brain Science and Brain-Inspired Technology Shanghai201210 China The College of Information Sciences and Technology The Pennsylvania State University University ParkPA16802 United States The State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China The Institute of Systems Engineering Macau University of Science and Technology China Qingdao Academy of Intelligent Industries Qingdao266109 China

Most conventional crowd counting methods utilize a fully-supervised learning framework to establish a mapping between scene images and crowd density maps. They usually rely on a large quantity of costly and time-intensive pixel-level annotations for training supervision. One way to mitigate the intensive labeling effort and improve counting accuracy is to leverage large amounts of unlabeled images. This is attributed to the inherent self-structural information and rank consistency within a single image, offering additional qualitative relation supervision during training. Contrary to earlier methods that utilized the rank relations at the original image level, we explore such rank-consistency relation within the latent feature spaces. This approach enables the incorporation of numerous pyramid partial orders, strengthening the model representation capability. A notable advantage is that it can also increase the utilization ratio of unlabeled samples. Specifically, we propose a Deep Rank-consistEnt pyrAmid Model (DREAM), which makes full use of rank consistency across coarse-to-fine pyramid features in latent spaces for enhanced crowd counting with massive unlabeled images. In addition, we have collected a new unlabeled crowd counting dataset, FUDAN-UCC, comprising 4,000 images for training purposes. Extensive experiments on four benchmark datasets, namely UCF-QNRF, ShanghaiTech PartA and PartB, and UCF-CC-50, show the effectiveness of our method compared with previous semi-supervised methods. The codes are available at https://***/bridgeqiqi/DREAM. Copyright © 2022, The Authors. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Multi-agent System Motion Planning under Temporal Logic Specifications and control Barrier Function

Multi-agent System Motion Planning under Temporal Logic Spec...

引用

第三十九届中国控制会议

作者： Xinyuan Huang Li Li Jie Chen IEEE IFAC Chinese Academy of Engineering Tongji University the State Key Laboratory of Intelligent Control and Decision of Complex Systems the Chinese Association of Automation the Chinese Artificial Intelligence Society College of Electronics and Information Engineering Tongji University Shanghai Reserach Institute for Intelligent Autonomous Systems

In this paper, we provide a novel scheme to solve the motion planning problem of multi-agent systems under highlevel task specifications. First, linear temporal logic is applied to express the global task specification. Then an efficient and decentralization algorithm is proposed to decompose it into local tasks. Finally, we use control barrier function to synthesize the local controller for each agent under the LTL motion plan safety constraint. Simulation results prove the effectiveness and efficiency of our proposed method.

关键词： temporal logic multi-agent system formal methods control barrier function

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：