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

arXiv 2023年

作者： Jiao, Yang Yang, Kai Wu, Tiancheng Jian, Chengtao Huang, Jianwei Department of Computer Science and Technology Tongji University China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University China Shanghai Research Institute for Intelligent Autonomous Systems China School of Science and Engineering The Chinese University of Hong Kong Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society China

Trilevel learning, also called trilevel optimization (TLO), has been recognized as a powerful modelling tool for hierarchical decision process and widely applied in many machine learning applications, such as robust neural architecture search, hyperparameter optimization, and domain adaptation. Tackling TLO problems has presented a great challenge due to their nested decision-making structure. In addition, existing works on TLO face the following key challenges: 1) they all focus on the non-distributed setting, which may lead to privacy breach;2) they do not offer any non-asymptotic convergence analysis which characterizes how fast an algorithm converges. To address the aforementioned challenges, this paper proposes an asynchronous federated trilevel optimization method to solve TLO problems. The proposed method utilizes µ-cuts to construct a hyper-polyhedral approximation for the TLO problem and solve it in an asynchronous manner. We demonstrate that the proposed µ-cuts are applicable to not only convex functions but also a wide range of non-convex functions that meet the µ-weakly convex assumption. Furthermore, we theoretically analyze the non-asymptotic convergence rate for the proposed method by showing its iteration complexity to obtain ϵ-stationary point is upper bounded by (Formula Presented). Extensive experiments on real-world datasets have been conducted to elucidate the superiority of the proposed method, e.g., it has a faster convergence rate with a maximum acceleration of approximately 80%. Copyright © 2023, The Authors. All rights reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Cross-Image Siamese Graph Convolutional Network For Fine-Grained Image Retrieval in Diabetic Retinopathy

SSRN

引用

SSRN 2023年

作者： Chen, Fang Zhao, Weiling Zhou, Xiaobo School of Electronics and Information Engineering Tongji University Shanghai201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China School of Biomedical Informatics The University of Texas Health Science Center at Houston HoustonTX77030 United States Center for Computational Systems Medicine

The categories of diabetic retinopathy (DR) are interrelated, and different ophthalmologists often give different results for the same fundus image. Automatic cross image retrieval of DR can provide an effective diagnostic solution for ophthalmologists and is of great significance in clinical practice. Cross-image (i.e. left and right fundus images for a patient) information is highly correlated and complementary and can be harnessed to improve various computer vision tasks such as image classification, object detection, image segmentation, and image retrieval. Previous studies did not explore the correlation between lesion areas in left and right fundus images of patients, limiting the effective diagnosis of DR. In this study, we proposed a cross-image siamese graph convolutional network(CIS-GCN) to retrieve fine-grained diabetic retinopathy fundus images. First, we constructed a global-specific structure to obtain the specific features of the left and right eyes. Then, we passed the specific features through the pathological localization network to obtain the location features of the lesion. Finally, a graph convolutional neural network was introduced to construct node sets for the left and right eyes, respectively, to represent relatively consistent regions in the fundus images of patients and learn their correlations. We tested our method using Diabetic Retinopathy Detection datasets and the results showed that our algorithm outperforms other state-of-the-art methods by 2.2% ~ 3.7% in image data retrieval. © 2023, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

DL-SLOT: Dynamic Lidar SLAM and Object Tracking Based On Graph Optimization

arXiv

引用

arXiv 2022年

作者： Tian, Xuebo Zhao, Junqiao Ye, Chen Department of Computer Science and Technology School of Electronics and Information Engineering Tongji University Shanghai China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Institute of Intelligent Vehicles Tongji University Shanghai China

