Abstract
A family of algorithms that implement operations on compressed digital images is described. These algorithms allow many traditional image manipulation operations to be performed 50 to 100 times faster than their brute-force counterparts. It is shown how the algebraic operations of pixel-wise and scalar addition and multiplication, which are the basis for many image transformations, can be implemented on compressed images. These operations are used to implement two common video transformations: dissolving one video sequence into another and subtitling. The performance of these operations is compared with the brute-force approach. The limitations of the technique, extensions to other compression standards and the relationship of this research to other work in the area are discussed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
