Efficient Memory Handling Model with Consistent Video Frame Duplication Removal with Precise Compression
نویسندگان
چکیده
منابع مشابه
Lossless Frame Memory Compression with Low Complexity using PCT and AGR for Efficient High Resolution Video Processing
This paper propose a lossless frame memory compression algorithm with low complexity based on the photo core transform (PCT) with adaptive prediction and adaptive Golomb-Rice (AGR) coding for high resolution video applications. The main goal of the proposed algorithm is to reduce the amount of frame memory in video codec losslessly for high resolution video applications. The proposed method has...
متن کاملA Precise Yet Efficient Memory Model For C
Verification for OO programs typically starts from a strongly typed object model in which distinct objects/fields are guaranteed not to overlap. This model simplifies verification by eliminating all “uninteresting” aliasing and allowing the use of more efficient frame axioms. Unfortunately, this model is unsound and incomplete for languages like C, where “objects” can overlap almost arbitrarily...
متن کاملInter frame Video Duplication Forgery Detection: A Review
Identifying inter-frame forgery and tampering a video is a challenging topic in video forensics. Tampering involves falsification with video content in order to cause damage or make unauthorised modification/alteration. These tampering impacts need to be studied. Till now the studies employed a video authentication method that detects and determines both frame duplication and region duplication...
متن کاملFast and memory efficient text image compression with JBIG2
In this paper, we investigate ways to reduce encoding time, memory consumption and substitution errors for text image compression with JBIG2. We first look at page striping where the encoder splits the input image into horizontal stripes and processes one stripe at a time. We propose dynamic dictionary updating procedures for page striping to reduce the bit rate penalty it incurs. Experiments s...
متن کاملEfficient Scalable Image Compression Algorithms with Low Memory and Complexity
The set partitioning embedded block (SPECK) image compression algorithm has excellent performance, low computational complexity, and produces a rate scalable compressed bitstream that can be decoded efficiently at multiple bit-rates. Unfortunately, it consumes a huge amount of computer memory due to employing lists that store the coordinates of the image pixels and the coordinates of the sets t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revue d'intelligence artificielle
سال: 2023
ISSN: ['1958-5748', '0992-499X']
DOI: https://doi.org/10.18280/ria.370215