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

Digital Holography and Three-Dimensional Imaging, DH 2021 - Part of OSA Imaging and Applied Optics Congress 2021

作者： Lahiri, Anish Klasky, Marc L. Fessler, Jeffrey A. Ravishankar, Saiprasad Dept. of Electrical and Computer Engineering University of Michigan Ann ArborMI48109 United States Los Alamos National Laboratory Los AlamosNM87545 United States Depts. of Computational Math Science and Engineering and Biomedical Engineering Michigan State University East LansingMI48824 United States

We present a novel multi-stage algorithm for CBCT reconstruction from very limited projections. Our proposed method uses 3D patch-based supervised and adversarial learning from scarce training data, combined with phys... 详细信息

ISBN: (纸本)9781557528209

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

HAUSDORFF MOMENT TRANSFORMS AND THEIR PERFORMANCE

arXiv

引用

arXiv 2022年

作者： Wang, Xinyun Haenggi, Martin Dept. of Electrical Engineering University of Notre Dame Notre DameIN46556 United States Depts. of Electrical Engineering and Applied and Computational Math. and Statistics University of Notre Dame Notre DameIN46556 United States

Various methods have been proposed to approximate a solution to the truncated Hausdorff moment problem. In this paper, we establish a method of comparison for the performance of the approximations. Three ways of producing random moment sequences are discussed and applied. Also, some of the approximations have been rewritten as linear transforms, and detailed accuracy requirements are analyzed. Our finding shows that the performances of the approximations differ significantly in their convergence, accuracy, and numerical complexity and that the decay order of the moment sequence strongly affects the accuracy requirement. © 2022, CC BY-NC-ND.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

A generative model for probabilistic label fusion of multimodal data

A generative model for probabilistic label fusion of multimo...

引用

2nd International Workshop on Multimodal Brain Image Analysis, MBIA 2012, Held in Conjunction with the 15th International Conference on Medical Image Computing and Computer Assisted Intervention, MICCAI 2012

作者： Iglesias, Juan Eugenio Sabuncu, Mert Rory Van Leemput, Koen Martinos Center for Biomedical Imaging MGH Harvard Medical School United States Department of Informatics and Mathematical Modeling DTU Denmark Depts. of Information and Computer Science and of Biomedical Engineering and Computational Science Aalto University Finland

ISBN: (纸本)9783642335297

The maturity of registration methods, in combination with the increasing processing power of computers, has made multi-atlas segmentation methods practical. The problem of merging the deformed label maps from the atlases is known as label fusion. Even though label fusion has been well studied for intramodality scenarios, it remains relatively unexplored when the nature of the target data is multimodal or when its modality is different from that of the atlases. In this paper, we review the literature on label fusion methods and also present an extension of our previously published algorithm to the general case in which the target data are multimodal. The method is based on a generative model that exploits the consistency of voxel intensities within the target scan based on the current estimate of the segmentation. Using brain MRI scans acquired with a multiecho FLASH sequence, we compare the method with majority voting, statistical-atlas-based segmentation, the popular package FreeSurfer and an adaptive local multi-atlas segmentation method. The results show that our approach produces highly accurate segmentations (Dice 86.3% across 22 brain structures of interest), outperforming the competing methods. © 2012 Springer-Verlag.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

Which parts of the face give out your identity?

Which parts of the face give out your identity?

引用

作者： Ocegueda, Omar Shah, Shishir K. Kakadiaris, Ioannis A. Computational Biomedicine Lab Depts. of Computer ScienceElec. and Comp.Engineering and Biomedical Engineering Univ. of Houston Houston TX United States

ISBN: (纸本)9781457703942

We present a Markov Random Field model for the analysis of lattices (e.g., images or 3D meshes) in terms of the discriminative information of their vertices. The proposed method provides a measure field that estimates the probability of each vertex to be discriminative or non-discriminative. As an application of the proposed framework, we present a method for the selection of compact and robust features for 3D face recognition. The resulting signature consists of 360 coefficients, based on which we are able to build a classifier yielding better recognition rates than currently reported in the literature. The main contribution of this work lies in the development of a novel framework for feature selection in scenarios in which the most discriminative information is known to be concentrated along piece-wise smooth regions of a lattice. © 2011 IEEE.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Automated extraction of nested sulcus features from human brain MRI data

Automated extraction of nested sulcus features from human br...

引用

Annual International Conference of the IEEE engineering in Medicine and Biology Society

作者： Forrest Sheng Bao Joachim Giard Jason Tourville Arno Klein F. S. Bao is with Depts. of Computer Science and Electrical Engineering Texas Tech University Lubbock Texas J. Giard is with Institute of Information and Communication Technologies Electronics and Applied Mathematics Université Catholique de Louvain Louvain Belgium J. Tourville is with Dept. of Speech Language and Hearing Sciences and Center for Computational Neuroscience and Neural Technology Boston University Boston Massachusetts A. Klein is with New York Psychiatric Institute Columbia University New York New York

