A Lattice Approach to Image Segmentation

After a formal definition of segmentation as the largest partition of the space according to a criterion σ and a function f, the notion of a morphological connection is reminded. It is used as an input to a central theorem of the paper (Theorem 8), that identifies segmentation with the connections that are based on connective criteria. Just as connections, the segmentations can then be regrouped by suprema and infima. The generality of the theorem makes it valid for functions from any space to any other one. Two propositions make precise the AND and OR combinations of connective criteria. The soundness of the approach is demonstrated by listing a series of segmentation techniques. One considers first the cases when the segmentation under study does not involve initial seeds. Various modes of regularity are discussed, which all derive from Lipschitz functions. A second category of examples involves the presence of seeds around which the partition of the space is organized. An overall proposition shows that these examples are a matter for the central theorem. Watershed and jump connection based segmentations illustrate this type of situation. The third and last category of examples deals with cases when the segmentation occurs in an indirect space, such as an histogram, and is then projected back on the actual space under study. The relationships between filtering and segmentation are then investigated. A theoretical chapter introduces and studies the two notions of a pulse opening and of a connected operator. The conditions under which a family of pulse openings can yield a connected filter are clarified. The ability of segmentations to generate pyramids, or hierarchies, is analyzed. A distinction is made between weak hierarchies where the partitions increase when going up in the pyramid, and the strong hierarchies where the various levels are structured as semi-groups, and particularly as granulometric semi-groups. The last section is based on one example, and goes back over the controversy about “lattice” versus “functional” optimization. The problem is now tackled via a case of colour segmentation, where the saturation serves as a cursor between luminance and hue. The emphasis is put on the difficulty of grouping the various necessary optimizations into a single one.     

推广的Kantorovi多项式的L_p保持Lipschitz条件性

本文研究推广的Kantorovi多项式P_n~*(f, x)在L_p[0,1]空间中的保持Lipschitz条件性质。     

一类广义集值强非线性混合拟变分不等式(英文)

引进一类广义集值强非线性混合拟变分不等式,并且用投影技巧证明了它解的存在性.推广了广义集值强非线性混合变分不等式的许多结论.     

基于非线性自适应观测器的飞机操纵面故障诊断

研究以非线性方程描述的飞机在操纵面发生损伤、卡死等故障时的自适应观测器诊断方法.通过引入有效性因子表征操纵导数变化的程度,将飞机操纵面故障诊断转化为具有未知参数的Lipschitz非线性系统的状态观测器设计问题.采用Lypunov方法,给出了观测器的结构形式和参数估计的自适应律,并在分析观测器渐近收敛的充分条件的基础上,给出了相关参数.数字仿真表明建议的自适应观测器能够快速且较准确地估计出有效因子的变化,验证了该方法的可行性.     

局部Lipschitz连续函数差的刻画

在Banach空间中利用广义方向导数和Clarke次微分的定义,指出两个局部Lipschitz连续函数差与Clarke次微分之间的关系.在此基础上,指出如果两个局部Lipschitz连续函数f,g：X→R是Clarke正则的,那么结果退化到经典意义下ε次微分与局部Lipschitz连续函数差的关系,并指出了当函数h是可微偶凸函数时,在定理1的条件下两个局部Lipschitz连续函数的Clarke次微分之间的关系,最后指出当两个局部Lipschitz连续函数差为常数时,两个函数的Clarke次微分之间的关系.     

含未知参数和输出不确定性的Lipschitz非线性系统自适应观测器设计

对含未知参数且输出带有不确定性的Lipschitz非线性系统,本文提出了一种自适应观测器的设计方法。当该系统输出的不确定性部分满足Lipschitz条件时,本文给出了系统观测器的结构形式,通过黎卡提方程和矩阵不等式的求解给出观测器增益矩阵的选取方法和参数估计的自适应律, 基于Lyapunov方法证明系统的状态估计误差是一致有界的。仿真结果验证了提出的自适应观测器设计的有效性。     

A robust observer‐based stabilization method for systems with uncertain parameters and Lipschitz nonlinearities

This paper deals with the robust observer‐based control design for a class of Lipschitz nonlinear discrete‐time systems with parameter uncertainties. Based on the use of a reformulated Lipschitz property combined with the slack variable techniques and some mathematical artifacts, it is shown that the solution of the discrete‐time output feedback stabilization problem is conditioned by a set of bilinear matrix inequalities, which become linear matrix inequalities by freezing some scalars. Furthermore, we show that some existing and elegant results reported in the literature can be regarded as particular cases of the stability conditions presented here. Numerical examples are provided to show the validity and superiority of the proposed method. Copyright © 2015 John Wiley & Sons, Ltd.     

Improved exponential observer design for one‐sided Lipschitz nonlinear systems

This paper investigates the exponential observer design problem for one‐sided Lipschitz nonlinear systems. A unified framework for designing both full‐order and reduced‐order exponential state observers is proposed. The developed design approach requires neither scaling of the one‐sided Lipschitz constant nor the additional quadratically inner‐bounded condition. It is shown that the synthesis conditions established include some known existing results as special cases and can reduce the intrinsic conservatism. For design purposes, we also formulate the observer synthesis conditions in a tractable LMI form or a Riccati‐type inequality with equality constraints. Simulation results on a numerical example are given to illustrate the advantages and effectiveness of the proposed design scheme. Copyright © 2016 John Wiley & Sons, Ltd.     

Optimally Adaptive Integration of Univariate Lipschitz Functions

We consider the problem of approximately integrating a Lipschitz function f (with a known Lipschitz constant) over an interval. The goal is to achieve an additive error of at most ε using as few samples of f as possible. We use the adaptive framework: on all problem instances an adaptive algorithm should perform almost as well as the best possible algorithm tuned for the particular problem instance. We distinguish between and , the performances of the best possible deterministic and randomized algorithms, respectively. We give a deterministic algorithm that uses samples and show that an asymptotically better algorithm is impossible. However, any deterministic algorithm requires samples on some problem instance. By combining a deterministic adaptive algorithm and Monte Carlo sampling with variance reduction, we give an algorithm that uses at most samples. We also show that any algorithm requires samples in expectation on some problem instance (f,ε), which proves that our algorithm is optimal.     

Observer-based leader-following consensus of one-sided Lipschitz multi-agent systems over input saturation and directed graphs

This paper investigates a local observer-based leader-following consensus control of one-sided Lipschitz (OSL) multi-agent systems (MASs) under input saturation. The proposed consensus control scheme has been formulated by using the OSL property, input saturation, directed graphs, estimated states, and quadratic inner-boundedness condition by attaining the regional stability. It is assumed that the graph always includes a (directed) spanning tree with respect to the leader root to develop matrix inequalities for investigating parameters of the proposed observer and consensus protocols. Further, a new observer-based consensus tracking method for MASs with saturation, concerning independent topologies for communicating outputs and estimates over the network, is explored to deal with a more perplexing and realistic situation. In contrast to the traditional methods, the proposed consensus approach considers output feedback and deals with the input saturation for a generalized class of nonlinear systems. The efficiency of the obtained results is illustrated via application to a group of five moving agents in the Cartesian coordinates.