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

arXiv 2018年

作者： Huang, Yi-Jie Dou, Qi Wang, Zi-Xian Liu, Li-Zhi Jin, Ying Li, Chao-Feng Wang, Lisheng Chen, Hao Xu, Rui-Hua Institute of Image Processing and Pattern Recognition Department of Automation Shanghai Jiao Tong University China Imsight Medical Technology Co. Ltd. China Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong Sun Yat-sen University Cancer Center State Key Laboratory of Oncology in South China Collaborative Innovation Center for Cancer Medicine Guangzhou China

Segmentation of colorectal cancerous regions from 3D Magnetic Resonance (MR) images is a crucial procedure for radiotherapy which conventionally requires accurate delineation of tumour boundaries at an expense of labor, time and reproducibility. While deep learning based methods serve good baselines in 3D image segmentation tasks, small applicable patch size limits effective receptive field and degrades segmentation performance. In addition, Regions of interest (RoIs) localization from large whole volume 3D images serves as a preceding operation that brings about multiple benefits in terms of speed, target completeness, reduction of false positives. Distinct from sliding window or non-joint localization-segmentation based models, we propose a novel multitask framework referred to as 3D RoI-aware U-Net (3D RU-Net), for RoI localization and in-region segmentation where the two tasks share one backbone encoder network. With the region proposals from the encoder, we crop multi-level RoI in-region features from the encoder to form a GPU memory-efficient decoder for detail-preserving segmentation and therefore enlarged applicable volume size and effective receptive field. To effectively train the model, we designed a Dice formulated loss function for the global-to-local multi-task learning procedure. Based on the efficiency gains demonstrated by the proposed method, we went on to ensemble models with different receptive fields to achieve even higher performance costing minor extra computational expensiveness. Extensive experiments were subsequently conducted on 64 cancerous cases with a four-fold cross-validation, and the results showed significant superiority in terms of accuracy and efficiency over conventional state-of-the art frameworks. In conclusion, the proposed method has a huge potential for extension to other 3D object segmentation tasks from medical images due to its inherent generalizability. The code for the proposed method is publicly available. Copyright ©

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

A novel color image encryption algorithm based on genetic recombination and the four-dimensional memristive hyperchaotic system

引用

Chinese Physics B 2016年第10期25卷 76-88页

作者：柴秀丽甘志华路杨张苗辉陈怡然 School of Computer and Information Engineering Institute of Image Processing and Pattern Recognition Henan University Department of Electrical and Computer Engineering University of Pittsburgh School of Software Henan University Research Department Henan University

Recently, many image encryption algorithms based on chaos have been proposed. Most of the previous algorithms encrypt components R, G, and B of color images independently and neglect the high correlation between them. In the paper, a novel color image encryption algorithm is introduced. The 24 bit planes of components R, G, and B of the color plain image are obtained and recombined into 4 compound bit planes, and this can make the three components affect each other. A four-dimensional(4D) memristive hyperchaotic system generates the pseudorandom key streams and its initial values come from the SHA 256 hash value of the color plain image. The compound bit planes and key streams are confused according to the principles of genetic recombination, then confusion and diffusion as a union are applied to the bit planes,and the color cipher image is obtained. Experimental results and security analyses demonstrate that the proposed algorithm is secure and effective so that it may be adopted for secure communication.

关键词： genetic recombination memristive hyperchaotic system color image encryption confusion diffusion

来源：评论

学校读者我要写书评

暂无评论

Generalization Properties of hyper-RKHS and its Applications

arXiv

引用

arXiv 2018年

作者： Liu, Fanghui Shi, Lei Huang, Xiaolin Yang, Jie Suykens, Johan A.K. Department of Electrical Engineering ESAT-STADIUS KU Leuven Kasteelpark Arenberg 10 LeuvenB-3001 Belgium Shanghai Key Laboratory for Contemporary Applied Mathematics School of Mathematical Sciences Fudan University Shanghai200433 China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Institute of Medical Robotics Shanghai Jiao Tong University Shanghai200240 China

This paper generalizes regularized regression problems in a hyper-reproducing kernel Hilbert space (hyper-RKHS), illustrates its utility for kernel learning and out-of-sample extensions, and proves asymptotic convergence results for the introduced regression models in an approximation theory view. Algorithmically, we consider two regularized regression models with bivariate forms in this space, including kernel ridge regression (KRR) and support vector regression (SVR) endowed with hyper-RKHS, and further combine divide-and-conquer with Nyström approximation for scalability in large sample cases. This framework is general: the underlying kernel is learned from a broad class, and can be positive definite or not, which adapts to various requirements in kernel learning. Theoretically, we study the convergence behavior of regularized regression algorithms in hyper-RKHS and derive the learning rates, which goes beyond the classical analysis on RKHS due to the non-trivial independence of pairwise samples and the characterisation of hyper-RKHS. Experimentally, results on several benchmarks suggest that the employed framework is able to learn a general kernel function form an arbitrary similarity matrix, and thus achieves a satisfactory performance on classification tasks. Copyright © 2018, The Authors. All rights reserved.

