CN113392828B - Encoding and decoding method based on high-resolution dot matrix - Google Patents

Encoding and decoding method based on high-resolution dot matrix Download PDF

Info

Publication number
CN113392828B
CN113392828B CN202110375582.1A CN202110375582A CN113392828B CN 113392828 B CN113392828 B CN 113392828B CN 202110375582 A CN202110375582 A CN 202110375582A CN 113392828 B CN113392828 B CN 113392828B
Authority
CN
China
Prior art keywords
matrix
code
image
certain rule
quad
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202110375582.1A
Other languages
Chinese (zh)
Other versions
CN113392828A (en
Inventor
周斌
金凯
周雨
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nantong Junxing Information Technology Co ltd
Original Assignee
Nantong Junxing Information Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nantong Junxing Information Technology Co ltd filed Critical Nantong Junxing Information Technology Co ltd
Priority to CN202110375582.1A priority Critical patent/CN113392828B/en
Publication of CN113392828A publication Critical patent/CN113392828A/en
Application granted granted Critical
Publication of CN113392828B publication Critical patent/CN113392828B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T5/00Image enhancement or restoration
    • G06T5/70Denoising; Smoothing
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00Image analysis
    • G06T7/10Segmentation; Edge detection
    • G06T7/11Region-based segmentation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N23/00Cameras or camera modules comprising electronic image sensors; Control thereof
    • H04N23/80Camera processing pipelines; Components thereof

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Image Processing (AREA)

Abstract

The invention relates to a coding and decoding method based on a high-resolution dot matrix, which uses a coding algorithm to calculate dense arrangement information of dot codes for rectangular areas with any size, and uniformly lays the dot code information into the rectangular areas; when writing in a rectangular area by an intelligent pen with a miniature camera, shooting the surrounding area containing the pen point, decoding and calculating the shot single-frame image, realizing the coordinate information restoration of the writing position of the pen point, and finally restoring the complete writing track of the pen point by calculating continuous multi-frame images. The encoding method realizes high-density storage of absolute coordinate information, has strong anti-interference performance, has the minimum unit of positioning accuracy of a single point code, and efficiently and accurately restores the absolute coordinate information of the handwriting by using the code point arrangement information of the handwriting writing area.

Description

Encoding and decoding method based on high-resolution dot matrix
Technical Field
The invention relates to the technical field of encoding and decoding, in particular to an encoding and decoding method based on a high-resolution point array.
Background
When the current intelligent pen with the miniature camera at the pen point is used for collecting real-time images of writing tracks, point codes are paved in advance on a writing area, point code images of the area around the pen point are collected through the camera, decoding calculation is carried out, coordinate information of the pen point is obtained, and therefore the complete writing track of the intelligent pen is restored. Therefore, how to reasonably and efficiently encode and decode coordinate information becomes a difficulty in acquiring the coordinate information of the pen point. The above drawbacks are to be overcome by those skilled in the art.
Disclosure of Invention
1. Technical problem to be solved
The invention solves the problems existing in the prior art, and provides an encoding and decoding method which is used for solving the problem of efficiently encoding and decoding the coordinate information.
2. Technical proposal
The main technical scheme adopted by the invention is that the coding and decoding method is based on a high-resolution dot matrix.
Step S0, defining a rectangular code spreading area Zone, and uniformly dividing the Zone area into a plurality of grids with the size of 13x 13;
step S1, calculating a certain rule for the ith grid unit in the step S0 to obtain a new 13x13 square matrix M i
Step S2, all square matrixes M in the step S1 are processed i Through certain rule calculation, the generated elements are only 0 and 1, and the size is N row ×N col Printing the spreading matrix on the surface of a writing medium (such as paper), wherein a matrix element of 0 represents that the corresponding position is a white code point (not printed), and a matrix element of 1 represents that the corresponding position is a black code point (printed with a black dot);
step S3, writing in the Zone range on the writing medium by using an intelligent pen with a miniature camera, collecting a single-frame image of a surrounding area including a pen point by using the camera, performing a series of pretreatment on the single-frame image, and performing perspective transformation to obtain a new image I 1
Step S4, from I 1 Extracting image information containing complete grids;
step S5, extracting the abscissa and the ordinate of the grid unit where the pen point is positioned from the grid image information obtained in the step S4 through certain rule calculation;
and S6, the horizontal coordinate and the vertical coordinate obtained in the step S5 are calculated according to a certain rule to restore the real coordinate of the writing position of the pen point, so that the decoding process of the writing position in the frame of image is completed.
The step S0 includes:
step S01, defining a rectangular code spreading area Zone according to N row ×N col The number code points are uniformly paved with Zones, each Zone has a unique id, and the id is represented by a character string with the length of 2 bytes;
step S02, uniformly segmenting the Zone area according to a grid with the size of 13 multiplied by 13:
in step S03, the coordinates of the upper left corner code point of the grid cell are used as grid cell coordinates.
The step S1 includes:
step S11, correspondingly creating a square matrix for each grid unit of the grid obtained in step S02, and initializing the square matrix as a zero matrix;
step S12, setting the elements of the first row, the last row, the first column and the last column as 1 and setting all the elements of the main diagonal except the second row and the second column as 1;
step S13, calculating a certain rule between each grid cell obtained in the step S02 and the square matrix corresponding to the grid cell obtained in the step S12 according to the row number of the segmented row to obtain a new matrix;
step S14, calculating a certain rule with the square matrix corresponding to each grid cell obtained in the step S13 according to the column number of the segmented column of each grid cell obtained in the step S02 to obtain a new matrix;
and step S15, calculating the id of the step S01 and the square matrix corresponding to the grid unit obtained in the step S14 according to a certain rule to obtain a new matrix.
The step S2 includes:
step S21, generating a spreading matrix M according to the Zone zone Dividing M according to the dividing mode of step S02 zone Dividing into a plurality of subarrays; the subarrays are in one-to-one correspondence with the grid units;
step S22, copying the new array elements corresponding to the grid cells in step S15 into the corresponding partitioned subarrays in step S21 in sequence.
The step S3 includes:
step S31, writing in the Zone range on the writing medium by using an intelligent pen with a miniature camera, collecting a single frame image of the surrounding area including the pen point by the camera, preprocessing the single frame image, removing noise, and graying to obtain a preprocessed image I 0
Step S32, at I 0 In the method, a plurality of special point code patterns in an image are found out through a certain rule by using an image detection method;
step S33, calculating I according to the special point code patterns obtained in step S32 0 A kind of electronic deviceA perspective transformation matrix;
step S34, calculating an image I according to the perspective transformation matrix in step S33 0 Corrected orthographic projection image I 1
The step S4 includes:
step S41, image I obtained in step S34 1 In which the square region Z of the diagonal code point closest to the pen point is found out by using an image detection method quad ,Z quad The area size is 13×13;
step S42, establishing a square matrix M with the size of 12 multiplied by 12 quad ,M quad All element values and Z quad Removing all point code gray values of the inner area after boundary one-to-one correspondence, and then adding M quad All the element values are subjected to binarization calculation according to a certain rule to obtain a new square matrix M quadbin
The step S5 includes:
step S51, matrix M obtained from step S42 quadbin After a certain rule calculation, Z is obtained quad The upper left corner code abscissa value;
step S52, matrix M obtained from step S42 quadbin After a certain rule calculation, Z is obtained quad The upper left corner code ordinate value.
The step S6 includes:
step S61, image I obtained in step S34 1 Wherein, the true coordinate and Z of the writing position of the pen point are calculated according to a certain rule quad The upper left corner code coordinate difference;
step S62, Z is obtained according to steps S51 and S52 quad And (3) calculating the coordinates of the upper left corner code and the coordinate difference of the point code obtained in the step S61 according to a certain rule to obtain the true coordinates of the writing position of the pen point.
3. Advantageous results
The method has the beneficial effects that in the encoding process, grids are divided into rectangular code paving areas, a new square matrix is calculated for each grid through a certain rule, coordinate information of the grid, id and direction information of the rectangular code paving areas are stored, and the square matrices are generated into code paving matrixes according to a certain rule for code paving; in the decoding process, an intelligent pen with a miniature camera is used for writing in a matrix code spreading area on a writing medium, a single frame image containing the area around the nib is collected through the camera, after pretreatment and perspective transformation, the coordinates of a grid unit where the nib is located are extracted from the single frame image, and then the real coordinates of the writing position of the nib are restored through certain rule calculation. The advancement is mainly embodied in the following aspects:
(1) The high resolution, through reasonable coding design, has realized the positioning accuracy with single code point as minimum unit.
(2) The anti-interference performance records the direction information of the rectangular code spreading area in the coding, and when the input equipment (camera) shakes and rotates, perspective transformation can be carried out on a single frame image containing the area around the pen point, and the corrected orthographic projection image is restored, so that the decoding accuracy is ensured.
Drawings
FIG. 1 is a flow chart of an encoding and decoding process;
FIG. 2 is a schematic illustration of dot code printing;
FIG. 3 is a schematic view of a pre-processed acquired image;
FIG. 4 is a schematic diagram of image detection of a preprocessed captured image;
fig. 5 is a schematic diagram of square areas on a corrected image.
Detailed Description
The present invention is a high resolution lattice based encoding and decoding method, the general flow Cheng Ru of which is shown in fig. 1, and detailed description of embodiments of the present invention follows.
The step S0 of the invention specifically comprises the following steps:
in step S01, a rectangular code spreading Zone is defined, with a diameter of a single code point of 1 minimum unit, if N is required row ×N col The Zone is uniformly paved with the code points, and the length of the Zone is N row Width of N col
Wherein, the upper left corner code point coordinate of the Zone is (1, 1), and the lower right corner code point coordinate is (N row ,N col ), N row And N col The value of (2) needs to satisfy the condition:
N row ≤425984
N col ≤425984
wherein the method comprises the steps ofRepresenting a non-negative set of integers;
each Zone has an id, which is represented by a string of 2 bytes in length, so that the ids are 65536 in total, and the note string includes invisible characters;
in step S02, the Zone area is uniformly segmented into a plurality of 13×13 sized grids; for a length of N row Width of N col The number of the split grids is:
in step S03, the grid cell coordinates are defined as grid cell upper left corner code point coordinates, and for the grid cell of the ith row and jth column, the coordinates are:
(13(i-1)+1,13(j-1)+1)
wherein the method comprises the steps ofThe step S1 of the invention specifically comprises the following steps:
in step S11, for the ith row and jth column grid cells, a matrix M of 13×13 in size and 0 in value is created ij Wherein
In step S12, M in step S11 is compared with ij Let M ij (m, n) =1, wherein (m, n) satisfies the following condition:
let M ij All elements on the main diagonal except subscript (2, 2) are 1; the main diagonal line is used for representing the direction information of the Zone, and the initial state of the plane in which the Zone is positioned can be restored after projection transformation no matter the plane in which the Zone is positioned rotates or inclines;
in step S13, M in step S12 is compared with ij Writing integer i into binary representation, adding zero at high order to obtain 15-bit binary number, and sequentially recording the first 8 binary bits in M ij (3, 4) to M ij (3, 11); the last 7 binary bits are recorded in M in turn ij (4, 5) to M ij (4, 11);
in step S14, M in step S13 is counted ij Writing integer j into binary representation, adding zero at high order to obtain 15-bit binary number, and sequentially recording the first 8 binary bits in M ij (4, 3) to M ij (11, 3); the last 7 binary bits are recorded in M in turn ij (5, 4) to M ij (11, 4);
in step S15, each character id of step S01 is converted into 8-bit Ascii code, and the upper four bits of the Ascii code of the first character are recorded in M from high to low ij (6, 8) to M ij (6, 11) the lower four bits are recorded in M in order from high to low ij (7, 8) to M ij (7, 11); the four high-order bits of the Ascii code of the second character are recorded in M from high to low ij (8, 6) to M ij (11, 6) the lower four bits are recorded in M in order from high to low ij (8, 7) to M ij (11, 7); for example, M when Zone id is a character string "WY 23 The values are:
the step S2 of the invention specifically comprises the following steps:
in step S21, a spreading matrix M is generated from the Zone zone The size of the catalyst is N row ×N col The initial element values are all 0;
in step S22, the matrix M in step S15 is expressed by the formula (1) ij The element values are copied to subarray M in turn zoneij In (a) and (b);
M zone (13(i-1)+m,13(j-1)+n)=M ij (m,n) (1)
wherein m is more than or equal to 1 and less than or equal to 13, n is more than or equal to 1 and less than or equal to 13;
in step S23, the code points of the code spreading printing are circles, fig. 2 is a schematic diagram of dot code printing, and note that white circles in the figure represent white dot codes (without printing), and black boxes in the figure are M zone23 Printed code points;
the step S3 of the invention specifically comprises the following steps:
in step S31, the smart pen writes in the Zone area on the writing medium, the camera captures a single frame image containing the area around the pen tip, the original captured image needs the following preprocessing:
(1) Graying, namely changing the three-channel image into a channel image, wherein the pixel value range is [0, 255] and is an integer;
(2) Removing noise, removing the influence of illumination by using a self-adaptive threshold binarization method, and removing high-frequency noise by using a Fourier transform method;
preprocessing to obtain an image I 0 FIG. 3 is a schematic view of a preprocessed image, with the lower right hand corner of the image being the nib;
in step S32, an edge detection method is first used to detect ellipses, and n groups of patterns with 9 ellipse points arranged in a cross manner are found and marked as E i (i.ltoreq.n), as shown in the gray circles of FIG. 4, note that the condition that n.ltoreq.4 must be satisfied, which requires a sufficient view of the smart pen's camera;
obtain all E i Center point coordinates (x) 1 ,y 1 ),(x 2 ,y 2 ),(x 3 ,y 3 ),...,(x n ,y n );
The coordinate is E i Centering the center point coordinates of the ellipse;
to be nearest to the nib E 1 The center point is used as a starting point to find m E nearest to the center point i Wherein m is less than or equal to 8, and finding a quadrilateral so that one vertex is E 1 Center point, three other points are 3 and E 0 Recent E i A center point; the four vertex coordinates of this quadrilateral are recorded as (x) in the counterclockwise direction q1 ,y q1 ),(x q2 ,y q2 ),(x q3 ,y q3 ),(x q4 ,y q4 ) Wherein (x) q1 ,y q1 ) Is E 0 Is defined by a center of (a);
FIG. 4 is a schematic view of the operation of FIG. 3, wherein the gray ring portion is the detected E i A graphic, 6 such graphics are found out in total; the black frame part is a found quadrilateral which is nearest to the pen point (lower right corner of the picture);
in step S33, the coordinates (x q1 ,y q1 ),(x q2 ,y q2 ),(x q3 ,y q3 ),(x q4 ,y q4 ) Image I can be determined by perspective transformation 0 Corrected orthographic projection image I 1
The formula of perspective transformation is:
wherein x is q And y q For inputting image I 0 And w=1, a 33 =1, after perspective transformation, output image I 1 The coordinates are x, y;
set I 0 The upper coordinate is (x q1 ,y q1 ),(x q2 ,y q2 ),(x q3 ,y q3 ),(x q4 ,y q4 ) The points of (1) are transformed by projection to obtain an image I 1 Four points with upper coordinates (14, 14), (14, 0), (0, 14), the two sets of coordinates are determinedSubstituting equation (2) to obtain perspective transformation matrix
In step S34, I is calculated 0 Coordinates (x) q ,y q ) Substituting (2) to obtain coordinates (x, y) to create image I 1 Make I 1 The value of (x, y) and I 0 Middle (x) q ,y q ) One-to-one correspondence of values of (a).
The step S4 of the invention specifically comprises the following steps:
in step S41, the method in step S32 is used to generate an image I 1 Square region Z on which the diagonal code point closest to the nib is found quad The method comprises the steps of carrying out a first treatment on the surface of the The square area has a size of 13×13, and is schematically shown in FIG. 5, in which the black frame is Z quad
In step S42, a matrix M of size 12×12 is established quad ,M quad All element values and Z quad Removing all point code gray values of the inner area after the boundary is in one-to-one correspondence;
the square matrix M is paired by the following sub-arrays quad Binarizing elements and aligning new matrix M quadbin Assignment:
the step S5 of the invention specifically comprises the following steps:
in step S51, M in step S42 is counted quadbin The method comprises the following steps:
read M ij (3, 4) to M ij The 8 digits in (3, 11) are used as binary code high 8 bits, and M is read ij (4, 5) to M ij The lower 7 bits of the 7 digits in (4, 11) are converted into the 10-digit number i by the 15-digit binary code, and Z can be obtained quad The left upper corner code has the following abscissa in Zone: 13 (i-1);
in step S52, M in step S42 is counted quadbin The method comprises the following steps:
read M ij (4, 3) to M ij 8 digits in (11, 3) are used as binary code high 8 bits, and M is read ij (5, 4) to M ij The lower 7 bits of the 7 digits in (11, 4) are converted into the 15-bit binary code into the 10-digit number j, and Z can be obtained quad The vertical coordinates of the upper left corner code in the Zone are as follows: 13 (j-1).
The step S6 of the invention specifically comprises the following steps:
in step S61, the image I obtained in step S34 is set as the pen tip 1 The upper coordinate is (x, y), Z is known from step S33 quad The upper left corner point is coded at I 1 The upper coordinate is (0, 0), the true coordinate of the pen point writing position and Z are obtained quad The coordinate difference of the upper left corner code is (x, y);
in step S62, Z obtained in steps S51 and S52 quad The coordinates of the upper left corner code are (13 (i-1), 13 (j-1)), and the real coordinates of the writing position of the pen point in the Zone can be obtained as follows:
(13(i-1)+x,13(j-1)+y)。