Ego-pose estimation and dynamic object tracking are two key issues in an autonomous driving system. Two assumptions are often made for them, i.e. the static world assumption of simultaneous localization and mapping (SLAM) and the exact ego-pose assumption of object tracking, respectively. However, these assumptions are difficult to hold in highly dynamic road scenarios where SLAM and object tracking become correlated and mutually beneficial. In this paper, DL-SLOT, a dynamic Lidar SLAM and object tracking method is proposed. This method integrates the state estimations of both the ego vehicle and the static and dynamic objects in the environment into a unified optimization framework, to realize SLAM and object tracking (SLOT) simultaneously. Firstly, we implement object detection to remove all the points that belong to potential dynamic objects. Then, LiDAR odometry is conducted using the filtered point cloud. At the same time, detected objects are associated with the history object trajectories based on the time-series information in a sliding window. The states of the static and dynamic objects and ego vehicle in the sliding window are integrated into a unified local optimization framework. We perform SLAM and object tracking simultaneously in this framework, which significantly improves the robustness and accuracy of SLAM in highly dynamic road scenarios and the accuracy of objects' states estimation. Experiments on public datasets have shown that our method achieves better accuracy than A-LOAM. Copyright © 2022, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

DL-SLOT: Dynamic LiDAR SLAM and object tracking based on collaborative graph optimization

arXiv

引用

arXiv 2022年

作者： Tian, Xuebo Zhu, Zhongyang Zhao, Junqiao Tian, Gengxuan Ye, Chen Department of Computer Science and Technology School of Electronics and Information Engineering Tongji University Shanghai China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Institute of Intelligent Vehicles Tongji University Shanghai China

Ego-pose estimation and dynamic object tracking are two critical problems for autonomous driving systems. The solutions to these problems are generally based on their respective assumptions, i.e., the static world assumption for simultaneous localization and mapping (SLAM) and the accurate ego-pose assumption for object tracking. However, these assumptions are challenging to hold in dynamic road scenarios, where SLAM and object tracking become closely correlated. Therefore, we propose DL-SLOT, a dynamic LiDAR SLAM and object tracking method, to simultaneously address these two coupled problems. This method integrates the state estimations of both the autonomous vehicle and the stationary and dynamic objects in the environment into a unified optimization framework. First, we used object detection to identify all points belonging to potentially dynamic objects. Subsequently, a LiDAR odometry was conducted using the filtered point cloud. Simultaneously, we proposed a sliding window-based object association method that accurately associates objects according to the historical trajectories of tracked objects. The ego-states and those of the stationary and dynamic objects are integrated into the sliding window-based collaborative graph optimization. The stationary objects are subsequently restored from the potentially dynamic object set. Finally, a global pose-graph is implemented to eliminate the accumulated error. Experiments on KITTI datasets demonstrate that our method achieves better accuracy than SLAM and object tracking baseline methods. This confirms that solving SLAM and object tracking simultaneously is mutually advantageous, dramatically improving the robustness and accuracy of SLAM and object tracking in dynamic road scenarios. Copyright © 2022, The Authors. All rights reserved.

关键词： Optical radar

来源：评论

学校读者我要写书评

暂无评论

Sequential end-to-end network for efficient person search

arXiv

引用

arXiv 2021年

作者： Li, Zhengjia Miao, Duoqian Department of Computer Science and Technology Tongji University Shanghai201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China

Person search aims at jointly solving Person Detection and Person Re-identification (re-ID). Existing works have designed end-to-end networks based on Faster R-CNN. However, due to the parallel structure of Faster R-CNN, the extracted features come from the low-quality proposals generated by the Region Proposal Network, rather than the detected high-quality bounding boxes. Person search is a fine-grained task and such inferior features will significantly reduce re-ID performance. To address this issue, we propose a Sequential End-to-end Network (SeqNet) to extract superior features. In SeqNet, detection and re-ID are considered as a progressive process and tackled with two sub-networks sequentially. In addition, we design a robust Context Bipartite Graph Matching (CBGM) algorithm to effectively employ context information as an important complementary cue for person matching. Extensive experiments on two widely used person search benchmarks, CUHK-SYSU and PRW, have shown that our method achieves state-of-the-art results. Also, our model runs at 11.5 fps on a single GPU and can be integrated into the existing end-to-end framework easily. Copyright © 2021, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Towards Energy-Efficiency: Integrating MATD3 Reinforcement Learning Method for Computational Offloading in RIS-Aided UAV-MEC Environments

引用

IEEE Internet of Things Journal 2025年

