Fast Sub-window Search with Square Shape.
ABSTRACT Research in this paper is focused to make a change on variety of Efficient Sub-window Search algorithms. A restriction is applied on the sub-window shape from rectangle into square in order to reduce the number of possible sub-windows with an expectation to improve the computation speed. However, this may come with a consequence of accuracy loss. The experiment results on the proposed algorithms were analysed and compared with the performance of the original algorithms to determine whether the speed improvement is significantly large to make the accuracy loss acceptable. It was found that some new algorithms show a good speed improvement while maintaining small accuracy loss. Furthermore, there is an algorithm designed from a combination of a new algorithm and an original algorithm which gains the benefit from both algorithms and produces the best performance among all new algorithms.
- SourceAvailable from: Thomas Hofmann[Show abstract] [Hide abstract]
ABSTRACT: Most successful object recognition systems rely on binary classification, deciding only if an object is present or not, but not providing information on the actual object location. To estimate the object's location, one can take a sliding window approach, but this strongly increases the computational cost because the classifier or similarity function has to be evaluated over a large set of candidate subwindows. In this paper, we propose a simple yet powerful branch and bound scheme that allows efficient maximization of a large class of quality functions over all possible subimages. It converges to a globally optimal solution typically in linear or even sublinear time, in contrast to the quadratic scaling of exhaustive or sliding window search. We show how our method is applicable to different object detection and image retrieval scenarios. The achieved speedup allows the use of classifiers for localization that formerly were considered too slow for this task, such as SVMs with a spatial pyramid kernel or nearest-neighbor classifiers based on the \chi;2 distance. We demonstrate state-of-the-art localization performance of the resulting systems on the UIUC Cars data set, the PASCAL VOC 2006 data set, and in the PASCAL VOC 2007 competition.IEEE Transactions on Software Engineering 12/2009; 31(12):2129-42. DOI:10.1109/TPAMI.2009.144 · 5.69 Impact Factor
- Communications of the ACM 01/1984; 27(11):1087-1092. DOI:10.1145/1968.381154 · 2.86 Impact Factor
- [Show abstract] [Hide abstract]
ABSTRACT: This paper presents a method for extracting distinctive invariant features from images that can be used to perform reliable matching between different views of an object or scene. The features are invariant to image scale and rotation, and are shown to provide robust matching across a substantial range of affine distortion, change in 3D viewpoint, addition of noise, and change in illumination. The features are highly distinctive, in the sense that a single feature can be correctly matched with high probability against a large database of features from many images. This paper also describes an approach to using these features for object recognition. The recognition proceeds by matching individual features to a database of features from known objects using a fast nearest-neighbor algorithm, followed by a Hough transform to identify clusters belonging to a single object, and finally performing verification through least-squares solution for consistent pose parameters. This approach to recognition can robustly identify objects among clutter and occlusion while achieving near real-time performance.International Journal of Computer Vision 11/2004; 60(2):91---110. DOI:10.1023/B:VISI.0000029664.99615.94 · 3.53 Impact Factor