WO2018196304A1 - Three-dimensional image reconstruction method and apparatus based on debruijn sequence - Google Patents

Abstract

Disclosed are a three-dimensional image reconstruction method and apparatus based on a DeBruijn sequence. The method comprises: using a shift register to generate a four-element two-level DeBruijn sequence (101); carrying out binary conversion on the DeBruijn sequence to obtain binary sequences, and filling the binary sequences in a gray area in a pre-set template image in sequence to obtain a coded template image (102); carrying out image collection after the coded template image is projected onto a surface of an object to obtain a coded image including coded template image information and object information, and binarizing the coded image to obtain a first binarized image, wherein the first binarized image comprises a plurality of coded feature points, and each of the coded feature points comprises one central area (103); based on the first binarized image, determining position information about the central area of each of the coded feature points (104); and based on the first binarized image, and the position information about each central area, determining a coded value of each of the coded feature points, and using the coded value for three-dimensional image reconstruction (105). A higher anti-noise capacity and better robustness are achieved when the method is used for three-dimensional image reconstruction.

Description

Three-dimensional image reconstruction method and device based on DeBruijn sequence

The present invention relates to the field of three-dimensional image reconstruction technology, and in particular, to a three-dimensional image reconstruction method and apparatus based on a DeBruijn sequence.

In the prior art, the commonly used three-dimensional image reconstruction technology is a structured light three-dimensional image reconstruction technology, and the structured light three-dimensional image reconstruction technology mainly falls into two categories: spatial domain coding and time domain coding, wherein the spatial domain coding often only needs to project a pattern. The codeword of each point in the pattern can be obtained according to the information of neighboring points around it (such as pixel, color and geometric information, etc.), but it is interfered by information such as pixels and colors during the decoding stage, which has noise interference, thus affecting decoding. Robustness.

Therefore, the existing three-dimensional image reconstruction method has poor noise resistance and poor robustness.

Summary of the invention

The main object of the present invention is to provide a three-dimensional image reconstruction method and apparatus based on DeBruijn sequence, which aims to solve the technical problem of poor anti-noise ability and poor robustness existing in the existing three-dimensional image reconstruction method.

To achieve the above object, a first aspect of the present invention provides a three-dimensional image reconstruction method based on a DeBruijn sequence, the method comprising:

Using a shift register to generate a 4-ary 2-level DeBruijn sequence;

Performing a binary conversion process on the DeBruijn sequence to obtain a binary sequence, and sequentially filling the binary sequence in a gray area in a preset template image to obtain a coded template image;

After the image of the coded template is projected onto the surface of the object, image acquisition is performed, and a coded image including the coded template image information and the object information is obtained, and the coded image is binarized to obtain a first binarized image, wherein The first binarized image includes a plurality of coded feature points, each coded feature point including a central region;

Determining position information of a central region of each of the encoded feature points based on the first binarized image;

And determining, according to the first binarized image and the position information of each of the central regions, an encoded value of each of the encoded feature points, and performing three-dimensional image reconstruction using the encoded value.

To achieve the above object, a second aspect of the present invention provides a three-dimensional image reconstruction apparatus based on a DeBruijn sequence, the apparatus comprising:

Generating a module for generating a 4-ary 2-level DeBruijn sequence by using a shift register;

a conversion module, configured to perform binary conversion processing on the DeBruijn sequence to obtain a binary sequence, and sequentially fill the binary sequence in a gray area in a preset template image to obtain a coded template image;

An acquisition module, configured to perform image acquisition after projecting the code template image onto an object surface, obtain a coded image including coded template image information and object information, and perform binarization processing on the coded image to obtain a first binarization An image, wherein the first binarized image comprises a plurality of coded feature points, each coded feature point comprising a central region;

a first determining module, configured to determine location information of a central area of each of the encoded feature points based on the first binarized image;

And a second determining module, configured to determine, according to the first binarized image and location information of each of the central regions, an encoded value of each of the encoded feature points, and perform three-dimensional image reconstruction by using the encoded value.

