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

A new weighting scheme for fan-beam and circle cone-beam CT reconstructions

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wang, Wei Xia, Xiang-Gen He, Chuanjiang Ren, Zemin Lu, Jian Wang, Tianfu Lei, Baiying The School of Biomedical Engineering Shenzhen University National-Regional Key Technology Engineering Laboratory for Medical Ultrasound Guangdong Key Laboratory for Biomedical Measurements and Ultrasound Imaging School of Biomedical Engineering Health Science Center Shenzhen University Shenzhen China The Department of Electrical and Computer Engineering University of Delaware NewarkDE19716 United States The College of Mathematics and Statistics Chongqing University Chongqing China The College of Mathematics and Physics Chongqing University of Science and Technology Chongqing China The Shenzhen Key Laboratory of Advanced Machine Learning and Applications Shenzhen University Shenzhen China

In this paper, we first present an arc based algorithm for fan-beam computed tomography (CT) reconstruction via applying Katsevich’s helical CT formula to 2D fan-beam CT reconstruction. Then, we propose a new weighting function to deal with the redundant projection data. By extending the weighted arc based fan-beam algorithm to circle cone-beam geometry, we also obtain a new FDK-similar algorithm for circle cone-beam CT reconstruction. Experiments show that our methods can obtain higher PSNR and SSIM compared to the Parker-weighted conventional fan-beam algorithm and the FDK algorithm for super-short-scan trajectories. Copyright © 2021, The Authors. All rights reserved.

关键词： computerized tomography

Video salient object detection using a virtual border and guided filter

学校读者我要写书评

暂无评论

Pattern Recognition 2020年 97卷

作者： Wang, Qiong Zhang, Lu Zou, Wenbin Kpalma, Kidiyo College of Computer Science and Technology Zhejiang University of Technology No.288 Road Liuhe Hangzhou310023 China - UMR 6164 RennesF-35000 France College of Electronic and Information Engineering Shenzhen Key Laboratory of Advanced Machine Learning and Applications Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China

In this paper, we present a novel method for salient object detection in videos. Salient object detection methods based on background prior may miss salient region when the salient object touches the frame borders. To solve this problem, we propose to detect the whole salient object via the adjunction of virtual borders. A guided filter is then applied on the temporal output to integrate the spatial edge information for a better detection of the salient object edges. At last, a global spatio-temporal saliency map is obtained by combining the spatial saliency map and the temporal saliency map together according to the entropy. The proposed method is assessed on three popular datasets (Fukuchi, FBMS and VOS) and compared to several state-of-the-art methods. The experimental results show that the proposed approach outperforms the tested methods. © 2019

关键词： Object detection

Overview of the Tenth Dialog System Technology Challenge: DSTC10

学校读者我要写书评

暂无评论

IEEE/ACM Transactions on Audio Speech and Language Processing 2024年 32卷 765-778页

作者： Yoshino, Koichiro Chen, Yun-Nung Crook, Paul Kottur, Satwik Li, Jinchao Hedayatnia, Behnam Moon, Seungwhan Fei, Zhengcong Li, Zekang Zhang, Jinchao Feng, Yang Zhou, Jie Kim, Seokhwan Liu, Yang Jin, Di Papangelis, Alexandros Gopalakrishnan, Karthik Hakkani-Tur, Dilek Damavandi, Babak Geramifard, Alborz Hori, Chiori Shah, Ankit Zhang, Chen Li, Haizhou Sedoc, Joao D'haro, Luis F. Banchs, Rafael Rudnicky, Alexander Guardian Robot Project R-IH RIKEN 2-2-2 Hikaridai Seika Shoraku619-0288 Japan Information Science Nara Institute of Science and Technology Ikoma630-0101 Japan Computer Science and Information Engineering National Taiwan University Taipei10617 Taiwan Inc. Palo AltoCA95054 United States Alexa AI *** Inc. SunnyvaleCA94089 United States Meta Seattle RedmondWA98052 United States Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Tencent AI Lab Beijing Beijing China Kexueyuan South Road Zhongguancun Beijing100190 China Beijing 100190 China Alexa AI *** Inc. SunnyvaleCA United States 1120 Enterprise way Sunnyvale94089 United States *** Inc. SeattleWA United States Menlo Park CA United States Audio and Speech Group Mitsubishi Electric Research Laboratories CambridgeMA02139-1955 United States Carnegie Mellon University Department of Language and Information Technologies or just Carnegie Mellon University Pittsburgh United States National University of Singapore Singapore Singapore Department of Electrical and Computer Engineering National University of Singapore Singapore Singapore Shenzhen Research Institute of Big Data School of Data Science Chinese University of Hong Kong Shenzhen518172 China New York University New YorkNY United States ETSI de Telecomunicacion - Speech Technology and Machine Learning Group Universidad Politecnica de Madrid Ciudad Universitaria Madrid28040 Spain Nanyang Technological University Singapore Singapore Carnegie Mellon University PittsburghPA United States

