双目视觉下基于区域生长的三维人脸重建算法

为解决传统立体匹配算法匹配低纹理人脸图像时极易产生误匹配的问题,提出一种基于区域生长的人脸立体匹配算法。该算法利用级联回归树算法提取的人脸特征点将人脸划分为不同区域以分别限制各区域的视差搜索范围,从而避免在全局范围上查找匹配点;同时利用人脸的局部形状特性,采用局部曲面拟合的方式筛除误匹配种子点并生成大量可靠种子点用于区域生长;最后,分别在实验室环境采集的人脸图像和FRGC v2.0人脸数据库上进行定性和定量实验。实验结果表明,与传统算法相比,所提算法能够重建出更加准确的三维人脸模型。经点云配准后与人脸点云真实值的均方根误差在2 mm以内,且不同光照、姿态、表情下人脸图像的重建表明所改进的立体匹配算法具有较好的鲁棒性。     

Adaptive multi-scale segmentation of surface data using unsupervised learning of seed positions

This paper presents a method for multi-scale segmentation of surface data using scale-adaptive region growing. The proposed segmentation algorithm is initiated by an unsupervised learning of optimal seed positions through the surface attribute clustering with a two-criterion score function. The seeds are selected as consecutive local maxima of the clustering map, which is computed by an aggregation of the local isotropic contrast and local variance maps. The proposed method avoids typical segmentation errors caused by an inappropriate choice of seed points and thresholds used in the region-growing algorithm. The scale-adaptive threshold estimate is based on the image local statistics in the neighborhoods of seed points. The performance of this method was evaluated on LiDAR surface images.     

基于SUSAN的种子点生长边缘检测算法①

角点是一种特殊的边缘点,是数字图像中重要的几何特征。利用边缘点连续的特性,提出了一种基于SUSAN算法的种子点生长边缘检测算法。利用Susan算法获得图像的角点,再将获得的角点作为种子点,根据边缘点的判断准则对其进行生长,最终实现边缘检测。实验证明,设计的算法具有较高的效率和很好的抗噪声能力,是一种有效的边缘检测方法。     

基于SUSAN的种子点生长边缘检测算法①

角点是一种特殊的边缘点,是数字图像中重要的几何特征。利用边缘点连续的特性,提出了一种基于SUSAN算法的种子点生长边缘检测算法。利用Susan算法获得图像的角点,再将获得的角点作为种子点,根据边缘点的判断准则对其进行生长,最终实现边缘检测。实验证明,设计的算法具有较高的效率和很好的抗噪声能力,是一种有效的边缘检测方法。     

An adaptive semi-supervised Fuzzy GrowCut algorithm to segment masses of regions of interest of mammographic images

According to the World Health Organization, breast cancer is the most common cancer in women worldwide, becoming one of the most fatal types of cancer. Mammography image analysis is still the most effective imaging technology for breast cancer diagnosis, which is based on texture and shape analysis of mammary lesions. The GrowCut algorithm is a general-purpose segmentation method based on cellular automata, able to perform relatively accurate segmentation through the adequate selection of internal and external seed points. In this work we propose an adaptive semi-supervised version of the GrowCut algorithm, based on the modification of the automaton evolution rule by adding a Gaussian fuzzy membership function in order to model non-defined borders. In our proposal, manual selection of seed points of the suspicious lesion is changed by a semiautomatic stage, where just the internal points are selected by using a differential evolution algorithm. We evaluated our proposal using 57 lesion images obtained from MiniMIAS database. Results were compared with the semi-supervised state-of-the-art approaches BEMD, BMCS, Wavelet Analysis, LBI, Topographic Approach and MCW. Results show that our method achieves better results for circumscribed, spiculated lesions and ill-defined lesions, considering the similarity between segmentation results and ground-truth images.     

A new graph cut-based multiple active contour algorithm without initial contours and seed points

This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of multiple active contours is framed as a partitioning problem by assuming that image data are generated from a finite mixture model with unknown number of components. Then, the partitioning problem is solved within a divisive graph cut framework where multi-way minimum cuts for multiple contours are efficiently computed in a top-down way through a swap move of binary labels. A split move is integrated into the swap move within that framework to estimate the model parameters associated with regions without the use of initial contours and seed points. The number of regions is also estimated as a part of the algorithm. Experimental results of boundary and region detection of natural images are presented and analyzed with precision and recall measures to demonstrate the effectiveness of the proposed algorithm.     

基于小区域增长的MDCT图像分割*

提出了一种基于小区域增长的分割算法对人体肝脏的MDCT医学图像进行分割。先把三维人体肝脏的MDCT图像变成一系列二维图像;再对每个二维图像分配多个种子点,从每个种子点出发进行小区域增长;最后,把每个二维图像分割的结果整合成三维肝脏图像。实验结果表明了该算法的准确性和可行性。     

Segmentation of small objects in color images