The present invention provides a three-dimensional image reconstruction method based on DeBruijn sequence. In the embodiment of the present invention, a 4-level DeBruijn sequence is generated by using a shift register, and a binary sequence is obtained by performing a binary conversion process on the DeBruijn sequence, and the binary sequence is sequentially filled in the order. In the gray area in the template image, the coded template image is obtained, and the coded template image is projected onto the surface of the object to perform image acquisition, and the coded image including the coded template image information and the object information is obtained, and the coded image is binarized to obtain a first binarized image, wherein the first binarized image includes a plurality of coded feature points, each coded feature point includes a central region, and position information of a central region of each coded feature point is determined based on the first binarized image Determining the coded value of each coded feature point based on the first binarized image and the position information of each central region, and performing three-dimensional image reconstruction using the coded value. Compared with the prior art, the embodiment of the present invention is based on the DeBruijn sequence. Encoding the encoded template image obtained by encoding to Image acquisition is performed on the surface of the object to obtain a coded image, and the coded image is binarized. Among them, the binarization process can overcome the color interference of the surface of the object, and the reconstruction of the three-dimensional image has higher anti-noise ability and better. Robustness.

DRAWINGS

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the embodiments or the description of the prior art will be briefly described below. Obviously, the drawings in the following description are only It is a certain embodiment of the present invention, and those skilled in the art can obtain other drawings according to these drawings without any creative work.

1 is a schematic flowchart of a method for reconstructing a three-dimensional image based on a DeBruijn sequence according to a first embodiment of the present invention;

2 is a preset template image in an embodiment of the present invention;

3 is a schematic flow chart showing a refinement step of performing a binary conversion process on a DeBruijn sequence in step S102 in FIG. 1 to obtain a binary sequence;

4 is a schematic diagram of conversion processing of a binary sequence by performing a binary conversion process on a DeBruijn sequence;

Figure 5 is a first binarized image;

6 is a schematic flow chart of the refinement step of step S104;

Figure 7 is a structural view of a peripheral area;

8 is a schematic flow chart of the refinement step of step S105;

Figure 9 is a structural diagram of coded feature points;

FIG. 10 is a schematic diagram of functional modules of a three-dimensional image reconstruction apparatus based on a DeBruijn sequence according to a second embodiment of the present invention; FIG.

11 is a schematic diagram of a refinement function module of the conversion module 1002 of FIG. 10;

12 is a schematic diagram of a refinement function module of the first determining module 1004;

FIG. 13 is a schematic diagram of a refinement function module of the second determining module 1005.

detailed description

The technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the drawings in the embodiments of the present invention. The embodiments are merely a part of the embodiments of the invention, and not all of the embodiments. All other embodiments obtained by a person skilled in the art based on the embodiments of the present invention without creative efforts are within the scope of the present invention.

In order to explain the technical solution described in the present invention, the following description will be made by way of specific embodiments.

Referring to FIG. 1 , FIG. 1 is a schematic flowchart of a method for reconstructing a three-dimensional image based on a DeBruijn sequence according to a first embodiment of the present invention, including:

Step S101, generating a 4-level 2-level DeBruijn sequence by using a shift register;

In the embodiment of the present invention, the 4-bit 2-level DeBruijn sequence is generated by using the shift register, and the DeBruijn sequence is generated by first determining the first sub-sequence by using the shift register, obtaining the iterative function by using the original polynomial, and iterating by using the iterative function. The operation generates a subsequent subsequence, and the iteration ends when the current subsequence is identical to the first subsequence, and a 4-ary 2-level DeBruijn sequence is obtained.

The 4-level 2-level DeBruijn sequence is a pseudo-random sequence with 4 elements, a total length of 16, an arbitrary length, and no sub-sequences. The 4-level 2-level DeBruijn sequence element has a value of 0, 1. 2 and 3.

Step S102, performing a binary conversion process on the DeBruijn sequence to obtain a binary sequence, and sequentially filling the binary sequence in the gray region in the preset template image in order to obtain a coded template image;

In the embodiment of the present invention, please refer to the preset template image shown in FIG. 2, the preset template image is a black and white checkerboard pattern, and the gray area 203 to be filled is set around each corner point, and the gray area is The area of 203 should be smaller than the area of the black checkerboard area 202 and the area of the white checkerboard area 201.

