In this paper, a novel classifier based on nearest feature line is proposed, which is called as restricted nearest feature line with ellipse (RNFLE). NFL successfully improves the classification ability. However there are still some drawbacks in NFL that limit their further application in practice. To improve the miss-classification of nearest feature line when the prototypes in NFL are far awa...

The Falconer conjecture says that if a compact planar set has Hausdorff dimension > 1, then the Euclidean distance set ∆(E) = {|x − y| : x, y ∈ E} has positive Lebesgue measure. In this paper we prove, under the same assumptions, that for almost every ellipse K, ∆ K (E) = {||x − y|| K : x, y ∈ E} has positive Lebesgue measure, where || · || K is the norm induced by an ellipse K. Equivalently, w...

An automatic facial feature extraction method is presented in this paper. The method is based on the edge density distribution of the image. In the preprocessing stage a face is approximated to an ellipse, and genetic algorithm is applied to search for the best ellipse region match. In the feature extraction stage, genetic algorithm is applied to extract the facial features, such as the eyes, n...

In this paper, we introduce a new technique for cu.mera self-calibration, irsing ellipse correspondences. Bu.sed o n a n anmlysis of ellipse matches between the images obtained from th,e same viewpoint but with different o.nd un.knoiiin i i k w direction,s, our approach est imates the intriirsic camera, param.eters. W e present both liner and non-linear solution,s t o recovering in t r insic ca...

We describe the dynamics of the Kirchhoff ellipse by formulating a nonlinear equation for the boundary of a perturbed vortex patch in elliptical coordinates. We demonstrate that in the regime for which the linearized equation of motion is unstable, the nonlinear dynamics of a rather general initial perturbation of the Kirchhoff ellipse are determined by the fastest growing mode for the correspo...

In this paper, we introduce a statistically efficient method f o r detecting ellipses in a n image. Given a set of digital arc segments, we introduce geometric criteria t o select possible pairs of arc segments belonging to the same ellipse. T h e selected arc pairs are subsequently validated or rejected based o n certain statistical criteria via hypothesis testing. The advantages of our techni...

We consider the problem of detecting elliptical curves using Hough Transform methods. Storage and efficiency problems are overcome by decomposing the problem into two stages. The first stage uses a novel constraint as the basis for a Hough Transform to detect the ellipse center while the second stage finds the remaining parameters using a simple but efficient focussing implementation of the HT....

The least squares method is the most commonly used technique for fitting an ellipse through a set of points. However, it has a low breakdown point, which means that it performs poorly in the presence of outliers. We describe various alternative methods for ellipse fitting which are more robust: the Theil-Sen, least median of squares, Hilbert curve, and minimum volume estimator approaches. Testi...

The design and analysis of ellipse shaped broad band micro strip patch antenna are discussed in this paper. In modern wireless communication system at the higher frequency, this basically needs all its components to be in compact size. The proposed antenna inspired by ellipse shaped which offer the better performance compare to the conventional antenna. Here, the proposed antenna is one such co...

We propose a streaming algorithm to compute an approximate ellipse of a set of points. This extends the work of Zarrabi-Zadeh and Chan who proposed a very simple algorithm to compute a 3/2-approximate (in terms of radius) d-dimensional ball in the same model. We have been able to obtain only a very crude approximation ratio of 9k 4 √ 1−e2 (in terms of area), where e is the eccentricity of the m...