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

IEEE Symposium on Nuclear Science (NSS/MIC)

作者： Siming Bayer Zhiwei Zhai Maddalena Strumia Xiaoguang Tong Ying Gao Marius Staring Berend Stoel Martin Ostermeier Rebecca Fahrig Arya Nabavi Andreas Maier Nishant Ravikumar Pattern Recognition Lab Friedrich-Alexander Universtiy Erlangen Germany Division of Image Processing Leiden University Medical Center Leiden Netherlands Siemens Healthcare GmbH Forchheim Germany Tianjin Huanhu Hospital Tianjin China Siemens Healthineers Ltd Beijing China Department of Neurosurgery Nordstadt Hospital KRH Hannover Germany

ISBN: (数字)9781728141640

ISBN: (纸本)9781728141657

Non-rigid registration is essential for a wide range of clinical applications, such as intraoperative image-guidance and postoperative follow-up assessment, and longitudinal image analysis for disease diagnosis and monitoring. Vascular structures are a rich descriptor of the organ deformation, since it permeates through all organs within body. As vasculature differs in size, shape and topology, following surgical intervention/treatment or due to disease progression, non-rigid vessel matching remains a challenging task. Recently, hybrid mixture models (HdMM) have been applied to tackle this challenge, and demonstrate significant improvements in terms of accuracy and robustness relative to the state-of-the-art. However, the smoothness constraint enforced on the deformation field with this approach only accounts for the global topology of the vasculature, resulting in a reduced capacity to accurately match localized changes to vascular structures, and preserve local topology. In this work, we proposed a modified version of HdMM by formulating an adaptive kernel, to enforce a local smoothness constraint on the deformation field, henceforth referred to as HdMMad. The proposed HdMMad framework is evaluated with cerebral and pulmonary vasculature, acquired retrospectively. The registration results for both data sets demonstrate that the proposed approach outperforms registration algorithms also designed to preserve local topology. Using HdMMad, around 80% of the initial registration error was reduced, for both data sets.

关键词： Topology Kernel Mixture models Strain Robustness Task analysis Magnetohydrodynamics

来源：评论

学校读者我要写书评

暂无评论

The effect of data augmentation on classification of atrial fibrillation in short single-lead ecg signals using deep neural networks

arXiv

引用

arXiv 2020年

作者： Hatamian, Faezeh Nejati Ravikumar, Nishant Vesal, Sulaiman Kemeth, Felix P. Struck, Matthias Maier, Andreas Department of Image Processing and Medical Technology Fraunhofer Institute for Integrated Circuits IIS Erlangen Germany Pattern Recognition Lab Department of Computer Science Friedrich-Alexander University Erlangen-Nrnberg Erlangen Germany School of Computing LICAMM Leeds Institute of Cardiovascular and Metabolic Medicine School of Medicine University of Leeds United Kingdom

Cardiovascular diseases are the most common cause of mortality worldwide. Detection of atrial fibrillation (AF) in the asymptomatic stage can help prevent strokes. It also improves clinical decision making through the delivery of suitable treatment such as, anticoagulant therapy, in a timely manner. The clinical significance of such early detection of AF in electrocardiogram (ECG) signals has inspired numerous studies in recent years, of which many aim to solve this task by leveraging machine learning algorithms. ECG datasets containing AF samples, however, usually suffer from severe class imbalance, which if unaccounted for, affects the performance of classification algorithms. Data augmentation is a popular solution to tackle this problem. In this study, we investigate the impact of various data augmentation algorithms, e.g., oversampling, Gaussian Mixture Models (GMMs) and Generative Adversarial Networks (GANs), on solving the class imbalance problem. These algorithms are quantitatively and qualitatively evaluated, compared and discussed in detail. The results show that deep learning-based AF signal classification methods benefit more from data augmentation using GANs and GMMs, than oversampling. Furthermore, the GAN results in circa 3% better AF classification accuracy in average while performing comparably to the GMM in terms of f1-score. Copyright © 2020, The Authors. All rights reserved.

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

Edge-Aware Graph Attention Network for Ratio of Edge-User Estimation in Mobile Networks

Edge-Aware Graph Attention Network for Ratio of Edge-User Es...

引用

International Conference on pattern recognition

作者： Jiehui Deng Sheng Wan Xiang Wang Enmei Tu Xiaolin Huang Jie Yang Chen Gong PCA Lab the Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China Hong Kong Polytechnic University Hong Kong SAR China

