A Condition Number for Non‐Rigid Shape Matching

Despite the large amount of work devoted in recent years to the problem of non‐rigid shape matching, practical methods that can successfully be used for arbitrary pairs of shapes remain elusive. In this paper, we study the hardness of the problem of shape matching, and introduce the notion of the shape condition number, which captures the intuition that some shapes are inherently more difficult to match against than others. In particular, we make a connection between the symmetry of a given shape and the stability of any method used to match it while optimizing a given distortion measure. We analyze two commonly used classes of methods in deformable shape matching, and show that the stability of both types of techniques can be captured by the appropriate notion of a condition number. We also provide a practical way to estimate the shape condition number and show how it can be used to guide the selection of landmark correspondences between shapes. Thus we shed some light on the reasons why general shape matching remains difficult and provide a way to detect and mitigate such difficulties in practice.     

Non‐Rigid Puzzles

Shape correspondence is a fundamental problem in computer graphics and vision, with applications in various problems including animation, texture mapping, robotic vision, medical imaging, archaeology and many more. In settings where the shapes are allowed to undergo non‐rigid deformations and only partial views are available, the problem becomes very challenging. To this end, we present a non‐rigid multi‐part shape matching algorithm. We assume to be given a reference shape and its multiple parts undergoing a non‐rigid deformation. Each of these query parts can be additionally contaminated by clutter, may overlap with other parts, and there might be missing parts or redundant ones. Our method simultaneously solves for the segmentation of the reference model, and for a dense correspondence to (subsets of) the parts. Experimental results on synthetic as well as real scans demonstrate the effectiveness of our method in dealing with this challenging matching scenario.     

Non‐Rigid Registration Under Isometric Deformations

We present a robust and efficient algorithm for the pairwise non‐rigid registration of partially overlapping 3D surfaces. Our approach treats non‐rigid registration as an optimization problem and solves it by alternating between correspondence and deformation optimization. Assuming approximately isometric deformations, robust correspondences are generated using a pruning mechanism based on geodesic consistency. We iteratively learn an appropriate deformation discretization from the current set of correspondences and use it to update the correspondences in the next iteration. Our algorithm is able to register partially similar point clouds that undergo large deformations, in just a few seconds. We demonstrate the potential of our algorithm in various applications such as example based articulated segmentation, and shape interpolation.     

Global Correspondence Optimization for Non‐Rigid Registration of Depth Scans

We present a registration algorithm for pairs of deforming and partial range scans that addresses the challenges of non‐rigid registration within a single non‐linear optimization. Our algorithm simultaneously solves for correspondences between points on source and target scans, confidence weights that measure the reliability of each correspondence and identify non‐overlapping areas, and a warping field that brings the source scan into alignment with the target geometry. The optimization maximizes the region of overlap and the spatial coherence of the deformation while minimizing registration error. All optimization parameters are chosen automatically; hand‐tuning is not necessary. Our method is not restricted to part‐in‐whole matching, but addresses the general problem of partial matching, and requires no explicit prior correspondences or feature points. We evaluate the performance and robustness of our method using scan data acquired by a structured light scanner and compare our method with existing non‐rigid registration algorithms.     

Robust Adaptive Dynamic Surface Control for a Class of MIMO Nonlinear Systems with Unknown Non‐Symmetric Dead‐Zone

This paper is devoted to adaptive output tracking for a class of multi‐input multi‐output nonlinear systems with unknown non‐symmetric dead‐zone. With the aid of a matrix factorization and a similarity transformation, a robust adaptive dynamic surface control scheme is proposed and the difficulty caused by the control gain matrix and the dead‐zone is circumvented. By introducing a surface error modification and an initialization technique, we show that the performance of the tracking errors can be guaranteed. Moreover, the proposed scheme contains only one updated parameter at each design step, which significantly reduces the computational burden. It is proven that all signals of the closed‐loop system are semi‐globally uniformly bounded. Simulation results on coupled inverted double pendulums are presented to illustrate the effectiveness of the proposed scheme.     

Robust State‐and‐Disturbance Observer Design for Linear Non‐minimum‐phase Systems