The binary sequence is sequentially filled in the gray area in the preset template image to obtain a coded template image. For example, the preset template image shown in FIG. 2 has a total of 7 rows of gray areas 203 to be filled, and each line has The gray area 203 of the seven grids, assuming that the first line binary sequence is 1100110, the first line binary sequence 1100110 is sequentially filled in order in the first gray line 203 of the preset template image to be filled in the gray area 203, the binary sequence The code word 1 in 1100110 causes the gray area 203 to become black, and the code word 0 in the binary sequence 1100110 causes the gray area 203 to become white, and the color of the 7 gray areas 203 after the first line is filled is displayed in black and white. White black and white, according to the above method, all the binary sequences are sequentially filled in the preset template image in order, and the encoded template image is obtained.

Further, please refer to FIG. 3. FIG. 3 is a schematic flowchart of a refinement step of performing binary conversion processing on the DeBruijn sequence in step S102 in FIG. 1 to obtain a binary sequence, including:

Step S301, converting each codeword in the DeBruijn sequence into binary numbers distributed up and down, and arranging them into two upper and lower rows;

In step S302, the binary numbers of the even columns of all the binary numbers arranged in the upper and lower two rows are up-and-down changed to obtain a binary sequence.

In the embodiment of the present invention, refer to FIG. 4. FIG. 4 is a schematic diagram of a conversion process of a binary sequence obtained by performing a binary conversion process on a DeBruijn sequence, where the 4-element 2-level DeBruijn sequence element takes values of 0, 1, 2, and 3, corresponding to The binary numbers are 00, 01, 10, and 11, respectively. Assuming that a certain row DeBruijn sequence 401 is 3300311320210122, each codeword in the row DeBruijn sequence 401 is converted into a binary number distributed up and down, and arranged in two rows. As shown at 402, the binary numbers of the even columns of all the binary numbers arranged in the upper and lower two rows are up-and-down shifted to obtain a binary sequence as shown by 403.

Step S103: After the code template image is projected onto the surface of the object, the image is collected, and the coded image including the coded template image information and the object information is obtained, and the coded image is binarized to obtain the first binarized image, wherein the first image is obtained. The binarized image includes a plurality of coded feature points, each coded feature point including a central region;

In the embodiment of the present invention, referring to FIG. 5, which is a first binarized image, the first binarized image includes a plurality of coded feature points, each coded feature point includes a central region, and some coded feature points include a center. The color of the area is black, such as 501, and some of the coded feature points include a central area whose color is white, such as 502.

Step S104: Determine location information of a central region of each of the encoded feature points based on the first binarized image;

Further, please refer to FIG. 6. FIG. 6 is a schematic flowchart of the refinement step of step S104, including:

Step S601, performing a closing operation on the first binarized image, and removing a peripheral region of each of the encoded feature points to obtain a second binarized image;

Step S602, determining location information of a central region in which the color in the second binarized image is black;

Step S603, performing black-and-white inversion processing on each pixel in the first binarized image, and performing a closed operation on the first binarized image subjected to the black-and-white inversion processing to remove the peripheral region of each of the encoded feature points. Obtaining a third binarized image;

Step S604, determining that the color in the third binarized image is the position information of the black central region.

In the embodiment of the present invention, each of the coded feature points includes four peripheral regions. Referring to FIG. 7, the four peripheral regions are 701, 702, 703, and 704, respectively, and the first binarized image is closed and removed. A second binarized image is obtained for each peripheral region of the encoded feature point, and the position information of the central region of the black color in the second binarized image is determined, because only the central region of the black color can be closed. Therefore, in order to determine the position information of the central region of the color in the first binarized image, first, each pixel in the first binarized image is subjected to black and white inversion processing, and the black and white inversion processing is performed. A binarized image is subjected to a closing operation to remove a peripheral region of each of the encoded feature points to obtain a third binarized image, and the position information of the central region in which the color in the third binarized image is black is determined, and the third binary value is obtained. The position information of the central region in which the color in the image is black is the position information of the central region in which the color in the first binarized image is white, thereby determining the first binarization map. All the position information in the central region.

