Tracking Regions

In this paper we present a simple and new algorithm that tracks the contour of several homogenous regions in a sequence of images. The method exploits the fact that, when i.e. observing a moving object (exposing a homogenous region), the regions in two consecutive frames often overlap. We show that the method is valuable for the RoboCup domain: It allows to track the green playing field and the goals very efficiently, to detect the white marking lines precisely, enabling us to recognize features in them (the center circle, the quatre circles, corners, the rectangle of the penalty area,...). It is also useful to find the ball and the obstacles. Furthermore, it provides data for path planning based on potential field methods without further computation. We compared the algorithm with the fastest existing method and measured a speed enhancement of 30 percent. In contrast to other methods, our algorithm not only tracks the center of blobs but yields the precise boundary shape of the objects as a set of point sequences. First tests with real world data have confirmed the applicability for other domains than RoboCup.

[1]  Rolf Adams,et al.  Seeded Region Growing , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Carlo Tomasi,et al.  Color edge detection with the compass operator , 1999, Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149).

[3]  L. Cohen NOTE On Active Contour Models and Balloons , 1991 .

[4]  Manuela M. Veloso,et al.  Fast and inexpensive color image segmentation for interactive robots , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).

[5]  Steven W. Zucker,et al.  Region growing: Childhood and adolescence* , 1976 .

[6]  Gregory W. Cook,et al.  Multiresolution sequential edge linking , 1995, Proceedings., International Conference on Image Processing.

[7]  Theodosios Pavlidis,et al.  Integrating region growing and edge detection , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[8]  Claude L. Fennema,et al.  Scene Analysis Using Regions , 1970, Artif. Intell..

[9]  Laurent D. Cohen,et al.  On active contour models and balloons , 1991, CVGIP Image Underst..

[10]  Tony Lindeberg,et al.  Scale-Space Theory in Computer Vision , 1993, Lecture Notes in Computer Science.

[11]  Stéphane Mallat,et al.  Characterization of Signals from Multiscale Edges , 2011, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  A. Siebert Dynamic Region Growing , 1997 .

[13]  Jurjen Caarls,et al.  Fast and Accurate Robot Vision for Vision Based Motion , 2000, RoboCup.

[14]  Evangelos E. Milios,et al.  Robot Pose Estimation in Unknown Environments by Matching 2D Range Scans , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[15]  Michael Isard,et al.  Active Contours , 2000, Springer London.

[16]  N. Ranganathan,et al.  Gabor filter-based edge detection , 1992, Pattern Recognit..

[17]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Lawrence G. Roberts,et al.  Machine Perception of Three-Dimensional Solids , 1963, Outstanding Dissertations in the Computer Sciences.

[19]  Josef Kittler,et al.  Region growing: a new approach , 1998, IEEE Trans. Image Process..