Method for solving jump point of infrared touch screen

Abstract

The invention provides a method for solving a jump point of an infrared touch screen, which belongs to the technical field of infrared touch screens, and comprises the following steps of: S1, starting the infrared touch screen, and acquiring optical network data between a transmitting lamp and a receiving lamp in a current state; s2, dividing the optical network data into a plurality of sub-regions according to pixels, detecting shelters, and extracting suspicious candidate regions in the sub-regions through sheltering lines; s3, extracting contours of the suspicious candidate areas through the unshielded lines to obtain k polygons; step S4, performing jump point identification on the k polygons obtained in the step S3; s5, fusion is carried out according to different jump point types, and a fused polygon is obtained; and S6, repeating the steps S4-S5 until all polygons are fused. By adopting the method for solving the jump point of the infrared touch screen, the touch accuracy and the user experience can be improved.

Description

Technical Field

[0001] The invention relates to the technical field of infrared touch screens, and in particular to a method for solving infrared touch screen jump point problems. Background Art

[0002] The infrared touch screen is a circuit board frame installed in front of the display, with infrared emitting tubes and infrared receiving tubes arranged on the four sides of the circuit board frame. Generally, the infrared emitting tubes and infrared receiving tubes are set on two opposite sides of the frame to form a cross infrared matrix. When the user touches the screen, the finger will block the horizontal and vertical infrared rays passing through the position, and the position of the touch point on the screen can be determined based on the blocked infrared rays.

[0003] However, since the infrared touch screen uses a smooth light-transmitting strip, the edge portion thereof reflects light severely, resulting in multiple blocked areas on the touch screen, causing the touch point to be misjudged, resulting in the loss of the touch point, and thus affecting the user experience. Summary of the invention

[0004] The purpose of the present invention is to provide a method for solving the problem of infrared touch screen jump points, which can improve touch accuracy and user experience.

[0005] To achieve the above object, the present invention provides a method for solving the problem of infrared touch screen jump point, comprising the following steps:

[0006] Step S1, start the infrared touch screen to obtain the optical network data between the transmitting light and the receiving light in the current state;

[0007] Step S2, dividing the optical network data into several sub-regions according to pixels, detecting occlusions, and then extracting suspicious candidate regions in the sub-regions through occlusion lines;

[0008] Step S3, extracting the outline of the suspicious candidate area through the unobstructed line to obtain k polygons;

[0009] Step S4, identifying jumping points of the k polygons obtained in step S3;

[0010] Step S5, fusing according to different jump point types to obtain fused polygons;

[0011] Step S6: Repeat steps S4 to S5 until all polygons are merged.

[0012] Preferably, in step S3, the number of sides of the polygon is a natural number greater than or equal to 4.

[0013] Preferably, in step S4, the jump points include three types, namely, co-linear, co-point and mutually separated.

[0014] Preferably, in step S4, the identification of the jump point includes the following steps:

[0015] Let the set of k polygons be Sk = {P1, P2, ...Pk}, Pi represents a polygon in the set Sk, and the vertices Pi of the polygon are stored in a clockwise direction. - , then the vertex Pi of the i-th polygon - ={[X1, Y1], [X2, Y2], [X3, Y3], ... [Xi, Yi], ...}, [Xi, Yi] is the coordinate of the i-th vertex;

[0016] Let the set of k-1 polygons be S(k-1) = {P1, P2, ...Pk-1}, Pj represents a polygon in the set S(k-1), and the vertices Pj of the polygon are stored in a clockwise direction. - , then the vertex Pj of the jth polygon - ={[X1, Y1], [X2, Y2], [X3, Y3], ... [Xj, Yj], ...}, [Xj, Yj] are the coordinates of the j-th vertex;

[0017] Compare the i-th n-gon Pi in the set Sk with the j-th m-gon Pj in the set S(k-1) using three types of jump points, and traverse the i-th vertex [Xi, Yi] of the n-gon and the j-th vertex [Xj, Yj] of the m-gon in turn;

[0018] Identification of collinearity:

[0019] When [Xi, Yi]≡[Xj, Yj] and [X(i+1), Y(i+1)]≡[X(j+1), Y(j+1)], the n-gon Pi and the m-gon Pj are collinear;

[0020] Identification of common points:

[0021] When [Xi, Yi]≡[Xj, Yj], that is, n-gon Pi and m-gon Pj;

[0022] Identification of mutual separation:

[0023] When [Xi-Xj] 2 +[Yi-Yj] 2 <D×D and [X(i+1)iX(j+1)] 2 +[Y(i+1)-Y(j+1)] 2 When <D×D, the n-gon Pi and the m-gon Pj are separated from each other within a distance range D.

[0024] Therefore, the present invention adopts the above-mentioned method for solving the infrared touch screen jump point, and the beneficial technical effects are as follows:

[0025] (1) Improve touch accuracy: By acquiring the optical network data between the transmitting light and the receiving light and dividing the sub-areas by pixels to detect obstructions, the touch point can be located more accurately. Taking suspicious candidate areas and identifying the jump point type can help reduce misjudgment and improve touch accuracy.

[0026] (2) Optimizing user experience: Solving the problem of touch point jumps can avoid the loss of touch points and improve the user experience. After the method is implemented, users can complete operations more accurately when touching the screen, which will improve user satisfaction.

[0027] (3) Enhanced technical reliability: This method improves the technical reliability of the infrared touch screen by integrating and processing different types of jump points. In practical applications, it can reduce the failure rate caused by jump point problems and improve the stability and durability of the equipment. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] Figure 1 This is a flow chart of a method for solving infrared touch screen jump point problem of the present invention;

[0029] Figure 2 Schematic diagram generated for the jump point problem;

[0030] Figure 3 Schematic diagram of generating jump points for two erroneous unobstructed rays;

[0031] Figure 4 is the fusion process diagram when collinear; Figure 4 (a) is a schematic diagram before fusion; Figure 4 (b) is a schematic diagram of the fusion process; Figure 4 (c) is a schematic diagram after fusion;

[0032] Figure 5 The fusion process diagram when is a common point; among them, Figure 5 (a) is a schematic diagram before fusion; Figure 5 (b) is a schematic diagram of the fusion process; Figure 5 (c) is a schematic diagram after fusion;

[0033] Figure 6 is a diagram of the fusion process during separation; Figure 6 (a) is a schematic diagram before fusion; Figure 6 (b) is a schematic diagram of the fusion process; Figure 6 (c) is a schematic diagram after fusion. DETAILED DESCRIPTION

[0034] The technical solution of the present invention is further described below through the accompanying drawings and embodiments.

[0035] Unless otherwise defined, technical or scientific terms used in the present invention shall have the common meanings understood by one having ordinary skills in the field to which the present invention belongs.

[0036] Embodiment 1

[0037] like Figure 1 As shown, the present invention provides a method for solving the problem of infrared touch screen jump point, comprising the following steps:

[0038] Step S1, start the infrared touch screen to obtain the optical network data between the transmitting light and the receiving light in the current state.

[0039] Step S2: Divide the optical network data into several sub-regions according to pixels, detect occlusions, and then extract suspicious candidate regions in the sub-regions through occlusion lines.

[0040] The pixel is the number of LED lights in the horizontal direction multiplied by the number of LED lights in the vertical direction.

[0041] Taking a 65-inch touch screen as an example, 65 pairs of LED lights are used in the horizontal direction (a group of receiving and transmitting LED lights is called a pair), 32 pairs of LED lights are used in the vertical direction, and the pixels are 65×32.

[0042] Step S3: extract the outline of the suspicious candidate area through the unobstructed lines to obtain k polygons.

[0043] The number of sides of a polygon is a natural number greater than or equal to 4.

[0044] Step S4: Identify jumping points on the k polygons obtained in step S3.

[0045] There are three types of jump points: co-linear, co-point, and mutually separated.

[0046] The identification of jump points includes the following steps:

[0047] Let the set of k polygons be Sk = {P1, P2, ...Pk}, Pi represents a polygon in the set Sk, and the vertices Pi of the polygon are stored in a clockwise direction. - , then the vertex Pi of the i-th polygon - ={[X1, Y1], [X2, Y2], [X3, Y3], ... [Xi, Yi], ...} are the coordinates of the i-th vertex.

[0048] Let the set of k-1 polygons be S(k-1) = {P1, P2, ...Pk-1}, Pj represents a polygon in the set S(k-1), and the vertices Pj of the polygon are stored in a clockwise direction. - , then the vertex Pj of the jth polygon -={[X1, Y1], [X2, Y2], [X3, Y3], ... [Xj, Yj], ...}, [Xj, Yj] are the coordinates of the j-th vertex.

[0049] Compare the i-th n-gon Pi in the set Sk with the j-th m-gon Pj in the set S(k-1) using three types of jump point types, traversing the i-th vertex [Xi, Yi] of the n-gon and the j-th vertex [Xj, Yj] of the m-gon in turn.

[0050] Identification of collinearity:

[0051] When [Xi, Yi]≡[Xj, Yj] and [X(i+1), Y(i+1)]≡[X(j+1), Y(j+1)], the n-gon Pi and the m-gon Pj are collinear.

[0052] Identification of common points:

[0053] When [Xi, Yi]≡[Xj, Yj], it is n-gon Pi and m-gon Pj.

[0054] Identification of mutual separation:

[0055] When [Xi-Xj] 2 +[Yi-Yj] 2 <D×D and [X(i+1)iX(j+1)] 2 +[Y(i+1)-Y(j+1)] 2 When <D×D, the n-gon Pi and the m-gon Pj are separated from each other within a distance range D.

[0056] Step S5: Fusing according to different jump point types to obtain fused polygons.

[0057] Step S6: Repeat steps S4 to S5 until all polygons are merged.

[0058] Embodiment 2

[0059] To facilitate understanding, the following explanation is given first.

[0060] In the field of infrared touch screens, during the actual edge drawing process, the reflection problem usually manifests itself as actual obstruction of the light path, but the existence of reflected light causes a probability error in signal processing judgment, that is, obstruction rather than blocking.

[0061] like Figure 2 As shown in the figure, the straight line L is originally an occluding line, but due to reflection, it is judged as an unoccluding line during signal processing, which causes the original touch polygon to be divided into two, thus causing a high probability of point jumping and causing touch anomalies. In actual situations, there may also be multiple occluding lines L, which will cause the original touch polygon to be divided into multiple ones.

[0062] like Figure 3 As shown, straight lines L1 and L2 are actually blocked due to reflection but are actually determined to be unblocked lines. Therefore, the figure is divided into three areas, area EFBA, area ABCD, and area CHKGD. If the polygon is not processed, these three areas will be determined as three different touch points, which will obviously cause problems. After the collinear processing, area EFBA and area AB in area ABCD are collinear, so they are merged into area EFCD, and area EFCD and CHKGD also have collinear CD. After merging, only one area EFHKG is obtained, so only one touch point is input.

[0063] Embodiment 3

[0064] This embodiment further illustrates the collinear situation.

[0065] like Figure 4 As shown in (a), polygon ABCDEF and polygon OPQRSCB, BC are collinear; Figure 4 As shown in (b) in the figure, during the fusion process, the line segment BC is removed, and the points before and after points B and C are connected in a clockwise direction, that is, point A is connected to point O, and point S is connected to point D; Figure 4 As shown in (c) in the figure, the fused polygon is AOPQRSDEF.

[0066] Embodiment 4

[0067] This embodiment further illustrates the situation of common points.

[0068] like Figure 5 As shown in (a) of the figure, polygon ABCDE and polygon OPQRSC, where C has a common point; Figure 5 As shown in (b) in the fusion process, the common point C is removed, and the points before and after point C are connected in a clockwise direction, that is, point B is connected to point O, and point S is connected to point D; Figure 5 As shown in (c) in the figure, the fused polygon is ABOPQRSDE.

[0069] Embodiment 5

[0070] This embodiment further illustrates the situation of mutual separation.

[0071] like Figure 6 As shown in (a) of FIG. 1 , polygon ABCDE and polygon OPQRS are separated from each other by a distance D1 based on BC and OS; Figure 6As shown in (b) of the figure, during the fusion process, line segments BC and OS are removed, and then the previous point A of point B is connected to the next point P of point O, and the previous point R of point S is connected to the next point D of point C; Figure 6 As shown in (c) in the figure, the fused polygon is APQRDE.

[0072] Therefore, the present invention adopts the above-mentioned method for solving the infrared touch screen jump point problem, which can improve the touch accuracy and user experience.

[0073] Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that they can still modify or replace the technical solution of the present invention with equivalents, and these modifications or equivalent replacements cannot cause the modified technical solution to deviate from the spirit and scope of the technical solution of the present invention.

Claims

1. A method for solving the problem of infrared touch screen jumping point, characterized in that: The following steps are involved: Step S1, start the infrared touch screen to obtain the optical network data between the transmitting light and the receiving light in the current state; Step S2, dividing the optical network data into several sub-regions according to pixels, detecting occlusions, and then extracting suspicious candidate regions in the sub-regions through occlusion lines; Step S3, extracting the outline of the suspicious candidate area through the unobstructed line to obtain k polygons; Step S4, identifying jumping points of the k polygons obtained in step S3; Step S5, fusing according to different jump point types to obtain fused polygons; Step S6: Repeat steps S4 to S5 until all polygons are merged.

2. A method for solving infrared touch screen jump point according to claim 1, characterized in that: In step S3, the number of sides of the polygon is a natural number greater than or equal to 4.

3. A method for solving infrared touch screen jump point according to claim 2, characterized in that: In step S4, the jump points include three types, namely, co-linear, co-point and mutually separated.

4. The method for solving the problem of infrared touch screen jump point according to claim 3, characterized in that: In step S4, the identification of the jump point includes the following steps: Let the set of k polygons be Sk = {P1, P2, ...Pk}, Pi represents a polygon in the set Sk, and the vertices Pi of the polygon are stored in a clockwise direction. - , then the vertex Pi of the i-th polygon - ={[X1, Y1], [X2, Y2], [X3, Y3], ... [Xi, Yi], ...}, [Xi, Yi] is the coordinate of the i-th vertex; Let the set of k-1 polygons be S(k-1) = {P1, P2, ...Pk-1}, Pj represents a polygon in the set S(k-1), and the vertices Pj of the polygon are stored in a clockwise direction. - , then the vertex Pj of the jth polygon - ={[X1, Y1], [X2, Y2], [X3, Y3], ... [Xj, Yj], ...}, [Xj, Yj] are the coordinates of the j-th vertex; Compare the i-th n-gon Pi in the set Sk with the j-th m-gon Pj in the set S(k-1) using three types of jump points, and traverse the i-th vertex [Xi, Yi] of the n-gon and the j-th vertex [Xj, Yj] of the m-gon in turn; Identification of collinearity: When [Xi, Yi]≡[Xj, Yj] and [X(i+1), Y(i+1)]≡[X(j+1), Y(j+1)], the n-gon Pi and the m-gon Pj are collinear; Identification of common points: When [Xi, Yi]≡[Xj, Yj], that is, n-gon Pi and m-gon Pj; Identification of mutual separation: When [Xi-Xj] 2 +[Yi-Yj] 2 <D×D and [X(i+1)iX(j+1)] 2 +[Y(i+1)-Y(j+1)] 2 When <D×D, the n-gon Pi and the m-gon Pj are separated from each other within a distance range D.

Images