Claims (5)

1. the encoding and decoding method based on the high-resolution dot matrix is characterized by comprising the following steps of:
step S0, defining a rectangular code spreading area Zone, and uniformly dividing the Zone area into a plurality of grids with the size of 13 multiplied by 13;
step S1, calculating a certain rule for the ith grid unit in the step S0 to obtain a new 13x13 square matrix M i
Step S2, all square matrixes M in the step S1 are processed i Through certain rule calculation, the generated elements are only 0 and 1, and the size is N row ×N col Printing the spreading matrix on the surface of a writing medium, wherein matrix elements 0 represent blank code points at corresponding positions, and matrix elements 1 represent black code points at corresponding positions;
step S3, writing in the Zone range on the writing medium by using an intelligent pen with a miniature camera, collecting a single-frame image of a surrounding area including a pen point by using the camera, performing a series of pretreatment on the single-frame image, and performing perspective transformation to obtain a new image I 1
Step S4, from I 1 Extracting image information containing complete grids;
s5, extracting the abscissa and the ordinate of the grid unit where the pen point is positioned from the grid image information obtained in the step S4 through certain rule calculation;
s6, the true coordinates of the writing position of the pen point are restored through certain rule calculation according to the horizontal coordinates and the vertical coordinates obtained in the step S5, and the decoding process of the writing position of the handwriting in the frame of image is completed;
the step S0 includes the following steps:
step S01, defining a rectangular code spreading area Zone according to N row ×N col The method comprises the steps that each point code is uniformly paved with Zones, each Zone is provided with a unique id, and the ids are represented by character strings with the length of 2 bytes;
step S02, uniformly segmenting the Zone area according to a grid with the size of 13 multiplied by 13:
step S03, taking the coordinates of the upper left corner code of each grid cell as the coordinates of the grid cell;
the step S1 includes the following steps:
step S11, correspondingly creating a square matrix for each grid cell obtained in the step S02, and initializing the square matrix as a zero matrix;
step S12, setting the elements of the first row, the last row, the first column and the last column as 1 and setting all the elements of the main diagonal except the second row and the second column as 1;
step S13, calculating a certain rule between each grid cell obtained in the step S02 and the square matrix corresponding to the grid cell obtained in the step S12 according to the row number of the segmented row to obtain a new matrix;
step S14, calculating a certain rule with the square matrix corresponding to each grid cell obtained in the step S13 according to the column number of the segmented column of each grid cell obtained in the step S02 to obtain a new matrix;
step S15, the id of the step S01 and the square matrix corresponding to the grid unit obtained in the step S14 are subjected to calculation according to a certain rule to obtain a new matrix;
the step S3 includes the following steps:
step S31, writing in the Zone range on the writing medium by using an intelligent pen with a miniature camera, collecting a single frame image of the surrounding area including the pen point by the camera, preprocessing the single frame image, removing noise, and graying to obtain a preprocessed image I 0
Step S32, at I 0 In the method, a plurality of special point code patterns in an image are found out through a certain rule by using an image detection method;
step S33, calculating I according to the special point code patterns obtained in step S32 0 Is a perspective transformation matrix of (a);
step S34, calculating an image I according to the perspective transformation matrix in step S33 0 Corrected orthographic projection image I 1
2. The method of encoding and decoding based on high resolution dot matrix according to claim 1, wherein said step S2 comprises the steps of:
step S21, generating a spreading matrix M according to the Zone zone Dividing M according to the dividing mode of step S02 zone Dividing into a plurality of subarrays; the subarrays are in one-to-one correspondence with the grid units;
step S22, copying the new array elements corresponding to the grid cells in step S15 into the corresponding partitioned subarrays in step S21.
3. The method of encoding and decoding based on high resolution dot matrix according to claim 1, wherein said step S4 comprises the steps of:
step S41, image I obtained in step S34 1 In the method, a square region Z of a diagonal full code point closest to a pen point is found by using an image detection method quad ,Z quad The area size is 13×13;
step S42, establishing a square matrix M with the size of 12 multiplied by 12 quad ,M quad All element valuesZ quad Removing all point code gray values of the inner area after boundary one-to-one correspondence, and then adding M quad All element values are subjected to binarization calculation according to a certain rule to obtain a new square matrix M quadbin
4. A high resolution lattice based encoding and decoding method according to claim 3, wherein said step S5 comprises the steps of:
step S51, matrix M obtained from step S42 quadbin After a certain rule calculation, Z is obtained quad The upper left corner code abscissa value;
step S52, matrix M obtained from step S42 quadbin After a certain rule calculation, Z is obtained quad The upper left corner code ordinate value.
5. The method of encoding and decoding based on high-resolution dot matrix according to claim 4, wherein said step S6 comprises the steps of:
step S61, image I obtained in step S34 1 In the method, the true coordinate and Z of the writing position of the pen point are calculated according to a certain rule quad The upper left corner code coordinate difference;
step S62, Z is obtained according to steps S51 and S52 quad And (3) calculating the coordinate of the upper left corner code and the coordinate difference of the point code obtained in the step (S61) according to a certain rule to obtain the real coordinate of the writing position of the pen point.
CN202110375582.1A 2021-04-08 2021-04-08 Encoding and decoding method based on high-resolution dot matrix Active CN113392828B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110375582.1A CN113392828B (en) 2021-04-08 2021-04-08 Encoding and decoding method based on high-resolution dot matrix

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110375582.1A CN113392828B (en) 2021-04-08 2021-04-08 Encoding and decoding method based on high-resolution dot matrix

