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

Motion Projection Consistency Based 3D Human Pose Estimation with Virtual Bones from Monocular Videos

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wang, Guangming Zeng, Honghao Wang, Ziliang Liu, Zhe Wang, Hesheng Department of Automation Key Laboratory of System Control and Information Processing Ministry of Education Key Laboratory of Marine Intelligent Equipment and System Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai200240 China The Department of Computer Science and Technology University of Cambridge CambridgeCB3 0FD United Kingdom

Real-time 3D human pose estimation is crucial for human-computer interaction. It is cheap and practical to estimate 3D human pose only from monocular video. However, recent bone splicing based 3D human pose estimation method brings about the problem of cumulative error. In this paper, the concept of virtual bones is proposed to solve such a challenge. The virtual bones are imaginary bones between non-adjacent joints. They do not exist in reality, but they bring new loop constraints for the estimation of 3D human joints. The proposed network in this paper predicts real bones and virtual bones, simultaneously. The final length of real bones is constrained and learned by the loop constructed by the predicted real bones and virtual bones. Besides, the motion constraints of joints in consecutive frames are considered. The consistency between the 2D projected position displacement predicted by the network and the captured real 2D displacement by the camera is proposed as a new projection consistency loss for the learning of 3D human pose. The experiments on the Human3.6M dataset demonstrate the good performance of the proposed method. Ablation studies demonstrate the effectiveness of the proposed inter-frame projection consistency constraints and intra-frame loop constraints. Copyright © 2021, The Authors. All rights reserved.

关键词： E-learning

SPP-CNN: An Efficient Framework for Network Robustness Prediction

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wu, Chengpei Lou, Yang Wang, Lin Li, Junli Li, Xiang Chen, Guanrong The College of Computer Science Sichuan Normal University Chengdu610066 China The Key Laboratory of System Control and Information Processing Ministry of Education Shanghai200240 China The Department of Computer Science National Yang Ming Chiao Tung University Hsinchu300 Taiwan The Department of Automation Shanghai Jiao Tong University Shanghai200240 China The Institute of Complex Networks and Intelligent Systems Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai201210 China The Department of Control Science and Engineering Tongji University Shanghai200240 China The Department of Electrical Engineering City University of Hong Kong Hong Kong

This paper addresses the robustness of a network to sustain its connectivity and controllability against malicious attacks. This kind of network robustness is typically measured by the time-consuming attack simulation, which returns a sequence of values that record the remaining connectivity and controllability after a sequence of node- or edge-removal attacks. For improvement, this paper develops an efficient framework for network robustness prediction, the spatial pyramid pooling convolutional neural network (SPP-CNN). The new framework installs a spatial pyramid pooling layer between the convolutional and fully-connected layers, overcoming the common mismatch issue in the CNN-based prediction approaches and extending its generalizability. Extensive experiments are carried out by comparing SPP-CNN with three state-of-the-art robustness predictors, namely a CNN-based and two graph neural networks-based frameworks. Synthetic and real-world networks, both directed and undirected, are investigated. Experimental results demonstrate that the proposed SPP-CNN achieves better prediction performances and better generalizability to unknown datasets, with significantly lower time-consumption, than its counterparts. © 2023, CC BY.

关键词： Complex networks

NMF: an Efficient Method for Detecting the Fallen Leaves Using Cleaning Robots on the Road

学校读者我要写书评

暂无评论

NMF: an Efficient Method for Detecting the Fallen Leaves Usi...

IEEE International Conference on Robotics and Biomimetics

作者： Yanzi Miao Zongwei Zhang Hesheng Wang Artificial Intelligence Research Institute China University of Mining and Technology Xuzhou China China University of Mining and Technology Xuzhou China 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 Beijing China

ISBN: (纸本)9781665405362

The improvement of urban greening level makes sanitary work more complicated and difficult, especially, for the seasonal leaf cleaning on roads in the park, campus etc.. With the rapid development of computer vision, it is a feasible and innovative way to detect and clean the fallen leaves effectively with intelligent robot. However, since the irregular shape and size, uneven distribution of fallen leaves and complex outdoor conditions, especially the densely stacked leaves, even current advanced object detection algorithm has no satisfactory effect on detection of fallen leaves. To deal with the dense leaves detection problem and improve navigation efficiency, we propose a Non-Maximum Fusion(NMF) algorithm. NMF scales the high-confidence box with the pre-defined δ to fuse intersecting and adjacent boxes instead of supressing these boxes. The experiments on the fallen leaves data set shows that NMF improves the fallen leaves detection coverage significantly and the coverage reaches to 95%. Also, NMF greatly reduces the number of goal nodes for path planning. Since NMF functions at the back end of detector to process detection boxes without training, it can be intergrated into any fallen leaves detection pipeline easily.