When there are external disturbances acting on the system, the conventional Luenberger observer design for state estimation usually results in a biased state estimate. This paper presents a robust state and disturbance observer design that gives both accurate state and disturbance estimates in the face of large disturbances. The proposed robust observer is structurally different from the conventional one in the sense that a disturbance estimation term is included in the observer equation. With this disturbance estimation term, the robust observer design problem is skillfully transformed into a disturbance rejection control problem. We then can utilize the standard H_∞ control design tools to optimize the robust observer between the disturbance rejection ability and noise immune ability. An important advantage of the proposed robust observer is that it applies to both minimum‐phase systems and non‐minimum phase systems.     

An Efficient Approach to Correspondences between Multiple Non‐Rigid Parts

Identifying multiple deformable parts on meshes and establishing dense correspondences between them are tasks of fundamental importance to computer graphics, with applications to e.g. geometric edit propagation and texture transfer. Much research has considered establishing correspondences between non‐rigid surfaces, but little work can both identify similar multiple deformable parts and handle partial shape correspondences. This paper addresses two related problems, treating them as a whole: (i) identifying similar deformable parts on a mesh, related by a non‐rigid transformation to a given query part, and (ii) establishing dense point correspondences automatically between such parts. We show that simple and efficient techniques can be developed if we make the assumption that these parts locally undergo isometric deformation. Our insight is that similar deformable parts are suggested by large clusters of point correspondences that are isometrically consistent. Once such parts are identified, dense point correspondences can be obtained by an iterative propagation process. Our techniques are applicable to models with arbitrary topology. Various examples demonstrate the effectiveness of our techniques.     

Robust Optimal Disturbance Observer Design for the Non‐Minimum Phase System

In this paper, a design strategy of robust disturbance observer is proposed systematically for stable non‐minimum phase systems. This strategy synthesizes the internal and robust stability, relative order and mixed sensitivity design requirements together to establish the optimization function. The optimal solution is obtained by standard H_∞ control theory under the condition of guarantying the presented requirements. Simulation results of a rotary mechanical system show the effectiveness of the proposed strategy.     

球面调和描述子在图像形状匹配中的应用

球面调和分析是球面信号分析的重要工具, 本文采用球面调和描述子对图像进行形状匹配. 首先把平面图像映射到球面上, 然后计算球面图像的球面调和描述子, 最后通过球面调和描述子得到平面图像的相似性. 实验结果表明, 球面调和描述子可以较好地匹配图像的形状相似性, 并且具有旋转和比例不变性.     

广义交联系统的鲁棒分散控制

研究广义交联系的鲁棒分散控制问题，利用广义系统的Ｌｙａｐｕｎｏｖ方程和Ｒｉｃｃａｔｉ方程，给出了广义交联系存在分散状态反馈使闭环系统结构稳定并具有一定鲁棒稳定裕度的条件。对相关问题也做了必要讨论。     

Heat Walk: Robust Salient Segmentation of Non‐rigid Shapes

Segmenting three dimensional objects using properties of heat diffusion on meshes aim to produce salient results. The few existing algorithms based on heat diffusion do not use the full knowledge that can be gained from heat diffusion and are sensitive to varying kinds of perturbations. Our simple algorithm, Heat Walk, converts the implicit information in the heat kernel to explicit knowledge about the pathways for maximum heat flow capacity. We develop a two stage strategy for segmentation. In the first stage we quickly identify regions which are dominated by heat accumulators by employing a greedy algorithm. The second stage partitions out dissipative regions from the previously discovered accumulative regions by using a KL‐divergence based criterion. The resulting algorithm is both independent of human intervention and fast because of the globally aware directed walk along the maximal heat flow capacity. Extensive experimental evidence shows the method is robust to a variety of noise factors including topological short circuits, surface holes, pose variations, variations in tessellation, missing features, scaling, as well as normal and shot noise. Comparison with the Princeton Segmentation Benchmark (PSB) shows that our method is comparable with state of the art segmentation methods and has additional advantages of being robust and self contained. Based upon theoretical insight the convergence and stability of the Heat Walk is shown.     

Offline Robust Model Predictive Control for Lipschitz Non‐Linear Systems Using Polyhedral Invariant Sets

