Results 1  10
of
510,364
Nonlinear Motioncompensated Interpolation for Low Bit Rate Video
, 2000
"... By augmenting the ITUT H.263 standard bit stream with supplementary motion vectors for tobeinterpolated frames, a new deformable blockbased fast motioncompensated frame interpolation (DBFMCI) scheme is presented. Unlike other motioncompensated interpolation methods, which assume a constantmot ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
constantmotionvelocitybetween two reference P frames, the proposed scheme takes into accountthenonlinearityofmotion to achieveabetter interpolation result. The supplementary motion information for the socalled M frame (motion frame) is defined, which consists of compressed residues of linear and nonlinear motion vectors
NONLINEAR MOTION OF A SUBMERGED BODY IN WAVES
"... In this paper the timedomain solution of wave diraction and the unsteady free motion of a body in waves are addressed. The 'shellfunction ' method of solution, described in Hamilton & Yeung [3], is extended to handle the diraction problem and the exact kinematic boundary condition on ..."
Abstract
 Add to MetaCart
on the body under waveexcited motion. The simplication of a linear free surface condition is retained. The radiation problem with
Analysis of motion blur with a flutter shutter camera for nonlinear motion
 In Proceedings of the 11th European conference on Computer vision: Part I
"... Abstract. Motion blurs confound many computer vision problems. The fluttered shutter (FS) camera [1] tackles the motion deblurring problem by emulating invertible broadband blur kernels. However, existing FS methods assume known constant velocity motions, e.g., via user specifications. In this paper ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
Abstract. Motion blurs confound many computer vision problems. The fluttered shutter (FS) camera [1] tackles the motion deblurring problem by emulating invertible broadband blur kernels. However, existing FS methods assume known constant velocity motions, e.g., via user specifications
MultiTarget Tracking by Online Learning of Nonlinear Motion Patterns and Robust Appearance Models
"... We describe an online approach to learn nonlinear motion patterns and robust appearance models for multitarget tracking in a tracklet association framework. Unlike most previous approaches that use linear motion methods only, we online build a nonlinear motion map to better explain direction chan ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
We describe an online approach to learn nonlinear motion patterns and robust appearance models for multitarget tracking in a tracklet association framework. Unlike most previous approaches that use linear motion methods only, we online build a nonlinear motion map to better explain direction
A Survey of Computer VisionBased Human Motion Capture
 Computer Vision and Image Understanding
, 2001
"... A comprehensive survey of computer visionbased human motion capture literature from the past two decades is presented. The focus is on a general overview based on a taxonomy of system functionalities, broken down into four processes: initialization, tracking, pose estimation, and recognition. Each ..."
Abstract

Cited by 508 (14 self)
 Add to MetaCart
A comprehensive survey of computer visionbased human motion capture literature from the past two decades is presented. The focus is on a general overview based on a taxonomy of system functionalities, broken down into four processes: initialization, tracking, pose estimation, and recognition. Each
Numerical integration of the Cartesian equations of motion of a system with constraints: molecular dynamics of nalkanes
 J. Comput. Phys
, 1977
"... A numerical algorithm integrating the 3N Cartesian equations of motion of a system of N points subject to holonomic constraints is formulated. The relations of constraint remain perfectly fulfilled at each step of the trajectory despite the approximate character of numerical integration. The method ..."
Abstract

Cited by 682 (6 self)
 Add to MetaCart
A numerical algorithm integrating the 3N Cartesian equations of motion of a system of N points subject to holonomic constraints is formulated. The relations of constraint remain perfectly fulfilled at each step of the trajectory despite the approximate character of numerical integration. The method
A New Extension of the Kalman Filter to Nonlinear Systems
, 1997
"... The Kalman filter(KF) is one of the most widely used methods for tracking and estimation due to its simplicity, optimality, tractability and robustness. However, the application of the KF to nonlinear systems can be difficult. The most common approach is to use the Extended Kalman Filter (EKF) which ..."
Abstract

Cited by 747 (6 self)
 Add to MetaCart
) which simply linearises all nonlinear models so that the traditional linear Kalman filter can be applied. Although the EKF (in its many forms) is a widely used filtering strategy, over thirty years of experience with it has led to a general consensus within the tracking and control community
Bundle Adjustment  A Modern Synthesis
 VISION ALGORITHMS: THEORY AND PRACTICE, LNCS
, 2000
"... This paper is a survey of the theory and methods of photogrammetric bundle adjustment, aimed at potential implementors in the computer vision community. Bundle adjustment is the problem of refining a visual reconstruction to produce jointly optimal structure and viewing parameter estimates. Topics c ..."
Abstract

Cited by 555 (12 self)
 Add to MetaCart
covered include: the choice of cost function and robustness; numerical optimization including sparse Newton methods, linearly convergent approximations, updating and recursive methods; gauge (datum) invariance; and quality control. The theory is developed for general robust cost functions rather than
Fronts propagating with curvature dependent speed: algorithms based on Hamiltonâ€“Jacobi formulations
 Journal of Computational Physics
, 1988
"... We devise new numerical algorithms, called PSC algorithms, for following fronts propagating with curvaturedependent speed. The speed may be an arbitrary function of curvature, and the front can also be passively advected by an underlying flow. These algorithms approximate the equations of motion, w ..."
Abstract

Cited by 1183 (64 self)
 Add to MetaCart
We devise new numerical algorithms, called PSC algorithms, for following fronts propagating with curvaturedependent speed. The speed may be an arbitrary function of curvature, and the front can also be passively advected by an underlying flow. These algorithms approximate the equations of motion
Results 1  10
of
510,364