Image compression algorithm

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Existing Video Indexing Models are analyzed and a practical approach to the optimal Video Indexing is introduced. It is studied under all the phases of video indexing processes like segmentation, indexing, database storage, query based access, browsing and video clip retrieval, etc. The main aim is to easily parse the video stream into meaningful scenes, maintain them in an effective database with minimal data repetitions, efficient query handling and user friendly browsing capabilities. Conceptual Graph, Motion Estimation, Mean Absolute Frame Difference, Displaced Frame Difference, Dublin Core and other important existing techniques are utilized in this model. The main aim is to reduce the memory storage of video clippings without visible loss in quality by using a predictive video compression technique. Today almost all video clippings face a compromise between their quality and memory size. Even Video clippings are not advised to include in the web pages because of their downloading time and its memory size. To try to rectify it and to take positive measures to convert a video clipping file similar to*.swf (flash player's shockwave files) is the aim of this presentation. © EuroJournals Publishing, Inc. 2012.

Cite

CITATION STYLE

APA

Tamilselvi, M. S., & Kannan, A. R. (2012). Image compression algorithm. European Journal of Scientific Research, 78(3), 417–457. https://doi.org/10.9790/3021-026113571373

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free