基于SIFT点特征和Canny边缘特征匹配的多源遥感影像配准研究

针对多源遥感影像的配准,提出了一种结合SIFT点特征和Canny边缘特征匹配的配准算法。该算法首先采用SIF7算法提取点特征并进行影像粗配准,在获得初始仿射变换参数后,采用Canny算法提取边缘特征,并采用成本函数法进行边缘点匹配,经粗差滤除后得到有效的匹配特征点对,随之进行影像精配准。该算法结合了SIFT、算法和Canny算法的优点,解决了多源遥感影像因辐射差异和几何差异造成的难以正确配准的问题。实验结果表明,算法具有较强的鲁棒性,并取得了较好的配准精度。     

虚拟结肠镜中皱襞预匹配的结肠配准

目的 虚拟结肠镜是一种采用CT或者MRI图像重建出结肠3维结构,通过漫游虚拟结肠来检测结肠组织,一般用于早期结直肠癌筛查。结肠配准能够有效提高息肉检测的效率和精确度,但由于仰卧和俯卧位下的结肠图像形变太大,现有的配准方案中特征点的提取没有考虑到较多特殊情况,因此需要寻找一个新的配准方案完成完整的结肠配准。方法 提出了一种新的结肠图像配准方法,能够完成不同体位获取的虚拟结肠图像之间的配准。首先提取可以反映结肠结构信息的皱襞特征,用模板匹配和特征匹配方法找出两幅结肠中匹配的皱襞对。然后将匹配对的中心点作为标记点,做基于标记点的非刚性粗配准,最后将两幅图做B样条配准完成细配准。这种方法能够将结肠内部较大的形变先矫正,使得两幅图之间的形变缩小到一定范围,然后利用传统配准方法能够完成配准。结果 在5套数据中,找到能够成功匹配的皱襞区域数量占所有分割出的皱襞区域总数量的62%左右,匹配错误率为4.7%左右。完成皱襞粗配准后,结肠形变明显趋于一致,灰度值相对误差减小,最终完成了结肠配准。结论 先进行皱襞匹配再做基于匹配好的皱襞的映射关系做结肠配准,能够将存在较大形变的两套结肠匹配起来。在之后的工作中需要量化特征点选取对配准结果的影响,同时在做配准评估时,单纯采用灰度差值不能很好完成评估,因为灰度特征只能一定程度反映整体差异,不能很好体现结构差异,需要添加其他评估标准辅助配准评估。     

Extraction of Dominant Extremal Structures in Volumetric Data Using Separatrix Persistence

Extremal lines and surfaces are features of a 3D scalar field where the scalar function becomes minimal or maximal with respect to a local neighborhood . These features are important in many applications, e.g. computer tomography, fluid dynamics, cell biology . We present a novel topological method to extract these features using discrete Morse theory. In particular, we extend the notion of ‘separatrix persistence’ from 2D to 3D, which gives us a robust estimation of the feature strength for extremal lines and surfaces. Not only does it allow us to determine the most important (parts of) extremal lines and surfaces, it also serves as a robust filtering measure of noise‐induced structures. Our purely combinatorial method does not require derivatives or any other numerical computations .     

Extracting Sharp Features from RGB‐D Images

Sharp edges are important shape features and their extraction has been extensively studied both on point clouds and surfaces. We consider the problem of extracting sharp edges from a sparse set of colour‐and‐depth (RGB‐D) images. The noise‐ridden depth measurements are challenging for existing feature extraction methods that work solely in the geometric domain (e.g. points or meshes). By utilizing both colour and depth information, we propose a novel feature extraction method that produces much cleaner and more coherent feature lines. We make two technical contributions. First, we show that intensity edges can augment the depth map to improve normal estimation and feature localization from a single RGB‐D image. Second, we designed a novel algorithm for consolidating feature points obtained from multiple RGB‐D images. By utilizing normals and ridge/valley types associated with the feature points, our algorithm is effective in suppressing noise without smearing nearby features.     

基于改进的图像兴趣点特征提取匹配研究

研究图像兴趣点特征提取精确度优化问题。由于图像的复杂以及图像中噪声的干扰,使得传统的图像兴趣点提取算法难以提取出用户感兴趣的信息。为了解决上述问题,提出了一种改进的图像兴趣点特征提取算法。首先利用群体的兴趣点形成几何不变描述的图像区域,然后采用Hough变换方法对图像进行变换操作,使每次匹配都相当于局部的二维转变。仿真结果表明,提出的改进的算法能够有效提取出图像中有效信息,同时节约了算法的执行时间,降低了复杂度。     

Model-Based Object Recognition Using Geometric Invariants of Points and Lines

In this paper, we derive new geometric invariants for structured 3D points and lines from single image under projective transform, and we propose a novel model-based 3D object recognition algorithm using them. Based on the matrix representation of the transformation between space features (points and lines) and the corresponding projected image features, new geometric invariants are derived via the determinant ratio technique. First, an invariant for six points on two adjacent planes is derived, which is shown to be equivalent to Zhu's result [1], but in simpler formulation. Then, two new geometric invariants for structured lines are investigated: one for five lines on two adjacent planes and the other for six lines on four planes. By using the derived invariants, a novel 3D object recognition algorithm is developed, in which a hashing technique with thresholds and multiple invariants for a model are employed to overcome the over-invariant and false alarm problems. Simulation results on real images show that the derived invariants remain stable even in a noisy environment, and the proposed 3D object recognition algorithm is quite robust and accurate.     

