Application of the Fisher-Rao metric to ellipse detection

The parameter space for the ellipses in a two dimensional image is a five dimensional manifold, where each point of the manifold corresponds to an ellipse in the image. The parameter space becomes a Riemannian manifold under a Fisher-Rao metric, which is derived from a Gaussian model for the blurring of ellipses in the image. Two points in the parameter space are close together under the Fisher-Rao metric if the corresponding ellipses are close together in the image. The Fisher-Rao metric is accurately approximated by a simpler metric under the assumption that the blurring is small compared with the sizes of the ellipses under consideration. It is shown that the parameter space for the ellipses in the image has a finite volume under the approximation to the Fisher-Rao metric. As a consequence the parameter space can be replaced, for the purpose of ellipse detection, by a finite set of points sampled from it. An efficient algorithm for sampling the parameter space is described. The algorithm uses the fact that the approximating metric is flat, and therefore locally Euclidean, on each three dimensional family of ellipses with a fixed orientation and a fixed eccentricity. Once the sample points have been obtained, ellipses are detected in a given image by checking each sample point in turn to see if the corresponding ellipse is supported by the nearby image pixel values. The resulting algorithm for ellipse detection is implemented. A multiresolution version of the algorithm is also implemented. The experimental results suggest that ellipses can be reliably detected in a given low resolution image and that the number of false detections can be reduced using the multiresolution algorithm

Local implicit modeling of blood vessels for interactive simulation

International audienceIn the context of computer-based simulation, contact management requires an accurate, smooth, but still efficient surface model for the blood vessels. A new implicit model is proposed, consisting of a tree of local implicit surfaces generated by skeletons ({\em blobby models}). The surface is reconstructed from data points by minimizing an energy, alternating with an original blob selection and subdivision scheme. The reconstructed models are very efficient for simulation and were shown to provide a sub-voxel approximation of the vessel surface on 5 patients

A model for adapting 3D graphics based on scalable coding, real-time simplification and remote rendering

Most current multiplayer 3D games can only be played on dedicated platforms, requiring specifically designed content and communication over a predefined network. To overcome these limitations, the OLGA (On-Line GAming) consortium has devised a framework to develop distributive, multiplayer 3D games. Scalability at the level of content, platforms and networks is exploited to achieve the best trade-offs between complexity and quality

From Multiview Image Curves to 3D Drawings

Reconstructing 3D scenes from multiple views has made impressive strides in recent years, chiefly by correlating isolated feature points, intensity patterns, or curvilinear structures. In the general setting - without controlled acquisition, abundant texture, curves and surfaces following specific models or limiting scene complexity - most methods produce unorganized point clouds, meshes, or voxel representations, with some exceptions producing unorganized clouds of 3D curve fragments. Ideally, many applications require structured representations of curves, surfaces and their spatial relationships. This paper presents a step in this direction by formulating an approach that combines 2D image curves into a collection of 3D curves, with topological connectivity between them represented as a 3D graph. This results in a 3D drawing, which is complementary to surface representations in the same sense as a 3D scaffold complements a tent taut over it. We evaluate our results against truth on synthetic and real datasets.Comment: Expanded ECCV 2016 version with tweaked figures and including an overview of the supplementary material available at multiview-3d-drawing.sourceforge.ne

Connectivity forests for homological analysis of digital volumes

In this paper, we provide a graph-based representation of the homology (information related to the different “holes” the object has) of a binary digital volume. We analyze the digital volume AT-model representation [8] from this point of view and the cellular version of the AT-model [5] is precisely described here as three forests (connectivity forests), from which, for instance, we can straightforwardly determine representative curves of “tunnels” and “holes”, classify cycles in the complex, computing higher (co)homology operations,... Depending of the order in which we gradually construct these trees, tools so important in Computer Vision and Digital Image Processing as Reeb graphs and topological skeletons appear as results of pruning these graphs

Non-Iterative, Feature-Preserving Mesh Smoothing

With the increasing use of geometry scanners to create 3D models, there is a rising need for fast and robust mesh smoothing to remove inevitable noise in the measurements. While most previous work has favored diffusion-based iterative techniques for feature-preserving smoothing, we propose a radically different approach, based on robust statistics and local first-order predictors of the surface. The robustness of our local estimates allows us to derive a non-iterative feature-preserving filtering technique applicable to arbitrary "triangle soups". We demonstrate its simplicity of implementation and its efficiency, which make it an excellent solution for smoothing large, noisy, and non-manifold meshes.Singapore-MIT Alliance (SMA

The importance of parameter choice in modelling dynamics of the eye lens

The lens provides refractive power to the eye and is capable of altering ocular focus in response to visual demand. This capacity diminishes with age. Current biomedical technologies, which seek to design an implant lens capable of replicating the function of the biological lens, are unable as yet to provide such an implant with the requisite optical quality or ability to change the focussing power of the eye. This is because the mechanism of altering focus, termed accommodation, is not fully understood and seemingly conflicting theories require experimental support which is difficult to obtain from the living eye. This investigation presents finite element models of the eye lens based on data from human lenses aged 16 and 35 years that consider the influence of various modelling parameters, including material properties, a wide range of angles of force application and capsular thickness. Results from axisymmetric models show that the anterior and posterior zonules may have a greater impact on shape change than the equatorial zonule and that choice of capsular thickness values can influence the results from modelled simulations

First Order Error Correction for Trimmed Quadrature in Isogeometric Analysis

International audienceIn this work, we develop a specialized quadrature rule for trimmed domains , where the trimming curve is given implicitly by a real-valued function on the whole domain. We follow an error correction approach: In a first step, we obtain an adaptive subdivision of the domain in such a way that each cell falls in a pre-defined base case. We then extend the classical approach of linear approximation of the trimming curve by adding an error correction term based on a Taylor expansion of the blending between the linearized implicit trimming curve and the original one. This approach leads to an accurate method which improves the convergence of the quadrature error by one order compared to piecewise linear approximation of the trimming curve. It is at the same time efficient, since essentially the computation of one extra one-dimensional integral on each trimmed cell is required. Finally, the method is easy to implement, since it only involves one additional line integral and refrains from any point inversion or optimization operations. The convergence is analyzed theoretically and numerical experiments confirm that the accuracy is improved without compromising the computational complexity