Search results for "Line segment"
showing 10 items of 11 documents
State-space formulation of scalar Preisach hysteresis model for rapid computation in time domain
2015
A state-space formulation of classical scalar Preisach model (CSPM) of hysteresis is proposed. The introduced state dynamics and memory interface allow to use the state equation, which is rapid in calculation, instead of the original Preisach equation. The main benefit of the proposed modeling approach is the reduced computational effort which requires only a single integration over the instantaneous line segment in the Preisach plane. Numerical evaluations of the computation time and model accuracy are provided in comparison to the CSPM which is taken as a reference model.
Line based motion estimation and reconstruction of piece-wise planar scenes
2011
We present an algorithm for reconstruction of piece-wise planar scenes from only two views and based on minimum line correspondences. We first recover camera rotation by matching vanishing points based on the methods already exist in the literature and then recover the camera translation by searching among a family of hypothesized planes passing through one line. Unlike algorithms based on line segments, the presented algorithm does not require an overlap between two line segments or more that one line correspondence across more than two views to recover the translation and achieves the goal by exploiting photometric constraints of the surface around the line. Experimental results on real i…
Computing Euclidean Steiner trees over segments
2020
In the classical Euclidean Steiner minimum tree (SMT) problem, we are given a set of points in the Euclidean plane and we are supposed to find the minimum length tree that connects all these points, allowing the addition of arbitrary additional points. We investigate the variant of the problem where the input is a set of line segments. We allow these segments to have length 0, i.e., they are points and hence we generalize the classical problem. Furthermore, they are allowed to intersect such that we can model polygonal input. As in the GeoSteiner approach of Juhl et al. (Math Program Comput 10(2):487–532, 2018) for the classical case, we use a two-phase approach where we construct a superse…
Inclusion ratio based estimator for the mean length of the boolean line segment model with an application to nanocrystalline cellulose
2014
A novel estimator for estimating the mean length of fibres is proposed for censored data observed in square shaped windows. Instead of observing the fibre lengths, we observe the ratio between the intensity estimates of minus-sampling and plus-sampling. It is well-known that both intensity estimators are biased. In the current work, we derive the ratio of these biases as a function of the mean length assuming a Boolean line segment model with exponentially distributed lengths and uniformly distributed directions. Having the observed ratio of the intensity estimators, the inverse of the derived function is suggested as a new estimator for the mean length. For this estimator, an approximation…
A stochastic shape and orientation model for fibres with an application to carbon nanotubes
2012
Methods are introduced for analysing the shape and orientation of planar fibres from greyscale images of fibrous systems. The sequence of image processing techniques needed for segmentation of fibres is described. The identified fibres were interpreted as deformed line segments for which two shape and two orientation parameters are estimated by the maximum likelihood method. The methods introduced are shown to perform quite well for simulated systems of deformed line segments with known properties. They were applied to TEM images of carbon nanotubes embedded in polycarbonate.
Visual servo control using orthinormal polynomial
2003
This paper describes an application of the visual servoing approach to vision-based control in robotics. The basic idea addresses the use of a vision sensor in the feedback loop within the controlled vision framework. It consists in tracking of arbitrary 3-D objects travelling at unknown velocities in a 2-D space (depth is given as known). Once the necessary modeling stage is performed, the framework becomes one of automatic control, and naturally stability, performance and robustness questions arise. Here, we consider to track line segments corresponding to the edges extracted from the image being analyzed. Two representations for a line segment are presented and discussed, and an appropri…
Self-affine sets with fibered tangents
2016
We study tangent sets of strictly self-affine sets in the plane. If a set in this class satisfies the strong separation condition and projects to a line segment for sufficiently many directions, then for each generic point there exists a rotation $\mathcal O$ such that all tangent sets at that point are either of the form $\mathcal O((\mathbb R \times C) \cap B(0,1))$, where $C$ is a closed porous set, or of the form $\mathcal O((\ell \times \{ 0 \}) \cap B(0,1))$, where $\ell$ is an interval.
The cyclicity of the elliptic segment loops of the reversible quadratic Hamiltonian systems under quadratic perturbations
2004
Abstract Denote by Q H and Q R the Hamiltonian class and reversible class of quadratic integrable systems. There are several topological types for systems belong to Q H ∩ Q R . One of them is the case that the corresponding system has two heteroclinic loops, sharing one saddle-connection, which is a line segment, and the other part of the loops is an ellipse. In this paper we prove that the maximal number of limit cycles, which bifurcate from the loops with respect to quadratic perturbations in a conic neighborhood of the direction transversal to reversible systems (called in reversible direction), is two. We also give the corresponding bifurcation diagram.
Two View Line-Based Motion and Structure Estimation for Planar Scenes
2012
We present an algorithm for reconstruction of piece-wise planar scenes from only two views and based on minimum line correspondences. We first recover camera rotation by matching vanishing points based on the methods already exist in the literature and then recover the camera translation by searching among a family of hypothesized planes passing through one line. Unlike algorithms based on line segments, the presented algorithm does not require an overlap between two line segments or more that one line correspon- dence across more than two views to recover the translation and achieves the goal by exploiting photometric constraints of the surface around the line. Experimental results on real…
Mise en correspondance de lignes à partir de deux vues, estimation du mouvement et reconstruction pour les systèmes centraux
2011
The primary goal of this thesis is to develop generic motion and structure algorithms for images taken from constructed scenes by various types of central imaging systems including perspective, fish-eye and catadioptric systems. As-suming that the mapping between the image pixels and their 3D rays in space is known, instead of image planes, we work on image spheres (projection of the images on a unit sphere) which enable us to present points over the entire viewsphere suitable for presenting omnidirectional images. In the first part of this thesis, we develop a generic and simple line matching approach for images taken from constructed scenes under a short baseline motion as well as a fast …