CN116842984A

CN116842984A - Decoding method of graphic code and code making method thereof

Info

Publication number: CN116842984A
Application number: CN202310269319.3A
Authority: CN
Inventors: 孙航建; 袁童童; 黄山洪; 方立清
Original assignee: Ant Blockchain Technology Shanghai Co Ltd
Current assignee: Ant Blockchain Technology Shanghai Co Ltd
Priority date: 2023-03-17
Filing date: 2023-03-17
Publication date: 2023-10-03

Abstract

The specification provides a decoding method of a graphic code and a code making method thereof, wherein the method comprises the following steps: receiving a code making template uploaded by a user, and determining identification information corresponding to the code making template, wherein the code making template is defined with corresponding fields; updating the corresponding relation between the maintained code making template and the template identification information based on the received code making template and the corresponding identification information; acquiring a code value to be analyzed obtained by scanning a target graphic code by a code scanning terminal; determining corresponding template identification information in the code value to be analyzed, and determining a corresponding code making template according to the corresponding relation and the determined template identification information; and returning a corresponding decoding result to the code scanning terminal based on the field defined by the determined code making template.

Description

Decoding method of graphic code and code making method thereof

Technical Field

The present disclosure relates to the field of computer technologies, and in particular, to a method for decoding a graphic code and a method for making the graphic code.

Background

The graphic code is a pattern which is arranged according to a certain rule by using a plurality of specific geometric figures to record information. In order to meet different business requirements, different types of graphic codes, such as personal codes and object codes, can be issued. Taking the person code as an example, the person code can be specifically an old man code, and the object code can also comprise a place code, a commodity code and the like. How to flexibly make and parse graphic codes according to the service demands is a problem to be solved.

Disclosure of Invention

In order to overcome the problems in the related art, the present specification provides a decoding method of a graphic code and a decoding method thereof.

According to a first aspect of embodiments of the present specification, there is provided a decoding method of a graphic code, the method comprising:

receiving a code making template uploaded by a user, and determining identification information corresponding to the code making template, wherein the code making template is defined with corresponding fields;

updating the corresponding relation between the maintained code making template and the template identification information based on the received code making template and the corresponding identification information;

acquiring a code value to be analyzed obtained by scanning a target graphic code by a code scanning terminal;

determining corresponding template identification information in the code value to be analyzed, and determining a corresponding code making template according to the corresponding relation and the determined template identification information;

and returning a corresponding decoding result to the code scanning terminal based on the field defined by the determined code making template.

According to a second aspect of embodiments of the present disclosure, there is provided a method for coding a graphic code, the method comprising:

responding to a code making request of a user, and determining a code making template indicated by the code making request;

generating a corresponding code making data set based on template identification information corresponding to the determined code making template, wherein the code making data set contains the template identification information;

and generating a corresponding code value according to the code making data set, and generating a corresponding graphic code based on the code value.

According to a third aspect of embodiments of the present specification, there is provided a decoding apparatus of a graphic code, the apparatus comprising:

the receiving unit is used for receiving the code making template uploaded by the user, determining the identification information corresponding to the code making template, and defining a corresponding field in the code making template;

the updating unit is used for updating the corresponding relation between the maintained code making template and the template identification information based on the received code making template and the corresponding identification information;

the acquisition unit is used for acquiring a code value to be analyzed obtained by scanning the target graphic code by the code scanning terminal;

the determining unit is used for determining the corresponding template identification information in the code value to be analyzed and determining a corresponding code making template according to the corresponding relation and the determined template identification information;

And the return unit is used for returning a corresponding decoding result to the code scanning terminal based on the field defined by the determined code making template.

According to a fourth aspect of embodiments of the present specification, there is provided a code making apparatus for graphic codes, the apparatus comprising:

the template receiving unit is used for receiving a code making template uploaded by a user, determining identification information corresponding to the code making template, and defining a corresponding field in the code making template;

the template updating unit is used for updating the corresponding relation between the maintained code making template and the template identification information based on the received code making template and the corresponding identification information;

a request determining unit, configured to determine a code making template indicated by a code making request in response to the code making request of a user;

the generating unit is used for generating a corresponding code making data set based on the template identification information corresponding to the determined code making template, wherein the code making data set contains the template identification information;

and the graphic code generating unit is used for generating a corresponding code value according to the code making data set and generating a corresponding graphic code based on the code value.

According to a fifth aspect of embodiments of the present specification, there is provided an electronic device comprising:

A processor; a memory for storing processor-executable instructions; wherein the processor is configured to implement the steps of the method of the first or second aspect described above.

According to a sixth aspect of embodiments of the present description, there is provided a computer-readable storage medium having stored thereon executable instructions; wherein the instructions, when executed by a processor, implement the steps of the method of the first or second aspect described above.

In the embodiment of the present disclosure, since the code value corresponding to the graphic code may only include the template identification information, that is, the corresponding code value is controlled within a shorter length, in the decoding stage, a higher decoding efficiency may be ensured; meanwhile, because the decoding server can maintain a plurality of code making templates and the code making templates are defined with corresponding fields, when decoding is carried out, corresponding information groups can be returned according to the fields defined by the corresponding code making templates, so that the information groups returned by decoding can be flexibly controlled, and the change of service requirements is met; in addition, for the same graphic code, the corresponding returned decoding information set can be controlled by switching different code making templates for decoding, so that the graphic code can be replaced without updating, the service requirement can be met, and the high compatibility is realized.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the specification and together with the description, serve to explain the principles of the specification.

FIG. 1 is a schematic diagram of a decoding and transcoding system for graphic codes according to an exemplary embodiment of the present disclosure;

FIG. 2 is a flow chart of a method for decoding a graphics code according to an exemplary embodiment of the present disclosure;

FIG. 3 is a schematic diagram of a code template according to an exemplary embodiment of the present disclosure;

FIG. 4 is a flow chart of a page jump provided by an exemplary embodiment of the present description;

