179 research outputs found
A variational approach for viewpoint-based visibility maximization
We present a variational method for unfolding of the cortex based on a user-chosen point of view as an alternative to more traditional global flattening methods, which incur more distortion around the region of interest. Our approach involves three novel contributions. The first is an energy function and its corresponding gradient flow to measure the average visibility of a region of interest of a surface from a given viewpoint. The second is an additional energy function and flow designed to preserve the 3D topology of the evolving surface. This latter contribution receives significant focus in this thesis as it is crucial to obtain the desired unfolding effect derived from the first energy functional and flow. Without it, the resulting topology changes render the unconstrained evolution uninteresting for the purpose of cortical visualization, exploration, and inspection. The third is a method that dramatically improves the computational speed of the 3D topology-preservation approach by creating a tree structure of the triangulated surface and using a recursion technique.Ph.D.Committee Chair: Allen R. Tannenbaum; Committee Member: Anthony J. Yezzi; Committee Member: Gregory Turk; Committee Member: Joel R. Jackson; Committee Member: Patricio A. Vel
Shape Calculus for Shape Energies in Image Processing
Many image processing problems are naturally expressed as energy minimization
or shape optimization problems, in which the free variable is a shape, such as
a curve in 2d or a surface in 3d. Examples are image segmentation, multiview
stereo reconstruction, geometric interpolation from data point clouds. To
obtain the solution of such a problem, one usually resorts to an iterative
approach, a gradient descent algorithm, which updates a candidate shape
gradually deforming it into the optimal shape. Computing the gradient descent
updates requires the knowledge of the first variation of the shape energy, or
rather the first shape derivative. In addition to the first shape derivative,
one can also utilize the second shape derivative and develop a Newton-type
method with faster convergence. Unfortunately, the knowledge of shape
derivatives for shape energies in image processing is patchy. The second shape
derivatives are known for only two of the energies in the image processing
literature and many results for the first shape derivative are limiting, in the
sense that they are either for curves on planes, or developed for a specific
representation of the shape or for a very specific functional form in the shape
energy. In this work, these limitations are overcome and the first and second
shape derivatives are computed for large classes of shape energies that are
representative of the energies found in image processing. Many of the formulas
we obtain are new and some generalize previous existing results. These results
are valid for general surfaces in any number of dimensions. This work is
intended to serve as a cookbook for researchers who deal with shape energies
for various applications in image processing and need to develop algorithms to
compute the shapes minimizing these energies
Network Geometry
Networks are finite metric spaces, with distances defined by the shortest paths between nodes. However, this is not the only form of network geometry: two others are the geometry of latent spaces underlying many networks and the effective geometry induced by dynamical processes in networks. These three approaches to network geometry are intimately related, and all three of them have been found to be exceptionally efficient in discovering fractality, scale invariance, self-similarity and other forms of fundamental symmetries in networks. Network geometry is also of great use in a variety of practical applications, from understanding how the brain works to routing in the Internet. We review the most important theoretical and practical developments dealing with these approaches to network geometry and offer perspectives on future research directions and challenges in this frontier in the study of complexity
Computational study of resting state network dynamics
Lo scopo di questa tesi è quello di mostrare, attraverso una simulazione con il software The Virtual Brain, le più importanti proprietà della dinamica cerebrale durante il resting state, ovvero quando non si è coinvolti in nessun compito preciso e non si è sottoposti a nessuno stimolo particolare. Si comincia con lo spiegare cos’è il resting state attraverso una breve revisione storica della sua scoperta, quindi si passano in rassegna alcuni metodi sperimentali utilizzati nell’analisi dell’attività cerebrale, per poi evidenziare la differenza tra connettività strutturale e funzionale. In seguito, si riassumono brevemente i concetti dei sistemi dinamici, teoria indispensabile per capire un sistema complesso come il cervello. Nel capitolo successivo, attraverso un approccio ‘bottom-up’, si illustrano sotto il profilo biologico le principali strutture del sistema nervoso, dal neurone alla corteccia cerebrale. Tutto ciò viene spiegato anche dal punto di vista dei sistemi dinamici, illustrando il pionieristico modello di Hodgkin-Huxley e poi il concetto di dinamica di popolazione. Dopo questa prima parte preliminare si entra nel dettaglio della simulazione. Prima di tutto si danno maggiori informazioni sul software The Virtual Brain, si definisce il modello di network del resting state utilizzato nella simulazione e si descrive il ‘connettoma’ adoperato. Successivamente vengono mostrati i risultati dell’analisi svolta sui dati ricavati, dai quali si mostra come la criticità e il rumore svolgano un ruolo chiave nell'emergenza di questa attività di fondo del cervello. Questi risultati vengono poi confrontati con le più importanti e recenti ricerche in questo ambito, le quali confermano i risultati del nostro lavoro. Infine, si riportano brevemente le conseguenze che porterebbe in campo medico e clinico una piena comprensione del fenomeno del resting state e la possibilità di virtualizzare l’attività cerebrale
French Roadmap for complex Systems 2008-2009
This second issue of the French Complex Systems Roadmap is the outcome of the
Entretiens de Cargese 2008, an interdisciplinary brainstorming session
organized over one week in 2008, jointly by RNSC, ISC-PIF and IXXI. It
capitalizes on the first roadmap and gathers contributions of more than 70
scientists from major French institutions. The aim of this roadmap is to foster
the coordination of the complex systems community on focused topics and
questions, as well as to present contributions and challenges in the complex
systems sciences and complexity science to the public, political and industrial
spheres
Point-set manifold processing for computational mechanics: thin shells, reduced order modeling, cell motility and molecular conformations
In many applications, one would like to perform calculations on smooth manifolds of dimension d embedded in a high-dimensional space of dimension D. Often, a continuous description of such manifold is not known, and instead it is sampled by a set of scattered points in high dimensions. This poses a serious challenge. In this thesis, we approximate the point-set manifold as an overlapping set of smooth parametric descriptions, whose geometric structure is revealed by statistical learning methods, and then parametrized by meshfree methods. This approach avoids any global parameterization, and hence is applicable to manifolds of any genus and complex geometry. It combines four ingredients: (1) partitioning of the point set into subregions of trivial topology, (2) the automatic detection of the local geometric structure of the manifold by nonlinear dimensionality reduction techniques, (3) the local parameterization of the manifold using smooth meshfree (here local maximum-entropy) approximants, and (4) patching together the local representations by means of a partition of unity.
In this thesis we show the generality, flexibility, and accuracy of the method in four different problems. First, we exercise it in the context of Kirchhoff-Love thin shells, (d=2, D=3). We test our methodology against classical linear and non linear benchmarks in thin-shell analysis, and highlight its ability to handle point-set surfaces of complex topology and geometry. We then tackle problems of much higher dimensionality. We perform reduced order modeling in the context of finite deformation elastodynamics, considering a nonlinear reduced configuration space, in contrast with classical linear approaches based on Principal Component Analysis (d=2, D=10000's). We further quantitatively unveil the geometric structure of the motility strategy of a family of micro-organisms called Euglenids from experimental videos (d=1, D~30000's). Finally, in the context of enhanced sampling in molecular dynamics, we automatically construct collective variables for the molecular conformational dynamics (d=1...6, D~30,1000's)
New Directions for Contact Integrators
Contact integrators are a family of geometric numerical schemes which
guarantee the conservation of the contact structure. In this work we review the
construction of both the variational and Hamiltonian versions of these methods.
We illustrate some of the advantages of geometric integration in the
dissipative setting by focusing on models inspired by recent studies in
celestial mechanics and cosmology.Comment: To appear as Chapter 24 in GSI 2021, Springer LNCS 1282
- …