ISBN: (纸本)9781424441198

Extracting objects related to a fold in the cerebral cortex ("sulcus features") from human brain magnetic resonance imaging data has applications in morphometry, landmark-based registration, and anatomical labeling. In prior work, sulcus features such as surfaces, fundi and pits have been extracted separately. Here we define and extract nested sulcus features in a hierarchical manner from a cortical surface mesh having curvature or depth values. Our experimental results show that the nested features are comparable to features extracted separately using other methods, and that they are consistent across subjects and with manual label boundaries. Our open source feature extraction software will be made freely available as part of the Mindboggle project ().

关键词： Automated extraction MRI data sulcus features

来源：评论

学校读者我要写书评

暂无评论

A shape-driven MRF model for the segmentation of organs in medical images

A shape-driven MRF model for the segmentation of organs in m...

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： D. R. Chittajallu S. K. Shah I. A. Kakadiaris Computational Biomedicine Lab Depts. of Computer Science Elec. & Comp.Engineering and Biomedical Engineering University of Houston Houston TX USA

In this paper, we present a knowledge-driven Markov Random Field (MRF) model for the segmentation of organs in medical images with particular emphasis on the incorporation of shape constraints into the segmentation problem. We cast the problem of image segmentation as the Maximum A Posteriori (MAP) estimation of a Markov Random Field which, in essence, is equivalent to the minimization of the corresponding Gibbs energy function. We then incorporate a set of constraints into the Gibbs energy function that collectively force the resulting segmentation contour/surface to have a shape similar to that of a given shape template. In particular, we introduce a flux-maximization constraint and a generalized template-based star-shape constraint that are encoded into the first- and second-order clique potentials of the Gibbs energy function, respectively. Our main contribution is in the translation of a set of global notions about the shape of the desired segmentation contour into a set of local measures that can be conveniently encoded into the Gibbs energy function and used in combination with other traditionally used constraints derived from image information. In our experiments, we demonstrate the application of the proposed method to the challenging problem of heart segmentation in non-contrast computed tomography (CT) data.

关键词： Image segmentation Biomedical imaging Markov random fields Shape measurement Computed tomography Biomedical engineering Energy measurement Heart Biomedical computing Computer science

来源：评论

学校读者我要写书评

暂无评论

Dynamic data-driven inversion for terascale simulations: Real-time identification of airborne contaminants 05

Dynamic data-driven inversion for terascale simulations: Rea...

引用

ACM/IEEE 2005 Supercomputing Conference, SC'05

作者： Akçelik, Volkan Biros, George DrǍǍescu, Andrei Hill, Judith Ghattash, Omar Van Bloemen Waanders, Bart Institute for Computational Engineering and Sciences University of Texas at Austin Austin TX United States Departments of Mechanical Engineering and Applied Mechanics and Computer and Information Science University of Pennsylvania Philadelphia PA United States Optimization and Uncertainty Estimation Department Sandia National Laboratories Albuquerque NM United States Institute for Computational Engineering and Sciences Depts. of Geological Sciences Mechanical Engineering Computer Science and Biomedical Engineering University of Texas at Austin Austin TX United States

ISBN: (纸本)1595930612

In contrast to traditional terascale simulations that have known, fixed data inputs, dynamic data-driven (DDD) applications are characterized by unknown data and informed by dynamic observations. DDD simulations give rise to inverse problems of determining unknown data from sparse observations. The main difficulty is that the optimality system is a boundary value problem in 4D space-time, even though the forward simulation is an initial value problem. We construct special-purpose parallel multigrid algorithms that exploit the spectral structure of the inverse operator. Experiments on problems of localizing airborne contaminant release from sparse observations in a regional atmospheric transport model demonstrate that 17-million-parameter inversion can be effected at a cost of just 18 forward simulations with high parallel efficiency. On 1024 Alphaserver EV68 processors, the turnaround time is just 29 minutes. Moreover, inverse problems with 135 million parameters -corresponding to 139 billion total space-time unknowns -are solved in less than 5 hours on the same number of processors. These results suggest that ultra-high resolution data-driven inversion can be carried out sufficiently rapidly for simulation-based "real-time" hazard assessment. © 2005 IEEE.

关键词： Data reduction

来源：评论

学校读者我要写书评

暂无评论

Contour-based correspondence for stereo 6th

Contour-based correspondence for stereo

引用

6th European Conference on Computer Vision, ECCV 2000