Step S105: Determine an encoding value of each coding feature point based on the first binarized image and position information of each central region, and perform three-dimensional image reconstruction using the encoded value.

Further, please refer to FIG. 8. FIG. 8 is a schematic flowchart of the refinement step of step S105, including:

Step S801, determining four adjacent central regions having the same color as the current central region based on the first binarized image and the position information of the current central region;

Step S802, connecting the current central area and the four adjacent central areas to obtain four peripheral areas on the connection line;

Step S803, calculating gray values of the four peripheral regions, and using the gray value of the four peripheral regions as the encoded value of the encoded feature points corresponding to the current central region.

In the embodiment of the present invention, referring to FIG. 9, the current central area is 901, and based on the first binarized image and the position information of the current central area 901, four adjacent central areas having the same color as the current central area are determined to be 902, respectively. 903, 904, and 905, connecting the current central area and four adjacent central areas, obtaining four peripheral areas on the connecting line, and four peripheral areas are 906, 907, 908, and 909, and calculating gray values of four peripheral areas. As shown in FIG. 9, the color of 906 is black, the gray value of 906 is 1, and the color of 907 is white, then the gray value of 907 is 0, the color of 908 is white, and the gray value of 908 is 0. If the color of 909 is white, the gradation value of 909 is 0, and the gradation values 1, 0, 0, and 0 of the four peripheral regions are used as the coding values of the coding feature points corresponding to the current central region, that is, the current central region. The coded value of the corresponding coded feature point is 1, 0, 0, 0.

In the embodiment of the present invention, compared with the prior art, the embodiment of the present invention performs encoding based on the DeBruijn sequence, which can effectively avoid the singularity of the encoding, and image the encoded template image obtained by encoding onto the surface of the object for image acquisition. The coded image is obtained, and the coded image is binarized. Among them, the binarization process can overcome the color interference of the surface of the object, and the reconstruction of the three-dimensional image has higher anti-noise ability and better robustness.

Referring to FIG. 10, FIG. 10 is a schematic diagram of functional modules of a three-dimensional image reconstruction apparatus based on a DeBruijn sequence according to a second embodiment of the present invention, including:

a generating module 1001, configured to generate a 4-ary 2-level DeBruijn sequence by using a shift register;

In the embodiment of the present invention, the generating module 1001 generates a 4-level 2-level DeBruijn sequence by using a shift register, and the method for generating the DeBruijn sequence is: first, the first sub-sequence is determined by using the shift register, the iterative function is obtained by using the original polynomial, and the iteration is utilized. The function performs an iterative operation to generate a subsequent subsequence. When the current subsequence is identical to the first subsequence, the iteration ends, and a 4-level 2-level DeBruijn sequence is obtained.

The 4-level 2-level DeBruijn sequence is a pseudo-random sequence with 4 elements, a total length of 16, an arbitrary length, and no sub-sequences. The 4-level 2-level DeBruijn sequence element has a value of 0, 1. 2 and 3.

The conversion module 1002 is configured to perform a binary conversion process on the DeBruijn sequence to obtain a binary sequence, and sequentially fill the binary sequence in a gray area in the preset template image to obtain a coded template image;

In the embodiment of the present invention, please refer to the preset template image shown in FIG. 2, the preset template image is a black and white checkerboard pattern, and the gray area 203 to be filled is set around each corner point, and the gray area is The area of 203 should be smaller than the area of the black checkerboard area 202 and the area of the white checkerboard area 201.

The conversion module 1002 sequentially fills the binary sequence in the gray area in the preset template image to obtain a coded template image. For example, the preset template image shown in FIG. 2 has a total of 7 rows of gray areas 203 to be filled. Each row has a gray area 203 of 7 grids. Assuming that the first line binary sequence is 1100110, the first line binary sequence 1100110 is sequentially filled in order in the first gray line 203 of the preset template image to be filled. The code word 1 in the binary sequence 1100110 causes the gray area 203 to become black, and the code word 0 in the binary sequence 1100110 causes the gray area 203 to become white, and the color of the 7 gray areas 203 after the first line is filled In the black, black, white, black and white, according to the above method, all the binary sequences are sequentially filled in the preset template image in order, and the encoded template image is obtained.

