Matrix Element Correspondence via Access Feature Table
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for establishing correspondences between elements of two matrices, particularly in camera-based systems, are inefficient and lack a simple and universal approach for processing partially populated matrices and various types of data, such as image and text sequences.
Innovation Solution
A method involving a write process to store positions of matrix elements in a correspondence table and a read process to establish mappings based on predefined offsets, allowing for efficient correspondence formation by ascertaining features 'on the fly' and using access features to address table elements, applicable to various matrix forms including Cartesian and hexagonal matrices.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If existing methods for establishing correspondences between matrix elements are used, then mappings can be formed between image points, but the processing is inefficient and lacks a simple universal approach
Solution Approach 1:
The correspondence formation process is segmented into two independent phases: a write process that processes the first matrix and stores position information in a correspondence table, and a read process that processes the second matrix and retrieves stored positions. This segmentation allows parallel processing and eliminates the need for complex real-time comparisons between matrix elements, thereby improving efficiency while maintaining method simplicity.
Solution Approach 2:
The write process performs preliminary action by pre-processing the first matrix and storing all necessary position information in the correspondence table before the read process begins. This preliminary storage of position data based on access features eliminates the need for complex runtime computations during correspondence formation, significantly improving processing efficiency.
2Loss of time
If features are ascertained 'on the fly' during processing, then processing time is reduced, but intermediate storage is required
Solution Approach 1:
The correspondence table serves as an intermediary structure that temporarily stores position information derived from access features during the write process. This intermediary storage allows the read process to quickly retrieve pre-computed positions without performing complex feature analysis, reducing processing time while using a structured intermediate storage mechanism.
3Ease of operation
If a correspondence table is used to store position information, then mapping establishment is simplified, but additional data structure is required
Solution Approach 1:
The correspondence table is designed as a universal data structure that can handle various types of matrices (Cartesian, hexagonal) and different feature types through a unified access feature mechanism. This universal approach simplifies mapping establishment across different applications while maintaining a consistent, relatively simple data structure that does not require complex customization for different matrix types.
Data Source
AI summary
A method for ascertaining/mapping between a matrix element (ME) and a comparison ME (CME) of a comparison matrix (CM), including writing the ME position in a table element (TE) of a correspondence table (CT) for a number of MEs, and following a predefined offset, reading out a TE, ascertaining the ME position stored in the TE until the read for the same number of MEs has been performed, establishing a mapping from the TE's read-out position and a CME's current position. The writing includes reading out a ME feature, ascertaining an access feature (AF) from the ME feature, ascertaining a TE of the CT from the AF, and writing the ME position in the ascertained TE. The reading includes reading out a CME feature, ascertaining an AF from the CME, ascertaining a TE of the CT from the AF, and reading out the ME's stored position from the ascertained TE.