A method for effective segmentation of small objects in color images is presented. It can be used jointly with region growing algorithms. Segmentation of small objects in color images is a difficult problem because their boundaries are close to each other. The proposed algorithm accurately determines the location of the boundary points of closely located small objects and finds the skeletons (seed regions) of those objects. The method makes use of conditions obtained by analyzing the change of color characteristics of the edge pixels along the direction that is orthogonal to the boundaries of adjacent objects. These conditions are generalized for the case of the well-known class of color images having misregistration artifacts. If high-quality seed regions are available, the final segmentation can be performed using one of the region growing methods. The segmentation algorithm based on the proposed method was tested using a large number of color images, and it proved to be very efficient.     

基于多尺度Harris角点SAM的医学图像配准算法

为满足医学图像配准对多分辨率,高配准率,低时耗率的高要求,提出了一种新颖的基于多尺度Harris角点方根-算术均值距离（SAM）的配准算法。该算法通过对图像进行小波多尺度积边缘检测和多尺度Harris角点检测,首先得到了估计变换参数;然后利用角点间的SAM作为相似性测度函数来获得最佳匹配点对,并通过最小二乘得到最终配准参数。实验表明,算法可实现含噪声图像以及不同分辨率的多模医学图像的配准,由于算法只对角点匹配,无须最优搜索,从而不仅大大减少了计算量,而且避免了陷入局部极值的情况。最后,通过3类实验验证了算法的可行性和鲁棒性。     

定向区域生长算法及其在血管分割中的应用

针对医学图像中微细管道结构灰度连续性差,采用常规区域生长法进行分割容易丢失末梢的问题,提出一种定向区域生长算法,可以在生长过程中跨越管道结构中的低灰度 区域。算法向图像中已生长区域外灰度最高的方向进行生长,每次将一个体素加入已生长区域,将图像转变为一颗以种子点为根结点的树,再从叶子结点进行回溯以确定感兴趣区 域。对实现算法的数据结构进行了讨论。算法可以应用于任意维的图像。对2维和3维图像的测试结果表明,相对于常规的区域生长法,算法可以分割出更多的血管分支。算法对3维 图像的运行时间为秒钟量级,可以满足临床应用的要求。     

线粒体形态学全自动定量分析方法

为快速准确地对线粒体形态进行定量分析,提出了一种基于多方向模板响应和追踪的定量方法。该方法先从原始图像中提取种子点,建立16对方向模板。通过模板响应矩阵确定准中心点处的线粒体边界及中心位置。然后从种子点出发,利用边界和中心点进行追踪,得到线粒体的个数、平均长度、平均面积等特征参数。实验结果表明:正常组和游离胆固醇过载的病变组平滑肌细胞内线粒体形态有显著性差异(P<0.05),该方法较现有半自动定量方法处理速度更快,准确率更高。     

一种用于三维重建的彩色Sift准稠密匹配算法

针对复杂光照条件下Sift算法对彩色图像匹配能力较差,基于Kubelka-Munk理论,提出了一种适用于未标定图像的准稠密立体匹配算法,有助于更精确地进行三维重建。该算法首先求出彩色图像各个像素的颜色不变量,提取彩色特征点并通过构造彩色Sift特征描述子进行初匹配,采用RANSAC鲁棒算法消除误匹配生成种子点;然后依据视差约束提出一种基于视差梯度均值自适应窗口方法,根据视差梯度均值调整搜索范围;最后采用最优先原则进行区域增长。实验证明,该算法能获得比较满意的匹配效果,是一种有效的用于三维重建的准稠密匹配算法。     

Multiseeded segmentation using fuzzy connectedness

Fuzzy connectedness has been effectively used to segment out an object in a badly corrupted image. We generalize the approach by providing a definition which is shown to always determine a simultaneous segmentation of multiple objects. For any set of seed points, the segmentation is uniquely determined by the definition. An algorithm for finding this segmentation is presented and its output is illustrated. The algorithm is fast as compared to other segmentation algorithms in current use. We also report on an evaluation of the accuracy and robustness of the algorithm based on experiments in which several users were repeatedly asked to identify the seed points for the algorithm in a number of images     

基于区域生长的多源遥感图像配准

多源遥感图像由于成像设备、所用光谱、拍摄时间等因素的不同,给配准带来极大的困难.尽管已经提出了多种匹配方法,但已有方法一般只能适用于特定的应用环境,开发出更加稳定和适用的配准算法仍然是一个极具挑战性的研究课题.提出一种基于区域生长的配准方法,首先,提取改进后的尺度不变特征,通过全局匹配确定种子点和种子区域并完成变换模型的初始化;然后,运用迭代区域生长和双向匹配策略,得到整个图像的可靠匹配点,从而实现多源遥感图像之间的配准.实验表明,该方法提取的匹配点的数量和正确率均远高于已有方法,能够对存在严重灰度差异的多源遥感图像实现高精度的配准,充分证明了该方法的鲁棒性和适用性.     

CT系列图像的三维层次化子块生长分割

