共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
线结构光三维视觉测量技术最关键的一步是提取出结构光图像中的激光条纹中心线;针对动态测量环境下激光条纹图像存在复杂背景信息、激光光强分布不均、光带各部分宽度差别大、激光条纹断裂等问题,文章研究了一种适用于动态测量环境的激光条纹中心线提取方法;首先通过图像预处理以及自适应裁剪算法提取出感兴趣区域(ROI,region of interest);其次通过改进型伽马校正(IGC,improved gamma correction)以及改进型变阈值大津阈值分割算法(IVT Ostu,improved variable threshold)分割出激光条纹区域;然后使用二维灰度重心法(TD-GBM,two-dimensional gray baryeentric method)提取激光条纹的初始中心线;最终使用二次优化算法对初始中心线进行优化,精确地提取出激光条纹中心线;实验结果表明,相比于灰度重心法、Steger法等算法,文章所提方法受背景干扰以及激光条纹质量的影响较小,能够在多种复杂情况下更精确地提取激光条纹中心线,满足准确性高、稳定性强以及实时性好的要求. 相似文献
3.
4.
中心线的提取速度是提高结肠计算机辅助检测的效率的重要因素.为此提出了一种基于生成树的中心线快速提取算法(FMST).在分析了最大生成树中心线提取算法(MST)存在大量冗余数据特点的基础上,利用边主源辅的搜索策略,保留趋于物体中心的关键点,通过消减冗余数据的方法来提高MST算法的速度.在10套已知中心线金标准的结肠仿真数据和2套结肠CT数据上的实验结果表明,FMST算法加快了MST算法的提取速度并且保持了中心线提取的准确性;在仿真数据上,FMST算法较MST算法的速度提高了80%以上,中心线重合率达到96.98%. 相似文献
5.
提出了一种冠状动脉中心线的提取方法,该方法以FastMarching(快速行进)算法为基础,首先对图像进行下采样,接着使用血管增强滤波器对图像进行滤波,然后利用FastMarching算法提取下采样图像中初始点之间的最短路径,并使用最短路径在原始图像上计算冠状动脉中心线。在公共数据集上的验证实验表明,该方法具有较好的鲁棒性和准确性。 相似文献
6.
为解决传统最小代价路径算法提取血管中心线时存在偏向血管侧壁的问题,提出一种基于点的中心线校正方法。应用最小代价路径算法初步提取中心线,然后根据血管剖面灰阶值呈高斯分布的特点对每个中心点进行校正,再利用三次B样条将离散的中心点拟合为一条连续的中心线。实验结果表明,该算法提取的中心线更靠近血管的中心处,且对噪声具有鲁棒性。此外,将该算法用于起点、终点位置的校正,则提取的中心线对用户定义点的位置不敏感。 相似文献
7.
冠脉血管中心线的提取是血管造影图像定量分析中的关键步骤。基于脊线跟踪法,提出了一种血管中心线自动提取方法。通过交互式地指定一个起始点和一个终止点,该算法能够自动获取两点间的血管中心线。实验结果表明了该方法的鲁棒性和可重复性。 相似文献
8.
9.
针对传统血管中心线提取方法计算量大、需大量人工介入操作的问题,提出一种全自动的血管中心线跟踪提取方法.首先根据血管尺度设计不同的Frobenius范数对血管进行自适应增强,并基于血管灰度分布构造多尺度微分算子以建立判别函数,从而获得种子点的初始位置和跟踪方向;然后在初始方向局部弧长范围内优化检测新的脊点与跟踪方向,以确保在有较大误差干扰的情况下依然能够获得正确的脊点位置;最后利用血管拓扑结构特征检测方法剔除伪血管中心线.实验结果证明,该方法无需人工介入即可准确地在冠脉造影图像中提取出血管中心线、方向矢量等信息,可被用于临床心血管疾病的计算机辅助诊疗过程. 相似文献
10.
在高分辨率航空或卫星图像中提取道路特征具有越来越重要的实际意义。道路与背景通常存在灰度差异,论文首先求取高斯平滑图像的偏导数,进而确定图像中的脊点,然后根据连接准则连线,再构造判别规则删除道路虚警,最后利用Canny边缘图修正道路中心线。算法还对交点区域进行了有效处理。实验证明,该方法在一定程度上能够消除树、建筑物阴影和汽车对道路提取造成的影响,提取的道路中心线比较准确,能为道路网检测的后续处理提供重要的数据支持。 相似文献
11.
R. Dorado 《Computer aided design》2009,41(12):1050-1059
The medial axis (MA) of a planar region is the locus of those maximal disks contained within its boundary. This entity has many CAD/CAM applications. Approximations based on the Voronoi diagram are efficient for linear-arc boundaries, but such constructions are more difficult if the boundary is free. This paper proposes an algorithm for free-form boundaries that uses the relation between MA and offsets. It takes the curvature information from the boundary in order to find the self-intersections of successive offset curves. These self-intersection points belong to the MA and can be interpolated to obtain an approximation in Bézier form. This method also approximates the medial axis transform by using the offset distance to each self-intersection. 相似文献
12.
The Medial Axis Transform surface, (or MAT or MS) is proving to be a useful tool for several applications and geometric reasoning tasks. However, calculation of the MAT is a time-consuming task and the benefits of the mathematical-based tool are offset by the cost of the calculation. This paper presents a method for medial surface calculation which uses subdivision to simplify the problem and hence speed up the calculation, a so-called ‘divide-and-conquer’ approach. The basis for this is a modification of the dual structure of the original object. As the calculation proceeds this structure is broken up into sub-pieces each representing a simpler sub-part of the MAT. Perhaps more importantly, this method creates a correct node decomposition of the dual structure. The paper goes on to demonstrate some applications of the results for geometric tasks, specifically offsetting and model subdivision, which are normally expensive but are simpler based on the MAT calculation results. 相似文献
13.
A new approach is presented for computing the interior medial axes of generic regions in R3 bounded by C(4)-smooth parametric B-spline surfaces. The generic structure of the 3D medial axis is a set of smooth surfaces along with a singular set consisting of edge curves, branch curves, fin points and six junction points. In this work, the medial axis singular set is first computed directly from the B-spline representation using a collection of robust higher order techniques. Medial axis surfaces are computed as a time trace of the evolving self-intersection set of the boundary under the the eikonal (grassfire) flow, where the bounding surfaces are dynamically offset along the inward normal direction. The eikonal flow results in special transition points that create, modify or annihilate evolving curve fronts of the (self-) intersection set. The transition points are explicitly identified using the B-spline representation. Evolution of the (self-) intersection set is computed by adapting a method for tracking intersection curves of two different surfaces deforming over generalized offset vector fields. The proposed algorithm accurately computes connected surfaces of the medial axis as well its singular set. This presents a complete solution along with accurate topological structure. 相似文献
14.
We present a new method for constructing G1 blending surfaces between an arbitrary number of canal surfaces. The topological relation of the canal surfaces is specified via a convex polyhedron and the design technique is based on a generalization of the medial surface transform. The resulting blend surface consists of trimmed envelopes of one- and two-parameter families of spheres. Blending the medial surface transform instead of the surface itself is shown to be a powerful and elegant approach for blend surface generation. The performance of our approach is demonstrated by several examples. 相似文献
15.
Dong-Pyoung Sheen Tae-geun Son Dae-Kwang Myung Cheolho Ryu Sang Hun Lee Kunwoo Lee Tae Jung Yeo 《Computer aided design》2010,42(8):720-730
A simplified geometric model with lower dimensionality, such as a mid-surface model, is often preferred over a detailed solid model for the analysis process, if the analysis results are not seriously impacted. In order to derive a mid-surface model from a thin-walled solid model, in this paper, we propose a novel approach called the solid deflation method. In this method, a solid model is assumed to be created by using air to inflate a shell that comprises the surface of the solid model. First, the model is simplified by the removal of any detailed features whose absence would not alter its overall shape. Next, the solid model itself can be converted into a degenerate solid model with zero thickness. Finally, a surface model is generated by splitting large faces paired in the thinned solid model, selecting one face per pair for creating a sheet model, and sewing the selected faces. Using this method, a more practical and usable mid-surface model can be very efficiently generated from a solid model because it can circumvent not only the tedious trimming and extension processes of the medial axis transformation method but also the time-consuming patch joining process of the mid-surface abstraction approach. 相似文献
16.
Dimensional Reduction of Surface Models for Analysis 总被引:1,自引:1,他引:0
This paper describes a set of procedures by which an analyst can idealise slender 2D shell structures for linear static analysis using reduced-dimensional beam finite elements. The first step is the development of the topological operations that are necessary to achieve the desired dimensionally reduced representation. Next, the automatic derivation of necessary geometric and physical properties of the reduced dimensional entities are described, together with the application of appropriate coupling constraints between dimensions. Dimensional reduction of shell models involves finding areas of the geometric model whose dimensions are such that this region may be represented in an analysis model with a 1D beam. Using the medial axis transform, geometric measures are defined for identifying such areas in the geometric model. However, topological features of the model and its medial axis were also identified as significant in the automation of dimensional reduction. The application of the medial axis transform to automatic dimensional reduction is described and example models given. 相似文献
17.
J. Mukherjee M. Aswatha Kumar P. P. Das B. N. Chatterji 《Pattern recognition letters》2002,23(14):211-1656
Medial axis transform (MAT) is well known for object representation. It is interesting to explore its use in different kinds of computations. In this paper an algorithm has been proposed for computation of normals at the boundaries of two-dimensional objects based on their MATs. In this technique, there is no requirement of linking boundary points during the computation compared to other existing techniques. The added advantage in the computation is that the computation can be restricted purely in the integer domain. 相似文献
18.
Jayanta Mukherjee M. Aswatha Kumar B. N. Chatterji P. P. Das 《Pattern recognition letters》1999,20(14):211-1544
In this paper, we present a discrete shading technique using medial axis transform (MAT) of 3D binary image data based on digital generalized octagonal distances. Our method is computationally attractive as it does not require the explicit computation of surface normals. We have compared our results with images rendered from voxel and octree representations while using analytical surface rendered images as bench marks. The quality of rendering by our method is certainly superior to those obtained from voxel and octree representations. 相似文献
19.
The medial axis transform provides an alternative representation of geometric shape that has many useful properties for analysis
modeling. Applications include decomposition of general solids into subregions for mapped meshing, identification of slender
regions for dimensional reduction and recognition of small features for suppression. To serve these purposes effectively,
it is important to be able to mesh the medial axis so that its geometry is adequately approximated. This paper describes a
general idea, which is based on equal distance criteria, for adaptive mesh refinement on the medial axis, assuming its topology
has been defined. The completed set of theories and examples for 2D planar objects and 3D solid objects is presented.
ID="A1" Correspondence and offprint requests to: C. Armstrong, The Queen's University of Belfast, Ashby Building, Stranmillis Road, Belfast, BT9 5AH. E-mail: c.armstrong@qub.ac.uk 相似文献
20.
This paper proposes an approach for extracting non-manifold mid-surfaces of thin-wall solids using the chordal axis transform
(CAT) (Prasad in CNLS Newsletter—Center for Nonlinear Studies, Los Alamos National Laboratory, vol 139, 1997). There is great
demand for extracting mid-surfaces as it is used in dimension reduction. Quadros and Shimada previously used CAT in extracting
2-manifold mid-surfaces of a particular type of thin-wall solids. The proposed approach is an extension of the previous approach
(Quadros and Shimada in 11th international meshing roundtable, 2002) in order to extract non-manifold mid-surfaces of general
thin-wall solids. The three steps involved in extracting the mid-surface of a thin-wall solid are: (1) generating a tet mesh
of a thin-wall solid without inserting interior nodes; (2) generating a raw mid-surface by smart cutting of tets; and (3)
remeshing the raw mid-surface via smart clean-up. In the proposed approach, a discrete model (i.e., a tet mesh without any
interior nodes) is used instead of working directly on a CAD model. The smart cutting of tets using CAT yields correct topology
at the non-manifold region in the raw mid-surface. As the raw mid-surface is not directly suitable for engineering purposes,
it is trimmed using a smart clean-up procedure and then remeshed. The proposed approach has been implemented using C++ in
commercial ALGOR finite element analysis software. The proposed approach is computationally efficient and has shown effective
results on industrial models. 相似文献