Further, please refer to FIG. 11. FIG. 11 is a schematic diagram of a refinement function module of the conversion module 1002 of FIG. 10, including:

The converting unit 1101 is configured to convert each codeword in the DeBruijn sequence into binary numbers distributed up and down, and arrange the upper and lower two rows;

The permutation unit 1102 is configured to perform upper and lower positions on the binary numbers of the even columns among all the binary numbers arranged in the upper and lower two rows to obtain a binary sequence.

In the embodiment of the present invention, refer to FIG. 4. FIG. 4 is a schematic diagram of a conversion process of a binary sequence obtained by performing a binary conversion process on a DeBruijn sequence, where the 4-element 2-level DeBruijn sequence element takes values of 0, 1, 2, and 3, corresponding to The binary numbers are 00, 01, 10, and 11, respectively. Assuming that a certain row DeBruijn sequence 401 is 3300311320210122, the conversion unit 1101 converts each codeword in the row DeBruijn sequence 401 into upper and lower distributed binary numbers, and arranges them up and down. In two rows, as shown at 402, the permutation unit 1102 up-and-down the binary numbers of the even-numbered columns of all the binary numbers arranged in the upper and lower two rows to obtain a binary sequence as shown at 403.

The acquisition module 1003 is configured to perform image acquisition after projecting the code template image onto the surface of the object, obtain a coded image including the coded template image information and the object information, and perform binarization processing on the coded image to obtain a first binarized image, wherein The first binarized image includes a plurality of coded feature points, each of the coded feature points including a central region;

In the embodiment of the present invention, referring to FIG. 5, which is a first binarized image, the first binarized image includes a plurality of coded feature points, each coded feature point includes a central region, and some coded feature points include a center. The color of the area is black, such as 501, and some of the coded feature points include a central area whose color is white, such as 502.

a first determining module 1004, configured to determine location information of a central area of each of the encoded feature points based on the first binarized image;

Further, please refer to FIG. 12, which is a schematic diagram of the refinement function module of the first determining module 1004, including:

a first closing operation unit 1201, configured to perform a closing operation on the first binarized image, and remove a peripheral region of each of the encoded feature points to obtain a second binarized image;

a first determining unit 1202, configured to determine location information of a central area in which the color in the second binarized image is black;

The second closing operation unit 1203 is configured to perform black and white inversion processing on each pixel in the first binarized image, and perform a closing operation on the first binarized image subjected to the black and white inversion processing to remove each encoding. a peripheral region of the feature point to obtain a third binarized image;

The second determining unit 1204 is configured to determine location information of a central area in which the color in the third binarized image is black.

In the embodiment of the present invention, each of the coded feature points includes four peripheral regions. Referring to FIG. 7, the four peripheral regions are respectively 701, 702, 703, and 704, and the first closed operation unit 1201 pairs the first binarized image. Performing a closing operation and removing the peripheral region of each of the encoded feature points to obtain a second binarized image, and the first determining unit 1202 determines the position information of the central region of the black color in the second binarized image, because only The central region of the black color is closed, so in order to determine the position information of the central region in which the color in the first binarized image is white, the second closing operation unit 1203 firstly sets each of the first binarized images. The pixel performs black and white inversion processing, and performs a closing operation on the first binarized image subjected to the black and white inversion processing, and the second closing unit 1203 removes the peripheral region of each of the encoded feature points to obtain a third binarized image. Determining position information of a central region in which the color in the third binarized image is black, and the position information of the central region in which the color in the third binarized image is black is the first binary value The color in the image is the position information of the white central region, and the second determining unit 1204 thus determines the position information of all the central regions in the first binarized image.

The second determining module 1005 is configured to determine an encoding value of each coding feature point based on the first binarized image and position information of each central region, and perform three-dimensional image reconstruction using the encoded value.

Further, please refer to FIG. 13, which is a schematic diagram of the refinement function module of the second determining module 1005, including:

The third determining unit 1301 is configured to determine, according to the first binarized image and the location information of the current central region, four adjacent central regions that are the same color as the current central region;

