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

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： M. Eisenmann A. Reinke V. Weru M. D. Tizabi F. Isensee T. J. Adler S. Ali V. Andrearczyk M. Aubreville U. Baid S. Bakas N. Balu S. Bano J. Bernal S. Bodenstedt A. Casella V. Cheplygina M. Daum M. De Bruijne A. Depeursinge R. Dorent J. Egger D. G. Ellis S. Engelhardt M. Ganz N. Ghatwary G. Girard P. Godau A. Gupta L. Hansen K. Harada M. Heinrich N. Heller A. Hering A. Huaulmé P. Jannin A. E. Kavur O. Kodym M. Kozubek J. Li H. Li J. Ma C. Martín-Isla B. Menze A. Noble V. Oreiller N. Padoy S. Pati K. Payette T. Rädsch J. Rafael-Patiño V. Singh Bawa S. Speidel C. H. Sudre K. Van Wijnen M. Wagner D. Wei A. Yamlahi M. H. Yap C. Yuan M. Zenk A. Zia D. Zimmerer D. Aydogan B. Bhattarai L. Bloch R. Brüngel J. Cho C. Choi Q. Dou I. Ezhov C. M. Friedrich C. Fuller R. R. Gaire A. Galdran Á. García Faura M. Grammatikopoulou S. Hong M. Jahanifar I. Jang A. Kadkhodamohammadi I. Kang F. Kofler S. Kondo H. Kuijf M. Li M. Luu T. Martinčič P. Morais M. A. Naser B. Oliveira D. Owen S. Pang J. Park S. Park S. Płotka E. Puybareau N. Rajpoot K. Ryu N. Saeed A. Shephard P. Shi D. Štepec R. Subedi G. Tochon H. R. Torres H. Urien J. L. Vilaça K. A. Wahid H. Wang J. Wang L. Wang X. Wang B. Wiestler M. Wodzinski F. Xia J. Xie Z. Xiong S. Yang Y. Yang Z. Zhao K. Maier-Hein P. F. Jäger A. Kopp-Schneider L. Maier-Hein Division of Intelligent Medical Systems German Cancer Research Center (DKFZ) Heidelberg Germany Helmholtz Imaging German Cancer Research Center (DKFZ) Heidelberg Germany Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Division of Biostatistics German Cancer Research Center (DKFZ) Heidelberg Germany Division of Medical Image Computing German Cancer Research Center (DKFZ) Heidelberg Germany Faculty of Engineering and Physical Sciences School of Computing University of Leeds Leeds UK Institute of Informatics School of Management HES-SO Valais-Wallis University of Applied Sciences and Arts Western Switzerland Sierre Switzerland Department of Nuclear Medicine and Molecular Imaging Lausanne University Hospital Lausanne Switzerland Technische Hochschule Ingolstadt Ingolstadt Germany Center for Artificial Intelligence and Data Science for Integrated Diagnostics (AI2D) and Center for Biomedical Image Computing and Analytics (CBICA) University of Pennsylvania Philadelphia PA USA Department of Pathology and Laboratory Medicine Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Department of Radiology Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Department of Radiology University of Washington Seattle WA USA Department of Computer Science Wellcome/EPSRC Centre for Interventional and Surgical Sciences (WEISS) University College London London UK Universitat Autònoma de Barcelona & Computer Vision Center Barcelona Spain Division of Translational Surgical Oncology National Center for Tumor Diseases (NCT/UCC) Dresden Dresden Germany Department of Advanced Robotics Istituto Italiano di Tecnologia Italy Department of Electronics Information and Bioengineering Politecnico di Milano Milan Italy IT University of Copenhagen Copenhagen Denmark Department of General Visceral and Transplantation Surgery Heidelberg University Hospital Heidelberg Germany Department of Radiology and Nuc

