Results 1 - 10
of
15,823
An Efficient Motion-Compensated 3D Wavelet Video Coding System
"... An efficient motion-compensated 3D wavelet video coding system is proposed in this paper. In this new system, spatio-temporal subbands are generated by MC temporal analysis based on an adaptive GOP structure and 2D spatial wavelet transform, and then encoded by a quadtree-based wavelet image coding ..."
Abstract
- Add to MetaCart
An efficient motion-compensated 3D wavelet video coding system is proposed in this paper. In this new system, spatio-temporal subbands are generated by MC temporal analysis based on an adaptive GOP structure and 2D spatial wavelet transform, and then encoded by a quadtree-based wavelet image coding
EFFICIENT MOTION COMPENSATED FRAME RATE UPCONVERSION USING MULTIPLE INTERPOLATIONS AND MEDIAN FILTERING
"... Methods for motion compensated frame rate upconversion exploit motion in order to generate interpolated frames that are temporally located between the available original frames of a video sequence. When the interpolated frames are inserted into the original sequence, the resulting sequence has a hig ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
higher visual quality due to the increased frame rate. We propose a method for motion compensated frame rate upconversion which reduces upconversion artifacts by combining multiple intermediate interpolations utilizing median filtering. We use an efficient block based motion estimation method which makes
Articulated body motion capture by annealed particle filtering
- In IEEE Conf. on Computer Vision and Pattern Recognition
, 2000
"... The main challenge in articulated body motion tracking is the large number of degrees of freedom (around 30) to be recovered. Search algorithms, either deterministic or stochastic, that search such a space without constraint, fall foul of exponential computational complexity. One approach is to intr ..."
Abstract
-
Cited by 494 (4 self)
- Add to MetaCart
in the fitness function, gradually. The new algorithm, termed annealed particle filtering, is shown to be capable of recovering full articulated body motion efficiently. 1.
Efficient region tracking with parametric models of geometry and illumination
- PAMI
, 1998
"... Abstract—As an object moves through the field of view of a camera, the images of the object may change dramatically. This is not simply due to the translation of the object across the image plane. Rather, complications arise due to the fact that the object undergoes changes in pose relative to the v ..."
Abstract
-
Cited by 563 (30 self)
- Add to MetaCart
with techniques from robust statistics and treat occluded regions on the object as statistical outliers. Throughout, we present experimental results performed on live video sequences demonstrating the effectiveness and efficiency of our methods. Index Terms—Visual tracking, real-time vision, illumination, motion
Numerical integration of the Cartesian equations of motion of a system with constraints: molecular dynamics of n-alkanes
- 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 704 (6 self)
- Add to MetaCart
model, (b) the derivation of the equations of motion of the system and (c) the choice of an efficient algorithm for the numerical integration of these equations. In polyatomic molecules, the fast internal vibrations are usually decoupled from
An Efficient Solution to the Five-Point Relative Pose Problem
, 2004
"... An efficient algorithmic solution to the classical five-point relative pose problem is presented. The problem is to find the possible solutions for relative camera pose between two calibrated views given five corresponding points. The algorithm consists of computing the coefficients of a tenth degre ..."
Abstract
-
Cited by 484 (13 self)
- Add to MetaCart
An efficient algorithmic solution to the classical five-point relative pose problem is presented. The problem is to find the possible solutions for relative camera pose between two calibrated views given five corresponding points. The algorithm consists of computing the coefficients of a tenth
Iterative point matching for registration of free-form curves and surfaces
, 1994
"... A heuristic method has been developed for registering two sets of 3-D curves obtained by using an edge-based stereo system, or two dense 3-D maps obtained by using a correlation-based stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in ma ..."
Abstract
-
Cited by 660 (8 self)
- Add to MetaCart
correspondences, which reduces the average distance between points in the two sets. Both synthetic and real data have been used to test the algorithm, and the results show that it is efficient and robust, and yields an accurate motion estimate.
Adaptive clustering for mobile wireless networks
- IEEE Journal on Selected Areas in Communications
, 1997
"... This paper describes a self-organizing, multihop, mobile radio network, which relies on a code division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled and are dynamically reconfig ..."
Abstract
-
Cited by 561 (11 self)
- Add to MetaCart
changes caused by node motion, node failure and node insertion/removal. Simulation shows that this architecture provides an efficient, stable infrastructure for the integration of different types of traffic in a dynamic radio network. 1.
OBB-Tree: A hierarchical structure for rapid interference detection
- PROC. ACM SIGGRAPH, 171–180
, 1996
"... We present a data structure and an algorithm for efficient and exact interference detection amongst complex models undergoing rigid motion. The algorithm is applicable to all general polygonal and curved models. It pre-computes a hierarchical representation of models using tight-fitting oriented bo ..."
Abstract
-
Cited by 845 (53 self)
- Add to MetaCart
We present a data structure and an algorithm for efficient and exact interference detection amongst complex models undergoing rigid motion. The algorithm is applicable to all general polygonal and curved models. It pre-computes a hierarchical representation of models using tight-fitting oriented
Lucas-Kanade 20 Years On: A Unifying Framework: Part 3
- International Journal of Computer Vision
, 2002
"... Since the Lucas-Kanade algorithm was proposed in 1981 image alignment has become one of the most widely used techniques in computer vision. Applications range from optical flow, tracking, and layered motion, to mosaic construction, medical image registration, and face coding. Numerous algorithms hav ..."
Abstract
-
Cited by 706 (30 self)
- Add to MetaCart
Since the Lucas-Kanade algorithm was proposed in 1981 image alignment has become one of the most widely used techniques in computer vision. Applications range from optical flow, tracking, and layered motion, to mosaic construction, medical image registration, and face coding. Numerous algorithms
Results 1 - 10
of
15,823