A computer vision system for the characterization andclassification of flames in glass furnaces

A computer vision system for dealing with both flame analysis and classification problems is described. The vision system performs classification tasks, assigning each visualized flame to a previously established class of flames. Each flame class corresponds to a specific operating point of the furnace, and this information can be useful not only for monitoring purposes but also for purposes controlling the whole furnace. Two different classifiers were designed and compared. One exploits a Bayesian formulation, and the other is based on neural networks. They system was first tested in a laboratory environment, where different operating conditions were created through the variation of the burners geometry, the number of active burners, and the rate of fuel used. In a second stage, the vision system was tested in an industrial environment. The results obtained are presented and discussed     

A Multibody Factorization Method for Independently Moving Objects

The structure-from-motion problem has been extensively studied in the field of computer vision. Yet, the bulk of the existing work assumes that the scene contains only a single moving object. The more realistic case where an unknown number of objects move in the scene has received little attention, especially for its theoretical treatment. In this paper we present a new method for separating and recovering the motion and shape of multiple independently moving objects in a sequence of images. The method does not require prior knowledge of the number of objects, nor is dependent on any grouping of features into an object at the image level. For this purpose, we introduce a mathematical construct of object shapes, called the shape interaction matrix, which is invariant to both the object motions and the selection of coordinate systems. This invariant structure is computable solely from the observed trajectories of image features without grouping them into individual objects. Once the matrix is computed, it allows for segmenting features into objects by the process of transforming it into a canonical form, as well as recovering the shape and motion of each object. The theory works under a broad set of projection models (scaled orthography, paraperspective and affine) but they must be linear, so it excludes projective cameras.     

A global solution to sparse correspondence problems

We propose a new methodology for reliably solving the correspondence problem between sparse sets of points of two or more images. This is a key step inmost problems of computer vision and, so far, no general method exists to solve it. Our methodology is able to handle most of the commonly used assumptions in a unique formulation, independent of the domain of application and type of features. It performs correspondence and outlier rejection in a single step and achieves global optimality with feasible computation. Feature selection and correspondence are first formulated as an integer optimization problem. This is a blunt formulation, which considers the whole combinatorial space of possible point selections and correspondences. To find its global optimal solution, we build a concave objective function and relax the search domain into its convex-hull. The special structure of this extended problem assures its equivalence to the original one, but it can be optimally solved by efficient algorithms that avoid combinatorial search. This methodology can use any criterion provided it can be translated into cost functions with continuous second derivatives.