Search results for "Ull"
showing 10 items of 3152 documents
The project scheduling polyhedron: Dimension, facets and lifting theorems
1993
Abstract The Project scheduling with resource constraints can be formulated as follows: given a graph G with node set N, a set H of directed arcs corresponding to precedence relations, and a set H′ of disjunctive arcs reflecting the resource incompatibilities, find among the subsets of H′ satisfying the resource constraints the set S that minimizes the longest path in graph (N, H ∪ S). We define the project scheduling polyhedron Qs as the convex hull of the feasible solutions. We investigate several classes of inequalities with respect to their facet-defining properties for the associated polyhedron. The dimension of Qs is calculated and several inequalities are shown to define facets. For …
Experiments with an adaptive Bayesian restoration method
1989
Abstract This paper describes a Bayesian restoration method applied to two-dimensional measured images, whose detector response function is not completely known. The response function is assumed Gaussian with standard deviation depending on the estimate of the local density of the image. The convex hull of the K -nearest neighbours ( K NN) of each ‘on’ pixel is used to compute the local density. The method has been tested on ‘sparse’ images, with and without noise background.
Enclosure method for the p-Laplace equation
2014
We study the enclosure method for the p-Calder\'on problem, which is a nonlinear generalization of the inverse conductivity problem due to Calder\'on that involves the p-Laplace equation. The method allows one to reconstruct the convex hull of an inclusion in the nonlinear model by using exponentially growing solutions introduced by Wolff. We justify this method for the penetrable obstacle case, where the inclusion is modelled as a jump in the conductivity. The result is based on a monotonicity inequality and the properties of the Wolff solutions.
Graph cut-based method for segmenting the left ventricle from MRI or echocardiographic images
2017
International audience; In this paper, we present a fast and interactive graph cut method for 3D segmentation of the endocardial wall of the left ventricle (LV) adapted to work on two of the most widely used modalities: magnetic resonance imaging (MRI) and echocardiography. Our method accounts for the fundamentally different nature of both modalities: 3D echocardiographic images have a low contrast, a poor signal-to-noise ratio and frequent signal drop, while MR images are more detailed but also cluttered and contain highly anisotropic voxels. The main characteristic of our method is to work in a 3D Bezier coordinate system instead of the original Euclidean space. This comes with several ad…
A comparative study of partitioning methods for crowd simulations
2010
The simulation of large crowds of autonomous agents with realistic behavior is still a challenge for several computer research communities. In order to handle large crowds, some scalable architectures have been proposed. Nevertheless, the effective use of distributed systems requires the use of partitioning methods that can properly distribute the workload generated by agents among the existing distributed resources. In this paper, we analyze the use of irregular shape regions (convex hulls) for solving the partitioning problem. We have compared a partitioning method based on convex hulls with two techniques that use rectangular regions. The performance evaluation results show that the conv…
A more efficient method for clustering sheet metal shapes
2007
The nesting of two-dimensional irregular shapes is a common problem which is frequently encountered by a number of industries where raw material has to be, as economically as possible, cut from a given stock sheet. A frequently recurring problem as far as cutting stock is concerned, is how to obtain the best nesting of some pieces of flat patterns which occupy minimalarea convex enclosure. The area of convex enclosure is related to the convex hull of the union of patterns which can be imagined as a large rubber band surrounding the set of all polygons. Our goal is to automatically obtain the smallest area convex shape containing all the patterns. As a matter of fact, Cheng and Rao have prop…
Convexly generic curves in R 3
1988
We study curves immersed in R 3, with special interest in the description of their convex hull frontier structure from a global viewpoint. Genericity conditions are set for these curves by looking at the singularities of height functions on them. We define panel structures for convexly generic curves and work out numerical relations involving the number of tritangent support planes. As a consequence, a generic version of the 4-vertex theorem for convex curves in R 3 is obtained.
Shape-Based Features for Cat Ganglion Retinal Cells Classification
2002
This article presents a quantitative and objective approach to cat ganglion cell characterization and classification. The combination of several biologically relevant features such as diameter, eccentricity, fractal dimension, influence histogram, influence area, convex hull area, and convex hull diameter are derived from geometrical transforms and then processed by three different clustering methods (Ward’s hierarchical scheme, K-means and genetic algorithm), whose results are then combined by a voting strategy. These experiments indicate the superiority of some features and also suggest some possible biological implications.
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…
Daugavet- and delta-points in Banach spaces with unconditional bases
2020
We study the existence of Daugavet- and delta-points in the unit sphere of Banach spaces with a 1 1 -unconditional basis. A norm one element x x in a Banach space is a Daugavet-point (resp. delta-point) if every element in the unit ball (resp. x x itself) is in the closed convex hull of unit ball elements that are almost at distance 2 2 from x x . A Banach space has the Daugavet property (resp. diametral local diameter two property) if and only if every norm one element is a Daugavet-point (resp. delta-point). It is well-known that a Banach space with the Daugavet property does not have an unconditional basis. Similarly spaces with the diametral local diameter two property do not have an un…