关键词： Training Navigation Shape Roads Pipelines Green products Object detection

GTNet: Generative transfer network for zero-shot object detection

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zhao, Shizhen Gao, Changxin Shao, Yuanjie Li, Lerenhan Yu, Changqian Ji, Zhong 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 School of Electrical and Information Engineering Tianjin University

We propose a Generative Transfer Network (GTNet) for zero-shot object detection (ZSD). GTNet consists of an Object Detection Module and a Knowledge Transfer Module. The Object Detection Module can learn large-scale seen domain knowledge. The Knowledge Transfer Module leverages a feature synthesizer to generate unseen class features, which are applied to train a new classification layer for the Object Detection Module. In order to synthesize features for each unseen class with both the intra-class variance and the IoU variance, we design an IoU-Aware Generative Adversarial Network (IoUGAN) as the feature synthesizer, which can be easily integrated into GTNet. Specifically, IoUGAN consists of three unit models: Class Feature Generating Unit (CFU), Foreground Feature Generating Unit (FFU), and Background Feature Generating Unit (BFU). CFU generates unseen features with the intra-class variance conditioned on the class semantic embeddings. FFU and BFU add the IoU variance to the results of CFU, yielding class-specific foreground and background features, respectively. We evaluate our method on three public datasets and the results demonstrate that our method performs favorably against the state-of-the-art ZSD approaches. Copyright © 2020, The Authors. All rights reserved.

关键词： Object recognition

Cavity-Quantum Electrodynamics with Moiré Flatband Photonic Crystals

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Yu-Tong Ye, Qi-Hang Yan, Jun-Yong Qiao, Yufei Chen, Chen Cheng, Xiao-Tian Li, Chen-Hui Zhang, Zi-Jian Huang, Cheng-Nian Meng, Yun Zou, Kai Zhan, Wen-Kang Zhao, Chao Hu, Xiaolong Tee, Clarence Augustine T.H. Sha, Wei E.I. Huang, Zhixiang Liu, Huiyun Jin, Chao-Yuan Ying, Lei Liu, Feng State Key Laboratory of Extreme Photonics and Instrumentation College of Information Science and Electronic Engineering Zhejiang University Hangzhou310027 China School of Physics Zhejiang Key Laboratory of Micro-nano Quantum Chips and Quantum Control Zhejiang University Hangzhou310027 China School of Precision Instrument and Optoelectronic Engineering Tianjin University Tianjin300072 China Key Laboratory of Optoelectronic Information Science and Technology Ministry of Education Tianjin300072 China Laboratory of Solid State Optoelectronics Information Technology Institute of Semiconductors Chinese Academy of Sciences Beijing100083 China College of Materials Science and Opto-Electronic Technology University of Chinese Academy of Science Beijing101804 China College of Physics and Electrical Information Engineering Zhejiang Normal University Hangzhou310058 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230039 China Department of Electronic and Electrical Engineering University College London LondonWC1E 7JE United Kingdom International Joint Innovation Center Zhejiang University Haining314400 China

Quantum emitters are a key component in photonic quantum technologies. Enhancing their single-photon emission by engineering the photonic environment using cavities can improve the overall efficiency in quantum information processing. However, this enhancement is often limited by the need for precise nanoscale control over emitter’s position within micro/nano-cavities. Inspired by the fascinated physics of moiré pattern, we present an approach to strongly modify the spontaneous emission rate of a quantum emitter using fine-designed multilayer moiré photonic crystal with a robust isolate-flatband dispersion. Theoretical analysis reveals that due to its nearly infinite photonic density of states, the moiré cavity can simultaneously possess high Purcell factor and large tolerance over emitter’s position. We experimentally demonstrate the coupling between this moiré cavity and a quantum dot via the cavity-determined polarization of the dot’s emission. The radiative lifetime of the quantum dot can be tuned by a factor of 40 from 42 ps to 1692 ps, attributed to strong Purcell enhancement and Purcell inhibition effects. Our findings pave the way for moiré flatband cavity-enhanced quantum light sources, quantum optical switches and quantum nodes for quantum internet. Copyright © 2024, The Authors. All rights reserved.

关键词： Particle beams

Global Finite-Time Stabilization for a Chain of Integrators in the Presence of Actuator Saturation by Homogeneous Feedback

学校读者我要写书评

暂无评论

Global Finite-Time Stabilization for a Chain of Integrators ...

IEEE Conference on Decision and control

作者： Tan Hou Yuanlong Li Zongli Lin Department of Automation Shanghai Jiao Tong University Shanghai P. R. China Charles L. Brown Department of Electrical and Computer Engineering University of Virginia Charlottesville VA USA Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai P. R. China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai P. R. China Charles L. Brown Department of Electrical and Computer Engineering University of Virginia Charlottesville VA USA