准确地从CT系列图像提取感兴趣的组织是手术规划的基础,针对肝脏轮廓分割存在分割不全的问题,提出了基于三维区域生长算法的腹部CT图像分割方法。算法首先由用户选择若干个生长点,然后充分利用CT系列图像层间的相似性,提出基于子块的改进区域生长算法,实现三维的层次化子块区域生长,以更准确提取肝脏区域,其中生长准则由系统分析用户选择的生长点的邻域子块属性获得,以减少用户的干预。实验结果表明,算法能在较少的干预下快速分割出来CT系列图像中的肝脏轮廓。     

一种变形表面的三维测量方法

提出一种新的利用标定图像进行三维测量的方法。利用SIFT算法找到初始的对应点,然后根据这些点生成三维空间中的种子点,再以这些种子点为中心,向外区域增长,直到完成整个物体表面测量。在每次增长的过程中,需要计算增长的三维空间平面在两个相机上的投影之间的图像相关系数。图像相关系数较大时认为是正确的增长,否则是错误的增长。实验证明,使用该方法能够得到很好的三维测量结果。     

Image segmentation using a dynamic thresholding pyramid

An image segmentation algorithm based on multi-resolution processing is presented. The algorithm is based on applying a local clustering at each level of a linked pyramid data structure allowing seed nodes to be defined. These seed nodes are the root nodes of regions at the base of the pyramid, appearing in the multi-resolution data structure at a level appropriate to the region size. By applying a merging process followed by a classification step, accurate segmentations are obtained for both natural and synthetic images without the need for a priori knowledge. Results show that the algorithm gives accurate segmentations even in low signal to noise ratios.     

A fast mosaic method for airborne images: the new Template-Convolution Speed-Up Robust Features (TSURF) algorithm

In this paper, we present a new feature extraction algorithm termed Template-Convolution Speed-Up Robust Features (TSURF), which uses template convolution to extract points of interest based on the Speed-Up Robust Features (SURF) algorithm. Feature extraction is applied to extract corresponding characteristics in overlapping fields from adjacent images. The characteristics include area, line, and point features. As the point feature is easy to compute and is invariant to image scale, rotation, intensity, and so on, we use it to register and mosaic images widely. By filtering redundant points of interest, TSURF can greatly reduce the running time and keep the mosaic quality good during real-time mosaicking. SURF and TSURF are applied to airborne images to compare the efficiency of each algorithm in constructing a mosaic. We calculate the average coordinate error and angle error for evaluating mosaic precision. We also use the average gradient, standard deviation, and forecast root mean-square error to compare the mosaic quality of SURF with that of TSURF. The first mosaic experiment consisting of 20 groups of airborne images showed that the mosaic speed of TSURF is three times faster than that of SURF and maintains comparative mosaic accuracy. In the second experiment, a series of continuous thumbnail images were mosaicked using the SURF and TSURF algorithms fully automatically. The TSURF speed was 63.40% faster than that of SURF and the accuracy remained consistent.     

Color image segmentation based on multiobjective artificial bee colony optimization

This paper presents a new color image segmentation method based on a multiobjective optimization algorithm, named improved bee colony algorithm for multi-objective optimization (IBMO). Segmentation is posed as a clustering problem through grouping image features in this approach, which combines IBMO with seeded region growing (SRG). Since feature extraction has a crucial role for image segmentation, the presented method is firstly focused on this manner. The main features of an image: color, texture and gradient magnitudes are measured by using the local homogeneity, Gabor filter and color spaces. Then SRG utilizes the extracted feature vector to classify the pixels spatially. It starts running from centroid points called as seeds. IBMO determines the coordinates of the seed points and similarity difference of each region by optimizing a set of cluster validity indices simultaneously in order to improve the quality of segmentation. Finally, segmentation is completed by merging small and similar regions. The proposed method was applied on several natural images obtained from Berkeley segmentation database. The robustness of the proposed ideas was showed by comparison of hand-labeled and experimentally obtained segmentation results. Besides, it has been seen that the obtained segmentation results have better values than the ones obtained from fuzzy c-means which is one of the most popular methods used in image segmentation, non-dominated sorting genetic algorithm II which is a state-of-the-art algorithm, and non-dominated sorted PSO which is an adapted algorithm of PSO for multi-objective optimization.     

基于局部聚类的改进运动网格统计算法的研究

针对常用的匹配点筛选算法效率低、对具有角度和尺度变化匹配图像稳定性差等问题,提出一种基于局部聚类的改进网格运动统计特征点筛选算法。首先,通过局部区域抑制算法筛选响应强度较高且成对出现特征点作为种子点,并以种子点为聚类中心分割图像,得到最小外接矩形作为运动网格;随后把运动网格划分为3×3邻域支持估计量网格,计算运动网格在不同方向上的梯度最大值,作为运动网格的主方向;最后,把待匹配图像邻域支持估计量网格旋转至目标图像运动网格的主方向位置,借助网格运动统计算法筛选匹配。实验表明：对具有JPEG压缩变换、光照变化、模糊变换的匹配图像,所提算法匹配正确率在90%以上;对具有旋转和尺度变换图像,所提算法匹配正确率相较运动网格统计算法提高10%左右,高达40%以上;算法耗时仅为13 min,效率较高;所提算法可稳定高效地筛选正确的匹配点。