IP Library Granted Patent US 9,508,032
Granted Patent B2
US 9,508,032 · App. 13/896,268 · Granted Nov 29, 2016

Method of coding, decoding and usage of three-dimensional code

Inventor: Zhiping Meng (Guangzhou, CN)
G06K19/06037G06F17/30G06K7/1417H04B10/116H04L1/1861
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,508,032
App. No.
13/896,268
Granted
Nov 29, 2016
Kind
B2
Abstract

A three-dimensional code is generated by adding a time dimension in a two-dimensional code so as to form the three-dimensional information structure, so that a three-dimensional code flow with time continuity is generated. The basic unit of the three-dimensional code flow is a two-dimensional code having time information. An encrypted three-dimensional code is able to represent multiple aspects of user behavior including time, place, location, instruction, operation device and etc. Through the three-dimensional code technique, the three-dimensional code content is implanted into a display scene of a client display screen. The user is able to interact with the display device through the three-dimensional code. Through the present invention, a screen without any interactive function can display the interactive media on the screen.

Claims (24)

1. A method for coding and decoding three-dimensional code of a content to be displayed on a screen, comprising the steps executed by a computer of:

(a.1) acquiring an initial string A 1 every time unit, wherein said time unit is a constant or variable time interval T;

(a.2) adding a time information in said string A 1 acquire acquiring a string B 1 ;

(a.3) generating a two-dimensional code of said content;

(a.4) recalling step (a.1), step (a.2), and step (a.3) generating the next said two-dimensional code in the next time unit, wherein said time unit is a constant or variable time interval T;

(a.5) generating said two-dimensional code continuously forming a continuous code flow of a three-dimensional code of said content; and

(b.1) capturing said continuous code flow of said three-dimensional code through an identifier of two-dimensional codes acquiring a fragment of said three-dimensional code, wherein said fragment of said three-dimensional code comprises at least one frame of said two-dimensional code that displays on the screen of said identifier.

2. The method, as recited in claim 1 , wherein said two-dimensional code is generated by a two-dimensional code generation module which is selected from a group consisting essentially of a generation device of said two-dimensional code and a generation software of said two-dimensional code.

3. The method, as recited in claim 1 , wherein a format of said two-dimensional code is selected from a group consisting essentially of Aztec, Maxi, Code, QR Code, and Data Matrix.

4. The method, as recited in claim 1 , wherein said time unit refers to a time interval T, wherein T represents a constant time length or a function T(t) depending on time.

5. The method, as recited in claim 1 , wherein said initial string A 1 is selected from a group consisting essentially of a constant string and a variable string.

6. The method, as recited in claim 1 , wherein after said time information is added to said initial string A 1 to form said string B 1 , said string B 1 is encrypted to form a string S 1 , and then said two-dimensional code is coded with said string S 1 .

7. The method, as recited in claim 1 , wherein said continuous code flow of said three-dimensional code is displayed by utilizing a method of compression coding for image or video, including entropy coding, predictive coding, transform coding, hybrid coding, or said continuous code flow of the three-dimensional code is directly encapsulated into a format of AVI (Audio Video Interleaved), RMVB (RealMedia Variable Bitrate), MKV (Matroska Multimedia Container), ASF Advanced Steaming Format), WMV (Windows Media Video), MP4 (MPEG-4 Part 14), 3GP (Third Generation Partnership Project file format), and FLV (Flash Live Video).

8. The method, as recited in claim 1 , wherein said three-dimensional code is coded with time information and non-time information.

9. The method, as recited in claim 8 , wherein said non-time information is selected from a group consisting essentially of location information, device information, content information, user information, and command information.

10. The method, as recited in claim 1 , wherein the steps (a1)-(a5) uses an encryption algorithm utilizing a technique selected essentially from a symmetric encryption technique and an asymmetric encryption technique.

11. The method, as recited in claim 1 , wherein a basic unit of said three-dimensional code is said two-dimensional code coded with time information.

12. A method for coding and decoding three-dimensional code of a content to be displayed on a screen, comprising the steps executed by a computer of:

(a) continuously generating a plurality of two-dimension codes of said content in a time series forming a continuous code flow of a three-dimensional code of said content by the steps of:

(a.1) acquiring an initial string A 1 every time unit;

(a.2) adding a time information in said string A 1 acquiring a string B 1 ;

(a.3) generating one said two-dimensional code in said time unit of said content; and

(a.4) repeating the step (a.1), step (a.2), and step (a.3) to generate the next said two-dimensional code in the next time unit of said content; and

(b) capturing said continuous code flow of said three-dimensional code through an identifier of two-dimensional codes acquiring a fragment of said three-dimensional code, wherein said fragment of said three-dimensional code comprises at least one frame of said two-dimensional code that displays on said screen of said identifier.

Priority Claims (1)
CN 2012 1 0152116 · May 16, 2012 · national
Continuity (1)
Related Publication 20130306721A1 · Nov 21, 2013