Spatiotemporal Contour Grouping Using Abstract Part Models

In recent work [1], we introduced a framework for modelbased perceptual grouping and shape abstraction using a vocabulary of simple part shapes. Given a user-defined vocabulary of simple abstract parts, the framework grouped image contours whose abstract shape was consistent with one of the part models. While the results showed promise, the representational gap between the actual image contours that make up an exemplar shape and the contours that make up an abstract part model is significant, and an abstraction of a group of image contours may be consistent with more than one part model; therefore, while recall of ground-truth parts was good, precision was poor. In this paper, we address the precision problem by moving the camera and exploiting spatiotemporal constraints in the grouping process. We introduce a novel probabilistic, graph-theoretic formulation of the problem, in which the spatiotemporal consistency of a perceptual group under camera motion is learned from a set of training sequences. In a set of comprehensive experiments, we demonstrate (not surprisingly) how a spatiotemporal framework for part-based perceptual grouping significantly outperforms a static image version.

[1]  James C. Tiernan,et al.  An efficient search algorithm to find the elementary circuits of a graph , 1970, CACM.

[2]  Frank Nielsen,et al.  Statistical region merging , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Robert B. Fisher,et al.  Model-driven grouping and recognition of generic object parts from single images , 1997, Robotics Auton. Syst..

[4]  A. Jepson,et al.  Perceptual grouping for contour extraction , 2004, ICPR 2004.

[5]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[6]  Azriel Rosenfeld,et al.  3-D Shape Recovery Using Distributed Aspect Matching , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Tony Lindeberg,et al.  Detecting salient blob-like image structures and their scales with a scale-space primal sketch: A method for focus-of-attention , 1993, International Journal of Computer Vision.

[8]  Margrit Betke,et al.  MosaicShape: stochastic region grouping with shape prior , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[9]  Song Wang,et al.  Globally Optimal Grouping for Symmetric Boundaries , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[10]  Thomas Deselaers,et al.  ClassCut for Unsupervised Class Segmentation , 2010, ECCV.

[11]  David W. Jacobs,et al.  Robust and Efficient Detection of Salient Convex Groups , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  William J. Christmas,et al.  A Maximum A Posteriori Probability Viterbi Data Association Algorithm for Ball Tracking in Sports Video , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[13]  M. Farooq,et al.  Maximum likelihood track formation with the Viterbi algorithm , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[14]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

[15]  Raimund Seidel,et al.  On the Number of Cycles in Planar Graphs , 2007, COCOON.

[16]  Frédéric Jurie,et al.  Groups of Adjacent Contour Segments for Object Detection , 2008, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Sven J. Dickinson,et al.  Contour Grouping and Abstraction Using Simple Part Models , 2010, ECCV.

[18]  Robert P. W. Duin,et al.  Data description in subspaces , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[19]  Alex Pentland,et al.  Automatic extraction of deformable part models , 1990, International Journal of Computer Vision.

[20]  Stan Sclaroff,et al.  Deformable model-guided region split and merge of image regions , 2004, Image Vis. Comput..