We describe the combination of several novel algorithms into a system which obtains visual motion from a sequence of images and uses it to recover the 3D geometry and 3D motion of polyhedral objects relative to the sensor. The system goes on to use the recovered geometry to recognize the object from a database, a stage which also resolves the depth/speed scaling ambiguity, resulting in absolute...

Denote by μn = ∫ x n1 1 . . . x nd d dμ(x) the n’th moment of a Borel probability measure μ on the unit cube I = [0, 1] in R. Generalizing results of Hausdorff, Hildebrandt and Schoenberg, we give a sufficient condition in terms of moments, that μ is absolutely continuous with respect to a second Borel measure ν on I. We also review a constructive approximation of measures by atomic measures us...

The word and can be used both intersectively and collectively. A major theme in research on coordination has been the quest for a lexical entry that unifies these uses, either based on boolean intersection or based on collective formation. Focusing on English nounnoun coordination, this paper argues for the boolean option. This immediately delivers the intersective behavior of and, as in liar a...

Let ν(n) denote the number of 1’s in the binary representation of n. Properties of this function have been extensively studied in the literature due partly to its natural and frequent appearance in many concrete problems in diverse fields; see [16] and [42] and the references therein. For more examples, see [1], [2], [5], [7], [8], [12], [20], [34]. The well-known Trollope-Delange formula (see ...

The asymptotic behavior of the n{widths of multiplier operators from Lp0;1] into Lq0;1] is studied. General upper and lower bounds for the n{widths in terms of the multipliers are established. Moreover, it is shown that these upper and lower bounds coincide for some important concrete examples.

Keywords: Geometric constraints Modeling by constraints Graph-constructive solver Decomposition–recombination (DR) planning Graph algorithms Under-constrained problems a b s t r a c t Modeling by constraints enables users to describe shapes by specifying relationships between geometric elements. These relationships are called constraints. A constraint solver derives then automatically the desig...