By Topic

Triplet markov fields with edge location for fast unsupervised multi-class segmentation of synthetic aperture radar images

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Gan, L. ; Sch. of Electron. Eng., Xidian Univ., Xi'an, China ; Wu, Y. ; Liu, M. ; Zhang, P.
more authors

Triplet Markov fields (TMF) model is suitable for dealing with multi-class segmentation of non-stationary synthetic aperture radar (SAR) images. In this study, an algorithm using TMF with edge location for fast unsupervised multi-class segmentation of SAR images is proposed. The new segmentation algorithm can locate edge accurately with reasonable computational cost. First for the statistical characteristics of multiplicative speckle noise in SAR image, an edge strength based on the ratio of exponentially weighted averages operator is introduced into the Turbopixels algorithm to obtain a superpixel graph with accurate edge location in SAR images. To enhance the computational efficiency and suppress the speckle, the TMF model on pixel is generalised to that on the superpixel graph. Then, the new corresponding potential energy function and maximisation of posterior marginal segmentation formula are derived. The experimental results on synthetic and real SAR images show that the proposed algorithm can obtain accurate edge location in multi-class segmentation of SAR images, as well as enhance the computational efficiency. Especially when dealing with SAR images in large size, the proposed algorithm can give a robust and efficient result of segmentation.

Published in:

Image Processing, IET  (Volume:6 ,  Issue: 7 )