A stereo vision technique using curve-segments and relaxationmatching

A multichannel feature-based stereo vision technique where curve segments are used as feature primitives in the matching process is described. The left image and the right image are filtered by using several Laplacian-of-Gaussian operators of different widths (channels). Curve segments are extracted by a tracking algorithm, and their centroids are obtained. At each channel, the generalized Hough transform of each curve segment in the left and the right image is evaluated. The epipolar constraint on the centroids of the curve segment and the channel size is used to limit the searching space in the right image. To resolve the ambiguity of the false targets (multiple matches), a relaxation technique is used where the initial scores of the node assignments are updated by the compatibility measures between the centroids of the curve segments. The node assignments with the highest score are chosen as the matching curve segments     

Stereo correspondence through feature grouping and maximal cliques

The authors propose a method for solving the stereo correspondence problem. The method consists of extracting local image structures and matching similar such structures between two images. Linear edge segments are extracted from both the left and right images. Each segment is characterized by its position and orientation in the image as well as its relationships with the nearby segments. A relational graph is thus built from each image. For each segment in one image as set of potential assignments is represented as a set of nodes in a correspondence graph. Arcs in the graph represent compatible assignments established on the basis of segment relationships. Stereo matching becomes equivalent to searching for sets of mutually compatible nodes in this graph. Sets are found by looking for maximal cliques. The maximal clique best suited to represent a stereo correspondence is selected using a benefit function. Numerous results obtained with this method are shown     

Shape segmentation using relaxation

Relaxation is applied to the segmentation of closed boundary curves of shapes. The ambiguous segmentation of the boundary is represented by a directed graph structure whose nodes represent segments, where two nodes are joined by an arc if the segments are consecutive along the boundary. A probability vector is associated with each node; each component of this vector provides an estimate of the probability that the corresponding segment is a particular part of the object. Relaxation is used to eliminate impossible sequences of parts, or reduce the probabilities of unlikely ones. In experiments involving airplane shapes, this almost always results in a drastic simplification of the graph with only good interpretations surviving. The approach is also extended to include curve linking and gap filling. A chain coded input image is broken into segments based on a measure of local curvature. Gap completions linking pairs of segments are then proposed and represented in a graph structure. A second graph, whose nodes consist of paths in the above graph, is constructed, and the nodes of the second graph are probabilistically classified as various object parts. Relaxation is then applied to increase the probability of mutually supporting classifications, and decrease the probability of unsupported decisions. A modified relaxation process using information about the size, spatial position, and orientation of the object parts yielded a high degree of disambiguation.     

Interpretation of MR images using self-organizing maps and knowledge-based expert systems

A new image segmentation system is presented to automatically segment and label brain magnetic resonance (MR) images to show normal and abnormal brain tissues using self-organizing maps (SOM) and knowledge-based expert systems. Elements of a feature vector are formed by image intensities, first-order features, texture features extracted from gray-level co-occurrence matrix and multiscale features. This feature vector is used as an input to the SOM. SOM is used to over segment images and a knowledge-based expert system is used to join and label the segments. Spatial distributions of segments extracted from the SOM are also considered as well as gray level properties. Segments are labeled as background, skull, white matter, gray matter, cerebrospinal fluid (CSF) and suspicious regions.     

一种基于角点检测的图像密集匹配算法

提出了一种鲁棒的图像自动立体匹配算法.利用Sobel算子对图像中的像素点进行检测,若是边缘点,则使用最小同值分割吸收核方法判断该点是否为角点.在两幅待匹配的图像间计算角点的梯度大小、梯度方向及灰度等的相似度,去除无法对应的角点,建立起待匹配图像中角点的对应关系,并计算基础矩阵.对基础矩阵进行迭代,去除误配点,计算出较精确的基础矩阵.由对极几何约束,采用动态规划方法,寻找左右两幅图像在对应极线上的所有像素点之间的对应,从而建立起两幅图像间像素点的密集匹配对应关系.试验结果表明,算法效果满意.     

