Bidimensional Matrix Code Dot Luminosity Data Density

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Bidimensional graphic matrix codes face limitations in data density due to distortion issues during printing and optical acquisition, particularly with the introduction of separation regions that reduce the number of codifiable bits per square inch.

Innovation Solution

A bidimensional graphic matrix code design that eliminates separation regions, using delimiting elements composed of alternating luminosity groups to enhance distinguishability and data density, with each character formed by dot matrices and delimiting elements aligned to facilitate decoding without adjacent low-luminosity dot interference.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If separation regions are introduced to reduce distortion sensitivity, then decoding reliability is improved, but data density deteriorates

Engineering Contradiction:
Improvedecoding reliabilityVSAvoiddata density
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The patent removes the separation regions (white dots) from the code structure entirely, extracting the problematic element that caused the contradiction. By eliminating the separation regions, the code achieves both high data density and sufficient decoding reliability through alternative means (error correction algorithms and optimized dot patterns).

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent changes the parameters of the code structure by using variable dot patterns and luminosity values within the useful sub-matrices themselves, rather than relying on separate high-luminosity separation regions. This allows the code to maintain reliability while maximizing data density.

Inventive Principle:
Principle #35Parameter changes

2Quantity of substance

If resolution is increased to codify more bits per square inch, then data density is improved, but printing and acquisition distortion worsens

Engineering Contradiction:
Improvebits per square inchVSAvoidprinting distortion
Core Design Contradiction:
Quantity of substanceVSManufacturing precision

Solution Approach 1:

The patent incorporates error correction capabilities that cushion against the inevitable distortions from printing and acquisition. By building in redundancy and error tolerance beforehand, the system can withstand higher resolutions and more aggressive packing without sacrificing reliability.

Inventive Principle:
Principle #11Beforehand cushioning (Prior cushioning)

Solution Approach 2:

The patent uses variable dot luminosity and pattern parameters to encode data in a way that is more resilient to distortion. By changing how data is represented (using multiple luminosity levels and patterns rather than simple binary dots), the system can achieve higher density while maintaining robustness to printing variations.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentEP2666127B1A bidimensional graphic matrix code
Publication Date: 2019.11.06 RITELLI
  • EP2666127B1 patent drawingFigure 1~2
  • EP2666127B1 patent drawingFigure 3

AI summary

A bidimensional graphic matrix code 1 has a plurality of words orientated along a first direction (D1), each word (2) formed from characters (3) arranged along a line which is parallel to the first direction (D1). Each character is formed from a first dot matrix, each dot (5) having a determined level of luminosity. Delimiting elements delimit each word, the delimiting elements orientated along a second direction (D2) which is perpendicular to the first direction (D1). Each delimiting element is formed by a line of dots arranged parallel to the second direction (D2). Each delimiting element is identifiable as groups arranged in a line, each group (8) comprising dots (5) having predetermined levels of luminosity, the delimiting elements interposed between adjacent words, such that identification of a delimiting element (6) enables identification of an initial or a final part of a word (2) adjacent to the delimiting element.