z-logo
open-access-imgOpen Access
Fine feature sensitive marching squares
Author(s) -
Gong Sui,
Newman Timothy S.
Publication year - 2017
Publication title -
iet image processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 45
eISSN - 1751-9667
pISSN - 1751-9659
DOI - 10.1049/iet-ipr.2016.1124
Subject(s) - contouring , pixel , feature (linguistics) , computer science , artificial intelligence , marching cubes , isosurface , mathematics , boundary (topology) , pattern recognition (psychology) , algorithm , visualization , computer graphics (images) , mathematical analysis , philosophy , linguistics
A new contouring method for producing region boundaries in two‐dimensional (2D) scalar‐value image datasets (such as grey‐scale intensity images from a digital camera or X‐ray device) with sub‐pixel precision is introduced here. The method, fine feature sensitive marching squares (FFS‐MS), extends MS isocontouring to produce an isocontour that preserves fine‐scale features (which are often incorrectly recovered by standard MS). This extension is the 2D analogue of Kaneko and Yamamoto's volume preserving marching cubes algorithm. It has several phases. First, it recovers an isocontour using standard MS. Then, it produces a new dataset with data values estimated by treating the recovered contour as the actual boundary. Using this new dataset, it next compares that dataset's estimated data values with the data values at corresponding locations in the original dataset. Finally, the method adjusts the original dataset's pixel values at every pixel location, where there is a high discrepancy between the original data value and the estimated data value. It iteratively repeats its phases until an optimality criterion is satisfied. Experimental analyses of FFS‐MS are also presented. The analyses focus on FF recovery in comparison with the standard MS.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here