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

41st International Conference on Machine Learning, ICML 2024

作者： Li, Feiran Xu, Qianqian Bao, Shilong Yang, Zhiyong Cong, Runmin Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China School of Control Science and Engineering Shandong University Jinan China Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Sun Yat-sen University Shenzhen Campus China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD. Copyright 2024 by the author(s)

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Differentially Private Distributed Mismatch Tracking Algorithm for Constraint-Coupled Resource Allocation Problems

arXiv

引用

arXiv 2022年

作者： Wu, Wenwen Zhu, Shanying Liu, Shuai Guan, Xinping Department of Automation Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China School of Control Science and Engineering Shandong University Jinan China

This paper considers privacy-concerned distributed constraint-coupled resource allocation problems over an undirected network, where each agent holds a private cost function and obtains the solution via only local communication. With privacy concerns, we mask the exchanged information with independent Laplace noise against a potential attacker with potential access to all network communications. We propose a differentially private distributed mismatch tracking algorithm (diff-DMAC) to achieve cost-optimal distribution of resources while preserving privacy. Adopting constant stepsizes, the linear convergence property of diff-DMAC in mean square is established under the standard assumptions of Lipschitz gradients and strong convexity. Moreover, it is theoretically proven that the proposed algorithm is t-differentially private. And we also show the trade-off between convergence accuracy and privacy level. Finally, a numerical example is provided for verification. Copyright © 2022, The Authors. All rights reserved.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

A polynomial chaos approach to robust H∞ static output-feedback control with bounded truncation error

arXiv

引用

arXiv 2021年

作者： Wan, Yiming Shen, Dongying E. Lucia, Sergio Findeisen, Rolf Braatz, Richard D. Artificial Intelligence and Automation Huazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control Ministry of Education Wuhan430074 China Massachusetts Institute of Technology 77 Massachusetts Avenue CambridgeMA02139 United States TU Dortmund University Dortmund44227 Germany Otto-von-Guericke University Magdeburg Magdeburg39106 Germany

This article considers the H∞ static output-feedback control for linear time-invariant uncertain systems with polynomial dependence on probabilistic time-invariant parametric uncertainties. By applying polynomial chaos theory, the control synthesis problem is solved using a high-dimensional expanded system which characterizes stochastic state uncertainty propagation. A closed-loop polynomial chaos transformation is proposed to derive the closed-loop expanded system. The approach explicitly accounts for the closed-loop dynamics and preserves the L2-induced gain, which results in smaller transformation errors compared to existing polynomial chaos transformations. The effect of using finite-degree polynomial chaos expansions is first captured by a norm-bounded linear differential inclusion, and then addressed by formulating a robust polynomial chaos based control synthesis problem. This proposed approach avoids the use of high-degree polynomial chaos expansions to alleviate the destabilizing effect of truncation errors, which significantly reduces computational complexity. In addition, some analysis is given for the condition under which the robustly stabilized expanded system implies the robust stability of the original system. A numerical example illustrates the effectiveness of the proposed approach. © 2021, CC BY.

关键词： Feedback control

来源：评论

学校读者我要写书评

暂无评论

Locating and Sizing Charging Station in Multi-Period to Promote Electric Vehicles Adoption in Urban Areas

SSRN

引用

SSRN 2023年

作者： Hu, Dandan Huang, Liu Liu, Chen Liu, Zhi-Wei The School of Management South-central Minzu University Wuhan430074 China The School of Engineering RMIT University MelbourneVIC3001 Australia The School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China The Key Laboratory of Image Processing and Intelligent Control Ministry of Education Huazhong University of Science and Technology Wuhan430074 China

The layout of public fast charging stations often fails to meet the charging demand of electric vehicle (EV) users, resulting in charging anxiety. To address this issue and promote the widespread use of EVs in urban areas, this paper presents a multiperiod locating and sizing optimization model under dynamic demand. The model incorporates GPS trajectory extraction data to identify potential charging demand points and considers the mobile load characteristics of EVs for fusion modeling. A multiperiod change formula is proposed to reflect the interaction between public fast charging stations and EV market penetration, incorporating charging opportunity and waiting time satisfaction as measures of charging service quality. To solve the model, a heuristic algorithm combining genetic algorithm (GA) and k-medoids clustering algorithm is designed. We apply the model to an actual case of Shenzhen and find that increasing investment in charging infrastructure can boost EV market penetration in the later planning period. Moreover, the gap between charging opportunity and waiting time satisfaction tends to narrow as the planning progresses. Our findings highlight the importance of optimizing the location and size of public fast charging stations to improve the charging service quality and promote the adoption of EVs. © 2023, The Authors. All rights reserved.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Data Augmentation for Deep Learning Based a Utomaticmo Dulation Recognition