In this paper the concept of maximal admissible set (MAS) for linear systems with polytopic uncertainty is extended to non‐linear systems composed of a linear constant part followed by a non‐linear term. We characterize the maximal admissible set for the non‐linear system with unstructured uncertainty in the form of polyhedral invariant sets. A computationally efficient state‐feedback RMPC law is derived off‐line for Lipschitz non‐linear systems. The state‐feedback control law is calculated by solving a convex optimization problem within the framework of linear matrix inequalities (LMIs), which leads to guaranteeing closed‐loop robust stability. Most of the computational burdens are moved off‐line. A linear optimization problem is performed to characterize the maximal admissible set, and it is shown that an ellipsoidal invariant set is only an approximation of the true stabilizable region. This method not only remarkably extends the size of the admissible set of initial conditions but also greatly reduces the on‐line computational time. The usefulness and effectiveness of the method proposed here is verified via two simulation examples.     

Robust H∞ Control for Non‐Minimum Phase Switched Cascade Systems with Time Delay

The H_∞ control of a class of the uncertain switched nonlinear cascaded systems with time delay is explored in this paper via the multiple Lyapunov functions. The considered systems are assumed to comprise an inherently nonlinear and a linearizable nonlinear dynamic system that may be non‐minimum phase. A group of partial differential inequalities containing adjustable functions are used in the control design task. The state feedback controllers and a suitable switching law are designed simultaneously so as to achieve the desired disturbance attenuation while preserving asymptotic stability for all admissible uncertainties. The partial differential inequalities are of lower dimension than general Hamilton–Jacobi inequalities, and therefore the solving process is feasible. This particular technique is applicable even if no subsystem is asymptotically stable. The non‐minimum phase property is compensated for by means of an appropriate switching mechanism. A robust H_∞ control for non‐switched cascade system with time delay is obtained in addition. An illustrative example is given to demonstrate the efficiency of the proposed design method.     

一类线性时变不确定周期奇异系统的鲁棒镇定

讨论了一类线性时变不确定周期广义系统的鲁棒镇定问题．基于线性时变不确定周期广义系统的鲁棒稳定的概念, 提出鲁棒稳定的充分必要条件, 并基于对偶系统的等价性得到鲁棒镇定的充分必要条件. 通过引入自由矩阵, 所得结果表示为线性矩阵不等式, 验证过程更简单、可靠.     

Discriminative Sketch‐based 3D Model Retrieval via Robust Shape Matching

We propose a sketch‐based 3D shape retrieval system that is substantially more discriminative and robust than existing systems, especially for complex models. The power of our system comes from a combination of a contour‐based 2D shape representation and a robust sampling‐based shape matching scheme. They are defined over discriminative local features and applicable for partial sketches; robust to noise and distortions in hand drawings; and consistent when strokes are added progressively. Our robust shape matching, however, requires dense sampling and registration and incurs a high computational cost. We thus devise critical acceleration methods to achieve interactive performance: precomputing kNN graphs that record transformations between neighboring contour images and enable fast online shape alignment; pruning sampling and shape registration strategically and hierarchically; and parallelizing shape matching on multi‐core platforms or GPUs. We demonstrate the effectiveness of our system through various experiments, comparisons, and user studies.     

基于采样点组二值化策略的鲁棒二值描述子研究

鉴于当前基于采样模型的二值描述子的采样信息相关度高且描述子的鲁棒性较低,通过改进视网膜采样模型,提出基于采样点组二值化策略的鲁棒二值描述子。首先,通过减少采样层数并增大采样点间的距离,设计出低采样点密度和低采样区域重叠度的改进视网膜采样模型。然后,在模型中的采样点圆形邻域内获取若干像素点,将其与采样点一起组成采样点组,分别计算两个采样点组对应点的灰度对比结果,并利用投票策略决定最终二值结果。最后,将采样点组的梯度对比信息与灰度对比信息一起编码生成描述子,以提高对相似灰度区域的描述力。通过对比实验可以看出,所提二值描述子对各种图像变化具有较好的鲁棒性且具有较好的匹配效果。