Paper
26 April 2007 Dynamic tree segmentation of sonar imagery
Author Affiliations +
Abstract
High-resolution sonar images of the sea floor contain rich spatial information that varies widely depending on survey location, sea state, and sensor platform-induced artifacts. Automatically segmenting sonar images into labeled regions can have several useful applications such as creating high-resolution bottom maps and adapting automatic target recognition schemes to perform optimally given the measured environment. This paper presents a method for sonar image segmentation using graphical models known as dynamic trees (DTs). A DT is a mixture of simply-connected tree-structured Bayesian networks (TSBNs), a hierarchical two-dimensional Bayesian network, where the leaf node states of each TSBN are the label of each image pixel. The DT segmentation task is to find the best TSBN mixture that represents the underlying data. A novel use of the K-distribution as a likelihood function for associating sonar image pixels with the appropriate bottom-type label is introduced. A simulated annealing stochastic search method is used to determine the maximum a posteriori (MAP) DT quadtree structure for each sonar image. Segmentation results from several images are presented and discussed.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
J. Tory Cobb and K. Clint Slatton "Dynamic tree segmentation of sonar imagery", Proc. SPIE 6553, Detection and Remediation Technologies for Mines and Minelike Targets XII, 65530P (26 April 2007); https://doi.org/10.1117/12.720290
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image segmentation

Data modeling

Algorithms

Actinium

Statistical analysis

Stochastic processes

Expectation maximization algorithms

Back to Top