Estimating the Ratio of Edge-Users (REU) is an important issue in mobile networks, as it helps the subsequent adjustment of loads in different cells. However, existing approaches usually determine the REU manually, which are experience-dependent and labor-intensive, and thus the estimated REU might be imprecise. Considering the inherited graph structure of mobile networks, in this paper, we utilize a graph-based deep learning method for automatic REU estimation, where the practical cells are deemed as nodes and the load switchings among them constitute edges. Concretely, Graph Attention Network (GAT) is employed as the backbone of our method due to its impressive generalizability in dealing with networked data. Nevertheless, conventional GAT cannot make full use of the information in mobile networks, since it only incorporates node features to infer the pairwise importance and conduct graph convolutions, while the edge features that are actually critical in our problem are disregarded. To accommodate this issue, we propose an Edge-Aware Graph Attention Network (EAGAT), which is able to fuse the node features and edge features for REU estimation. Extensive experimental results on two real-world mobile network datasets demonstrate the superiority of our EAGAT approach to several state-of-the-art methods.

关键词： Deep learning Fuses Estimation Switches pattern recognition

来源：评论

学校读者我要写书评

暂无评论

A Parallel-based Lifting Algorithm and VLSI Architecture for DWT

引用

Journal of Electronics(China) 2006年第2期23卷 244-248页

作者： Xiong Chengyi Tian Jinwen Liu Jian Gao Zhirong The State Key Lab of Education Commission for Image Processing and Intelligent Control Institute of Pattern Recognition ＆ Artificial Intelligence Huazhong Univ. of Science ＆ Tech. Wuhan 430074 China College of Electronic Info. Eng. South- Center Univ. for Nationalities Wuhan 430074 China Dept of Computer Science Wuhan Univ. of Science ＆ Eng. Wuhan 430074 China

A novel Parallel-Based Lifting Algorithm （PBLA） for Discrete Wavelet Transform （DWT）, exploiting the parallelism of arithmetic operations in all lifting steps, is proposed in this paper. It leads to reduce the critical path latency of computation, and to reduce the complexity of hardware implementation as well. The detailed derivation on the proposed algorithm, as well as the resulting Very Large Scale Integration （VLSI） architecture, is introduced, taking the 9/7 DWT as an example but without loss of generality. In comparison with the Conventional Lifting Algorithm Based Implementation （ClabI）, the critical path latency of the proposed architecture is reduced by more than half from （4Tm ＋ 8Ta）to Tm ＋ 4Ta, and is competitive to that of Convolution-Based Implementation （CBI）, but the new implementation will save significantly in hardware. The experimental results demonstrate that the proposed architecture has good performance in both increasing working frequency and reducing area.

关键词： Discrete Wavelet Transform （DFT） Lifting scheme Parallel Very Large Scale Integration（VLSI）

来源：评论

学校读者我要写书评

暂无评论

Multi-level graph convolutional network with automatic graph learning for hyperspectral image classification

arXiv

引用

arXiv 2020年

作者： Wan, Sheng Gong, Chen Pan, Shirui Yang, Jie Yang, Jian PCA Lab Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Laboratory of Image Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China Faculty of Information Technology Monash University ClaytonVIC3800 Australia

Nowadays, deep learning methods, especially the Graph Convolutional Network (GCN), have shown impressive performance in hyperspectral image (HSI) classification. However, the current GCN-based methods treat graph construction and image classification as two separate tasks, which often results in suboptimal performance. Another defect of these methods is that they mainly focus on modeling the local pairwise importance between graph nodes while lack the capability to capture the global contextual information of HSI. In this paper, we propose a Multi-level GCN with Automatic Graph Learning method (MGCN-AGL) for HSI classification, which can automatically learn the graph information at both local and global levels. By employing attention mechanism to characterize the importance among spatially neighboring regions, the most relevant information can be adaptively incorporated to make decisions, which helps encode the spatial context to form the graph information at local level. Moreover, we utilize multiple pathways for local-level graph convolution, in order to leverage the merits from the diverse spatial context of HSI and to enhance the expressive power of the generated representations. To reconstruct the global contextual relations, our MGCN-AGL encodes the long range dependencies among image regions based on the expressive representations that have been produced at local level. Then inference can be performed along the reconstructed graph edges connecting faraway regions. Finally, the multi-level information is adaptively fused to generate the network output. In this means, the graph learning and image classification can be integrated into a unified framework and benefit each other. Extensive experiments have been conducted on three real-world hyperspectral datasets, which are shown to outperform the state-of-the-art methods. Copyright © 2020, The Authors. All rights reserved.

