This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Search for Publication

Year(s) from:  to 
Keywords (separated by spaces):

Figure-Ground Segmentation using Tabu Search

M. Stricker and A. Leonardis
Proc. of the IEEE Intern. Symposium on Computer Vision
November 1995


Many computer vision problems, such as figure-ground segmentation, simultaneous fitting of curves, selection of an optimal set of geometric primitives, can be formulated naturally as discrete optimization problems. The statement of these problems is relatively easy, but to find techniques that efficiently solve them constitutes a major challenge. In this paper we focus on figure-ground segmentation. We present a Tabu search strategy which is able to solve the discrete optimization problem associated with figure-ground segmentation in a very efficient way. The resulting deterministic algorithm outperforms the currently fastest known algorithm to solve this problem (mean field annealing) by two orders of magnitude in speed and in addition it consistently finds better optima.

Download in postscript format
  author = {M. Stricker and A. Leonardis},
  title = {Figure-Ground Segmentation using Tabu Search},
  booktitle = {Proc. of the IEEE Intern. Symposium on Computer Vision},
  year = {1995},
  month = {November},
  pages = {605-610},
  keywords = {optimization, segmentation, edges}