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

arXiv 2021年

作者： Wang, Guangming Zhong, Jiquan Zhao, Shijie Wu, Wenhua Liu, Zhe Wang, Hesheng Department of Automation Institute of Medical Robotics Key Laboratory of System Control and Information Processing Ministry of Education Key Laboratory of Marine Intelligent Equipment and System of Ministry of Education Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai200240 China Department of Engineering Mechanics Shanghai Jiao Tong University Shanghai200240 China Department of Computer Science and Technology University of Cambridge CambridgeCB2 1TN United Kingdom

Depth and ego-motion estimations are essential for the localization and navigation of autonomous robots and autonomous driving. Recent studies make it possible to learn the per-pixel depth and ego-motion from the unlabeled monocular video. A novel unsupervised training framework is proposed with 3D hierarchical refinement and augmentation using explicit 3D geometry. In this framework, the depth and pose estimations are hierarchically and mutually coupled to refine the estimated pose layer by layer. The intermediate view image is proposed and synthesized by warping the pixels in an image with the estimated depth and coarse pose. Then, the residual pose transformation can be estimated from the new view image and the image of the adjacent frame to refine the coarse pose. The iterative refinement is implemented in a differentiable manner in this paper, making the whole framework optimized uniformly. Meanwhile, a new image augmentation method is proposed for the pose estimation by synthesizing a new view image, which creatively augments the pose in 3D space but gets a new augmented 2D image. The experiments on KITTI demonstrate that our depth estimation achieves state-of-the-art performance and even surpasses recent approaches that utilize other auxiliary tasks. Our visual odometry outperforms all recent unsupervised monocular learning-based methods and achieves competitive performance to the geometry-based method, ORB-SLAM2 with back-end optimization. Copyright © 2021, The Authors. All rights reserved.

关键词： Robots

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Xiaoke Zhu Danyang Li Xiaopan Chen Fumin Qi Fan Zhang Xiao-Yuan Jing School of Computer and Information Engineering Henan University Kaifeng China Henan Engineering Research Center of Intelligent Technology and Application Henan University Kaifeng China Department of System Operation National Supercomuting Center in Shenzhen Shenzhen China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng China School of Computer Science Wuhan University Wuhan China

ISBN: (数字)9798350390155

ISBN: (纸本)9798350390162

Facial image based kinship verification aims to decide whether there exists kinship between the given facial images. In practice, the cross-generation differences will cause adverse effects on kinship verification, which limits the performance. Therefore, how to mine the implied similarity from facial images with large cross-generation divergence is an important problem in kinship verification, which has not yet been well studied. In view of this, we propose a Similarity Mining via Implicit matching pattern LEarning (SMILE) approach for kinship verification. Specifically, SMILE mainly consists of two modules, including a Semi-coupled Multi-pattern Similarity Learning (SMSL) module and a Cross-Generation Feature Normalization (CGFN) module. The SMSL module is designed to learn multiple semi-coupled matching patterns for mining the implicit facial similarity information from different perspectives. The CGFN module aims to reduce the divergence between facial images of parent and child. Extensive experiments demonstrate that the proposed approach outperforms the existing state-of-the-art methods.

关键词： Pattern matching Similarity learning

来源：评论

学校读者我要写书评

暂无评论

Dimensionality Reduction and Attack Recognition using Neural Network Approaches

Dimensionality Reduction and Attack Recognition using Neural...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Vladimir A. Golovko Leanid U. Vaitsekhovich Pavel A. Kochurko Uladzimir S. Rubanau Computer Science Intelligence Information Technologies Department and Laboratory of Articial Neural Networks Brest State Technical University Belarus System Analysis Control and Processing of Information Department of Intelligent Information Technologies Brest State Technical University Belarus Department of Intelligent Information Technologies Brest State Technical University Belarus Information Systems Faculty Brest State Technical University Belarus

Most current Intrusion Detection systems (IDS) examine all data features to detect intrusion. Also existing intrusion detection approaches have some limitations, namely impossibility to process a large number of audit data for realtime operation, low detection and recognition accuracy. To overcome these limitations, we apply modular neural network models to detect and recognize attacks in computer networks. They are based on the combination of principal component analysis (PCA) neural networks and multilayer perceptrons (MLP). PCA networks are employed for important data extraction and to reduce high dimensional data vectors. We present two PCA neural networks for feature extraction: linear PCA (LPCA) and nonlinear PCA (NPCA). MLP is employed to detect and recognize attacks using feature-extracted data instead of original data. The proposed approaches are tested with the help of KDD-99 dataset. The experimental results demonstrate that the designed models are promising in terms of accuracy and computational time for real world intrusion detection.