This article introduces the Tenth Dialog System Technology Challenge (DSTC-10). This edition of the DSTC focuses on applying end-to-end dialog technologies for five distinct tasks in dialog systems, namely 1. Incorporation of Meme images into open domain dialogs, 2. Knowledge-grounded Task-oriented Dialogue Modeling on Spoken Conversations, 3. Situated Interactive Multimodal dialogs, 4. Reasoning for Audio Visual Scene-Aware Dialog, and 5. Automatic Evaluation and Moderation of Open-domainDialogue Systems. This article describes the task definition, provided datasets, baselines, and evaluation setup for each track. We also summarize the results of the submitted systems to highlight the general trends of the state-of-the-art technologies for the tasks. © 2023 The Authors.

关键词： Job analysis

A Review of Generalized Zero-Shot learning Methods

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Pourpanah, Farhad Abdar, Moloud Luo, Yuxuan Zhou, Xinlei Wang, Ran Lim, Chee Peng Wang, Xi-Zhao Jonathan Wu, Q.M. The Centre for Computer Vision and Deep Learning Department of Electrical and Computer Engineering University of Windsor WindsorONN9B 3P4 Canada Deakin University Australia The Department of Computer Science City University of Hong Kong Hong Kong The College of Mathematics and Statistics Shenzhen Key Lab. of Advanced Machine Learning and Applications Shenzhen University Shenzhen518060 China The College of Computer Science and Software Engineering Guangdong Key Lab. of Intelligent Information Processing Shenzhen University Shenzhen518060 China

Generalized zero-shot learning (GZSL) aims to train a model for classifying data samples under the condition that some output classes are unknown during supervised learning. To address this challenging task, GZSL leverages semantic information of the seen (source) and unseen (target) classes to bridge the gap between both seen and unseen classes. Since its introduction, many GZSL models have been formulated. In this review paper, we present a comprehensive review on GZSL. Firstly, we provide an overview of GZSL including the problems and challenges. Then, we introduce a hierarchical categorization for the GZSL methods and discuss the representative methods in each category. In addition, we discuss the available benchmark data sets and applications of GZSL, along with a discussion on the research gaps and directions for future investigations. Copyright © 2020, The Authors. All rights reserved.

关键词： Zero-shot learning

Enhancing geometric factors in model learning and inference for object detection and instance segmentation

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zheng, Zhaohui Wang, Ping Ren, Dongwei Liu, Wei Ye, Rongguang Hu, Qinghua Zuo, Wangmeng The School of Mathematics Tianjin University Tianjin300350 China The School of Computer Science and Technology Harbin Institute of Technology Harbin150001 China The Tianjin Key Laboratory of Machine Learning College of Intelligence and Computing Tianjin University Tianjin300350 China