The connecting unit 1302 is configured to connect the current central area and the four adjacent central areas to obtain four peripheral areas on the connecting line;

The calculating unit 1303 is configured to calculate grayscale values of the four peripheral regions, and use the grayscale values of the four peripheral regions as the encoded values of the encoded feature points corresponding to the current central region.

In the embodiment of the present invention, referring to FIG. 9, the current central area is 901, and the third determining unit 1301 determines four neighbors having the same color as the current central area based on the first binarized image and the position information of the current central area 901. The central areas are 902, 903, 904 and 905, respectively. The connecting unit 1302 connects the current central area and the four adjacent central areas, and obtains four peripheral areas on the connecting line, and the four peripheral areas are 906, 907, 908 and 909, and the calculation is performed. The unit 1303 calculates the gradation values of the four peripheral regions. As shown in FIG. 9, the color of 906 is black, the gradation value of 906 is 1, and the color of 907 is white, and the gradation value of 907 is 0, 908. If it is white, the gradation value of 908 is 0, the color of 909 is white, and the gradation value of 909 is 0, and the gradation values 1, 0, 0, and 0 of the four peripheral regions are taken as the current central region. The coded value of the coded feature point, that is, the coded value of the coded feature point corresponding to the current central region is 1, 0, 0, 0.

In the embodiment of the present invention, compared with the prior art, the embodiment of the present invention performs encoding based on the DeBruijn sequence, which can effectively avoid the singularity of the encoding, and image the encoded template image obtained by encoding onto the surface of the object for image acquisition. The coded image is obtained, and the coded image is binarized. Among them, the binarization process can overcome the color interference of the surface of the object, and the reconstruction of the three-dimensional image has higher anti-noise ability and better robustness.

In the several embodiments provided by the present application, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the device embodiments described above are merely illustrative. For example, the division of the modules is only a logical function division. In actual implementation, there may be another division manner, for example, multiple modules or components may be combined or Can be integrated into another system, or some features can be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or module, and may be electrical, mechanical or otherwise.

The modules described as separate components may or may not be physically separated. The components displayed as modules may or may not be physical modules, that is, may be located in one place, or may be distributed to multiple network modules. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, each functional module in each embodiment of the present invention may be integrated into one processing module, or each module may exist physically separately, or two or more modules may be integrated into one module. The above integrated modules can be implemented in the form of hardware or in the form of software functional modules.

