Image Processing Apparatus Block Memory Allocation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional image modification processes requiring significant memory resources often fail due to insufficient memory allocation for storing entire images before and after modification, especially when dealing with large images or limited memory capacity in image processing apparatuses.
Innovation Solution
An image processing apparatus that computes the maximum block size of referent blocks associated with target blocks and allocates a sufficient source memory area to perform modification on a block-by-block basis, reducing memory requirements by using multiple source memory areas for multiple modification processes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the conventional image modification process stores entire images before and after modification in memory, then the positional relationship among pixels can be maintained, but the memory capacity required becomes excessively large and may exceed available memory resources
Solution Approach 1:
The image is divided into multiple blocks, and the modification process is performed block by block. Only the current target block and its associated referent block are loaded into memory at any given time, rather than loading entire images. This segmentation approach maintains positional relationships within each block while dramatically reducing the total memory capacity required.
Solution Approach 2:
The patent introduces a spatial dimension to memory management by dividing the image space into discrete blocks and processing them sequentially. This transforms the problem from storing a two-dimensional entire image in memory to storing small two-dimensional blocks in memory while the overall image structure exists in the computational space, effectively adding a temporal/sequential dimension to the processing approach.
2Quantity of substance
If the image modification process is performed on block-by-block basis with computed maximum block size, then the memory usage is reduced, but additional computation time is required for determining block sizes and allocating memory
Solution Approach 1:
The maximum block size is computed and source memory areas are allocated before the actual image modification process begins. This preliminary computation of block sizes and memory allocation prevents the need for dynamic memory management during processing, reducing overhead time during the main modification operations.
Solution Approach 2:
The patent changes the parameter of block size from a fixed predetermined value to a dynamically computed maximum block size based on the specific image and modification requirements. This optimization allows larger blocks to be processed when possible, reducing the total number of blocks and thereby reducing the cumulative overhead time for block processing, while still maintaining memory efficiency.
Data Source
AI summary
An image processing apparatus which enables reduction of memory size required for image modification is provided. The image processing apparatus establishes a target block of the modification process; generates an image within the target block by storing an image within a referent block into a source memory area, and by referring the referent block image in the source memory area; generates entirety of the post-modification image by sequentially shifting the target block to a different position within the image modification area and by generating an image within the target block after each shift; computes a maximum block size of the referent block associated with the target block situated any available position prior to generation of the image; and allocates the source memory area capable of storing an image of a size equal to the maximum block size.