Deep learning-based object detection and instance segmentation have achieved unprecedented progress. In this paper, we propose Complete-IoU (CIoU) loss and Cluster-NMS for enhancing geometric factors in both bounding box regression and Non-Maximum Suppression (NMS), leading to notable gains of average precision (AP) and average recall (AR), without the sacrifice of inference efficiency. In particular, we consider three geometric factors, i.e., overlap area, normalized central point distance and aspect ratio, which are crucial for measuring bounding box regression in object detection and instance segmentation. The three geometric factors are then incorporated into CIoU loss for better distinguishing difficult regression cases. The training of deep models using CIoU loss results in consistent AP and AR improvements in comparison to widely adopted ln-norm loss and IoU-based loss. Furthermore, we propose Cluster-NMS, where NMS during inference is done by implicitly clustering detected boxes and usually requires less iterations. Cluster-NMS is very efficient due to its pure GPU implementation, and geometric factors can be incorporated to improve both AP and AR. In the experiments, CIoU loss and Cluster-NMS have been applied to state-of-the-art instance segmentation (e.g., YOLACT and BlendMask-RT), and object detection (e.g., YOLO v3, SSD and Faster R-CNN) models. Taking YOLACT on MS COCO as an example, our method achieves performance gains as +1.7 AP and +6.2 AR100 for object detection, and +1.1 AP and +3.5 AR100 for instance segmentation, with 27.1 FPS on one NVIDIA GTX 1080Ti GPU. All the source code and trained models are available at https://***/Zzh-tju/CIoU. Copyright © 2020, The Authors. All rights reserved.

关键词：

Maximal η-clique maintenance over uncertain graph streams

学校读者我要写书评

暂无评论

Information Sciences 2025年 717卷

作者： Ma, Ziyi Wang, Liqing Yang, Jianye Zhou, Xu Li, Kenli Gao, Cuiyun School of Artificial Intelligence Hebei University of Technology Tianjin300401 China Chinacoal Beijing Coal Mining Machinery Co. Ltd. Beijing102400 China Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University Wuzhou543002 China Department of New Networks PengCheng Laboratory Shenzhen518055 China Cyberspace Institute of Advanced Technology Guangzhou University Guangzhou510006 China College of Computer Science and Electronic Engineering Hunan University Changsha410082 China Shenzhen518055 China

Maximal clique enumeration is a critical task for analyzing graph data and has a wide range of applications, such as community detection, protein complex identification, and group recommendation. Although many efficient algorithms have been proposed, most of them are designed for static or deterministic graphs. However, in many real-life applications, graphs are often highly dynamic and nondeterministic. In this paper, we study the problem of maximal η-clique maintenance (shorted as MCM) over uncertain graph streams. Given an uncertain graph G and a probability threshold η, MCM reports all incremental η-cliques in G for each update edge of G. To the best of our knowledge, we are the first to systematically study this problem. We first develop a local pivot-based enumeration technique that utilizes the pivot priority of candidates to achieve effective pruning during the maximal η-clique enumeration procedure. Based on the technique, we propose a competitive baseline approach LPMCM, which finds newly generated maximal η-cliques and internal maximal η-cliques. Although LPMCM avoids repeated enumeration of the same maximal η-cliques, it still requires expensive costs in terms of η-clique maximality determination. To further enhance maintenance efficiency, we introduce an approach HLPMCM using the hash-based maximality determination technique and an improved internal maximal η-clique enumeration technique. Extensive experiments show that HLPMCM can achieve 1.1x-19.0x speedup over the competitors and consumes slightly more memory. © 2025 Elsevier Inc.

关键词： Maintenance

Anomaly detection in dynamic graphs via transformer

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Liu, Yixin Pan, Shirui Wang, Yu Guang Xiong, Fei Wang, Liang Chen, Qingfeng Lee, Vincent C.S. the Department of Data Science and AI Faculty of IT Monash University ClaytonVIC3800 Australia Shanghai Jiao Tong University Institute of Natural Sciences School of Mathematical Sciences the Max Planck Institute for Mathematics in Sciences Mathematics Machine Learning group Key Laboratory of Communication and Information Systems Beijing Municipal Commission of Education Beijing Jiaotong University Beijing100044 China School of Computer Science Northwestern Polytechnical University Xi’an10072 China School of Computer Electronic and Information Guangxi University Nanning530004 China