作者： Alibhai, Shamez Zucker, Steven W. Center for Computational Vision and Control Depts. of Computer Science and Electrical Engineering Yale University New HavenCT United States

ISBN: (纸本)3540676856

In stereoscopic images, the behavior of a curve in space is related to the appearance of the curve in the left and right image planes. Formally, this relationship is governed by the projective geometry induced by the stereo camera configuration and by the differential structure of the curve in the scene. We propose that the correspondence problem-matching corresponding points in the image planes-can be solved by relating the differential structure in the left and right image planes to the geometry of curves in space. Specifically, the compatibility between two pairs of corresponding points and tangents at those points is related to the local approximation of a space curve using an osculating helix. To guarantee robustness against small changes in the camera parameters, we select a specific osculating helix. A relaxation labeling network demonstrates that the compatibilities can be used to infer the appropriate correspondences in a scene. Examples on which standard approaches fail are demonstrated. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

Benchmarking stiff ode solvers for atmospheric chemistry problems--I. Implicit vs explicit

Benchmarking stiff ode solvers for atmospheric chemistry pro...

引用

Proceedings of the 1995 10th EUMAC Workshop

作者： Sandu, A. Verwer, J.G. Van Loon, M. Carmichael, G.R. Potra, F.A. Dabdub, D. Seinfeld, J.H. Prog. in Appl. Math. and Compl. Sci. University of Iowa Iowa City IA 52246 United States Ctr. for Math. and Computer Science P.O. Box 94079 1090 GB Amsterdam Netherlands Ctr. Global and Regl. Environ. Res. Dept. of Chem. and Biochem. Eng. University of Iowa Iowa City IA 52246 United States Depts. of Math. and Computer Science University of Iowa Iowa City IA 52246 United States Dept. of Mech. and Aerosp. Eng. University of California Irvine Irvine CA 92717-3975 United States Department of Chemical Engineering California Institute of Technology Pasadena CA 91125 United States

In many applications of atmospheric transport-chemistry problems, a major task is the numerical integration of the stiff systems of ordinary differential equations describing the chemical transformations. This paper presents a comprehensive numerical comparison between five dedicated explicit and four implicit solvers for a set of seven benchmark problems from actual applications. The implicit solvers use sparse matrix techniques to economize on the numerical linear algebra overhead. As a result they are often more efficient than the dedicated explicit ones, particularly when approximately two or more figures of accuracy are required. In most test cases, sparse RODAS, a Rosenbrock solver, came out as most competitive in the 1% error region. Of the dedicated explicit solvers, TWOSTEP came out as best. When less than 1% accuracy is aimed at, this solver performs very efficiently for tropospheric gas-phase problems. However, like all other dedicated explicit solvers, it cannot efficiently deal with gas-liquid phase chemistry. The results presented may constitute a guide for atmospheric modelers to select a suitable integrator based on the type and dimension of their chemical mechanism and on the desired level of accuracy. Furthermore, we would like to consider this paper an open invitation for other groups to add new representative test problems to those described here and to benchmark their numerical algorithms in our standard computational environment.

关键词： Atmospheric chemistry

来源：评论

学校读者我要写书评

暂无评论

Improved depth lower bounds for small distance connectivity

Improved depth lower bounds for small distance connectivity

引用

Annual IEEE Symposium on Foundations of Computer science

作者： P. Beame R. Impagliazzo T. Pitassi Computer Science and Engineering University of Washington Seattle WA USA Computer Science and Engineering University of California San Diego La Jolla CA USA Depts. of Math and Computer Science University of Pittsburgh Pittsburgh PA USA

We consider the problem of determining, given a graph G and specified nodes s and t, whether or not there is a path of at most k edges in G from s to t. We show that solving this problem on polynomial-size unbounded fan-in circuits, requires depth /spl Omega/(loglogk), improving on a depth lower bound of n(log*k) when k=log/sup O(1/) n. In addition we show that there is a constant c such that for k/spl les/logn, any depth d unbounded fan-in circuit for this problem requires size at least n/sup ck/spl epsiv/d/ where /spl epsiv//sub d/=/spl phi//sup -2d//3 and /spl phi/ is the golden mean. This latter result improves on an n/sup /spl Omega/(log(d+3/k)) bound where log/sup (i/) is the i-fold composition of log with itself. The key to our technique is a new form of switching lemma which combines some of the features of iteratively shortening terms due to Furst, Saxe, and Sipser (1981) and Ajtai (1983) with the kinds of switching lemma arguments introduced by Yao (1985), Hastad (1986), and Cai (1986) that have been the methods of choice for subsequent results.

关键词： Circuits Polynomials Computer science Drives computational complexity Turing machines computational modeling Matrix converters H infinity control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：