Computing Large Deformation Metric Mappings via Geodesic Flows of Diffeomorphisms

This paper examine the Euler-Lagrange equations for the solution of the large deformation diffeomorphic metric mapping problem studied in Dupuis et al. (1998) and Trouvé (1995) in which two images I ₀, I ₁ are given and connected via the diffeomorphic change of coordinates I ₀○ϕ⁻¹=I ₁ where ϕ=Φ₁ is the end point at t= 1 of curve Φ _t , t∈[0, 1] satisfying ^.Φ _t =v _t (Φ _t ), t∈ [0,1] with Φ₀=id. The variational problem takes the form

Diffeomorphisms Groups and Pattern Matching in Image Analysis

In a previous paper, it was proposed to see the deformations of a common pattern as the action of an infinite dimensional group. We show in this paper that this approac h can be applied numerically for pattern matching in image analysis of digital images. Using Lie group ideas, we construct a distance between deformations defined through a metric given the cost of infinitesimal deformations. Then we propose a numerical scheme to solve a variational problem involving this distance and leading to a sub-optimal gradient pattern matching. Its links with fluid models are established.     

Intrinsic Shape Matching by Planned Landmark Sampling

Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random‐sampling‐based techniques have been particularly successful due to their generality and efficiency. We introduce a new sampling‐based shape matching algorithm that uses a planning step to find optimized “landmark” points. These points are matched first in order to maximize the information gained and thus minimize the sampling costs. Our approach makes three main contributions: First, the new technique leads to a significant improvement in performance, which we demonstrate on a number of benchmark scenarios. Second, our technique does not require any keypoint detection. This is often a significant limitation for models that do not show sufficient surface features. Third, we examine the actual numerical degrees of freedom of the matching problem for a given piece of geometry. In contrast to previous results, our estimates take into account unprecise geodesics and potentially numerically unfavorable geometry of general topology, giving a more realistic complexity estimate.     

基于机群系统的无人机地标匹配算法的设计与实现

针对常规遗传算法易陷入局部最优的缺陷,采用分布式并行遗传算法研究了图像匹配问题,完成了一种基于机群系统的无人机地标匹配算法的设计与实现。实验结果表明,此算法具有更高的精度和速度,取得了满意的结果。     

基于大规模语料库的句法模式匹配研究

通过大量记录的正确处理实例的分析过程和结果,在句法分析时,搜寻近似实例或片段,匹配相似语言结构和分析过程,这样的句法分析体现了“语言分析依赖经验”的思想。基于这样的思想,本文提出了一种基于模式匹配的句法分析的方法,即从大规模标注语料树库中抽取出蕴含的句法模式,构建模式、子模式及其规约库,句法分析的过程转化为模式匹配和局部模式转换的过程。实验表明句法分析的各项指标都比较理想,尤其是处理效率很高,平均句耗时0.46秒(CPU为Intel双核2.8G,内存为1G)。     

一种基于特征点三维信息的自然路标提取与快速匹配方法

自然路标提取与匹配是vSLAM的基础.文中提出了一种基于特征点三维信息的自然路标提取、局部特征描述与快速匹配方法.采用双目视觉获取环境图像,提取左右目图像的特征点,并进行匹配.建立左摄像机坐标系下的每个匹配点的三维信息,提出视场约束规则对特征点进行过滤.在此基础上基于改进的MeanShift聚类算法进行自然路标提取.提出一种路标描述符,可以快速进行两个聚类的匹配.该方法可以有效提取非结构化环境中的自然路标,对机器人位姿估计精度要求较低.     

基于超像素匹配的图像协同显著性检测

为了快速有效地完成多图像的协同显著性检测,提出了一种基于超像素匹配的检测模型。首先针对一般单个超像素特征匹配效果较差的问题,提出一种基于Hausdorff距离的邻域超像素集匹配算法来进行图像间超像素的精确匹配;然后构建图像内和图像间的双层元胞自动机模型,进行多幅图像之间的显著性传播,从而有效地检测出协同显著性。在公开的测试数据集上的实验结果表明,所提算法的检测精度和检测效率优于目前的主流算法,且具有较强的鲁棒性。     

Shape Matching via Quotient Spaces

