Beyond Gr\"obner Bases: Basis Selection for Minimal Solvers

Many computer vision applications require robust estimation of the underlying geometry, in terms of camera motion and 3D structure of the scene. These robust methods often rely on running minimal solvers in a RANSAC framework. In this paper we show how we can make polynomial solvers based on the action matrix method faster, by careful selection of the monomial bases. These monomial bases have traditionally been based on a Gr\"obner basis for the polynomial ideal. Here we describe how we can enumerate all such bases in an efficient way. We also show that going beyond Gr\"obner bases leads to more efficient solvers in many cases. We present a novel basis sampling scheme that we evaluate on a number of problems

New algorithms for the dual of the convex cost network flow problem with application to computer vision

Motivated by various applications to computer vision, we consider an integer convex optimization problem which is the dual of the convex cost network flow problem. In this paper, we first propose a new primal algorithm for computing an optimal solution of the problem. Our primal algorithm iteratively updates primal variables by solving associated minimum cut problems. The main contribution in this paper is to provide a tight bound for the number of the iterations. We show that the time complexity of the primal algorithm is K ¢ T(n;m) where K is the range of primal variables and T(n;m) is the time needed to compute a minimum cut in a graph with n nodes and m edges. We then propose a primal-dual algorithm for the dual of the convex cost network flow problem. The primal-dual algorithm can be seen as a refined version of the primal algorithm by maintaining dual variables (flow) in addition to primal variables. Although its time complexity is the same as that for the primal algorithm, we can expect a better performance practically. We finally consider an application to a computer vision problem called the panoramic stitching problem. We apply several implementations of our primal-dual algorithm to some instances of the panoramic stitching problem and test their practical performance. We also show that our primal algorithm as well as the proofs can be applied to the L\-convex function minimization problem which is a more general problem than the dual of the convex cost network flow problem

Report on trial of SatScan tray scanner system by SmartDrive Ltd.

Smartdrive Ltd. has developed a prototype imaging system, SatScan, that captures digitised images of large areas while keeping smaller objects in focus at very high resolution. The system was set up in the Sackler Biodiversity Imaging laboratory of Natural History Museum on March 8, 2010 for a one-month trial. A series of projects imaging parts of the entomological, botanical and palaeoentomological collection were conducted to assess the systems utility for museum collection management and biodiversity research. The technical and practical limitations of the system were investigated as part of this process

Assessment of plastics in the National Trust: a case study at Mr Straw's House

The National Trust is a charity that cares for over 300 publically accessible historic buildings and their contents across England, Wales and Northern Ireland. There have been few previous studies on preservation of plastics within National Trust collections, which form a significant part of the more modern collections of objects. This paper describes the design of an assessment system which was successfully trialled at Mr Straws House, a National Trust property in Worksop, UK. This system can now be used for future plastic surveys at other National Trust properties. In addition, the survey gave valuable information about the state of the collection, demonstrating that the plastics that are deteriorating are those that are known to be vulnerable, namely cellulose nitrate/acetate, PVC and rubber. Verifying this knowledge of the most vulnerable plastics enables us to recommend to properties across National Trust that these types should be seen as a priority for correct storage and in-depth recording

Multi camera visual saliency using image stitching

This paper presents and investigates two models for a multi camera configuration with visual saliency capability. Applications in various imaging fields each have a different set of detection parameters and requirements which would result in the necessity of software changes. The visual saliency capability offered by this multi camera model allows generic detection of conspicuous objects be it human or nonhuman based on simple low level features. As multiple cameras are used, an image stitching technique is employed to allow combination of Field-of-View (FoV) from different camera captures to provide a panoramic detection field. The stitching technique is also used to complement the visual saliency model in this work. In the first model, image stitching is applied to individual captures to provide a wider FoV, whereby the visual saliency algorithm would able to operate on a wide area. For the second model, visual saliency is applied to individual captures. Then, the maps are recombined based on a set of stitching parameters to reinforced salient features present in objects at the FoV overlap regions. Simulations of the two models are conducted and demonstrated for performance evaluation