关键词： Neural networks Intrusion detection Principal component analysis computer vision computer networks Multi-layer neural network Multilayer perceptrons Data mining Vectors Feature extraction

来源：评论

学校读者我要写书评

暂无评论

MG-SLAM: Structure Gaussian Splatting SLAM with Manhattan World Hypothesis

arXiv

引用

arXiv 2024年

作者： Liu, Shuhong Deng, Tianchen Zhou, Heng Li, Liuzhuozheng Wang, Hongyu Wang, Danwei Li, Mingrui Department of Information Science and Technology Department of Complexity Science and Engineering The University of Tokyo Tokyo113-8654 Japan Institute of Medical Robotics Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education Shanghai200240 China Department of Mechanical Engineering Columbia University New York10027 United States School of Electrical and Electronic Engineering Nanyang Technological University Singapore Department of Computer Science Dalian University of Technology Dalian116024 China

Gaussian Splatting SLAMs have made significant advancements in improving the efficiency and fidelity of real-time reconstructions. However, these systems often encounter incomplete reconstructions in complex indoor environments, characterized by substantial holes due to unobserved geometry caused by obstacles or limited view angles. To address this challenge, we present Manhattan Gaussian SLAM, an RGB-D system that leverages the Manhattan World hypothesis to enhance geometric accuracy and completeness. By seamlessly integrating fused line segments derived from structured scenes, our method ensures robust tracking in textureless indoor areas. Moreover, The extracted lines and planar surface assumption allow strategic interpolation of new Gaussians in regions of missing geometry, enabling efficient scene completion. Extensive experiments conducted on both synthetic and real-world scenes demonstrate that these advancements enable our method to achieve state-of-the-art performance, marking a substantial improvement in the capabilities of Gaussian SLAM systems. © 2024, CC BY.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

Structural Robustness of Complex Networks: A Survey of A Posteriori Measures

arXiv

引用

arXiv 2023年

作者： Lou, Yang Wang, Lin Chen, Guanrong The Graduate School of Information Science and Technology Osaka University Osaka Suita565-0871 Japan The Department of Computer Science National Yang Ming Chiao Tung University Hsinchu300 Taiwan The Department of Automation Shanghai Jiao Tong University Shanghai200240 China The Key Laboratory of System Control and Information Processing Ministry of Education Shanghai200240 China The Department of Electrical Engineering City University of Hong Kong Hong Kong

Network robustness is critical for various industrial and social networks against malicious attacks, which has various meanings in different research contexts and here it refers to the ability of a network to sustain its functionality when a fraction of the network fail to work due to attacks. The rapid development of complex networks research indicates special interest and great concern about the network robustness, which is essential for further analyzing and optimizing network structures towards engineering applications. This comprehensive survey distills the important findings and developments of network robustness research, focusing on the a posteriori structural robustness measures for single-layer static networks. Specifically, the a posteriori robustness measures are reviewed from four perspectives: 1) network functionality, including connectivity, controllability and communication ability, as well as their extensions;2) malicious attacks, including conventional and computation-based attack strategies;3) robustness estimation methods using either analytical approximation or machine learning-based prediction;4) network robustness optimization. Based on the existing measures, a practical threshold of network destruction is introduced, with the suggestion that network robustness should be measured only before reaching the threshold of destruction. Then, a posteriori and a priori measures are compared experimentally, revealing the advantages of the a posteriori measures. Finally, prospective research directions with respect to a posteriori robustness measures are recommended. © 2023, CC BY.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Towards High-resolution 3D Anomaly Detection via Group-Level Feature Contrastive Learning

arXiv

引用

arXiv 2024年

作者： Zhu, Hongze Xie, Guoyang Hou, Chengbin Dai, Tao Gao, Can Wang, Jinbao Shen, Linlin National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Computer Science City University of Hong Kong Hong Kong Department of Intelligent Manufacturing CATL Ningde China Fuzhou Fuyao Institute for Advanced Study Fuyao University of Science and Technology Fuzhou China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

