Fully deformable 3D digital partition model with topological control

We propose a purely discrete deformable partition model for segmenting 3D images. Its main ability is to maintain the topology of the partition during the minimization process. To do so, our main contribution is a new definition of multi-label simple points (ML simple point) that is easily computable. An ML simple point can be relabeled without modifying the overall topology of the partition. The definition is based on intervoxel properties, and uses the notion of collapse on cubical complexes. This work is an extension of a former restricted definition (Dupas et al., 2009) that prohibits the move of intersections of boundary surfaces. A deformation process is carried out with a greedy energy minimization algorithm. A discrete area estimator is used to approach at best standard regularizers classically used in continuous energy minimizing methods. We illustrate the potential of our approach with the segmentation of 3D medical images with known expected topology.     

一个基于深度图像的三维模型检索算法

三维模型检索是现在的研究热点,提出一种基于深度图像的三维模型检索算法。对三维模型进行规范化处理,采用基于正交投影的方法计算三维模型在其包围立方体的六个面上的深度图像;提取深度图像的边界方向直方图和Zernike矩特征;利用特征距离度量进行三维模型检索,并采用相关反馈技术实现权值的调整,得到用户最满意的目标检索模型。对比实验表明,该算法避免了传统视觉图像丢失三维模型空间信息的缺点,有效地提高了检索的精确性和鲁棒性。     

A multi-scale 3D Otsu thresholding algorithm for medical image segmentation

Thresholding technique is one of the most imperative practices to accomplish image segmentation. In this paper, a novel thresholding algorithm based on 3D Otsu and multi-scale image representation is proposed for medical image segmentation. Considering the high time complexity of 3D Otsu algorithm, an acceleration variant is invented using dimension decomposition rule. In order to reduce the effects of noises and weak edges, multi-scale image representation is brought into the segmentation algorithm. The whole segmentation algorithm is designed as an iteration procedure. In each iteration, the image is segmented by the efficient 3D Otsu, and then it is filtered by a fast local Laplacian filtering to get a smoothed image which will be input into the next iteration. Finally, the segmentation results are pooled to get a final segmentation using majority voting rules. The attractive features of the algorithm are that its segmentation results are stable, it is robust to noises and it holds for both bi-level and multi-level thresholding cases. Experiments on medical MR brain images are conducted to demonstrate the effectiveness of the proposed method. The experimental results indicate that the proposed algorithm is superior to the other multilevel thresholding algorithms consistently.     

一个相关反馈三维模型深度图像检索算法

基于图像的三维模型检索比形状特征和拓扑结构特征具有更易于实现且检索效果好等优点,但现有基于图像的三维模型检索方法存在一些问题,如没有考虑三维深度信息、所提特征不能全部表达三维模型信息且不能实现用户交互操作等。对此提出一种基于深度图像的三维模型相关反馈检索算法:首先提取三维模型深度图像边界方向直方图和Zernike矩特征;然后利用特征距离度量进行三维模型检索,并采用相关反馈技术实现分类器的构造和模型的标注;最后利用调整好的权值分类器进行检索和标注。实验表明,该算法实现了三维模型的相关反馈检索和标注,提高了检索的精确性,并增强了系统的实用性,为进一步进行语义检索打下基础。     

针对医学重构模型的3D分割及压缩算法

提供便捷的交互手段,从3D重构模型中精确分割感兴趣区域,为医生术前手术规划提供更为直观和准确的诊断信息。利用VTK（Visualization ToolKit）开发包构架系统平台,采用3D区域生长法分割感兴趣部位,结合数学形态法消除数据的病态关联,实现精确分割,进一步修改数据掩模完成分割后数据的压缩存储。实验证明了上述算法的有效性,可得到良好的3D分割效果。     

Topological active volumes: A topology-adaptive deformable model for volume segmentation