Publications (2)

Publication Number Publication Date
CN113392828A CN113392828A (en) 2021-09-14
CN113392828B true CN113392828B (en) 2024-01-26

Family

ID=77617632

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110375582.1A Active CN113392828B (en) 2021-04-08 2021-04-08 Encoding and decoding method based on high-resolution dot matrix

Country Status (1)

Country Link
CN (1) CN113392828B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114897120B (en) * 2022-07-14 2022-11-08 青岛罗博科技有限公司 Dot code, dot code decoding method, system and electronic equipment
CN116257146B (en) * 2023-05-15 2023-07-14 北京一起教育科技发展有限公司 Encoding and decoding method and device, electronic equipment and storage medium
CN118015636A (en) * 2024-02-29 2024-05-10 祝你云记科技有限公司 Digital application method and system based on dot matrix intelligent pen

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS594382A (en) * 1982-06-30 1984-01-11 Nippon Telegr & Teleph Corp <Ntt> Encoding system of drawn picture
WO2004097723A1 (en) * 2003-04-29 2004-11-11 Anoto Ip Lic Hb Methods, apparatus, computer program and storage medium for position decoding
CN111695372A (en) * 2019-03-12 2020-09-22 阿里巴巴集团控股有限公司 Click-to-read method and click-to-read data processing method

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7899247B2 (en) * 2007-01-24 2011-03-01 Samsung Electronics Co., Ltd. Apparatus and method of segmenting an image according to a cost function and/or feature vector and/or receiving a signal representing the segmented image in an image coding and/or decoding system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS594382A (en) * 1982-06-30 1984-01-11 Nippon Telegr & Teleph Corp <Ntt> Encoding system of drawn picture
WO2004097723A1 (en) * 2003-04-29 2004-11-11 Anoto Ip Lic Hb Methods, apparatus, computer program and storage medium for position decoding
CN111695372A (en) * 2019-03-12 2020-09-22 阿里巴巴集团控股有限公司 Click-to-read method and click-to-read data processing method

