37,226 research outputs found

    On a continuation approach in Tikhonov regularization and its application in piecewise-constant parameter identification

    Full text link
    We present a new approach to convexification of the Tikhonov regularization using a continuation method strategy. We embed the original minimization problem into a one-parameter family of minimization problems. Both the penalty term and the minimizer of the Tikhonov functional become dependent on a continuation parameter. In this way we can independently treat two main roles of the regularization term, which are stabilization of the ill-posed problem and introduction of the a priori knowledge. For zero continuation parameter we solve a relaxed regularization problem, which stabilizes the ill-posed problem in a weaker sense. The problem is recast to the original minimization by the continuation method and so the a priori knowledge is enforced. We apply this approach in the context of topology-to-shape geometry identification, where it allows to avoid the convergence of gradient-based methods to a local minima. We present illustrative results for magnetic induction tomography which is an example of PDE constrained inverse problem

    Sharp interface limit for a phase field model in structural optimization

    Full text link
    We formulate a general shape and topology optimization problem in structural optimization by using a phase field approach. This problem is considered in view of well-posedness and we derive optimality conditions. We relate the diffuse interface problem to a perimeter penalized sharp interface shape optimization problem in the sense of Γ\Gamma-convergence of the reduced objective functional. Additionally, convergence of the equations of the first variation can be shown. The limit equations can also be derived directly from the problem in the sharp interface setting. Numerical computations demonstrate that the approach can be applied for complex structural optimization problems

    On a Bernoulli problem with geometric constraints

    Full text link
    A Bernoulli free boundary problem with geometrical constraints is studied. The domain \Om is constrained to lie in the half space determined by x1≥0x_1\geq 0 and its boundary to contain a segment of the hyperplane {x1=0}\{x_1=0\} where non-homogeneous Dirichlet conditions are imposed. We are then looking for the solution of a partial differential equation satisfying a Dirichlet and a Neumann boundary condition simultaneously on the free boundary. The existence and uniqueness of a solution have already been addressed and this paper is devoted first to the study of geometric and asymptotic properties of the solution and then to the numerical treatment of the problem using a shape optimization formulation. The major difficulty and originality of this paper lies in the treatment of the geometric constraints

    Visual Representations: Defining Properties and Deep Approximations

    Full text link
    Visual representations are defined in terms of minimal sufficient statistics of visual data, for a class of tasks, that are also invariant to nuisance variability. Minimal sufficiency guarantees that we can store a representation in lieu of raw data with smallest complexity and no performance loss on the task at hand. Invariance guarantees that the statistic is constant with respect to uninformative transformations of the data. We derive analytical expressions for such representations and show they are related to feature descriptors commonly used in computer vision, as well as to convolutional neural networks. This link highlights the assumptions and approximations tacitly assumed by these methods and explains empirical practices such as clamping, pooling and joint normalization.Comment: UCLA CSD TR140023, Nov. 12, 2014, revised April 13, 2015, November 13, 2015, February 28, 201
    • …
    corecore