A signal verification method for single pixel imaging
By accumulating the sampling matrix row and column in single-pixel imaging technology, constructing sub-matrixes and calculating the error signal judgment value, the problem of timing errors in signal acquisition is solved, and the stability and accuracy of image reconstruction are achieved.
Patent Information
- Application Number
- CN202210091027.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-01-26
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2042-01-26
AI Technical Summary
In single-pixel imaging technology, circuit delays and counting errors may occur during signal acquisition, resulting in sampling timing errors, and image reconstruction cannot be achieved.
A signal detection method is designed. By dividing the sampling matrix into multiple groups, each group is accumulated in rows and columns, sub-matrix Af and sub-matrix Ag, and using binary representation and verification matrix or projection matrix to calculate the error signal judgment value to determine the specific Position error signal.
The error detection and positioning during signal acquisition are realized to ensure the stability and accuracy of image reconstruction.
Smart Images

Figure CN114449258B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of imaging technology, and in particular to a signal inspection method for single-pixel imaging. Background Art
[0002] Single-pixel imaging technology is an emerging imaging technology that encodes the light field and reconstructs the target image at a low sampling rate using only a single-pixel detector without spatial resolution. This technology has received widespread attention in many fields such as high-sensitivity imaging, multispectral imaging, terahertz imaging, and infrared imaging. However, during the signal acquisition process, sampling timing errors may occur due to circuit delays, counting errors, etc., making image reconstruction impossible. Therefore, designing a sampling strategy with an error detection mechanism is critical to stabilizing system performance.
[0003] The present invention designs a set of sampling methods for monitoring signals according to the characteristics of single-pixel sampling signals, and determines whether errors occur in the signals by comparing the differences between the monitoring signals and the sampling signals. Summary of the invention
[0004] The present invention aims at the deficiencies in the prior art and provides a signal inspection method for single-pixel imaging.
[0005] To achieve the above object, the present invention adopts the following technical solutions:
[0006] A signal inspection method for single pixel imaging, comprising:
[0007] The single-pixel detector designs the sampling matrix and performs sampling according to the size of the object being detected;
[0008] The sampling matrix is divided into multiple groups, each group contains C sampling matrices, and the C sampling matrices in each group are arranged in the form of r rows and s columns, and the acquisition signal corresponding to each sampling matrix in the corresponding group is y ij , where the collected signal y ij The i in the matrix represents the row number of the corresponding sampling matrix, that is, the range of i is [1, r]; j represents the column number of the corresponding sampling matrix, that is, the range of j is [1, s];
[0009] For each group of C sampling matrices, the sampling matrix elements in each row f are accumulated to obtain a new sub-matrix A for each row f , where the range of f is [1, r]; according to the submatrix A f Calculate the error signal determination value T corresponding to a row of the sampling matrix f , and determine the value T according to the error signal f The value of determines whether there is an error signal in the sampling matrix in the corresponding row;
[0010] For each group of C sampling matrices, the sampling matrix elements in each column g are accumulated to obtain a new sub-matrix A for each column g , where the range of g is [1, s]; according to the submatrix A g Calculate the error signal determination value T corresponding to the sampling matrix in a column g , and determine the value T according to the error signal g The value of determines whether there is an error signal in the sampling matrix in the corresponding column;
[0011] According to the error signal determination value T f Determine the row number of the sampling matrix that generates the error signal, and determine the value T according to the error signal g Determine the column number of the sampling matrix where the error signal is generated, and then find out the specific location where the error signal is generated.
[0012] To optimize the above technical solutions, the specific measures taken also include:
[0013] Furthermore, according to the submatrix A f Calculate the error signal determination value T corresponding to a row of the sampling matrix f The specific content is:
[0014] Sub-matrix A f Each element in is represented by binary, and the value of the same position in the binary corresponding to each element is taken out to construct a test matrix. Each submatrix A f There are k test matrices in total; use the test matrix to modulate the pattern and obtain the acquisition signal t corresponding to the test matrix l , where the acquisition signal t l Where l represents any test matrix, that is, the range of l is [0, k-1]; and the corresponding submatrix A is calculated f Error signal judgment value
[0015] Further, according to the error signal determination value T f The specific content of judging whether there is an error signal in the sampling matrix in the corresponding row is:
[0016] When T f When <1%, it is determined that T f The corresponding sub-matrix A f There is an error signal, and then judge the submatrix A f There is an error signal in the sampling matrix in the corresponding row; when T f ≥1%, then it is determined that T f The corresponding sub-matrix A f There is no error signal, and then judge the sub-matrix A fThe sampling matrix in the corresponding row has no error signal.
[0017] Furthermore, each submatrix A f The numerical calculation formula for k in a total of k projection matrices is:
[0018] k=[log2s]+1
[0019] In the formula, [log2s] means rounding the high-order integer of the value of log2s.
[0020] Furthermore, according to the submatrix A g Calculate the error signal determination value T corresponding to the sampling matrix in a column g The specific content is:
[0021] Sub-matrix A g Each element in is represented by binary, and the value of the same position in the binary corresponding to each element is taken out to construct a projection matrix. Each submatrix A g There are k′ projection matrices in total. The projection matrix is used to modulate the pattern to obtain the acquisition signal t corresponding to the projection matrix. l ′, where the acquisition signal t l The l′ in ′ represents any projection matrix, that is, the range of l′ is [0, k′-1]; and the corresponding submatrix A is calculated g Error signal judgment value
[0022] Further, according to the error signal determination value T g The specific content of judging whether there is an error signal in the sampling matrix in the corresponding column is:
[0023] When T g When <1%, it is determined that T g The corresponding sub-matrix A g There is an error signal, and then judge the submatrix A g There is an error signal in the sampling matrix in the corresponding column; when T g ≥1%, then it is determined that T g The corresponding sub-matrix A g There is no error signal, and then judge the sub-matrix A g The sampling matrix in the corresponding column has no error signal.
[0024] Furthermore, each submatrix A g The numerical calculation formula for k′ in a total of k′ projection matrices is:
[0025] k′=[log2r]+1
[0026] In the formula, [log2r] means rounding the value of log2r to the nearest integer.
[0027] The beneficial effects of the present invention are:
[0028] In the traditional signal acquisition process, circuit delays, counting errors, etc. may cause sampling timing errors, making it impossible to achieve image reconstruction. This application arranges the sampling matrix in rows and columns and integrates them to obtain a submatrix A f and submatrix A g , and by calculating the submatrix A f and submatrix A g The respective inspection matrix or projection matrix is used to determine the location of the sampling matrix that specifically generates the error signal, so as to realize the inspection in the signal acquisition process. BRIEF DESCRIPTION OF THE DRAWINGS
[0029] Figure 1 The sampling matrix and the sub-matrix A in the embodiment of the present invention are f , sub-matrix A g Schematic diagram of the relationship.
[0030] Figure 2 Each row of the sampling matrix of the present invention is accumulated to obtain the corresponding sub-matrix A f And each column of the sampling matrix is accumulated to obtain the corresponding sub-matrix A g Schematic diagram.
[0031] Figure 3 is the sub-matrix A of the present invention f or submatrix A g Schematic diagram of constructing a reorganized test matrix or projection matrix.
[0032] Figure 4 In the embodiment of the present invention, a submatrix A is f The elements in are converted into binary and split to construct a relationship diagram of multiple test matrices. DETAILED DESCRIPTION
[0033] The present invention will now be described in further detail with reference to the accompanying drawings.
[0034] The present application provides a signal verification method based on the principle of the prior art (single-pixel signal acquisition process).
[0035] 1. First, let’s introduce the acquisition process of single pixel signal (existing technology)
[0036] Single-pixel imaging uses a single-pixel detector to sample the object to be imaged through a structured illumination light field with a specific spatial distribution. The structured illumination light field is modulated by the object and then feeds back light intensity information, which is collected by the single-pixel detector. By continuously changing the modulation pattern on the modulator and performing synchronous detection, a two-dimensional image of the object can be reconstructed through correlation operations between a series of detection values and the modulation pattern.
[0037] According to the size of the image, design the sampling matrix P i (x,y),P i ∈R m×n , where R represents the matrix space and P i is a matrix with m rows and n columns. The modulation pattern distribution on the modulator using the sampling matrix, and the corresponding detection value on the detector is y i , then the detection process can be written as:
[0038] y i =∑ x ∑ y P i (x, y) · T(x, y)
[0039] Where T(x, y) is the reflectivity (transmittance) distribution of the object, ∑ x ∑ y The x and y in the image represent the coordinates of the x and y points respectively. i In single-pixel imaging, it is used for computational imaging.
[0040] The two-dimensional modulation matrix P (sampling matrix P i (x, y)) are rearranged into a one-dimensional row vector, and according to their modulation order, multiple modulation patterns are reorganized row by row to obtain a two-dimensional measurement matrix, denoted as A, A∈R M×N , N = m × n represents the resolution of structured light coding, and M is the number of experimental measurements. Similarly, the object distribution T(x, y) is converted into a column vector denoted as x, x∈R N . Then the detection process can be written as:
[0041] y=Ax
[0042] Then the ideal reconstruction process can be written as:
[0043]
[0044] In the formula, y represents a vector, whose value is determined by the above detection value y i Composition, T represents matrix transpose.
[0045] In actual use, since the image has information redundancy, the equation y=Ax can be an underdetermined set of equations, and the image can be restored using the compressed sensing algorithm. Therefore, in actual use, when an error is found in the collected signal, the matrix and the collected signal are removed from the equation y=Ax without affecting the image.
[0046] It should be noted that a sampling matrix is generated according to the size of the image, and the matrix elements are only 0 and 1. Generally, the elements of 0 and 1 each account for about 50%.
[0047] 2. Inspection Method (Innovation of this Application)
[0048] refer to Figure 1 . Divide the sampling matrix into multiple groups (the sampling matrix can be multiple, and the number of sampling matrices generated is the number of sampling times. For example, in the above: M is the number of experimental measurements, which means that the sampling is M times), each group has C sampling matrices. Divide these C sampling matrices according to r×s( Figure 1 The embodiment is arranged in a manner of 4 rows, 4 columns, and 16 sampling matrices. The acquisition signal corresponding to each sampling matrix is y ij , where the collected signal y ij The i in the above example represents the row number of the corresponding sampling matrix, i.e., the range of i is [1, r]; j represents the column number of the corresponding sampling matrix, i.e., the range of j is [1, s] (for example, the acquisition signal corresponding to the sampling matrix of row 1 and column 1 is y 11 , the sampling matrix in row 1 and column 2 corresponds to the acquisition signal y 12 , the sampling matrix in row 2 and column 1 corresponds to the acquisition signal y 21 ,,,,,).
[0049] refer to Figure 1 , Figure 2 , Figure 3 . Accumulate the sampling matrix of each row to get the new sub-matrix A f (f=1...r), (where submatrix A f f in the matrix represents the submatrix A f Specifically, which row of the sampling matrix does it correspond to? For example, A f=1 The submatrix corresponding to the sampling matrix for row 1 is: Figure 1 and Figure 2 There are 4 sub-matrices A in total f ), sub-matrix A f Each element value in is represented by binary, and a new test matrix series is constructed according to the same bit of each element, totaling k = [log2s] + 1. The test matrix is A from low to high in binary bit order. f0 , A f1 ,,,A fk-1 . Using the check matrix, modulation pattern, and acquisition signal tl (l=0...k-1)(where the acquisition signal t l Where l represents any test matrix, for example, t0 corresponds to the test matrix A f0 The collected signal, t1 corresponds to the test matrix A f1 of the collected signal).
[0050] calculate As a basis for judgment, when T f If it is less than 1%, it can be considered that there is an error signal in the signal collected by this row of acquisition matrix, otherwise there is no error (where T f is the error signal judgment value. When f=1, the error signal judgment value is T1, which means that the judgment is made on the acquisition matrix in the first row, corresponding to the submatrix A. f=1 ).
[0051] Similarly, the sampling matrix of each column is accumulated to obtain a new sub-matrix A g (g=1...s), (where submatrix A g g in the matrix represents the submatrix A g Specifically, which column of the sampling matrix does it correspond to? For example, A g=1 The submatrix corresponding to the first column of the sampling matrix is: Figure 1 and Figure 2 There are 4 sub-matrices A in total g ) Sub-matrix A g Each element value in is represented by binary, and a new projection matrix series is constructed according to the same bit of each element, totaling k′=[log2r]+1. The projection matrix is A from low to high. g0 , A g1 ,,,A gk′-1 . Using the new projection matrix, modulation pattern, and acquisition signal t l '(l'=0...k'-1)(where the acquisition signal t l The l' in ' represents any projection matrix, for example, t0' corresponds to the projection matrix A g0 The collected signal, t1′ corresponds to the projection matrix A g1 of the collected signal).
[0052] calculate As a basis for judgment, when T g If the value is less than 1%, it can be considered that there is an error signal in the signal collected by this column of acquisition matrix, otherwise there is no error (where T g is the error signal judgment value. When g = 1, the error signal judgment value is T1, which means that the judgment is made on the acquisition matrix in the first column, corresponding to the submatrix A g=1 ).
[0053] The T of each row of the submatrix is calculated by the above scheme f And each column of the submatrix T g , we can know which row and column of the sub-matrix has the signal error, and the sub-matrix corresponds to the sampling matrix of each row or each column, so we can know the location of the error signal of the specific sampling matrix.
[0054] The following is a supplementary explanation of the relevant content concepts:
[0055] 1. For submatrix A f or submatrix A g Each element value in is represented in binary, and according to the same bit of each element, a new series of test matrices or series of projection matrices is constructed.
[0056] refer to Figure 3 and Figure 4 , with a submatrix A f Let's take an example. For matrix A f , its elements are: 84, 61, 127, 214, 87, 62, 17, 194, 152; these element values are expressed in binary, and the values of the same binary positions are taken out, for example, the lowest bit (0th bit) are reorganized into a test matrix, and a total of 8 test matrices are taken from the lowest bit to the highest bit. Similarly, submatrix A g Same here.
[0057] 2. From the above point 1, we can know that the number of reconstructed test matrices actually depends on the total number of bits after binary, and the calculation formula for k (i.e. k = [log2s] + 1) is actually the calculation of the total number of bits in binary. The same is true for the number of reconstructed projection matrices.
[0058] 3. Regarding the concept of "accumulation" in accumulating the sampling matrix of each row or column
[0059] The sizes of the sampling matrices are the same, and matrix accumulation is to add the elements at the same position in the matrix (each element is initially 0 or 1, as also mentioned in the above description) to obtain a sub-matrix of the same size (with different element values).
[0060] It should be noted that the terms such as "upper", "lower", "left", "right", "front", "back", etc. cited in the invention are only for the convenience of description and are not used to limit the scope of implementation of the present invention. Changes or adjustments in their relative relationships should be regarded as the scope of implementation of the present invention without substantially changing the technical content.
[0061] The above are only preferred embodiments of the present invention, and the protection scope of the present invention is not limited to the above embodiments. All technical solutions under the concept of the present invention belong to the protection scope of the present invention. It should be pointed out that for ordinary technicians in this technical field, some improvements and modifications without departing from the principle of the present invention should be regarded as the protection scope of the present invention.
Claims
1. A signal inspection method for single pixel imaging, characterized in that: include: The single-pixel detector designs the sampling matrix and performs sampling according to the size of the object being detected; The sampling matrix is divided into multiple groups, each group contains C sampling matrices, and the C sampling matrices in each group are arranged in the form of r rows and s columns, and the acquisition signal corresponding to each sampling matrix in the corresponding group is y ij , where the collected signal y ij The i in the matrix represents the row number of the corresponding sampling matrix, that is, the range of i is [1, r]; j represents the column number of the corresponding sampling matrix, that is, the range of j is [1, s]; For each group of C sampling matrices, the sampling matrix elements in each row f are accumulated to obtain a new sub-matrix A for each row f , where the range of f is [1, r]; according to the submatrix A f Calculate the error signal determination value T corresponding to a row of the sampling matrix f , and judge whether there is an error signal in the sampling matrix in the corresponding row according to the value of the error signal judgment value Tf; the sub-matrix A f Calculate the error signal determination value T corresponding to a row of the sampling matrix f The specific content is: Sub-matrix A f Each element in is represented by binary, and the value of the same position in the binary corresponding to each element is taken out to construct a test matrix. Each submatrix A f There are k test matrices in total; Using the test matrix modulation pattern, we can get the acquisition signal t corresponding to the test matrix. l , where the acquisition signal t l Where l represents any test matrix, that is, the range of l is [0, k-1]; and the corresponding submatrix A is calculated f The error signal judgment value j The error signal determination value T f The specific content of judging whether there is an error signal in the sampling matrix in the corresponding row is: When T f <1%, then T f The corresponding sub-matrix A f There is an error signal, and then judge the submatrix A f There is an error signal in the sampling matrix in the corresponding row; when T f ≥1%, then it is determined that T f The corresponding sub-matrix A f There is no error signal, and then judge the sub-matrix A f The sampling matrix in the corresponding row has no error signal; For each group of C sampling matrices, the sampling matrix elements in each column g are accumulated to obtain a new sub-matrix A for each column g , where the range of g is [1, s]; according to the submatrix A g Calculate the error signal determination value T corresponding to the sampling matrix in a column g , and determine the value T according to the error signal g The value of determines whether there is an error signal in the sampling matrix in the corresponding column; According to the sub-matrix A g Calculate the error signal determination value T corresponding to the sampling matrix in a column g The specific content is: Sub-matrix A g Each element in is represented by binary, and the value of the same position in the binary corresponding to each element is taken out to construct a projection matrix. Each submatrix A g There are k′ projection matrices in total. The projection matrix is used to modulate the pattern to obtain the acquisition signal t corresponding to the projection matrix. l ′, where the acquisition signal t l The l′ in ′ represents any projection matrix, that is, the range of l′ is [0, k′-1]; and the corresponding submatrix A is calculated g The error signal judgment value The error signal determination value T g The specific content of judging whether there is an error signal in the sampling matrix in the corresponding column is: When T g <1%, then T g The corresponding sub-matrix A g There is an error signal, and then judge the submatrix A g There is an error signal in the sampling matrix in the corresponding column; when T g ≥1%, then it is determined that T g The corresponding sub-matrix A g There is no error signal, and then judge the sub-matrix A g The sampling matrix in the corresponding column has no error signal; According to the error signal determination value T f Determine the row number of the sampling matrix that generates the error signal, and determine the value T according to the error signal g Determine the column number of the sampling matrix where the error signal is generated, and then find out the specific location where the error signal is generated.
2. The signal inspection method for single pixel imaging according to claim 1, characterized in that: Each submatrix A f The numerical calculation formula for k in a total of k projection matrices is: k=[log2s]+1 In the formula, [log2s] means rounding the high-order integer of the value of log2s.
3. The signal inspection method for single pixel imaging according to claim 1, characterized in that: Each submatrix A g The numerical calculation formula for k′ in a total of k′ projection matrices is: k′=[log2r]+1 In the formula, [log2r] means rounding the value of log2r to the nearest integer.
