Classification-Based Probabilistic Modeling of Texture Transition for Fast Line Search Tracking and Delineation

We introduce a classification-based approach to finding occluding texture boundaries. The classifier is composed of a set of weak learners which operate on image intensity discriminative features which are defined on small patches and fast to compute. A database which is designed to simulate digitized occluding contours of textured objects in natural images is used to train the weak learners. The trained classifier score is then used to obtain a probabilistic model for the presence of texture transitions which can readily be used for line search texture boundary detection in the direction normal to an initial boundary estimate. This method is fast and therefore suitable for real-time and interactive applications. It works as a robust estimator which requires a ribbon like search region and can handle complex texture structures without requiring a large number of observations. We demonstrate results both in the context of interactive 2-D delineation and fast 3-D tracking and compare its performance with other existing methods for line search boundary detection.

[1]  Roberto Cipolla,et al.  Real-Time Visual Tracking of Complex Structures , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Pat Langley,et al.  An Analysis of Bayesian Classifiers , 1992, AAAI.

[3]  Pascal Fua,et al.  Texture Boundary Detection for Real-Time Tracking , 2004, ECCV.

[4]  James C. Gee,et al.  Two--level MRF Models for Image Restoration and Segmentation , 2004, BMVC.

[5]  MalikJitendra,et al.  Learning to Detect Natural Image Boundaries Using Local Brightness, Color, and Texture Cues , 2004 .

[6]  Jitendra Malik,et al.  Learning to detect natural image boundaries using local brightness, color, and texture cues , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Yoav Freund,et al.  Experiments with a New Boosting Algorithm , 1996, ICML.

[8]  Marie-Pierre Jolly,et al.  Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images , 2001, ICCV.

[9]  Seyed Ali Shahrokni,et al.  Probabilistic modeling of texture transition for fast tracking and delineation , 2005 .

[10]  Andrew Blake,et al.  "GrabCut" , 2004, ACM Trans. Graph..

[11]  Yann LeCun,et al.  Boxlets: A Fast Convolution Algorithm for Signal Processing and Neural Networks , 1998, NIPS.

[12]  Patrick Pérez,et al.  Interactive Image Segmentation Using an Adaptive GMMRF Model , 2004, ECCV.

[13]  Pascal Fua,et al.  Classifier-based Contour Tracking for Rigid and Deformable Objects , 2005, BMVC.

[14]  Gunnar Rätsch,et al.  Regularizing AdaBoost , 1998, NIPS.

[15]  Andrew Blake,et al.  Accurate, real-time, unadorned lip tracking , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

[16]  Pascal Fua,et al.  Implicit meshes for surface reconstruction , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  Marie-Pierre Jolly,et al.  Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[18]  Christoph H. Lampert,et al.  Beyond sliding windows: Object localization by efficient subwindow search , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[19]  Zhuowen Tu,et al.  Supervised Learning of Edges and Object Boundaries , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).