期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
基于数据拓扑图的变量影响分析方法 被引量:3
1
作者 潘亚飞 牟永敏 《科学技术与工程》 北大核心 2019年第2期135-143,共9页
为了解决软件中数据变量发生异常的问题,找到该异常变量在整个程序中与其余变量之间的关系以及影响范围,提出了一种基于数据拓扑图的数据影响分析方法。研究了静态分析提取变量的依赖关系包括顺序依赖、自身依赖、节点依赖和函数依赖,... 为了解决软件中数据变量发生异常的问题,找到该异常变量在整个程序中与其余变量之间的关系以及影响范围,提出了一种基于数据拓扑图的数据影响分析方法。研究了静态分析提取变量的依赖关系包括顺序依赖、自身依赖、节点依赖和函数依赖,得到变量的依赖影响集合,生成变量的数据拓扑图。实验结果表明,该方法能全面覆盖程序中的变量并准确地生成指定变量的数据拓扑图,且数据拓扑图能够发现在程序中被异常变量影响的变量。 展开更多
关键词 数据拓扑图 依赖影响集 静态分析 顺序依赖 自身依赖 节点依赖 函数依赖
下载PDF
A new representation of orientable 2-manifold polygonal surfaces for geometric modelling
2
作者 LIU Yong-jin TANG Kai JOENJA Ajay 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2006年第9期1578-1588,共11页
Many graphics and computer-aided design applications require that the polygonal meshes used in geometric computing have the properties of not only 2-manifold but also are orientable. In this paper, by collecting previ... Many graphics and computer-aided design applications require that the polygonal meshes used in geometric computing have the properties of not only 2-manifold but also are orientable. In this paper, by collecting previous work scattered in the topology and geometry literature, we rigorously present a theoretical basis for orientable polygonal surface representation from a modem point of view. Based on the presented basis, we propose a new combinatorial data structure that can guarantee the property of orientable 2-manifolds and is primal/dual efficient. Comparisons with other widely used data structures are also presented in terms of time and space efficiency. 展开更多
关键词 Shape representation Combinatorial data structure Computational topology
下载PDF
Image feature optimization based on nonlinear dimensionality reduction 被引量:3
3
作者 Rong ZHU Min YAO 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2009年第12期1720-1737,共18页
Image feature optimization is an important means to deal with high-dimensional image data in image semantic understanding and its applications. We formulate image feature optimization as the establishment of a mapping... Image feature optimization is an important means to deal with high-dimensional image data in image semantic understanding and its applications. We formulate image feature optimization as the establishment of a mapping between highand low-dimensional space via a five-tuple model. Nonlinear dimensionality reduction based on manifold learning provides a feasible way for solving such a problem. We propose a novel globular neighborhood based locally linear embedding (GNLLE) algorithm using neighborhood update and an incremental neighbor search scheme, which not only can handle sparse datasets but also has strong anti-noise capability and good topological stability. Given that the distance measure adopted in nonlinear dimensionality reduction is usually based on pairwise similarity calculation, we also present a globular neighborhood and path clustering based locally linear embedding (GNPCLLE) algorithm based on path-based clustering. Due to its full consideration of correlations between image data, GNPCLLE can eliminate the distortion of the overall topological structure within the dataset on the manifold. Experimental results on two image sets show the effectiveness and efficiency of the proposed algorithms. 展开更多
关键词 Image feature optimization Nonlinear dimensionality reduction Manifold learning Locally linear embedding (LLE)
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部