The objective of this paper is to learn dense 3D shape correspondence for topology-varying generic objects in an unsupervised manner. Conventional implicit functions estimate the occupancy of a 3D point given a shape ...
详细信息
The objective of this paper is to learn dense 3D shape correspondence for topology-varying generic objects in an unsupervised manner. Conventional implicit functions estimate the occupancy of a 3D point given a shape latent code. Instead, our novel implicit function produces a probabilistic embedding to represent each 3D point in a part embedding space. Assuming the corresponding points are similar in the embedding space, we implement dense correspondence through an inverse function mapping from the part embedding vector to a corresponded 3D point. Both functions are jointly learned with several effective and uncertainty-aware loss functions to realize our assumption, together with the encoder generating the shape latent code. During inference, if a user selects an arbitrary point on the source shape, our algorithm can automatically generate a confidence score indicating whether there is a correspondence on the target shape, as well as the corresponding semantic point if there is one. Such a mechanism inherently benefits man-made objects with different part constitutions. The effectiveness of our approach is demonstrated through unsupervised 3D semantic correspondence and shape segmentation.
Convex relaxations of nonconvex functions provide useful bounding information in applications such as deterministic global optimization and reachability analysis. In some situations, the original nonconvex functions m...
详细信息
Convex relaxations of nonconvex functions provide useful bounding information in applications such as deterministic global optimization and reachability analysis. In some situations, the original nonconvex functions may not be known explicitly, but are instead described implicitly by nonlinear equation systems. In these cases, established convex relaxation methods for closed-form functions are not directly applicable. This article presents a new general strategy to construct convex relaxations for such implicit functions. These relaxations are described as convex parametric programs whose constraints are convex relaxations of the original residual function. This relaxation strategy is straightforward to implement, produces tight relaxations in practice, is particularly efficient to carry out when monotonicity properties can be exploited, and does not assume the existence or uniqueness of an implicit function on the entire intended domain. Unlike all previous approaches to the authors' knowledge, this new approach permits any relaxations of the residual function;it does not require the residual relaxations to be factorable or to be obtained from a McCormick-like traversal of a computational graph. This new convex relaxation strategy is extended to inverse functions, compositions involving implicit functions, feasible-set mappings in constraint satisfaction problems, and solutions of parametric ODEs. Based on a proof-of-concept implementation in Julia, numerical examples are presented to illustrate the convex relaxations produced for various implicit functions and optimal-value functions.
This contribution describes a new approach to formulation of ODE and PDE critical points using implicit formulation as t-variant scalar function using the Taylor expansion. A general condition for the critical points ...
详细信息
ISBN:
(纸本)9783031104503;9783031104497
This contribution describes a new approach to formulation of ODE and PDE critical points using implicit formulation as t-variant scalar function using the Taylor expansion. A general condition for the critical points is derived and specified for t invariant case. It is expected, that the given new formulae lead to more reliable detection of critical points especially for large 3D fluid flow data acquisition, which enable high 3D vector compression and their representation using radial basis functions (RBF). In the case of vector field visualization, e.g. fluid flow, electromagnetic fields, etc., the critical points of ODE are critical for physical phenomena behavior.
We prove a closed formula for the derivative, of any order, of a implicit function, in terms of some binomial building blocks, and explain the combinatorics behind the coefficients appearing in the formula.
We prove a closed formula for the derivative, of any order, of a implicit function, in terms of some binomial building blocks, and explain the combinatorics behind the coefficients appearing in the formula.
DOT (Dependent Object Types) is an object calculus with path-dependent types and abstract type members, developed to serve as a theoretical foundation for the Scala programming language. As yet, DOT does not model all...
详细信息
ISBN:
(纸本)9781450368247
DOT (Dependent Object Types) is an object calculus with path-dependent types and abstract type members, developed to serve as a theoretical foundation for the Scala programming language. As yet, DOT does not model all of Scala's features, but a small subset. We present the calculus DIF (DOT with implicit functions), which extends the set of features modelled by DOT to include implicit functions, a feature of Scala to aid modularity of programs. We show type safety of DIF, and demonstrate that the generic programming focused use cases for implicit functions in Scala are also expressible in DIF.
A recent nonsmooth vector forward mode of algorithmic differentiation (AD) computes Nesterov's L-derivatives for nonsmooth composite functions;these L-derivatives provide useful sensitivity information to methods ...
详细信息
A recent nonsmooth vector forward mode of algorithmic differentiation (AD) computes Nesterov's L-derivatives for nonsmooth composite functions;these L-derivatives provide useful sensitivity information to methods for nonsmooth optimization and equation solving. The established reverse AD mode evaluates gradients efficiently for smooth functions, but it does not extend directly to nonsmooth functions. Thus, this article examines branch-locking strategies to harness the benefits of smooth AD techniques even in the nonsmooth case, in order to improve the computational performance of the non smooth vector forward AD mode, In these strategies, each non-smooth elemental function in the original composition is 'locked' into an appropriate linear 'branch'. The original composition is thereby replaced with a smooth variant, which may be subjected to efficient AD techniques for smooth functions such as the reverse AD mode. In order to choose the correct linear branches, we use inexpensive probing steps to ascertain the composite function's local behaviour. A simple implementation in C++11 is described, and the developed techniques are extended to nonsmooth local implicit functions and inverse functions.
We consider the problem of computing derivatives of an objective that is defined using implicit functions;i.e., implicit variables are computed by solving equations that are often nonlinear and solved by an iterative ...
详细信息
We consider the problem of computing derivatives of an objective that is defined using implicit functions;i.e., implicit variables are computed by solving equations that are often nonlinear and solved by an iterative process. If one were to apply Algorithmic Differentiation (AD) directly, one would differentiate the iterative process. In this paper we present the Newton step methods for computing derivatives of the objective. These methods make it easy to take advantage of sparsity, forward mode, reverse mode, and other AD techniques. We prove that the partial Newton step method works if the number of steps is equal to the order of the derivatives. The full Newton step method obtains two derivatives order for each step except for the first step. There are alternative methods that avoid differentiating the iterative process;e.g., the method implemented in ADOL-C. An optimal control example demonstrates the advantage of the Newton step methods when computing both gradients and Hessians. We also discuss the Laplace approximation method for nonlinear mixed effects models as an example application.
In this work, equality-constrained bilevel optimization problems, arising from engineering design, economics, and operations research problems, are reformulated as an equivalent semi-infinite program (SIP) with implic...
详细信息
In this work, equality-constrained bilevel optimization problems, arising from engineering design, economics, and operations research problems, are reformulated as an equivalent semi-infinite program (SIP) with implicit functions embedded, which are defined by the original equality constraints that model the system. Using recently developed theoretical tools for bounding implicit functions, a recently developed algorithm for global optimization of implicit functions, and a recently developed algorithm for solving standard SIPs with explicit functions to global optimality, a method for solving SIPs with implicit functions embedded is presented. The method is guaranteed to converge to ?-optimality in finitely many iterations given the existence of a Slater point arbitrarily close to a minimizer. Besides the Slater point assumption, it is assumed only that the functions are continuous and factorable and that the model equations are once continuously differentiable.
A numerical method of initializing cell volume fraction demarcated by implicitly defined fluid interfaces is presented. Each cell of the computational domain is examined for the presence of the reference phase. When a...
详细信息
A numerical method of initializing cell volume fraction demarcated by implicitly defined fluid interfaces is presented. Each cell of the computational domain is examined for the presence of the reference phase. When a cell is not full or empty, limits are found that allow volume fraction to be computed by numerical integration. The method enlists a number of algorithms including root finding and minimum search on an oriented segment, a preconditioned conjugate gradient minimum search on a cell face and a double Gauss-Legendre integration with a variable number of nodes, among others. Practical multi-phase fluid examples in two- and three-dimensions are presented to demonstrate the accuracy and robustness of the method. (C) 2014 Elsevier Ltd. All rights reserved.
Real-world object modeling is a crucial part of computer graphics, with findings of great importance for many applications in areas of computer assisted design, manufacturing and engineering. However, geometric modeli...
详细信息
ISBN:
(纸本)9781467394642
Real-world object modeling is a crucial part of computer graphics, with findings of great importance for many applications in areas of computer assisted design, manufacturing and engineering. However, geometric modeling of such objects proves quite challenging, especially when complex volumetric structures are involved as in the case of biological anatomy. In this paper, we present a method for the 3-D modeling of human organs based on an implicit representation approach. The principal idea consists of sampling the region of interest from three-dimensional labeled images and implicitly reconstructing its surface using an algorithm based on the Poisson surface reconstruction method. From there, either a surface mesh or a 3-D mesh is adjusted to the implicit surface, which is given by the zero level set of a function f(x) = 0. This is done to allow not only the visualization but physically-based simulations. As far as assessment of the new method is concerned, we used the Dice Similarity Coefficient, and the Hausdorff Distance to evaluate accuracy.
暂无评论