Detecting anomalies for dynamic graphs has drawn increasing attention due to their wide applications in social networks, e-commerce, and cybersecurity. Recent deep learning-based approaches have shown promising results over shallow methods. However, they fail to address two core challenges of anomaly detection in dynamic graphs: the lack of informative encoding for unattributed nodes and the difficulty of learning discriminate knowledge from coupled spatial-temporal dynamic graphs. To overcome these challenges, in this paper, we present a novel Transformer-based Anomaly Detection framework for DYnamic graphs (TADDY). Our framework constructs a comprehensive node encoding strategy to better represent each node’s structural and temporal roles in an evolving graphs stream. Meanwhile, TADDY captures informative representation from dynamic graphs with coupled spatial-temporal patterns via a dynamic graph transformer model. The extensive experimental results demonstrate that our proposed TADDY framework outperforms the state-of-the-art methods by a large margin on six real-world datasets. © 2021, CC BY.

关键词： Anomaly detection

Random Occlusion Recovery with Noise Channel for Person Re-identification 16th

学校读者我要写书评

暂无评论

Random Occlusion Recovery with Noise Channel for Person Re-i...

16th International Conference on Intelligent Computing, ICIC 2020

作者： Zhang, Kun Wu, Di Yuan, Changan Qin, Xiao Wu, Hongjie Zhao, Xingming Zhang, Lijun Du, Yuchuan Wang, Hanli Institute of Machine Learning and Systems Biology School of Electronics and Information Engineering Tongji University Shanghai China Guangxi Academy of Science Nanning530025 China School of Computer and Information Engineering Nanning Normal University Nanning530299 China School of Computer Science and Technology Soochow University Suzhou215006 China School of Electronic and Information Engineering Suzhou University of Science and Technology Suzhou215009 China Fudan University Shanghai200433 China Key Laboratory of Computational Neuroscience and Brain-Inspired Intelligence Ministry of Education Shanghai China Collaborative Innovation Center of Intelligent New Energy Vehicle and School of Automotive Studies Tongji University Shanghai201804 China The Key Laboratory of Road and Traffic Engineering of the Ministry of Education Department of Transportation Engineering Tongji University Shanghai201804 China Department of Computer Science and Technology the Key Laboratory of Embedded System and Service Computing and Shanghai Institute of Intelligent Science and Technology Tongji University Shanghai200092 China

ISBN: (纸本)9783030607982

Person re-identification, as the basic task of a multi-camera surveillance system, plays an important role in a variety of surveillance applications. However, the current mainstream person re-identification model based on deep learning requires a lot of labeled data, which takes a lot of time and manpower. In this study, we proposed a person re-identification method based on random occlusion recovery with noise channel. We add random occlusion blocks to the original image, use the GAN model for repair, and use the repaired image to expand the original training set. After that, the generated image is adjusted through the noise channel. Finally, we use the enhanced data set to train the baseline model. Our model achieves the state-of-the-art on Market-1501 dataset, proving that the method is effective. © 2020, Springer Nature Switzerland AG.

关键词： Generative adversarial networks

Plant Leaf Recognition Network Based on Feature learning and Metric learning 16th

学校读者我要写书评

暂无评论

Plant Leaf Recognition Network Based on Feature Learning and...

16th International Conference on Intelligent Computing, ICIC 2020

作者： Yang, Hongwei Wu, Di Yuan, Changan Qin, Xiao Wu, Hongjie Zhao, Xingming Zhao, Zhongqiu Institute of Machine Learning and Systems Biology School of Electronics and Information Engineering Tongji University Shanghai China Guangxi Academy of Science Nanning530025 China School of Computer and Information Engineering Nanning Normal University Nanning530299 China School of Computer Science and Technology Soochow University Suzhou215006 China School of Electronic and Information Engineering Suzhou University of Science and Technology Suzhou215009 China Fudan University Shanghai200433 China Key Laboratory of Computational Neuro-Science and Brain-Inspired Intelligence Ministry of Education Shanghai China College of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China

ISBN: (纸本)9783030607982

Plant image recognition is an important thing for protecting plants, protecting the environment, and protecting nature. Recently, most models in the field of plant leaf recognition make classification after extracting global features. In this paper, we propose a plant leaf recognition model based on metric learning. Metric learning calculates the similarity of the extracted feature vectors to obtain the distance between different sample features, so as to determine whether similar pictures belong to the same category, and then achieve the classification effect. In this study, feature triplet are used for metric learning, and the loss function we used is triplet-loss. © 2020, Springer Nature Switzerland AG.

关键词： Image recognition