Search results for "Euclidean"
showing 10 items of 185 documents
G. Herglotz’ Behandlung von Beschleunigungswellen in seiner Vorlesung «Mechanik der Kontinua» angewandt auf die Stosswellen von Christoffel
1981
Following a lecture delivered by Herglotz in 1925/26 we briefly treat acceleration waves in hyperelastic materials. Our main result is a divergence equation for the squared Euclidean norm of the so-called ‘wave vector’. We then apply Herglotz’ method (devised for acceleration waves) to the propagation of such first order discontinuities in elastic bodies as were treated by Christoffel in [1].
Modeling the Mechanical Behavior of the Breast Tissues Under Compression in Real Time
2017
This work presents a data-driven model to simulate the mechanical behavior of the breast tissues in real time. The aim of this model is to speed up some multimodal registration algorithms, as well as some image-guided interventions. Ten virtual breast phantoms were used in this work. Their deformation during a mammography was performed off-line using the finite element method. Three machine learning models were trained with the data from those simulations. Then, they were used to predict the deformation of the breast tissues. The models were a decision tree and two ensemble methods (extremely randomized trees and random forest). Four experiments were designed to assess the performance of th…
Universal natural shapes: From unifying shape description to simple methods for shape analysis and boundary value problems
2012
Gielis curves and surfaces can describe a wide range of natural shapes and they have been used in various studies in biology and physics as descriptive tool. This has stimulated the generalization of widely used computational methods. Here we show that proper normalization of the Levenberg-Marquardt algorithm allows for efficient and robust reconstruction of Gielis curves, including self-intersecting and asymmetric curves, without increasing the overall complexity of the algorithm. Then, we show how complex curves of k-type can be constructed and how solutions to the Dirichlet problem for the Laplace equation on these complex domains can be derived using a semi-Fourier method. In all three …
RootsGLOH2: embedding RootSIFT 'square rooting' in sGLOH2
2020
This study introduces an extension of the shifting gradient local orientation histogram doubled (sGLOH2) local image descriptor inspired by RootSIFT ‘square rooting’ as a way to indirectly alter the matching distance used to compare the descriptor vectors. The extended descriptor, named RootsGLOH2, achieved the best results in terms of matching accuracy and robustness among the latest state-of-the-art non-deep descriptors in recent evaluation contests dealing with both planar and non-planar scenes. RootsGLOH2 also achieves a matching accuracy very close to that obtained by the best deep descriptors to date. Beside confirming that ‘square rooting’ has beneficial effects on sGLOH2 as it happe…
Distributed and proximity-constrained C-means for discrete coverage control
2018
In this paper we present a novel distributed coverage control framework for a network of mobile agents, in charge of covering a finite set of points of interest (PoI), such as people in danger, geographically dispersed equipment or environmental landmarks. The proposed algorithm is inspired by C-Means, an unsupervised learning algorithm originally proposed for non-exclusive clustering and for identification of cluster centroids from a set of observations. To cope with the agents' limited sensing range and avoid infeasible coverage solutions, traditional C-Means needs to be enhanced with proximity constraints, ensuring that each agent takes into account only neighboring PoIs. The proposed co…
Combinatorial proofs of two theorems of Lutz and Stull
2021
Recently, Lutz and Stull used methods from algorithmic information theory to prove two new Marstrand-type projection theorems, concerning subsets of Euclidean space which are not assumed to be Borel, or even analytic. One of the theorems states that if $K \subset \mathbb{R}^{n}$ is any set with equal Hausdorff and packing dimensions, then $$ \dim_{\mathrm{H}} π_{e}(K) = \min\{\dim_{\mathrm{H}} K,1\} $$ for almost every $e \in S^{n - 1}$. Here $π_{e}$ stands for orthogonal projection to $\mathrm{span}(e)$. The primary purpose of this paper is to present proofs for Lutz and Stull's projection theorems which do not refer to information theoretic concepts. Instead, they will rely on combinatori…
Topological Logics with Connectedness over Euclidean Spaces
2013
We consider the quantifier-free languages, Bc and Bc °, obtained by augmenting the signature of Boolean algebras with a unary predicate representing, respectively, the property of being connected, and the property of having a connected interior. These languages are interpreted over the regular closed sets of R n ( n ≥ 2) and, additionally, over the regular closed semilinear sets of R n . The resulting logics are examples of formalisms that have recently been proposed in the Artificial Intelligence literature under the rubric Qualitative Spatial Reasoning. We prove that the satisfiability problem for Bc is undecidable over the regular closed semilinear sets in all dimensions greater than 1,…
On the Structure of Bispecial Sturmian Words
2013
A balanced word is one in which any two factors of the same length contain the same number of each letter of the alphabet up to one. Finite binary balanced words are called Sturmian words. A Sturmian word is bispecial if it can be extended to the left and to the right with both letters remaining a Sturmian word. There is a deep relation between bispecial Sturmian words and Christoffel words, that are the digital approximations of Euclidean segments in the plane. In 1997, J. Berstel and A. de Luca proved that \emph{palindromic} bispecial Sturmian words are precisely the maximal internal factors of \emph{primitive} Christoffel words. We extend this result by showing that bispecial Sturmian wo…
Solution for the fragment-size distribution in a crack-branching model of fragmentation
2007
It is well established that rapidly propagating cracks in brittle material are unstable such that they generate side branches. It is also known that cracks are attracted by free surfaces, which means that they attract each other. This information is used here to formulate a generic model of fragmentation in which the small-size part of the fragment-size distribution results from merged crack branches in the damage zones along the paths of the propagating cracks. This model is solved under rather general assumptions for the fragment-size distribution. The model leads to a generic distribution S(-gamma) exp(-S/S(0)) for fragment sizes S, where gamma = 2d-1/d with d the Euclidean dimension, an…
On the fusion problem for degenerate elliptic equations
1995
Let F be a relatively closed subset of a Euclidean domain Ω. We investigate when solutions u to certain elliptic equations on Ω/F are restrictions of solutions on all of Ω. Specifically, we show that if ∂F is not too large, and u has a suitable decay rate near F, then u can be so extended.