Distance false detection removal method and device utilizing distance ambiguity processing false detection removal algorithm

The false detection elimination algorithm addresses radar ambiguity by categorizing and processing radar data to accurately group Burst plots, reducing false positives and improving target detection accuracy.

KR1020260161990APending Publication Date: 2026-11-10AGENCY FOR DEFENSE DEV
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
KR1020250058037
Authority / Receiving Office
KR · KR
Patent Type
Applications
Current Assignee / Owner
Filing Date
2025-05-02
Publication Date
2026-11-10

Smart Images

  • Figure PAT00020_ABST
    Figure PAT00020_ABST
Patent Text Reader

Abstract

The present invention relates to a method and apparatus for removing distance false detections utilizing a distance ambiguity processing false detection removal algorithm, wherein the method performed by a distance ambiguity false detection removal device comprises the steps of: loading data from a radar; preprocessing the loaded data; processing distance ambiguity on the preprocessed data; determining whether the ambiguity processing was performed normally; if the ambiguity processing was not performed normally, setting a category for a false detection case; and removing false detections by utilizing at least one false detection removal algorithm corresponding to the set category.
Need to check novelty before this filing date? Find Prior Art

Description

Technology Field

[0001] The present invention relates to a method and apparatus for eliminating false detections in distance using a distance ambiguity processing false detection elimination algorithm, and more specifically, to a method and apparatus utilizing at least one false detection elimination algorithm to eliminate false detections occurring during distance ambiguity processing with radar. Background Technology

[0002] The process of eliminating false positives that occur during range ambiguity processing with radar is crucial for accurately detecting targets. Range ambiguity refers to a situation where, when a radar transmits N pulses, it is impossible to determine which pulse the signal received reflected from the target was. This occurs when the distance between the radar and the target is greater than the radar's ambiguity distance. Ambiguity distance refers to the distance between adjacent pulses when the radar emits N consecutive pulses. In other words, ambiguity distance is directly proportional to the pulse repetition period.

[0003] Distance ambiguity processing refers to the process of resolving ambiguity. In other words, it is the process of determining which pulse the signal reflected from a target was. A false positive in distance ambiguity processing refers to incorrectly determining that a target is present when it is not. Conversely, a target miss refers to incorrectly determining that a target is absent when it is present. The present invention relates to utilizing at least one algorithm to eliminate false positives in distance ambiguity processing.

[0004] The aforementioned background technology is technical information that the inventor possessed for the derivation of the present invention or acquired during the process of deriving the present invention, and it cannot be considered technology that was known to the general public prior to the filing of the present invention. The problem to be solved

[0005] The problem to be solved by the disclosure of the present invention relates to a method and apparatus utilizing at least one false detection removal algorithm to eliminate false detections occurring when processing distance ambiguity with radar. means of solving the problem

[0006] The problem to be solved by the disclosure of the present invention may include a method performed by a distance ambiguity false detection removal device, comprising the steps of: loading data from a radar; preprocessing the loaded data; processing distance ambiguity on the preprocessed data; determining whether the ambiguity processing was performed normally; if the ambiguity processing was not performed normally, setting a category for a false detection case; and removing false detections by utilizing at least one false detection removal algorithm corresponding to the set category.

[0007] In one embodiment, the category regarding the false detection case includes at least one, and one of the categories may be a case where the same Burst is duplicated and grouped into a Dwell plot, and another of the categories may be a case where Burst plots generated at the target are grouped into a Dwell plot.

[0008] In one embodiment, when the same Burst is duplicated and grouped into a Dwell plot, the false detection removal algorithm may be an algorithm that compares the distances between Burst plots, determines that Burst plots grouped within a certain distance are properly grouped, and removes Burst plots that are not.

[0009] In one embodiment, when burst plots generated at a target are grouped into a dwell plot, the false detection removal algorithm may be an algorithm that finds overlaps between dwell plots in burst plots.

[0010] In one embodiment, when Burst plots generated at a target are grouped into a Dwell plot, the false detection removal algorithm may be an algorithm that calculates the distance between each duplicate Burst plot and the Burst plots of the Dwell plot to which it belongs, defines the degree of closeness based on the calculation as Cost, and removes the Burst plot determined to be duplicate while keeping only the Burst plot with the smallest Cost.

[0011] In one embodiment, when Burst plots generated at a target are grouped into a Dwell plot, the false detection removal algorithm calculates the average distance and average velocity values ​​of non-overlapping Burst plots, calculates the difference between the distance and velocity of overlapping Burst plots, divides the distance difference value by the maximum distance value and the velocity difference value by the maximum velocity value, and adds the result to indicate the degree of closeness between the Burst plots; if the Burst plots are grouped closer, they are considered to be properly grouped, and if they are not, they are considered to be overlapping and removed. Effects of the invention

[0012] According to the means for solving the problem of the present invention described above, at least one false detection removal algorithm can be utilized to remove false detections that occur when processing distance ambiguity with radar. Brief explanation of the drawing

[0013] FIG. 1 illustrates an exemplary environment in which a distance ambiguity false positive removal device according to some embodiments of the present disclosure may be applied. FIG. 2 is a flowchart relating to a false detection removal operation utilizing a false detection removal algorithm that can be performed in a distance ambiguity false detection removal device according to some embodiments of the present disclosure. FIGS. 3 to 16 are drawings for explaining a false detection removal operation using a false detection removal algorithm according to some embodiments of the present disclosure. FIG. 17 is a drawing of an exemplary computing device capable of implementing a device and / or system according to various embodiments of the present disclosure. Specific details for implementing the invention

[0014] Hereinafter, preferred embodiments of the present disclosure will be described in detail with reference to the accompanying drawings. The advantages and features of the present disclosure and the methods for achieving them will become clear by referring to the embodiments described below in detail together with the accompanying drawings. However, the technical concept of the present disclosure is not limited to the following embodiments but can be implemented in various different forms. The following embodiments are provided merely to complete the technical concept of the present disclosure and to fully inform those skilled in the art of the scope of the present disclosure, and the technical concept of the present disclosure is defined only by the scope of the claims.

[0015] It should be noted that when assigning reference numerals to the components of each drawing, the same components are given the same reference numeral whenever possible, even if they are shown in different drawings. Furthermore, in describing the present disclosure, if it is determined that a detailed description of related known components or functions could obscure the essence of the present disclosure, such detailed description is omitted.

[0016] Unless otherwise defined, all terms used herein (including technical and scientific terms) may be used in a meaning commonly understood by those skilled in the art to which this disclosure pertains. Additionally, terms defined in commonly used dictionaries are not to be interpreted ideally or excessively unless explicitly and specifically defined otherwise. The terms used herein are for describing the embodiments and are not intended to limit this disclosure. In this specification, the singular form includes the plural form unless specifically stated otherwise in the text.

[0017] Additionally, terms such as first, second, A, B, (a), (b), etc., may be used to describe the components of the present disclosure. These terms are intended only to distinguish the components from other components and do not limit the nature, order, or sequence of the components. Where it is stated that a component is "connected," "coupled," or "joined" to another component, it should be understood that the component may be directly connected or joined to the other component, but that another component may also be "connected," "coupled," or "joined" between each component.

[0018] As used in the specification, "comprises" and / or "comprising" do not exclude the presence or addition of one or more other components, steps, actions, and / or elements to the mentioned components, steps, actions, and / or elements.

[0019] Hereinafter, various embodiments of the present disclosure will be described in detail with reference to the attached drawings.

[0020] In addition, terms such as first, second, A, B, (a), (b), etc. may be used when describing the components of the present invention. These terms are intended merely to distinguish the components from other components, and the essence, order, or sequence of the components is not limited by these terms. Throughout the specification, when a part is described as 'comprising' or 'equipped' with a certain component, unless specifically stated otherwise, this means that it may include additional components rather than excluding other components. Furthermore, terms such as 'part' or 'module' described in the specification refer to a unit that processes at least one function or operation, and this may be implemented in hardware, software, or a combination of hardware and software.

[0022] FIG. 1 illustrates an exemplary environment in which a distance ambiguity false detection removal device according to some embodiments of the present disclosure may be applied. Through a system including a radar (100) and a distance ambiguity false detection removal device (200) as illustrated in FIG. 1, an operation can be performed to process distance false detections for radar-related data using at least one removal algorithm.

[0023] Below, we will explain in more detail the components shown in FIG. 1 related to the distance false detection processing operation by utilizing the radar (100) and the distance ambiguity false detection removal device (200) through the system described above.

[0024] FIG. 1 illustrates an example in which a radar (100) and a distance ambiguity false detection removal device (200) are connected via a network, but this is only for convenience of understanding, and the number of devices that can be connected to the network can vary.

[0025] Meanwhile, FIG. 1 merely illustrates a preferred embodiment for achieving the purpose of the present disclosure, and some components may be added or deleted as needed. Below, the components illustrated in FIG. 1 will be described in more detail.

[0026] The distance ambiguity false detection removal device (200) can collect and analyze various information generated from the radar (100). The various information may include all data generated from the radar (100). In this case, the various information refers to data generated from the radar (100), and the data may refer to signal data received by being reflected from a target in response to a pulse transmitted by the radar.

[0027] The radar (100) illustrated in FIG. 1 is an abbreviation for Radio Detection And Ranging, and refers to an information system that detects an object and determines its direction, distance, speed, etc., by measuring the reflected waves that return after an electromagnetic wave is emitted and hits the object. The radar device developed for this purpose is also referred to as a "radar." Its form ranges from a dish-shaped parabolic antenna to a flat-shaped planar scanning antenna, and its applications range from long-range radars covering a specific area from a mountaintop to fire control radars for anti-aircraft guns and guided missiles, and onboard radars attached to the very front of aircraft, including fighter jets, to monitor conditions at non-line-of-sight distances. Although it originally started as a military application, it is now widely used in weather, transportation, and other fields.

[0028] Additionally, the radar (100) illustrated in FIG. 1 may be implemented with one or more computing devices. For example, all functions of the radar (100) may be implemented in a single computing device. As another example, the first function of the radar (100) may be implemented in a first computing device, and the second function may be implemented in a second computing device. Here, the computing device may be a smartphone, notebook, desktop, laptop, etc., but is not limited thereto and may include any type of device equipped with computing functions. The radar (100) may be connected to the distance ambiguity false detection removal device (200) of the present invention via a network to transmit and receive data to and from each other.

[0029] Meanwhile, the distance ambiguity false positive removal device (200) may also be implemented with one or more computing devices. For example, all functions of the distance ambiguity false positive removal device (200) may be implemented in a single computing device. As another example, the first function of the distance ambiguity false positive removal device (200) may be implemented in a first computing device, and the second function may be implemented in a second computing device. Here, the computing device may be a smartphone, notebook, desktop, laptop, etc., but is not limited thereto and may include all types of devices equipped with computing functions. However, it may be preferable for the distance ambiguity false positive removal device (200) to be implemented as a high-performance server-class computing device. An example of a computing device will be described with reference to FIG. 17.

[0030] Additionally, the functions that can be implemented in the distance ambiguity false detection removal device (200) may also be implemented by utilizing an electronic device mounted on the radar (100). Therefore, although the distance ambiguity false detection removal device (200) and the radar (100) are depicted separately in FIG. 1, it is obvious that according to one embodiment, the distance ambiguity false detection removal device (200) is mounted on the radar (100) so that the corresponding device can implement the first function, the second function, etc. within the radar (100). Therefore, it should be noted that this is not limited to an embodiment in which the radar (100) and the distance ambiguity false detection removal device (200) are externally separated as shown in FIG. 1.

[0031] For convenience of explanation, the present specification describes a situation in which the radar (100) and the distance ambiguity false detection removal device (200) are separated to implement their functions.

[0032] In some embodiments, components included in an environment to which the distance ambiguity false positive removal device (200) is applied can communicate through a network. The network can be implemented as any type of wired or wireless network, such as a Local Area Network (LAN), a Wide Area Network (WAN), a mobile radio communication network, or Wibro (Wireless Broadband Internet).

[0033] Meanwhile, although the environment illustrated in FIG. 1 is shown as being connected via a network through a radar (100) and a distance ambiguity false detection removal device (200), it should be noted that the scope of the present disclosure is not limited thereto and the radar (100) may also be connected to the distance ambiguity false detection removal device (200) via P2P (Peer to Peer).

[0034] Up to now, with reference to FIG. 1, exemplary environments in which a corresponding device (200) according to some embodiments of the present disclosure may be applied have been described. Hereinafter, with reference to FIG. 2 and subsequent drawings, methods according to various embodiments of the present disclosure will be described in detail.

[0035] Each step of the methods described below may be performed by a computing device. In other words, each step of the methods may be implemented by one or more instructions executed by a processor of the computing device. All steps included in these methods may be performed by a single physical computing device, but the first steps of the methods may be performed by a first computing device and the second steps of the methods may be performed by a second computing device.

[0036] In FIG. 2 below, the explanation will continue assuming that each step of the methods is performed by the distance ambiguity false detection removal device (200) exemplified in FIG. 1. However, for the convenience of explanation, the subject of the operation of each step included in the methods may be omitted.

[0038] FIG. 2 is a flowchart relating to a false detection removal operation utilizing a false detection removal algorithm that can be performed in a distance ambiguity false detection removal device according to some embodiments of the present disclosure.

[0039] In step S100, the distance ambiguity false detection removal device (200) can load data from the radar. The loaded data refers to various information generated by the radar (100), and the various information may include all data generated by the radar (100). At this time, the various information refers to data generated by the radar (100), and the data may refer to signal data received by being reflected from a target in response to a pulse transmitted by the radar.

[0040] In step S200, the distance ambiguity false positive removal device (200) can preprocess the loaded data. The preprocessing process may refer to a process of preprocessing the loaded data to utilize a false positive removal algorithm.

[0041] In step S300, the distance ambiguity false detection removal device (200) can process distance ambiguity for the preprocessed data. In the present invention, distance ambiguity refers to a situation where, when a radar transmits N pulses, it is impossible to determine which pulse the signal received reflected from the target was. This occurs when the distance between the radar and the target is longer than the radar's ambiguity distance. Ambiguity distance refers to the distance between neighboring pulses when the radar emits N consecutive pulses. That is, the ambiguity distance is directly proportional to the pulse repetition period.

[0042] Distance ambiguity processing refers to the process of resolving ambiguity. That is, it is the process of determining which pulse the signal reflected from the target was. A false positive in distance ambiguity processing means incorrectly determining that a target exists when there is no target. Conversely, a target miss means incorrectly determining that there is no target when there is a target. The present invention includes a method for eliminating false positives in distance ambiguity processing.

[0043] In step S400, the distance ambiguity false positive removal device (200) can determine whether ambiguity processing has been performed normally. In step S500, if the distance ambiguity false positive removal device (200) determines that ambiguity processing has not been performed normally, it can set a category for false positive cases. The category may include two cases, where false positive case 1 is a case where the same Burst is duplicated and grouped into a Dwell plot. False positive case 2 is a case where Burst plots generated from different targets are grouped into a Dwell plot. In the present invention, a solution is presented by analyzing false positive cases 1 and 2.

[0044] In step S600, the distance ambiguity false positive removal device (200) can remove false positives by utilizing at least one false positive removal algorithm corresponding to a set category. That is, in step S600, there may be a false positive removal algorithm corresponding to false positive case 1 and a false positive removal algorithm corresponding to false positive case 2.

[0045] Below, the operation of removing false detections through a false detection removal algorithm corresponding to cases 1 and 2, respectively, will be described in more detail using FIGS. 3 to 16.

[0047] FIGS. 3 to 16 are drawings for explaining a false detection removal operation using a false detection removal algorithm according to some embodiments of the present disclosure.

[0048] The situation in which a radar transmits N pulses can be represented as shown in the figure below. The blue rectangle represents the pulse, and the red triangle represents the target. The radar transmits pulses and receives the signal that hits the target, and then performs signal processing. In this case, the situation where it is impossible to determine which pulse the received signal is is called distance ambiguity.

[0049] The distance between the radar and the target is , the speed of light is , the pulse repetition period is When that, the distance is equal to the equation below.

[0050] (1)

[0051] If the target is within the ambiguity distance, there is no distance ambiguity because it is possible to determine which pulse the received signal was. On the other hand, if the target is farther than the ambiguity distance, distance ambiguity occurs because it is impossible to determine which pulse the received signal was.

[0052] Radar signal processing occurs at a distance folded within the ambiguity distance of the actual target. The distance of signal processing is an unambiguity distance and can be expressed as shown in the formula below.

[0053] (1)

[0055] In the above formula, mod is second It refers to the remainder after dividing by. In signal processing, if a target is detected through thresholding, It can be known. However It is unknown. The process of determining which pulse it was in order to know the actual distance of the target is distance ambiguity processing.

[0057] Burst and Dwell

[0058] The process of resolving distance ambiguity is illustrated in the diagram. However, this example demonstrates the process of finding the nth pulse under the assumption that the actual distance to the target is known. In reality, since the actual distance to the target is unknown, all possible cases involving N pulses must be considered. All possible cases can be represented by the formula below.

[0060] (2)

[0062] It is an extension of the ambiguity distance by a factor of n, which is called range extension. In other words, if the value of n is determined, the actual distance of the target can be known. At least two range extension formulas are required to determine the unknown variable n. For the range extension formulas to be different, their PRIs must be different. The system addressed in this invention is designed to produce five range extension formulas. That is, five PRIs are used.

[0063] Radar transmits individual pulses by varying the PRI. The time unit in which N pulses are transmitted and received with a single PRI is called a Burst. Specifically, Burst 1 refers to the transmission and reception of N1 pulses with a pulse repetition period of PRI 1. Furthermore, the result of detecting a target by performing signal processing for each Burst is called a Burst plot. The time taken to collect all Bursts 1, 2, 3, 4, and 5 is called a Dwell. The result of performing distance ambiguity processing on the Burst plots is called a Dwell plot.

[0065] Distance ambiguity handling

[0066] Handling distance ambiguity is key to determining n. To determine n, the expressions for Burst1, 2, 3, 4, and 5 are as follows. At this time, represents the number of each Burst. Is It refers to the signal processing distance of the nth burst. Is It refers to the pulse number of the th burst. Is It means the ambiguous distance of the th burst.

[0068] (3)

[0070] Figure 3 illustrates the distance expansion for each Burst as shown in the formula above. The distance ambiguity processing algorithm varies depending on how the distance-expanded Burst plots are grouped. The method referenced in this invention is to align them in the distance direction and group Burst plots that are close in distance. This algorithm can be diagrammed. A Burst plot is a signal processing distance at which a single target is detected, folded at different ambiguity distances for each Burst. The method assumes that when the Burst plots are expanded by a multiple of their respective ambiguity distances, if the distance-expanded Burst plots cluster close together, that location is likely the actual distance to the target. However, since close distances are grouped together, they may be unintentionally grouped incorrectly.

[0071] It is possible to identify cases where ambiguity processing is performed normally and cases where it is performed abnormally. If ambiguity processing is performed normally, a dwell plot should be formed where the target is located. Abnormal execution results in false alarms or target misses. A false alarm is when a dwell plot is incorrectly formed where there is no target. A target miss is when a dwell plot is not formed where the target is located. In this invention, an algorithm has been developed to reduce false alarms during distance ambiguity processing.

[0072] If distance ambiguity processing is performed correctly, burst plots of different bursts from the same target should be grouped together to form a dwell plot. In other words, Normal Condition 1 requires that the plot be composed of different bursts, and Normal Condition 2 requires that the plot be composed of burst plots generated from the same target. If distance ambiguity processing is performed incorrectly, it means that Normal Condition 1 or Normal Condition 2 has been violated.

[0073] There are two types of cases where distance ambiguity processing is performed abnormally. Each case is explained in [Fig. 6]. False detection case 1 is when the same burst is duplicated and grouped into a dwell plot. False detection case 2 is when burst plots generated from different targets are grouped into a dwell plot. In this invention, solutions are presented by analyzing false detection cases 1 and 2.

[0075] False positive case 1 and solution

[0076] False positive case 1 refers to a situation where the same Burst is duplicated and grouped into a Dwell plot. This can be described as Burst duplication within a Dwell plot. Although the Bursts constituting a Dwell plot must be distinct, Burst 1 can be observed to be duplicated. In this case, the method involves comparing the proximity of the Burst plots; those clustered close together are identified as properly grouped, while those that are not are removed. The specific formula can be found in the diagram. The average distance and velocity values ​​of the non-duplicate Burst plots are calculated, and the difference between the distance and velocity of the duplicate Burst plots is determined. The degree of proximity between Burst plots is represented by dividing the distance difference by the maximum distance value and the velocity difference by the maximum velocity value, and then adding the results. Burst plots clustered closer together are considered properly grouped, while those that are not are deemed duplicates and are removed.

[0078] False positive case 2 and solution

[0079] False detection case 2 refers to a situation where Burst plots generated from different targets are grouped into a Dwell plot. This occurs because Burst plots that were distance-expanded from the same Burst plot are grouped into different Dwell plots. This can be described as Burst plot duplication between Dwell plots. To resolve distance ambiguity, the Burst plot was expanded in the distance direction n times by the distance of ambiguity. As a result, it was duplicated into n instances, whereas the original Burst plot is a single entity. Therefore, a single Burst plot must ultimately be grouped into only one Dwell plot. If distance-expanded Burst plots are grouped into different Dwell plots, they are duplicated and incorrectly grouped. One can verify the Burst plots that were duplicated into n instances through distance expansion.

[0080] To resolve false positive case 2, one needs to identify duplicate Burst plots among Dwell plots. This is achieved by checking if there are duplicate Burst plot indices originating from the same Burst among the Dwell plots, and the duplicate detection process has been explained. The degree of proximity between the duplicated Burst plots and the Burst plots of the Dwell plot to which they belong is calculated. This degree of proximity is called the Cost, and only the Burst plot with the smallest Cost is retained; the rest are deemed duplicates and removed. Looking at the diagram, the concept of calculating the Cost of duplicated Burst plots has been described. The formula for calculating the Cost has been explained.

[0081] Calculate the average distance and velocity values ​​of non-overlapping burst plots, and determine the difference between the distance and velocity of overlapping burst plots. The degree of proximity between burst plots is represented by dividing the distance difference by the maximum distance value and the velocity difference by the maximum velocity value, and then summing the results. Burst plots that are clustered closer together are considered properly grouped, while those that are not are considered duplicates and are removed.

[0082] It demonstrates that if the number of Burst plots constituting the Dwell plot is less than 3 after removing duplicate Burst plots, the Dwell plot itself is removed. This concept is known as M of N, which determines that if the number of Burst plots constituting the Dwell plot is below a certain threshold, the Dwell plot is improperly formed and is removed entirely. M of N is an algorithm that already exists as a prior invention.

[0083] Conventional distance ambiguity processing groups objects based on proximity in distance and speed, which often results in unwanted misgrouping. This misgrouping leads to false positives and missed targets. In order to eliminate false positives in such distance ambiguity processing, the present invention developed two algorithms, False Detection 1 and False Detection 2. As a result, the false positive rate was successfully reduced.

[0084] Below, an exemplary computing device in which a distance ambiguity false detection removal device (200) can be implemented will be described in detail through FIG. 17.

[0086] FIG. 17 is a drawing of an exemplary computing device capable of implementing a device and / or system according to various embodiments of the present disclosure.

[0087] A computing device (1500) may include one or more processors (1510), a bus (1550), a communication interface (1570), a memory (1530) for loading a computer program (1591) executed by the processor (1510), and a storage (1590) for storing the computer program (1591). However, only components related to the embodiments of the present disclosure are illustrated in FIG. 17. Accordingly, a person skilled in the art to which the present disclosure belongs will understand that other general-purpose components may be included in addition to the components illustrated in FIG. 17.

[0088] The processor (1510) controls the overall operation of each component of the computing device (1500). The processor (1510) may be configured to include a CPU (Central Processing Unit), an MPU (Micro Processor Unit), an MCU (Micro Controller Unit), a GPU (Graphic Processing Unit), or any form of processor well known in the art of the present disclosure. Additionally, the processor (1510) may perform operations for at least one application or program for executing the method according to the embodiments of the present disclosure. The computing device (1500) may have one or more processors.

[0089] The memory (1530) stores various data, commands and / or information. The memory (1530) may load one or more programs (1591) from storage (1590) to execute a method according to embodiments of the present disclosure. The memory (1530) may be implemented as volatile memory such as RAM, but the technical scope of the present disclosure is not limited thereto.

[0090] The bus (1550) provides communication functions between components of the computing device (1500). The bus (1550) can be implemented as various types of buses, such as an address bus, a data bus, and a control bus.

[0091] The communication interface (1570) supports wired and wireless internet communication of the computing device (1500). Additionally, the communication interface (1570) may support various communication methods other than internet communication. To this end, the communication interface (1570) may be configured to include a communication module well known in the art of the present disclosure.

[0092] According to some embodiments, the communication interface (1570) may be omitted.

[0093] Storage (1590) can store one or more of the above programs (1591) and various data non-temporarily.

[0094] Storage (1590) may be configured to include non-volatile memory such as ROM (Read Only Memory), EPROM (Erasable Programmable ROM), EEPROM (Electrically Erasable Programmable ROM), flash memory, a hard disk, a removable disk, or any form of computer-readable recording medium well known in the art to which this disclosure belongs.

[0095] A computer program (1591) may include one or more instructions that cause a processor (1510) to perform a method / operation according to various embodiments of the present disclosure when loaded into memory (1530). That is, the processor (1510) may perform a method / operation according to various embodiments of the present disclosure by executing the one or more instructions.

[0096] Various embodiments of the present disclosure and effects according to those embodiments have been described with reference to FIGS. 1 to 17. The effects according to the technical concept of the present disclosure are not limited to those described above, and other unmentioned effects will be clearly understood by a person skilled in the art from the description in the specification.

[0097] The technical concept of the present disclosure, as described so far with reference to FIGS. 1 through 17, may be implemented as computer-readable code on a computer-readable medium. The computer-readable recording medium may be, for example, a removable recording medium (CD, DVD, Blu-ray disc, USB storage device, removable hard disk) or a fixed recording medium (ROM, RAM, computer-equipped hard disk). The computer program recorded on the computer-readable recording medium may be transmitted to another computing device via a network such as the Internet and installed on the other computing device, thereby being used on the other computing device.

[0098] In the foregoing, although all components constituting the embodiments of the present disclosure have been described as being combined or operating together, the technical concept of the present disclosure is not necessarily limited to such embodiments. That is, within the scope of the purpose of the present disclosure, all components may be selectively combined and operated in one or more ways.

[0099] Although operations are depicted in a specific order in the drawings, it should not be understood that the operations must be executed in the specific order depicted or in a sequential order, or that all depicted operations must be executed to obtain the desired result. In certain situations, multitasking and parallel processing may be advantageous. Furthermore, the separation of the various configurations in the embodiments described above should not be understood as a necessary separation, and it should be understood that the described program components and systems can generally be integrated together into a single software product or packaged into multiple software products.

[0100] Although embodiments of the present disclosure have been described above with reference to the attached drawings, those skilled in the art will understand that the present disclosure may be practiced in other specific forms without changing the technical concept or essential features thereof. Therefore, the embodiments described above should be understood as illustrative in all respects and not restrictive. The scope of protection of the present disclosure shall be interpreted by the claims below, and all technical concepts within the equivalent scope shall be interpreted as being included within the scope of rights of the technical concept defined by the present disclosure.

Claims

Claim 1 A method for removing distance false detections using a distance ambiguity processing false detection removal algorithm, comprising: a step of loading data from a radar; a step of preprocessing the loaded data; a step of processing distance ambiguity on the preprocessed data; a step of determining whether the ambiguity processing was performed normally; a step of setting a category for a false detection case if the ambiguity processing was not performed normally; and a step of removing false detections by utilizing at least one false detection removal algorithm corresponding to the set category. Claim 2 A method for removing distance false detections using a distance ambiguity processing false detection removal algorithm, wherein, in claim 1, the category regarding the false detection case includes at least one, and one of the categories is a case where the same Burst is duplicated and grouped into a Dwell plot, and another of the categories is a case where Burst plots generated from a target are grouped into a Dwell plot. Claim 3 A method for removing distance false detections using a distance ambiguity processing false detection removal algorithm, wherein, in the case where the same Burst is duplicated and grouped into a Dwell plot in paragraph 2, the false detection removal algorithm compares the distances between Burst plots and determines that Burst plots grouped within a certain distance are properly grouped, and removes Burst plots that are not. Claim 4 In paragraph 2, a method for removing distance false positives, wherein in the case where burst plots generated at a target are grouped into a dwell plot, the false positive removal algorithm is a distance ambiguity processing false positive removal algorithm that finds overlaps between dwell plots. Claim 5 A method for removing distance false detections using a distance ambiguity processing false detection removal algorithm, wherein, in the case where Burst plots generated at a target are grouped into a Dwell plot, the false detection removal algorithm calculates the distance between each duplicate Burst plot and the Burst plots of the Dwell plot to which it belongs, defines the degree of closeness based on the calculation as Cost, and removes the Burst plot with the smallest Cost while retaining the rest as duplicates. Claim 6 A method for removing distance false detections using a distance ambiguity processing false detection removal algorithm, wherein in the case where Burst plots generated at a target are grouped into a Dwell plot, the false detection removal algorithm calculates the average distance value and average velocity value of non-overlapping Burst plots, calculates the difference value from the distance and the difference value from the velocity of overlapping Burst plots, divides the difference value from the maximum distance value and the difference value from the maximum velocity value and adds them together to represent the degree of closeness between Burst plots, and if Burst plots are grouped closer, they are considered to be properly grouped, and Burst plots that are not considered to be overlapping are removed. Claim 7 A distance false detection removal device utilizing a distance ambiguity processing false detection removal algorithm, comprising: a processor; a network interface; a memory; and a computer program loaded into the memory and executed by the processor, wherein the processor performs the following: an instruction to load data from a radar; an instruction to preprocess the loaded data; an instruction to process distance ambiguity on the preprocessed data; an instruction to determine whether the ambiguity processing was performed normally; an instruction to set a category for a false detection case if the ambiguity processing was not performed normally; and an instruction to remove false detections by utilizing at least one false detection removal algorithm corresponding to the set category. Claim 8 A distance false detection removal device utilizing a distance ambiguity processing false detection removal algorithm, wherein, in claim 7, the categories regarding the false detection cases include at least one, and one of the categories is a case where the same Burst is duplicated and grouped into a Dwell plot, and another of the categories is a case where Burst plots generated at a target are grouped into a Dwell plot. Claim 9 A distance false detection removal device utilizing a distance ambiguity processing false detection removal algorithm, wherein, in the case where the same Burst is duplicated and grouped into a Dwell plot, the false detection removal algorithm compares the distances between Burst plots and determines that Burst plots grouped within a certain distance are properly grouped, and removes Burst plots that are not. Claim 10 A distance false detection removal device utilizing a distance ambiguity processing false detection removal algorithm, wherein, in the case where burst plots generated at a target are grouped into a dwell plot, the false detection removal algorithm is an algorithm that finds overlaps between burst plots. Claim 11 A distance false detection removal device utilizing a distance ambiguity processing false detection removal algorithm, wherein in the case where Burst plots generated at a target are grouped into a Dwell plot, the false detection removal algorithm calculates the distance between each duplicate Burst plot and the Burst plots of the Dwell plot to which it belongs, defines the degree of closeness according to the calculation as Cost, and removes the Burst plot determined to be duplicated while keeping only the Burst plot with the smallest Cost. Claim 12 A distance false detection removal device utilizing a distance ambiguity processing false detection removal algorithm, wherein in the case where Burst plots generated at a target are grouped into a Dwell plot, the false detection removal algorithm calculates the average distance value and average speed value of non-overlapping Burst plots, calculates the difference value from the distance and the difference value from the speed of overlapping Burst plots, divides the distance difference value by the maximum distance value and the speed difference value by the maximum speed value and adds the result to indicate the degree of closeness between Burst plots, and if Burst plots are grouped closer, they are considered to be properly grouped, and Burst plots that are not considered to be overlapping are removed.