CN111126042A - VIN (vehicle identification number) code verification method by using confidence coefficient, and VIN code identification method and device - Google Patents
VIN (vehicle identification number) code verification method by using confidence coefficient, and VIN code identification method and device Download PDFInfo
- Publication number
- CN111126042A CN111126042A CN201911345335.6A CN201911345335A CN111126042A CN 111126042 A CN111126042 A CN 111126042A CN 201911345335 A CN201911345335 A CN 201911345335A CN 111126042 A CN111126042 A CN 111126042A
- Authority
- CN
- China
- Prior art keywords
- verified
- vin
- vin code
- verification
- code
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Detection And Correction Of Errors (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention provides a VIN code verification method, a VIN code identification method and a VIN code identification device by utilizing confidence coefficient. The VIN code checking method using the confidence coefficient comprises the following steps: acquiring a VIN code to be verified through identification; obtaining the confidence coefficient of the VIN code to be verified, and verifying the VIN code to be verified by using a first verification method; and if the confidence coefficient of the VIN code to be verified passes the confidence coefficient verification and the initial verification result of the first verification method is verification passing, judging that the VIN code to be verified passes the verification. By the scheme, the verification accuracy and the identification accuracy of the VIN code can be improved.
Description
Technical Field
The invention relates to the technical field of intelligent traffic, in particular to a VIN (vehicle identification number) code verification method and a VIN code identification method and device by utilizing confidence coefficient.
Background
The VIN code (Vehicle Identification Number or frame Number) is a seventeen-digit string composed of numbers and english letters, is used for a unique set of numbers on an automobile, and can be used for identifying information such as manufacturer, engine, chassis serial Number and other performances of the automobile. To avoid confusion with the 1, 0, 9 digits, I, O, Q in the english alphabet is not used in the VIN code. Meanwhile, the 10 th model year of the VIN code does not use the I, O, Q, and does not use Z, U and 0.
The VIN code encoding rules are mainly of two types, the first is the ISO3779 standard adopted by the european union, and the second is the north american standard. While the north american standard is more stringent than the ISO3779 standard adopted by the european union, the two standards may also be compatible with each other. The two specifications for VIN codes are specified in the following table:
TABLE 1 Difference between the EU ISO3779 standard and the North American standard for VIN codes
Therefore, the VIN code of the automobile is verified according to the VIN code coding rule, and the legality and the vehicle information of the automobile can be obtained. The existing VIN code checking method comprises IOQ judgment (suitable for ISO3779 standard and North American standard), checking of 9 th check digit rule (suitable for North American standard), checking of 10 th vehicle model year (suitable for North American standard), checking of 12-17 sequence number digit (suitable for ISO3779 standard) and the like.
Due to the diversity of the combination of numbers and letters, the accuracy of IOQ judgment, 10 th vehicle model year check and 12-17 serial number check is low.
In the conventional verification method, the 9 th parity bit rule with the strongest verification rule determines whether the remainder obtained by dividing the weighted calculation result of the 1 st bit to the 17 th bit of the VIN code by 11 is 9. If a certain letter or number of the 1 st bit to the 17 th bit of the VIN code is wrong, if the corresponding values of the original correct letter and the recognized wrong letter on the certain bit are the same, the weighting calculation result is also the same, which may cause the VIN code with the recognition error to pass the verification, resulting in a wrong verification result.
Therefore, the existing checking method is easy to have the problem of checking error that the checking error passes or fails, so that the error identification is caused, and the error identification rate is as high as 10%.
Disclosure of Invention
The invention provides a VIN code verification method, a VIN code identification method and a VIN code identification device by utilizing confidence coefficient, which are used for reducing the verification error rate and the false identification rate of VIN codes so as to improve the verification accuracy and the identification accuracy.
In order to achieve the purpose, the invention is realized by adopting the following scheme:
in a first aspect, a method for checking a VIN code with confidence is provided, including: acquiring a VIN code to be verified through identification; acquiring the confidence coefficient to be verified, and verifying the VIN code to be verified by using a first verification method; and if the confidence coefficient of the VIN code to be verified passes the confidence coefficient verification and the initial verification result of the first verification method is verification passing, judging that the VIN code to be verified passes the verification.
In a second aspect, a VIN code identification method is provided, including: the VIN code verification method using the confidence coefficient is adopted, and the verified VIN code to be verified is output.
In a third aspect, an electronic device is provided, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the steps of the method according to the foregoing embodiments when executing the program.
In a fourth aspect, a computer-readable storage medium is provided, on which a computer program is stored, which when executed by a processor implements the steps of the method described in the embodiments above.
The VIN code verification method and the VIN code identification method and device using the confidence coefficient increase the confidence coefficient verification of the VIN code to be verified on the basis of using the VIN code verification method to verify the VIN code, so that the verification of the VIN code to be verified is completed, the verification error caused by the diversity of the combination of the numbers and the letters can be avoided, and the verification error possibly caused when one or more English letters and numbers of the VIN code are identified or input in error can be avoided, so that the error rate of the VIN code verification and the error rate of the VIN code identification can be greatly reduced, and the verification accuracy and the identification accuracy are improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts. In the drawings:
fig. 1 is a flowchart illustrating a VIN code verification method using confidence level according to an embodiment of the present invention;
fig. 2 is a flowchart illustrating a VIN code verification method using confidence level according to another embodiment of the present invention;
fig. 3 is a flowchart illustrating an embodiment of a VIN code dictionary repository checking method.
Fig. 4 is a flowchart illustrating an embodiment of a VIN code dictionary repository checking method.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the embodiments of the present invention are further described in detail below with reference to the accompanying drawings. The exemplary embodiments and descriptions of the present invention are provided to explain the present invention, but not to limit the present invention.
In order to reduce the error rate of VIN code verification, the embodiment of the invention provides a VIN code verification method utilizing confidence coefficient, on the basis of using the VIN code verification method to perform VIN code verification, the confidence coefficient verification of the VIN code to be verified is increased, so that the verification of the VIN code to be verified is completed, the verification error caused by the diversity of the combination of numbers and letters can be avoided, and the verification error possibly caused by the recognition error or the recording error of one or more English letters and numbers of the VIN code can be avoided, therefore, the error rate of VIN code verification and the error rate of VIN code recognition can be greatly reduced, and the verification accuracy and the recognition accuracy are improved.
Fig. 1 is a VIN code verification method using confidence level according to an embodiment of the present invention. Referring to fig. 1, the VIN code verification method using confidence level according to some embodiments, completing verification of the to-be-verified VIN code based on the confidence level verification and a VIN code verification method, may include the following steps S1 to S3. Specific embodiments of steps S1 through S3 will be described in detail below.
Step S1: acquiring a VIN code to be verified through identification;
step S2: obtaining the confidence coefficient of the VIN code to be verified, and verifying the VIN code to be verified by using a first verification method;
step S3: and if the confidence coefficient of the VIN code to be verified passes the confidence coefficient verification and the initial verification result of the first verification method is verification passing, judging that the VIN code to be verified passes the verification.
In step S1, the to-be-verified VIN code is obtained through identification, and generally, an original picture is obtained first (for example, a photograph is directly taken as the original picture, or the original picture is extracted from a video stream), and then the original picture is identified, so as to obtain the to-be-verified VIN code. Therefore, the verification result depends on the identified VIN code to be verified. The higher the recognition accuracy, the higher the referential of the verification result and vice versa. Therefore, some embodiments of the present invention introduce a confidence level judgment mechanism, and improve the accuracy of VIN code verification and reduce the error rate of VIN code verification by judging the confidence level of the VIN code to be verified. Some embodiments of the present invention increase the confidence level check of the VIN code to be checked on the basis of using a VIN code check method to perform the VIN code check, so as to complete the check of the VIN code to be checked, which does not cause a check error due to the diversity of combinations of numbers and letters, and does not cause a check error when one or several english letters and numbers of the VIN code are recognized incorrectly or input incorrectly, and therefore, the error rate of the VIN code check and the error rate of the VIN code recognition can be greatly reduced, thereby improving the check accuracy and the recognition accuracy.
In step S2, the confidence level of the VIN code to be verified may be obtained by using the existing method for obtaining the confidence level value of OCR recognition, and therefore details are not repeated. The first verification method is described in detail later.
In step S3, when the VIN code to be verified passes the confidence level verification, it is indicated that the reliability of the identification result of the VIN code to be verified is strong. And verifying the VIN code to be verified with stronger reliability by using the first verification method, wherein the obtained initial verification result is that the VIN code to be verified passes the verification of the VIN code verification method by using the confidence coefficient.
The VIN code verification method utilizing the confidence coefficient of the embodiment of the invention judges whether the identification result of the VIN code to be verified is reliable or not based on the confidence coefficient verification, and verifies whether the VIN code to be verified is the correct VIN code or not by the first verification method, thereby greatly reducing the error rate of VIN code verification and effectively improving the verification accuracy.
In some embodiments, the step S3 specifically includes determining that the confidence of the VIN code to be verified passes the confidence verification if the confidence of the VIN code to be verified is greater than or equal to the confidence threshold. Obviously, the greater the confidence value of the VIN code to be verified is, the greater the probability that the identification of the VIN code to be verified as the identification result is correct is. Therefore, in step S3, when the confidence of the VIN code to be verified is greater than or equal to the confidence threshold, it may be determined that the VIN code to be verified obtained by the current identification is correct. After the correct VIN code to be verified is identified and verified by the first verification method, the VIN code to be verified can be judged to pass the verification of the VIN code verification method utilizing the confidence coefficient.
Considering that there may be a misjudgment situation through only one confidence judgment, in further embodiments, the VIN code to be checked is determined by the number of confidence judgments. Here, referring to fig. 2, the step S3 specifically includes:
s31: if the confidence of the VIN codes to be verified is greater than or equal to a confidence threshold, judging whether a cache space for storing the VIN codes to be verified is full;
s32: if the cache space is not full, caching the VIN code to be verified in the cache space, and continuously acquiring the VIN code to be verified through identification;
s33: if the cache space is full, judging whether at least two identical VIN codes to be checked exist in the cache space;
s34: and under the condition that at least two identical VIN codes to be verified exist in the cache space, judging that the confidence coefficient of the VIN codes to be verified passes the confidence coefficient verification.
Through the steps, all the to-be-verified VIN codes with the confidence degrees larger than or equal to the confidence degree threshold value are stored in the cache space, namely, all the to-be-verified VIN codes stored in the cache space are judged by the confidence degrees and are the to-be-verified VIN codes with reliable identification results, then, whether at least two identical VIN codes exist is judged in the to-be-verified VIN codes, if at least two identical VIN codes exist, the to-be-verified VIN codes obtained by at least two times of reliable identification results are identical in the identification process, at the moment, the confidence degree of the to-be-verified VIN codes is judged to be larger than or equal to the confidence degree threshold value, and the reliability of the confidence degree verification is improved.
Considering that the number of the to-be-verified VIN codes that can be stored in the cache space is limited, when the cache space is full, the newly identified to-be-verified VIN codes cannot be cached continuously, and if at least two identical to-be-verified VIN codes still do not exist in the cache space at this time, it is determined that the confidence of the to-be-verified VIN codes is smaller than the confidence threshold, so that the verification fails. In order to improve the check passing rate, some preferred embodiments of the present invention further introduce a mechanism for updating the cache space, and refer to fig. 2, specifically include the following steps:
step S35: replacing the stored VIN codes to be verified in the cache space with the VIN codes to be verified under the condition that at least two identical VIN codes to be verified do not exist in the cache space, so as to update the cache space;
step S36: and under the condition that at least two identical VIN codes to be verified exist in the updated cache space, judging that the VIN codes to be verified pass confidence verification.
Through the steps, the updating of the cache space is realized, and the newly identified VIN code to be verified can be used for replacing the VIN code to be verified stored in the cache space under the condition that the cache space is full, so that the verification of the VIN code to be verified can be completed in the updated cache space.
The specific update mechanism of the cache space may be established according to specific identification requirements. For example, in view of simplicity and convenience of an update mechanism, the VIN code to be checked cached earliest in the cache space may be replaced with the VIN code to be checked. Or continuing to judge whether the confidence of the VIN codes to be verified is greater than the minimum of the confidence of all the VIN codes to be verified stored in the cache space from the perspective of the confidence; if the confidence coefficient of the VIN codes to be verified is greater than the minimum value of the confidence coefficients of all the VIN codes to be verified stored in the cache space, calculating the number of the VIN codes to be verified with the minimum confidence coefficient stored in the cache space; replacing the VIN code to be verified with the minimum confidence coefficient in the cache space when the number of the VIN code to be verified with the minimum confidence coefficient stored in the cache space is 1; and when the number of the VIN codes to be verified with the minimum confidence coefficient stored in the cache space is more than 1, replacing any VIN code to be verified with the minimum confidence coefficient or all the VIN codes to be verified with the minimum confidence coefficient in the cache space with the VIN code to be verified. If the confidence of the VIN codes to be verified is equal to the minimum of the confidence of all the VIN codes to be verified stored in the cache space, the VIN codes to be verified with the minimum confidence stored in the cache space may be replaced by the VIN codes to be verified, or may not be replaced.
As shown in step S3, in step S34 and step S36, if the VIN code to be verified passes the confidence level check, if the initial verification result of the first verification method is that the verification is passed, it is determined that the VIN code to be verified passes the verification. The first verification method used in step S2 of the embodiment of the present invention may be a VIN code dictionary library verification method, or may be an existing VIN code verification method, such as one of an IOQ determination method, a 9 th-bit verification method, a 10 th-bit vehicle model year verification method, and a 12 th-17 th-bit verification method. Even if the first verification method is one of the existing VIN code verification methods, since a confidence judgment mechanism is added in the embodiment of the invention, the identification accuracy of the VIN code to be verified obtained by identification can be judged, so that a verification error caused by the diversity of the combination of the numbers and the letters can be avoided, and a verification error possibly caused by the recognition error or the entry error of one or more English letters and numbers of the VIN code can be avoided, therefore, the verification error rate of the VIN code to be verified can be greatly reduced, and the verification accuracy of the VIN code to be verified can be improved.
As shown in fig. 3, the VIN code dictionary library checking method specifically includes:
step S110: extracting a character string to be checked from the first eight bits of the VIN code to be checked;
in the embodiment of the present invention, the character string to be checked refers to a character string with a length greater than or equal to 1 extracted from the first eight bits of the VIN code to be checked. The length of the character string to be checked is the number of characters contained in the character string to be checked. And if the length of the character string to be verified is 1, the character string to be verified is a single character. And if the length of the character string to be checked is more than 1 and less than 8, the character string to be checked is a character string consisting of a plurality of continuous-bit characters extracted from the first eight bits of the VIN code to be checked. And if the length of the character string to be checked is equal to 8, the character string to be checked is a character string consisting of the first eight-bit characters extracted from the VIN code to be checked. That is to say, the string to be verified is a string starting from the A1 th bit to the A2 th bit of the VIN code to be verified, and both A1 and A2 are positive integers from 1 to 8, as long as A2 ≧ A1 is satisfied.
In specific implementation, the rules for extracting the characters to obtain the character string to be verified can be preset or randomly selected from various possible rules. For example, in order to completely eliminate the influence of diversification of numbers and letter combinations, or to maximally avoid that one or several english alphabets and numbers of the VIN code pass through a verification error possibly caused by a recognition error or an entry error, preferably, the length of the character string to be verified is equal to 8, and step S110 specifically includes extracting the first eight bits of the VIN code to be verified as the character string to be verified.
In a one-time verification process, step S110 may be executed only once to extract one to-be-verified character string, or step S110 may be executed once to extract two or more to-be-verified character strings with different lengths, or step S110 may be executed at least twice to extract two or more to-be-verified character strings with different lengths.
Step S120: and judging whether the character string to be checked is the same as the regular character string in the dictionary library.
Step S130: and under the condition that the character string to be verified is the same as at least one rule character string, judging that the initial verification result is pass verification.
The rule character string is a character string established based on VIN code encoding rules. The VIN code encoding rule is an encoding rule made for characters at each character position in the VIN code. In other words, each character position in a correct VIN code has its corresponding encoding rule. Based on this, the dictionary database based on the embodiment of the present invention includes at least one regular character string, where the regular character string is a character string that conforms to the VIN code encoding rule and specifies a corresponding character position of the regular character string in the VIN code.
Since the regular character string in the embodiment of the present invention is used for verifying the character string to be verified, the length of the regular character string is greater than or equal to 1 and less than or equal to 8, and therefore, the length of the regular character string is also greater than or equal to 1 and less than or equal to 8. The length of the regular character string is the number of characters contained in the regular character string. The rule character string may be a character string that conforms to the VIN code encoding rule and specifies a continuous character string from the beginning of the B1 th bit to the end of the B2 th bit, and B1 and B2 may be positive integers from 1 to 8 as long as B2 ≧ B1 is satisfied. The regular character string in the dictionary database may be a character string directly obtained according to the VIN code encoding rule, or a character string extracted from a correct VIN code.
The comparison between the regular character string in the dictionary database and the character string to be verified is a key step for completing the verification of the VIN code to be verified, and the character string to be verified is a key element for judging the authenticity of the VIN code to be verified. Therefore, how to set the rule character strings in the dictionary base is a key problem for completing the verification of the VIN code to be verified.
In a possible embodiment, the lengths of the regular character strings included in the dictionary database may be the same or different. In order to facilitate the verification of the character strings to be verified, the regular character strings in the dictionary database are classified. The dictionary repository may include at least one dictionary sub-repository including at least one of the rule strings. In some embodiments, the step S120 is specifically: and judging whether the character string to be checked is the same as the regular character string in at least one dictionary sub-library.
Meanwhile, the different dictionary sub-libraries can be respectively used for storing regular character strings with different rule characteristics. The lengths of the regular character strings in different dictionary sub-libraries can be the same or different, and the lengths of the regular character strings in the same dictionary sub-library can also be the same or different. Similarly, the same dictionary sub-library may also be used to store regular character strings with the same rule characteristic, for example, the dictionary sub-library may be divided according to different license plate types, or the dictionary sub-library may be divided according to the length of the regular character string and the character position of the regular character string in the VIN code encoding rule.
In order to facilitate the judgment of whether the character string to be checked is the same as a regular character string, the lengths of all the regular character strings in any dictionary sub-library are the same. And under the condition that the length of the regular character string in the dictionary sub-library is equal to that of the character string to be verified, and the character position of the regular character string in the dictionary sub-library in the VIN code encoding rule is the same as that of the character string to be verified in the VIN code to be verified, the dictionary sub-library is a target dictionary sub-library of the character string to be verified. Referring to fig. 4, in another embodiment of the present invention, the step of determining whether the character string to be verified is the same as a regular character string in at least one dictionary sub-library specifically includes: step S1201, determining at least one target dictionary sub-library according to the length of the character string to be verified and the character position of the character string to be verified in the VIN code to be verified; step S1202, determining whether the character string to be verified is the same as the regular character string in the target dictionary sub-library.
In the case that the lengths of all the regular character strings in any one of the dictionary sub-libraries are the same, the lengths of the stored regular character strings and the character positions of the regular character strings in the VIN code encoding rules can be added to each dictionary sub-library in advance as marks, the target dictionary sub-library can be determined by comparing the lengths of the character strings to be checked with the marks of the lengths of the regular character strings in each dictionary sub-library and comparing the character positions of the character strings to be checked in the VIN code to be checked with the marks of the character positions of the regular character strings in the VIN code encoding rules in each dictionary sub-library, for example, when the first eight bits of the VIN code to be checked are extracted as the character strings to be checked, the target dictionary sub-library can be confirmed by searching the dictionary sub-libraries with the lengths of 8 and the character position marks of the 1 st bit to the 8 th bit.
In the step S1202, if the character string to be verified is the same as the regular character string in the target dictionary sub-library, it is determined that the VIN code to be verified, from which the character string to be verified is extracted, passes the verification of the VIN code dictionary library verification method, and it is determined that the initial verification result is verification pass; if the character string to be verified is different from all the regular character strings in the target dictionary sub-library, judging that the VIN code to be verified for extracting the character to be verified does not pass the verification of the VIN code dictionary library verification method, and judging that the initial verification result is verification failure.
In the embodiments, the dictionary database is divided into two or more dictionary sub-databases, a target dictionary sub-database is accurately determined from the dictionary sub-database according to the length of the character string to be verified and the character position of the character string in the VIN code to be verified, and then whether the target dictionary sub-database contains the character string to be verified is determined, so that whether the character string to be verified is the same as the regular character string in the target dictionary sub-database is determined, and whether the VIN code to be verified passes verification of the VIN code dictionary database verification method is determined according to the determination result, so that the determination range of the regular character string can be narrowed, and the VIN code verification efficiency can be improved.
And judging whether the character string to be checked is the same as the regular character string in the dictionary base, and actually comparing the characters in the character string to be checked with the characters in the regular character string in the dictionary base one by one. After comparison, if the character string to be verified is completely the same as one of the regular character strings in the dictionary library, the character string to be verified is considered to be the same as one of the regular character strings in the dictionary library, the character string to be verified is considered to conform to the provision of the VIN code encoding rule for the corresponding character position of the character string to be verified in the VIN code, and the extracted VIN code to be verified of the character string to be verified is judged to pass the verification of the VIN code dictionary library verification method; otherwise, the character string to be verified is considered to be different from all the regular character strings in the dictionary library, the character string to be verified is considered to be not in accordance with the regulation of the VIN code encoding rule on the corresponding character position of the character string to be verified in the VIN code, and the VIN code to be verified of the extracted character string to be verified does not pass the verification of the VIN code dictionary library verification method.
According to the VIN dictionary base checking method, the checking of the VIN code to be checked is realized based on the comparison between the regular character string in the dictionary base and the character string to be checked extracted from the VIN code to be checked, the checking is not carried out according to specific numbers and letters, and the checking is not required according to the calculation result of a specific formula, so that the checking errors caused by the diversity of the numbers and the letters can be avoided, and the problem that the checking passes possibly caused by the recognition error of the letter on a certain position can be solved, therefore, the VIN code checking error rate can be reduced and the checking accuracy can be improved through the scheme of the embodiment.
Considering that the VIN code encoding rule is added with a new encoding rule after a certain period of time, the dictionary database in the embodiment of the invention has the possibility that the rule character string conforming to the newly added VIN code encoding rule cannot be added in time, and an updating mechanism of the dictionary database is established. In some embodiments, the VIN code dictionary checking method further includes: and storing the character string to be checked in the dictionary database so as to update the dictionary database. More specifically, it may include: storing the character string to be verified and the VIN code to be verified in a first temporary dictionary library; and under the condition that the character string to be verified in the first temporary dictionary library accords with the VIN code encoding rule of the corresponding character position, and/or under the condition that the VIN code to be verified in the first temporary dictionary library accords with the VIN code encoding rule, storing the character string to be verified in the dictionary library. In some embodiments, the character string to be verified may be stored in the dictionary library only when the character string to be verified in the first temporary dictionary library conforms to the VIN code encoding rule of the corresponding character position, or the character string to be verified may be stored in the dictionary library only when the VIN code to be verified in the first temporary dictionary library conforms to the VIN code encoding rule, or the character string to be verified may be stored in the dictionary library only when the character string to be verified in the first temporary dictionary library conforms to the VIN code encoding rule of the corresponding character position and the VIN code to be verified in the first temporary dictionary library conforms to the VIN code encoding rule. The VIN code encoding rule includes an original VIN code encoding rule and a newly added VIN code encoding rule. Or, only the VIN code to be checked may be stored in a second temporary dictionary library; and under the condition that the VIN code to be verified in the second temporary dictionary database accords with the VIN code encoding rule, storing the character string to be verified in the dictionary database as a rule character string.
The first temporary dictionary bank and the second temporary dictionary bank are used for temporarily storing the verified VIN codes to be verified and/or the character strings to be verified corresponding to the verified VIN codes, and after comparing the character strings to be verified and/or the VIN codes to be verified with the original VIN code coding rules and the updated VIN code coding rules, the character strings to be verified corresponding to the character positions corresponding to the VIN code coding rules or the character strings to be verified corresponding to the VIN codes to be verified according with the VIN code coding rules are stored in the dictionary bank so as to complete the updating of the dictionary bank, so that the dictionary bank can more accurately complete the verification of the VIN codes to be verified.
In addition, it should be noted that the step numbers used in the above embodiments are only used for facilitating the reading of the specification by the person skilled in the art, and are not used for limiting the order of the steps, nor are they used for limiting that a step must be simultaneously present in one embodiment, and the steps included in a certain embodiment and the order between the steps must be determined by the description of the related terms of the embodiments and the relationship between the steps.
In addition, the embodiment of the invention also provides a VIN code identification method, which comprises the above-mentioned VIN code verification method utilizing confidence coefficient, and outputs the verified VIN code to be verified.
Meanwhile, the embodiment of the invention also provides electronic equipment, which comprises a memory, a processor and a computer program which is stored on the memory and can run on the processor, wherein the steps of the method of the embodiments are realized when the processor executes the program. The electronic device may also include other hardware components of prior art credential identification devices, such as a camera, a credential placement component, and the like.
In addition, the embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the steps of the method described in the above embodiments.
In summary, the VIN code verification method, the VIN code identification method and the device using the confidence coefficient according to the embodiments of the present invention complete the verification of the VIN code to be verified based on the confidence coefficient of the VIN code to be verified and the original VIN code verification method, and thus, a verification error due to the diversity of the combinations of the numbers and the letters is avoided, and a verification error possibly caused when one or several english letters and numbers in the VIN code are recognized incorrectly or input incorrectly is avoided, so that the error rate of VIN code verification and the error rate of VIN code identification can be greatly reduced, thereby improving the verification accuracy and the identification accuracy.
Claims (10)
1. A VIN code verification method using confidence coefficient is characterized by comprising the following steps:
acquiring a VIN code to be verified through identification;
obtaining the confidence coefficient of the VIN code to be verified, and verifying the VIN code to be verified by using a first verification method;
and if the confidence coefficient of the VIN code to be verified passes the confidence coefficient verification and the initial verification result of the first verification method is verification passing, judging that the VIN code to be verified passes the verification.
2. The method of claim 1, wherein the confidence level of the VIN code to be checked passes the confidence level check, specifically comprising:
if the confidence of the VIN codes to be verified is greater than or equal to a confidence threshold, judging whether a cache space for storing the VIN codes to be verified is full;
if the cache space is not full, caching the VIN code to be verified in the cache space, and continuously acquiring the VIN code to be verified through identification;
if the cache space is full, judging whether at least two identical VIN codes to be checked exist in the cache space;
and under the condition that at least two identical VIN codes to be verified exist in the cache space, judging that the confidence coefficient of the VIN codes to be verified passes the confidence coefficient verification.
3. The method of claim 2, further comprising:
replacing the stored VIN codes to be verified in the cache space with the VIN codes to be verified under the condition that at least two identical VIN codes to be verified do not exist in the cache space, so as to update the cache space;
and under the condition that at least two identical VIN codes to be verified exist in the updated cache space, judging that the VIN codes to be verified pass confidence verification.
4. The method of claim 3, wherein replacing the stored VIN codes to be verified in the buffer space with the VIN codes to be verified comprises:
replacing the earliest cached VIN code to be verified in the cache space with the VIN code to be verified;
or
Judging whether the confidence coefficient of the VIN codes to be verified is larger than the minimum value of the confidence coefficients of all the VIN codes to be verified stored in the cache space;
if the confidence coefficient of the VIN codes to be verified is greater than the minimum value of the confidence coefficients of all the VIN codes to be verified stored in the cache space, calculating the number of the VIN codes to be verified with the minimum confidence coefficient stored in the cache space;
if the number of the VIN codes to be verified with the minimum confidence coefficient stored in the cache space is 1, replacing the VIN codes to be verified with the minimum confidence coefficient in the cache space by the VIN codes to be verified;
if the number of the to-be-verified VIN codes with the minimum confidence coefficient stored in the cache space is larger than 1, replacing any one of the to-be-verified VIN codes with the minimum confidence coefficient in the cache space with the to-be-verified VIN code, or replacing all the to-be-verified VIN codes with the minimum confidence coefficient in the cache space with the to-be-verified VIN code.
5. The method of claim 1, wherein the confidence level of the VIN code to be checked passes the confidence level check, specifically comprising: and if the confidence coefficient of the VIN code to be verified is greater than or equal to the confidence coefficient threshold value, judging that the confidence coefficient of the VIN code to be verified passes the confidence coefficient verification.
6. The method of any one of claims 1-5, further comprising: and outputting the confidence degree of the VIN code to be verified which passes the verification.
7. The method as claimed in any one of claims 1 to 5, wherein the first verification method is one of a VIN dictionary library verification method, an IOQ judgment method, a 9 th bit verification method, a 10 th bit vehicle model year verification method and 12 th to 17 th bit verification methods.
8. A VIN code identification method, comprising the VIN code verification method using confidence level according to any one of claims 1 to 7, and outputting the VIN code to be verified that passes the verification.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the method according to any of claims 1 to 8 are implemented when the processor executes the program.
10. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911345335.6A CN111126042B (en) | 2019-12-24 | 2019-12-24 | VIN code verification method and VIN code identification method and device using confidence |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911345335.6A CN111126042B (en) | 2019-12-24 | 2019-12-24 | VIN code verification method and VIN code identification method and device using confidence |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111126042A true CN111126042A (en) | 2020-05-08 |
| CN111126042B CN111126042B (en) | 2023-06-27 |
Family
ID=70501825
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911345335.6A Active CN111126042B (en) | 2019-12-24 | 2019-12-24 | VIN code verification method and VIN code identification method and device using confidence |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111126042B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11921575B1 (en) * | 2017-09-22 | 2024-03-05 | United Services Automobile Association (Usaa) | Systems and methods for verifying vehicle identification number (VIN) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6259354B1 (en) * | 1998-09-01 | 2001-07-10 | Fdi Consulting, Inc. | System and methods for vehicle identification number validation |
| US20100192044A1 (en) * | 2007-07-18 | 2010-07-29 | Dong Bai | Qc-ldpc code decoder and corresponding decoding method |
| US20130198167A1 (en) * | 2012-01-30 | 2013-08-01 | Thomas J. Sullivan | System, method and computer program product for decoding vehicle identification numbers |
| US20130297099A1 (en) * | 2012-05-02 | 2013-11-07 | Toyota Motor Engineering & Manufacturing North America, Inc. | Dynamic geometry support for vehicle components |
| US9405988B2 (en) * | 2013-08-13 | 2016-08-02 | James Alves | License plate recognition |
| DE102018120655A1 (en) * | 2017-08-25 | 2019-02-28 | Ford Global Technologies, Llc | AUTHENTICATION OF VEHICLE TO VEHICLE COMMUNICATIONS |
| CN109447076A (en) * | 2018-09-20 | 2019-03-08 | 上海眼控科技股份有限公司 | A kind of vehicle VIN code recognition detection method for vehicle annual test |
| CN110110162A (en) * | 2018-01-30 | 2019-08-09 | 江苏迪纳数字科技股份有限公司 | A method of VIN code is verified by VIN code check position standard weighting algorithm |
-
2019
- 2019-12-24 CN CN201911345335.6A patent/CN111126042B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6259354B1 (en) * | 1998-09-01 | 2001-07-10 | Fdi Consulting, Inc. | System and methods for vehicle identification number validation |
| US20100192044A1 (en) * | 2007-07-18 | 2010-07-29 | Dong Bai | Qc-ldpc code decoder and corresponding decoding method |
| US20130198167A1 (en) * | 2012-01-30 | 2013-08-01 | Thomas J. Sullivan | System, method and computer program product for decoding vehicle identification numbers |
| US20130297099A1 (en) * | 2012-05-02 | 2013-11-07 | Toyota Motor Engineering & Manufacturing North America, Inc. | Dynamic geometry support for vehicle components |
| US9405988B2 (en) * | 2013-08-13 | 2016-08-02 | James Alves | License plate recognition |
| DE102018120655A1 (en) * | 2017-08-25 | 2019-02-28 | Ford Global Technologies, Llc | AUTHENTICATION OF VEHICLE TO VEHICLE COMMUNICATIONS |
| CN110110162A (en) * | 2018-01-30 | 2019-08-09 | 江苏迪纳数字科技股份有限公司 | A method of VIN code is verified by VIN code check position standard weighting algorithm |
| CN109447076A (en) * | 2018-09-20 | 2019-03-08 | 上海眼控科技股份有限公司 | A kind of vehicle VIN code recognition detection method for vehicle annual test |
Non-Patent Citations (1)
| Title |
|---|
| 邹伟: ""车辆实时监控管理系统研究与实现"" * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11921575B1 (en) * | 2017-09-22 | 2024-03-05 | United Services Automobile Association (Usaa) | Systems and methods for verifying vehicle identification number (VIN) |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111126042B (en) | 2023-06-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8849841B2 (en) | Memory circuit for Aho-corasick type character recognition automaton and method of storing data in such a circuit | |
| CN105718502B (en) | Method and apparatus for efficient feature matching | |
| US6640294B2 (en) | Data integrity check method using cumulative hash function | |
| US8255701B2 (en) | File encryption method | |
| US8532988B2 (en) | Searching for symbol string | |
| WO2016124070A1 (en) | Data processing method and device | |
| CN110825857A (en) | Multi-turn question and answer identification method and device, computer equipment and storage medium | |
| CN112307747A (en) | Vehicle accessory retrieval method and device, computer equipment and readable storage medium | |
| CN111126042B (en) | VIN code verification method and VIN code identification method and device using confidence | |
| CN116127953A (en) | Chinese spelling error correction method, device and medium based on contrast learning | |
| CN111797217A (en) | Information query method based on FAQ matching model and related equipment thereof | |
| US9740720B2 (en) | Secure and lossless data compression | |
| US7373525B2 (en) | Data processing method and data checking method | |
| US9083381B2 (en) | Method of determining at least one parameter of an error-correcting code implemented on transmission, corresponding device and computer program | |
| CN113128504A (en) | OCR recognition result error correction method and device based on verification rule | |
| JP2875053B2 (en) | How to update registered fingerprint feature points | |
| CN111126044B (en) | VIN code multiple verification method and VIN code identification method and device using confidence | |
| CN111126043B (en) | VIN code multiple checking method, VIN code identification method and device | |
| CN111126041B (en) | VIN code dictionary base checking method, VIN code identification method and device | |
| CN111063394B (en) | Method, system and medium for quickly searching and constructing library of species based on gene sequence | |
| CN111079415B (en) | Chinese automatic error checking method based on collocation conflict | |
| CN116757158A (en) | Data management method based on semiconductor storage | |
| CN115982310A (en) | Link table generation method with verification function and electronic equipment | |
| TWM620558U (en) | String matching system | |
| CN114117112B (en) | Universal text picture duplicate checking method, storage medium and processing equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |