Method, device and computer-readable storage medium for processing bright and dark lines
By obtaining the correction data of the matrix template arrangement of non-rectangular modules, determining the edge pixel points and adjusting the brightness compensation of the spliced pixel points, the problem of low adjustment efficiency of light and dark lines at the splicing of irregular shape modules is solved, and efficient Brightness compensation and splicing consistency.
Patent Information
- Application Number
- CN202210622282.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-06-02
- Publication Date
- 2024-12-03
- Estimated Expiration
- 2042-06-02
AI Technical Summary
In LED display screens, due to the misalignment of mechanical cutting accuracy and module structure fitting position, the light and dark lines adjustment efficiency at the splicing of irregular shape modules is low, and the prior art has failed to effectively solve this problem.
By obtaining the correction data of the non-rectangular module arranged by the correction data matrix template, determining the edge pixel points of the module and judging the spliced pixel points based on the predetermined sequential change rules, adjusting the correction data of the spliced pixel points for brightness compensation processing, realizing non-rules Quick adjustment of light and dark lines at the shape module splicing.
It realizes rapid adjustment of the light and dark lines at the splicing of irregular shape modules, improves the efficiency of adjusting light and dark lines, ensures the consistency of brightness at the splicing, and reduces splicing traces.
Smart Images

Figure CN114974092B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of display, and in particular to a method and device for processing spliced bright and dark lines, and a computer-readable storage medium. Background Art
[0002] The light-emitting diode (LED) display screen is made up of multiple LED cabinets, and each LED cabinet is made up of multiple LED modules. Before the LED display screen leaves the factory, each cabinet or module will be corrected point by point for brightness compensation to ensure good consistency of display brightness and color. However, during the splicing process, due to problems such as mechanical cutting accuracy, misalignment of the module and cabinet structure, and artificial splicing accuracy, there will be larger or smaller splicing seams between two adjacent modules, making the pixel spacing between the adjacent edges of the two adjacent modules greater or smaller than the normal pixel spacing of the LED display screen. When displaying the picture, a bright or dark line will be displayed at the splicing seam, which is called splicing bright and dark line.
[0003] For LED display screens made of regular-shaped modules, the joints between two modules can be found quickly and easily, and then the brightness of the pixels at the joints can be adjusted to adjust the bright and dark lines of the joints. However, for LED display screens made of irregular-shaped modules, the pixels at the joints are not easy to find, resulting in low efficiency in adjusting the bright and dark lines at the joints.
[0004] To address the above-mentioned problems, no effective solution has been proposed yet. Summary of the invention
[0005] The embodiments of the present invention provide a method and device for processing bright and dark lines in splicing, and a computer-readable storage medium, so as to at least solve the technical problem in the related art that the efficiency of adjusting bright and dark lines at splicing points of modules with irregular shapes is too low.
[0006] According to one aspect of an embodiment of the present invention, a method for processing spliced bright and dark lines is provided, comprising: obtaining a first correction data file and a second correction data file, wherein in the first correction data file, first correction data of a first non-rectangular module is arranged in a first correction data matrix template, the first correction data includes first valid correction data and first complementary point correction data, and the first valid correction data of the first non-rectangular module is arranged in a first non-rectangular array in the first correction data matrix template, and in the second correction data file, second correction data of a second non-rectangular module is arranged in a second correction data matrix template, the second correction data includes second valid correction data and second complementary point correction data, and the second valid correction data of the second non-rectangular module is arranged in a first non-rectangular array. The second correction data matrix template is arranged in a second non-rectangular array, and the first non-rectangular module and the second non-rectangular module are adjacent modules; the first edge pixel point of the first non-rectangular module is determined based on the first correction data file, and the second edge pixel point of the second non-rectangular module is determined based on the second correction data file; the first splicing pixel point of the first non-rectangular module is determined based on the first edge pixel point of the first non-rectangular module, and the second splicing pixel point of the second non-rectangular module is determined based on the second edge pixel point of the second non-rectangular module; by adjusting the correction data of the first splicing pixel point and the correction data of the second splicing pixel point, brightness compensation processing is performed on the bright and dark lines at the splicing point of the first non-rectangular module and the second non-rectangular module.
[0007] Optionally, determining the first edge pixel point of the first non-rectangular module based on the first correction data file includes: determining the first row where the first valid correction data of the first non-rectangular module appears in the first correction data matrix template, scanning the number of columns where the first valid correction data and the last valid correction data appear in the first row, marking the positions of the pixel points of the first valid correction data and the last valid correction data appearing in the first row obtained by scanning, continuing to scan the number of columns where the first valid correction data and the last valid correction data appear in each row row by row, marking the positions of the pixel points of the first valid correction data and the last valid correction data appearing in each row obtained by scanning, and determining the pixel point set at the marked position as the first edge pixel point. Point; based on the second correction data file, determine the second edge pixel point of the second non-rectangular module, including: determining the first row where the second valid correction data of the second non-rectangular module appears in the second correction data matrix template, scanning the column number where the first valid correction data and the last valid correction data appear in the first row, marking the positions of the pixel points of the first valid correction data and the last valid correction data appearing in the first row obtained by scanning, continuing to scan the column number where the first valid correction data and the last valid correction data appear in each row row by row, and marking the positions of the pixel points of the first valid correction data and the last valid correction data appearing in each row obtained by scanning, and determining the pixel point set of the marked position as the second edge pixel point.
[0008] Optionally, determining the first edge pixel point of the first non-rectangular module based on the first correction data file includes: determining the first column where the first valid correction data of the first non-rectangular module appears in the first correction data matrix template, scanning the number of rows where the first valid correction data and the last valid correction data appear in the first column, marking the positions of the pixel points of the first valid correction data and the last valid correction data appearing in the first column obtained by scanning, continuing to scan the number of rows where the first valid correction data and the last valid correction data appear in each column column by column, marking the positions of the pixel points of the first valid correction data and the last valid correction data appearing in each column obtained by scanning, and determining the pixel point set at the marked position as the first edge pixel point. Point; based on the second correction data file, determine the second edge pixel point of the second non-rectangular module, including: determining the first column where the second valid correction data of the second non-rectangular module appears in the second correction data matrix template, scanning the number of rows where the first valid correction data and the last valid correction data appear in the first column, marking the positions of the pixel points of the first valid correction data and the last valid correction data appearing in the first column obtained by scanning, continuing to scan the number of rows where the first valid correction data and the last valid correction data appear in each column column by column, and marking the positions of the pixel points of the first valid correction data and the last valid correction data appearing in each column obtained by scanning, and determining the pixel point set of the marked position as the second edge pixel point.
[0009] Optionally, based on the first edge pixel point of the first non-rectangular module, determining the first splicing pixel point of the first non-rectangular module includes: in the case where multiple splicing edges are included in the row-by-row direction, judging row by row whether the number of columns of pixel points in the first edge pixel points satisfies a first predetermined sequential change rule, until the number of columns of pixel points does not satisfy the first predetermined sequential change rule, determining the set of pixel points that satisfy the first predetermined sequential change rule as the splicing pixel points corresponding to the first splicing edge, continuing to judge row by row whether the number of columns of pixel points in the first edge pixel points satisfies a second predetermined sequential change rule, until the number of columns of pixel points does not satisfy the second predetermined sequential change rule, determining the set of pixel points that satisfy the second predetermined sequential change rule as the splicing pixel points corresponding to the second splicing edge, until all row numbers are judged, and the splicing pixel points corresponding to all splicing edges in the row-by-row direction are obtained. Point; based on the second edge pixel point of the second non-rectangular module, determine the second splicing pixel point of the second non-rectangular module, including: in the case of including multiple splicing edges in the row-by-row direction, determine row by row whether the number of columns of pixel points in the second edge pixel points satisfies a third predetermined sequential changing rule, until the number of columns of pixel points does not satisfy the third predetermined sequential changing rule, determine the set of pixel points that satisfy the third predetermined sequential changing rule as the splicing pixel points corresponding to the first splicing edge, continue to determine row by row whether the number of columns of pixel points in the second edge pixel points satisfies a fourth predetermined sequential changing rule, until the number of columns of pixel points does not satisfy the fourth predetermined sequential changing rule, determine the set of pixel points that satisfy the fourth predetermined sequential changing rule as the splicing pixel points corresponding to the second splicing edge, until all row numbers are judged, and the splicing pixel points corresponding to all splicing edges in the row-by-row direction are obtained.
[0010] Optionally, based on the first edge pixel point of the first non-rectangular module, determining the first splicing pixel point of the first non-rectangular module includes: in the case where multiple splicing edges are included in the column-by-column direction, judging column by column whether the number of rows of pixel points in the first edge pixel points satisfies a fifth predetermined sequential changing rule, until the number of rows of pixel points does not satisfy the fifth predetermined sequential changing rule, determining the set of pixel points that satisfy the fifth predetermined sequential changing rule as the splicing pixel points corresponding to the first splicing edge, continuing to judge column by column whether the number of rows of pixel points in the first edge pixel points satisfies a sixth predetermined sequential changing rule, until the number of rows of pixel points does not satisfy the sixth predetermined sequential changing rule, determining the set of pixel points that satisfy the sixth predetermined sequential changing rule as the splicing pixel points corresponding to the second splicing edge, until all column numbers are judged, and the splicing pixel points corresponding to all splicing edges in the column-by-column direction are obtained. Point; based on the second edge pixel point of the second non-rectangular module, determine the second stitching pixel point of the second non-rectangular module, including: in the case of including multiple stitching edges in the column-by-column direction, determine column by column whether the number of rows of pixel points in the second edge pixel points satisfies the seventh predetermined sequential changing rule, until the number of rows of pixel points does not satisfy the seventh predetermined sequential changing rule, determine the set of pixel points that satisfy the seventh predetermined sequential changing rule as the stitching pixel points corresponding to the first stitching edge, continue to determine column by column whether the number of rows of pixel points in the first edge pixel points satisfies the eighth predetermined sequential changing rule, until the number of rows of pixel points does not satisfy the eighth predetermined sequential changing rule, determine the set of pixel points that satisfy the eighth predetermined sequential changing rule as the stitching pixel points corresponding to the second stitching edge, until all column numbers are judged, and the stitching pixel points corresponding to all stitching edges in the column-by-column direction are obtained.
[0011] Optionally, brightness compensation is performed on the bright and dark lines at the joint of the first non-rectangular module and the second non-rectangular module by adjusting the correction data of the first splicing pixel point and the correction data of the second splicing pixel point, including: brightness compensation is performed on the bright and dark lines at the joint of the first non-rectangular module and the second non-rectangular module by proportionally adjusting the brightness compensation value in the correction data of the first splicing pixel point and the brightness compensation value in the correction data of the second splicing pixel point until the bright and dark lines at the joint of the first non-rectangular module and the second non-rectangular module reach a predetermined bright and dark line standard.
[0012] Optionally, the first non-rectangular module and the second non-rectangular module are modules in a target spherical screen.
[0013] According to another aspect of an embodiment of the present invention, a splicing bright and dark line processing device is also provided, including: an acquisition module, used to acquire a first correction data file and a second correction data file, wherein in the first correction data file, first correction data of a first non-rectangular module is arranged in a first correction data matrix template, the first correction data includes first valid correction data and first complementary point correction data, and the first valid correction data of the first non-rectangular module is arranged in a first non-rectangular array in the first correction data matrix template; in the second correction data file, second correction data of a second non-rectangular module is arranged in a second correction data matrix template, the second correction data includes second valid correction data and second complementary point correction data, and the second valid correction data of the second non-rectangular module is arranged in the second correction data matrix template. The board is arranged in a second non-rectangular array, and the first non-rectangular module and the second non-rectangular module are adjacent modules; a first determination module is used to determine the first edge pixel point of the first non-rectangular module based on the first correction data file, and to determine the second edge pixel point of the second non-rectangular module based on the second correction data file; a second determination module is used to determine the first splicing pixel point of the first non-rectangular module based on the first edge pixel point of the first non-rectangular module, and to determine the second splicing pixel point of the second non-rectangular module based on the second edge pixel point of the second non-rectangular module; an adjustment module is used to perform brightness compensation processing on the bright and dark lines at the splicing point of the first non-rectangular module and the second non-rectangular module by adjusting the correction data of the first splicing pixel point and the correction data of the second splicing pixel point.
[0014] According to another aspect of an embodiment of the present invention, a computer-readable storage medium is provided, the computer-readable storage medium including a stored program, wherein when the program is run, the device where the computer-readable storage medium is located is controlled to execute any one of the above-mentioned methods for splicing bright and dark lines.
[0015] According to another aspect of an embodiment of the present invention, a computer device is provided, including: a memory and a processor, the memory storing a computer program; the processor, configured to execute the computer program stored in the memory, wherein when the computer program is executed, the processor executes any one of the above-mentioned methods for processing bright and dark lines.
[0016] In an embodiment of the present invention, a correction data matrix template is used to arrange the correction data of the non-rectangular module, the edge pixel position of the non-rectangular module is read based on the correction data matrix template, and each splicing pixel is determined based on the edge pixel, and brightness compensation processing is performed on the bright and dark lines at the module splicing based on the correction data of the splicing pixel. The edge pixel points of the non-rectangular module are determined by a correction data file (for example, effective correction data in the correction data matrix template), and the purpose of quickly determining the edge pixel points of the non-rectangular module is achieved, thereby achieving the technical effect of quickly adjusting the bright and dark lines at the splicing of modules with irregular shapes, thereby solving the technical problem of low efficiency in adjusting the bright and dark lines at the splicing of modules with irregular shapes in the related art. BRIEF DESCRIPTION OF THE DRAWINGS
[0017] The drawings described herein are used to provide a further understanding of the present invention and constitute a part of this application. The exemplary embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation of the present invention. In the drawings:
[0018] Figure 1 is a flow chart of a method for splicing bright and dark lines according to an embodiment of the present invention;
[0019] Figure 2 is a schematic diagram of stitching pixels corresponding to a stitching line according to an embodiment of the present invention;
[0020] Figure 3 4 is a schematic diagram of the structure of the device for processing light and dark lines splicing according to this embodiment. DETAILED DESCRIPTION
[0021] In order to enable those skilled in the art to better understand the scheme of the present invention, the technical scheme in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present invention.
[0022] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.
[0023] According to an embodiment of the present invention, a method embodiment for splicing bright and dark lines is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.
[0024] Figure 1 is a flow chart of a method for splicing bright and dark lines according to an embodiment of the present invention. Figure 1 As shown, the method comprises the following steps:
[0025] Step S102, obtaining a first correction data file and a second correction data file, wherein in the first correction data file, first correction data of a first non-rectangular module are arranged in a first correction data matrix template, the first correction data include first valid correction data and first complementary point correction data, the first valid correction data of the first non-rectangular module are arranged in a first non-rectangular array in the first correction data matrix template, and in the second correction data file, second correction data of a second non-rectangular module are arranged in a second correction data matrix template, the second correction data include second valid correction data and second complementary point correction data, the second valid correction data of the second non-rectangular module are arranged in a second non-rectangular array in the second correction data matrix template, and the first non-rectangular module and the second non-rectangular module are adjacent modules;
[0026] Step S104, determining a first edge pixel point of a first non-rectangular module based on the first correction data file, and determining a second edge pixel point of a second non-rectangular module based on the second correction data file;
[0027] Step S106, determining a first splicing pixel point of the first non-rectangular module based on the first edge pixel point of the first non-rectangular module, and determining a second splicing pixel point of the second non-rectangular module based on the second edge pixel point of the second non-rectangular module;
[0028] Step S108 , performing brightness compensation processing on the bright and dark lines at the joint of the first non-rectangular module and the second non-rectangular module by adjusting the correction data of the first joint pixel point and the correction data of the second joint pixel point.
[0029] In an embodiment of the present invention, a correction data matrix template is used to arrange the correction data of the non-rectangular module, and the edge pixels of the non-rectangular module are read based on the correction data matrix template, and each splicing pixel is determined based on the edge pixel points, and brightness compensation processing is performed on the bright and dark lines at the module splicing based on the correction data of the splicing pixel points. The edge pixels of the non-rectangular module are determined by the effective correction data in the correction data matrix template, and the purpose of quickly determining the edge pixels of the non-rectangular module is achieved, thereby achieving the technical effect of quickly adjusting the bright and dark lines at the splicing of modules with irregular shapes, thereby solving the technical problem of low efficiency in adjusting the bright and dark lines at the splicing of modules with irregular shapes in the related art.
[0030] As an optional embodiment, the first non-rectangular module and the second non-rectangular module may be modules in a target spherical screen.
[0031] As an optional embodiment, when determining the first edge pixel point of the first non-rectangular module based on the first correction data file and determining the second edge pixel point of the second non-rectangular module based on the second correction data file, multiple processing methods may be used, which are described below.
[0032] For example, the determination can be made in a row-by-row scanning manner: determining the first edge pixel point of the first non-rectangular module based on the first correction data file, including: determining the first row where the first valid correction data of the first non-rectangular module appears in the first correction data matrix template, scanning the number of columns where the first valid correction data and the last valid correction data appear in the first row, marking the positions of the pixel points of the first valid correction data and the last valid correction data appearing in the first row obtained by scanning, continuing to scan the number of columns where the first valid correction data and the last valid correction data appear in each row row by row, marking the positions of the pixel points of the first valid correction data and the last valid correction data appearing in each row obtained by scanning, and determining a pixel point set at the marked position The invention discloses a method for determining a first edge pixel point of a second non-rectangular module; based on a second correction data file, determining a second edge pixel point of a second non-rectangular module, comprising: determining the first row where the second valid correction data of the second non-rectangular module appears in the second correction data matrix template, scanning the number of columns where the first valid correction data and the last valid correction data appear in the first row, marking the positions of the pixels of the first valid correction data and the last valid correction data appearing in the first row obtained by scanning, continuing to scan the number of columns where the first valid correction data and the last valid correction data appear in each row row by row, marking the positions of the pixels of the first valid correction data and the last valid correction data appearing in each row obtained by scanning, and determining the pixel point set of the marked position as the second edge pixel point.
[0033] For another example, the method may be determined by scanning column by column: determining the first edge pixel point of the first non-rectangular module based on the first correction data file includes: determining the first column where the first valid correction data of the first non-rectangular module appears in the first correction data matrix template, scanning the number of rows where the first valid correction data and the last valid correction data appear in the first column, marking the positions of the pixel points of the first valid correction data and the last valid correction data appearing in the first column obtained by scanning, continuing to scan the number of rows where the first valid correction data and the last valid correction data appear in each column obtained by scanning, marking the positions of the pixel points of the first valid correction data and the last valid correction data appearing in each column obtained by scanning, and determining a pixel point set at the marked position The invention discloses a method for determining a first edge pixel point of a second non-rectangular module; based on a second correction data file, determining a second edge pixel point of a second non-rectangular module, comprising: determining the first column where the second valid correction data of the second non-rectangular module appears in the second correction data matrix template, scanning the number of rows where the first valid correction data and the last valid correction data appear in the first column, marking the positions of the pixels of the first valid correction data and the last valid correction data appearing in the first column obtained by scanning, continuing to scan the number of rows where the first valid correction data and the last valid correction data appear in each column column by column, marking the positions of the pixels of the first valid correction data and the last valid correction data appearing in each column obtained by scanning, and determining the pixel point set of the marked position as the second edge pixel point.
[0034] As an optional embodiment, multiple methods can be used to determine the first stitching pixel point of the first non-rectangular module based on the first edge pixel point of the first non-rectangular module, and to determine the second stitching pixel point of the second non-rectangular module based on the second edge pixel point of the second non-rectangular module.
[0035] For example, the determination can be made in a row-by-row scanning manner: based on the first edge pixel point of the first non-rectangular module, the first splicing pixel point of the first non-rectangular module is determined, including: in the case where multiple splicing edges are included in the row-by-row direction, whether the number of columns of pixel points in the first edge pixel points satisfies a first predetermined sequential change rule row by row, until the number of columns of pixel points does not satisfy the first predetermined sequential change rule, determining that the set of pixel points that satisfy the first predetermined sequential change rule is the splicing pixel points corresponding to the first splicing edge, and continuing to determine whether the number of columns of pixel points in the first edge pixel points satisfies a second predetermined sequential change rule row by row, until the number of columns of pixel points does not satisfy the second predetermined sequential change rule, determining that the set of pixel points that satisfy the second predetermined sequential change rule is the splicing pixel points corresponding to the second splicing edge, until all row numbers are judged, and the splicing pixels of all splicing edges in the row-by-row direction are obtained. Corresponding stitching pixel points; based on the second edge pixel points of the second non-rectangular module, determining the second stitching pixel points of the second non-rectangular module, including: in the case of including multiple stitching edges in the row-by-row direction, judging row by row whether the number of columns of pixel points in the second edge pixel points satisfies a third predetermined sequential changing rule, until the number of columns of pixel points does not satisfy the third predetermined sequential changing rule, determining that the set of pixel points that satisfy the third predetermined sequential changing rule is the stitching pixel points corresponding to the first stitching edge, continuing to judge row by row whether the number of columns of pixel points in the second edge pixel points satisfies a fourth predetermined sequential changing rule, until the number of columns of pixel points does not satisfy the fourth predetermined sequential changing rule, determining that the set of pixel points that satisfy the fourth predetermined sequential changing rule is the stitching pixel points corresponding to the second stitching edge, until all row numbers are judged, and the stitching pixel points corresponding to all stitching edges in the row-by-row direction are obtained.
[0036] Figure 2 is a schematic diagram of stitching pixels corresponding to stitching edges according to an embodiment of the present invention, such as Figure 2 As shown, the method of determining the splicing pixel points in the row-by-row direction is described. It should be noted that, in this Figure 2 In the example, there are two splicing edges in the row-by-row direction, and other situations with two or more splicing edges also belong to the present application. Specifically, the edge pixels of the non-rectangular module are judged row by row, specifically judging whether the pixels satisfy the first predetermined sequential change rule, wherein the first predetermined sequential change rule is that the number of pixel columns increases sequentially, that is, Figure 2 The 4 pixels on the upper right side (i.e., the pixels marked with vertical lines in the figure, which no longer meet the first predetermined sequential change rule that the number of columns increases row by row until the 4th pixel) are the splicing pixels corresponding to the first splicing side of the non-rectangular module. Continue to make a second judgment row by row to specifically judge whether the pixels meet the second predetermined sequential change rule, wherein, taking the second predetermined change rule that the number of pixel columns decreases sequentially as an example, that is, Figure 2The four pixel points at the lower right side (i.e., the pixel points marked with horizontal lines in the figure, and up to the fourth pixel point, no longer conform to the second predetermined sequential change rule that the number of columns decreases row by row as the number of columns increases and decreases row by row) are the splicing pixel points corresponding to the second splicing edge of the non-rectangular module.
[0037] As an optional embodiment, the first predetermined sequential changing rule, the second predetermined sequential changing rule, the third predetermined sequential changing rule, and the fourth predetermined sequential changing rule may be the same sequential changing rule or different sequential changing rules. It is specifically related to the shapes of the first non-rectangular module and the second non-rectangular module. The first predetermined sequential changing rule, the second predetermined sequential changing rule, the third predetermined sequential changing rule, and the fourth predetermined sequential changing rule may be one of the following three rules: the number of columns of pixel points in the row-by-row direction increases with equal spacing, the number of columns of pixel points in the row-by-row direction decreases with equal spacing, and the number of columns of pixel points in the row-by-row direction remains unchanged. Among them, the above-mentioned equal spacing may be a row spacing, or multiple row spacings within the allowable error range, etc.
[0038] For another example, the method may be to determine by scanning column by column: based on the first edge pixel of the first non-rectangular module, determine the first splicing pixel of the first non-rectangular module, including: in the case where multiple splicing edges are included in the column-by-column direction, determine column by column whether the number of rows of pixel points in the first edge pixel points satisfies the fifth predetermined sequential changing rule, until the number of rows of pixel points does not satisfy the fifth predetermined sequential changing rule, determine the set of pixel points that satisfy the fifth predetermined sequential changing rule as the splicing pixel points corresponding to the first splicing edge, continue to determine column by column whether the number of rows of pixel points in the first edge pixel points satisfies the sixth predetermined sequential changing rule, until the number of rows of pixel points does not satisfy the sixth predetermined sequential changing rule, determine the set of pixel points that satisfy the sixth predetermined sequential changing rule as the splicing pixel points corresponding to the second splicing edge, until all column numbers are judged, and the splicing pixel points of all splicing edges in the column-by-column direction are obtained. The method comprises the following steps: determining the second stitching pixel points corresponding to the first stitching edge; determining the second stitching pixel points of the second non-rectangular module based on the second edge pixel points of the second non-rectangular module, comprising: in the case where a plurality of stitching edges are included in the column-by-column direction, judging column by column whether the number of rows of pixel points in the second edge pixel points satisfies the seventh predetermined sequential changing rule, until the number of rows of pixel points does not satisfy the seventh predetermined sequential changing rule, determining the set of pixel points that satisfy the seventh predetermined sequential changing rule as the stitching pixel points corresponding to the first stitching edge, continuing to judge column by column whether the number of rows of pixel points in the first edge pixel points satisfies the eighth predetermined sequential changing rule, until the number of rows of pixel points does not satisfy the eighth predetermined sequential changing rule, determining the set of pixel points that satisfy the eighth predetermined sequential changing rule as the stitching pixel points corresponding to the second stitching edge, until all column numbers are judged, and the stitching pixel points corresponding to all stitching edges in the column-by-column direction are obtained.
[0039] As an optional embodiment, the fifth predetermined sequential changing rule, the sixth predetermined sequential changing rule, the seventh predetermined sequential changing rule, and the eighth predetermined sequential changing rule may be the same sequential changing rule or different sequential changing rules. It is specifically related to the shapes of the first non-rectangular module and the second non-rectangular module. The fifth predetermined sequential changing rule, the sixth predetermined sequential changing rule, the seventh predetermined sequential changing rule, and the eighth predetermined sequential changing rule may be one of the following three rules: the number of rows of pixel points in the column-by-column direction increases in equal intervals, the number of rows of pixel points in the column-by-column direction decreases in equal intervals, and the number of rows of pixel points in the column-by-column direction remains unchanged. Among them, the above-mentioned equal spacing may be a column spacing, or a multi-column spacing within the allowable error range, etc.
[0040] As an optional embodiment, by adjusting the correction data of the first splicing pixel point and the correction data of the second splicing pixel point, brightness compensation processing is performed on the bright and dark lines at the splicing of the first non-rectangular module and the second non-rectangular module, including: by proportionally adjusting the brightness compensation value in the correction data of the first splicing pixel point and the brightness compensation value in the correction data of the second splicing pixel point, brightness compensation processing is performed on the bright and dark lines at the splicing of the first non-rectangular module and the second non-rectangular module, until the bright and dark lines at the splicing of the first non-rectangular module and the second non-rectangular module reach a predetermined bright and dark line standard. By proportionally adjusting the brightness compensation value in the correction data of the first splicing pixel point and the second splicing pixel point, it is possible to ensure that there is no obvious brightness difference between the first splicing pixel point and the second splicing pixel point during the brightness compensation processing, thereby ensuring that after the correction is completed, the splicing between the first non-rectangular module and the second non-rectangular module will not have prominent splicing marks, so as to provide a better display effect.
[0041] It should be noted that when brightness compensation is performed on the bright and dark lines at the joint of the first non-rectangular module and the second non-rectangular module, if the pixel points of the first joint edge in the row direction of the first non-rectangular module and the first joint edge in the row direction of the second non-rectangular module correspond one to one (for example, using the above Figure 2The method of determining the pixel points corresponding to the splicing edge is to determine the splicing pixel points on the first splicing edge in the first non-rectangular module and the splicing pixel points on the first splicing edge in the second non-rectangular module respectively, and the splicing pixel points on the first splicing edge in the row direction of the first non-rectangular module and the splicing pixel points on the first splicing edge in the row direction of the second non-rectangular module can be subjected to corresponding brightness compensation processing, thereby specifically adjusting the brightness of the pixels at the splicing point between the two non-rectangular modules. When the second splicing edge in the row direction of the first non-rectangular module corresponds to the splicing edge of other non-rectangular modules (non-rectangular modules other than the first non-rectangular module and the second non-rectangular module), the splicing pixel points on the second splicing edge in the row direction of the first non-rectangular module and the splicing pixel points on the splicing edge of the other non-rectangular modules can be subjected to corresponding brightness compensation processing, thereby completing the brightness compensation processing of the splicing line of the display screen composed of the entire non-rectangular module.
[0042] Based on the above embodiments and optional embodiments, an optional implementation manner is provided.
[0043] In the related art, the method to solve the problem of bright and dark lines in the splicing of LED flat screens is mainly to manually adjust the position of the modules so that the spacing between adjacent pixels of each splicing seam is as consistent as possible with the normal pixel spacing. This method is inefficient and cannot completely solve the problem of bright and dark lines; then the problem of splicing bright and dark lines is solved by adjusting the brightness compensation data in the correction data of adjacent pixels of the two modules. The LED flat screen is composed of a number of planar rectangular LED modules with the same area size and pixel arrangement. The correction data file format of each LED box or LED module is consistent. Generally, the file name of the correction data represents the address of the LED box or LED module. The first column of numbers in the correction data file represents the row number of the box or module pixel point, the second column of numbers represents the column number of the box or module pixel point, and the subsequent column numbers represent the brightness compensation data. The location of the brightness compensation data of the four splicing pixel points in two rows and two columns at the edge of all modules can be quickly determined according to the number of rows and columns of the pixel points of the LED module. When it is necessary to adjust the bright and dark lines between modules, the brightness compensation data of the corresponding edge pixels in the correction data file of the two adjacent module rows or columns of the splicing seam can be adjusted proportionally to change the brightness of the adjacent pixels of the splicing seam. After achieving a satisfactory effect, the modified correction data file is saved to the LED module memory of the corresponding address.
[0044] However, the above method can only solve the problem of bright and dark lines in the splicing of LED flat screens. The LED spherical screen is spliced by flat LED modules that have been mechanically bent, and according to different design methods, the structural types of the modules are various, ranging from triangular structures to polygonal structures, and the number of splicing seams of each type of module may vary. The arrangement of pixels on the surface of the module is also different, that is, the arrangement format of the correction data is different, and according to the different correction data writing methods, the correction data of the LED spherical screen module may have effective correction data and supplementary correction data. The effective correction data is data that can correspond to the pixel points one by one, and the supplementary correction data does not have a channel corresponding to the pixel points, and does not affect the correction display effect of the module. Therefore, it is impossible to quickly determine the position of the adjacent edge pixels of the two modules at each splicing seam through the module pixel arrangement method. It should be noted that the above-mentioned predetermined bright and dark line standard can refer to a standard in which the bright and dark lines cannot be seen, and can be flexibly set according to different needs.
[0045] An optional implementation manner of the present invention proposes a method for processing bright and dark lines of a LED spherical screen splicing, and the method is as follows.
[0046] (1) Obtain an unfolded plan view of the module splicing structure of the LED spherical screen, present the plan view on a computer, determine the address of each module and the location of each type of module in the plan view, so that the corresponding calibration data file can be obtained after clicking a module. Select one module from each type of module and open the calibration data files of these modules.
[0047] (2) Obtaining a pixel arrangement diagram of the correction data of each type of module, and determining the positions of all edge pixels of the module in the arrangement diagram according to the correction data file of the module.
[0048] The computer determination method is as follows: when the number in the first column of the correction data file remains unchanged at 1, that is, the position of the module pixel row number is determined to be the first row, scan row by row in turn to determine the first and last column numbers of the pixel row with valid correction data, that is, the number in the second column of the correction data file, mark the positions of these two pixels in the pixel arrangement diagram of the correction data, continue to perform the above steps, determine the first and last column numbers of each row of pixels with valid correction data, and mark the positions of these pixels; since the position of the first row of pixels may be the position of the module edge pixel, it is necessary to scan column by column in turn to determine the first and last row numbers of the pixel column with valid correction data, that is, the number in the first column of the correction data file, mark the positions of these two pixels in the correction data arrangement diagram, continue to perform the above steps, determine the first and last row numbers of each column of pixels with valid correction data, and mark the positions of these pixels.
[0049] (3) Determine the pixel position at each joint based on the position of all edge pixels of each type of module. The computer scans the positions of these pixels row by row, and respectively executes the judgment on the change in the digital size of the pixel column number when there is valid correction data for the first and last pixel in each row. If the digital size changes in a law that it becomes smaller or remains unchanged or increases in sequence, continue to execute the above steps until the digital size change of the pixel column number is judged not to conform to the change law, and the above pixel positions are made into a set. Then, continue to execute the above steps when there is a pixel row number that is judged not to conform to the change law, until all pixel rows are scanned. Similarly, execute the above steps when there is valid correction data for the first and last pixel in each column, and execute the above steps until all pixel columns are scanned, and finally obtain a set of pixel positions at each joint.
[0050] (4) The set of pixel positions at the selected joints is matched one by one with the module joint positions of the corresponding addresses in the expanded plan view of the module joint structure of the LED spherical screen. Similarly, the joint positions of all modules of the same type can correspond to the same pixel positions. After selecting the joint line between two modules in the expanded plan view of the module joint structure of the LED spherical screen, the set of adjacent pixel positions of the two modules can be directly selected. According to the bright lines or dark lines existing at the joint of the LED spherical screen, the brightness compensation data of these pixel positions in the correction data file are proportionally adjusted. The modified correction data file is written into the LED module memory, and the display effect is observed until a satisfactory effect is achieved.
[0051] Through the above optional implementation, it is possible to quickly determine the edge pixel points of two non-rectangular modules, and process the edge pixel points according to the predetermined sequential change rule of the pixel points to obtain spliced pixel points, and then perform brightness compensation on the spliced pixel points, thereby quickly realizing brightness compensation processing for the spliced bright and dark lines between non-rectangular modules.
[0052] According to another aspect of an embodiment of the present invention, a device for processing bright and dark lines is provided. Figure 3 is a schematic diagram of the structure of the bright and dark line splicing processing device according to this embodiment. Figure 3 As shown, the device includes: an acquisition module 31, a first determination module 32, a second determination module 33 and an adjustment module 34. The device is described below.
[0053] An acquisition module 31 is used to acquire a first correction data file and a second correction data file, wherein in the first correction data file, first correction data of a first non-rectangular module are arranged in a first correction data matrix template, the first correction data include first valid correction data and first complementary point correction data, the first valid correction data of the first non-rectangular module are arranged in a first non-rectangular array in the first correction data matrix template, and in the second correction data file, second correction data of a second non-rectangular module are arranged in a second correction data matrix template, the second correction data include second valid correction data and second complementary point correction data, the second valid correction data of the second non-rectangular module are arranged in a second non-rectangular array in the second correction data matrix template, and the first non-rectangular module and the second non-rectangular module are adjacent modules; the first correction data file is used to obtain a first correction data matrix template. A determination module 32 is connected to the acquisition module 31, and is used to determine the first edge pixel point of the first non-rectangular module based on the first correction data file, and to determine the second edge pixel point of the second non-rectangular module based on the second correction data file; a second determination module 33 is connected to the first determination module 32, and is used to determine the first splicing pixel point of the first non-rectangular module based on the first edge pixel point of the first non-rectangular module, and to determine the second splicing pixel point of the second non-rectangular module based on the second edge pixel point of the second non-rectangular module; an adjustment module 34 is connected to the second determination module 33, and is used to perform brightness compensation processing on the bright and dark lines at the splicing point of the first non-rectangular module and the second non-rectangular module by adjusting the correction data of the first splicing pixel point and the correction data of the second splicing pixel point.
[0054] According to an embodiment of the present invention, a computer-readable storage medium is further provided, the computer-readable storage medium including a stored program, wherein when the program is run, the device where the computer-readable storage medium is located is controlled to execute any one of the above-mentioned bright and dark line splicing processing methods.
[0055] According to another embodiment of the present invention, a computer device is provided, including: a memory and a processor, the memory storing a computer program; the processor, configured to execute the computer program stored in the memory, wherein when the computer program is executed, the processor executes any one of the above-mentioned methods for splicing bright and dark lines.
[0056] The serial numbers of the above embodiments of the present invention are only for description and do not represent the advantages or disadvantages of the embodiments.
[0057] In the above embodiments of the present invention, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.
[0058] In the several embodiments provided in this application, it should be understood that the disclosed technical content can be implemented in other ways. Among them, the device embodiments described above are only schematic. For example, the division of the units can be a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of units or modules, which can be electrical or other forms.
[0059] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple units. Some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.
[0060] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.
[0061] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for a computer device (which can be a personal computer, a server or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), mobile hard disk, magnetic disk or optical disk and other media that can store program codes.
[0062] The above is only a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principle of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.
Claims
1. A method for processing light and dark lines, characterized in that: include: Acquire a first correction data file and a second correction data file, wherein in the first correction data file, first correction data of a first non-rectangular module are arranged in a first correction data matrix template, the first correction data include first valid correction data and first complementary point correction data, the first valid correction data of the first non-rectangular module are arranged in a first non-rectangular array in the first correction data matrix template, and in the second correction data file, second correction data of a second non-rectangular module are arranged in a second correction data matrix template, the second correction data include second valid correction data and second complementary point correction data, the second valid correction data of the second non-rectangular module are arranged in a second non-rectangular array in the second correction data matrix template, and the first non-rectangular module and the second non-rectangular module are adjacent modules; Determine a first edge pixel point of the first non-rectangular module based on the first correction data file, and determine a second edge pixel point of the second non-rectangular module based on the second correction data file; Based on the first edge pixel points of the first non-rectangular module, determine the first splicing pixel points of the first non-rectangular module, and based on the second edge pixel points of the second non-rectangular module, determine the second splicing pixel points of the second non-rectangular module; By adjusting the correction data of the first splicing pixel point and the correction data of the second splicing pixel point, brightness compensation processing is performed on the bright and dark lines at the splicing point of the first non-rectangular module and the second non-rectangular module.
2. The method according to claim 1, characterized in that The determining the first edge pixel point of the first non-rectangular module based on the first correction data file includes: determining the first row in which the first valid correction data of the first non-rectangular module appears in the first correction data matrix template, scanning the number of columns in which the first valid correction data and the last valid correction data appear in the first row, marking the positions of the pixels of the first valid correction data and the last valid correction data appearing in the scanned first row, continuing to scan the number of columns in which the first valid correction data and the last valid correction data appear in each row row by row, marking the positions of the pixels of the first valid correction data and the last valid correction data appearing in each row obtained by scanning, and determining the pixel point set of the marked positions as the first edge pixel points; The method of determining the second edge pixel points of the second non-rectangular module based on the second correction data file includes: determining the first row in which the second valid correction data of the second non-rectangular module appears in the second correction data matrix template, scanning the number of columns in which the first valid correction data and the last valid correction data appear in the first row, marking the positions of the pixels of the first valid correction data and the last valid correction data appearing in the scanned first row, continuing to scan the number of columns in which the first valid correction data and the last valid correction data appear in each row row by row, marking the positions of the pixels of the first valid correction data and the last valid correction data appearing in each row, and determining the set of pixels at the marked positions as the second edge pixel points.
3. The method according to claim 1, characterized in that The determining the first edge pixel point of the first non-rectangular module based on the first correction data file includes: determining the first column where the first valid correction data of the first non-rectangular module appears in the first correction data matrix template, scanning the number of rows where the first valid correction data and the last valid correction data appear in the first column, marking the positions of the pixels of the first valid correction data and the last valid correction data appearing in the first column obtained by scanning, continuing to scan the number of rows where the first valid correction data and the last valid correction data appear in each column column by column, marking the positions of the pixels of the first valid correction data and the last valid correction data appearing in each column obtained by scanning, and determining the pixel point set of the marked positions as the first edge pixel point; The method of determining the second edge pixel points of the second non-rectangular module based on the second correction data file includes: determining the first column in which the second valid correction data of the second non-rectangular module appears in the second correction data matrix template, scanning the number of rows in which the first valid correction data and the last valid correction data appear in the first column, marking the positions of the pixels of the first valid correction data and the last valid correction data appearing in the scanned first column, continuing to scan the number of rows in which the first valid correction data and the last valid correction data appear in each column column by column, marking the positions of the pixels of the first valid correction data and the last valid correction data appearing in each column, and determining the set of pixels at the marked positions as the second edge pixel points.
4. The method according to claim 1, characterized in that: The determining of the first splicing pixel points of the first non-rectangular module based on the first edge pixel points of the first non-rectangular module includes: in the case where a plurality of splicing edges are included in a row-by-row direction, determining row by row whether the number of columns of pixel points in the first edge pixel points satisfies a first predetermined sequential changing rule, until the number of columns of pixel points does not satisfy the first predetermined sequential changing rule, determining a set of pixel points that satisfies the first predetermined sequential changing rule as the splicing pixel points corresponding to the first splicing edge, continuing to determine row by row whether the number of columns of pixel points in the first edge pixel points satisfies a second predetermined sequential changing rule, until the number of columns of pixel points does not satisfy the second predetermined sequential changing rule, determining a set of pixel points that satisfies the second predetermined sequential changing rule as the splicing pixel points corresponding to the second splicing edge, until all row numbers are determined, and the splicing pixel points corresponding to all splicing edges in the row-by-row direction are obtained; The method of determining the second stitching pixel points of the second non-rectangular module based on the second edge pixel points of the second non-rectangular module includes: in the case where multiple stitching edges are included in the row-by-row direction, judging row by row whether the number of columns of pixel points in the second edge pixel points satisfies a third predetermined sequential changing rule, until the number of columns of pixel points does not satisfy the third predetermined sequential changing rule, determining that a set of pixel points that satisfy the third predetermined sequential changing rule is the stitching pixel points corresponding to the first stitching edge, continuing to judge row by row whether the number of columns of pixel points in the second edge pixel points satisfies a fourth predetermined sequential changing rule, until the number of columns of pixel points does not satisfy the fourth predetermined sequential changing rule, determining that a set of pixel points that satisfy the fourth predetermined sequential changing rule is the stitching pixel points corresponding to the second stitching edge, until all row numbers are judged, and stitching pixel points corresponding to all stitching edges in the row-by-row direction are obtained.
5. The method according to claim 1, characterized in that The determining of the first splicing pixel points of the first non-rectangular module based on the first edge pixel points of the first non-rectangular module includes: in the case where a plurality of splicing edges are included in a column-by-column direction, judging column by column whether the number of rows of pixel points in the first edge pixel points satisfies a fifth predetermined sequential changing rule, until the number of rows of pixel points does not satisfy the fifth predetermined sequential changing rule, determining the set of pixel points satisfying the fifth predetermined sequential changing rule as the splicing pixel points corresponding to the first splicing edge, continuing to judge column by column whether the number of rows of pixel points in the first edge pixel points satisfies a sixth predetermined sequential changing rule, until the number of rows of pixel points does not satisfy the sixth predetermined sequential changing rule, determining the set of pixel points satisfying the sixth predetermined sequential changing rule as the splicing pixel points corresponding to the second splicing edge, until all column number judgments are completed, and obtaining the splicing pixel points corresponding to all splicing edges in the column-by-column direction; The method of determining the second stitching pixel points of the second non-rectangular module based on the second edge pixel points of the second non-rectangular module includes: in the case where a plurality of stitching edges are included in a column-by-column direction, judging column by column whether the number of rows of pixel points in the second edge pixel points satisfies a seventh predetermined sequential changing rule, until the number of rows of pixel points does not satisfy the seventh predetermined sequential changing rule, determining that a set of pixel points that satisfies the seventh predetermined sequential changing rule is the stitching pixel points corresponding to the first stitching edge, continuing to judge column by column whether the number of rows of pixel points in the first edge pixel points satisfies an eighth predetermined sequential changing rule, until the number of rows of pixel points does not satisfy the eighth predetermined sequential changing rule, determining that a set of pixel points that satisfies the eighth predetermined sequential changing rule is the stitching pixel points corresponding to the second stitching edge, until all column numbers are judged, and stitching pixel points corresponding to all stitching edges in the column-by-column direction are obtained.
6. The method according to claim 1, characterized in that The method of performing brightness compensation processing on the bright and dark lines at the joint of the first non-rectangular module and the second non-rectangular module by adjusting the correction data of the first splicing pixel point and the correction data of the second splicing pixel point includes: By proportionally adjusting the brightness compensation value in the correction data of the first spliced pixel point and the brightness compensation value in the correction data of the second spliced pixel point, brightness compensation processing is performed on the bright and dark lines at the joint of the first non-rectangular module and the second non-rectangular module until the bright and dark lines at the joint of the first non-rectangular module and the second non-rectangular module reach a predetermined bright and dark line standard.
7. The method according to any one of claims 1 to 6, characterized in that The first non-rectangular module and the second non-rectangular module are modules in a target spherical screen.
8. A device for processing light and dark lines, characterized in that: include: An acquisition module, used for acquiring a first correction data file and a second correction data file, wherein in the first correction data file, first correction data of a first non-rectangular module are arranged in a first correction data matrix template, the first correction data include first valid correction data and first complementary point correction data, the first valid correction data of the first non-rectangular module are arranged in a first non-rectangular array in the first correction data matrix template, and in the second correction data file, second correction data of a second non-rectangular module are arranged in a second correction data matrix template, the second correction data include second valid correction data and second complementary point correction data, the second valid correction data of the second non-rectangular module are arranged in a second non-rectangular array in the second correction data matrix template, and the first non-rectangular module and the second non-rectangular module are adjacent modules; A first determining module, configured to determine a first edge pixel point of the first non-rectangular module based on the first correction data file, and to determine a second edge pixel point of the second non-rectangular module based on the second correction data file; A second determining module, configured to determine a first splicing pixel point of the first non-rectangular module based on the first edge pixel point of the first non-rectangular module, and to determine a second splicing pixel point of the second non-rectangular module based on the second edge pixel point of the second non-rectangular module; The adjustment module is used to perform brightness compensation processing on the bright and dark lines at the joint of the first non-rectangular module and the second non-rectangular module by adjusting the correction data of the first joint pixel point and the correction data of the second joint pixel point.
9. A computer-readable storage medium, characterized in that: The computer-readable storage medium includes a stored program, wherein when the program is executed, the device where the computer-readable storage medium is located is controlled to execute the bright and dark line splicing processing method according to any one of claims 1 to 7.
10. A computer device, characterized in that: include: Memory and processor, The memory stores a computer program; The processor is used to execute the computer program stored in the memory, and when the computer program is running, the processor executes the bright and dark line splicing processing method according to any one of claims 1 to 7.