基于光流场与水平集的运动目标检测

利用光流场信息及运动内极限约束确定运动目标区域的初始分割,提取光流大小与光流方向两个特征构成特征向量,使用K-means聚类算法获得运动目标区域,利用水平集方法对初始运动区域进行进一步分割,通过最小化定义的能量函数驱动代表运动目标的闭合曲线进行演化,曲线演化将在空间梯度较大的位置停止,从而得到运动目标的封闭边缘曲线。实验表明,该方法可有效地从图像序列中检测出完整的运动目标。     

二值图象曲线轮廓提取的新算法

从二值图象中得到曲线轮廓（简称曲线化）,在计算机辅助设计和制造（CAD/CAM）中有重要的作用,为了更有效地从二值图象中提取更高质量的曲线轮廓,提出了一种新的二值图象曲线化的算法,该算法的核心是对待拟合折线进行自动分段和对分段曲线进行三次Bezier曲线拟合,与传统的二值图象曲线化方法相比,由于它能够获得更高质量的图象边界轮廓,因而从根本上解决了点阵图象轮廓无法在线性设备（绘图仪,刻字机,数控机床等）中直接输出的问题,并避免了出现形变（锯齿效应和折线效应）的难题,经商品化刻绘软件（“文泰刻绘”）广泛使用证明,该算法具有很强的实用性,其效果和速度已接近国外同类软件的水平。     

采用极线约束与圆窗口匹配的立体视觉检测

首先建立了一般形式的双目立体视觉的极线约束方程,使其包含两个独立摄像机的所有内部参数和相对参考坐标系的外部结构参数,针对传统矩形窗口匹配存在的问题,提出了采用沿极线滑动的圆形窗口实现左右图像对应点的匹配。以灰度相关系数和Hu矩不变量作为匹配测度,完成了相交圆管（工件）的立体视觉检测,在进行灰度相关计算时采用了主轴旋转校正技术。实验结果表明：圆窗口下计算的灰度相关性和Hu矩不变量的相似测度都好于矩形窗口,对获得的工件表面三维坐标进行拟合重建与实际尺寸相比误差很小,说明文中建议的极线约束下基于圆窗口的匹配技术用于立体视觉检测是有效的。     

基于邻居信息聚合的子图同构匹配算法

图匹配在现实中被广泛运用,而子图同构匹配是其中的研究热点,具有重要的科学意义与实践价值。现有子图同构匹配算法大多基于邻居关系来构建约束条件,而忽略了节点的局部邻域信息。对此,提出了一种基于邻居信息聚合的子图同构匹配算法。首先,将图的属性和结构导入到改进的图卷积神经网络中进行特征向量的表示学习,从而得到聚合后的节点局部邻域信息;然后,根据图的标签、度等特征对匹配顺序进行优化,以提高算法的效率;最后,将得到的特征向量和优化的匹配顺序与搜索算法相结合,建立子图同构的约束满足问题（CSP）模型,并结合CSP回溯算法对模型进行求解。实验结果表明,与经典的树搜索算法和约束求解算法相比,该算法可以有效地提高子图同构的求解效率。     

An object-based image retrieval system for digital libraries

A novel approach to clustering for image segmentation and a new object-based image retrieval method are proposed. The clustering is achieved using the Fisher discriminant as an objective function. The objective function is improved by adding a spatial constraint that encourages neighboring pixels to take on the same class label. A six-dimensional feature vector is used for clustering by way of the combination of color and busyness features for each pixel. After clustering, the dominant segments in each class are chosen based on area and used to extract features for image retrieval. The color content is represented using a histogram, and Haar wavelets are used to represent the texture feature of each segment. The image retrieval is segment-based; the user can select a query segment to perform the retrieval and assign weights to the image features. The distance between two images is calculated using the distance between features of the constituent segments. Each image is ranked based on this distance with respect to the query image segment. The algorithm is applied to a pilot database of natural images and is shown to improve upon the conventional classification and retrieval methods. The proposed segmentation leads to a higher number of relevant images retrieved, 83.5% on average compared to 72.8 and 68.7% for the k-means clustering and the global retrieval methods, respectively.     

