نتایج جستجو برای: geometric level set
تعداد نتایج: 1721851 فیلتر نتایج به سال:
Since Euclid (300 BC) we have been used to perceiving nature with the concept of a threedimensional (3-D) geometry. We measure linear structures in one dimension, area-like structures in two dimensions, and volume-like structures in three dimensions. However, when we measure an object in terms of these three dimensions, we are aware that the geometric model describes a solid body, while a natur...
The flag Whitney numbers (also referred to as the flag f -numbers) of a geometric lattice count the number of chains of the lattice with elements having specified ranks. We give a collection of inequalities which imply all the linear inequalities satisfied by the flag Whitney numbers of rank 3 geometric lattices. We further describe the smallest closed convex set containing the flag Whitney num...
A variational level set method is developed for the supervised classification problem. Nonlinear classifier decision boundaries are obtained by minimizing an energy functional that is composed of an empirical risk term with a margin-based loss and a geometric regularization term new to machine learning: the surface area of the decision boundary. This geometric level set classifier is analyzed i...
A variational level set method is developed for the supervised classification problem. Nonlinear classifier decision boundaries are obtained by minimizing an energy functional that is composed of an empirical risk term with a margin-based loss and a geometric regularization term new to machine learning: the surface area of the decision boundary. This geometric level set classifier is analyzed i...
One of the fundamental concepts in convex analysis and optimization is the relative interior of a set. This concept is used when the interior of a set is empty due to the incompleteness of its dimension. In this paper, first, we propose a linear programming model to find a relative interior point of a polyhedral set. Then, we discuss the application of this model to geometric programming. Speci...
Given an instance of a geometric set cover problem on a set of points X and a set of objects R, the dual is a geometric hitting set problem on a set of points P and a set of objects Q, where there exists a one-to-one mapping from each xj ∈ X to a dual object Qj ∈ Q and for each Ri ∈ R to a dual point in pi ∈ P , so that a dual point pi is contained in a dual object Qj if and only if the corresp...
Many real-world search and optimization problems involve inequality and/or equality constraints and are thus posed as constrained optimization problems. In trying to solve constrained optimization problems using classical optimization methods, this paper presents a Multi-Objective Bees Algorithm (MOBA) for solving the multi-objective optimal of mechanical engineering problems design. In the pre...
Abstract. A new morphological multiscale method in 3D image processing is presented which combines the image processing methodology based on nonlinear diffusion equations and the theory of geometric evolution problems. Its aim is to smooth level sets of a 3D image while simultaneously preserving geometric features such as edges and corners on the level sets. This is obtained by an anisotropic c...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید