Motion-partitioned adaptive block matching for video compression
Material type:
ArticleSeries: ^p Datos electrónicos (1 archivo : 334 KB)Publication details: ref_localidad@37940 : , 1995Subject(s): Online resources: Summary: We present a motion compensation technique called motion-partitioned adaptive block matching algorithm (MPA-BMA) for motion compensated video compression. The algorithm offers a good degree of scene adaptation to reduce prediction errors while maintaining a slightly increased amount of side motion data and being computationally affordable. It detects the motion boundaries, partitions the motion field into consistent motion groups and computes more reliable motion data by using variable-sized matching blocks that are adaptively composed. Experiments compare its good performance with the full-search block matching algorithm (BMA)
| Item type | Current library | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
Capítulo de libro
|
Biblioteca Fac.Informática | A007 (Browse shelf(Opens below)) | Available | DIF-A0207 |
Browsing Biblioteca Fac.Informática shelves Close shelf browser (Hides shelf browser)
Formato de archivo: PDF. -- Disponible también en línea vía suscripción BECyT (Cons. 23/04/2009)
We present a motion compensation technique called motion-partitioned adaptive block matching algorithm (MPA-BMA) for motion compensated video compression. The algorithm offers a good degree of scene adaptation to reduce prediction errors while maintaining a slightly increased amount of side motion data and being computationally affordable. It detects the motion boundaries, partitions the motion field into consistent motion groups and computes more reliable motion data by using variable-sized matching blocks that are adaptively composed. Experiments compare its good performance with the full-search block matching algorithm (BMA)
Proceedings of International Conference on Image Processing (ICIPྛ) Vol. 1, pp. 554-557.
There are no comments on this title.