关键词： Approximation theory

来源：评论

学校读者我要写书评

暂无评论

Edgy salient local binary patterns in inter-plane relationship for image retrieval in Diabetic Retinopathy

引用

Procedia Computer Science 2017年 115卷 440-447页

作者： Gajanan M. Galshetwar Laxman M. Waghmare Anil B. Gonde Subrahmanyam Murala Center of Excellence in Signal and Image Processing (COESIP) Department of ECE SGGSIET Nanded Maharashtra 431606 India Computer Vision and Pattern Recognition Laboratory Department of Electrical Engineering IIT Ropar Rupnagar 140001 India

In this paper, a novel approach for content based image retrieval (CBIR) in diabetic retinopathy (DR) is proposed. The concept of salient point selection and inter-plane relationship technique is used. Salient points are selected from edgy image and later using inter-planer relationship, Local Binary patterns (LBPs) are calculated using the salient point as a center pixel. Our approach enhanced the results as we used color features in combination with LBP features. Experimentation is carried out on MESSIDOR database of 1200 retinal images, proposed approach has average precision of 57.82% as compared to the earlier approach whose average precision is 53.70%.

关键词： Content-Based image retrieval (CBIR) Diabetic Retinopathy (DR) Edgy Salient points Local Binary patterns (LBPs)

来源：评论

学校读者我要写书评

暂无评论

Scale-space anisotropic total variation for limited angle tomography

arXiv

引用

arXiv 2017年

作者： Huang, Yixing Taubmann, Oliver Huang, Xiaolin Haase, Viktor Lauritsch, Guenter Maier, Andreas Pattern Recognition Lab Friedrich-Alexander-University Erlangen-Nuremberg Erlangen Germany Pattern Recognition Lab FriedrichAlexander-University Erlangen-Nuremberg Erlangen Germany Erlangen Germany Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China Siemens Healthcare GmbH Forchheim Germany Department of Radiology University of Utah Salt Lake CityUT United States

This paper addresses streak reduction in limited angle tomography. Although the iterative reweighted total variation (wTV) algorithm reduces small streaks well, it is rather inept at eliminating large ones since total variation (TV) regularization is scale-dependent and may regard these streaks as homogeneous areas. Hence, the main purpose of this paper is to reduce streak artifacts at various scales. We propose the scale-space anisotropic total variation (ssaTV) algorithm in two different implementations. The first implementation (ssaTV-1) utilizes an anisotropic gradient-like operator which uses 2 · s neighboring pixels along the streaks' normal direction at each scale s. The second implementation (ssaTV-2) makes use of anisotropic down-sampling and up-sampling operations, similarly oriented along the streaks' normal direction, to apply TV regularization at various scales. Experiments on numerical and clinical data demonstrate that both ssaTV algorithms reduce streak artifacts more effectively and efficiently than wTV, particularly when using multiple scales. Copyright © 2017, The Authors. All rights reserved.

关键词： Anisotropy

来源：评论

学校读者我要写书评

暂无评论

Nonconvex penalties with analytical solutions for one-bit compressive sensing

arXiv

引用

arXiv 2017年

作者： Huang, Xiaolin Yan, Ming Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University MOE Key Laboratory of System Control and Information Processing Shanghai200240 China Department of Computational Mathematics Science and Engineering Department of Mathematics Michigan State University East LansingMI48824 United States

One-bit measurements widely exist in the real world and can be used to recover sparse signals. This task is known as one-bit compressive sensing (1bit-CS). In this paper, we propose novel algorithms based on both convex and nonconvex sparsity-inducing penalties for robust 1bit-CS. We consider the dual problem, which has only one variable and provides a sufficient condition to verify whether a solution is globally optimal or not. For positive homogeneous penalties, a globally optimal solution can be obtained in two steps: a proximal operator and a normalization step. For other penalties, we solve the dual problem, and it needs to evaluate the proximal operators for many times. Then we provide fast algorithms for finding analytical solutions for three penalties: minimax concave penalty (MCP), 0norm, and sorted 1penalty. Specifically, our algorithm is more than 200 times faster than the existing algorithm for MCP. Its efficiency is comparable to the algorithm for the 1penalty in time, while its performance is much better than 1. Among these penalties, sorted 1is most robust to noise in different settings. Copyright © 2017, The Authors. All rights reserved.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

Cerebral ASL, SPECT and MRI image registration, enhancing fusion and joint analysis system

Cerebral ASL, SPECT and MRI image registration, enhancing fu...

引用

2016 IEEE Advanced Information Management,Communicates,Electronic and Automation Control Conference(IMCEC 2016)

作者： Ye Liu Yang Wang Lisheng Wang Shaoli Song Institute of Image Processing and Pattern Recognition Department of AutomationShanghai Jiao Tong University Department of Nuclear Medicine Ren Ji HospitalSchool of MedicineShanghai Jiao tong University

ISBN: (纸本)9781509001668

