This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops
Anytimeness avoids parameters in detecting closed convex polygons
Anchorage, AK, USA
June 23-June 28
ISBN: 978-1-4244-2339-2
Michael Zillich, Institute of Automation and Control Vienna University of Technology, USA
Markus Vincze, Institute of Automation and Control Vienna University of Technology, USA
Many perceptual grouping algorithms depend on parameters one way or another. It is always difficult to set these parameters appropriately for a wide range of input images, and parameters tend to be tuned to a small set of test cases. Especially certain thresholds often seem unavoidable to limit search spaces in order to obtain reasonable runtime complexity. Furthermore early pruning of less salient hypotheses is often necessary to avoid exponential growth of the number of hypotheses. In the presented work we show how the adoption of a simple anytime algorithm, i. e. an algorithm which returns the best answer possible when interrupted and may improve on the answer if allowed to run longer, for finding closed convex polygons eliminates the need for parameter tuning. Furthermore it quite naturally allows the incorporation of attentional mechanisms into the grouping process.
Citation:
Michael Zillich, Markus Vincze, "Anytimeness avoids parameters in detecting closed convex polygons," cvprw, pp.1-8, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, 2008
Usage of this product signifies your acceptance of the Terms of Use.