Third IEEE Symposium on Bioinformatics and Bioengineering, 2003. Proceedings.最新文献_第6页

Hierarchical clustering of gene expression data 基因表达数据的层次聚类

Third IEEE Symposium on Bioinformatics and Bioengineering, 2003. Proceedings. Pub Date : 2003-03-10 DOI: 10.1109/BIBE.2003.1188970

Feng Luo, Kun Tang, L. Khan

引用次数: 24

Comparison of bicubic and Bezier polynomials for surface parameterization in volumetric images 体积图像表面参数化的双三次多项式和贝塞尔多项式的比较

Third IEEE Symposium on Bioinformatics and Bioengineering, 2003. Proceedings. Pub Date : 2003-03-10 DOI: 10.1109/BIBE.2003.1188935

Francis K. H. Quek, Vishwas Kulkarni, C. Kirbas

{"title":"Comparison of bicubic and Bezier polynomials for surface parameterization in volumetric images","authors":"Francis K. H. Quek, Vishwas Kulkarni, C. Kirbas","doi":"10.1109/BIBE.2003.1188935","DOIUrl":"https://doi.org/10.1109/BIBE.2003.1188935","url":null,"abstract":"Curvature-based surface features are well suited for use in multimodal medical image registration. The accuracy of such feature-based registration techniques is dependent upon the reliability of the feature computation. The computation of curvature features requires second derivative information that is best obtained from a parametric surface representation. We present a method of explicitly parameterizing surfaces from volumetric data. Surfaces are extracted, without a global thresholding, using active contour models. A Mong basis for each surface patch is estimated and used to transform the patch into local, or parametric, coordinates. Surface patches are fit to first a bicubic polynomial and second to a Bezier polynomial. The bicubic polynomial is fit in local coordinates using least squares solved by singular value decomposition. Bezier polynomial is fit using de Casteljau algorithm. We tested our method by reconstructing surfaces from the surface model and analytically computing Gaussian and mean curvatures. The model was tested on analytical and medical data and the results of both methods are compared.","PeriodicalId":178814,"journal":{"name":"Third IEEE Symposium on Bioinformatics and Bioengineering, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115731245","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Structure-targeting fast magnetic resonance imaging angiography with partial collection of the inverse space (k-space) based on the orientation of the vessel in real space 基于血管在真实空间中方向的逆空间(k空间)部分采集的结构定位快速磁共振成像血管成像

Third IEEE Symposium on Bioinformatics and Bioengineering, 2003. Proceedings. Pub Date : 2003-03-10 DOI: 10.1109/BIBE.2003.1188937

D. Gui, N. Tsekos

引用次数: 0

Filtration of string proximity search via transformation 通过变换过滤字符串邻近搜索

Third IEEE Symposium on Bioinformatics and Bioengineering, 2003. Proceedings. Pub Date : 2003-03-10 DOI: 10.1109/BIBE.2003.1188941

S. Aghili, D. Agrawal, A. E. Abbadi

引用次数: 10

A collapsing method for the efficient recovery of optimal edges in phylogenetic trees 系统发育树最优边的有效恢复方法

Third IEEE Symposium on Bioinformatics and Bioengineering, 2003. Proceedings. Pub Date : 2003-03-10 DOI: 10.1109/BIBE.2003.1188934

Mike Hu, P. Kearney, J. Badger

{"title":"A collapsing method for the efficient recovery of optimal edges in phylogenetic trees","authors":"Mike Hu, P. Kearney, J. Badger","doi":"10.1109/BIBE.2003.1188934","DOIUrl":"https://doi.org/10.1109/BIBE.2003.1188934","url":null,"abstract":"As the amount of sequencing efforts and genomic data volume continue to increase at an accelerated rate, phylogenetic analysis provides an evolutionary context for understanding and interpreting this growing set of complex data. We introduce a novel quartet based method for inferring molecular based phylogeny called hypercleaning* (HC*). The HC* method is based on the hypercleaning (HC) technique, which possesses an interesting property of recovering edges (of a phylogenetic tree) that are best supported by the witness quartet set. HC* extends HC in two regards: i) whereas HC constrains the input quartet set to be unweighted (binary valued), HC* allows any positive valued quartet scores, enabling more informative quartets to be defined. ii) HC* employs a novel collapsing technique which significantly speeds up the inference stage, making it empirically on par with quartet puzzling in terms of speed, while still guaranteeing optimal edge recovery as in HC. This paper is primarily aimed at presenting the algorithmic construction of HC*. We also report some preliminary studies on an implementation of HC* as a potentially powerful approximation scheme for maximum likelihood based inference.","PeriodicalId":178814,"journal":{"name":"Third IEEE Symposium on Bioinformatics and Bioengineering, 2003. Proceedings.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126206594","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

BioSeek: exploiting source-capability information for integrated access to multiple bioinformatics data sources BioSeek:利用源能力信息集成访问多个生物信息学数据源

Third IEEE Symposium on Bioinformatics and Bioengineering, 2003. Proceedings. Pub Date : 2002-01-28 DOI: 10.1109/BIBE.2003.1188961

Ling Liu, David J. Buttler, T. Critchlow, Wei Han, H. Paques, C. Pu, D. Rocco

{"title":"BioSeek: exploiting source-capability information for integrated access to multiple bioinformatics data sources","authors":"Ling Liu, David J. Buttler, T. Critchlow, Wei Han, H. Paques, C. Pu, D. Rocco","doi":"10.1109/BIBE.2003.1188961","DOIUrl":"https://doi.org/10.1109/BIBE.2003.1188961","url":null,"abstract":"Modern Bioinformatics data sources are widely used by molecular biologists for homology searching and new drug discovery. User-friendly and yet responsive access is one of the most desirable properties for integrated access to the rapidly growing, heterogeneous, and distributed collection of data sources. The increasing volume and diversity of digital information related to bioinformatics (such as genomes, protein sequences, protein structures, etc.) have led to a growing problem that conventional data management systems do not have, namely finding which information sources out of many candidate choices are the most relevant and most accessible to answer a given user query. We refer to this problem as the query routing problem. In this paper we introduce the notation and issues of query routing, and present a practical solution for designing a scalable query routing system based on multi-level progressive pruning strategies. The key idea is to create and maintain source capability profiles independently, and to provide algorithms that can dynamically discover relevant information sources for a given query through the smart use of source profiles. Compared to the keyword-based indexing techniques adopted in most of the search engines and software, our approach offers fine-granularity of interest matching, thus it is more powerful and effective for handling queries with complex conditions.","PeriodicalId":178814,"journal":{"name":"Third IEEE Symposium on Bioinformatics and Bioengineering, 2003. Proceedings.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128561803","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8

Unsupervised iterative segmentation and recognition of anatomic structures in medical imagery using second-order B-spline descriptors and geometric quasi-invariants 基于二阶b样条描述子和几何拟不变量的医学图像解剖结构的无监督迭代分割和识别

Third IEEE Symposium on Bioinformatics and Bioengineering, 2003. Proceedings. Pub Date : 1900-01-01 DOI: 10.1109/BIBE.2003.1188956

T.A. El Doker

{"title":"Unsupervised iterative segmentation and recognition of anatomic structures in medical imagery using second-order B-spline descriptors and geometric quasi-invariants","authors":"T.A. El Doker","doi":"10.1109/BIBE.2003.1188956","DOIUrl":"https://doi.org/10.1109/BIBE.2003.1188956","url":null,"abstract":"A geometric deformable model is presented for iterative segmentation and recognition of boundaries belonging to anatomic structures in medical imagery. The model utilizes a conventional edge detection algorithm for the extraction of potential boundaries. B-spline descriptors for the boundaries are then calculated. Next, geometric quasi-invariants of the control point sets, describing the B-splines are used to match potential boundaries with that of a prototype template stored in memory. Such a template is part of a novel second-order B-spline prototype templates library where the boundaries of anatomic structures are stored as sets of control points instead of storing the images themselves. The utilization of a control point set for segmentation and recognition reduces computational complexity and improves the accuracy and efficiency of the process. Once a match has been found, segmentation is done again with the parameters of the matching template. Utilizing these parameters minimizes noise and other unwanted features. This model does not suffer from many of the drawbacks associated with other deformable templates and snake models that are currently used, such as computational complexity, user interaction, sensitivity to initial conditions and others. Furthermore, unlike most deformable model templates, this algorithm is not limited to a few images and does not require huge storage space since control point sets are used to describe templates in the library. Experiments performed on medical images confirm the efficiency and robustness of this algorithm.","PeriodicalId":178814,"journal":{"name":"Third IEEE Symposium on Bioinformatics and Bioengineering, 2003. Proceedings.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117255202","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3