We introduce a novel method for non‐rigid shape matching, designed to address the symmetric ambiguity problem present when matching shapes with intrinsic symmetries. Unlike the majority of existing methods which try to overcome this ambiguity by sampling a set of landmark correspondences, we address this problem directly by performing shape matching in an appropriate quotient space, where the symmetry has been identified and factored out. This allows us to both simplify the shape matching problem by matching between subspaces, and to return multiple solutions with equally good dense correspondences. Remarkably, both symmetry detection and shape matching are done without establishing any landmark correspondences between either points or parts of the shapes. This allows us to avoid an expensive combinatorial search present in most intrinsic symmetry detection and shape matching methods. We compare our technique with state‐of‐the‐art methods and show that superior performance can be achieved both when the symmetry on each shape is known and when it needs to be estimated.     

仿射变形下的异源图像匹配方法

针对图像同时存在仿射变形和成像特性差异时传统方法难以快速可靠匹配图像的问题,提出仿射变形下的异源图像匹配方法.首先利用二维Moran信息准则从小图中筛选若干有效子区;然后基于梯度方向相关方法在平移空间内计算每个有效子区与大图的相似度;最后对多个子区的平移空间相似度进行变换与组合得到仿射空间图像相似度的近似描述,求解仿射空间相似度最大值得到图像匹配结果.该方法避免了多次对全图进行仿射变换和比较相似度的运算,其计算复杂度仅与传统平移空间图像匹配方法相当,远低于仿射空间图像匹配方法.实验结果表明,文中方法不仅计算速度快,同时还具有很高的匹配成功率.     

Large Deformation Diffeomorphic Metric Curve Mapping

We present a matching criterion for curves and integrate it into the large deformation diffeomorphic metric mapping (LDDMM) scheme for computing an optimal transformation between two curves embedded in Euclidean space ℝ ^d . Curves are first represented as vector-valued measures, which incorporate both location and the first order geometric structure of the curves. Then, a Hilbert space structure is imposed on the measures to build the norm for quantifying the closeness between two curves. We describe a discretized version of this, in which discrete sequences of points along the curve are represented by vector-valued functionals. This gives a convenient and practical way to define a matching functional for curves. We derive and implement the curve matching in the large deformation framework and demonstrate mapping results of curves in ℝ² and ℝ³. Behaviors of the curve mapping are discussed using 2D curves. The applications to shape classification is shown and experiments with 3D curves extracted from brain cortical surfaces are presented. J. Glaunès and A. Qiu contributed equally to this work.     

Rigidity Constraints for Large Mesh Deformation

It is a challenging problem of surface-based deformation to avoid apparent volumetric distortions around largely deformed areas. In this paper, we propose a new rigidity constraint for gradient domain mesh deformation to address this problem. Intuitively the proposed constraint can be regarded as several small cubes defined by the mesh vertices through mean value coordinates. The user interactively specifies the cubes in the regions which are prone to volumetric distortions, and the rigidity constraints ...     

基于视差点的大遮挡检测和立体匹配方法

提出一种基于视差点的方法来解决在高质量立体视差图生成过程中所出现的遮挡问题.首先证明同名核线对应的视差函数曲线可近似为一条分段直线,然后在此基础上引出视差点的概念.在视差点的结构中利用两个参数分别描述左右遮挡量,使得所提出的方法能够很好地解决遮挡问题.通过分析视差点及其邻域的灰度特性,提出一种分层假设证实和Marquardt-Levenberg(M-L)算法相结合的方法从同名核线图像中提取出候选视差点,然后采用不定期的动态规划(dynamic programming,简称DP)算法获得核线最优的视差函数.利用国际标准数据对提出的方法进行了测试,并与其他方法作比较,实验结果表明,它的匹配效果是目前核线最优方法中最好的,仅差于几种优秀的全局最优方法,但其计算复杂度要远低于全局的方法.     

Consistent Shape Matching via Coupled Optimization

We propose a new method for computing accurate point‐to‐point mappings between a pair of triangle meshes given imperfect initial correspondences. Unlike the majority of existing techniques, we optimize for a map while leveraging information from the inverse map, yielding results which are highly consistent with respect to composition of mappings. Remarkably, our method considers only a linear number of candidate points on the target shape, allowing us to work directly with high resolution meshes, and to avoid a delicate and possibly error‐prone up‐sampling procedure. Key to this dimensionality reduction is a novel candidate selection process, where the mapped points drift over the target shape, finalizing their location based on intrinsic distortion measures. Overall, we arrive at an iterative scheme where at each step we optimize for the map and its inverse by solving two relaxed Quadratic Assignment Problems using off‐the‐shelf optimization tools. We provide quantitative and qualitative comparison of our method with several existing techniques, and show that it provides a powerful matching tool when accurate and consistent correspondences are required.     