Supine and prone colon registration using quasi-conformal mapping

In virtual colonoscopy, CT scans are typically acquired with the patient in both supine (facing up) and prone (facing down) positions. The registration of these two scans is desirable so that the user can clarify situations or confirm polyp findings at a location in one scan with the same location in the other, thereby improving polyp detection rates and reducing false positives. However, this supine-prone registration is challenging because of the substantial distortions in the colon shape due to the patient's change in position. We present an efficient algorithm and framework for performing this registration through the use of conformal geometry to guarantee that the registration is a diffeomorphism (a one-to-one and onto mapping). The taeniae coli and colon flexures are automatically extracted for each supine and prone surface, employing the colon geometry. The two colon surfaces are then divided into several segments using the flexures, and each segment is cut along a taenia coli and conformally flattened to the rectangular domain using holomorphic differentials. The mean curvature is color encoded as texture images, from which feature points are automatically detected using graph cut segmentation, mathematic morphological operations, and principal component analysis. Corresponding feature points are found between supine and prone and are used to adjust the conformal flattening to be quasi-conformal, such that the features become aligned. We present multiple methods of visualizing our results, including 2D flattened rendering, corresponding 3D endoluminal views, and rendering of distortion measurements. We demonstrate the efficiency and efficacy of our registration method by illustrating matched views on both the 2D flattened colon images and in the 3D volume rendered colon endoluminal view. We analytically evaluate the correctness of the results by measuring the distance between features on the registered colons.     

Interpolation Artefacts in Mutual Information-Based Image Registration

Image registration requires the transformation of one image to another so as to spatially align the two images. This involves interpolation to estimate gray values of one of the images at positions other than the grid points. When registering two images that have equal grid distances in one or more dimensions, the grid points can be aligned in those dimensions for certain geometric transformations. Consequently, the number of times interpolation is required to compute the registration measure of two images is dependent on the image transformation. When an entropy-based registration measure, such as mutual information, is plotted as a function of the transformation, it will show sudden changes in value for grid-aligning transformations. Such patterns of local extrema impede the registration optimization process. More importantly, they rule out subvoxel accuracy. In this paper, two frequently applied interpolation methods in mutual information-based image registration are analyzed, viz. linear interpolation and partial volume interpolation. It is shown how the registration function depends on the interpolation method and how a slight resampling of one of the images may drastically improve the smoothness of this function.     

Using implicit equations of parametric curves and surfaces without computing them: Polynomial algebra by values

The availability of the implicit equation of a plane curve or of a 3D surface can be very useful in order to solve many geometric problems involving the considered curve or surface: for example, when dealing with the point position problem or answering intersection questions. On the other hand, it is well known that in most cases, even for moderate degrees, the implicit equation is either difficult to compute or, if computed, the high degree and the big size of the coefficients makes extremely difficult its use in practice.We will show that, for several problems involving plane curves, 3D surfaces and some of their constructions (for example, offsets), it is possible to use the implicit equation (or, more precisely, its properties) without needing to explicitly determine it. We replace the computation of the implicit equation with the evaluation of the considered parameterizations in a set of points. We then translate the geometric problem in hand, into one or several generalized eigenvalue problems on matrix pencils (depending again on several evaluations of the considered parameterizations).This is the so-called “polynomial algebra by values” approach where the huge polynomial equations coming from Elimination Theory (e.g., using resultants) are replaced by big structured and sparse numerical matrices. For these matrices there are well-known numerical techniques allowing to provide the results we need to answer the geometric questions on the considered curves and surfaces.     

Extracting 3D model feature lines based on conditional random fields

We propose a 3D model feature line extraction method using templates for guidance. The 3D model is first projected into a depth map, and a set of candidate feature points are extracted. Then, a conditional random fields (CRF) model is established to match the sketch points and the candidate feature points. Using sketch strokes, the candidate feature points can then be connected to obtain the feature lines, and using a CRF-matching model, the 2D image shape similarity features and 3D model geometric features can be effectively integrated. Finally, a relational metric based on shape and topological similarity is proposed to evaluate the matching results, and an iterative matching process is applied to obtain the globally optimized model feature lines. Experimental results showed that the proposed method can extract sound 3D model feature lines which correspond to the initial sketch template.     

Clip art rendering of smooth isosurfaces

Clip art is a simplified illustration form consisting of layered filled polygons or closed curves used to convey 3D shape information in a 2D vector graphics format. This paper focuses on the problem of direct conversion of smooth surfaces, ranging from the free-form shapes of art and design to the mathematical structures of geometry and topology, into a clip art form suitable for illustration use in books, papers and presentations.We show how to represent silhouette, shadow, gleam and other surface feature curves as the intersection of implicit surfaces, and derive equations for their efficient interrogation via particle chains. We further describe how to sort, orient, identify and fill the closed regions that overlay to form clip art. We demonstrate the results with numerous renderings used to illustrate the paper itself.     