The integrated modules, if implemented in the form of software functional modules and sold or used as separate products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention, which is essential or contributes to the prior art, or all or part of the technical solution, may be embodied in the form of a software product stored in a storage medium. A number of instructions are included to cause a computer device (which may be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods described in various embodiments of the present invention. The foregoing storage medium includes: a U disk, a mobile hard disk, a read only memory (ROM, Read-Only)                 Memory, random access memory (RAM), disk or optical disk, and other media that can store program code.

It should be noted that, for the foregoing method embodiments, for the sake of brevity, they are all described as a series of action combinations, but those skilled in the art should understand that the present invention is not limited by the described action sequence. Because certain steps may be performed in other sequences or concurrently in accordance with the present invention. In the following, those skilled in the art should also understand that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily required by the present invention.

In the above embodiments, the descriptions of the various embodiments are all focused, and the parts that are not detailed in a certain embodiment can be referred to the related descriptions of other embodiments.

The above is a description of a method and an apparatus for reconstructing a three-dimensional image based on the DeBruijn sequence provided by the present invention. For those skilled in the art, the idea of the embodiment of the present invention may be changed in the specific implementation manner and the application range. In conclusion, the contents of this specification are not to be construed as limiting the invention.

Claims (8)

A three-dimensional image reconstruction method based on DeBruijn sequence, characterized in that the method comprises:
Using a shift register to generate a 4-ary 2-level DeBruijn sequence;
Performing a binary conversion process on the DeBruijn sequence to obtain a binary sequence, and sequentially filling the binary sequence in a gray area in a preset template image to obtain a coded template image;
After the image of the coded template is projected onto the surface of the object, image acquisition is performed, and a coded image including the coded template image information and the object information is obtained, and the coded image is binarized to obtain a first binarized image, wherein The first binarized image includes a plurality of coded feature points, each coded feature point including a central region;
Determining position information of a central region of each of the encoded feature points based on the first binarized image;
And determining, according to the first binarized image and the position information of each of the central regions, an encoded value of each of the encoded feature points, and performing three-dimensional image reconstruction using the encoded value. The method according to claim 1, wherein the step of performing binary conversion processing on the DeBruijn sequence to obtain a binary sequence comprises:
Converting each codeword in the DeBruijn sequence into binary numbers distributed up and down, and arranging the upper and lower two rows;
The binary numbers of the even columns of all the binary numbers arranged in the upper and lower two rows are up-and-down shifted to obtain the binary sequence. The method according to claim 1, wherein each of the coded feature points includes four peripheral regions, and the step of determining location information of a central region of each of the coded feature points based on the first binarized image includes :
Performing a closing operation on the first binarized image, and removing a peripheral region of each of the encoded feature points to obtain a second binarized image;
Determining position information of a central region in which the color in the second binarized image is black;
And performing black and white inversion processing on each of the first binarized images, and performing a closing operation on the first binarized image subjected to the black and white inversion processing to remove a peripheral region of each of the encoded feature points , obtaining a third binarized image;
The position information of the central region in which the color in the third binarized image is black is determined. The method according to claim 3, wherein the determining the encoded value of each of the encoded feature points based on the first binarized image and the location information of each of the central regions comprises:
Determining four adjacent central regions having the same color as the current central region based on the first binarized image and position information of the current central region;
Connecting the current central area and the four adjacent central areas to obtain four peripheral areas on the connection line;
Calculating gray values of the four peripheral regions, and using the gray values of the four peripheral regions as the encoded values of the encoded feature points corresponding to the current central region. A three-dimensional image reconstruction device based on a DeBruijn sequence, characterized in that the device comprises:
Generating a module for generating a 4-ary 2-level DeBruijn sequence by using a shift register;
a conversion module, configured to perform binary conversion processing on the DeBruijn sequence to obtain a binary sequence, and sequentially fill the binary sequence in a gray area in a preset template image to obtain a coded template image;
An acquisition module, configured to perform image acquisition after projecting the code template image onto an object surface, obtain a coded image including coded template image information and object information, and perform binarization processing on the coded image to obtain a first binarization An image, wherein the first binarized image comprises a plurality of coded feature points, each coded feature point comprising a central region;
a first determining module, configured to determine location information of a central area of each of the encoded feature points based on the first binarized image;
And a second determining module, configured to determine, according to the first binarized image and location information of each of the central regions, an encoded value of each of the encoded feature points, and perform three-dimensional image reconstruction by using the encoded value. The apparatus according to claim 5, wherein the conversion module comprises:
a converting unit, configured to convert each codeword in the DeBruijn sequence into binary numbers distributed up and down, and arranged in two rows;
And a permutation unit, configured to perform upper and lower positional replacement of the binary numbers of the even columns of all the binary numbers arranged in the upper and lower two rows to obtain the binary sequence. The apparatus according to claim 5, wherein each of the coded feature points comprises four peripheral regions, and the first determining module comprises:
a first closed operation unit, configured to perform a closing operation on the first binarized image, and remove a peripheral region of each of the encoded feature points to obtain a second binarized image;
a first determining unit, configured to determine location information of a central area in which the color in the second binarized image is black;
a second closing operation unit configured to perform black and white inversion processing on each of the first binarized images, and perform a closing operation on the first binarized image subjected to the black and white inversion processing to remove the a third binarized image is obtained for each peripheral region of the encoded feature point;
And a second determining unit, configured to determine position information of a central area in which the color in the third binarized image is black. The apparatus according to claim 7, wherein the second determining module comprises:
a third determining unit, configured to determine, according to the first binarized image and location information of the current central region, four adjacent central regions that are the same color as the current central region;
a connecting unit, configured to connect the current central area and the four adjacent central areas to obtain four peripheral areas on the connecting line;
And a calculating unit, configured to calculate a gray value of the four peripheral regions, and use a gray value of the four peripheral regions as an encoded value of the encoded feature point corresponding to the current central region.