场景无关约束下的特征匹配算法

鉴于对极约束是立体图像中完全不依赖于场景的重要几何约束，因此在特征匹配中起着很重要的作用，而且由于同形映射描述了平面场景的立体图像之间的对应关系，故大量文献中利用它对平面场景的立体图像对进行特征匹配。为了提高立体图像匹配精度和速度，提出了一种改进的场景无关约束下的特征匹配算法，该算法针对用对极约束和同形映射来进行曲面场景匹配的过程中同形估计容易出现降阶的情况，通过引入区域面积检测法来避免降阶情况的发生，以改善匹配结果；同时，由于在同形矩阵估计中，通过加入基础矩阵和同形矩阵本质上的约束关系，可使得原本独立的同形约束和对极约柬关系很好地融入到匹配的整个过程中，从而快速有效地抑制了错误匹配的发生。对真实图像的实验分析证明，该改进算法具有迭代次数少、速度更快和匹配精度高的良好性能。     

多重约束条件下的LBD描述子与直线段匹配

目的 针对直线描述子匹配算法缺乏有效的几何约束,且易受弱纹理、尺度变化的影响,提出一种结合多重约束条件的LBD描述子的直线段匹配算法（LBDs）。方法 该算法以LSD算法提取的直线段作为匹配基元,利用SIFT匹配得到的同名点构建同名三角网约束确定候选直线;参考影像上以目标直线段为中心轴建立该直线段的矩形支撑域;根据目标直线段端点及其支撑域四角点在搜索影像上的核线约束建立候选直线段的对应支撑域;利用仿射变换统一目标直线段及候选直线段支撑域的大小;将直线段支撑域分解为大小相等的条形带,通过计算每个条形带的描述符得到该直线段的描述子,依次完成目标直线段与候选直线段LBD描述子的构建;分别计算目标直线段与每个候选直线段描述子向量间的欧氏距离,将满足最近邻距离比准则的候选直线段作为匹配结果;最后选取角度约束对匹配结果检核,确定同名直线。结果 实验选取网上公开的3组分别存在角度、旋转、尺度变换的近景影像对作为实验数据,采用LBDs分别对其进行直线段匹配实验,并与其他直线段匹配算法进行对比分析,实验结果表明,LBDs获取同名直线数目约为其他算法的1.061.41倍,匹配正确率也提高了2.411.6个百分点,从匹配效率上来看,LBDs更为耗时,但兼顾该算法匹配获得同名直线数目、匹配正确率及运行时间,LBDs的鲁棒性更强,匹配结果的准确性与可靠性较高。结论 结合多重约束条件构建的LBD描述子对于存在角度、旋转和尺度变化的影像进行直线匹配过程中具有稳定性。     

Uncertainty propagation and the matching of junctions as featuregroupings

The interpretation of the 3D world from image sequences requires the identification and correspondences of key features in the scene. We describe a robust algorithm for matching groupings of features related to the objects in the scene. We consider the propagation of uncertainty from the feature detection stage through the grouping stage to provide a measure of uncertainty at the matching stage. We focus upon indoor scenes and match junctions, which are groupings of line segments that meet at a single point. A model of the uncertainty in junction detection is described, and the junction uncertainty under the epipolar constraint is determined. Junction correspondence is achieved through matching of each line segment associated with the junction. A match likelihood is then derived based upon the detection uncertainties and then combined with information on junction topology to create a similarity measure. A robust matching algorithm is proposed and used to match junctions between pairs of images. The presented experimental results on real images show that the matching algorithm produces sufficiently reliable results for applications such as structure from motion     