There is no technique to do a joint analysis of Arterial Spin Labeling(ASL),Single Photon Emission Computed Tomography(SPECT) and Magnetic Resonance Imaging(MRI) *** this paper,we propose a method to realize multimodality image registration,enhancing fusion and features calculation of 3D volume of *** mutual information registration,VTK image fusion,pseudo-color mapping,spline interpolation,3D tomographic interpolation,region growth and other algorithms,we build a joint analysis *** test results show that this system provides accurate registration function and more distinguishable images for the ***,gray average of pathological brain area is calculated as regional cerebral blood flow(r CBF),which provides the basis for clinicians to make confirmed diagnoses.

关键词： ASL SPECT MRI Registration Enhancing fusion Volume of interest Cerebral blood flow

来源：评论

学校读者我要写书评

暂无评论

CT image Based 3D Orbital Prosthesis Model Construction Method

CT Image Based 3D Orbital Prosthesis Model Construction Meth...

引用

2016 IEEE Advanced Information Management,Communicates,Electronic and Automation Control Conference(IMCEC 2016)

作者： Chunyuan Xu Shuang Li Lisheng Wang Caiwen Xiao Institute of Image Processing and Pattern Recognition Department of AutomationShanghai Jiao Tong University Department of Ophthalmology Ninth People's HospitalSchool of MedicineShanghai Jiao Tong University

ISBN: (纸本)9781509001668

To solve the clinical problem of constructing an aesthetic and appropriate orbital prosthesis model,two methods based on volume cutting and surface cutting respectively are proposed in this *** spline interpolation,region growth,triangular patch calculation,cylinder cutting and other techniques,we obtain the 3D orbital prosthesis model with a proper size and smooth ***,a visual feedback mechanism is added in the process of prosthesis construction to make the prosthesis model fit the defect part *** results show that the CT image based 3D orbital prosthesis model construction method in this paper significantly improves the clinical acceptability and effectiveness.

关键词： orbital prosthesis volume cutting surface cutting visual feedback mechanism

来源：评论

学校读者我要写书评

暂无评论

Mixed one-bit compressive sensing with application to overexposure correction for CT reconstruction

arXiv

引用

arXiv 2017年

作者： Huang, Xiaolin Xia, Yan Shi, Lei Huang, Yixing Yan, Ming Hornegger, Joachim Maier, Andreas Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China Department of Radiology Stanford University CA United States School of Mathematical Sciences Fudan University Shanghai China Pattern Recognition Lab of Friedrich-Alexander-Universität Erlangen-Nürnberg Erlangen Germany Department of Computational Mathematics Science and Engineering Michigan State University MI United States

When a measurement falls outside the quantization or measurable range, it becomes saturated and cannot be used in classical reconstruction methods. For example, in C-arm angiography systems, which provide projection radiography, fluoroscopy, digital subtraction angiography, and are widely used for medical diagnoses and interventions, the limited dynamic range of C-arm flat detectors leads to overexposure in some projections during an acquisition, such as imaging relatively thin body parts (e.g., the knee). Aiming at overexposure correction for computed tomography (CT) reconstruction, we in this paper propose a mixed one-bit compressive sensing (M1bitCS) to acquire information from both regular and saturated measurements. This method is inspired by the recent progress on one-bit compressive sensing, which deals with only sign observations. Its successful applications imply that information carried by saturated measurements is useful to improve recovery quality. For the proposed M1bit-CS model, alternating direction methods of multipliers is developed and an iterative saturation detection scheme is established. Then we evaluate M1bit-CS on one-dimensional signal recovery tasks. In some experiments, the performance of the proposed algorithms on mixed measurements is almost the same as recovery on unsaturated ones with the same amount of measurements. Finally, we apply the proposed method to overexposure correction for CT reconstruction on a phantom and a simulated clinical image. The results are promising, as the typical streaking artifacts and capping artifacts introduced by saturated projection data are effectively reduced, yielding significant error reduction compared with existing algorithms based on extrapolation. Copyright © 2017, The Authors. All rights reserved.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

Robust Face recognition via Low-rank Sparse Representation-based Classification

引用

International Journal of Automation and computing 2015年第6期12卷 579-587页

作者： Hai-Shun Du Qing-Pu Hu Dian-Feng Qiao Ioannis Pitas Institute of Image Processing and Pattern Recognition Henan University Department of Informatics Aristotle University of Thessaloniki

Face recognition has attracted great interest due to its importance in many real-world applications. In this paper,we present a novel low-rank sparse representation-based classification(LRSRC) method for robust face recognition. Given a set of test samples, LRSRC seeks the lowest-rank and sparsest representation matrix over all training samples. Since low-rank model can reveal the subspace structures of data while sparsity helps to recognize the data class, the obtained test sample representations are both representative and discriminative. Using the representation vector of a test sample, LRSRC classifies the test sample into the class which generates minimal reconstruction error. Experimental results on several face image databases show the effectiveness and robustness of LRSRC in face image recognition.

关键词： Face recognition image classification sparse repre

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：