Exploiting Monge structures in optimum subwindow search

Optimum subwindow search for object detection aims to find a subwindow so that the contained subimage is most similar to the query object. This problem can be formulated as a four dimensional (4D) maximum entry search problem wherein each entry corresponds to the quality score of the subimage contained in a subwindow. For n × n images, a naive exhaustive search requires O(n4 ) sequential computations of the quality scores for all subwindows. To reduce the time complexity, we prove that, for some typical similarity functions like Euclidian metric, χ2 metric on image histograms, the associated 4D array carries some Monge structures and we utilise these properties to speed up the optimum subwindow search and the time complexity is reduced to O(n3 ). Furthermore, we propose a locally optimal alternating column and row search method with typical quadratic time complexity O(n2 ). Experiments on PASCAL VOC 2006 demonstrate that the alternating method is significantly faster than the well...

• Type: Conference
• Year: 2010
• Where: CVPR
• Authors: Senjian An, Patrick Peursum, Wanquan Liu, Svetha Venkatesh, Xiaoming Chen
• Keywords: Computer Vision, CVPR 2010, Naive Exhaustive Search, Optimum Subwindow Search, Time Complexity