Please use this identifier to cite or link to this item:
Title: Numerical methods for interactive multiple-class image segmentation problems
Authors: Ng, M.K.
Qiu, G.
Yip, A.M. 
Keywords: Boundary conditions
Condition numbers
Discrete maximum principle
Domain decomposition
Image segmentation
Issue Date: Sep-2010
Citation: Ng, M.K., Qiu, G., Yip, A.M. (2010-09). Numerical methods for interactive multiple-class image segmentation problems. International Journal of Imaging Systems and Technology 20 (3) : 191-201. ScholarBank@NUS Repository.
Abstract: In this article, we consider a bilaterally constrained optimization model arising from the semisupervised multiple-class image segmentation problem. We prove that the solution of the corresponding unconstrained problem satisfies a discrete maximum principle. This implies that the bilateral constraints are satisfied automatically and that the solution is unique. Although the structure of the coefficient matrices arising from the optimality conditions of the segmentation problem is different for different input images, we show that they are M-matrices in general. Therefore, we study several numerical methods for solving such linear systems and demonstrate that domain decomposition with block relaxation methods are quite effective and outperform other tested methods. We also carry out a numerical study of condition numbers on the effect of boundary conditions on the optimization problems, which provides some insights into the specification of boundary conditions as an input knowledge in the learning context. © 2010 Wiley Periodicals, Inc.
Source Title: International Journal of Imaging Systems and Technology
ISSN: 08999457
DOI: 10.1002/ima.20238
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Jan 15, 2019


checked on Jan 7, 2019

Page view(s)

checked on Jan 18, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.