International benchmarking competitions have become fundamental for the comparative performance assessment of image analysis methods. However, little attention has been given to investigating what can be learnt from these competitions. Do they really generate scientific progress? What are common and successful participation strategies? What makes a solution superior to a competing method? To address this gap in the literature, we performed a multicenter study with all 80 competitions that were conducted in the scope of IEEE ISBI 2021 and MICCAI 2021. Statistical analyses performed based on comprehensive descriptions of the submitted algorithms linked to their rank as well as the underlying participation strategies revealed common characteristics of winning solutions. These typically include the use of multi-task learning (63%) and/or multi-stage pipelines (61%), and a focus on augmentation (100%), image preprocessing (97%), data curation (79%), and post-processing (66%). The “typical” lead of a winning team is a computer scientist with a doctoral degree, five years of experience in biomedical image analysis, and four years of experience in deep learning. Two core general development strategies stood out for highly-ranked teams: the reflection of the metrics in the method design and the focus on analyzing and handling failure cases. According to the organizers, 43% of the winning algorithms exceeded the state of the art but only 11% completely solved the respective domain problem. The insights of our study could help researchers (1) improve algorithm development strategies when approaching new problems, and (2) focus on open research questions revealed by this work.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Development of a Computer-Aided Age Determination System: Evaluation Based on Otoliths of Bank Rockfish off California

引用

Transactions of the American Fisheries Society 2011年第6期125卷 874-888页

作者： Gregor M. Cailliet L. W. Botsford John G. Brittnacher Gary Ford M. Matsubayashi Aaron King Diana L. Watters Robert G. Kope Moss Landing Marine Laboratories Post Office Box 450 Moss Landing California 95039 USA Department of Wildlife Fish and Conservation Biology University of California Davis California 95616 USA Center for Image Processing and Integrated Computing University of California Davis California 95616 USA Monterey Bay National Marine Sanctuary 299 Foam Street Suite D Monterey California 93940 USA California Department of Fish and Game 411 Burgess Drive Menlo Park California 94025 USA Department of Wildlife Fish and Conservation Biology University of California Davis USA

We have developed a computer-aided system (Bony Parts) to analyze periodic bands in fish otoliths (or other structures) for age estimation. The image analysis program first scans the image of a thin otolith section, perpendicular to the bands specified by the user. Adjacent scans are averaged and filtered with Fourier transformation or spatial domain convolution. Bands of higher density are detected and are marked and summed on the screen. We evaluated this new technique using subsamples of thin-sectioned otoliths from the bank rockfish Sebastes rufus. The time and effort for cleaning, preparation, sectioning, and mounting are the same for both traditional and computer-aided techniques. The computer-aided technique reduced the time and tedium of counting bands, yet still allowed the user to interactively make subjective decisions about aging criteria. Both approaches produced similar readings, but computer-aided estimates were more precise than traditional readings and required less analysis time. Thus, this new technique allows sample size and precision to be increased for a given amount of effort. Use of this new technique to age 1,897 sections produced von Bertalanffy growth equations that indicate female bank rockfish grow to a larger theoretical maximum size than males (L ∞ = 500.7 mm versus 438.1 mm total length) but grow at a slightly slower rate (K = 0.054 for females versus 0.073 for males).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Meshless Isosurface Generation from Multiblock Data

Meshless Isosurface Generation from Multiblock Data

引用

6th Joint Eurographics - IEEE TCVG Symposium on Visualization, VisSym 2004

作者： Co, Christopher S. Porumbescu, Serban D. Joy, Kenneth I. Center for Image Processing and Integrated Computing Department of Computer Science University of California Davis United States

ISBN: (纸本)390567307X

We propose a meshless method for the extraction of high-quality continuous isosurfaces from volumetric data represented by multiple grids, also called "multiblock"data sets. Multiblock data sets are commonplace in computational mechanics applications. Relatively little research has been performed on contouring multiblock data sets, particularly when the grids overlap one another. Our algorithm proceeds in two steps. In the first step, we determine a continuous interpolant using a set of locally defined radial basis functions (RBFs) in conjunction with a partition of unity method to blend smoothly between these functions. In the second step, we extract isosurface geometry by sampling points on Marching Cubes triangles and projecting these point samples onto the isosurface defined by our interpolant. A surface splatting algorithm is employed for visualizing the resulting point set representing the isosurface. Because of our method's generality, it inherently solves the "crack problem"in isosurface generation. Results using a set of synthetic data sets and a discussion of practical considerations are presented. The importance of our method is that it can be applied to arbitrary grid data regardless of mesh layout or orientation. © The Eurographics Association 2004.

关键词： Computational mechanics

来源：评论

学校读者我要写书评

暂无评论

Reversible n-bit to n-bit integer Haar-like transforms

