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

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

基于自适应迭代松弛的立体点对匹配鲁棒算法

图像匹配是立体视觉的重要部分,也是双目立体测量系统必须解决和最难解决的问题。为了对图像进行鲁棒性匹配,提出了一种基于自适应迭代松弛的立体点对匹配方法。该方法首先利用视差梯度约束来构造匹配支持度函数;然后通过松弛方法优化该函数来完成立体点对的匹配。由于利用了动态更新松弛匹配过程参数的方法,因此有效地降低了误匹配率和误剔除率。在此基础上还提出了对松弛过程结束后的匹配结果,再次使用视差梯度约束来进行进一步检验的策略,该策略能够以一定幅度的误剔除率提升为代价,大幅度降低了误匹配率,从而可满足许多要求严格限制误匹配率的应用。实验结果证明,该新算法是有效的,并已经用于一个双目立体测量原型系统当中。     

Matching by linear programming and successive convexification

We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. Matching is formulated as metric labeling with L₁ regularization terms, for which we propose a novel linear programming relaxation method and an efficient successive convexification implementation. The unique feature of the proposed relaxation scheme is that a much smaller set of basis labels is used to represent the original label space. This greatly reduces the size of the searching space. A successive convexification scheme solves the labeling problem in a coarse to fine manner. Importantly, the original cost function is reconvexified at each stage, in the new focus region only, and the focus region is updated so as to refine the searching result. This makes the method well-suited for large label set matching. Experiments demonstrate successful applications of the proposed matching scheme in object detection, motion estimation, and tracking     

赋权图匹配问题的一种新的松弛模型

图匹配是一个NP难(NP-hard)问题. 基于置换矩阵是非负正交矩阵这一经典结论, 提出赋权图匹配(Weighted graph matching, WGM)的双向松弛障碍规划, 理论上证明新模型的解与原模型的解是一致的. 该规划是一个二元连续规划, 它是正交矩阵上的线性优化问题, 同时也是非负矩阵上的凸二次优化问题. 故设计求解新模型的交替迭代算法, 并证明算法的局部收敛性. 数值实验表明, 在匹配精度方面, 新方法强于线性规划方法和特征值分解方法.     

一种新的基于特征点的立体匹配算法

目前,立体匹配是计算机视觉领域中最活跃的研究主题之一。为了快速并更精确的对特征点进行立体匹配,本文提出了一种新的基于特征点的立体匹配算法。该方法独立于特征点的检测算法,先以扫描线作为匹配单元,然后以鲁棒函数为匹配代价函数,最后用顺序约束对每一匹配单元的视差图进行检测与校正。实验证明,该方法的匹配精度高于传统的基于NCC(norm alized cross-correlation)的立体匹配算法,并且运行时间快,可以应用于纯软件的基于特征点的立体视觉系统中。     

Structural matching in computer vision using probabilisticrelaxation

In this paper, we develop the theory of probabilistic relaxation for matching features extracted from 2D images, derive as limiting cases the various heuristic formulae used by researchers in matching problems, and state the conditions under which they apply, We successfully apply our theory to the problem of matching and recognizing aerial road network images based on road network models and to the problem of edge matching in a stereo pair. For this purpose, each line network is represented by an attributed relational graph where each node is a straight line segment characterized by certain attributes and related with every other node via a set of binary relations     

基于几何约束及0-1规划的视频帧间线段特征匹配算法

针对线段因遮挡、断裂以及端点提取不准确等原因造成的线段特征匹配困难问题,特别是现有匹配算法在匹配过程中出现"多配多"时直接采取"最相似匹配"而导致丢失大量真实匹配的问题,提出了一种基于多重几何约束及0-1规划的线段特征匹配算法。首先,基于校正后视频帧间线段特征的空间相邻性计算线段匹配的初始候选集;然后,基于极线约束、单应矩阵模型约束以及点-线相邻性约束等多重几何约束,对候选集进行筛选从而剔除部分错误匹配;其次,将线段匹配问题建模为一个大规模0-1规划问题;最后,设计了一种基于分组策略的两阶段求解算法对该问题进行求解,从而实现线段特征的"一配一"精确匹配。实验结果表明,该算法与LS（Line Sigature）、LJL（Line-Junction-Line）方法相比,匹配正确率接近,但匹配线段数量分别提高了60%和11%。所提算法可以实现视频帧间的线段特征匹配,为基于线特征的视觉SLAM（Simultaneously Localization and Mapping）奠定基础。     

考虑多编组站协调分工的枢纽重空车流组织优化

研究一类考虑多编组站协调分工的枢纽重空车流组织优化问题.基于枢纽内各编组站到达、解体、集结、编组、发车及转站能力限制,以重空车流进站走行、出站走行、转站走行、解体及集结总费用最小化为目标构建数学模型.鉴于传统算法求解大规模线性规划效率低下的缺陷,设计两阶段综合求解策略,根据到发约束组生成列车-编组站匹配方案,利用解集编约束组对匹配方案进行初次调整,再利用转站约束对匹配方案进行二次调整,从而得到列车-编组站初始匹配方案集合.在此基础上,对列车-编组站匹配方案进行编码,设置优选因子并据此从初始匹配方案集合中筛选出优选方案集,给出嵌入替换-自变异-交互更新的异步循环启发式,完成对优选方案集的群体迭代寻优.最后通过设计实验场景对模型的准确性以及所提方法的有效性进行验证.     

Graph matching by neural relaxation