FIG. 5 is a flow chart of a method for encoding a graphic code according to an exemplary embodiment of the present disclosure;

FIG. 6 is a schematic diagram of a code making and decoding process according to an exemplary embodiment of the present disclosure;

FIG. 7 is a schematic block diagram of an electronic device according to an exemplary embodiment of the present disclosure;

FIG. 8 is a block diagram of a decoding apparatus for graphic codes according to an exemplary embodiment of the present disclosure;

Fig. 9 is a block diagram of a code making apparatus for graphic codes according to an exemplary embodiment of the present disclosure.

Detailed Description

Reference will now be made in detail to exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, the same numbers in different drawings refer to the same or similar elements, unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with one or more embodiments of the present specification. Rather, they are merely examples of apparatus and methods consistent with aspects of one or more embodiments of the present description.

It should be noted that: in other embodiments, the steps of the corresponding method are not necessarily performed in the order shown and described in this specification. In some other embodiments, the method may include more or fewer steps than described in this specification. Furthermore, individual steps described in this specification, in other embodiments, may be described as being split into multiple steps; while various steps described in this specification may be combined into a single step in other embodiments. It should be understood that although the terms first, second, third, etc. may be used in this specification to describe various information, these information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, the first information may also be referred to as second information, and similarly, the second information may also be referred to as first information, without departing from the scope of the present description. The word "if" as used herein may be interpreted as "at … …" or "at … …" or "responsive to a determination", depending on the context.

User information (including but not limited to user equipment information, user personal information, etc.) and data (including but not limited to data for analysis, stored data, presented data, etc.) referred to in this specification are both information and data authorized by the user or sufficiently authorized by the parties, and the collection, use and processing of relevant data requires compliance with relevant laws and regulations and standards of the relevant country and region, and is provided with corresponding operation portals for the user to choose authorization or denial.

With the development of internet technology, the application of graphic codes in the life of people is becoming wider and wider. The graphic Code is of various types, for example, the graphic Code described in the specification can be in various forms such as a bar Code (barcode), a two-dimensional Code (Quick Response Code, or QR Code), a three-dimensional Code, and the like. Taking a two-dimensional Code as an example, multiple systems such as Data Matrix, maxiCode, aztec, QR Code, PDF417 and the like can be adopted. Taking a more common two-dimensional code as an example, the two-dimensional code is also called a two-dimensional bar code (2-dimensional bar code), and is a geometric shape for representing data information by using a graph corresponding to binary data.

According to the difference of application scenes, two-dimensional codes can be divided into different types, such as: a person code and an object code. Specifically, the person code may include an old man code, and the object code may include a commodity code, a place code, and the like. Taking the above-mentioned elder code and place code as examples, the elder code corresponds to have the elder code system code template, utilize this elder code system code template to carry out system code and decode, this elder code system code template definition has the field that the elder code was concerned, for example, the elder code system code template can be defined to have field A, field B and field C, field A can be used for representing the name of holding the sign indicating number person, field B can be used for representing the age of holding the sign indicating number person, field C can represent the identity card number of holding the sign indicating number person, after the corresponding sweep the sign indicating number terminal scans this elder code, can initiate the request to decoding server based on the code value that corresponds, make decoding server can obtain the data that the field that above-mentioned elder code system code template defined corresponds, for example: the name of the code holder for the old is Zhangsan, the age is 64 years, the identity card number is 12145212, and the like.

Similarly, the place code corresponds to a place code making code template, which can be used for making codes and decoding. The field code system code template defines fields concerned by the field code, for example, the field code system code template may define fields a, B and C, the field a may be used for characterizing a field name, the field B may be used for characterizing a field location, the field C may be used for characterizing information of the field contact person, and after the corresponding code scanning terminal scans the field code, a request may be initiated to the decoding server based on the corresponding code value, so that the decoding server may obtain data corresponding to the field defined by the field code system code template, for example: the place name corresponding to the place code is 'Beijing A mall', the position is 'Beijing A street A road 322 number', the place contact telephone is '010-1212546', and the like. However, in the related art, the old man code is taken as an example, and only a unified and unique old man code making template is allowed to be used for making and decoding, so that when the decoding server side decodes, only the fixed and invariable data corresponding to the field defined by the making template can be obtained, the information group returned by decoding is limited, and the change of the service requirement cannot be met.

In view of the foregoing, the present disclosure provides an improved decoding and coding scheme for graphic codes to solve the problems in the related art, and the following detailed description is provided with reference to the accompanying drawings.

Fig. 1 is a schematic architecture diagram of a decoding and code making system for graphic codes according to an exemplary embodiment of the present disclosure, where the system may include a network 10, a server 11, and several electronic devices, such as a mobile phone 12, a mobile phone 13, and a mobile phone 14.

The server 11 may be a physical server of a separate host, or the server 11 may be a virtual server (e.g., cloud server) carried by a host cluster. The server 11 may support decoding of the graphics code as a decoding server as described above. In some cases, the server 11 may also support the code making of the graphic code, that is, serve as a code making server; of course, the code making server and the decoding server may be disposed on different servers, which is not limited in this description. Specifically, the server 11 may receive the code making template uploaded by the user, and the field corresponding to the code making template may be customized by the user, so that various code making templates may be maintained; the server 11 can obtain a code value to be analyzed obtained by scanning a target graphic code (such as QR1 and Quick Response 1 in FIG. 1) by a code scanning terminal (such as a mobile phone 13); the server 11 can determine the corresponding template identification information in the code value to be analyzed, and determine the corresponding code making template according to the corresponding relation and the determined template identification information; the server 11 may return a corresponding decoding result to the code scanning terminal based on a field defined by the determined code making template.

It should be noted that, although in the embodiment shown in fig. 1, the server 11 may integrate functions of code making and decoding; however, in some embodiments, a separate code making server may be additionally configured, so that the code making of the graphic code is performed by the code making server, and the decoding of the graphic code is performed by the decoding server, which is not limited in this specification.