SSRN

引用

SSRN 2023年

作者： Ma, Hongbin Feng, Zhixi Yang, Shuyuan Wang, Min Wu, Tao Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education School of Artificial Intelligence Xidian University Xi’an710071 China Key Laboratory of Radar Signal Processing Xidian University Xi’an710071 China Xidian University China Institute School of Artificial Intelligence Xidian University TaiBai road 2# Shannxi Province Xi’an China

Data augmentation, as a strategy to expand training datasets, can be utilized to improve the accuracy of Deep Learning(DL)-based models to a certain extent. However, existing data augmentation methods for the DL-based Automatic Modulation Recognition (AMR) task lack a theoretical basis, and the availability of these methods to different types of AMR models has not been evaluated. In this paper, we first model the transformation process from an information source to a modulation signal and analyze the parameters that influence the difference between modulation signals for the theoretical basis of data augmentation in the AMR field. Then we propose nine signal augmentation methods to generate argumentation signals by modifying the influence parameters in the amplitude domain, the time domain, and the frequency domain. Finally, we conduct a series of experiments on the public RML2016.10a and RML2016.10b datasets to evaluate the effectiveness of the proposed methods andanalyze the availability of these methods to Convolutional Neural Network (CNN)-based AMR models, and hybrid AMR models based on CNN and Recurrent Neural Network. © 2023, The Authors. All rights reserved.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

Global Rice Multi-Class Segmentation Dataset (RiceSEG): A Comprehensive and Diverse High-Resolution RGB-Annotated images for the Development and Benchmarking of Rice Segmentation Algorithms

arXiv

引用

arXiv 2025年

作者： Zhou, Junchi Wang, Haozhou Kato, Yoichiro Nampally, Tejasri Rajalakshmi, P. Balram, M. Katsura, Keisuke Lu, Hao Mu, Yue Yang, Wanneng Gao, Yangmingrui Xiao, Feng Chen, Hongtao Chen, Yuhao Li, Wenjuan Wang, Jingwen Yu, Fenghua Zhou, Jian Wang, Wensheng Hu, Xiaochun Yang, Yuanzhu Ding, Yanfeng Guo, Wei Liu, Shouyang Engineering Research Center of Plant Phenotyping Ministry of Education Jiangsu Collaborative Innovation Center for Modern Crop Production Academy for Advanced Interdisciplinary Studies Sanya Institute of Nanjing Agricultural University Nanjing Agricultural University Nanjing China Graduate School of Agricultural and Life Sciences The University of Tokyo Tokyo Japan Department of Artificial Intelligence Indian Institute of Technology Hyderabad India Department of Electrical Engineering Indian Institute of Technology Hyderabad India Institute of Biotechnology Professor Jayashankar Telangana Agricultural State University Hyderabad India Graduate School of Agriculture Kyoto University Kyoto Japan Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China National Key Laboratory of Crop Genetic Improvement National Center of Plant Gene Research Hubei Key Laboratory of Agricultural Bioinformatics Huazhong Agricultural University Wuhan China State Key Laboratory of Efficient Utilization of Arid and Semi-arid Arable Land in Northern China the Institute of Agricultural Resources and Regional Planning Chinese Academy of Agricultural Sciences Beijing China Center for Geospatial Information Shenzhen Institutes of Advanced Technology Chinese Academy of Science Shenzhen China School of Information and Electrical Engineering Shenyang Agricultural University Shenyang China Rice Research Institute Jilin Academy of Agricultural Sciences Changchun China Institute of Crop Sciences National Key Facility for Crop Gene Resources and Genetic Improvement Chinese Academy of Agricultural Sciences Beijing China Yuan Long Ping High-Tech Agriculture Co. Ltd. Changsha China