基于三维点云模型的特征线提取算法

针对以往算法存在无法区分尖锐和非尖锐特征点、提取的特征点与视角有关、特征点未连线等问题, 提出一种基于高斯映射和曲率值分析的三维点云模型尖锐特征线提取算法。该算法先进行点云数据点的离散高斯映射, 并将映射点集聚类; 然后使用自适应迭代过程得到两个或多个面的相交线上曲率值和法向量发生突变的尖锐特征点, 这些点与视角无关; 最后, 用改进的特征折线生长算法, 将特征点连接, 得到光顺特征线。实验证明, 该算法具有良好的自适应性、抗噪性和准确性, 是一种有效的三维模型特征线提取算法。     

轨道图像特征点规律分布研究

研究轨道图像特征分布规律对提高轨道图像匹配速率,实现轨道三维建模具有重要意义。由于轨道图像背景复杂,图像色彩信息单一,图像特征分布多变,因此对轨道图像特征点分布规律的研究尤为重要。本文首先对轨道图像进行分析,根据轨道图像部件几何特征及布设规律将图形划分为不同区块。运用尺度不变Harris特征点检测算法提取不同区块内图像特征点,Sift描述子对已得特征点进行特征描述并匹配。采用统计方法得出几何特征点的分布规律。试验检测1000幅轨道图像,得到轨道图像几何特征点出现频率分布规律为：挡板座区域（挡板座顶点）97.8%,螺母区域（螺母边角点）57.3%,弹条区域（弹条拐点）53.9%,钢轨轨枕交叉区域（钢轨轨枕交叉边界点）24.7%。     

基于投影图像 SURF 特征提取的三维模型配准

针对传统三维模型配准方法存在对点云初始位置有一定要求、模型配准的精度有 时不高等问题,提出了一种基于三维模型投影图像 SURF 特征提取的三维模型配准方法。首先 通过扫描三维模型数据确定投影图像的范围,判断每个投影图像像素所隶属的模型网格,并求 解从投影图像到纹理图像的映射关系,从而获取二维投影图像;然后对这两幅投影图像分别进 行 SURF 特征点的选取与特征值的计算,并按 SURF 特征值进行特征匹配,再根据投影图像像 素点与三维网格端点的映射关系计算三维特征点对;最后通过匹配的特征点对求取模型变换矩 阵完成三维模型的配准。实验结果表明,该方法在配准时间变化不大的前提下,有效提高了配 准精度,并具有较好的鲁棒性。     

Hypercatadioptric line images for 3D orientation and image rectification

In central catadioptric systems 3D lines are projected into conics. In this paper we present a new approach to extract conics in the raw catadioptric image, which correspond to projected straight lines in the scene. Using the internal calibration and two image points we are able to compute analytically these conics which we name hypercatadioptric line images. We obtain the error propagation from the image points to the 3D line projection in function of the calibration parameters. We also perform an exhaustive analysis on the elements that can affect the conic extraction accuracy. Besides that, we exploit the presence of parallel lines in man-made environments to compute the dominant vanishing points (VPs) in the omnidirectional image. In order to obtain the intersection of two of these conics we analyze the self-polar triangle common to this pair. With the information contained in the vanishing points we are able to obtain the 3D orientation of the catadioptric system. This method can be used either in a vertical stabilization system required by autonomous navigation or to rectify images required in applications where the vertical orientation of the catadioptric system is assumed. We use synthetic and real images to test the proposed method. We evaluate the 3D orientation accuracy with a ground truth given by a goniometer and with an inertial measurement unit (IMU). We also test our approach performing vertical and full rectifications in sequences of real images.     

具有SIFT描述的多尺度角点图像配准

角点含有丰富的图像结构信息,在图像配准中是广泛应用的图像特征。Harris算法是经典的角点提取算法,Harris角点对图像旋转具有不变性,但对尺度变化敏感,在有尺度变化的图像配准中,应用受限。仿照SIFT特征点提取过程,提出了一种多尺度角点提取方法,提取的多尺度角点对图像旋转和尺度变化有很好的适用性。并用SIFT描述子描述,用光学及SAR图像进行了配准实验。结果表明,与SIFT、Harris算法相比,本文方法在保证配准精度的基础上,配准时间减少40%以上,特征点在配准过程中的利用率提高一倍多。     

Fully automatic 3D feature-based registration of multi-modality medical images

In this paper, we present an automated multi-modality registration algorithm based on hierarchical feature extraction. The approach, which has not been used previously, can be divided into two distinct stages: feature extraction (edge detection, surface extraction), and geometric matching. Two kinds of corresponding features — edge and surface — are extracted hierarchically from various image modalities. The registration then is performed using least-squares matching of the automatically extracted features. Both the robustness and accuracy of feature extraction and geometric matching steps are evaluated using simulated and patient images. The preliminary results show the error is on the average of one voxel. We have shown the proposed 3D registration algorithm provides a simple and fast method for automatic registering of MR-to-CT and MR-to-PET image modalities. Our results are comparable to other techniques and require no user interaction.