Golomb-Rice Encoder for Digital Camera Data Compression
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data compression methods for digital cameras face challenges in achieving a balance between short processing time and small memory usage while maintaining favorable compression performance, as they often require significant buffer space and increased processing time due to complex condition calculations and peripheral pixel analysis.
Innovation Solution
A data encoding and decoding apparatus that calculates a prediction error value through adaptive prediction and performs filtering to correct it, dividing the corrected value into variable and fixed length code parts for efficient encoding and decoding, thereby reducing memory requirements and processing time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of substance
If compression processing is performed with high compression ratio, then data size is reduced, but processing time increases and buffer amount increases
Solution Approach 1:
The patent divides the prediction error into two separate components: a first prediction error and a second prediction error. This segmentation allows each component to be processed independently with different encoding strategies, reducing the overall processing complexity and buffer requirements while maintaining compression efficiency.
Solution Approach 2:
The patent extracts and processes the most significant bits of the prediction error separately from the less significant bits. By taking out the major components first and encoding them with simpler methods, the system reduces processing time and buffer usage while still achieving high compression ratios.
2Loss of substance
If compression processing is performed with high compression ratio, then data size is reduced, but buffer amount increases
Solution Approach 1:
The patent segments the prediction error into multiple components that can be processed with different buffer requirements. The first prediction error is processed with minimal buffer needs, while the second prediction error uses a separate, smaller buffer, thereby reducing the total buffer amount required.
Solution Approach 2:
The patent applies different processing qualities to different parts of the prediction error. The most significant bits receive more careful processing with dedicated buffers, while less significant bits are processed with simpler methods requiring smaller buffers, optimizing the overall buffer usage.
3Loss of substance
If peripheral pixel conditions are divided for encoding, then compression performance improves, but processing time increases
Solution Approach 1:
The patent extracts the essential peripheral pixel information needed for compression and processes only those critical components. By taking out only the necessary condition data rather than processing all peripheral pixel variations, the system maintains compression performance while reducing processing time.
Solution Approach 2:
The patent applies partial processing to peripheral pixel conditions by focusing on the most influential factors rather than analyzing all possible conditions. This partial action approach maintains sufficient compression performance while significantly reducing the processing time required.
Data Source
AI summary
This data encoding apparatus includes: a prediction unit for calculating a prediction value of target data using read data; a subtractor for calculating a prediction error value, which is the error between the target data and the prediction value; a filtering unit and a subtractor for performing filtering on the prediction error value relating to the target data and a determined prediction error value, to calculate a corrected prediction error value relating to the target data; an absolute value calculation unit for calculating the absolute value of the corrected prediction error value; a k parameter determination unit for determining the code length of a fixed length code part using the flatness and dynamic range of the absolute corrected prediction error value; and a Golomb-Rice encoding unit for encoding the absolute corrected prediction error value by dividing it into a variable length code part and the fixed length code part.


