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

Weighted wavelet tree sparsity regularization for compressed sensing magnetic resonance image reconstruction

学校读者我要写书评

暂无评论

Weighted wavelet tree sparsity regularization for compressed...

International Conference on Emerging Trends and Advances in electrical engineering and Renewable Energy, ETAEERE 2016

作者： Deka, Bhabesh Datta, Sumit Computer Vision and Image Processing Laboratory Department of Electronics and Communication Engineering Tezpur University TezpurAssam784028 India

ISBN: (纸本)9789811047640

Compressed sensing in magnetic resonance imaging (CS-MRI) improves the MRI scan time by acquiring only a few k-space samples and then reconstructs the image using a nonlinear procedure from the highly undersampled measurements. Besides the standard wavelet sparsity, MR images are also found to exhibit tree sparsity across various scales of the wavelet decomposition which are generally modeled as overlapping group sparsity. In this chapter, we propose a novel iteratively weighted wavelet tree sparsity based CS-MRI reconstruction technique to estimate MR images from highly undersampled Fourier measurements. Simulations on various real MR images show that the proposed technique offers significant improvements compared to the state-of-the-art either in terms of visual quality or k-space measurements with the same reconstruction time. © Springer Nature Singapore Pte Ltd. 2018.

关键词： Magnetic resonance imaging

Interpretation of Brain Morphology in Association to Alzheimer's Disease Dementia Classification Using Graph Convolutional Networks on Triangulated Meshes

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Azcona, Emanuel Besson, Pierre Wu, Yunan Punjabi, Arjun Martersteck, Adam Dravid, Amil Parrish, Todd B. Bandt, S. Kathleen Katsaggelos, Aggelos K. Image and Video Processing Laboratory Department of Electrical and Computer Engineering Northwestern University IL United States Lab Northwestern Memorial Hospital IL United States Neuroimaging Laboratory Department of Radiology Northwestern University IL United States Augmented Intelligence in Medical Imaging Northwestern University IL United States

We propose a mesh-based technique to aid in the classification of Alzheimer's disease dementia (ADD) using mesh representations of the cortex and subcortical structures. Deep learning methods for classification tasks that utilize structural neuroimaging often require extensive learning parameters to optimize. Frequently, these approaches for automated medical diagnosis also lack visual interpretability for areas in the brain involved in making a diagnosis. This work: (a) analyzes brain shape using surface information of the cortex and subcortical structures, (b) proposes a residual learning framework for state-of-the-art graph convolutional networks which offer a significant reduction in learnable parameters, and (c) offers visual interpretability of the network via class-specific gradient information that localizes important regions of interest in our inputs. With our proposed method leveraging the use of cortical and subcortical surface information, we outperform other machine learning methods with a 96.35% testing accuracy for the ADD vs. healthy control problem. We confirm the validity of our model by observing its performance in a 25-trial Monte Carlo cross-validation. The generated visualization maps in our study show correspondences with current knowledge regarding the structural localization of pathological changes in the brain associated to dementia of the Alzheimer's type. Copyright © 2020, The Authors. All rights reserved.

关键词： Mesh generation

Disentanglement Then Reconstruction: Learning Compact Features for Unsupervised Domain Adaptation

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zhou, Lihua Ye, Mao Li, Xinpeng Zhu, Ce Liu, Yiguang Li, Xue School of Computer Science and Engineering University of Electronic Science and Technology of China ChengduP.R.611731 China School of Information and Communication Engineering University of Electronic Science and Technology of China ChengduP.R.611731 China Vision and Image Processing Laboratory School of Computer Science Sichuan University ChengduP.R.610065 China School of Information Technology and Electronic Engineering The University of Queensland BrisbaneQLD4072 Australia

Recent works in domain adaptation always learn domain invariant features to mitigate the gap between the source and target domains by adversarial methods. The category information are not sufficiently used which causes the learned domain invariant features are not enough discriminative. We propose a new domain adaptation method based on prototype construction which likes capturing data cluster centers. Specifically, it consists of two parts: disentanglement and reconstruction. First, the domain specific features and domain invariant features are disentangled from the original features. At the same time, the domain prototypes and class prototypes of both domains are estimated. Then, a reconstructor is trained by reconstructing the original features from the disentangled domain invariant features and domain specific features. By this reconstructor, we can construct prototypes for the original features using class prototypes and domain prototypes correspondingly. In the end, the feature extraction network is forced to extract features close to these prototypes. Our contribution lies in the technical use of the reconstructor to obtain the original feature prototypes which helps to learn compact and discriminant features. As far as we know, this idea is proposed for the first time. Experiment results on several public datasets confirm the state-of-the-art performance of our method. Copyright © 2020, The Authors. All rights reserved.

关键词： Machine learning

image Restoration for Terahertz image Based on Complex-Valued Deconvolution 8

学校读者我要写书评

暂无评论

Image Restoration for Terahertz Image Based on Complex-Value...

8th Asia-Pacific Conference on Antennas and Propagation, APCAP 2019

作者： Ning, Wei Qi, Feng Wang, Jinkuan Northeastern University School of Computer Science and Engineering Shenyang110169 China Chinese Academy of Sciences Shenyang Institute of Automation Shenyang110016 China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang110016 China Key Laboratory of Opto-Electronic Information Processing Chinese Academy of Sciences Shenyang110016 China Key Lab of Image Understanding and Computer Vision Liaoning Province Shenyang110016 China