The handsets 12-14 are but one type of electronic device that may be used by a user. Indeed, it is obvious that the user may also use electronic devices of the type such as: tablet devices, notebook computers, palm top computers (PDAs, personal Digital Assistants), wearable devices (e.g., smart glasses, smart watches, etc.), VR (Virtual Reality) devices, AR (Augmented Reality ) devices, or code guns or the like that are specifically used to scan two-dimensional codes, to which one or more embodiments of the present disclosure are not limited. The network 10 may comprise various types of wired or wireless networks. The mobile phones 12-14 can be code scanning terminals, and a user can scan graphic codes through the code scanning terminals and send scanned code values to be analyzed to the server 11 for analysis; and accessing the preset service associated with the graphic code according to the analysis result returned by the user. It can be understood that the code scanning terminal may be assembled with or externally connected with a camera, a camera module, and other hardware for image acquisition, so as to scan the graphic code, for example, the mobile phone 13 may scan the two-dimensional code QR1, the mobile phone 14 may scan the two-dimensional code QR2, and the like, which will not be described again.

Fig. 2 is a flowchart of a method for decoding a graphic code according to an exemplary embodiment of the present disclosure, which may include the following steps:

step 202, receiving a code making template uploaded by a user, and determining identification information corresponding to the code making template, wherein the code making template is defined with corresponding fields.

As previously described, the code making template may be considered as a data model for storing two-dimensional code information, and the code making template may define different fields to map and store corresponding information. Fig. 3 is a schematic diagram of a code making template according to an exemplary embodiment of the present disclosure. The transcoding template may include the following fields: guide information 302 for filling in the corresponding URL (Universal Resource Locator, uniform resource locator) so that the corresponding service page can be pointed to; code system identifier 304, which is used to characterize what system the graphic code belongs to, for example, belonging to a citizen code system or belonging to a scene code system, etc.; a code configuration ID 306 for characterizing the configuration ID of the graphic code, thereby determining configuration information of the graphic code, such as style of the graphic code, security policy employed, etc.; code version number 308, which is used to characterize the version of the graphics code, can be generally represented by monotonically increasing numbers; code class identifier 310, which may characterize different entity types of the code; code source identifier 312, which may be used to characterize the source of the graphics code, such as the platform on which the graphics code was generated; code channel identification 314, which may characterize the code channel; unique reference numeral 316, which can characterize a unified basic identity; extending the information length 318; expanding information content 320; code generation time 322; code valid time 324; code body data signature 326. Wherein the extended information length 318 and the extended information content 320 may characterize the corresponding extended data, e.g., with code scene information, etc., and the code generation time 322, code validity time 324, and code body data signature 326 may be used to record the corresponding security information, thereby preventing tampering. So from the role of each field, code system identifier 304, code configuration ID 306, code version number 308, code classification identifier 310, code source identifier 312, code channel identifier 314, and unique reference number 316 may be collectively referred to as standard fields (or standard fields); the extension information length 318 and the extension information content 320 are collectively referred to as an extension field (or extension field); the code generation time 322, the code validity time 324, and the code body data signature 326 are collectively referred to as a security check field (or security check field); the boot information 302 is referred to as a boot field (or boot domain). It should be noted that, each field in the drawing template shown in fig. 3 is only used as an exemplary illustration, and may be modified according to practical situations, which is not limited in this specification. The decoding server side can receive the code making template uploaded by the user and determine the identification information corresponding to the code making template, and the field defined by the code making template uploaded by the user can be customized by the user according to the actual requirement, so that different code making requirements of the user are met. After receiving the code making template uploaded by the user, the identification information corresponding to the code making template can be determined, and the identification information can have uniqueness, so that the identification information can correspond to only one code making template. For example, assuming that the user uploads the code making template D, it may be determined that the identification information corresponding to the code making template D is 04, and the identification information has uniqueness, that is, the identification information 04 may correspond to only the code making template D.

And 204, updating the corresponding relation between the maintained code making template and the template identification information based on the received code making template and the corresponding identification information.

The decoding server may maintain a correspondence between the transcoding template and the template identification information. Which may be as shown in table 1:

code making template	Template identification information
		Code making template A	01
Code making template B	02
		Code making template C	03

TABLE 1

As described above, the user may upload the code making template, for example, the user uploads the code making template D, and the decoding server may determine that the identification information of the code making template D is 04, thereby updating the correspondence shown in table 1 to obtain the correspondence shown in table 2 below.

Code making template	Template identification information
		Code making template A	01
Code making template B	02
		Code making template C	03
Code making template D	04

TABLE 2

And 206, acquiring a code value to be analyzed obtained by scanning the target graphic code by the code scanning terminal.

The code scanning terminal can operate a corresponding code scanning program: for example, a code scanning program of a bus code is operated in a code scanning machine of a bus, and code scanning programs (such as an application program, an applet and the like) of various graphic codes such as an old man code, a place code and the like are operated in a mobile phone of a user. The user can scan the target graphic code by using a certain code scanning program running in the code scanning terminal to obtain a corresponding code value, and the code value can be a character string in binary or hexadecimal formats. The code value can provide corresponding service for the code scanning terminal only by further analysis of the decoding server, and the code value is recorded as the code value to be analyzed. After the code scanning terminal scans the codes, the code value to be analyzed can be obtained and sent to the decoding server. Correspondingly, the code value to be analyzed can only store the corresponding template identification information, so that the code value is controlled within a shorter length, and higher decoding efficiency can be ensured in the decoding stage.

Step 208, determining the corresponding template identification information in the code value to be analyzed, and determining the corresponding code making template according to the corresponding relation and the determined template identification information.

