Sweep-Style Optical Code Reader Frame Buffer Prioritization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional imager-based optical code data readers do not prioritize certain image frames, leading to inefficient allocation of resources such as decoder processor dwelling time and frame buffer memory utilization, which reduces the likelihood of successfully decoding an optical code during a single sweep through the read zone.
Innovation Solution
Implementing a prioritization scheme for image frames, where initial sweep frames are given higher priority than subsequent presentation frames, with optimized frame rate and decoder processing dwelling time allocation to increase the likelihood of decoding an optical code during initial moments of a sweep.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional data readers treat all image frames equally, then the system is simple to implement, but resource allocation becomes inefficient and decoding success rate decreases
Solution Approach 1:
The patent segments image frames into different categories (sweep frames and presentation frames) with different priorities. Sweep frames are captured at a higher frame rate and given higher priority for decoding, while presentation frames are captured at a lower frame rate and given lower priority. This segmentation allows efficient resource allocation by treating different frames differently based on their importance for optical code detection.
Solution Approach 2:
The patent implements dynamic frame rate adjustment and priority-based resource allocation. The system dynamically switches between capturing sweep frames at a first frame rate and presentation frames at a second frame rate. The decoder dynamically allocates processing time and memory resources based on frame priority, creating a dynamic and adaptive system that optimizes decoding success while managing computational resources.
2Reliability
If the data reader captures more image frames at higher frame rate, then the likelihood of capturing optical code increases, but frame buffer memory becomes full faster and processing time increases
Solution Approach 1:
The patent divides frames into sweep frames (high priority, captured at higher frame rate) and presentation frames (low priority, captured at lower frame rate). This segmentation allows the system to capture optical codes during critical sweep moments at high frame rate while using lower frame rate for less critical presentation moments, thereby reducing overall processing time while maintaining high capture probability.
Solution Approach 2:
The patent changes the frame rate parameter dynamically based on frame category. Sweep frames are captured at a first frame rate optimized for capturing optical codes, while presentation frames are captured at a second, lower frame rate. This parameter change allows the system to balance between capturing sufficient frames for reliable optical code detection and minimizing total processing time.
3Measurement precision
If the data reader allocates more decoder processing time to all frames, then decoding accuracy improves, but overall processing speed decreases
Solution Approach 1:
The patent segments frames into high-priority sweep frames and low-priority presentation frames, applying different processing time allocations to each. Sweep frames receive more decoder processing time for high accuracy, while presentation frames receive less processing time. This segmentation enables the system to maintain high decoding accuracy for critical frames while improving overall processing speed.
Solution Approach 2:
The patent changes the decoder processing dwelling time parameter based on frame priority. High-priority sweep frames are allocated longer processing time for accurate decoding, while low-priority presentation frames are allocated shorter processing time. This dynamic parameter adjustment optimizes the balance between decoding accuracy and processing speed.
4Loss of information
If the data reader uses frame buffer memory for all captured frames, then no information is lost, but memory utilization becomes inefficient and resource allocation suboptimal
Solution Approach 1:
The patent segments frame storage into priority-based categories within the frame buffer. High-priority sweep frames are stored and retained longer, while low-priority presentation frames are stored with the understanding that they may be evicted first when memory is full. This segmentation allows efficient memory utilization while retaining critical frame data needed for optical code detection.
Solution Approach 2:
The patent implements a strategy where low-priority presentation frames are discarded from the frame buffer when memory is full, while high-priority sweep frames are retained. This selective discarding optimizes memory utilization efficiency by removing less critical data, while the system recovers from these losses by maintaining higher frame rates and capture probabilities for critical sweep moments.
Data Source
AI summary
Disclosed are techniques to enhance an in-counter sweep-style data reader, having frame buffer memory and an imager defining a read zone, so as to improve a likelihood of decoding an optical code appearing in initial image frames by managing utilization of the frame buffer memory according to a prioritization of different categories of image frames captured by the imager as an object bearing an optical code is passed through the read zone.