Developing computer vision–based rice phenotyping techniques is crucial for precision field management and accelerating breeding, thereby continuously advancing rice production. Among phenotyping tasks, distinguishing image components is a key prerequisite for characterizing plant growth and development at the organ scale, enabling deeper insights into eco-physiological processes. However, due to the fine structure of rice organs and complex illumination within the canopy, this task remains highly challenging, underscoring the need for a high-quality training dataset. Such datasets are scarce, both due to a lack of large, representative collections of rice field images and the time-intensive nature of annotation. To address this gap, we established the first comprehensive multi-class rice semantic segmentation dataset, RiceSEG. We gathered nearly 50,000 high-resolution, ground-based images from five major rice-growing countries (China, Japan, India, the Philippines, and Tanzania), encompassing over 6,000 genotypes across all growth stages. From these original images, 3,078 representative samples were selected and annotated with six classes (background, green vegetation, senescent vegetation, panicle, weeds, and duckweed) to form the RiceSEG dataset. Notably, the sub-dataset from China spans all major genotypes and rice-growing environments from the northeast to the south. Both state-of-the-art convolutional neural networks and transformer-based semantic segmentation models were used as baselines. While these models perform reasonably well in segmenting background and green vegetation, they face difficulties during the reproductive stage, when canopy structures are more complex and multiple classes are involved. These findings highlight the importance of our dataset for developing specialized segmentation models for rice and other crops. The RiceSEG dataset is publicly available at ***. © 2025, CC BY.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Anchor-based spatio-temporal attention 3D convolutional networks for dynamic 3D point cloud sequences

arXiv

引用

arXiv 2020年

作者： Wang, Guangming Chen, Muyao Liu, Hanwen Yang, Yehui Liu, Zhe Wang, Hesheng The Department of Automation Institute of Medical Robotics Key Laboratory of System Control and Information Processing Ministry of Education Key Laboratory of Marine Intelligent Equipment System of Ministry of Education Shanghai Jiao Tong University Shanghai200240 China Beijing Advanced Innovation Center for Intelligent Robots and Systems Beijing Institute of Technology China The Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai200240 China The Department of Computer Science and Technology University of Cambridge

With the rapid development of measurwement technology, LiDAR and depth cameras are widely used in the perception of the 3D environment. Recent learning based methods for robot perception most focus on the image or video, but deep learning methods for dynamic 3D point cloud sequences are underexplored. Therefore, developing efficient and accurate perception method compatible with these advanced instruments is pivotal to autonomous driving and service robots. An Anchor-based Spatio-Temporal Attention 3D Convolution operation (ASTA3DConv) is proposed in this paper to process dynamic 3D point cloud sequences. The proposed convolution operation builds a regular receptive field around each point by setting several virtual anchors around each point. The features of neighborhood points are firstly aggregated to each anchor based on the spatio-temporal attention mechanism. Then, anchor-based 3D convolution is adopted to aggregate these anchors' features to the core points. The proposed method makes better use of the structured information within the local region and learns spatio-temporal embedding features from dynamic 3D point cloud sequences. Anchor-based Spatio-Temporal Attention 3D Convolutional Neural Networks (ASTA3DCNNs) are built for classification and segmentation tasks based on the proposed ASTA3DConv and evaluated on action recognition and semantic segmentation tasks. The experiments and ablation studies on MSRAction3D and Synthia datasets demonstrate the superior performance and effectiveness of our method for dynamic 3D point cloud sequences. Our method achieves the state-of-the-art performance among the methods with dynamic 3D point cloud sequences as input on MSRAction3D and Synthia datasets. Copyright © 2020, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Spatial-nonlocality-induced non-Markovian electromagnetically induced transparency in a single giant atom

引用

Physical Review A 2022年第4期106卷 043710-043710页

作者： Y. T. Zhu S. Xue R. B. Wu W. L. Li Z. H. Peng M. Jiang Department of Automation Shanghai Jiao Tong University Shanghai 200240 People's Republic of China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai 200240 People's Republic of China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai 200240 People's Republic of China Center for Intelligent and Networked Systems Department of Automation Tsinghua University Beijing 100084 People's Republic of China Key Laboratory of Low-Dimensional Quantum Structures and Quantum Control of Ministry of Education Key Laboratory for Matter Microstructure and Function of Hunan Province Department of Physics and Synergetic Innovation Center for Quantum Effects and Applications Hunan Normal University Changsha 410081 People's Republic of China School of Electronics and Information Engineering Soochow University Suzhou 215006 People's Republic of China

