Search results for "Hausdorff"
showing 10 items of 162 documents
Automatic segmentation of the spine by means of a probabilistic atlas with a special focus on ribs suppression
2017
[EN] Purpose: The development of automatic and reliable algorithms for the detection and segmentation of the vertebrae are of great importance prior to any diagnostic task. However, an important problem found to accurately segment the vertebrae is the presence of the ribs in the thoracic region. To overcome this problem, a probabilistic atlas of the spine has been developed dealing with the proximity of other structures, with a special focus on ribs suppression. Methods: The data sets used consist of Computed Tomography images corresponding to 21 patients suffering from spinal metastases. Two methods have been combined to obtain the final result: firstly, an initial segmentation is performe…
A remark on weakly convex continuous mappings in topological linear spaces
2009
Abstract Let C be a compact convex subset of a Hausdorff topological linear space and T : C → C a continuous mapping. We characterize those mappings T for which T ( C ) is convexly totally bounded.
A new approximation procedure for fractals
2003
AbstractThis paper is based upon Hutchinson's theory of generating fractals as fixed points of a finite set of contractions, when considering this finite set of contractions as a contractive set-valued map.We approximate the fractal using some preselected parameters and we obtain formulae describing the “distance” between the “exact fractal” and the “approximate fractal” in terms of the preselected parameters. Some examples and also computation programs are given, showing how our procedure works.
On the Extension of the DIRECT Algorithm to Multiple Objectives
2020
AbstractDeterministic global optimization algorithms like Piyavskii–Shubert, direct, ego and many more, have a recognized standing, for problems with many local optima. Although many single objective optimization algorithms have been extended to multiple objectives, completely deterministic algorithms for nonlinear problems with guarantees of convergence to global Pareto optimality are still missing. For instance, deterministic algorithms usually make use of some form of scalarization, which may lead to incomplete representations of the Pareto optimal set. Thus, all global Pareto optima may not be obtained, especially in nonconvex cases. On the other hand, algorithms attempting to produce r…
A quantitative reverse Faber-Krahn inequality for the first Robin eigenvalue with negative boundary parameter
2021
The aim of this paper is to prove a quantitative form of a reverse Faber-Krahn type inequality for the first Robin Laplacian eigenvalueλβwith negative boundary parameter among convex sets of prescribed perimeter. In that framework, the ball is the only maximizer forλβand the distance from the optimal set is considered in terms of Hausdorff distance. The key point of our stategy is to prove a quantitative reverse Faber-Krahn inequality for the first eigenvalue of a Steklov-type problem related to the original Robin problem.
R Code for Hausdorff and Simplex Dispersion Orderings in the 2D Case
2010
This paper proposes a software implementation using R of the Hausdorff and simplex dispersion orderings. A copy can be downloaded from http://www.uv.es/~ayala/software/fun-disp.R . The paper provides some examples using the functions exactHausdorff for the Hausdorff dispersion ordering and the function simplex for the simplex dispersion orderings. Some auxiliary functions are commented too.
Delta- and Daugavet points in Banach spaces
2020
AbstractA Δ-pointxof a Banach space is a norm-one element that is arbitrarily close to convex combinations of elements in the unit ball that are almost at distance 2 fromx. If, in addition, every point in the unit ball is arbitrarily close to such convex combinations,xis a Daugavet point. A Banach spaceXhas the Daugavet property if and only if every norm-one element is a Daugavet point. We show that Δ- and Daugavet points are the same inL1-spaces, inL1-preduals, as well as in a big class of Müntz spaces. We also provide an example of a Banach space where all points on the unit sphere are Δ-points, but none of them are Daugavet points. We also study the property that the unit ball is the clo…
Bifurcations of cuspidal loops
1997
A cuspidal loop for a planar vector field X consists of a homoclinic orbit through a singular point p, at which X has a nilpotent cusp. This is the simplest non-elementary singular cycle (or graphic) in the sense that its singularities are not elementary (i.e. hyperbolic or semihyperbolic). Cuspidal loops appear persistently in three-parameter families of planar vector fields. The bifurcation diagrams of unfoldings of cuspidal loops are studied here under mild genericity hypotheses: the singular point p is of Bogdanov - Takens type and the derivative of the first return map along the orbit is different from 1. An analytic and geometric method based on the blowing up for unfoldings is propos…
Convolutional Neural Network With Shape Prior Applied to Cardiac MRI Segmentation.
2019
In this paper, we present a novel convolutional neural network architecture to segment images from a series of short-axis cardiac magnetic resonance slices (CMRI). The proposed model is an extension of the U-net that embeds a cardiac shape prior and involves a loss function tailored to the cardiac anatomy. Since the shape prior is computed offline only once, the execution of our model is not limited by its calculation. Our system takes as input raw magnetic resonance images, requires no manual preprocessing or image cropping and is trained to segment the endocardium and epicardium of the left ventricle, the endocardium of the right ventricle, as well as the center of the left ventricle. Wit…
Common Fixed points for multivalued generalized contractions on partial metric spaces
2013
We establish some common fixed point results for multivalued mappings satisfying generalized contractive conditions on a complete partial metric space. The presented theorems extend some known results to partial metric spaces. We motivate our results by some given examples and an application for finding the solution of a functional equation arising in dynamic programming.