关键词： image classification

来源：评论

学校读者我要写书评

暂无评论

Rotation equivariant feature image pyramid network for object detection in optical remote sensing imagery

arXiv

引用

arXiv 2021年

作者： Shamsolmoali, Pourya Zareapoor, Masoumeh Chanussot, Jocelyn Zhou, Huiyu Yang, Jie The Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China The GIPSA-Lab Université Grenoble Alpes CNRS Grenoble INP Grenoble38000 France The Faculty of Electrical and Computer Engineering University of Iceland Reykjavik101 Iceland The School of Informatics University of Leicester LeicesterLE1 7RH United Kingdom

To read the paper please go to IEEE Transactions on Geoscience and Remote Sensing on IEEE Xplore. Detection of objects is extremely important in various aerial vision-based applications. Over the last few years, the methods based on convolution neural networks have made substantial progress. However, because of the large variety of object scales, densities, and arbitrary orientations, the current detectors struggle with the extraction of semantically strong features for small-scale objects by a predefined convolution kernel. To address this problem, we propose the rotation equivariant feature image pyramid network (REFIPN), an image pyramid network based on rotation equivariance convolution. The proposed model adopts single-shot detector in parallel with a lightweight image pyramid module to extract representative features and generate regions of interest in an optimization approach. The proposed network extracts feature in a wide range of scales and orientations by using novel convolution filters. These features are used to generate vector fields and determine the weight and angle of the highest-scoring orientation for all spatial locations on an image. By this approach, the performance for small-sized object detection is enhanced without sacrificing the performance for large-sized object detection. The performance of the proposed model is validated on two commonly used aerial benchmarks and the results show our proposed model can achieve state-of-the-art performance with satisfactory efficiency. Copyright © 2021, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

The Effect of Data Augmentation on Classification of Atrial Fibrillation in Short Single-Lead ECG Signals Using Deep Neural Networks

The Effect of Data Augmentation on Classification of Atrial ...

引用

IEEE International Conference on Acoustics, Speech and Signal processing

作者： Faezeh Nejati Hatamian Nishant Ravikumar Sulaiman Vesal Felix P. Kemeth Matthias Struck Andreas Maier Department of Image Processing and Medical Technology Fraunhofer Institute for Integrated Circuits IIS Erlangen Germany Centre for Computational Imaging and Simulation Technologies in Biomedicine (CISTIB) School of Computing LICAMM Leeds Institute of Cardiovascular and Metabolic Medicine School of Medicine University of Leeds United Kingdom Pattern Recognition Lab Friedrich-Alexander University Erlangen-Nürnberg Erlangen Germany

ISBN: (数字)9781509066315

ISBN: (纸本)9781509066322

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient spatialtemporal context modeling for action recognition?

arXiv

引用

arXiv 2021年

作者： Cao, Congqi Lu, Yue Zhang, Yifan Jiang, Dongmei Zhang, Yanning Natl. Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Shaanxi Provincial Key Lab on Speech and Image Information Processing School of Computer Science Northwestern Poly-technical University Xi'an710129 China National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing100190 China

Contextual information plays an important role in action recognition. Local operations have difficulty to model the relation between two elements with a long-distance interval. However, directly modeling the contextual information between any two points brings huge cost in computation and memory, especially for action recognition, where there is an additional temporal dimension. Inspired from 2D criss-cross attention used in segmentation task, we propose a recurrent 3D criss-cross attention (RCCA-3D) module to model the dense long-range spatiotemporal contextual information in video for action recognition. The global context is factorized into sparse relation maps. We model the relationship between points in the same line along the direction of horizon, vertical and depth at each time, which forms a 3D criss-cross structure, and duplicate the same operation with recurrent mechanism to transmit the relation between points in a line to a plane finally to the whole spatiotemporal space. Compared with the non-local method, the proposed RCCA-3D module reduces the number of parameters and FLOPs by 25% and 30% for video context modeling. We evaluate the performance of RCCA-3D with two latest action recognition networks on three datasets and make a thorough analysis of the architecture, obtaining the optimal way to factorize and fuse the relation maps. Comparisons with other state-of-the-art methods demonstrate the effectiveness and efficiency of our model. Copyright © 2021, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Learning data-adaptive non-parametric kernels

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2020年第1期21卷 8590-8628页

