Probabilistic Diffusion Classifiers for Object Detection

This paper presents a stochastic diffusion approach to prototype-based classification. Relations between exemplary objects and their features are modeled in a bipartite graph. A Bayesian interpretation of the model leads to a Markov chain over the set of objects. In contrast to related graph diffusion approaches, our dual treatment of objects and features easily copes with out of sample objects. Applied to problems in color object localization in unconstrained images, our method performs robust and yields promising results.

[1]  Qing Xia,et al.  Image-Based Color Schemes , 2007, 2007 IEEE International Conference on Image Processing.

[2]  Fatih Murat Porikli,et al.  Integral histogram: a fast way to extract histograms in Cartesian spaces , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[3]  G LoweDavid,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004 .

[4]  John D. Lafferty,et al.  Diffusion Kernels on Graphs and Other Discrete Input Spaces , 2002, ICML.

[5]  Bernhard Schölkopf,et al.  Ranking on Data Manifolds , 2003, NIPS.

[6]  Cordelia Schmid,et al.  Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[7]  François Fouss,et al.  Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation , 2007, IEEE Transactions on Knowledge and Data Engineering.

[8]  G. Griffin,et al.  Caltech-256 Object Category Dataset , 2007 .

[9]  Shivani Agarwal,et al.  Ranking on graph data , 2006, ICML.

[10]  Nicolas Pinto,et al.  Why is Real-World Visual Object Recognition Hard? , 2008, PLoS Comput. Biol..

[11]  Christian Bauckhage Distance-Free Image Retrieval Based on Stochastic Diffusion over Bipartite Graphs , 2007, BMVC.

[12]  Carl D. Meyer,et al.  Google's PageRank and Beyond , 2007 .