The nonlocal waveguide coupling of giant atoms can bring up novel physics and applications. In this paper, we find unconventional electromagnetically induced transparency in giant atoms that has not been reported so far. We present a consistent theory for describing the unconventional EIT which includes a real-space scattering method and a time-delayed master equation. Our analysis shows this phenomenon is a full quantum effect led by a quantized interaction between the atom and the waveguide. Our theory shows that it can be observed when the time delay between two neighboring coupling points is comparable to the relaxation time of the atom. This phenomenon results from the inherent nonlocality of the giant atom, which physically forces propagating fields to be standing waves in space and the atom exhibiting retardations in time.

关键词： Quantum optics with artificial atoms Scattering theory Quantum master equation

来源：评论

学校读者我要写书评

暂无评论

End-to-End 3D Point Cloud Learning for Registration Task Using Virtual Correspondences

End-to-End 3D Point Cloud Learning for Registration Task Usi...

引用

2020 IEEE/RSJ International Conference on intelligent Robots and Systems (IROS)

作者： Huanshu Wei Zhijian Qiao Zhe Liu Chuanzhe Suo Peng Yin Yueling Shen Haoang Li Hesheng Wang The Chinese University of Hong Kong T Stone Robotics Institute Hong Kong Shanghai Jiao Tong University China University of Cambridge United Kingdom Carnegie Mellon University Insititue of Medical Robotics Key Laboratory of System Control and Information Processing of Ministry of Education Key Laboratory of Marine Intelligent Equipment and System of Ministry of Education Shanghai Jiao Tong University Shanghai China Beijing Advanced Innovation Center for Intelligent Robots and Systems Beijing Institute of Technology China

ISBN: (数字)9781728162126

ISBN: (纸本)9781728162133

3D Point cloud registration is still a very challenging topic due to the difficulty in finding the rigid transformation between two point clouds with partial correspondences, and it's even harder in the absence of any initial estimation information. In this paper, we present an end-to-end deep-learning based approach to resolve the point cloud registration problem. Firstly, the revised LPD-Net is introduced to extract features and aggregate them with the graph network. Secondly, the self-attention mechanism is utilized to enhance the structure information in the point cloud and the cross-attention mechanism is designed to enhance the corresponding information between the two input point clouds. Based on which, the virtual corresponding points can be generated by a soft pointer based method, and finally, the point cloud registration problem can be solved by implementing the SVD method. Comparison results in ModelNet40 dataset validate that the proposed approach reaches the state-of-the-art in point cloud registration tasks and experiment resutls in KITTI dataset validate the effectiveness of the proposed approach in real applications.

关键词： Three-dimensional displays Aggregates Pose estimation Feature extraction Task analysis intelligent robots

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation for Coupled Slices in Edge-Assisted Industrial IoT Systems

Resource Allocation for Coupled Slices in Edge-Assisted Indu...

引用

IEEE International Conference on Communications in China (ICCC)

作者： Xiaojing Wen Cailian Chen Cheng Ren Ling Lyu Xinping Guan Department of Automation Shanghai Jiao Tong University and Key Laboratory of System Control and Information Processing Ministry of Education of China and Shanghai Engineering Research Center of Intelligent Control and Management Shanghai P. R. China School of Information Science and Technology Dalian Maritime University Dalian China

Multiple types of sensors are utilized for remote monitoring of single industrial process to compensate for the limited accuracy of a single type of sensor. Network slicing technology is considered promising for collecting data from heterogeneous sensors and meeting diverse Quality of Service (QoS) requirements. However, existing research on network slicing optimization mainly focuses on inter-slice resource constraints based on slice heterogeneity, neglecting slice coupling feature. In this regard, this paper proposes a novel network slicing framework for edge-assisted industrial IoT systems. The framework includes a slice coupling model and network resource allocation (transmission and computing) to address the problem of improving estimation performance while ensuring system convergence. The slice coupling model is primarily composed of the estimation error covariance of two slices, calculated using the Age of Task (AoT) as a bridge, which reflects the accuracy and freshness of the estimation. To reduce the complexity of the direct solution, the optimization problem is scaled down and decoupled. The iterative Particle Swarm Optimization (PSO) algorithm is proposed to determine the allocation rates of inter-slice transmission and computing resources. Simulation results demonstrate that the proposed algorithm achieves a flexible balance under heterogeneous estimation weights and exhibits near-optimal performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：