The decoding server determines the corresponding template identification information in the code value to be analyzed, so that the corresponding code making template can be determined based on the corresponding relation shown in the table 2. For example, assuming that the template identification information included in the code value to be analyzed is 01, based on the correspondence shown in table 2, it may be determined that the code making template corresponding to the code value to be analyzed is code making template a; assuming that the template identification information contained in the code value to be analyzed is 04, determining that the code making template corresponding to the code value to be analyzed is code making template D based on the corresponding relation shown in Table 2; and because the code value to be analyzed can only store the corresponding template identification information, the code value to be analyzed is controlled in a shorter length, so that the decoding server side can have higher decoding efficiency for the code value to be analyzed with the shorter length, and the decoding efficiency of the graphic code is ensured.

Step 210, based on the field defined by the determined code making template, returning a corresponding decoding result to the code scanning terminal.

As described above, the decoding server may determine that the code making template is the code making template a, and then the decoding server may return a corresponding decoding result to the code scanning terminal based on the field defined by the code making template a. Of course, since the number of code making templates maintained by the server may be greater than two, the information set returned by the graphic code decoding may be controlled by switching different effective code making templates. For example, the graphic code generated by the code making template A can return the name, home address and ID card number of the code holder after decoding. After the code making template B is switched to generate the graphic code, the name and the mobile phone number of the code holder can be returned for decoding the graphic code. It is not difficult to find that compared with the prior art, only the same code making template can be used for making and decoding, after the configuration of multiple templates is carried out, the decoding return data is controlled by switching different effective code making templates, the flexibility of decoding results is improved, the decoding requirements under different scenes are met, and for the same graphic code, the returned information set can be controlled by switching different code making templates, the graphic code is not required to be updated and replaced, and the graphic code has extremely high compatibility.

As shown in table 1, the decoding server may maintain multiple templates, such as a code making template a, a code making template B, and a code making template C, so as to control the information set returned by decoding by switching different effective templates, thereby meeting the code making requirements of different scenes. In combination with practical situations, the switching of the code making template is usually to switch the extension field, while the standard field may be unified, for example, taking the scene code as an example, it is usually just switching the places, but no change is needed to the style of the scene code, the security policy, the version of the scene code, and the like. Thus, in one embodiment, the code making templates may include standard fields and extension fields, and each code making template defines a unified standard field and a custom extension field. Of course, in some embodiments, the standard fields of each code template may also be custom, which is not limited in this specification.

As previously described, each applet or code-scanning APP, etc. can be used as a code-scanning path for a user to scan codes by running the corresponding applet, code-scanning APP, etc. on the device. In the related art, different code scanning paths can respectively correspond to different decoding servers, and different code making templates are respectively deployed on the decoding servers, so that when a user faces a graphic code, the user needs to select an appropriate code scanning path to scan the code, and after the code value obtained by scanning the code is uploaded to the corresponding decoding server, the code value can be decoded by the appropriate code making template, otherwise, the situation that the code cannot be decoded correctly is likely. For example, after the graphic codes are scanned by the code scanning machine on the bus, the obtained code values are uploaded to the corresponding decoding server, and if only the code making templates corresponding to the bus codes are deployed on the decoding server, the code values corresponding to the bus codes can be analyzed only, but the code values of other types of graphic codes can not be analyzed. Therefore, passengers can finish online payment and take a bus smoothly only by displaying a bus code to the code scanning machine for scanning, and if other types of graphic codes are displayed to the passengers, the passengers cannot take the bus smoothly; for another example, for a graphic code issued by a specific type of applet, only the decoding server corresponding to the applet maintains a corresponding code making template, and the decoding servers corresponding to other applets or any type of code scanning program do not maintain the code making template, so that if a user wants to scan the graphic code to access a service page through a mobile phone, the user can only scan the graphic code by using the applet running in the mobile phone, and after using other types of code scanning programs, the user cannot scan or scan the graphic code, and the user cannot jump to the expected service page because the corresponding decoding server cannot decode the graphic code correctly (because the corresponding code making template is not maintained). In some cases, different code scanning paths may also correspond to the same decoding server, so that the decoding server maintains a plurality of code making templates correspondingly, but the code making templates are isolated from each other and only used for the corresponding code scanning paths. Specifically, if the code is scanned based on a certain code scanning path A, after the obtained code value is uploaded to the decoding server, the decoding server only decodes the code through the code making template corresponding to the code scanning path A. Then, if the user uses the wrong code scanning approach, the decoding server still fails to decode.

In view of this, the present specification proposes to deploy multiple sets of code making templates at the decoding server side, and establish a binding relationship between the code making templates. Then, each code making template can be bound with an associated code making template, so that when the code making templates are bound with the associated code making templates, a corresponding decoding result can be returned to the code scanning terminal based on the fields defined by the associated code making templates. Therefore, for the target graphic code obtained by code making based on the associated code making template, even if the code is not scanned by the code scanning path corresponding to the associated code making template, the code value to be analyzed obtained by code scanning can be analyzed by adopting the associated code making template. For example, if the code making template B is bound to the code making template a, for the graphic code S generated based on the code making template B, the code scanning terminal scans the graphic code S through the code scanning path corresponding to the code making template a to obtain the code value to be analyzed, at this time, the code making template a can be determined as the standard code making template according to the code scanning path, and the code making template B can be determined as the corresponding associated code making template, so that the code value to be analyzed can be analyzed by preferentially adopting the code making template B, and the data corresponding to the field defined by the code making template B is returned, thereby realizing the unification of the decoding effects of the standard code making template and the associated code making template. For example, in the situation that the old people code making template is bound to the public transportation code making template, a passenger displays the old people code to a code scanning machine on a bus through a mobile phone, the public transportation code making template can be determined as a standard code making template, the associated old people code making template is determined as a corresponding associated code making template, and at the moment, the old people code making template can be adopted to decode the code value to be analyzed, so that the passenger can scan the code smoothly. Therefore, passengers can use the bus code to sweep the code and ride, and old people can also use the old people code to sweep the code and ride, so that the code sweeping effect of multi-code fusion is realized, the flexibility and convenience in the use process of the graphic code are obviously improved, and the use efficiency of the graphic code is improved.

At present, the code scanning terminal can jump to the page by scanning the graphic code, and if different users scan the same two-dimensional code by using different mobile phones, the code scanning terminal can jump to the page associated with the two-dimensional code. In this way, each page needs to be associated with a different graphics code, and therefore the number of graphics codes that need to be generated is large. Under the scenes of more pages or smaller difference of different pages, the management burden and the resource waste of the graphic codes can be caused, and the efficient utilization of the graphic codes is not facilitated.

In this regard, the decoding server may further obtain, in response to a page skip request triggered by a code scanning event of a target graphic code scanned by the code scanning terminal, code scanning related data corresponding to the code scanning event, where the target graphic code corresponds to a plurality of pages, and each page is created with a corresponding page matching rule respectively; and inquiring a target page matching rule matched with the code scanning related data in each page matching rule, and triggering the code scanning terminal to display a target page corresponding to the target page matching rule. It can be understood that the code scanning related data (such as the user identity, the type of the code scanning terminal, the location where the target graphic code is located, the code scanning time, etc.) corresponding to different code scanning events are not always identical, so for different code scanning events, the scheme can trigger the code scanning terminal to display different pages according to different code scanning related data: if different users scan the same graphic code by using different code scanning terminals to respectively jump to different pages, the same user scans the two-dimensional code positioned at different positions at different times by using the same code scanning terminal to respectively jump to different pages, and the like. Therefore, in the related technology that the same graphic code is jumped to the same page when different code scanning terminals scan the same graphic code, the code scanning terminal in the scheme can show the page jumping effect of 'one code kiloface'. It can be understood that the multiple pages in the scheme can be associated to the same graphic code (i.e. the target graphic code), so that multiplexing of the multiple pages to the same graphic code is realized, not only is graphic code resources saved, but also management burden of the graphic code is reduced, and the use efficiency of the graphic code is improved. That is, the method described in the present specification may further include the following steps (as shown in fig. 4):

Step 402, responding to a page jump request triggered by a code scanning event of a code scanning terminal scanning a target graphic code, wherein the decoding server side obtains code scanning related data corresponding to the code scanning event, the target graphic code corresponds to a plurality of pages, and each page is respectively established with a corresponding page matching rule.

The decoding server side described in the embodiments of the present disclosure may be used to manage and maintain a graphics code, and specifically, may configure a corresponding plurality of pages for any graphics code (i.e. bind the plurality of pages to the graphics code). In one embodiment, any graphic code administrator (such as the issuer of the graphic code or the administrator of the code management platform to which the graphic code belongs) may access the decoding server through the code management terminal to manage (create, associate, adjust the working state, etc.) the graphic code maintained by the decoding server. Therefore, the manager can initiate code identification information aiming at any graphic code and page identification information of each page in the plurality of pages to the decoding server through the code management terminal. The code identification information is used for uniquely identifying any graphic code, and can be a code value of the graphic code or a preset (globally unique) code number and the like; the page identification information of any page is used to uniquely identify the any page, and may be an access address of the page, such as a complete URL (Uniform Resource Locator ) or a short chain generated based on the complete URL, etc.

The administrator of any graphic code can configure a plurality of pages to be bound to the graphic code in the page configuration interface. For any one of the pages, the address information of the page may be configured in the page configuration interface, and basic information such as the type (applet page, H5 page, etc.) and/or source (application to which the page belongs) of the page may be configured. Based on the basic information configured for any page, the decoding server can acquire the page identification information of the page, so as to accurately know which page should be bound to any graphic code. In addition, any page bound to any graphic code may be temporarily created in the decoding server by an administrator of the graphic code, or may be created in advance by the decoding server or other platforms, which is not limited in this specification.

Based on the obtained code identification information and page identification information, the decoding server may configure a plurality of pages for any graphics code in a plurality of manners (i.e., bind the plurality of pages to any graphics code). For example, a mapping relationship may be established between the code identification information and each page identification information, after which it may be determined which pages are configured for any graphic code by querying the mapping relationship; for another example, each page identification information may be recorded as related information of any graphic code, and then it may be determined which pages are configured in any graphic code by reading the related information. It can be understood that after the binding is completed, each bound page becomes the associated page of any graphic code, and the code scanning terminal can jump to one page of the multiple pages after scanning the graphic code to generate a code scanning event. Of course, the specific jump to which page is needed to be judged by the decoding server according to the matching condition between the data related to the code scanning corresponding to the code scanning event and the page matching rules corresponding to each page respectively.

It should be noted that any graphic code may be bound to a plurality of pages, and any page may be bound to one or a plurality of graphic codes, and specific binding situations between graphic codes and pages may be set reasonably according to specific application scenarios such as page content, number of graphic codes, display positions of graphic codes, and the like, which is not limited in this specification. In addition, for any graphic code maintained by the decoding server, a plurality of pages may be bound (or configured) in the above manner, only one page may be bound, and any page may not be bound. Therefore, the multiple graphic codes maintained by the decoding server may be all bound with multiple pages, or only a part of the graphic codes may be bound with multiple pages. The target graphic code described in the specification is any graphic code configured with a plurality of pages.

In addition, a plurality of pages bound by any graphic code are respectively created with corresponding page matching rules. For example, the administrator of any graphic code may create, in the rule configuration interface corresponding to the graphic code, a corresponding page matching rule for each page bound to the graphic code. It should be noted that, the page matching rules of the multiple pages are mutually exclusive, that is, for the page matching rules corresponding to any two pages in the multiple pages respectively, the code scanning related data corresponding to the code scanning event obtained by the decoding server end is matched with one rule at most, but not both rules at the same time. Therefore, for a plurality of page matching rules corresponding to the plurality of pages one by one, at most only one page matching rule is matched with all the code scanning related data corresponding to the code scanning event, and the plurality of rules are not matched with the code scanning related data at the same time, so that the decoding server can be ensured to accurately trigger the code scanning terminal to display a certain determined page (namely the target page), and disorder of the display of the page by the code scanning terminal is avoided.

In an embodiment, a default page may be configured for any graphics code in response to a page configuration instruction sent by an administrator of the target graphics code or the decoding server, where the page may not be configured with a corresponding page matching rule, so that, in a case where none of the page matching rules corresponding to the foregoing respective pages matches the related data of the code scanning corresponding to the code scanning event, the code scanning terminal may be triggered to jump to the default page, without displaying error reporting information, thereby improving user experience. It will be appreciated that the default page is different from each of the previous pages. The content displayed by the default page may be determined according to an application scenario of the present solution, and the page may be, for example, a function home page, a login page, a recommended information display page, etc., which will not be described again.

In an embodiment, after the configuration of the page matching rule corresponding to any page is completed, the page matching rule may be updated appropriately. If the rule updating instruction for any page can be initiated to the decoding server; correspondingly, the decoding server side can respond to the instruction and update the page matching rule corresponding to any page. Wherein at least one data feature recorded in any page matching rule may be updated, such as adding, modifying and/or deleting at least one data feature, etc. The type of the code scanning terminal can be updated from a mobile phone to a mobile phone or a tablet computer, and the age of a user can be updated from 18 to 50 years old to 18 to 35 years old; the data characteristic of the 'place type' or the data characteristic of the 'model' of the new scan code terminal can be deleted, and the details are not repeated.

It will be appreciated that the page matching rules created for any page are used in a subsequent step to match the scan-related data corresponding to the scan event. Specifically, for any page, corresponding scan code related data can be obtained pertinently according to the data features recorded in the page matching rule of the page, and then the obtained (actual) scan code related data and the data features recorded in the page matching rule are compared one by one, so as to determine whether each scan code related data is matched with the rule.

In an embodiment, the decoding server may obtain a plurality of code scanning related data corresponding to the code scanning event, where the plurality of code scanning related data may belong to at least one data dimension; where the plurality of scan code related data belong to a plurality of data dimensions, any one of the scan code related data belongs to one data dimension, and one or more of the scan code related data may exist in any one of the data dimensions. Illustratively, the at least one data dimension may include at least one of the aforementioned end, person, venue, and time. Of course, other data dimensions may exist and are not described in detail.

And step 404, inquiring a target page matching rule matched with the code scanning related data in each page matching rule, and triggering the code scanning terminal to display a target page corresponding to the target page matching rule.

After the code scanning related data is obtained, the decoding server side can compare the code scanning related data with the data characteristics recorded in each page matching rule, so that a target page matching rule matched with the code scanning related data is determined. Under the condition that a plurality of data features are recorded in any page matching rule, if each data feature is matched with corresponding code scanning related data, the page matching rule can be determined to be matched with the code scanning related data, so that the rule can be determined to be target code scanning related data, and a page corresponding to the rule can be the target page. At this time, the code scanning terminal may be triggered to display the page. Or if at least one data characteristic does not match the corresponding code scanning related data, the page matching rule can be determined to be not matched with the code scanning related data, and the page corresponding to the rule can not be determined to be a target page naturally. Or, the matching degree of each page matching rule and the related data of the code scanning can be calculated according to the data characteristics contained in the page matching rule, and the page corresponding to the page matching rule with the highest matching degree is determined as the target page. By the method, the code scanning terminal can be ensured to jump to the page with the highest matching degree of the code scanning related data corresponding to the code scanning event, so that the occurrence frequency of the condition that the target page cannot be determined is reduced as much as possible, and the user experience is improved to a certain extent.

In addition, in the process of calculating the matching degree of any page matching rule and the code scanning related data, if the page matching rule comprises a plurality of data features, the weight values of the data features can be not completely equal, for example, different weight values can be respectively set for the data features according to indexes such as importance degree, timeliness and the like, so that the probability that the matching degree of two page matching rules and the code scanning related data is equal is reduced as much as possible, and the probability of determining a target page and the accuracy of the target page are improved.

Through the embodiment shown in fig. 4, the code scanning terminal in the scheme can present a page skip effect of 'one code kiloface' when scanning the graphic code. It can be understood that the multiple pages in the scheme can be associated to the same graphic code (i.e. the target graphic code), so that multiplexing of the multiple pages to the same graphic code is realized, not only is graphic code resources saved, but also management burden of the graphic code is reduced, and the use efficiency of the graphic code is improved.

Fig. 5 is a flowchart of a method for generating a graphic code according to an exemplary embodiment of the present disclosure, which may specifically include the following steps:

step 502, receiving a code making template uploaded by a user, and determining identification information corresponding to the code making template, wherein the code making template is defined with corresponding fields.

Step 504, updating the corresponding relation between the maintained code making template and the template identification information based on the received code making template and the corresponding identification information;

step 506, responding to the code making request of the user, and determining the code making template indicated by the code making request.

It should be emphasized that, as described in the embodiment shown in fig. 1, the decoding server may integrate the functions of the decoding server, and when the server integrates the functions, the method of decoding described in the present specification may be applied to the decoding server; of course, it is assumed that the service end does not integrate the code making and decoding functions, and accordingly, the code making method described in the present specification can be applied to the corresponding code making service end, which is not limited in the present specification.

In one embodiment, the transcoding templates may include standard fields and extension fields, with each transcoding template defining the same standard field and a different extension field.

In an embodiment, in order to meet the diversity requirement of the code making, a code making template uploaded by a user can be received, and identification information corresponding to the code making template is determined; and updating the corresponding relation based on the received code making template and the corresponding identification information.

Step 508, generating a corresponding code value based on the template identification information corresponding to the determined code making template, and generating a corresponding graphic code based on the code value.

As described above, the code value may contain only the template identification information, thereby controlling the code value within a smaller length, so that the decoding rate of the code value can be increased due to the shorter length of the code value in the decoding stage. Of course, in the code making stage, the generation rate of the graphic code can be accelerated because of the controllable code value length.

In an embodiment, the decoding server may respond to the update request for the graphics code, and switch the code making template corresponding to the graphics code to the code making template indicated by the update request, so as to generate a corresponding code making data set; for example, the graphic code a is generated by the code template a, but for an update request for the graphic code a, it may switch the code template a to the code template B, thereby generating the graphic code by the code template B; or, in response to a deletion request for the code making template, deleting the code making template indicated by the deletion request and template identification information corresponding to the code making template from a corresponding relation maintained by the decoding server, taking table 1 as an example, if the code making template a is no longer needed to be utilized in the current scene, deleting the code making template a and the template identification information 01 corresponding to the code making template a in the corresponding relation; or, in response to an addition request for the code making template, adding the code making template indicated by the addition request and template identification information corresponding to the code making template into a corresponding relation maintained by the decoding server, wherein the code making template can be uploaded to the decoding server by a user or formulated by the user based on the decoding server.

Fig. 6 is a schematic diagram of a code making and decoding process according to an exemplary embodiment of the present disclosure.

The code making stage may include the following steps:

step 602, a user requests code making.

Step 604, the server determines the code protocol.

The generation of the two-dimensional code needs to take a corresponding code protocol as a reference. Taking the traffic code as an example, it is now required to follow the traffic code protocol defined in the traffic industry standard (JT/T1179-2018).

Step 606, the server generates a two-dimensional code.

As shown in fig. 6, a database may be maintained with a plurality of code making templates, where the code making templates may be uploaded by a user, and corresponding two-dimensional codes may be generated based on the code making templates indicated by the code making requests corresponding to the user, and in the embodiment shown in fig. 6, the code making template that is in effect is the code making template a, that is, the two-dimensional code generated at this time is based on the code making template a. On the basis, a user can switch the corresponding effective templates, for example, the code making template B is enabled to be effective, and then the corresponding generated two-dimensional codes can be based on the code making template B, so that corresponding fields are selected by switching different effective templates, corresponding graphic codes are generated, finally, the information set returned by decoding can be controlled, and the code making requirements under different scenes can be met.

In the decoding stage, the following steps may be included.

Step 608, the user requests decoding.

Step 610, the server determines the code protocol.

Step 612, the server parses the two-dimensional code.

Under the condition of analyzing the two-dimensional code, the server can acquire a code value to be analyzed obtained by the code scanning terminal for scanning the target graphic code, so as to determine template identification information corresponding to the code value to be analyzed, for example, template code making information corresponding to the code value to be analyzed is 01, and a corresponding code making template is determined according to the corresponding relation and the determined template identification information; based on the above, the code making template represented by the code making template identification information 01 is the code making template a, so that a corresponding decoding result can be returned to the code scanning terminal based on the field defined by the determined code making template a. Therefore, based on various code making templates maintained by the server, the user can generate corresponding graphic codes in batches or independently by switching the code making templates under different scenes between different applications, so that various demands of the user can be met, and the flexibility of code making and decoding is improved.

Based on the above embodiments, since the code value corresponding to the graphic code may only include the template identification information, the corresponding code value is controlled within a shorter length, so that a higher decoding efficiency can be ensured in the decoding stage; meanwhile, because the decoding server can maintain a plurality of code making templates and the code making templates are defined with corresponding fields, when decoding is carried out, corresponding information groups can be returned according to the fields defined by the corresponding code making templates, the information groups returned by decoding can be flexibly controlled, and the change of service requirements is met; in addition, for the same graphic code, the corresponding returned decoding information set can be controlled by switching different code making templates for decoding, so that the graphic code can be replaced without updating, the service requirement can be met, and the high compatibility is realized.

Corresponding to the embodiments of the aforementioned method, the present specification also provides embodiments of an apparatus, an electronic device, and a storage medium.

Fig. 7 is a schematic block diagram of an electronic device according to an exemplary embodiment. Referring to fig. 7, at the hardware level, the device includes a processor 701, a network interface 702, a memory 703, a non-volatile storage 704, and an internal bus 705, although other hardware may be included as required by other services. One or more embodiments of the present description may be implemented in a software-based manner, such as by the processor 701 reading a corresponding computer program from the non-volatile storage 704 into the memory 703 and then running. Of course, in addition to software implementation, one or more embodiments of the present disclosure do not exclude other implementation manners, such as a logic device or a combination of software and hardware, etc., that is, the execution subject of the following processing flow is not limited to each logic unit, but may also be hardware or a logic device.

Fig. 8 is a block diagram of a decoding apparatus for graphic codes according to an exemplary embodiment. Referring to fig. 8, the apparatus includes:

a receiving unit 802, configured to receive a code making template uploaded by a user, and determine identification information corresponding to the code making template, where the code making template defines a corresponding field;

An updating unit 804, configured to update a correspondence between the maintained code making template and the template identification information based on the received code making template and the corresponding identification information;

an obtaining unit 806, configured to obtain a code value to be resolved obtained by the code scanning terminal scanning the target graphic code;

a determining unit 808, configured to determine template identification information corresponding to the code value to be parsed, and determine a corresponding code making template according to the correspondence and the determined template identification information;

and a returning unit 810, configured to return a corresponding decoding result to the code scanning terminal based on the field defined by the determined code making template.

Optionally, the apparatus further comprises:

optionally, the code making templates include standard fields and extension fields, and each code making template is defined with a unified standard field and a customized extension field.

Optionally, the apparatus further comprises:

a jumping unit 812, configured to obtain, in response to a page jumping request triggered by a code scanning event of a code scanning terminal scanning a target graphic code, code scanning related data corresponding to the code scanning event, where the target graphic code corresponds to a plurality of pages, and each page is created with a corresponding page matching rule; and inquiring a target page matching rule matched with the code scanning related data in each page matching rule, and triggering the code scanning terminal to display a target page corresponding to the target page matching rule.

