Related papers: Birational Reparametrizations of Surfaces
An unbiased method for improving the resolution of astronomical images is presented. The strategy at the core of this method is to establish a linear transformation between the recorded image and an improved image at some desirable…
The algebraic translational surface is a typical modeling surface in computer aided design and architecture industry. In this paper, we give a necessary and sufficient condition for that algebraic surface having a standard parametric…
Let A^2 be the affine plane over a field K of characteristic 0. Birational morphisms of A^2 are mappings A^2 \to A^2 given by polynomial mappings \phi of the polynomial algebra K[x,y] such that for the quotient fields, one has K(\phi(x),…
Most genuine multi-sided surface representations depend on a 2D domain that enables a mapping between local parameters and global coordinates. The shape of this domain ranges from regular polygons to curved configurations, but the simple…
We introduce an efficient algorithmic framework for model selection in online learning, also known as parameter-free online learning. Departing from previous work, which has focused on highly structured function classes such as nested balls…
A local optimization method based on Bayesian Gaussian Processes is developed and applied to atomic structures. The method is applied to a variety of systems including molecules, clusters, bulk materials, and molecules at surfaces. The…
During a surface acquisition process using 3D scanners, noise is inevitable and an important step in geometry processing is to remove these noise components from these surfaces (given as points-set or triangulated mesh). The noise-removal…
A homotopy method for multi-objective optimization that produces uniformly sampled Pareto fronts by construction is presented. While the algorithm is general, of particular interest is application to simulation-based engineering…
By generalizing the notion of linearization, a concept originally arising from microlocal analysis and symbolic calculus, to diffeological spaces, we make a first proposal setting for optimization problems in this category. We show how…
A typical goal of research in combinatorial optimization is to come up with fast algorithms that find optimal solutions to a computational problem. The process that takes a real-world problem and extracts a clean mathematical abstraction of…
A central theme in classical algorithms for the reconstruction of discontinuous functions from observational data is perimeter regularization via the use of the total variation. On the other hand, sparse or noisy data often demands a…
Since now, many approaches has been proposed for surface defect detection based on image texture analysis techniques. One of the efficient texture analysis operations is local binary patterns which provides good accuracy.
Methodologies for reducing the design-space dimensionality in shape optimization have been recently developed based on unsupervised machine learning methods. These methods provide reduced dimensionality representations of the design space,…
Hyperparameters greatly impact models' capabilities; however, modern models are too large for extensive search. Instead, researchers design recipes that train well across scales based on their understanding of the hyperparameters. Despite…
We suggest simple modifications of the conditional gradient method for smooth optimization problems, which maintain the basic convergence properties, but reduce the implementation cost of each iteration essentially. Namely, we propose the…
High-dimensional simulation optimization is notoriously challenging. We propose a new sampling algorithm that converges to a global optimal solution and suffers minimally from the curse of dimensionality. The algorithm consists of two…
We propose the superiorization of incremental algorithms for tomographic image reconstruction. The resulting methods follow a better path in its way to finding the optimal solution for the maximum likelihood problem in the sense that they…
For a rational parameterization of a curve, it is desirable that its angular speed is as uniform as possible. Hence, given a rational parameterization, one wants to find re-parameterization with better uniformity. One natural way is to use…
We provide a classification of complex projective surfaces with a holomorphic foliation whose group of birational symetries is infinite.
When modeling scientific and industrial problems, geometries are typically modeled by explicit boundary representations obtained from computer-aided design software. Unfitted (also known as embedded or immersed) finite element methods offer…