CN110823385A - Efficient algorithm for replacing blind pixels of infrared focal plane - Google Patents
Efficient algorithm for replacing blind pixels of infrared focal plane Download PDFInfo
- Publication number
- CN110823385A CN110823385A CN201911152301.5A CN201911152301A CN110823385A CN 110823385 A CN110823385 A CN 110823385A CN 201911152301 A CN201911152301 A CN 201911152301A CN 110823385 A CN110823385 A CN 110823385A
- Authority
- CN
- China
- Prior art keywords
- blind
- point
- blind pixel
- replacing
- judging whether
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 claims description 11
- 230000000694 effects Effects 0.000 abstract description 4
- 238000004364 calculation method Methods 0.000 description 2
- 230000005855 radiation Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000003384 imaging method Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01J—MEASUREMENT OF INTENSITY, VELOCITY, SPECTRAL CONTENT, POLARISATION, PHASE OR PULSE CHARACTERISTICS OF INFRARED, VISIBLE OR ULTRAVIOLET LIGHT; COLORIMETRY; RADIATION PYROMETRY
- G01J5/00—Radiation pyrometry, e.g. infrared or optical thermometry
- G01J5/02—Constructional details
- G01J5/026—Control of working procedures of a pyrometer, other than calibration; Bandwidth calculation; Gain control
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Spectroscopy & Molecular Physics (AREA)
- Transforming Light Signals Into Electric Signals (AREA)
Abstract
The invention discloses an efficient algorithm for replacing blind pixels of an infrared focal plane, which can quickly and effectively realize blind pixel replacement by reasonably selecting an operation window and selecting different replacement modes according to the positions of the blind pixels in the window; the algorithm has 21 blind pixel replacement modes, adopts different replacement modes according to the positions of the blind pixels, and has high replacement accuracy and ideal effect; for the blind pixels with the area smaller than 3 x 5, the replacement accuracy can reach 100%; for the blind pixels with the area larger than 3 x 3, only one replacement is needed, and the efficiency is high.
Description
Technical Field
The invention relates to the technical field of blind pixel algorithms, in particular to an efficient algorithm for replacing blind pixels of an infrared focal plane.
Background
The infrared focal plane inevitably has blind pixels due to the influence of material defects and manufacturing process inconsistency. The response of the blind pixels to the infrared radiation is too low or too high, the infrared radiation distribution cannot be truly reflected, and the imaging quality of the infrared focal plane is seriously influenced. From the literature, the blind pixel replacement method mostly uses a neighborhood median or mean of the blind pixels, for example, 8-neighborhood mean or median, 4-neighborhood median or mean. Because the replacement mode is single, if the neighborhood selection is too small, the effect of replacing the blind pixels with large area is not ideal or the blind pixels cannot be replaced at all, and if the neighborhood selection is too large, the calculation amount is large, and resources are consumed.
Disclosure of Invention
The invention aims to provide an efficient algorithm for replacing blind pixels of an infrared focal plane, so as to solve the problems in the background technology.
In order to achieve the purpose, the invention provides the following technical scheme: an efficient algorithm for infrared focal plane blind pixel replacement comprises the following steps:
A. selecting 3 rows and 5 columns of operation windows by taking (i, j) as a center;
B. judging whether the 8 neighborhoods are all blind pixels, if yes, entering the 8 neighborhoods and all the blind pixels, and if not, performing the step C;
C. judging whether the X line and the + line have no blind pixel, if so, replacing the blind pixel by the 8 neighborhood mean value, otherwise, performing the step D;
D. judging whether blind pixels exist on the X line and the + line, if so, performing a step G, and otherwise, performing a step E;
E. judging whether the X line has no blind pixel and the + line has a blind pixel, if so, replacing the blind pixel by the mean value of the X line, otherwise, performing the step F;
F. replacing the blind pixels by the mean value of the + line;
G. judging whether the line has no blind pixel, if so, replacing the blind pixel by the line mean value, otherwise, performing the step H;
H. judging whether the \ line has no blind pixel, if so, replacing the blind pixel by the \ line mean value, otherwise, performing the step I;
I. judging whether the | line has no blind pixel, if so, replacing the blind pixel by the | line mean value, and otherwise, performing the step J;
J. and judging whether the line has no blind element, if so, replacing the blind element by a line mean value, and otherwise, entering oblique lines, reverse oblique lines, vertical lines and transverse lines, wherein the blind element replaces sub-processes.
Preferably, the 8-neighborhood blind pixel replacement sub-process comprises the following steps:
a. judging whether the point (i-1, j-2) is a blind pixel, if so, performing the step 2, and otherwise, replacing the blind pixel with the point (i-1, j-2);
b. judging whether the point (i-1, j + 2) is a blind pixel, if so, performing the step 3, and otherwise, replacing the blind pixel with the point (i-1, j + 2);
c. judging whether the point (i, j-2) is a blind pixel, if so, performing the step 4, and otherwise, replacing the blind pixel with the point (i, j-2);
d. judging whether the point (i, j + 2) is a blind pixel, if so, performing the step 5, and otherwise, replacing the blind pixel with the point (i, j + 2);
e. judging whether the point (i +1, j-2) is a blind pixel, if so, performing the step 6, and otherwise, replacing the blind pixel with the point (i +1, j-2);
f. and judging whether the point (i +1, j + 2) is a blind pixel, if so, ending, and otherwise, replacing the blind pixel with the point (i +1, j + 2).
Preferably, the sub-process with the blind pixel replacement of the oblique line, the reverse oblique line, the vertical line and the horizontal line comprises the following steps:
(1) judging whether the point (i, j-1) is a blind pixel, if so, performing the step 2, and otherwise, replacing the blind pixel with the point (i, j-1);
(2) judging whether the point (i, j + 1) is a blind pixel, if so, performing the step 3, and otherwise, replacing the blind pixel with the point (i, j + 1);
(3) judging whether the point (i-1, j) is a blind pixel, if so, performing the step 4, and otherwise, replacing the blind pixel with the point (i-1, j);
(4) judging whether the point (i +1, j) is a blind pixel, if so, performing the step 5, and otherwise, replacing the blind pixel with the point (i +1, j);
(5) judging whether the point (i-1, j-1) is a blind pixel, if so, performing the step 6, and otherwise, replacing the blind pixel with the point (i-1, j-1);
(6) judging whether the point (i-1, j + 1) is a blind pixel, if so, performing the step 7, and otherwise, replacing the blind pixel with the point (i-1, j + 1);
(7) judging whether the point (i +1, j-1) is a blind pixel, if so, performing the step 8, and otherwise, replacing the blind pixel with the point (i +1, j-1);
(8) the blind pixel is replaced by a point (i +1, j + 1).
Compared with the prior art, the invention has the beneficial effects that: the algorithm has 21 blind pixel replacement modes, adopts different replacement modes according to the positions of the blind pixels, and has high replacement accuracy and ideal effect; for the blind pixels with the area smaller than 3 x 5, the replacement accuracy can reach 100%; for the blind pixels with the area larger than 3 x 3, only one replacement is needed, and the efficiency is high.
Drawings
FIG. 1 is a flow chart of the algorithm of the present invention;
FIG. 2 is a sub-flowchart of the present invention in which all the neighbors are blind pixel replacements;
FIG. 3 is a sub-flow chart showing the steps of the present invention, including the steps of slash, vertical line and horizontal line, all with blind replacement;
FIG. 4 is a schematic diagram of an operation window of 3 rows and 5 columns according to the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1-4, the present invention provides a technical solution: according to the invention, through reasonably selecting the operation window, different replacement modes are selected according to the positions of the blind pixels in the window, and the blind pixel replacement is quickly and effectively realized. The selection of the calculation window is shown in fig. 4; wherein, the point (i, j) is a blind pixel, the window with 3 rows and 5 columns is selected by taking the point (i, j) as the center, and the points on the oblique line/, the reverse oblique line \ and the vertical line | and the horizontal line-form an 8-neighborhood of the point (i, j).
The invention discloses an efficient algorithm for replacing blind pixels of an infrared focal plane, which comprises the following steps:
A. selecting 3 rows and 5 columns of operation windows by taking (i, j) as a center;
B. judging whether the 8 neighborhoods are all blind pixels, if yes, entering the 8 neighborhoods and all the blind pixels, and if not, performing the step C;
C. judging whether the X line and the + line have no blind pixel, if so, replacing the blind pixel by the 8 neighborhood mean value, otherwise, performing the step D;
D. judging whether blind pixels exist on the X line and the + line, if so, performing a step G, and otherwise, performing a step E;
E. judging whether the X line has no blind pixel and the + line has a blind pixel, if so, replacing the blind pixel by the mean value of the X line, otherwise, performing the step F;
F. replacing the blind pixels by the mean value of the + line;
G. judging whether the line has no blind pixel, if so, replacing the blind pixel by the line mean value, otherwise, performing the step H;
H. judging whether the \ line has no blind pixel, if so, replacing the blind pixel by the \ line mean value, otherwise, performing the step I;
I. judging whether the | line has no blind pixel, if so, replacing the blind pixel by the | line mean value, and otherwise, performing the step J;
J. and judging whether the line has no blind element, if so, replacing the blind element by a line mean value, and otherwise, entering oblique lines, reverse oblique lines, vertical lines and transverse lines, wherein the blind element replaces sub-processes.
In the invention, the sub-process of replacing the blind pixels in 8 neighborhoods comprises the following steps:
a. judging whether the point (i-1, j-2) is a blind pixel, if so, performing the step 2, and otherwise, replacing the blind pixel with the point (i-1, j-2);
b. judging whether the point (i-1, j + 2) is a blind pixel, if so, performing the step 3, and otherwise, replacing the blind pixel with the point (i-1, j + 2);
c. judging whether the point (i, j-2) is a blind pixel, if so, performing the step 4, and otherwise, replacing the blind pixel with the point (i, j-2);
d. judging whether the point (i, j + 2) is a blind pixel, if so, performing the step 5, and otherwise, replacing the blind pixel with the point (i, j + 2);
e. judging whether the point (i +1, j-2) is a blind pixel, if so, performing the step 6, and otherwise, replacing the blind pixel with the point (i +1, j-2);
f. and judging whether the point (i +1, j + 2) is a blind pixel, if so, ending, and otherwise, replacing the blind pixel with the point (i +1, j + 2).
In the invention, the sub-processes of oblique line/, reverse oblique line \ vertical line | and horizontal line-all having blind pixel replacement comprise the following steps:
(1) judging whether the point (i, j-1) is a blind pixel, if so, performing the step 2, and otherwise, replacing the blind pixel with the point (i, j-1);
(2) judging whether the point (i, j + 1) is a blind pixel, if so, performing the step 3, and otherwise, replacing the blind pixel with the point (i, j + 1);
(3) judging whether the point (i-1, j) is a blind pixel, if so, performing the step 4, and otherwise, replacing the blind pixel with the point (i-1, j);
(4) judging whether the point (i +1, j) is a blind pixel, if so, performing the step 5, and otherwise, replacing the blind pixel with the point (i +1, j);
(5) judging whether the point (i-1, j-1) is a blind pixel, if so, performing the step 6, and otherwise, replacing the blind pixel with the point (i-1, j-1);
(6) judging whether the point (i-1, j + 1) is a blind pixel, if so, performing the step 7, and otherwise, replacing the blind pixel with the point (i-1, j + 1);
(7) judging whether the point (i +1, j-1) is a blind pixel, if so, performing the step 8, and otherwise, replacing the blind pixel with the point (i +1, j-1);
(8) the blind pixel is replaced by a point (i +1, j + 1).
In conclusion, the algorithm has 21 blind pixel replacement modes, different replacement modes are adopted according to the positions where the blind pixels appear, the replacement accuracy is high, and the effect is ideal; for the blind pixels with the area smaller than 3 x 5, the replacement accuracy can reach 100%; for the blind pixels with the area larger than 3 x 3, only one replacement is needed, and the efficiency is high.
Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.
Claims (3)
1. An efficient algorithm for infrared focal plane blind pixel replacement is characterized in that: the method comprises the following steps:
A. selecting 3 rows and 5 columns of operation windows by taking (i, j) as a center;
B. judging whether the 8 neighborhoods are all blind pixels, if yes, entering the 8 neighborhoods and all the blind pixels, and if not, performing the step C;
C. judging whether the X line and the + line have no blind pixel, if so, replacing the blind pixel by the 8 neighborhood mean value, otherwise, performing the step D;
D. judging whether blind pixels exist on the X line and the + line, if so, performing a step G, and otherwise, performing a step E;
E. judging whether the X line has no blind pixel and the + line has a blind pixel, if so, replacing the blind pixel by the mean value of the X line, otherwise, performing the step F;
F. replacing the blind pixels by the mean value of the + line;
G. judging whether the line has no blind pixel, if so, replacing the blind pixel by the line mean value, otherwise, performing the step H;
H. judging whether the \ line has no blind pixel, if so, replacing the blind pixel by the \ line mean value, otherwise, performing the step I;
I. judging whether the | line has no blind pixel, if so, replacing the blind pixel by the | line mean value, and otherwise, performing the step J;
J. and judging whether the line has no blind element, if so, replacing the blind element by a line mean value, and otherwise, entering oblique lines, reverse oblique lines, vertical lines and transverse lines, wherein the blind element replaces sub-processes.
2. The efficient algorithm for infrared focal plane blind pixel replacement according to claim 1, wherein: the 8-neighborhood blind pixel replacement sub-process comprises the following steps:
a. judging whether the point (i-1, j-2) is a blind pixel, if so, performing the step 2, and otherwise, replacing the blind pixel with the point (i-1, j-2);
b. judging whether the point (i-1, j + 2) is a blind pixel, if so, performing the step 3, and otherwise, replacing the blind pixel with the point (i-1, j + 2);
c. judging whether the point (i, j-2) is a blind pixel, if so, performing the step 4, and otherwise, replacing the blind pixel with the point (i, j-2);
d. judging whether the point (i, j + 2) is a blind pixel, if so, performing the step 5, and otherwise, replacing the blind pixel with the point (i, j + 2);
e. judging whether the point (i +1, j-2) is a blind pixel, if so, performing the step 6, and otherwise, replacing the blind pixel with the point (i +1, j-2);
f. and judging whether the point (i +1, j + 2) is a blind pixel, if so, ending, and otherwise, replacing the blind pixel with the point (i +1, j + 2).
3. The efficient algorithm for infrared focal plane blind pixel replacement according to claim 1, wherein: the sub-process of replacing the blind pixels of the oblique line, the reverse oblique line, the vertical line and the horizontal line comprises the following steps:
(1) judging whether the point (i, j-1) is a blind pixel, if so, performing the step 2, and otherwise, replacing the blind pixel with the point (i, j-1);
(2) judging whether the point (i, j + 1) is a blind pixel, if so, performing the step 3, and otherwise, replacing the blind pixel with the point (i, j + 1);
(3) judging whether the point (i-1, j) is a blind pixel, if so, performing the step 4, and otherwise, replacing the blind pixel with the point (i-1, j);
(4) judging whether the point (i +1, j) is a blind pixel, if so, performing the step 5, and otherwise, replacing the blind pixel with the point (i +1, j);
(5) judging whether the point (i-1, j-1) is a blind pixel, if so, performing the step 6, and otherwise, replacing the blind pixel with the point (i-1, j-1);
(6) judging whether the point (i-1, j + 1) is a blind pixel, if so, performing the step 7, and otherwise, replacing the blind pixel with the point (i-1, j + 1);
(7) judging whether the point (i +1, j-1) is a blind pixel, if so, performing the step 8, and otherwise, replacing the blind pixel with the point (i +1, j-1);
(8) the blind pixel is replaced by a point (i +1, j + 1).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911152301.5A CN110823385A (en) | 2019-11-22 | 2019-11-22 | Efficient algorithm for replacing blind pixels of infrared focal plane |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911152301.5A CN110823385A (en) | 2019-11-22 | 2019-11-22 | Efficient algorithm for replacing blind pixels of infrared focal plane |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110823385A true CN110823385A (en) | 2020-02-21 |
Family
ID=69557999
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911152301.5A Pending CN110823385A (en) | 2019-11-22 | 2019-11-22 | Efficient algorithm for replacing blind pixels of infrared focal plane |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110823385A (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103017911A (en) * | 2012-12-17 | 2013-04-03 | 无锡艾立德智能科技有限公司 | Infrared blind pixel compensation circuit and operating method thereof |
| US8699089B2 (en) * | 2012-07-19 | 2014-04-15 | Xerox Corporation | Variable data image watermarking using infrared sequence structures in black separation |
| CN103994828A (en) * | 2014-05-22 | 2014-08-20 | 湖南华南光电(集团)有限责任公司 | Blade scanning detection method for accumulated flaws in surface detector of thermal infrared imager |
| CN104330167A (en) * | 2014-11-24 | 2015-02-04 | 浙江大立科技股份有限公司 | Infrared focal plane array dynamic blind element processing method and device |
| CN104835125A (en) * | 2015-05-08 | 2015-08-12 | 上海联影医疗科技有限公司 | Defect pixel correction method for flat-panel detector |
| CN104935838A (en) * | 2015-06-04 | 2015-09-23 | 上海集成电路研发中心有限公司 | Image restoration method |
| CN106768383A (en) * | 2017-01-21 | 2017-05-31 | 浙江红相科技股份有限公司 | A kind of automatic blind element detection of infrared focal plane array and compensation method |
| US20170243326A1 (en) * | 2016-02-19 | 2017-08-24 | Seek Thermal, Inc. | Pixel decimation for an imaging system |
| CN107305695A (en) * | 2016-04-14 | 2017-10-31 | 上海富瀚微电子股份有限公司 | A kind of automatic bad point means for correcting of image and method |
| CN207283689U (en) * | 2017-09-30 | 2018-04-27 | 杭州雄迈集成电路技术有限公司 | A kind of dead pixels of image sensor surveys means for correcting |
| CN109360165A (en) * | 2018-09-28 | 2019-02-19 | 浙江兆晟科技股份有限公司 | A kind of blind element image repair method and system based on scene |
| CN109738072A (en) * | 2019-01-07 | 2019-05-10 | 山东大学 | A kind of cross blind element detection of InGaAs short-wave infrared imager and means for correcting and method |
-
2019
- 2019-11-22 CN CN201911152301.5A patent/CN110823385A/en active Pending
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8699089B2 (en) * | 2012-07-19 | 2014-04-15 | Xerox Corporation | Variable data image watermarking using infrared sequence structures in black separation |
| CN103017911A (en) * | 2012-12-17 | 2013-04-03 | 无锡艾立德智能科技有限公司 | Infrared blind pixel compensation circuit and operating method thereof |
| CN103994828A (en) * | 2014-05-22 | 2014-08-20 | 湖南华南光电(集团)有限责任公司 | Blade scanning detection method for accumulated flaws in surface detector of thermal infrared imager |
| CN104330167A (en) * | 2014-11-24 | 2015-02-04 | 浙江大立科技股份有限公司 | Infrared focal plane array dynamic blind element processing method and device |
| CN104835125A (en) * | 2015-05-08 | 2015-08-12 | 上海联影医疗科技有限公司 | Defect pixel correction method for flat-panel detector |
| CN104935838A (en) * | 2015-06-04 | 2015-09-23 | 上海集成电路研发中心有限公司 | Image restoration method |
| US20170243326A1 (en) * | 2016-02-19 | 2017-08-24 | Seek Thermal, Inc. | Pixel decimation for an imaging system |
| CN107305695A (en) * | 2016-04-14 | 2017-10-31 | 上海富瀚微电子股份有限公司 | A kind of automatic bad point means for correcting of image and method |
| CN106768383A (en) * | 2017-01-21 | 2017-05-31 | 浙江红相科技股份有限公司 | A kind of automatic blind element detection of infrared focal plane array and compensation method |
| CN207283689U (en) * | 2017-09-30 | 2018-04-27 | 杭州雄迈集成电路技术有限公司 | A kind of dead pixels of image sensor surveys means for correcting |
| CN109360165A (en) * | 2018-09-28 | 2019-02-19 | 浙江兆晟科技股份有限公司 | A kind of blind element image repair method and system based on scene |
| CN109738072A (en) * | 2019-01-07 | 2019-05-10 | 山东大学 | A kind of cross blind element detection of InGaAs short-wave infrared imager and means for correcting and method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7283165B2 (en) | Method and apparatus for image processing using weighted defective pixel replacement | |
| CN110148093B (en) | Image defogging improvement method based on dark channel prior | |
| CN110544261B (en) | Method for detecting coal injection state of blast furnace tuyere based on image processing | |
| US8885077B2 (en) | Dynamic, local edge preserving defect pixel correction for image sensors | |
| CN104794727B (en) | One is calculated as PSF quick calibrating method based on symmetric simple lens | |
| CN109886975A (en) | It is a kind of that raindrop method and system is gone based on the image optimization processing for generating confrontation network | |
| CN104835125A (en) | Defect pixel correction method for flat-panel detector | |
| CN104376534B (en) | Low-power-consumption real-time noise-reduction and sharpening merged preprocessing method for CMOS image sensor | |
| CN113610050A (en) | Mask wearing real-time detection method based on YOLOv5 | |
| CN110823385A (en) | Efficient algorithm for replacing blind pixels of infrared focal plane | |
| EP1679654B1 (en) | Improvements in digital filtering | |
| JP2012253726A (en) | Image processor | |
| CN112435178B (en) | FPGA-based linear array infrared blind pixel engineering processing method and system | |
| JP2002368988A (en) | Method for re-touching re-digitized binary picture data rasterized in pixel | |
| CN111583272B (en) | Improved Niblack infrared image segmentation method combining maximum entropy | |
| CN117058137A (en) | Visual inspection method for production quality of laminated glass | |
| CN105139354A (en) | Blind element compensation method for infrared or terahertz image | |
| CN105704406A (en) | Method for removing defective pixels in image processing | |
| CN116684573A (en) | Abnormal pixel detection and real-time replacement method for large-area-array CMOS detector | |
| CN116774428A (en) | Structured light coding method based on asymmetric error diffusion kernel function | |
| Yongji et al. | A design of dynamic defective pixel correction for image sensor | |
| CN102885631A (en) | Distortion correction method applied to flat-panel charge coupling device (CCD) detector | |
| CN107886480A (en) | Image defogging method based on V system | |
| CN105139365A (en) | Method for processing Tera-Hertz or infrared image | |
| Pathak et al. | Evaluation of effect of pre-processing techniques in solar panel fault detection |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200221 |