Continuous Matching via Vector Field Flow

We present a new method for non‐rigid shape matching designed to enforce continuity of the resulting correspondence. Our method is based on the recently proposed functional map representation, which allows efficient manipulation and inference but often fails to provide a continuous point‐to‐point mapping. We address this problem by exploiting the connection between the operator representation of mappings and flows of vector fields. In particular, starting from an arbitrary continuous map between two surfaces we find an optimal flow that makes the final correspondence operator as close as possible to the initial functional map. Our method also helps to address the symmetric ambiguity problem inherent in many intrinsic correspondence methods when matching symmetric shapes. We provide practical and theoretical results showing that our method can be used to obtain an orientation preserving or reversing map starting from a functional map that represents the mixture of the two. We also show how this method can be used to improve the quality of maps produced by existing shape matching methods, and compare the resulting map's continuity with results obtained by other operator‐based techniques.     

基于深度匹配的由稀疏到稠密大位移运动光流估计

针对非刚性大位移运动场景的光流计算准确性与鲁棒性问题, 提出一种基于深度匹配的由稀疏到稠密大位移运动光流估计方法. 首先利用深度匹配模型计算图像序列相邻帧的初始稀疏运动场; 其次采用网格化邻域支持优化模型筛选具有较高置信度的图像网格和匹配像素点, 获得鲁棒的稀疏运动场; 然后对稀疏运动场进行边缘保护稠密插值, 并设计全局能量泛函优化求解稠密光流场. 最后分别利用MPI-Sintel和KITTI数据库提供的测试图像集对本文方法和Classic + NL, DeepFlow, EpicFlow以及FlowNetS等变分模型、匹配策略和深度学习光流计算方法进行综合对比与分析, 实验结果表明本文方法相对于其他方法具有更高的光流计算精度, 尤其在非刚性大位移和运动遮挡区域具有更好的鲁棒性与可靠性.     

基于多重索引模型的大规模词典近似匹配算法

编辑器的拼写校正、搜索引擎的查询纠正、光学字符识别的结果检查等领域都用到词典近似匹配算法.传统单索引模式很难在高性能的前提下保证高召回率.词典越大问题越严重.提出了大规模词典近似匹配的多重索引模型,首先将背景词典根据单词长度划分为若干子词典,对各子词典按照一定策略建立unigram,bigram,trigram,quadgram中的一种或若干种索引,当查找用户模式P的近似匹配时,根据模式P检索特定N-gram索引链,从而得到候选近似匹配集合C,对C中每一个单词W,计算P与W的编辑距离即可输出P的所有最终匹配结果R.实验表明,基于多重索引模型的词典近似匹配算法能够大幅度减少候选近似匹配结果的数量,从而提高词典近似匹配的速度.     

Face Matching in Large Database by Self-Organizing Maps

A novel self-organizing map (SOM) based retrieval system is proposed for performing face matching in large database. The proposed system provides a small subset of faces that are most similar to a given query face, from which user can easily verify the matched images. The architecture of the proposed system consists of two major parts. First, the system provides a generalized integration of multiple feature-sets using multiple self-organizing maps. Multiple feature-sets are obtained from different feature extraction methods like Gabor filter, Local Autocorrelation Coefficients, etc. In this platform, multiple facial features are integrated to form a compressed feature vector without concerning scaling and length of individual feature set. Second, an SOM is trained to organize all the face images in a database through using the compressed feature vector. Using the organized map, similar faces to a query can be efficiently identified. Furthermore, the system includes a relevance feedback to enhance the face retrieval performance. The proposed method is computationally efficient. Comparative results show that the proposed approach is promising for identifying face in a given large image database.     

Shot Change Detection via Local Keypoint Matching

Shot change detection is an essential step in video content analysis. However, automatic shot change detection often suffers from high false detection rates due to camera or object movements. To solve this problem, we propose an approach based on local keypoint matching of video frames. This approach aims to detect both abrupt and gradual transitions between shots without modeling different kinds of transitions. Our experiment results show that the proposed algorithm is effective for most kinds of shot changes.