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 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.     

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.     

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.     

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.     

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

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

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.     

Adaptive and Robust Stabilization of Feedforward Nonlinear Systems Driven by Symmetric and Non‐symmetric Dead‐zone Inputs

The stabilization of feedforward nonlinear systems subject to hard‐input nonlinearities is a challenging problem due to the presence of input uncertainties. This paper deals with adaptive control of a class of feedforward nonlinear systems driven by unknown dead‐zone inputs. The unknown dead‐zone input nonlinearity is assumed to be either symmetric or non‐symmetric. The control design is based on the combination of the invariant‐manifold stabilization technique with the classical adaptive and robust compensation methods. Simulation results showed that the presence of the dead‐zone inputs in the system dynamics can be handled even for arbitrary large dead‐zone parameters.     

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.     

图像特征点匹配的强壮算法

同一场景的不同图像匹配是计算机视觉中的一个基本问题,在诸如三维重度,对象识别和分类、图像对齐和相机自校正等应用中,特征匹配都是一个关键步骤,其中特征点匹配是较为常用的一种方法,特征点匹配的效果受到很多因素的影响,如景物的遮挡,光照和噪声等,变化很大,文中对结指标派算法进行扩以解决全局优化问题,并利用场景深度局部连续的条件作为附加约束,提出一种新的特征点匹配算法,整个算法只用到两次优化,而且几乎全部使用矩阵运算,效率比已有的算法高,实验表明该算法的效果是令人满意的。     

Robust Nonlinear Observer And Observer‐Backstepping Control Design For Surface Ships

A robust passive non‐linear observer, utilizing the sliding mode concept and acceleration feedback (AFB) technique, is developed for ships. The main advantage of the proposed observer is that it is robust and that it takes the Coriolis‐centripetal matrix (C‐matrix) into account. The observer reconstructs velocities of ships and bias from slowly varying environmental disturbances. It also filters out the noise and wave frequency data from measurements to protect the actuators from wear and excessive fuel consumption. The sliding mode technique is introduced to improve robust performance against neglected disturbances, uncertainties, and unmodeled dynamics. The acceleration feedback technique and coordinate transformation are used for reshaping the inertia matrix and removing the C‐matrix from the mathematical model. Then, the observer design and stability analysis become simpler. An output feedback controller using observer backstepping and the Lyapunov redesign technique is derived, and the global stability of the observer and observer‐controller system is shown by Lyapunov stability theory. A set of simulations was carried out to verify the performance of the proposed observer and controller.     

广义不确定周期时变系统具有完整性的二次稳定

研究带有不确定项的广义周期时变系统的二次稳定及其完整性问题。引入广义不确定周期时变系统二次稳定的概念,用广义代数Riccati不等式,给出广义不确定周期时变系统在状态和输出反馈作用下所构成的闭环系统二次稳定,并且当传感器或执行器出现故障时仍能具有完整性二次稳定的充分必要条件。所得结论是广义系统完整性研究成果向一般广义周期时变系统的扩展。最后,通过数值算例验证了所得结论的有效性。