Abstract
Random access video compression is mostly implemented without any reduction of temporal redundancy. Standard video compression systems like MPEG (1,2 and 4) are heavily based on motion compensation, which to some extent makes random access at single frame level impossible. We present a method for near random access video compression of low-motion video that is based on the discrete cosine transform and vector quantization and refine this system using weighted finite automata while keeping the random access property and using some reduction of temporal redundancy.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
ISO/IEC, ISO/IEC 11172-2:1993, Information technology – Coding of moving pictures and associated audio for digital storage media at up to about 1,5 Mbit/s – Part 2: Video (MPEG1-Video). ISO/IEC (1993)
ISO/IEC, ISO/IEC 13818-2:2000, Information technology – Generic coding of moving pictures and associated audio information: Video (MPEG2-Video). ISO/IEC (2000)
ISO/IEC, ISO/IEC 14496-2:2004. Information technology – Coding of audio-visual objects – Part 2: Visual (MPEG4-Video). ISO/IEC (2004)
Watkinson, J.: The MPEG Handbook, 2nd edn. Focal Press (2004)
Ahmed, N., Natarajan, T., Rao, K.R.: Discrete cosine transform. IEEE Transactions on Computers C-32, 90–93 (1974)
Wallace, G.K.: The JPEG still picture compression standard. Communications of the ACM 34(4), 30–44 (1991)
ISO/IEC: ISO/IEC IS 10918-1:1994, Information technology - Digital compression and coding of continuous-tone still images: Requirements and guidelines. ISO/IEC (1994)
Hafner, U.: Low Bit-Rate Image and Video Coding with Weighted Finite Automata. Mensch und Buch Verlag, Berlin (1999)
Culik II, K., Kari, J.: Image Compression Using Weighted Finite Automata. Computer and Graphics 17(3), 305–313 (1993)
Culik II, K., Kari, J.: Image-data compression using edge-optimizing algorithm for WFA inference. Journal of Information Processing and Management 30, 829–838 (1994)
Culik II, K., Kari, J.: Efficient inference algorithm for weighted finite automata. In: Fisher, Y. (ed.) Fractal Image Encoding and Compression. Springer, Heidelberg (1995)
Culik II, K., Kari, K.: Inference Algorithms for WFA and Image Compression. In: Fisher, Y. (ed.) Fractal Image Encoding and Compression. Springer, Heidelberg (1995)
Schützenberger, M.P.: On the definition of a family of automata. Information and Control 4(2-3), 245–270 (1961)
Culik II, K., Karhumäki, J.: Finite automata computing real functions. SIAM Journal on Computing 23(4), 789–814 (1994)
Derencourt, D., Karhumäki, J., Latteux, M., Terlutte, A.: On Computational Power of Weighted Finite Automata. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol. 629, pp. 236–245. Springer, Heidelberg (1992)
Droste, M., Kari, J., Steinby, P.: Observations on the smoothness properties of real functions computed by weighted finite automata. Fundamenta Informaticae (to appear)
Berstell, J., Reutenauer, C.: Rational Series and Their Languages. Springer, Berlin (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tischler, G. (2006). Refinement of Near Random Access Video Coding with Weighted Finite Automata. In: Ibarra, O.H., Yen, HC. (eds) Implementation and Application of Automata. CIAA 2006. Lecture Notes in Computer Science, vol 4094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11812128_6
Download citation
DOI: https://doi.org/10.1007/11812128_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37213-4
Online ISBN: 978-3-540-37214-1
eBook Packages: Computer ScienceComputer Science (R0)