This paper proposes a generic methodology for segmentation and reconstruction of volumetric datasets based on a deformable model, the topological active volumes (TAV). This model, based on a polyhedral mesh, integrates features of region-based and boundary-based segmentation methods in order to fit the contours of the objects and model its inner topology. Moreover, it implements automatic procedures, the so-called topological changes, that alter the mesh structure and allow the segmentation of complex features such as pronounced curvatures or holes, as well as the detection of several objects in the scene. This work presents the TAV model and the segmentation methodology and explains how the changes in the TAV structure can improve the adjustment process. In particular, it is focused on the increase of the mesh density in complex image areas in order to improve the adjustment to object surfaces. The suitability of the mesh structure and the segmentation methodology is analyzed and the accuracy of the proposed model is proved with both synthetic and real images.     

Robust algorithm for tunnel closing in 3D volumetric objects based on topological characteristics of points

In this letter, we propose a robust, linear in time modification of Aktouf, Bertrand and Perroton’s algorithm for tunnel (3D hole) closing in 3D volumetric objects. Our algorithm is insensitive to small distortions and branches. The algorithm has been tested on various 3D images including very complicated 3D crack propagation images. The results of the tests, discussion of the algorithm properties and future research plans are also included in the paper.     

An improved algorithm for gray image representation using non-symmetry and anti-packing model with triangles and rectangles

Although the triangle non-symmetry and anti-packing model (TNAM) representation for gray images is an effective image representation method, there is still much space left for optimization. In this paper, inspired by the optimization idea of the packing problem, we proposed an improved algorithm for gray image representation using the non-symmetry and anti-packing model with triangles and rectangles (NAMTR). By comparing the representation algorithm of the NAMTR with those of the TNAM and the popular linear quadtree, theoretical and experimental results presented in this paper show that the former can greatly reduce the number of sub-patterns or nodes and simultaneously save the data storage much more effectively than the latter, and therefore it is a better method to represent gray images. Representation method of the NAMTR, as envisaged in this paper, shows a very strong promise, and it is valuable for further theoretical research and potential business foreground, such as reducing storage space, increasing transmission speed and improving pattern match efficiency.     

基于三维表面模型的任意切割算法*

通过对三维表面模型进行切割,人们可以方便地观察物体的内部结构。针对三维表面模型,提出了一种任意切割算法。任意切割过程首先是交互生成切割曲线,生成切割面;然后通过切割面对表面模型进行切割,在切割面上生成交线序列;再由交线序列与切割面边界生成封闭的边界轮廓,确定各边界轮廓间的包含关系;最后对边界轮廓包围的截面区域进行Delaunay三角剖分并着色,得到完整的剖面。实验结果证明了该算法的有效性和可行性。     

一种3维模型的网格盲水印算法

3维模型的数字水印是数字水印研究的热点之一,鲁棒性、嵌入可读性水印和盲检测是3维模型数字水印的难点所在。从增强3维模型数字水印的鲁棒性出发,提出一种基于局部几何空间的3维模型数字水印算法,它以模型三角网格顶点在其一环邻居顶点为所确定的局部几何空间;通过改变顶点在局部几何空间中的位置来嵌入水印,并以调整其间的夹角来嵌入水印序列的索引,而调整顶点与圆心的距离来嵌入较高比特的二进制数值。本文算法在水印检测时,无需原始模型,且可抵抗平移、旋转、均匀缩放、顶点乱序、剪切及网格简化等攻击。实验结果表明, 该水印算法具有很好的鲁棒性、可读水印的不可感知性和盲水印检测的优势。     

改进的矩形NAM图像表示算法

为了提高图像的表示效率,提出了一种改进的矩形非对称逆布局模式表示模型(NAM)图像编码算法IRNAM。该算法采用双矩形子模式对灰度图像进行表示,结合位平面优化策略,并顺序存储各子模式的数据,使得子模式数目大幅减少。实验结果表明：与矩形NAM算法和其他改进的NAM算法相比, IRNAM算法使表示图像的子模式数明显减少了,从而有效地节省了数据存储空间,是一种高效的图像表示方法。     