Reversible n-bit to n-bit integer Haar-like transforms

引用

Data Compression Conference (DCC)

作者： J. Senecal M. Duchaineau K.I. Joy Center for Image Processing and Integrated Computing Computer Science Department University of California Davis USA Center for Applied Scientific Computing Lawrence Livemore National Laboratory USA

Methods of producing reversible n-bit to n-bit integer transforms is presented in this paper. Such methods are particularly suited for hardware-based implementations, as keeping the coefficients to n bits simplifies the design of custom hardware and makes it easier to use these approaches on preexisting hardware with limited channel width. One of our methods, called table-lookup Haar (TLHaar) is an approximation of the Haar integer wavelet transform (Haar IWT). The Haar IWT takes two integer data values A and B and using averaging and differencing produces a low-pass value L and a high-pass value H, both integers. The lookup tables are created by initializing each with an identity transform. TLHaar executes up to 44% faster. Compression results are mixed, and depend on the compression method used and the image type.

关键词： image coding Table lookup Scientific computing Hardware Laboratories image processing Computer science Wavelet transforms Equations Convergence

来源：评论

学校读者我要写书评

暂无评论

Length-limited variable-to-variable length codes for high-performance entropy coding

Length-limited variable-to-variable length codes for high-pe...

引用

Data Compression Conference (DCC)

作者： J. Senecal M. Duchaineau K.I. Joy Institute for Scientific Computing Research Lawrence Livemore National Laboratory USA Center for Image Processing and Integrated Computing Computer Science Department University of California Davis USA Center for Applied Scientific Computing Lawrence Livemore National Laboratory USA

Arithmetic coding achieves a superior coding rate when encoding a binary source, but its lack of speed makes it an inferior choice when true high-performance encoding is needed. This paper presents the practical implementation of fast entropy coders for binary messages utilizing only bit shifts and table lookups. To limit code table size the proposed code lengths is limited with a type of variable-to-variable (VV) length code created from source string merging. This is referred to as "merged codes". With merged codes it is possible to achieve a desired level of speed by adjusting the number of bits read from the source at each step. The most efficient merged codes yield a coder with a worst-case inefficiency of 0.4%, relative to the Shannon entropy. Using a hybrid Golomb-VV bin coder the compression ratio that is competitive with other state-of-the-art coders, at a superior throughput is achieved.

关键词： Entropy coding image coding Table lookup Throughput Computational modeling Scientific computing Laboratories Degradation Arithmetic image processing

来源：评论

学校读者我要写书评

暂无评论

Number Theory

引用

Journal of Mathematical Chemistry 2004年第2期36卷 167-167页

作者： Balasubramanian, K. Center for Image Processing and Integrated Computing University of California Davis Livermore USA Chemistry and Material Science Directorate Lawrence Livermore National Laboratory University of California Livermore USA Glenn T. Seaborg Center Lawrence Berkeley National Laboratory Berkeley USA

来源：评论

学校读者我要写书评

暂无评论

Improving topological segmentation of three-dimensional vector fields

Improving topological segmentation of three-dimensional vect...

引用

5th Joint Eurographics - IEEE TCVG Symposium on Visualization, VisSym 2003

作者： Mahrous, Karim M. Bennett, Janine C. Hamann, Bernd Joy, Kenneth I. Center for Image Processing and Integrated Computing Department of Computer Science University of California Davis DavisCA95616-8562 United States

ISBN: (纸本)3905673010

We present three enhancements to accelerate the extraction of separatrices of three-dimensional vector fields, using intelligently selected .sample. streamlines. These enhancements reduce the number of needed sample streamlines and their propagation length. Inflow/outflow matching supports the simultaneous extraction of topologically significant inflow and outflow separatrices in a single pass. An adaptive sampling approach is introduced and used to seed streamlines in a more meaningful and efficient manner. Cell-locking is a new concept that isolates regions of a data set that do not contain separatrices. This concept makes streamline propagation more efficient as streamlines are not propagated through cells that do not influence or contain separatrices. These enhancements enable us to perform separatrix construction for three-dimensional vector field data requiring less overall computation. © 2003 Eurographics Association. All rights reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Using graphs for fast error term approximation of time-varying datasets

Using graphs for fast error term approximation of time-varyi...

引用

