Optimization of convex shapes: An approach to crystal shape identification

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider a shape identification problem of growing crystals. The shape of the crystal is to be constructed from a single interferometer measurement. This is an ill-posed inverse problem. The forward problem of interferogram from shape is injective if we restrict the problem to convex shapes with known boundary. The problem is formulated as a shape optimization problem. Our aim is to solve this numerically using the gradient descent method. In the numerical computations of this paper we study the behavior of the approach in simplified cases. Using H 1-gradients (inner products) acts as a regularization method. Methods for enforcing the convexity of shapes are discussed. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Eirola, T., & Lassila, T. (2009). Optimization of convex shapes: An approach to crystal shape identification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5567 LNCS, pp. 660–671). https://doi.org/10.1007/978-3-642-02256-2_55

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free