In this paper we propose a new circularity measure which defines the degree to which a shape differs from a perfect circle. The new measure is easy to compute and being area based, is robust – e.g., with respect to noise or narrow intrusions. Also, it satisfies the following desirable properties: – it ranges over (0, 1] and gives the measured circularity equal to 1 if and only if the measured s...

We investigate the evolutionary history of the wide-ranging Nearctic treefrog Hyla arenicolor through the integration of extensive range-wide sampling, phylogenetic analyses of multilocus genetic data, and divergence dating. Previous phylogeographic studies of this frog documented a potential signature of introgressive hybridization from an ecologically and morphologically divergent sister spec...

The separation of a complex mixture based solely on second-order statistics can be achieved using the Strong Uncorrelating Transform (SUT) if and only if all sources have distinct circularity coefficients. However, in most problems we do not know the circularity coefficients, and they must be estimated from observed data. In this work, we propose a detector, based on the generalized likelihood ...

In this note we show that the, so called, circularity measures based on radial moments , as defined in [1], are a particular case of the circularity measures introduced by [2].

A new circularity measure for discrete objects is introduced and an algorithm to compute this measure is presented. This measure equals 0 for all discrete circles and is strictly positive for all discrete objects which are not discrete circles.

A circular cover of a graph G is a cover {X0, · · · , Xn−1} of the topological space G by closed connected subsets, indexed over Zn, with the following properties: Each element in the cover contains a vertex of G, each vertex of G is contained in at most two elements of the cover, and Xa ∩ Xb 6= ∅ if and only if b − a ∈ {−1, 0, 1}. The circularity of G is the largest integer n for which there i...

We briefly describe the circularity/non-independence problem, and our perception of the impact the ensuing discussion has had on fMRI research.

In this tribute to Doaitse Swierstra, we present the first transformation between lazy circular programs à la Bird and strict circular programs à la Pettorossi. Circular programs à la Bird rely on lazy recursive binding: they involve circular unknowns and make sense equationally. Circular programs à la Pettorossi rely on the inductive construction of functions and their eventual application: th...

­ We propose one geometric algorithm to solve both the problem of circularity test and the problem of circularity measure. The former problem consists in deciding whether a given digital curve is a digitization of a circle or not, whereas the latter problem consists in measuring how far a given digital curve is from a digitization of a circle. Our new circularity measure fulfills basic invarian...

Elliptical particle motion, often encountered in acoustic fields containing interference between a source signal and its reflections, can be quantified by the degree of circularity, a vector quantity formulated from acoustic particle velocity, or vector intensity measurements. Acoustic analysis based on the degree of circularity is expected to find application in ocean waveguides as its spatial...