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

Multi-Centroid Representation Network for Domain Adaptive Person Re-ID

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wu, Yuhang Huang, Tengteng Yao, Haotian Zhang, Chi Shao, Yuanjie Han, Chuchu Gao, Changxin Sang, Nong Key Laboratory of Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology China Megvii Technology China

Recently, many approaches tackle the Unsupervised Domain Adaptive person re-identification (UDA re-ID) problem through pseudo-label-based contrastive learning. During training, a uni-centroid representation is obtained by simply averaging all the instance features from a cluster with the same pseudo label. However, a cluster may contain images with different identities (label noises) due to the imperfect clustering results, which makes the uni-centroid representation inappropriate. In this paper, we present a novel Multi-Centroid Memory (MCM) to adaptively capture different identity information within the cluster. MCM can effectively alleviate the issue of label noises by selecting proper positive/negative centroids for the query image. Moreover, we further propose two strategies to improve the contrastive learning process. First, we present a Domain-Specific Contrastive Learning (DSCL) mechanism to fully explore intra-domain information by comparing samples only from the same domain. Second, we propose Second-Order Nearest Interpolation (SONI) to obtain abundant and informative negative samples. We integrate MCM, DSCL, and SONI into a unified framework named Multi-Centroid Representation Network (MCRN). Extensive experiments demonstrate the superiority of MCRN over state-of-the-art approaches on multiple UDA re-ID tasks and fully unsupervised re-ID tasks. Copyright © 2021, The Authors. All rights reserved.

关键词： Machine learning

Closer to pre-trained network transfer better 9

学校读者我要写书评

暂无评论

Closer to pre-trained network transfer better

9th IEEE Joint International Information Technology and Artificial Intelligence Conference, ITAIC 2020

作者： Chen, Siyu Li, Wei Huazhong University of Science and Technology School of Artificial Intelligence and Automation Wuhan430074 China Image Processing and Intelligent Control Key Laboratory Education Ministry of China Wuhan430074 China

In recent years, Deep Neural Network (DNN) has been widely used in the domain of computer vision, but its further development is restricted because of the lack of train samples. Fine-tuning is one of deep transfer learning methods to solve this problem. Nowdays, some existing Fine-tuning approaches assume that if the fine-tuned network could be as close to the pre-trained network as possible, the source knowledge would be fully utilized to improve the study effect. Although these approaches work pretty well, the assumptions on which they are based have not been systematically proved. Due to the complexity of DNNs, offering a reasonable and accurate explanation of the performance of the network is significant for designing new algorithms. In this paper, we design a series of experiments with or without transfer learning respectively, to characterize the relationship between network differences and network performance. The results show that there is an obvious negative correlation between them under certain circumstances. This conclusion can not only provide a more reasonable explanation for the relevant transfer learning algorithm, but also provide support and in-spiration for the future work. © 2020 IEEE.

关键词： Deep neural networks

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

Differential Private Discrete Noise Adding Mechanism: Conditions, Properties and Optimization

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Qin, Shuying He, Jianping Fang, Chongrong Lam, James The Dept. of Automation Shanghai Jiao Tong University The Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai China The Dept. of Mechanical Engineering The University of Hong Kong Pokfulam Road Hong Kong

Differential privacy is a standard framework to quantify the privacy loss in the data anonymization process. To preserve differential privacy, a random noise adding mechanism is widely adopted, where the trade-off between data privacy level and data utility is of great concern. The privacy and utility properties for the continuous noise adding mechanism have been well studied. However, the related works are insufficient for the discrete random mechanism on discretely distributed data, e.g., traffic data, health records. This paper focuses on the discrete random noise adding mechanisms. We study the basic differential privacy conditions and properties for the general discrete random mechanisms, as well as the trade-off between data privacy and data utility. Specifically, we derive a sufficient and necessary condition for discrete ∊-differential privacy and a sufficient condition for discrete (∊, δ)-differential privacy, with the numerical estimation of differential privacy parameters. These conditions can be applied to analyze the differential privacy properties for the discrete noise adding mechanisms with various kinds of noises. Then, with the differential privacy guarantees, we propose an optimal discrete ∊-differential private noise adding mechanism under the utility-maximization framework, where the utility is characterized by the similarity of the statistical properties between the mechanism's input and output. For this setup, we find that the class of the discrete noise probability distributions in the optimal mechanism is Staircase-shaped. Copyright © 2022, The Authors. All rights reserved.

关键词： Probability distributions

Construction of Minecraft Virtual Reality Scene Based on Voxel Point Cloud 8th

学校读者我要写书评

暂无评论

Construction of Minecraft Virtual Reality Scene Based on Vox...

8th International Conference on Cognitive Systems and Information processing, ICCSIP 2023

作者： Ji, Nuocheng Zhuang, Hanyang Yang, Ming The University of Michigan – Shanghai Jiao Tong University Joint Institute Shanghai Jiao Tong University Shanghai200240 China Global Institute of Future Technology Shanghai Jiao Tong University Shanghai200240 China 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

ISBN: (纸本)9789819980208