基于图像融合的微表面快速三维重构算法研究*

在分析电子探针图像多样性与相关性特征的基础上,提出先应用提升小波进行快速图像融合,以提高图像信息量,然后根据微表面图像纹理相似性,抽取出高程数据,通过顶点数组方式快速重构三维立体场景。实验表明,此方法信息量大、操作简单、场景逼真,易形成交互场景,具有较好的实际应用价值。     

一种快速有效实现三维实体重建的算法

从图的数组表示法这一基本表示方法,作为基点出发,将点、线、面、面环等信息用数组形式存储,从数组元素出发逐步实现了基于三视图的三维重建。实践表明,该方法充分利用数组形式的有序、对应、直接等特点,大大提高了三维重建的效率,减少了传统方法庞大的搜索空间和降低了时间复杂度。     

基于电场通量特征的3D模型检索方法

对基于内容的三维模型检索的应用背景和现有算法进行了研究。结合物理学的基本原理,提出了一种静电场电通量描述子,在三维模型的模拟电场中设置测试球壳,计算各个测试球壳内部的电通量,用以描述三维模型。该描述子具有平移、旋转和缩放不变的特征,并对噪声有较强的鲁棒性。实验证明该描述子具有较强的检索能力。     

FPGA-based real-time 3D image preprocessing for image-guided medical interventions

Minimally invasive image-guided interventions (IGIs) are time and cost efficient, minimize unintended damage to healthy tissue, and lead to faster patient recovery. One emerging trend in IGI workflow is to use volumetric imaging modalities such as low-dose computed tomography (CT) and 3D ultrasound to provide real-time, accurate anatomical information intraoperatively. These intraoperative images, however, are often characterized by quantum (in low-dose CT) or speckle (in ultrasound) noise and must be enhanced prior to any advanced image processing. Anisotropic diffusion filtering and median filtering have been shown to be effective in enhancing and improving the visual quality of these images. However, achieving real-time performance, as required by IGIs, using software-only implementations is challenging because of the sheer size of the images and the arithmetic complexity of the filtering operations. We present a field-programmable gate array-based reconfigurable architecture for real-time preprocessing of intraoperative 3D images. The proposed architecture provides programmable kernels for 3D anisotropic diffusion filtering and 3D median filtering within the same framework. The implementation of this architecture using an Altera Stratix-II device achieved a voxel processing rate close to 200 MHz, which enables the use of these processing techniques in the IGI workflow prior to advanced operations such as segmentation, registration, and visualization.

面向导航型网页关键词自动抽取的视觉模型与算法

导航型网页中往往包含了大量的噪声信息,为自动提取网页中的关键词带来了较大的困难。 为此,提出一个新的网页表示模型PIX-PAGE和导航型网页关键词自动抽取算法P-KEA。PIX-PAGE模型利用提出的区域合并算法,将一张网页分割为适当粒度的区域;然后,依据人类视觉特点,对各区域进行视觉“奇异性”量化,同时利用奇异性传递规则进一步强化关键词相关区域的视觉“奇异性”。P-KEA根据PIX-PAGE模型模型的视觉量化结果,能够较准确地找到视觉突出区域中的关键词。实验结果表明,与基于DocView模型的算法DVM相比,P-KEA的准确率平均提高了20.9%。     

结合图像分割和点云分割的障碍物检测算法

针对单目图像检测障碍物的低可靠性和当前双目视觉检测障碍物的局限性的问题,提出一种结合图像分割和点云分割技术的双目视觉障碍物检测方法。通过设定检测深度范围,分割障碍物点云与道路点云;采用将分割出的障碍物点云对应的视差图与图像分割得到的子图进行比较的策略,有效解决对不同深度、倾斜面和不规则障碍物检测效果差的问题。通过实验验证了在获得稀疏三维点云的情况下,该方法对障碍物的检测具有较好的鲁棒性。