Please use this identifier to cite or link to this item:
|Title:||A stochastic level set method for Subspace Mumford-Shah based image segmentation||Authors:||Law, Y.N.
Level set method
|Issue Date:||2011||Citation:||Law, Y.N.,Lee, H.K.,Yip, A.M. (2011). A stochastic level set method for Subspace Mumford-Shah based image segmentation. Proceedings of the 2011 International Conference on Image Processing, Computer Vision, and Pattern Recognition, IPCV 2011 2 : 511-516. ScholarBank@NUS Repository.||Abstract:||Recently, the Subspace Mumford-Shah (SMS) model has been proposed for simultaneous texture segmentation and feature selection. The optimal segmentation and features are obtained via solving a joint minimization problem. Due to the non-convexity of the objective function, the computation of a solution is non-trivial and even more difficult than standard Mumford-Shah-type problems. Various ways to compute a solution have been proposed. But none of them address the problem of trapping in a local minimum from the global optimization point of view. In this paper, we propose a stochastic level set method that aims at searching for a globally optimal solution. The proposed method uses a hybrid approach which combines gradient based and stochastic optimization methods to resolve the problem of sensitivity to the initial guess. The core of the algorithm is a basin hopping scheme which uses global updates to escape from local traps in a way that is much more effective than standard stochastic methods. In our experiments, a very high quality solution is obtained within a few stochastic hops whereas the solutions obtained with pure gradient descent are incomparable even after thousands of steps.||Source Title:||Proceedings of the 2011 International Conference on Image Processing, Computer Vision, and Pattern Recognition, IPCV 2011||URI:||http://scholarbank.nus.edu.sg/handle/10635/104524||ISBN:||9781601321916|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 28, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.