We present a formulation for recursive recovery of motion, pointwise structure, and focal length from feature correspondences tracked through an image sequence. In addition to adding focal length to the state vector, several representational improvements are made over earlier structure from motion formulations, yielding a stable and accurate estimation framework which applies uniformly to both ...

‎Bucket recursive trees are an interesting and natural‎ ‎generalization of ordinary recursive trees and have a connection‎ to mathematical chemistry‎. ‎In this paper‎, ‎we give the lower and upper bounds for the moment generating‎ ‎function and moments of the multiplicative Zagreb indices in a‎ ‎randomly chosen bucket recursive tree of size $n$ with maximal bucket size $bgeq1$‎. Also, ‎we consi...

in this paper, we propose to extend the hierarchical bivariatehermite interpolant to the spherical case. let $t$ be an arbitraryspherical triangle of the unit sphere $s$ and  let $u$ be a functiondefined over the triangle $t$. for $kin mathbb{n}$, we consider ahermite spherical interpolant problem $h_k$ defined by some datascheme $mathcal{d}_k(u)$ and which admits a unique solution $p_k$in the ...

In this work we propose a fast and stable algorithm for the computation of the orthogonal moments of an image. Indeed, the traditional orthogonal moments formulations are characterized by a high discriminative power, but also by a large computational complexity, which limits their real-time application. The recursive approach described in this paper aims to solve these limitations. In our exper...

In this article, we present, using methods from the theory of Lie groups and Lie algebras, a coordinate-invariant formulation of the dynamics of open kinematic chains. We first reformulate the recursive dynamics algorithm originally given in [8] for open chains in terms of standard linear operators on the Lie algebra of the Special Euclidean group. Using straight forward algebraic manipulations...

Th e method of recursive coordinate reduction (RCR) off ers solutions to the forward problem of multibody dynamics at a cost in which the number of operations is linear in both the number of generalized coordinates, n, and the number of independent algebraic constraints, m (e.g., O(n + m)). However, the RCR is presently restricted in applicability (albeit broad) and susceptible to formulation s...

This paper presents an axiomatic foundation for recursive utility that captures the role of the timing of resolution of uncertainty without relying on exogenously speci®ed objective beliefs. Two main representation results are proved. In the ®rst one, future utility enters the recursion through the type of general aggregators considered in Skiadas (1997a), and as a result the formulation is pur...

Certain types of recursive filters have been considered as nonrealizable because they contain delayless recursive loops. Usually the problem is rather technical than theoretical. In this paper a method of implementing such filters is introduced. The general procedure is to split a delay free recursive filter to a non-delay free and a pure delay free structure. As a combination of these, the fil...

This paper consists of two parts. The first part presents a complementarity based recursive scheme to model intermittent contact for flexible multibody systems. A recursive divide and conquer framework is used to explicitly impose the bilateral constraints in the entire system. The presented approach is an extension of the hybrid scheme for rigid multibody systems to allow for small deformation...

In this letter, we propose a recursive space time decoding method for orthogonal frequency division multiplexing (OFDM) systems exploiting multiple transmit antenna diversity when the channels are fast fading. We first develop a computationally efficient space-time decoding method involving a matrix inversion to mitigate the channel variation effect. We then further reduce the computational com...