Virtual Reality is an important development direction in recent years. Minecraft, a popular sandbox game, has a great potential to become a virtual reality platform for building immersive environments. Traditional methods of building virtual reality scenes rely heavily on massive human labors and require high levels of proficiency. To address these limitations, we propose an automatic, voxelated 3D modeling method with foreground and background environment segmented that can reduce modeling costs and achieve effective application in Minecraft virtual reality scenes such as virtual campuses. The proposed method leverages the use of point cloud reconstruction using a voxelization approach. A pipeline of converting point cloud to Minecraft scene is developed. Through preprocessing, segmenting, coloring, and exporting, a Minecraft virtual reality scene can be automatically generated based on voxel point cloud. Due to the noise in point cloud may cause defect during voxelization, a denoising and smoothing method using slice scanning and voxel connectivity segmentation has been implemented. It can generate building structures with clear outlines and uniform colors. And the entire process requires low computational complexity and achieves fast generation. We conducted experiments based on this method in indoor scenes, outdoor building landmarks, and complex underground scenes, and obtained results with clear structures and smooth surfaces, saving a lot of time for subsequent detailed modeling. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： 3D modeling

Giant-cavity-based quantum sensors with enhanced performance

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Zhu, Y.T. Wu, R.B. Peng, Z.H. Xue, Shibei 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 Center for intelligent and networked systems Department of Automation Tsinghua University Beijing100084 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 Synergetic Innovation Center for Quantum Effects and Applications Hunan Normal University Changsha410081 China

Recent progresses have revealed that quantum systems with multiple position-dependent couplings, e.g., giant atoms, can exhibit some unconventional phenomena, such as non-exponential decay etc. However, their potential applications are still open questions. In this paper, we propose a giant-cavity-based quantum sensor for the first time, whose performance can be greatly enhanced compared to traditional cavity-based sensors. In our proposal, two cavities couple to a dissipative reservoir at multiple points while they couple to a gain reservoir in a single-point way. To detecting a unknown parameter using this sensor, a waveguide is coupled to one of the cavities where detecting fields can pass through for homodyne detection. We find that multiple position-dependent couplings can induce an inherent non-reciprocal coupling between the cavities, which can enhance the performance of sensors. Output noise in our scheme can be reduced to the shot noise level, which is about one order magnitude lower than the results in Ref. [Lau and Clerk (2018)]. Besides, the signal-to-noise ratio per photon is also enhanced by about one order of magnitude. These results show that the multiple-point-coupling structure is beneficial to nowadays quantum devices. Copyright © 2022, The Authors. All rights reserved.

关键词： Couplings

Entity Representation Learning with Multimodal Neighbors for Link Prediction in Knowledge Graph

学校读者我要写书评

暂无评论

Entity Representation Learning with Multimodal Neighbors for...

International Conference on Computer and Communications (ICCC)

作者： Wenxuan Liu Hao Duan Zeng Li Jingdong Liu Hong Huo Tao Fang Shanghai Jiao Tong University China Key Laboratory of System Control and Information Processing Ministry of Education of China China Shanghai Engineering Research Center of Intelligent Control and Management China

ISBN: (纸本)9781665409513

Entity representation learning is both fundamental and crucial for link prediction in knowledge graph. Existing entity representation learning approaches mainly focus on learning from knowledge triples with single modal text data which could only describe the things or concepts in words. However, multimodal data commonly exists in the real worlds and may describe things or concepts from different aspects. Therefore, multimodal entities have emerged in knowledge graph in recent years, which greatly enrich the knowledge graph by different information. This paper focuses on how to learn more robust and comprehensive representations of multimodal entities for better link prediction. A new representation learning method for multimodal entities is proposed, called Graph Attention with Bi-pooling Representation Learning (GBRL), where multimodal fusion and knowledge embedding are combined for learning representations of an entity with consideration of its multimodal neighbors. Firstly, feature vectors are obtained by pre-trained models for each modality. Then, the bilinear pooling is utilized for combining feature vectors of multimodal entities into multimodal feature vectors. A two-layer graph attention module is followed to generate multimodal representations of an entity from its multimodal neighbors. Finally, the inception decoder uses multimodal knowledge embedding to calculate scores for link prediction. The experimental results have shown that the proposed method performs well on link prediction by consideration of multimodal entities comparing with traditional methods that using only single modal text data.

关键词： Representation learning Knowledge representation Feature extraction Decoding

Arbitrary State Transition of Open Qubit System Based on Switching control

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wu, Guangpu Xue, Shibei Ma, Shan Kuang, Sen Dong, Daoyi Petersen, Ian R. 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 Automation Central South University Changsha410083 China Department of Automation University of Science and Technology of China Hefei230027 China School of Engineering Australian National University CanberraACT2601 Australia

We present a switching control strategy based on Lyapunov control for arbitrary state transitions in open qubit systems. With coherent vector representation, we propose a switching control strategy, which can prevent the state of the qubit from entering invariant sets and singular value sets, effectively driving the system ultimately to a sufficiently small neighborhood of target states. In comparison to existing works, this control strategy relaxes the strict constraints on system models imposed by special target states. Furthermore, we identify conditions under which the open qubit system achieves finite-time stability (FTS) and finite-time contractive stability (FTCS), respectively. This represents a critical improvement in quantum state transitions, especially considering the asymptotic stability of arbitrary target states is unattainable in open quantum systems. The effectiveness of our proposed method is convincingly demonstrated through its application in a qubit system affected by various types of decoherence, including amplitude, dephasing and polarization decoherence. Copyright © 2024, The Authors. All rights reserved.

关键词： Asymptotic stability

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

学校读者我要写书评

暂无评论

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