This paper considers the problem of globally stabilizing a chain of integrators with actuator saturation in finite time. The proposed method is adapted from an existing scheduled low gain approach by relaxing the range of the value of the low gain parameter. Due to the special structure of the considered system, the proposed feedback law not only results in finite-time stability but also is homogeneous in the whole state space. The homogeneity of the proposed feedback law allows its implementation through the discretization of a compact set of the state space and thus obviation from numerical difficulties in the existing scheduled low gain design. A numerical example is presented to validate our theoretical results and demonstrate that our approach achieves faster convergence than the existing methods.

关键词：

Private and Robust Distributed Nonconvex Optimization via Polynomial Approximation

学校读者我要写书评

暂无评论

arXiv 2021年

作者： He, Zhiyu He, Jianping Chen, Cailian 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 Automatic Control Laboratory ETH Zürich Zürich8092 Switzerland

There has been work that exploits polynomial approximation to solve distributed nonconvex optimization problems involving univariate objectives. This idea facilitates arbitrarily precise global optimization without requiring local evaluations of gradients at every iteration. Nonetheless, there remains a gap between existing guarantees and practical requirements, e.g., privacy preservation and robustness to network imperfections. To fill this gap and keep the above strengths, we propose a Private and Robust Chebyshev-Proxy-based distributed Optimization Algorithm (PR-CPOA). Specifically, to ensure both the accuracy of solutions and the privacy of local objectives, we design a new privacy-preserving mechanism. This mechanism leverages the randomness in blockwise insertions of perturbed vector states and hence provides a stronger privacy guarantee in the scope of (α, β)-data-privacy. Furthermore, to gain robustness against network imperfections, we use the push-sum consensus protocol as a backbone and discuss its specific enhancements. Thanks to the purely consensus-type iterations, we avoid the privacy-accuracy trade-off and the bother of selecting proper step sizes in different settings. We rigorously analyze the accuracy, privacy, and complexity of the proposed algorithm. We show that the advantages brought by introducing polynomial approximation are maintained when all the above requirements exist. © 2021, CC BY-NC-SA.

关键词： Polynomial approximation

Calibration of the internal and external parameters of wheeled robot mobile chasses and inertial measurement units based on nonlinear optimization

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Peng, Gang Lu, Zezao Tan, Zejie He, Dingxin Li, Xinde Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan School of Automation South East University Nanjing

Mobile robot positioning, mapping, and navigation systems generally employ an inertial measurement unit (IMU) to obtain the acceleration and angular velocity of the robot. However, errors in the internal and external parameters of an IMU arising from defective calibration directly affect the accuracy of robot positioning and pose estimation. While this issue has been addressed by the mature internal reference calibration methods available for IMUs, external reference calibration methods between the IMU and the chassis of a mobile robot are lacking. This study addresses this issue by proposing a novel chassis-IMU internal and external parameter calibration algorithm based on nonlinear optimization, which is designed for robots equipped with cameras, IMUs, and wheel speed odometers, and functions under the premise of accurate calibrations for the internal parameters of the IMU and the internal and external parameters of the camera. All of the internal and external reference calibrations are conducted using the robot's existing equipment without the need for additional calibration aids. The feasibility of the method is verified by its application to a Mecanum wheel omnidirectional mobile platform as an example, as well as suitable for other type chassis of mobile robots. The proposed calibration method is thereby demonstrated to guarantee the accuracy of robot pose estimation. Copyright © 2020, The Authors. All rights reserved.

关键词： Mobile robots

Relevant Region Prediction for Crowd Counting

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Chen, Xinya Bin, Yanrui Gao, Changxin Sang, Nong Tang, Hao Key Laboratory of Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Department of Information Engineering and Computer Science University of Trento

Crowd counting is a concerned and challenging task in computer vision. Existing density map based methods excessively focus on the individuals’ localization which harms the crowd counting performance in highly congested scenes. In addition, the dependency between the regions of different density is also ignored. In this paper, we propose Relevant Region Prediction (RRP) for crowd counting, which consists of the Count Map and the Region Relation-Aware Module (RRAM). Each pixel in the count map represents the number of heads falling into the corresponding local area in the input image, which discards the detailed spatial information and forces the network pay more attention to counting rather than localizing individuals. Based on the Graph Convolutional Network (GCN), Region Relation-Aware Module is proposed to capture and exploit the important region dependency. The module builds a fully connected directed graph between the regions of different density where each node (region) is represented by weighted global pooled feature, and GCN is learned to map this region graph to a set of relation-aware regions representations. Experimental results on three datasets show that our method obviously outperforms other existing state-of-the-art methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Directed graphs