Superellipse Fitting for the Recovery and Classification of Mine-Like Shapes in Sidescan Sonar Images

Inst. of Robot., Univ. de Valencia, Valencia
IEEE Journal of Oceanic Engineering (Impact Factor: 1.16). 11/2008; DOI: 10.1109/JOE.2008.2002962
Source: IEEE Xplore

ABSTRACT Mine-like object classification from sidescan sonar images is of great interest for mine counter measure (MCM) operations. Because the shadow cast by an object is often the most distinct feature of a sidescan image, a standard procedure is to perform classification based on features extracted from the shadow. The classification can then be performed by extracting features from the shadow and comparing this to training data to determine the object. In this paper, a superellipse fitting approach to classifying mine-like objects in sidescan sonar images is presented. Superellipses provide a compact and efficient way of representing different mine-like shapes. Through variation of a simple parameter of the superellipse function different shapes such as ellipses, rhomboids, and rectangles can be easily generated. This paper proposes a classification of the shape based directly on a parameter of the superellipse known as the squareness parameter. The first step in this procedure extracts the contour of the shadow given by an unsupervised Markovian segmentation algorithm. Afterwards, a superellipse is fitted by minimizing the Euclidean distance between points on the shadow contour and the superellipse. As the term being minimized is nonlinear, a closed-form solution is not available. Hence, the parameters of the superellipse are estimated by the Nelder-Mead simplex technique. The method was then applied to sidescan data to assess its ability to recover and classify objects. This resulted in a recovery rate of 70% (34 of the 48 mine-like objects) and a classification rate of better than 80% (39 of the 48 mine-like objects).

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We propose an active contour (a.k.a. snake) that takes the shape of an ellipse. Its evolution is driven by surface terms made of two contributions: the integral of the data over an inner ellipse, counterbalanced by the integral of the data over an outer elliptical shell. We iteratively adapt the active contour to maximize the contrast between the two domains, which results in a snake that seeks elliptical bright blobs. We provide analytic expressions for the gradient of the snake with respect to its defining parameters, which allows for the use of efficient optimizers. An important contribution here is the parameterization of the ellipse which we define in such a way that all parameters have equal importance; this creates a favorable landscape for the proceedings of the optimizer. We validate our construct with synthetic data and illustrate its use on real data as well.
    IEEE Transactions on Software Engineering 02/2011; 33(2):382-93. · 2.59 Impact Factor
  • Source
    09/2011; , ISBN: 978-953-307-345-3
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper proposes a new level set segmentation method which is guided by a parametric prior force based on Lamé curves. The use of prior knowledge is advantageous in order to improve the segmentation results in terms of matching expected object types because one can in general state that for different applications some shapes are more likely than others. By avoiding complex shape training processes the level set idea is extended with a parametric prior shape which forces the level set evolution to propagate towards the desired objects by not overpowering the image properties. Also a cross talk evolution is discussed for ternary images to handle correlations between adjacent or correlated objects.
    Image Processing (ICIP), 2012 19th IEEE International Conference on; 01/2012

Full-text (2 Sources)

Available from
Jun 3, 2014