Geometric primitive extraction using tabu search

In this paper, we propose a novel method for extracting the geometric primitives from geometric data. Specifically, we use tabu search to solve geometric primitive extraction problem. In the best of our knowledge, it is the first attempt that tabu search is used in computer vision. Our tabu search (TS) has a number of advantages: (1) TS avoids entrapment in local minima and continues the search to give a near-optimal final solution; (2) TS is very general and conceptually much simpler than either SA or GA; (3) TS is very easy to implement and the entire procedure only occupies a few lines of code; (4) TS is a flexible framework of a variety of strategies originating from artificial intelligence and is therefore open to further improvement.