Polarimetric image segmentation via maximum-likelihood approximation and efficient multiphase level-sets
IEEE Transactions on Pattern Analysis and Machine Intelligence2006Vol. 28(9), pp. 1493–1500
Citations Over TimeTop 1% of 2006 papers
Abstract
This study investigates a level set method for complex polarimetric image segmentation. It consists of minimizing a functional containing an original observation term derived from maximum-likelihood approximation and a complex Wishart/Gaussian image representation and a classical boundary length prior. The minimization is carried out efficiently by a new multiphase method which embeds a simple partition constraint directly in curve evolution to guarantee a partition of the image domain from an arbitrary initial partition. Results are shown on both synthetic and real images. Quantitative performance evaluation and comparisons are also given.
Related Papers
- → A Research for Partition Restoration Techniques(2013)
- On the Changing Attitutde of Moslem Nationality Towards the Partition of Bangla(2005)
- → On an Exact Penalty Result and New Constraint Qualifications for Mathematical Programs with Vanishing Constraints(2018)
- → Remnants of Partition: 21 Objects from a Continent Divided(2021)
- → ‘Unfinished’ partition(2023)