High-resolution point clouds (HRPCD) anomaly detection (AD) plays a critical role in precision machining and high-end equipment manufacturing. Despite considerable 3D-AD methods that have been proposed recently, they still cannot meet the requirements of the HRPCD-AD task. There are several challenges: i) It is difficult to directly capture HRPCD information due to large amounts of points at the sample level;ii) The advanced transformer-based methods usually obtain anisotropic features, leading to degradation of the representation;iii) The proportion of abnormal areas is very small, which makes it difficult to characterize. To address these challenges, we propose a novel group-level feature-based network, called Group3AD, which has a significantly efficient representation ability. First, we design an Intercluster Uniformity Network (IUN) to present the mapping of different groups in the feature space as several clusters, and obtain a more uniform distribution between clusters representing different parts of the point clouds in the feature space. Then, an Intracluster Alignment Network (IAN) is designed to encourage groups within the cluster to be distributed tightly in the feature space. In addition, we propose an Adaptive Group-Center Selection (AGCS) based on geometric information to improve the pixel density of potential anomalous regions during inference. The experimental results verify the effectiveness of our proposed Group3AD, which surpasses Reg3D-AD by the margin of 5% in terms of object-level AUROC on Real3DAD. We provide the code and supplementary information on our website: https://***/M-3LAB/Group3AD. Copyright © 2024, The Authors. All rights reserved.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Statistical Analysis of Intrinsic High-Frequency Characteristic Fluctuation of Emerging Silicon Gate-All-Around Nanosheet (NS) MOSFETs at Sub-3-nm Nodes

Statistical Analysis of Intrinsic High-Frequency Characteris...

引用

IEEE Electron Devices Technology and Manufacturing Conference (EDTM)

作者： Sekhar Reddy Kola Yiming Li Min-Hui Chuang Kazuhiko Endo Seiji Samukawa Parallel and Scientific Computing Laboratory Electrical Engineering and Computer Science International Graduate Program Institute of Communications Engineering Department of Electronics and Electrical Engineering Institute of Biomedical Engineering Center for mm Wave Smart Radar System and Technologies National Yang Ming Chiao Tung University Hsinchu Taiwan Institute of Fluid Science Tohoku University 2-1-1 Katahira Aoba-ku Sendai Japan National Institute of Advanced Industrial Science and Technology Tsukuba Japan

In recent years, the GAA NS Si MOSFET has been explored as a leading technology. However, the intrinsic parameters of GAA NS Si MOSFETs are affected to varying degrees by various fluctuation sources, Statistically independent and identically distributed $(iid)$ assumptions on the aforementioned random variables overestimate the variability of high-frequency characteristics, compared with considering all fluctuation factors simultaneously. Notably, the random nanosized metal grains dominates the variations of voltage gain, cut-off frequency, and 3dB frequency because the random work functions strongly alter the channel surface potential.

关键词： MOSFET Fluctuations Statistical analysis Gallium arsenide Cutoff frequency Metals Logic gates

来源：评论

学校读者我要写书评

暂无评论

Use Knowledge to Augment Data from Scratch: An Explainable Deep Immunohistochemical Diagnosis Model

SSRN

引用

SSRN 2024年

作者： Zhao, Jing Liu, Yuhan Zhang, Xinzhu Sun, Shiliang Yin, Minzhi School of Computer Science and Technology East China Normal University Shanghai200062 China Key Laboratory of System Control and Information Processing Ministry of Education Shanghai200240 China Department of Automation Shanghai Jiao Tong University Shanghai200240 China Department of Pathology Shanghai Children’s Medical Center Shanghai Jiao Tong University School of Medicine Shanghai200127 China

Pathological diagnosis has an important role as the last step in cancer diagnosis. When the naked eye is not enough to identify cancer, we usually use further immunohistochemical diagnosis, which is the detection of specific proteins to obtain protein sequences and their negative/positive expression, and make the final diagnosis based on the sequences. This process is a classification task for protein detection sequences. However, when deep learning goes into this field, it often has the problem of lack of data and poor explainability. Based on the above description, to solve the problem of small sample classification, we propose to extract knowledge from scratch, build protein knowledge graphs, and reuse protein embeddings from the knowledge graph to improve classification performance. In addition, we give explanation for the diagnostic model by visualizing importance and coupling degree of proteins. In our experiments, we find that our proposed classification model has good classification performance and explainability. © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

