Image motion estimation by clustering
โ Scribed by Amit Bandopadhay; John (Yiannis) Aloimonos
- Publisher
- John Wiley and Sons
- Year
- 1990
- Tongue
- English
- Weight
- 986 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0899-9457
No coin nor oath required. For personal study only.
โฆ Synopsis
tmage motion is estimated by matching feature "interest" points in different frames of video image sequences. The matching is based on local similarity of the displacement vectors. Clustering in the displacement vector space is used to determine the set of plausible match vectors. Subsequently, a similarity-based algorithm performs the actual matching. The feature points are computed using a multiple-filter image decomposition operator. The algorithm has been tested on synthetic as well as real video images. The novelty of the approach is that it handles multiple motions and performs motion segmentation.
๐ SIMILAR VOLUMES
We explain that the task of multiple rigid motion segmentation and estimation from image feature point correspondences demands an estimator of high robustness. We show that a heuristics-based partial modeling approach can be used to develop a highly robust estimator called the MF estimator for gener
## Super-resolution enhancement algorithms are used to esti-1. INTRODUCTION mate a high-resolution video still (HRVS) from several lowresolution frames, provided that objects within the digital image Super-resolution enhancement techniques may be used sequence move with subpixel increments. A Baye