Also Published As

Publication number Publication date
CN113392828A (en) 2021-09-14

Similar Documents

Publication Publication Date Title
CN113392828B (en) Encoding and decoding method based on high-resolution dot matrix
CN105095935B (en) A kind of low-density having merged Chaos Encryption Technology, high coding capacity dot matrix Quick Response Code
JP3133403B2 (en) Neighborhood block prediction bit compression method
Mohammad et al. Optical character recognition implementation using pattern matching
EP1456811B1 (en) Reconstruction of virtual raster
Daraee et al. Watermarking in binary document images using fractal codes
WO2004084125A1 (en) Information input/output method using dot pattern
CN112001469A (en) Two-dimensional code encoding method, decoding method and two-dimensional code
CN106909869B (en) Sampling grid division method and device for matrix type two-dimensional code
US20020180995A1 (en) Detecting halftone modulations embedded in an image
Zenati et al. SSDIS-BEM: A new signature steganography document image system based on beta elliptic modeling
CN111507356A (en) Segmentation method of handwritten characters of lower case money of financial bills
KR20070052332A (en) Image processing method and image processing device
CN105654009A (en) Marker generation apparatus, marker recognition apparatus, marker generation method, marker recognition method, and program
JPH0792820B2 (en) Character recognition method
Herwanto et al. Zoning feature extraction for handwritten Javanese character recognition
Rodríguez-Díaz et al. Refined fixed double pass binary object classification for document image compression
CN111598198B (en) Image two-dimensional code generation method and reading method based on LSB information hiding
CN111428534B (en) Decryption identification method based on dot matrix hidden writing information coding
KR102193403B1 (en) Deep learning-based learning data generation method including an outline and a caption elimination method in a drawing and learning data generation system
CN111307069A (en) Light three-dimensional scanning method and system for dense parallel line structure
Banashree et al. OCR for script identification of Hindi (Devnagari) numerals using error diffusion Halftoning Algorithm with neural classifier
CN113642573B (en) Picture separation method based on grids
Kar et al. An approach for word segmentation from a line segment in Odia text using quartiles
CN109635612B (en) Two-dimensional code identification method based on neural network

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant