Polar Coordinate Code for High-Density Beverage Container Encoding

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing beverage and foodstuff preparation systems face limitations in encoding density, visibility, complexity, and cost-effectiveness of codes on containers, which restrict their ability to efficiently process and encode a wide range of preparation parameters.

Innovation Solution

A container with a code comprising a reference portion and a data portion, where the data portion is arranged on an encoding line that intersects the reference line, allowing for high encoding density and reduced visibility, using a Polar coordinate system for image processing, and enabling cost-effective decoding without the need for complex alignment.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of information

If traditional linear barcode codes are used on containers, then the code is simple to implement, but the encoding density is limited and the code is highly visible

Engineering Contradiction:
Improveencoding densityVSAvoidcode complexity
Core Design Contradiction:
Loss of informationVSDevice complexity

Solution Approach 1:

The patent transitions from traditional linear 1D barcodes to a 2D polar coordinate system for code arrangement. The code consists of multiple concentric circular encoding lines with data units positioned at specific radial distances and angular positions, enabling significantly higher encoding density within the same physical space while maintaining readability by standard imaging devices.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

Solution Approach 2:

The patent changes the coordinate system from Cartesian to polar coordinates, allowing data to be encoded through radial distance and angular position parameters. This parameter-based encoding approach enables more information to be packed into the same area while providing flexibility in code design and interpretation.

Inventive Principle:
Principle #35Parameter changes

2Measurement precision

If complex alignment procedures are implemented for code reading, then measurement precision is improved, but processing time and complexity increase

Engineering Contradiction:
Improvecode reading precisionVSAvoidprocessing time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent introduces an asymmetric reference unit configuration that defines a unique reference direction without requiring complex alignment procedures. The reference units are arranged in a specific asymmetric pattern that allows the decoding system to automatically determine the correct orientation and starting position, eliminating the need for time-consuming alignment while maintaining high reading precision.

Inventive Principle:
Principle #4Asymmetry

3Loss of information

If high encoding density is achieved through complex code structures, then information capacity increases, but manufacturing cost and complexity increase

Engineering Contradiction:
Improveinformation capacityVSAvoidmanufacturing cost
Core Design Contradiction:
Loss of informationVSEase of manufacture

Solution Approach 1:

The patent designs a universal code structure that can encode multiple preparation parameters (temperature, pressure, time, volume, etc.) using the same polar coordinate system and data unit arrangements. This multi-functional code design eliminates the need for different code types for different parameters, simplifying the manufacturing process while maintaining high information capacity.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentEP3493117B1Code and container of system for preparing a beverage or foodstuff
Publication Date: 2023.07.05 SOCIETE DES PRODUITS NESTLE SA
  • EP3493117B1 patent drawingFigure 1A~1B
  • EP3493117B1 patent drawingFigure 2A~3A
  • EP3493117B1 patent drawingFigure 3B~4A

AI summary

Code for encoding beverage preparation or foodstuff preparation information, the code comprising a reference portion and a data portion,the reference portion comprising an arrangement of at least two reference units defining a virtual reference line r; the data portion comprising: - a pair of data units arranged on a virtual encoding line D which intersects the virtual reference line r at a virtual intersection point, the pair of data units being arranged at any distance (d) along said virtual encoding line D from said virtual intersection point, said distance d encoding a value of a parameter Vp of the preparation information, whereby the virtual encoding line D is circular or comprises a segment of a circle and is arranged with a tangent thereto orthogonal the virtual reference line r at the virtual intersection point; and - one or more further data units occupying a one or more of discrete positions arranged on said virtual encoding line D, whereby said discrete positions either comprise or do not comprise a further data unit of said one or more further data units as a variable to at least partially encode a parameter of the preparation information, and whereby said discrete positions on said virtual encoding line D are each arranged at a location determined relative to said distance (d) encoding said value of a parameter Vp of the preparation information, wherein the centres of the two data units of said pair of data units are separated from each other by a distance x, wherein said discrete positions are spaced apart from the closest data unit of said pair of data units by distances different from said distance x between said two data units of said pair of data units, wherein: - said discrete positions are arranged with a distance y between the centres of two adjacent discrete positions, - a distance between the centre of a discrete position adjacent said pair of data units and the centre of the closest data unit of said pair of data units is equal to said distance y between two adjacent discrete positions, - said distance y between two adjacent discrete positions is not a multiple nor a divisor of said distance x between said two data units of said pair of data units.