Optionally, the jumping unit 812 is specifically configured to: and acquiring a plurality of code scanning related data corresponding to the code scanning event, wherein the code scanning related data belong to at least one data dimension.

Optionally, the code making template is bound with an associated code making template, and the device further comprises:

and an association returning unit 814, configured to, when the code making template is bound with an association code making template, preferentially return a corresponding decoding result to the code scanning terminal based on a field defined by the association code making template.

Fig. 9 is a block diagram of a decoding apparatus for graphic codes according to an exemplary embodiment. Referring to fig. 9, the apparatus includes:

the template receiving unit 902 is configured to receive a code making template uploaded by a user, and determine identification information corresponding to the code making template, where the code making template defines a corresponding field;

a template updating unit 904, configured to update a correspondence between the maintained code making template and the template identification information based on the received code making template and the corresponding identification information;

a request determining unit 906, configured to determine, in response to a code making request of a user, a code making template indicated by the code making request;

a generating unit 908, configured to generate a corresponding code-making dataset based on template identification information corresponding to the determined code-making template, where the code-making dataset includes the template identification information;

A graphic code generating unit 910, configured to generate a corresponding code value according to the code making dataset, and generate a corresponding graphic code based on the code value.

Optionally, the code making templates include standard fields and extension fields, and each code making template is defined with the same standard field and different extension fields.

Optionally, the apparatus further comprises:

an updating unit 912, configured to switch, in response to an update request for the graphics code, a code making template corresponding to the graphics code to a code making template indicated by the update request, so as to generate a corresponding code making data set; or, deleting the code making template indicated by the deleting request and the template identification information corresponding to the code making template from the corresponding relation maintained by the decoding server in response to the deleting request for the code making template; or, in response to an addition request for the code making template, adding the code making template indicated by the addition request and template identification information corresponding to the code making template into a corresponding relation maintained by the decoding server.

For the device embodiments, reference is made to the description of the method embodiments for the relevant points, since they essentially correspond to the method embodiments. The apparatus embodiments described above are merely illustrative, wherein the modules illustrated as separate components may or may not be physically separate, and the components shown as modules may or may not be physical, may be located in one place, or may be distributed over a plurality of network modules. Some or all of the modules may be selected according to actual needs to achieve the purposes of the present description. Those of ordinary skill in the art will understand and implement the present invention without undue burden.

In a typical configuration, a computer device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.

The memory may include volatile memory in a computer-readable medium, random Access Memory (RAM) and/or nonvolatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of computer-readable media.

Computer readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. Computer-readable media, as defined herein, does not include transitory computer-readable media (transmission media), such as modulated data signals and carrier waves.

It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.

Reference will now be made in detail to exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, the same numbers in different drawings refer to the same or similar elements, unless otherwise indicated. The implementations described in the following exemplary examples do not represent all implementations consistent with the present specification. Rather, they are merely examples of apparatus and methods consistent with some aspects of the present description as detailed in the accompanying claims.

The terminology used in the description presented herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the description. As used in this specification and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any or all possible combinations of one or more of the associated listed items.

It should be understood that although the terms first, second, third, etc. may be used in this specification to describe various information, these information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, the first information may also be referred to as second information, and similarly, the second information may also be referred to as first information, without departing from the scope of the present description. The word "if" as used herein may be interpreted as "at … …" or "at … …" or "responsive to a determination", depending on the context.

The foregoing description of the preferred embodiments is provided for the purpose of illustration only, and is not intended to limit the scope of the disclosure, since any modifications, equivalents, improvements, etc. that fall within the spirit and principles of the disclosure are intended to be included within the scope of the disclosure.

Claims

1. A method of decoding a graphics code, the method comprising:

2. The method of claim 1, wherein the transcoding templates comprise standard fields and extension fields, and each transcoding template defines a unified standard field and a custom extension field.

3. The method of claim 1, the method further comprising:

responding to a page jump request triggered by a code scanning event of a code scanning terminal scanning a target graphic code, and acquiring code scanning related data corresponding to the code scanning event, wherein the target graphic code corresponds to a plurality of pages, and each page is respectively established with a corresponding page matching rule;

and inquiring a target page matching rule matched with the code scanning related data in each page matching rule, and triggering the code scanning terminal to display a target page corresponding to the target page matching rule.

4. The method of claim 3, wherein the acquiring the scan related data corresponding to the scan event comprises:

And acquiring a plurality of code scanning related data corresponding to the code scanning event, wherein the code scanning related data belong to at least one data dimension.

5. The method of claim 1, the code template being bound with an associated code template, the method further comprising:

and under the condition that the code making template is bound with the associated code making template, returning a corresponding decoding result to the code scanning terminal based on the field defined by the associated code making template preferentially.

6. A method of coding a graphic code, the method comprising:

and generating a corresponding code value based on the template identification information corresponding to the determined code making template, and generating a corresponding graphic code based on the code value.

7. The method of claim 6, the transcoding templates comprising standard fields and extension fields, each transcoding template defining the same standard field and different extension fields.

8. The method of claim 6, the method further comprising:

responding to an updating request for the graphic code, and switching a code making template corresponding to the graphic code into a code making template indicated by the updating request so as to generate a corresponding code making data set; or alternatively, the first and second heat exchangers may be,

responding to a deleting request aiming at the code making template, deleting the code making template indicated by the deleting request and template identification information corresponding to the code making template from the corresponding relation maintained by the decoding server; or alternatively, the first and second heat exchangers may be,

responding to an adding request for the code making template, and adding the code making template indicated by the adding request and template identification information corresponding to the code making template into a corresponding relation maintained by the decoding server.

9. A decoding apparatus of a graphic code, the apparatus comprising:

10. A code making apparatus for graphic codes, the apparatus comprising:

11. A computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of the method according to any of claims 1 to 5 or 6 to 8.

12. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the method according to any one of claims 1 to 5 or 6 to 8 when the program is executed.