Motion coding of image primitives

摘要

We introduce an algorithm for matching stationary or moving image primitive lines between adjacent frames of a video sequence. Starting from local measures of proximity and similarity of shape, the algorithm computes the distance between pairs of primitives. It has strategies for dealing with broken lines and various kinds of connections between lines. The output of the algorithm is used to control a motion coding system, where only unmatched threads need be transmitted. The system can function in a simple conditional replenishment mode, or with motion compensation. Experimental results are reported showing an improvement of compression rate of 2:1 between intraframe primitivebased coding and motion-compensated primitive-based coding.