In this note, we propose a general definition of shape which is both compatible with the one proposed in phenomenology (gestaltism) and with a computer vision implementation. We reverse the usual order in Computer Vision. We do not define “shape recognition" as a task which requires a “model" pattern which is searched in all images of a certain kind. We give instead a “blind" definition of shapes relying only on invariance and repetition arguments. Given a set of images $ℐ$, we call...

Let be a real Hilbert space, ${\Phi }_1:H\to$ a convex function of class ${𝒞}^1$ that we wish to minimize under the convex constraint . A classical approach consists in following the trajectories of the generalized steepest descent system (  Brézis [CITE]) applied to the non-smooth function ${\Phi }_1+{\delta }_S$. Following Antipin [1], it is also possible to use a continuous gradient-projection system. We propose here an alternative method as follows: given a smooth convex function ${\Phi }_0:H\to$ whose critical points coincide with  and...

We consider a finite-dimensional control system $\left(\Sigma \right)\dot{x}\left(t\right)=f(x\left(t\right),u\left(t\right))$, such that there exists a feedback stabilizer that renders $\dot{x}=f(x,k\left(x\right))$ globally asymptotically stable. Moreover, for with an output map and $1\le p\le q\le \infty$, we assume that there exists a ${𝒦}_{\infty }$-function such that $\parallel H\left(x_u\right){\parallel }_q\le {\alpha (\parallel u\parallel }_p)$, where is the maximal solution of ${\left(\Sigma \right)}_k\dot{x}\left(t\right)=f(x\left(t\right),k\left(x\left(t\right)\right)+u\left(t\right))$, corresponding to and to the initial condition . Then, the gain function $G_{(H,p,q)}$ of given by 14.5cm $$G_{(H,p,q)}\left(X\right)\stackrel{\mathrm{def}}{=}\underset{{\parallel u\parallel }_p=X}{sup}{\parallel H\left(x_u\right)\parallel }_q,$$ is well-defined. We call profile of for any ${𝒦}_{\infty }$-function which is of the same order of magnitude...