1,905 research outputs found
An isogeometric finite element formulation for phase transitions on deforming surfaces
This paper presents a general theory and isogeometric finite element
implementation for studying mass conserving phase transitions on deforming
surfaces. The mathematical problem is governed by two coupled fourth-order
nonlinear partial differential equations (PDEs) that live on an evolving
two-dimensional manifold. For the phase transitions, the PDE is the
Cahn-Hilliard equation for curved surfaces, which can be derived from surface
mass balance in the framework of irreversible thermodynamics. For the surface
deformation, the PDE is the (vector-valued) Kirchhoff-Love thin shell equation.
Both PDEs can be efficiently discretized using -continuous interpolations
without derivative degrees-of-freedom (dofs). Structured NURBS and unstructured
spline spaces with pointwise -continuity are utilized for these
interpolations. The resulting finite element formulation is discretized in time
by the generalized- scheme with adaptive time-stepping, and it is fully
linearized within a monolithic Newton-Raphson approach. A curvilinear surface
parameterization is used throughout the formulation to admit general surface
shapes and deformations. The behavior of the coupled system is illustrated by
several numerical examples exhibiting phase transitions on deforming spheres,
tori and double-tori.Comment: fixed typos, extended literature review, added clarifying notes to
the text, added supplementary movie file
Information-Theoretic Registration with Explicit Reorientation of Diffusion-Weighted Images
We present an information-theoretic approach to the registration of images
with directional information, and especially for diffusion-Weighted Images
(DWI), with explicit optimization over the directional scale. We call it
Locally Orderless Registration with Directions (LORD). We focus on normalized
mutual information as a robust information-theoretic similarity measure for
DWI. The framework is an extension of the LOR-DWI density-based hierarchical
scale-space model that varies and optimizes the integration, spatial,
directional, and intensity scales. As affine transformations are insufficient
for inter-subject registration, we extend the model to non-rigid deformations.
We illustrate that the proposed model deforms orientation distribution
functions (ODFs) correctly and is capable of handling the classic complex
challenges in DWI-registrations, such as the registration of fiber-crossings
along with kissing, fanning, and interleaving fibers. Our experimental results
clearly illustrate a novel promising regularizing effect, that comes from the
nonlinear orientation-based cost function. We show the properties of the
different image scales and, we show that including orientational information in
our model makes the model better at retrieving deformations in contrast to
standard scalar-based registration.Comment: 16 pages, 19 figure
기하학적으로 정밀한 비선형 구조물의 아이소-지오메트릭 형상 설계 민감도 해석
학위논문 (박사)-- 서울대학교 대학원 : 공과대학 조선해양공학과, 2019. 2. 조선호.In this thesis, a continuum-based analytical adjoint configuration design sensitivity analysis (DSA) method is developed for gradient-based optimal design of curved built-up structures undergoing finite deformations. First, we investigate basic invariance property of linearized strain measures of a planar Timoshenko beam model which is combined with the selective reduced integration and B-bar projection method to alleviate shear and membrane locking. For a nonlinear structural analysis, geometrically exact beam and shell structural models are basically employed. A planar Kirchhoff beam problem is solved using the rotation-free discretization capability of isogeometric analysis (IGA) due to higher order continuity of NURBS basis function whose superior per-DOF(degree-of-freedom) accuracy over the conventional finite element analysis using Hermite basis function is verified. Various inter-patch continuity conditions including rotation continuity are enforced using Lagrage multiplier and penalty methods. This formulation is combined with a phenomenological constitutive model of shape memory polymer (SMP), and shape programming and recovery processes of SMP structures are simulated. Furthermore, for shear-deformable structures, a multiplicative update of finite rotations by an exponential map of a skew-symmetric matrix is employed. A procedure of explicit parameterization of local orthonormal frames in a spatial curve is presented using the smallest rotation method within the IGA framework. In the configuration DSA, the material derivative is applied to a variational equation, and an orientation design variation of curved structure is identified as a change of embedded local orthonormal frames. In a shell model, we use a regularized variational equation with a drilling rotational DOF. The material derivative of the orthogonal transformation matrix can be evaluated at final equilibrium configuration, which enables to compute design sensitivity using the tangent stiffness at the equilibrium without further iterations. A design optimization method for a constrained structure in a curved domain is also developed, which focuses on a lattice structure design on a specified surface. We define a lattice structure and its design variables on a rectangular plane, and utilize a concept of free-form deformation and a global curve interpolation to obtain an analytical expression for the control net of the structure on curved surface. The material derivative of the analytical expression eventually leads to precise design velocity field. Using this method, the number of design variables is reduced and design parameterization becomes more straightforward. In demonstrative examples, we verify the developed analytical adjoint DSA method in beam and shell structural problems undergoing finite deformations with various kinematic and force boundary conditions. The method is also applied to practical optimal design problems of curved built-up structures. For example, we extremize auxeticity of lattice structures, and experimentally verify nearly constant negative Poisson's ratio during large tensile and compressive deformations by using the 3-D printing and optical deformation measurement technologies. Also, we architect phononic band gap structures having significantly large band gap for mitigating noise in low audible frequency ranges.본 연구에서는 대변형을 고려한 휘어진 조립 구조물의 연속체 기반 해석적 애조인 형상 설계 민감도 해석 기법을 개발하였다. 평면 Timoshenko 빔의 선형화된 변형률의 invariance 특성을 고찰하였고 invariant 정식화를 선택적 축소적분(selective reduced integration) 기법 및 B-bar projection 기법과 결합하여 shear 및 membrane 잠김 현상을 해소하였다. 비선형 구조 모델로서 기하학적으로 정밀한 빔 및 쉘 모델을 활용하였다. 평면 Kirchhoff 빔 모델을 NURBS 기저함수의 고차 연속성에 따른 아이소-지오메트릭 해석 기반 rotation-free 이산화를 활용하여 다루었으며, 기존의 Hermite 기저함수 기반의 유한요소법에 비해 자유도당 해의 정확도가 높음을 검증하였다. 라그랑지 승수법 및 벌칙 기법을 도입하여 회전의 연속성을 포함한 다양한 다중패치간 연속 조건을 고려하였다. 이러한 기법을 현상학적 (phenomenological) 형상기억폴리머 (SMP) 재료 구성방정식과 결합하여 형상의 프로그래밍과 회복 과정을 시뮬레이션하였다. 전단변형을 겪는 (shear-deformable) 구조 모델에 대하여 대회전의 갱신을 교대 행렬의 exponential map에 의한 곱의 형태로 수행하였다. 공간상의 곡선 모델에서 최소회전 (smallest rotation) 기법을 통해 국소 정규직교좌표계의 명시적 매개화를 수행하였다. 형상 설계 민감도 해석을 위하여 전미분을 변분 방정식에 적용하였으며 휘어진 구조물의 배향 설계 변화는 국소 정규직교좌표계의 회전에 의하여 기술된다. 최종 변형 형상에서 직교 변환 행렬의 전미분을 계산함으로써 대회전 문제에서 추가적인 반복 계산없이 변형 해석에서의 접선강성행렬에 의해 해석적 설계 민감도를 계산할 수 있다. 쉘 구조물의 경우 면내 회전 자유도 및 안정화된 변분 방정식을 활용하여 보강재(stiffener)의 모델링을 용이하게 하였다. 또한 본 연구에서는 휘어진 영역에 구속되어있는 구조물에 대한 설계 속도장 계산 및 최적 설계기법을 제안하며 특히 곡면에 구속된 빔 구조물의 설계를 집중적으로 다룬다. 자유형상변형(Free-form deformation)기법과 전역 곡선 보간기법을 활용하여 직사각 평면에서 형상 및 설계 변수를 정의하고 곡면상의 곡선 형상을 나타내는 조정점 위치를 해석적으로 표현할 수 있으며 이의 전미분을 통해 정확한 설계속도장을 계산한다. 이를 통해 설계 변수의 개수를 줄일 수 있고 설계의 매개화가 간편해진다. 개발된 방법론은 다양한 하중 및 운동학적 경계조건을 갖는 빔과 쉘의 대변형 문제를 통해 검증되며 여러가지 휘어진 조립 구조물의 최적 설계에 적용된다. 대표적으로, 전단 강성 및 충격 흡수 특성과 같은 기계적 물성치의 개선을 위해 활용되는 오그제틱 (auxetic) 특성이 극대화된 격자 구조를 설계하며 인장 및 압축 대변형 모두에서 일정한 음의 포아송비를 나타냄을 3차원 프린팅과 광학적 변형 측정 기술을 이용하여 실험적으로 검증한다. 또한 우리는 소음의 저감을 위해 활용되는 가청 저주파수 영역대에서의 밴드갭이 극대화된 격자 구조를 제시한다.Abstract
1. Introduction
2. Isogeometric analysis of geometrically exact nonlinear structures
3. Isogeometric confinguration DSA of geometrically exact nonlinear structures
4. Numerical examples
5. Conclusions and future works
A. Supplements to the geometrically exact Kirchhoff beam model
B. Supplements to the geometrically exact shear-deformable beam model
C. Supplements to the geometrically exact shear-deformable shell model
D. Supplements to the invariant formulations
E. Supplements to the geometric constraints in design optimization
F. Supplements to the design of auxetic structures
초록Docto
A Revisit of Shape Editing Techniques: from the Geometric to the Neural Viewpoint
3D shape editing is widely used in a range of applications such as movie
production, computer games and computer aided design. It is also a popular
research topic in computer graphics and computer vision. In past decades,
researchers have developed a series of editing methods to make the editing
process faster, more robust, and more reliable. Traditionally, the deformed
shape is determined by the optimal transformation and weights for an energy
term. With increasing availability of 3D shapes on the Internet, data-driven
methods were proposed to improve the editing results. More recently as the deep
neural networks became popular, many deep learning based editing methods have
been developed in this field, which is naturally data-driven. We mainly survey
recent research works from the geometric viewpoint to those emerging neural
deformation techniques and categorize them into organic shape editing methods
and man-made model editing methods. Both traditional methods and recent neural
network based methods are reviewed
Methods for constraint-based conceptual free-form surface design
Zusammenfassung
Der constraint-basierte Entwurf von Freiformfl„chen ist eine m„chtige Methode im
Computer gest�tzten Entwurf. Bekannte Realisierungen beschr„nken sich jedoch meist
auf Interpolation von Rand- und isoparametrischen Kurven. In diesem Zusammenhang
sind die sog. "Multi-patch" Methoden die am weitesten verbreitete Vorgehensweise. Hier
versucht man Fl„chenverb„nde aus einem Netz von dreidimensionalen Kurven (oft
gemischt mit unstrukturierten Punktewolken) derart zu generieren, dass die Kurven und
Punkte von den Fl„chen interpoliert werden. Die Kurven werden als R„nder von
rechteckigen oder dreieckigen bi-polynomialen oder polynomialen Fl„chen betrachtet.
Unter dieser Einschr„nkung leidet die Flexibilit„t des Verfahrens. In dieser Dissertation
schlagen wir vor, beliebige, d.h. auch nicht iso-parametrische, Kurven zu verwenden.
Dadurch ergeben sich folgende Vorteile: Erstens kann so beispielsweise eine B-spline
Fl„che entlang einer benutzerdefinierten Kurve verformt werden w„hrend andere Kurven
oder Punkte fixiert sind. Zweitens, kann eine B-spline Fl„che Kurven interpolieren, die sich
nicht auf iso-parametrische Linien der Fl„che abbilden lassen. Wir behandeln drei Arten
von Constraints: Inzidenz einer beliebigen Kurve auf einer B-spline Fl„che, Fixieren von
Fl„chennormalen entlang einer beliebigen Kurve (dieser Constraint dient zur Herstellung
von tangentialen šberg„ngen zwischen zwei Fl„chen) und die sog. Variational
Constrains. Letztere dienen unter anderem zur Optimierung der physikalischen und
optischen Eigenschaften der Fl„chen. Es handelt sich hierbei um die Gausschen
Normalgleichungen der Fl„chenfunktionale zweiter Ordnung, wie sie in der Literatur
bekannt sind.
Die Dissertation gliedert sich in zwei Teile. Der erste Teil befasst sich mit der Aufstellung
der linearen Gleichungssysteme, welche die oben erw„hnten Constraints repr„sentieren.
Der zweite Teil behandelt Methoden zum L”sen dieser Gleichungssysteme. Der Kern des
ersten Teiles ist die Erweiterung und Generalisierung des auf Polarformen (Blossoms)
basierenden Algorithmus f�r Verkettung von Polynomen auf Bezier und B-spline Basis:
Gegeben sei eine B-spline Fl„che und eine B-spline Kurve im Parameterraum der Fl„che.
Wir zeigen, dass die Kontrollpunkte der dreidimensionalen Fl„chenkurve, welche als
polynomiale Verkettung der beiden definiert ist, durch eine im Voraus berechenbare
lineare Tranformation (eine Matrix) der Fl„chenkontrollpunkte ausgedr�ckt werden
k”nnen. Dadurch k”nnen Inzidenzbeziehungen zwischen Kurven und Fl„chen exakt und
auf eine sehr elegante und kompakte Art definiert werden. Im Vergleich zu den bekannten
Methoden ist diese Vorgehensweise effizienter, numerisch stabiler und erh”ht nicht die
Konditionszahl der zu l”senden linearen Gleichungen. Die Effizienz wird erreicht durch
Verwendung von eigens daf�r entwickelten Datenstrukturen und sorgf„ltige Analyse von
kombinatorischen Eigenschaften von Polarformen. Die Gleichungen zur Definition von
Tangentialit„ts- und Variational Constraints werden als Anwendung und Erweiterung
dieses Algorithmus implementiert. Beschrieben werden auch symbolische und
numerische Operationen auf B-spline Polynomen (Multiplikation, Differenzierung,
Integration). Dabei wird konsistent die Matrixdarstellung von B-spline Polynomen
verwendet.
Das L”sen dieser Art von Constraintproblemen bedeutet das Finden der Kontrollpunkte
einer B-spline Fl„che derart, dass die definierten Bedingungen erf�llt werden. Dies wird
durch L”sen von, im Allgemeinen, unterbestimmten und schlecht konditionierten linearen
Gleichungssystemen bewerkstelligt. Da in solchen F„llen keine eindeutige, numerisch
stabile L”sung existiert, f�hren die �blichen Methoden zum L”sen von linearen
Gleichungssystemen nicht zum Erfolg. Wir greifen auf die Anwendung von sog.
Regularisierungsmethoden zur�ck, die auf der Singul„rwertzerlegung (SVD) der
Systemmatrix beruhen. Insbesondere wird die L-curve eingesetzt, ein "numerischer
Hochfrequenzfilter", der uns in die Lage versetzt eine stabile L”sung zu berechnen.
Allerdings reichen auch diese Methoden im Allgemeinen nicht aus, eine Fl„che zu
generieren, welche die erw�nschten „sthetischen und physikalischen Eigenschaften
besitzt. Verformt man eine Tensorproduktfl„che entlang einer nicht isoparametrischen
Kurve, entstehen unerw�nschte Oszillationen und Verformungen. Dieser Effekt wird
"Surface-Aliasing" genannt. Wir stellen zwei Methoden vor um diese Aliasing-Effekte zu
beseitigen: Die erste Methode wird vorzugsweise f�r Deformationen einer existierenden
B-spline Fl„che entlang einer nicht isoparametrischen Kurve angewendet. Es erfogt eine
Umparametrisierung der zu verformenden Fl„che derart, dass die Kurve in der neuen
Fl„che auf eine isoparametrische Linie abgebildet wird. Die Umparametrisierung einer B-
spline Fl„che ist keine abgeschlossene Operation; die resultierende Fl„che besitzt i.A.
keine B-spline Darstellung. Wir berechnen eine beliebig genaue Approximation der
resultierenden Fl„che mittels Interpolation von Kurvennetzen, die von der
umzuparametrisierenden Fl„che gewonnen werden. Die zweite Methode ist rein
algebraisch: Es werden zus„tzliche Bedingungen an die L”sung des Gleichungssystems
gestellt, die die Aliasing-Effekte unterdr�cken oder ganz beseitigen. Es wird ein
restriktionsgebundenes Minimum einer Zielfunktion gesucht, deren globales Minimum bei
"optimaler" Form der Fl„che eingenommen wird. Als Zielfunktionen werden
Gl„ttungsfunktionale zweiter Ordnung eingesetzt. Die stabile L”sung eines solchen
Optimierungsproblems kann aufgrund der nahezu linearen Abh„ngigkeit des Gleichungen
nur mit Hilfe von Regularisierungsmethoden gewonnen werden, welche die vorgegebene
Zielfunktion ber�cksichtigen. Wir wenden die sog. Modifizierte Singul„rwertzerlegung in
Verbindung mit dem L-curve Filter an. Dieser Algorithmus minimiert den Fehler f�r die
geometrischen Constraints so, dass die L”sung gleichzeitig m”glichst nah dem Optimum
der Zielfunktion ist.The constrained-based design of free-form surfaces is currently limited to tensor-product
interpolation of orthogonal curve networks or equally spaced grids of points. The, so-
called, multi-patch methods applied mainly in the context of scattered data interpolation
construct surfaces from given boundary curves and derivatives along them. The limitation
to boundary curves or iso-parametric curves considerably lowers the flexibility of this
approach. In this thesis, we propose to compute surfaces from arbitrary (that is, not only
iso-parametric) curves. This allows us to deform a B-spline surface along an arbitrary
user-defined curve, or, to interpolate a B-spline surface through a set of curves which
cannot be mapped to iso-parametric lines of the surface. We consider three kinds of
constraints: the incidence of a curve on a B-spline surface, prescribed surface normals
along an arbitrary curve incident on a surface and the, so-called, variational constraints
which enforce a physically and optically advantageous shape of the computed surfaces.
The thesis is divided into two parts: in the first part, we describe efficient methods to set
up the equations for above mentioned linear constraints between curves and surfaces. In
the second part, we discuss methods for solving such constraints. The core of the first part
is the extension and generalization of the blossom-based polynomial composition
algorithm for B-splines: let be given a B-spline surface and a B-spline curve in the domain
of that surface. We compute a matrix which represents a linear transformation of the
surface control points such that after the transformation we obtain the control points of the
curve representing the polynomial composition of the domain curve and the surface. The
result is a 3D B-spline curve always exactly incident on the surface. This, so-called,
composition matrix represents a set of linear curve-surface incidence constraints.
Compared to methods used previously our approach is more efficient, numerically more
stable and does not unnecessarily increase the condition number of the matrix. The thesis
includes a careful analysis of the complexity and combinatorial properties of the algorithm.
We also discuss topics regarding algebraic operations on B-spline polynomials
(multiplication, differentiation, integration). The matrix representation of B-spline
polynomials is used throughout the thesis. We show that the equations for tangency and
variational constraints are easily obtained re-using the methods elaborated for incidence
constraints.
The solving of generalized curve-surface constraints means to find the control points of
the unknown surface given one or several curves incident on that surface. This is
accomplished by solving of large and, generally, under-determined and badly conditioned
linear systems of equations. In such cases, no unique and numerically stable solution
exists. Hence, the usual methods such as Gaussian elimination or QR-decomposition
cannot be applied in straightforward manner. We propose to use regularization methods
based on Singular Value Decomposition (SVD). We apply the so-called L-curve, which
can be seen as an numerical high-frequency filter. The filter automatically singles out a
stable solution such that best possible satisfaction of defined constraints is achieved.
However, even the SVD along with the L-curve filter cannot be applied blindly: it turns out
that it is not sufficient to require only algebraic stability of the solution. Tensor-product
surfaces deformed along arbitrary incident curves exhibit unwanted deformations due to
the rectangular structure of the model space. We discuss a geometric and an algebraic
method to remove this, so-called, Surface aliasing effect. The first method reparametrizes
the surface such that a general curve constraint is converted to iso-parametric curve
constraint which can be easily solved by standard linear algebra methods without aliasing.
The reparametrized surface is computed by means of the approximated surface-surface
composition algorithm, which is also introduced in this thesis. While this is not possible
symbolically, an arbitrary accurate approximation of the resulting surface is obtained using
constrained curve network interpolation. The second method states additional constraints
which suppress or completely remove the aliasing. Formally we solve a constrained least
square approximation problem: we minimize an surface objective function subject to
defined curve constraints. The objective function is chosen such that it takes in the
minimal value if the surface has optimal shape; we use a linear combination of second
order surface smoothing functionals. When solving such problems we have to deal with
nearly linearly dependent equations. Problems of this type are called ill-posed. Therefore
sophisticated numerical methods have to be applied in order to obtain a set of degrees of
freedom (control points of the surface) which are sufficient to satisfy given constraints. The
remaining unused degrees of freedom are used to enforce an optically pleasing shape of
the surface. We apply the Modified Truncated SVD (MTSVD) algorithm in connection with
the L-curve filter which determines a compromise between an optically pleasant shape of
the surface and constraint satisfaction in a particularly efficient manner
Robust Cardiac Motion Estimation using Ultrafast Ultrasound Data: A Low-Rank-Topology-Preserving Approach
Cardiac motion estimation is an important diagnostic tool to detect heart
diseases and it has been explored with modalities such as MRI and conventional
ultrasound (US) sequences. US cardiac motion estimation still presents
challenges because of the complex motion patterns and the presence of noise. In
this work, we propose a novel approach to estimate the cardiac motion using
ultrafast ultrasound data. -- Our solution is based on a variational
formulation characterized by the L2-regularized class. The displacement is
represented by a lattice of b-splines and we ensure robustness by applying a
maximum likelihood type estimator. While this is an important part of our
solution, the main highlight of this paper is to combine a low-rank data
representation with topology preservation. Low-rank data representation
(achieved by finding the k-dominant singular values of a Casorati Matrix
arranged from the data sequence) speeds up the global solution and achieves
noise reduction. On the other hand, topology preservation (achieved by
monitoring the Jacobian determinant) allows to radically rule out distortions
while carefully controlling the size of allowed expansions and contractions.
Our variational approach is carried out on a realistic dataset as well as on a
simulated one. We demonstrate how our proposed variational solution deals with
complex deformations through careful numerical experiments. While maintaining
the accuracy of the solution, the low-rank preprocessing is shown to speed up
the convergence of the variational problem. Beyond cardiac motion estimation,
our approach is promising for the analysis of other organs that experience
motion.Comment: 15 pages, 10 figures, Physics in Medicine and Biology, 201
Efficient dense non-rigid registration using the free-form deformation framework
Medical image registration consists of finding spatial correspondences between two images or more. It
is a powerful tool which is commonly used in various medical image processing tasks. Even though
medical image registration has been an active topic of research for the last two decades, significant
challenges in the field remain to be solved. This thesis addresses some of these challenges through
extensions to the Free-Form Deformation (FFD) registration framework, which is one of the most widely
used and well-established non-rigid registration algorithm.
Medical image registration is a computationally expensive task because of the high degrees of freedom
of the non-rigid transformations. In this work, the FFD algorithm has been re-factored to enable
fast processing, while maintaining the accuracy of the results. In addition, parallel computing paradigms
have been employed to provide near real-time image registration capabilities. Further modifications have
been performed to improve the registration robustness to artifacts such as tissues non-uniformity. The
plausibility of the generated deformation field has been improved through the use of bio-mechanical
models based regularization. Additionally, diffeomorphic extensions to the algorithm were also developed.
The work presented in this thesis has been extensively validated using brain magnetic resonance
imaging of patients diagnosed with dementia or patients undergoing brain resection. It has also been
applied to lung X-ray computed tomography and imaging of small animals.
Alongside with this thesis an open-source package, NiftyReg, has been developed to release the
presented work to the medical imaging community
- …