5th Joint Eurographics - IEEE TCVG Symposium on Visualization, VisSym 2003

作者： Nuber, C. LaMar, E.C. Pascucci, V. Hamann, B. Joy, K.I. Center for Image Processing and Integrated Computing Department of Computer Science University of California Davis DavisCA95616-8562 United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory LivermoreCA94550-9234 United States

ISBN: (纸本)3905673010

We present a method for the efficient computation and storage of approximations of error tables used for error estimation of a region between different time steps in time-varying datasets. The error between two time steps is defined as the distance between the data of these time steps. Error tables are used to look up the error between different time steps of a time-varying dataset, especially when run time error computation is expensive. However, even the generation of error tables itself can be expensive. For n time steps, the exact error look-up table (which stores the error values for all pairs of time steps in a matrix) has a memory complexity and pre-processing time complexity of O(n2), and O(1) for error retrieval. Our approximate error look-up table approach uses trees, where the leaf nodes represent original time steps, and interior nodes contain an average (or best-representative) of the children nodes. The error computed on an edge of a tree describes the distance between the two nodes on that edge. Evaluating the error between two different time steps requires traversing a path between the two leaf nodes, and accumulating the errors on the traversed edges. For n time steps, this scheme has a memory complexity and pre-processing time complexity of O(nlog(n)), a significant improvement over the exact scheme;the error retrieval complexity is O(log(n)). As we do not need to calculate all possible n2 error terms, our approach is a fast way to generate the approximation. © 2003 Eurographics Association. All rights reserved.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

Detecting critical regions in scalar fields

Detecting critical regions in scalar fields

引用

5th Joint Eurographics - IEEE TCVG Symposium on Visualization, VisSym 2003

作者： Weber, Gunther H. Scheuermann, Gerik Hamann, Bernd Ag Graphische Datenverarbeitung und Computergeomterie Fb Informatik Universität Kaiserslautern Germany Center for Image Processing and Integrated Computing Department of Computer Science University of California Davis United States

ISBN: (纸本)3905673010

Trivariate data is commonly visualized using isosurfaces or direct volume rendering. When exploring scalar fields by isosurface extraction it is often difficult to choose isovalues that convey .useful. information. The significance of visualizations using direct volume rendering depends on the choice of good transfer functions. Understanding and using isosurface topology can help in identifying .relevant. isovalues for visualization via isosurfaces and can be used to automatically generate transfer functions. Critical isovalues indicate changes in topology of an isosurface: The creation of new surface components, merging of surface components or the formation of holes in a surface component. Interesting isosurface behavior is likely to occur at and around critical isovalues. Current approaches to detect critical isovalues are usually limited to isolated critical points. Data sets often contain regions of constant value (i.e., mesh edges, mesh faces, or entire mesh cells). We present a method that detects critical points, critical regions and corresponding critical isovalues for a scalar field defined by piecewise trilinear interpolation over a uniform rectilinear grid. We describe how to use the resulting list of critical regions/points and associated values to examine trivariate data. © 2003 Eurographics Association. All rights reserved.

关键词： Transfer functions

来源：评论

学校读者我要写书评

暂无评论

Iso-splatting: a point-based alternative to isosurface visualization

Iso-splatting: a point-based alternative to isosurface visua...

引用

Pacific Conference on Computer Graphics and Applications

作者： C.S. Co B. Hamann K.I. Joy Center for Image Processing and Integrated Computing (CIPIC) Department of Computer Science University of California USA

We present a new approach to isosurface visualization that we call "iso-splatting." We use point primitives for representing and rendering isosurfaces. The method consists of two steps. In the first step, point samples are generated throughout the volumetric domain of a scalar function. In the second step, these points are projected onto the isosurface of interest. We render the resulting point set using a surface splatting algorithm. The method can be extended to out-of-core or parallel environments. Our results show that this method can offer much greater time and space efficiency when compared with standard triangle-based methods, thereby supporting higher levels of interactivity. Parts of the algorithm can be accelerated using graphics hardware. One key advantage of this approach is that, since extraction computations are divided into two smaller phases, work can be distributed to exploit all available resources.

关键词： Isosurfaces Visualization Rendering (computer graphics) Computational geometry Fuels image processing Computer science Acceleration Graphics Hardware

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：