Image Decoding Using Query-Planes for Parallel Bit-Plane Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional image decoding methods, such as those in JPEG 2000, incur inefficiencies due to redundant operations like scanning bit-plane by bit-plane, which can lead to increased processing time and resource utilization.
Innovation Solution
A method and system for decoding encoded image data that determine multiple bit-planes and query-planes, allowing for efficient decoding passes such as significance propagation, magnitude refinement, and cleanup passes, using various searching algorithms to predict and decode bit-planes in parallel, thereby reducing unnecessary processing steps.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If conventional bit-plane by bit-plane scanning is used for image decoding, then decoding completeness is ensured, but processing time increases
Solution Approach 1:
The patent applies preliminary action by determining query-planes before actual decoding operations. The system pre-processes the encoded code stream to identify which bit-planes need to be decoded and in what order, storing this information in query-planes. This allows the decoding process to skip unnecessary bit-planes and proceed directly to relevant ones, significantly reducing processing time while maintaining decoding completeness.
Solution Approach 2:
The patent segments the decoding process into distinct passes (significance propagation pass, magnitude refinement pass, cleanup pass) with dedicated query-planes for each pass. Each query-plane contains information specific to its corresponding pass, allowing parallel and optimized processing of different bit-plane segments. This segmentation enables the system to process only necessary portions of the encoded data in each pass, improving overall decoding efficiency.
2Productivity
If redundant scanning operations are performed during decoding, then all data is processed, but resource utilization increases
Solution Approach 1:
The patent extracts only the necessary decoding information from the encoded code stream by using query-planes to identify relevant bit-planes. Instead of processing all bit-planes uniformly, the system extracts and processes only those bit-planes that contain significant information for the current decoding pass. This extraction approach eliminates redundant scanning operations and reduces processing resource utilization while maintaining decoding efficiency.
3Loss of time
If sequential bit-plane decoding is used, then processing simplicity is maintained, but waiting periods between operations increase
Solution Approach 1:
The patent introduces a new dimension to the decoding process by organizing bit-plane information into multiple query-planes (first query-plane for significance propagation, second query-plane for magnitude refinement, third query-plane for cleanup). This dimensional organization allows the system to process multiple bit-planes in parallel across different passes rather than sequentially, eliminating waiting periods between operations while managing complexity through structured query-plane management.
Data Source
AI summary
A method for decoding an encoded code stream is provided. The method may include obtaining the encoded code stream. The method may include determining a plurality of code blocks based on the encoded code stream. The method may include determining a plurality of bit-planes for each of the plurality of code blocks, the plurality of bit-planes ranging from a most significant bit-plane to a least significant bit-plane. The method may include determining at least one query-plane for each of the plurality of bit-planes. The method may further include decoding each of the plurality of bit-planes based on the at least one query-plane.