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

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

来源：评论

学校读者我要写书评

暂无评论

Dictionary learning based statistical interior reconstruction without a prior knowledge 10

Dictionary learning based statistical interior reconstructio...

引用

Developments in X-Ray Tomography X

作者： Shi, Yongyi Mou, Xuanqin Institute of Image Processing and Pattern Recognition Xi'an Jiaotong University Xi'an Shaanxi710049 China

ISBN: (纸本)9781510603257

Despite the significantly practical utilities of interior tomography, it still suffers from severe degradation of direct current (DC) shift artifact. Existing literature suggest to introducing prior information of object support (OS) constraint or the zeroth order image moment, i.e., the DC value into interior reconstruction to suppress the shift artifact, while the prior information is not always available in practice. Aimed at alleviating the artifacts without prior knowledge, in this paper, we reported an approach on the estimation of the object support which could be employed to estimate the zeroth order image moment, and hence facilitate the DC shift artifacts removal in interior reconstruction. Firstly, by assuming most of the reconstructed object consists of soft tissues that are equivalent to water, we reconstructed a virtual OS that is symmetrical about the interior region of interest (ROI) for the DC estimation. Hence the DC value can be estimated from the virtual reconstruction. Secondly, a statistical iterative reconstruction incorporated with the sparse representation in terms of learned dictionary and the constraint in terms of image DC value was adopted to solve the interior tomography. Experimental results demonstrate that the relative errors of the estimated zeroth order image moment are 4.7% and 7.6%, corresponding to the simulated data of a human thorax and the real data of a sheep lung, respectively. Reconstructed images with the constraint of the estimated DC value exhibit greatly superior image quality to that without DC value constraint. © Copyright 2016 SPIE.

关键词： image segmentation

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

Shape classification according to LBP persistence of critical points 19th

Shape classification according to LBP persistence of critica...

引用

19th IAPR International Conference on Discrete Geometry for Computer imagery, DGCI 2016

作者： Janusch, Ines Kropatsch, Walter G. Pattern Recognition and Image Processing Group Institute of Computer Graphics and Algorithms TU Wien Vienna Austria

ISBN: (纸本)9783319323596

This paper introduces a shape descriptor based on a combination of topological image analysis and texture information. Critical points of a shape’s skeleton are determined first. The shape is described according to persistence of the local topology at these critical points over a range of scales. The local topology over scale-space is derived using the local binary pattern texture operator with varying radii. To visualise the descriptor, a new type of persistence graph is defined which captures the evolution, respectively persistence, of the local topology. The presented shape descriptor may be used in shape classification or the grouping of shapes into equivalence classes. Classification experiments were conducted for a binary image dataset and the promising results are presented. Because of the use of persistence, the influence of noise or irregular shape boundaries (e.g. due to segmentation artefacts) on the result of such a classification or grouping is bounded. © Springer International Publishing Switzerland 2016.

关键词： Local binary pattern

来源：评论

学校读者我要写书评

暂无评论

Semantic channels for fast pedestrian detection

Semantic channels for fast pedestrian detection

引用

2016 IEEE Conference on Computer Vision and pattern recognition, CVPR 2016

作者： Costea, Arthur Daniel Nedevschi, Sergiu Image Processing and Pattern Recognition Research Center Technical University of Cluj-Napoca Romania

ISBN: (纸本)9781467388511

Pedestrian detection and semantic segmentation are high potential tasks for many real-time applications. However most of the top performing approaches provide state of art results at high computational costs. In this work we propose a fast solution for achieving state of art results for both pedestrian detection and semantic segmentation. As baseline for pedestrian detection we use sliding windows over cost efficient multiresolution filtered LUV+HOG channels. We use the same channels for classifying pixels into eight semantic classes. Using short range and long range multiresolution channel features we achieve more robust segmentation results compared to traditional codebook based approaches at much lower computational costs. The resulting segmentations are used as additional semantic channels in order to achieve a more powerful pedestrian detector. To also achieve fast pedestrian detection we employ a multiscale detection scheme based on a single flexible pedestrian model and a single image scale. The proposed solution provides competitive results on both pedestrian detection and semantic segmentation benchmarks at 8 FPS on CPU and at 15 FPS on GPU, being the fastest top performing approach.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Effective Method for Modeling Two-dimensional Sky Background of LAMOST

