Abstract
Abstract 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
