Color Image Labelling Using Linear Programming
This paper describes a linear programming (LP) algorithm for labelling (segmenting) a color image into multiple regions. Compared with the recently-proposed semi-definite programming (SDP) relaxation based algorithm, our algorithm has a simpler mathematical formulation, and a much lower computational complexity. In particular, to segment an image of M × N pixels into k classes, our algorithm requires only O((M N k)m) complexity - a sharp contrast to the complexity of O((M N k)2n) offered by the...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of the 9th Biennial Conference of the Australian Pattern Recognition Society on Digital Image Computing Techniques and Applications|
|01_Li_Color_Image_Labelling_Using_2007.pdf||506.85 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.