作者： Wu, Liangshun Zhang, Cong Zhang, Bin Du, Jianbo Qu, Junsuo Key Laboratory of Embedded System and Service Computing Tongji University Ministry of Education Shanghai201804 China Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai201210 China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai200240 China Xi'an Key Laboratory of Advanced Control and Intelligent Process School of Automation Xi'an University of Posts & Telecommunications Xi'an710061 China Xinjiang University of Political Science and Law Tumushuke832003 China School of Remote Sensing and Information Engineering Wuhan University Wuhan430079 China Department of Computer City University of Hong Kong 999077 Hong Kong School of Communications and Information Engineering Xi'an University of Posts & Telecommunications Xi'an710061 China

With the proliferation of IoT devices, there is an escalating demand for enhanced computing and communication capabilities. Mobile Edge computing (MEC) addresses this need by relocating computing resources to the network edge, thereby delivering swifter and more efficient services. This paper introduces a computation offloading and energy consumption optimization framework that leverages Reconfigurable Intelligent Surfaces (RIS), Unmanned Aerial Vehicles (UAVs), and MEC. The scheme aims to maximize energy efficiency through the optimization of task allocation, RIS phase shifts, and UAV trajectories. By employing the Multi-Agent Twin Delayed Deep Deterministic Policy Gradient (MATD3) reinforcement learning algorithm, the paper further refines UAV trajectories and RIS configurations. The simulation results indicate that the proposed method surpasses the traditional Concave-Convex Procedure (CCCP) algorithm in both UAV trajectory control and RIS configuration, demonstrating quicker convergence and enhanced stability. The method proves to be adaptable to diverse environments and tasks, showcasing notable benefits in RIS-assisted interference suppression, particularly with large RIS, thereby enhancing UAV data reception rates. Additionally, MATD3 exhibits faster and smoother convergence for extended task durations and smaller RIS scenarios. Simulation results reveal that UAVs tend to move closer to RIS, with energy efficiency falling as IoT tasks increase, affirming the proposed algorithm's high energy efficiency and effectiveness. © 2025 IEEE.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Prescribed-time synchronization for multiweighted complex networks: A switching control scheme

引用

systems & Control Letters 2025年 203卷

作者： Linlong Xu Xiwei Liu Department of Computer Science and Technology Tongji University Shanghai 201804 PR China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai 201804 PR China

This letter deals with an interesting intersection phenomenon of prescribed-time stability (PTSta) for dynamical systems, and develops a novel switching control scheme to investigate prescribed-time synchronization (PTSyn) for multiweighted and directly coupled complex networks. Different from most previous works that scholars only pay attention to designing the regulation function to ensure PTSta, we aim to select various parameters and uncover the mathematical mechanism of intersecting system state curves. We rigorously prove that, if the settling time is larger than 1, then no matter what the initial value is, the intersection exists only once before the settling time; otherwise, there is no intersection. Moreover, an energy consumption evaluation function is also put forward for PTSta, whose exact value is also calculated via exponential integrals. Then, this intersection theory is applied on the PTSyn of multiweighted complex networks, which is beneficial to construct the switching control scheme or choose the optimal parameters to reduce the energy cost. The rearranging variables’ order technique is utilized to conduct the multiweighted complex networks and obtain the synchronization criterion. Finally, four simulations are presented to verify theoretical results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient Routing Protection Algorithm Based on Optimized Network Topology

引用

Computers, Materials & Continua 2022年第9期72卷 4525-4540页

作者： Haijun Geng Zikun Jin Jiangyuan Yao Han Zhang Zhiguo Hu Bo Yang Yingije Guo Wei Wang Qidong Zhang Guoao Duan School of Computer and Information Technology Shanxi UniversityShanxi030006China School of Automation and Software Engineering Shanxi UniversityShanxi030006China School of Computer Science and Technology Hainan UniversityHaikou570228China Department of Computer Science&Technology Tsinghua UniversityBeijing100084China Department of Urban&Regional Planning San JoséState University San JoséCA95192USA Key Laboratory of Embedded System and Service Computing(Tongji University) Ministry of EducationShanghai201804China Institute of Fundamental and Frontier Sciences University of Electronic Science and Technology of ChinaChengdu610054China Beijinng University of Technology Beijing-Dublin International CollegeBeijing University of TechnologyBeijing100124China

