3,451 research outputs found
Procedural Modeling and Physically Based Rendering for Synthetic Data Generation in Automotive Applications
We present an overview and evaluation of a new, systematic approach for
generation of highly realistic, annotated synthetic data for training of deep
neural networks in computer vision tasks. The main contribution is a procedural
world modeling approach enabling high variability coupled with physically
accurate image synthesis, and is a departure from the hand-modeled virtual
worlds and approximate image synthesis methods used in real-time applications.
The benefits of our approach include flexible, physically accurate and scalable
image synthesis, implicit wide coverage of classes and features, and complete
data introspection for annotations, which all contribute to quality and cost
efficiency. To evaluate our approach and the efficacy of the resulting data, we
use semantic segmentation for autonomous vehicles and robotic navigation as the
main application, and we train multiple deep learning architectures using
synthetic data with and without fine tuning on organic (i.e. real-world) data.
The evaluation shows that our approach improves the neural network's
performance and that even modest implementation efforts produce
state-of-the-art results.Comment: The project web page at
http://vcl.itn.liu.se/publications/2017/TKWU17/ contains a version of the
paper with high-resolution images as well as additional materia
The role of topology and mechanics in uniaxially growing cell networks
In biological systems, the growth of cells, tissues, and organs is influenced
by mechanical cues. Locally, cell growth leads to a mechanically heterogeneous
environment as cells pull and push their neighbors in a cell network. Despite
this local heterogeneity, at the tissue level, the cell network is remarkably
robust, as it is not easily perturbed by changes in the mechanical environment
or the network connectivity. Through a network model, we relate global tissue
structure (i.e. the cell network topology) and local growth mechanisms (growth
laws) to the overall tissue response. Within this framework, we investigate the
two main mechanical growth laws that have been proposed: stress-driven or
strain-driven growth. We show that in order to create a robust and stable
tissue environment, networks with predominantly series connections are
naturally driven by stress-driven growth, whereas networks with predominantly
parallel connections are associated with strain-driven growth
09451 Abstracts Collection -- Geometric Networks, Metric Space Embeddings and Spatial Data Mining
From November 1 to 6, 2009, the Dagstuhl Seminar 09451 ``Geometric Networks, Metric Space Embeddings and Spatial Data Mining\u27\u27 was held
in Schloss Dagstuhl~--~Leibniz Center for Informatics.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
Controlling motile disclinations in a thick nematogenic material with an electric field
Manipulating topological disclination networks that arise in a
symmetry-breaking phase transfor- mation in widely varied systems including
anisotropic materials can potentially lead to the design of novel materials
like conductive microwires, self-assembled resonators, and active anisotropic
matter. However, progress in this direction is hindered by a lack of control of
the kinetics and microstructure due to inherent complexity arising from
competing energy and topology. We have studied thermal and electrokinetic
effects on disclinations in a three-dimensional nonabsorbing nematic material
with a positive and negative sign of the dielectric anisotropy. The electric
flux lines are highly non-uniform in uniaxial media after an electric field
below the Fr\'eedericksz threshold is switched on, and the kinetics of the
disclination lines is slowed down. In biaxial media, depending on the sign of
the dielectric anisotropy, apart from the slowing down of the disclination
kinetics, a non-uniform electric field filters out disclinations of different
topology by inducing a kinetic asymmetry. These results enhance the current
understanding of forced disclination networks and establish the pre- sented
method, which we call fluctuating electronematics, as a potentially useful tool
for designing materials with novel properties in silico.Comment: 17 Pages, 14 Figure
Actuation performances of anisotropic gels
We investigated the actuation performances of anisotropic gels driven by
mechanical and chemical stimuli, in terms of both deformation processes and
stroke--curves, and distinguished between the fast response of gels before
diffusion starts and the asymptotic response attained at the steady state. We
also showed as the range of forces that an anisotropic hydrogel can exert when
constrained is especially wide;indeed, changing fiber orientation allows to
induce shear as well as transversely isotropic extensions.Comment: 11 pages, 11 figure
Geometric Dilation and Halving Distance
Let us consider the network of streets of a city represented by a geometric graph G in the plane. The vertices of G represent the crossroads and the edges represent the streets. The latter do not have to be straight line segments, they may be curved. If one wants to drive from a place p to some other place q, normally the length of the shortest path along streets, d_G(p,q), is bigger than the airline distance (Euclidean distance) |pq|. The (relative) DETOUR is defined as delta_G(p,q) := d_G(p,q)/|pq|. The supremum of all these ratios is called the GEOMETRIC DILATION of G. It measures the quality of the network. A small dilation value guarantees that there is no bigger detour between any two points. Given a finite point set S, we would like to know the smallest possible dilation of any graph that contains the given points on its edges. We call this infimum the DILATION of S and denote it by delta(S). The main results of this thesis are - a general upper bound to the dilation of any finite point set S, delta(S) - a lower bound for a specific set P, delta(P)>(1+10^(-11))pi/2, which approximately equals 1.571 In order to achieve these results, we first consider closed curves. Their dilation depends on the HALVING PAIRS, pairs of points which divide the closed curve in two parts of equal length. In particular the distance between the two points is essential, the HALVING DISTANCE. A transformation technique based on halving pairs, the HALVING PAIR TRANSFORMATION, and the curve formed by the midpoints of the halving pairs, the MIDPOINT CURVE, help us to derive lower bounds to dilation. For constructing graphs of small dilation, we use ZINDLER CURVES. These are closed curves of constant halving distance. To give a structured overview, the mathematical apparatus for deriving the main results of this thesis includes - upper bound: * the construction of certain Zindler curves to generate a periodic graph of small dilation * an embedding argument based on a number theoretical result by Dirichlet - lower bound: * the formulation and analysis of the halving pair transformation * a stability result for the dilation of closed curves based on this transformation and the midpoint curve * the application of a disk-packing result In addition, this thesis contains - a detailed analysis of the dilation of closed curves - a collection of inequalities, which relate halving distance to other important quantities from convex geometry, and their proofs; including four new inequalities - the rediscovery of Zindler curves and a compact presentation of their properties - a proof of the applied disk packing result.Geometrische Dilation und Halbierungsabstand Man kann das von den Straßen einer Stadt gebildete Netzwerk durch einen geometrischen Graphen in der Ebene darstellen. Die Knoten dieses Graphen repräsentieren die Kreuzungen und die Kanten sind die Straßen. Letztere müssen nicht geradlinig sein, sondern können beliebig gekrümmt sein. Wenn man nun von einem Ort p zu einem anderen Ort q fahren möchte, dann ist normalerweise die Länge des kürzesten Pfades über Straßen, d_G(p,q), länger als der Luftlinienabstand (euklidischer Abstand) |pq|. Der (relative) UMWEG (DETOUR) ist definiert als delta_G(p,q) := d_G(p,q)/|pq|. Das Supremum all dieser Brüche wird GEOMETRISCHE DILATION (GEOMETRIC DILATION) von G genannt. Es ist ein Maß für die Qualität des Straßennetzes. Ein kleiner Dilationswert garantiert, dass es keinen größeren Umweg zwischen beliebigen zwei Punkten gibt. Für eine gegebene endliche Punktmenge S würden wir nun gerne bestimmen, was der kleinste Dilationswert ist, den wir mit einem Graphen erreichen können, der die gegebenen Punkte auf seinen Kanten enthält. Dieses Infimum nennen wir die DILATION von S und schreiben kurz delta(S). Die Haupt-Ergebnisse dieser Arbeit sind - eine allgemeine obere Schranke für die Dilation jeder beliebigen endlichen Punktmenge S: delta(S) - eine untere Schranke für eine bestimmte Menge P: delta(P)>(1+10^(-11))pi/2, was ungefähr der Zahl 1.571 entspricht Um diese Ergebnisse zu erreichen, betrachten wir zunächst geschlossene Kurven. Ihre Dilation hängt von sogenannten HALBIERUNGSPAAREN (HALVING PAIRS) ab. Das sind Punktpaare, die die geschlossene Kurve in zwei Teile gleicher Länge teilen. Besonders der Abstand der beiden Punkte ist von Bedeutung, der HALBIERUNGSABSTAND (HALVING DISTANCE). Eine auf den Halbierungspaaren aufbauende Transformation, die HALBIERUNGSPAARTRANSFORMATION (HALVING PAIR TRANSFORMATION), und die von den Mittelpunkten der Halbierungspaare gebildete Kurve, die MITTELPUNKTKURVE (MIDPOINT CURVE), helfen uns untere Dilationsschranken herzuleiten. Zur Konstruktion von Graphen mit kleiner Dilation benutzen wir ZINDLERKURVEN (ZINDLER CURVES). Dies sind geschlossene Kurven mit konstantem Halbierungspaarabstand. Die mathematischen Hilfsmittel, mit deren Hilfe wir schließlich die Hauptresultate beweisen, sind unter anderem - obere Schranke: * die Konstruktion von bestimmten Zindlerkurven, mit denen periodische Graphen kleiner Dilation gebildet werden können * ein Einbettungsargument, das einen zahlentheoretischen Satz von Dirichlet benutzt - untere Schranke: * die Definition und Analyse der Halbierungspaartransformation * ein Stabilitätsresultat für die Dilation geschlossener Kurven, das auf dieser Transformation und der Mittelpunktkurve basiert * die Anwendung eines Kreispackungssatzes Zusätzlich enthält diese Dissertation - eine detaillierte Analyse der Dilation geschlossener Kurven - eine Sammlung von Ungleichungen, die den Halbierungsabstand zu anderen wichtigen Größen der Konvexgeometrie in Beziehung setzen, und ihre Beweise; inklusive vier neuer Ungleichungen - die Wiederentdeckung von Zindlerkurven und eine kompakte Darstellung ihrer Eigenschaften - einen Beweis des angewendeten Kreispackungssatzes
- …