Trinocular Stereo Using Shortest Paths and the Ordering Constraint

This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed whose nodes represent the individual pixels and whose edges are along the epipolar lines. Using the well known uniqueness and ordering constraint for pair by pair matches simultaneously, a path with the least matching cost is found using dynamic programming and the disparity filled along the path. This process is repeated iteratively until the disparity at all the pixels are filled up. To demonstrate the effectiveness of our approach, we present results from real world images and compare it with the traditional line by line stereo using dynamic programming.     

融合链接预测相似度矩阵的属性网络嵌入算法

在属性网络中,与节点相关联的属性信息有助于提升网络嵌入各种任务的性能,但网络是一种图状结构,节点不仅包含属性信息还隐含着丰富的结构信息。为了充分融合结构信息,首先通过定义节点的影响力特性、空间关系特征;然后根据链接预测领域基于相似度的定义构建相似度矩阵,将节点二元组中的关联向量映射到相似度矩阵这一关系空间中,从而保留与节点相关的结构向量信息;再基于图的拉普拉斯矩阵融合属性信息和标签特征,将上述三类信息集成到一个最优化框架中;最后,通过二阶导数求局部最大值计算投影矩阵获取节点的特征表示进行网络嵌入。实验结果表明,提出的算法能够充分利用节点二元组的邻接结构信息,相比于其他基准网络嵌入算法,本模型在节点分类任务上取得了更好的结果。     

基于图割理论和极几何约束的图像匹配算法

提出了一种基于图割理论和极几何约束的图像匹配算法。利用极几何约束对两幅待匹配图像进行矫正，使得它们的极线处在同一扫描线上，从而将二维匹配简化成一维匹配；利用基于图割的一维匹配算法获取视差数据，此时匹配中能量函数的标号是一维的，大大减少了搜索范围，并且提高了匹配的速度。     

非标定图像的最优匹配方法

该文将特征匹配和极线几何(epipolargeometry)估计有机地结合起来,给出了一种基于组合优化的非标定图像鲁棒匹配方法。通过灰度互相关计算得到初始候选匹配,然后使用该文提出的全局极线约束和局部视差约束代价函数,利用确定性退火方法同时估计匹配关系和基础矩阵。实验结果表明,此算法具有良好的鲁棒性,能够得到接近全局最优的匹配结果。     

基于自适应三角形约束的可靠影像匹配方法

针对数字摄影测量和计算机视觉中贫乏纹理影像自动匹配的可靠性问题,提出了一种基于良好匹配点三角形局部连续性约束下的影像匹配方法．该方法利用已知良好匹配点形成Delaunay三角网,在每个三角形内提取特征点进行匹配传播．由于新匹配点的实时插入,Delaunay三角网被动态细分使得局部几何约束区域的大小自动适应影像纹理特征的变化．选取实际立体像对进行实验,结果证明大大消减了错误匹配,提高了特征点匹配结果的可靠性和精度．     

Combining stationary wavelet transform and self-organizing maps for brain MR image segmentation

This study presents an image segmentation system that automatically segments and labels T1-weighted brain magnetic resonance (MR) images. The method is based on a combination of unsupervised learning algorithm of the self-organizing maps (SOM) and supervised learning vector quantization (LVQ) methods. Stationary wavelet transform (SWT) is applied to the images to obtain multiresolution information for distinguishing different tissues. Statistical information of the different tissues is extracted by applying spatial filtering to the coefficients of SWT. A multidimensional feature vector is formed by combining SWT coefficients and their statistical features. This feature vector is used as input to the SOM. SOM is used to segment images in a competitive unsupervised approach and an LVQ system is used for fine-tuning. Results are evaluated using Tanimoto similarity index and are compared with manually segmented images. Quantitative comparisons of our system with the other methods on real brain MR images using Tanimoto similarity index demonstrate that our system shows better segmentation performance for the gray matter while it gives average results for white matter.