We propose a new relaxation scheme for graph matching in computer vision. The main distinguishing feature of our approach is that matching is formulated as a process of eliminating unlikely candidates rather than finding the best match directly. Bayesian development leads to a robust algorithm which can be implemented in a fast and efficient manner on a neural network architecture. We illustrate the utility of the technique through comparisons with its conventional counterpart on simulated and real-world data.     

从高分辨率遥感影像中提取城市道路的新方法

在综合几种现有算法优点的基础上,提出一种新的道路提取策略。首先以角度纹理特性法分割原始影像;接着利用直线匹配原理剔除初始分割结果中的非道路地物,得到更为规则的道路条带;然后通过形态学手段获得道路中心线,并将每条中心线拆分为多段直线;结合上下文知识的马尔可夫模型被用于组织道路段的中心线,从而恢复完整道路网。实验结果表明：新方法具有良好的性能,可以从高分辨IKONOS遥感影像中提取出复杂的城市道路。     

A neural network approach to CSG-based 3-D object recognition

Describes the recognition subsystem of a computer vision system based on constructive solid geometry (CSG) representation scheme. Instead of using the conventional CSG trees to represent objects, the proposed system uses an equivalent representation scheme-precedence graphs-for object representation. Each node in the graph represents a primitive volume and each are between two nodes represents the relation between them. Object recognition is achieved by matching the scene precedence graph to the model precedence graph. A constraint satisfaction network is proposed to implement the matching process. The energy function associated with the network is used to enforce the matching constraints including match validity, primitive similarity, precedence graph preservation, and geometric structure preservation. The energy level is at its minimum only when the optimal match is reached. Experimental results on several range images are presented to demonstrate the proposed approach     

Efficient multimatch packet classification and lookup with TCAM

Today's packet classification systems are designed to provide the highest-priority matching result, such as the longest prefix match, even if a packet matches multiple classification rules. However, new network applications demanding multimatch classification - that is, requiring all matching results instead of only the highest-priority match - are emerging. Ternary content-addressable memory is becoming a common extension to network processors, and its capability and speed make it attractive for high-speed networks. The proposed TCAM-based scheme produces multimatch classification results with about 10 times fewer memory lookups than a pure software approach. In addition, their scheme for removing negation in rule sets saves up to 95 percent of the TCAM space used by a straightforward implementation.     

基于极线约束的ORB特征匹配算法

图像匹配是机器视觉领域的基础核心课题,针对当前ORB (Oriented FAST and Rotated BRIEF)图像特征匹配算法虽然执行速度快,但是匹配质量不高的问题,提出一种通过极线约束来改进ORB匹配的算法。通过合理设计Hamming阈值大小来提高初始匹配点数量,采用RANSAC和8点改进法计算基本矩阵,应用极线约束剔除误匹配保留大量优质匹配点。仿真实验结果证明,算法改进后的优质匹配点数量可达原始算法的2-3倍,同时极大地提高了匹配点的质量,证明了算法的有效性。     

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     

基于Hausdorff距离的2D形状匹配改进算法

在计算机视觉检测中,常常需要将两幅图象在空间上配准,以便进行后续的检测过程,该文提出将Ｈａｕｓｄｏｒｆｆ距离作为物体轮廓相似性的测度,并用遗传算法进行最佳形状匹配的快速搜索,根据遗传搜索的结果再进行一次线性搜索,从而提高解的精度,实验结果证明了该方法能快速,精确地对两幅２Ｄ形状进行匹配。     

A New Relaxation Procedure in the Hopfield Network for Solving Optimization Problems

When solving an optimization problem with a Hopfield network, a solution is obtained after the network is relaxed to an equilibrium state. The relaxation process is an important step in achieving a solution. In this paper, a new procedure for the relaxation process is proposed. In the new procedure, the amplified signal received by a neuron from other neurons is treated as the target value for its activation (output) value. The activation of a neuron is updated directly based on the difference between its current activation and the received target value, without using the updating of the input value as an intermediate step. A relaxation rate is applied to control the updating scale for a smooth relaxation process. The new procedure is evaluated and compared with the original procedure in the Hopfield network through simulations based on 200 randomly generated instances of the 10-city traveling salesman problem. The new procedure reduces the error rate by 34.6% and increases the percentage of valid tours by 194.6% as compared with the original procedure.     

Line segment Hausdorff distance on face matching

A novel concept of line segment Hausdorff distance is proposed in this paper. Researchers apply Hausdorff distance to measure the similarity of two point sets. It is extended here to match two sets of line segments. The new approach has the advantage to incorporate structural and spatial information to compute the similarity. The added information can conceptually provide more and better distinctive capability for recognition. This would strengthen and enhance the matching process of similar objects such as faces. The proposed technique has been applied online segments generated from the edge maps of faces with encouraging result that supports the concept experimentally. The results also implicate that line segments could provide sufficient information for face recognition. This might imply a new way for face coding and recognition.     

Attributed string matching with merging for shape recognition

A new structural approach to shape recognition using attributed string matching with merging is proposed. After illustrating the disadvantages of conventional symbolic string matching using changes, deletions, and insertions, attributed strings are suggested for matching. Each attributed string is an ordered sequence of shape boundary primitives, each representing a basic boundary structural unit, line segment, with two types of numerical attributes, length and direction. A new type of primitive edit operation, called merge, is then introduced, which can be used to combine and then match any number of consecutive boundary primitives in one shape with those in another. The resulting attributed string matching with merging approach is shown useful for recognizing distorted shapes. Experimental results prove the feasibility of the proposed approach for general shape recognition. Some possible extensions of the approach are also included.