Network failures are unavoidable and occur *** the network fails,intra-domain routing protocols deploying on the Internet need to undergo a long convergence *** this period,a large number of messages are discarded,which results in a decline in the user experience and severely affects the quality of service of Internet service Providers(ISP).Therefore,improving the availability of intra-domain routing is a trending research question to be *** usually employs routing protection algorithms to improve intra-domain routing ***,existing routing protection schemes compute as many backup paths as possible to reduce message loss due to network failures,which increases the cost of the network and impedes the methods deployed in *** address the issues,this study proposes an efficient routing protection algorithm based on optimized network topology(ERPBONT).ERPBONT adopts the optimized network topology to calculate a backup path with the minimum path coincidence degree with the shortest path for all source ***,the backup path with the minimum path coincidence with the shortest path is described as an integer programming *** the simulated annealing algorithm ERPBONT is used to find the optimal ***,the algorithm is tested on the simulated topology and the real *** experimental results show that ERPBONT effectively reduces the path coincidence between the shortest path and the backup path,and significantly improves the routing availability.

关键词： Routing protection algorithm network availability network failure shortest path backup path

来源：评论

学校读者我要写书评

暂无评论

The behavioral sign of account theft: Realizing online payment fraud alert 29

The behavioral sign of account theft: Realizing online payme...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Wang, Cheng Department of Computer Science Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Shanghai Institute of Intelligent Science and Technology Tongji University China

ISBN: (纸本)9780999241165

As a matter of fact, it is usually taken for granted that the occurrence of unauthorized behaviors is necessary for the fraud detection in online payment services. However, we seek to break this stereotype in this work. We strive to design an ex-ante anti-fraud method that can work before unauthorized behaviors occur. The feasibility of our solution is supported by the cooperation of a characteristic and a finding in online payment fraud scenarios: The well-recognized characteristic is that online payment frauds are mostly caused by account compromise. Our finding is that account theft is indeed predictable based on users' high-risk behaviors, without relying on the behaviors of thieves. Accordingly, we propose an account risk prediction scheme to realize the ex-ante fraud detection. It takes in an account's historical transaction sequence, and outputs its risk score. The risk score is then used as an early evidence of whether a new transaction is fraudulent or not, before the occurrence of the new transaction. We examine our method on a real-world B2C transaction dataset from a commercial bank. Experimental results show that the ex-ante detection method can prevent more than 80% of the fraudulent transactions before they actually occur. When the proposed method is combined with an interim detection to form a real-time anti-fraud system, it can detect more than 94% of fraudulent transactions while maintaining a very low false alarm rate (less than 0.1%). © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Crime

来源：评论

学校读者我要写书评

暂无评论

Base Station Network Traffic Prediction Approach Based on LMA -DeepAR 6

Base Station Network Traffic Prediction Approach Based on LM...

引用

6th IEEE International Conference on Computer and Communication systems, ICCCS 2021

作者： Zhang, Jiachen Zuo, Xingquan Xu, Mingying Han, Jing Zhang, Baisheng Key Laboratory of Trustworthy Distributed Computing and Service Ministry of Education Beijing Uinversity of Posts and Telecommunications Beijing China Key Laboratory of Intelligent Telecommunication Software and Multimedia Beijing Uinversity of Posts and Telecommunications Beijing China Network Interface Virtualization Shanghai System Design Deptment Zhongxing Telecommunication Equipment Corporation Shanghai China

ISBN: (纸本)9780738126043

Accurate network traffic prediction of base station cell is very vital for the expansion and reduction of wireless devices in base station cell. The burst and uncertainty of base station cell network traffic makes the network traffic nonlinear and nonstationary, which brings challenges to the long-term prediction of network traffic. In this paper, the traffic model LMA-DeepAR for base station network is established based on DeepAR. Acordding to the distribution characteristics of network traffic, this paper proposes an artificial feature sequence calculation method based on local moving average (LMA). The feature sequence is input into DeepAR as covariant, which makes the statistical characteristics of network traffic near a period of time in the past be considered when updating parameters, and the interference of non-stationary network traffic on model training will be reduced. Experimental results show that the proposed prediction approach (LMA-DeepAR) outperforms other methods in the overall long-term prediction performance and stability of multi cell network traffic. © 2021 IEEE.

关键词： Base stations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：