PUGAN: Physical Model-Guided Underwater Image Enhancement Using GAN with Dual-Discriminators

arXiv

引用

arXiv 2023年

作者： Cong, Runmin Yang, Wenyu Zhang, Wei Li, Chongyi Guo, Chun-Le Huang, Qingming Kwong, Sam Institute of Information Science Beijing Jiaotong University Beijing100044 China School of Control Science and Engineering Shandong University Jinan250061 China Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan250061 China Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing100044 China College of Computer Science Nankai University Tianjin300350 China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Peng Cheng Laboratory Shenzhen518055 China Department of Computer Science City University of Hong Kong Hong Kong City University of Hong Kong Shenzhen Research Institute Shenzhen51800 China

Due to the light absorption and scattering induced by the water medium, underwater images usually suffer from some degradation problems, such as low contrast, color distortion, and blurring details, which aggravate the difficulty of downstream underwater understanding tasks. Therefore, how to obtain clear and visually pleasant images has become a common concern of people, and the task of underwater image enhancement (UIE) has also emerged as the times require. Among existing UIE methods, Generative Adversarial Networks (GANs) based methods perform well in visual aesthetics, while the physical model-based methods have better scene adaptability. Inheriting the advantages of the above two types of models, we propose a physical model-guided GAN model for UIE in this paper, referred to as PUGAN. The entire network is under the GAN architecture. On the one hand, we design a Parameters Estimation subnetwork (Par-subnet) to learn the parameters for physical model inversion, and use the generated color enhancement image as auxiliary information for the Two-Stream Interaction Enhancement subnetwork (TSIE-subnet). Meanwhile, we design a Degradation Quantization (DQ) module in TSIE-subnet to quantize scene degradation, thereby achieving reinforcing enhancement of key regions. On the other hand, we design the Dual-Discriminators for the style-content adversarial constraint, promoting the authenticity and visual aesthetics of the results. Extensive experiments on three benchmark datasets demonstrate that our PUGAN outperforms state-of-the-art methods in both qualitative and quantitative metrics. The code and results can be found from the link of https://***/proj_***. © 2023, CC BY-NC-SA.

关键词： Discriminators

来源：评论

学校读者我要写书评

暂无评论

Low-latency federated learning over wireless channels with differential privacy

arXiv

引用

arXiv 2021年

作者： Wei, Kang Li, Jun Ma, Chuan Ding, Ming Chen, Cailian Jin, Shi Han, Zhu Poor, H. Vincent School of Electrical and Optical Engineering Nanjing University of Science and Technology Nanjing210094 China Data61 CSIRO SydneyNSW2015 Australia The Department of Automation Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China The National Mobile Communications Research Laboratory Southeast University Nanjing210096 China The Department of Electrical and Computer Engineering The University of Houston HoustonTX77004 United States The Department of Computer Science and Engineering Kyung Hee University Seoul Korea Republic of The Department of Electrical and Computer Engineering Princeton University PrincetonNJ08544 United States

In federated learning (FL), model training is distributed over clients and local models are aggregated by a central server. The performance of uploaded models in such situations can vary widely due to imbalanced data distributions, potential demands on privacy protections, and quality of transmissions. In this paper, we aim to minimize FL training delay over wireless channels, constrained by overall training performance as well as each client's differential privacy (DP) requirement. We solve this problem in the framework of multi-agent multiarmed bandit (MAMAB) to deal with the situation where there are multiple clients confornting different unknown transmission environments, e.g., channel fading and interferences. Specifically, we first transform the long-term constraints on both training performance and each client's DP into a virtual queue based on the Lyapunov drift technique. Then, we convert the MAMAB to a max-min bipartite matching problem at each communication round, by estimating rewards with the upper confidence bound (UCB) approach. More importantly, we propose two efficient solutions to this matching problem, i.e., modified Hungarian algorithm and greedy matching with a better alternative (GMBA), in which the first one can achieve the optimal solution with a high complexity while the second one approaches a better tradeoff by enabling a verified low-complexity with little performance loss. In addition, we develop an upper bound on the expected regret of this MAMAB based FL framework, which shows a linear growth over the logarithm of communication rounds, justifying its theoretical feasibility. Extensive experimental results are conducted to validate the effectiveness of our proposed algorithms, and the impacts of various parameters on the FL performance over wireless edge networks are also discussed. Copyright © 2021, The Authors. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：