作者： Fanghui Liu Xiaolin Huang Chen Gong Jie Yang Li Li Department of Electrical Engineering ESAT-STADIUS KU Leuven Belgium Institute of Image Processing and Pattern Recognition Institute of Medical Robotics Shanghai Jiao Tong University Shanghai China PCA Lab Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology China and Department of Computing Hong Kong Polytechnic University Hong Kong SAR China Department of Automation BNRist Tsinghua University China

In this paper, we propose a data-adaptive non-parametric kernel learning framework in margin based kernel methods. In model formulation, given an initial kernel matrix, a data-adaptive matrix with two constraints is imposed in an entry-wise scheme. Learning this data-adaptive matrix in a formulation-free strategy enlarges the margin between classes and thus improves the model flexibility. The introduced two constraints are imposed either exactly (on small data sets) or approximately (on large data sets) in our model, which provides a controllable trade-off between model flexibility and complexity with theoretical demonstration. In algorithm optimization, the objective function of our learning framework is proven to be gradient-Lipschitz continuous. Thereby, kernel and classifier/regressor learning can be efficiently optimized in a unified framework via Nesterov's acceleration. For the scalability issue, we study a decomposition-based approach to our model in the large sample case. The effectiveness of this approximation is illustrated by both empirical studies and theoretical guarantees. Experimental results on various classification and regression benchmark data sets demonstrate that our non-parametric kernel learning framework achieves good performance when compared with other representative kernel learning based algorithms.

关键词： support vector machines non-parametric kernel learning gradient-Lipschitz continuous

来源：评论

学校读者我要写书评

暂无评论

AIM 2020 Challenge on image Extreme Inpainting 16th

AIM 2020 Challenge on Image Extreme Inpainting

引用

Workshops held at the 16th European Conference on Computer Vision, ECCV 2020

作者： Ntavelis, Evangelos Romero, Andrés Bigdeli, Siavash Timofte, Radu Hui, Zheng Wang, Xiumei Gao, Xinbo Shin, Chajin Kim, Taeoh Son, Hanbin Lee, Sangyoun Li, Chao Li, Fu He, Dongliang Wen, Shilei Ding, Errui Bai, Mengmeng Li, Shuchen Zeng, Yu Lin, Zhe Yang, Jimei Zhang, Jianming Shechtman, Eli Lu, Huchuan Zeng, Weijian Ni, Haopeng Cai, Yiyang Li, Chenghua Xu, Dejia Wu, Haoning Han, Yu Nadim, Uddin S. M. Jang, Hae Woong Ahmed, Soikat Hasan Yoon, Jungmin Jung, Yong Ju Li, Chu-Tak Liu, Zhi-Song Wang, Li-Wen Siu, Wan-Chi Lun, Daniel P. K. Suin, Maitreya Purohit, Kuldeep Rajagopalan, A.N. Narang, Pratik Mandal, Murari Chauhan, Pranjal Singh Computer Vision Lab ETH Zürich Zürich Switzerland CSEM Neuchâtel Switzerland School of Electronic Engineering Xidian University Xi’an China Image and Video Pattern Recognition Laboratory School of Electrical and Electronic Engineering Yonsei University Seoul Korea Republic of Baidu Inc. Beijing China Beijing China Dalian University of Technology Dalian China Adobe San Jose United States Rensselaer Polytechnic Institute Troy United States Peking University Beijing China Lab Gachon University Seongnam Korea Republic of Centre for Multimedia Signal Processing Department of Electronic and Information Engineering The Hong Kong Polytechnic University Hong Kong China Indian Institute of Technology Madras Chennai India BITS Pilani Pilani India MNIT Jaipur Jaipur India

ISBN: (纸本)9783030670696

This paper reviews the AIM 2020 challenge on extreme image inpainting. This report focuses on proposed solutions and results for two different tracks on extreme image inpainting: classical image inpainting and semantically guided image inpainting. The goal of track 1 is to inpaint large part of the image with no supervision. Similarly, the goal of track 2 is to inpaint the image by having access to the entire semantic segmentation map of the input. The challenge had 88 and 74 participants, respectively. 11 and 6 teams competed in the final phase of the challenge, respectively. This report gauges current solutions and set a benchmark for future extreme image inpainting methods. © 2020, Springer Nature Switzerland AG.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：