引用

Proceedings of the International Astronomical Union 2017年第S325期12卷 63-66页

作者： Hasitieer Haerken Fuqing Duan Jiannan Zhang Ping Guo Image Processing and Pattern Recognition Laboratory Beijing Normal University 100875 Beijing China email: fqduan@bnu.edu.cnpguo@*** National Astronomical Observatories & Chinese Academy of Sciences 100012 Beijing China email: hastear@***jnzhang@***

Each CCD of LAMOST accommodates 250 spectra, while about 40 are used to observe sky background during real observations. How to estimate the unknown sky background information hidden in the observed 210 celestial spectra by using the known 40 sky spectra is the problem we solve. In order to model the sky background, usually a pre-observation is performed with all fibers observing sky background. We use the observed 250 skylight spectra as training data, where those observed by the 40 fibers are considered as a base vector set. The Locality-constrained Linear Coding (LLC) technique is utilized to represent the skylight spectra observed by the 210 fibers with the base vector set. We also segment each spectrum into small parts, and establish the local sky background model for each part. Experimental results validate the proposed method, and show the local model is better than the global model.

关键词： LAMOST celestial spectra sky background modeling

来源：评论

学校读者我要写书评

暂无评论

Fast KNN search for big data with set compression tree and best bin first 2

Fast KNN search for big data with set compression tree and b...

引用

2nd International Conference on Cloud Computing and Internet of Things, CCIOT 2016

作者： Chen, Zhenjie Yan, Jingqi Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Key Laboratory of Ministry of Education for System Control and Information Processing China Shanghai China

ISBN: (纸本)9781467398213

This paper proposes k nearest neighbors (kNN) search based on set compression tree (SCT) and best bin first (BBF) to deal with the problem for big data. The large compression rate by set compression tree is achieved by compressing the set of descriptors jointly instead of compressing on a per-descript or basis. So set compression tree has a good performance in kNN search at a low bit rate. At the same time, the best bin first (BBF) is a very efficient algorithm to find the approximately kNN from a large number of high dimensional feature descriptors. SCT-BBF is a novel exploration and it improves search performance in three aspects: First, SCT-BBF requires less memory footprint, which is important in big data age. Second, it increases accuracy compared traditional method like KD-Tree and original SCT. SCT-BBF can be used with other data processing methods like PCA and SIFT to perform better. Third, this paper adopts finer search to increase accuracy at a slight loss of speed. And it can extend to big data easily. © 2016 IEEE.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Multi-stage suture detection for robot assisted anastomosis based on deep learning

arXiv

引用

arXiv 2017年

作者： Hu, Yang Gu, Yun Yang, Jie Yang, Guang-Zhong Hamlyn Centre for Robotic Surgery Imperial College London SW72AZ United Kingdom School of Biomedical Engineering Institute of Image Processing & Pattern Recognition Shanghai Jiao Tong University Shanghai China

In robotic surgery, task automation and learning from demonstration combined with human supervision is an emerging trend for many new surgical robot platforms. One such task is automated anastomosis, which requires bimanual needle handling and suture detection. Due to the complexity of the surgical environment and varying patient anatomies, reliable suture detection is difficult, which is further complicated by occlusion and thread topologies. In this paper, we propose a multi-stage framework for suture thread detection based on deep learning. Fully convolutional neural networks are used to obtain the initial detection and the overlapping status of suture thread, which are later fused with the original image to learn a gradient road map of the thread. Based on the gradient road map, multiple segments of the thread are extracted and linked to form the whole thread using a curvilinear structure detector. Experiments on two different types of sutures demonstrate the accuracy of the proposed framework. Copyright © 2017, The Authors. All rights reserved.

关键词： Robotic surgery

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：