DAG Image Processing Priority Assignment
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing image processing techniques in DAG form suffer from reduced processing efficiency due to high loads in search and priority change processes, leading to suboptimal execution of processes in descending order of processing efficiency.
Innovation Solution
An image processing apparatus that assigns dependency relationships and priorities to partial processes in a DAG, executing them in descending order of priorities, with higher priorities for rear-stage processes and alternating priorities for parallel processes, to optimize processing efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a node to be executed next time through a graph is searched for in execution of each node, then the process can be executed according to the graph structure, but the load of search process increases and processing efficiency is reduced
Solution Approach 1:
The patent applies preliminary action by pre-calculating and storing the execution order of all nodes before the actual execution begins. The determination unit computes the topological sort order in advance, and the execution unit simply follows this pre-determined sequence without performing search operations during execution. This eliminates the runtime search overhead while maintaining correct process execution according to the graph structure.
2Productivity
If the priority of the object disposed on the rear stage side is changed in execution of image processing, then the processing order can be optimized, but the load of priority change process increases and processing efficiency is reduced
Solution Approach 1:
The patent applies preliminary action by determining the execution order of all objects in advance through topological sorting before execution begins. The determination unit calculates the optimal execution sequence considering dependency relationships and stage positions, then the execution unit follows this pre-determined order. This eliminates runtime priority adjustment operations while ensuring processes execute in an optimized sequence that prioritizes rear-stage objects appropriately.
3Ease of manufacture
If processes are sequentially executed according to an object group constructed by instruction, then the implementation is simple, but the processes are not executed in a descending order of processing efficiency
Solution Approach 1:
The patent replaces the simple sequential execution mechanism with a topologically sorted execution mechanism. Instead of executing objects in the order they appear in the input instruction, the determination unit performs topological sorting to reorder objects based on their dependency relationships and stage positions. This substitution maintains implementation simplicity through automated sorting algorithms while achieving optimized execution order that improves processing efficiency by prioritizing rear-stage objects.
Data Source
AI summary
An image processing apparatus that performs a partial process with respect to each piece of divided image data obtained by dividing an input image expressed by input image data into partial regions using each object of an object group in which plural objects for executing image processing are connected to each other in a directed acyclic graph form, including: an assignment section that assigns a dependency relationship of processes to the partial processes between the connected the objects and assigns a priority to each partial process; a registration section that arranges executable partial processes on the basis of the dependency relationship in accordance with the assigned priorities and registers the result in an executable partial process list; and an execution section that executes the partial processes in a descending order of the priorities in the executable partial process list registered by the registration section.