ISBN: (纸本)9781665400541

According to the unique characteristics of terahertz (THz) waves, THz imaging has become a hot topic in widely application areas. However, the imaging resolution is constrained by its long wavelength. Generally, the deconvolution is always used to reconstruct the object function. In this paper, a method that combining the classic deconvolution algorithm with the complex-value data processing is investigated. It is posed that the proposed complex-number deconvolution achieves better performance compared to the real-valued deconvolution. © 2019 IEEE.

关键词： Deconvolution

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

THREE DIMENSIONAL BLIND image DECONVOLUTION FOR FLUORESCENCE MICROSCOPY USING GENERATIVE ADVERSARIAL NETWORKS

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Lee, Soonam Han, Shuo Salama, Paul Dunn, Kenneth W. Delp, Edward J. Video and Image Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette IN United States Department of Electrical and Computer Engineering Indiana University Indianapolis IN United States Division of Nephrology School of Medicine Indiana University

Due to image blurring image deconvolution is often used for studying biological structures in fluorescence microscopy. Fluorescence microscopy image volumes inherently suffer from intensity inhomogeneity, blur, and are corrupted by various types of noise which exacerbate image quality at deeper tissue depth. Therefore, quantitative analysis of fluorescence microscopy in deeper tissue still remains a challenge. This paper presents a three dimensional blind image deconvolution method for fluorescence microscopy using 3-way spatially constrained cycle-consistent adversarial networks. The restored volumes of the proposed deconvolution method and other well-known deconvolution methods, denoising methods, and an inhomogeneity correction method are visually and numerically evaluated. Experimental results indicate that the proposed method can restore and improve the quality of blurred and noisy deep depth microscopy image visually and quantitatively. Copyright © 2019, The Authors. All rights reserved.

关键词： image reconstruction

Drugs with SMILES Similar to Coxibs

学校读者我要写书评

暂无评论

Drugs with SMILES Similar to Coxibs

IEEE Symposium on Bioinformatics and Bioengineering (BIBE)

作者： George Kallergis Stelios Sfakianakis Michael Zervakis Marios Spanakis Digital Image and Signal Processing Laboratory School of Electrical and Computer Engineering Technical University of Crete Polytechnioupolis Chania Greece Computational Biomedicine Laboratory Institute of Computer Science Foundation for Research & Technology Hellas (FORTH) Heracklion Greece

Coxibs are a group of drugs with selective inhibition against cyclooxygenase-2 (COX-2) enzymes with increased interest from scientific community due to their side effects and potential other pharmacological mechanisms. The aim of this work is to utilize the chemical characteristics of coxibs in order to identify compounds with similar chemical structure. The approach is based on the assessment of the Simplified Molecular-Input Line-Entry System (SMILES) as adequate molecular structure representations for the identification of drug similarities. The similarity measurements are based on molecular fingerprints that were extracted from coxibs and the Maximum Consecutive Subsequence (MCS) algorithm. An ensemble of methods based on majority voting, weighting and equal weighting on the algorithms was further applied. Majority voting returned 200 similar compounds whereas weighting and equal weighting returned 53 and 27 compounds respectively. Interestingly, despite the independence of the methods, all three identified 20 common compounds. The identification of drugs with potential chemical similarity with coxibs, as revealed from similarity measurements of fingerprints and MCS scores could provide new insights for potential biological targets for coxibs or drugs that could interact with COX-2 or other biological targets of coxibs.

关键词： Drugs Fingerprint recognition Compounds Chemicals Biological information theory Inhibitors Digital images

Jointly learning structured analysis discriminative dictionary and analysis multiclass classifier

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Zhang, Zhao Jiang, Weiming Qin, Jie Zhang, Li Li, Fanzhang Zhang, Min Yan, Shuicheng School of Computer Science and Technology Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou215006 China Computer Vision Laboratory ETH Zürich Zürich8092 Switzerland Department of Electrical and Computer Engineering National University of Singapore Singapore Singapore

In this paper, we propose an analysis mechanism based structured Analysis Discriminative Dictionary Learning (ADDL) framework. ADDL seamlessly integrates the analysis discriminative dictionary learning, analysis representation and analysis classifier training into a unified model. The applied analysis mechanism can make sure that the learnt dictionaries, representations and linear classifiers over different classes are independent and discriminating as much as possible. The dictionary is obtained by minimizing a reconstruction error and an analytical incoherence promoting term that encourages the sub-dictionaries associated with different classes to be independent. To obtain the representation coefficients, ADDL imposes a sparse l2,1-norm constraint on the coding coefficients instead of using l0 or l1-norm, since the l0 or l1-norm constraint applied in most existing DL criteria makes the training phase time consuming. The codes-extraction projection that bridges data with the sparse codes by extracting special features from the given samples is calculated via minimizing a sparse codes approximation term. Then we compute a linear classifier based on the approximated sparse codes by an analysis mechanism to simultaneously consider the classification and representation powers. Thus, the classification approach of our model is very efficient, because it can avoid the extra time-consuming sparse reconstruction process with trained dictionary for each new test data as most existing DL algorithms. Simulations on real image databases demonstrate that our ADDL model can obtain superior performance over other state-of-the-arts. Copyright © 2019, The Authors. All rights reserved.

关键词： Codes (symbols)

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