System for efficiently realizing accurate management of massive litigation cases

Abstract

The invention provides a system for efficiently and accurately managing massive litigation cases. The system comprises a litigation case management platform login module and a litigation case uploading and storing module, the litigation case management platform login module is used for logging in the litigation case management platform; and the litigation case uploading and storage module is used for uploading the collected case pictures to the litigation case management platform for storage after logging in the litigation case management platform. According to the invention, the security management platform can be safely logged in, and the security of the uploaded case content is ensured.

Description

Technical Field

[0001] The present invention relates to the field of information security technology, and in particular to an efficient and accurate management system for massive litigation cases. Background Art

[0002] Individuals and various groups and organizations are paying more and more attention to using legal weapons to protect their own rights and interests. However, due to the normativeness and strictness of laws and regulations, it is difficult for non-legal professionals to truly apply laws and regulations to protect their rights. Therefore, they hope to be able to use legal practitioners, especially the best lawyer teams or individuals to provide professional legal services, so as to truly use the law to protect and safeguard their own legitimate rights. In the process of safeguarding legitimate rights and interests, the privacy of the parties' cases should be protected to prevent the disclosure of the case content. Summary of the invention

[0003] The present invention aims to at least solve the technical problems existing in the prior art, and in particular innovatively proposes a system for efficiently and accurately managing massive litigation cases.

[0004] In order to achieve the above-mentioned purpose of the present invention, the present invention provides a system for efficiently realizing the accurate management of massive litigation cases, including a litigation case management platform login module and a litigation case upload storage module;

[0005] The litigation case management platform login module is used to log in to the litigation case management platform;

[0006] The litigation case upload storage module is used to upload the collected case images to the litigation case management platform for storage after logging into the litigation case management platform.

[0007] In a preferred embodiment of the present invention, in a litigation case management platform login module, one logs into the litigation case management platform using one's own mobile phone number and an information code received through the mobile phone number.

[0008] In a preferred embodiment of the present invention, the mobile phone number in the litigation case management platform login module is an eleven-digit mobile phone number.

[0009] In a preferred embodiment of the present invention, in the litigation case management platform login module, the mobile phone number is composed of any combination of digital characters 0 to 9, and the first digit is not 0.

[0010] In a preferred embodiment of the present invention, the information code in the litigation case management platform login module is a six-digit information code. Preferably, the first digit of the information code is not 0.

[0011] In a preferred embodiment of the present invention, the information code in the litigation case management platform login module is composed of any combination of digital characters 0 to 9.

[0012] In a preferred embodiment of the present invention, the information code in the litigation case management platform login module is composed of any combination of lowercase characters a to z;

[0013] Or the information code in the litigation case management platform login module is composed of any combination of uppercase characters A to Z;

[0014] Or the information code in the litigation case management platform login module is composed of any combination of numeric characters 0 to 9 and lowercase characters a to z;

[0015] Or the information code in the login module of the litigation case management platform is composed of any combination of numeric characters 0 to 9 and uppercase characters A to Z;

[0016] Or the information code in the litigation case management platform login module is composed of any combination of numeric characters 0 to 9, lowercase characters a to z, and uppercase characters A to Z;

[0017] Alternatively, in the litigation case management platform login module, the information code is any combination of lowercase characters a to z and uppercase characters A to Z.

[0018] In a preferred embodiment of the present invention, the case pictures collected in the litigation case upload storage module are litigation case pictures taken by a mobile phone or / and litigation case pictures scanned by a scanner;

[0019] Or / and in the litigation case upload storage module, uploading to the litigation case management platform using 4G network, 5G network or WiFi network. Using 4G network, 5G network or WiFi network can efficiently upload data.

[0020] In a preferred embodiment of the present invention, the format of the case pictures in the litigation case upload storage module is one of jpg, png, tif, bmp, webp or any combination thereof.

[0021] In a preferred embodiment of the present invention, in order to ensure the security of uploading case pictures in the litigation case upload storage module, the collected case pictures will be processed for confidentiality to achieve the security of the picture content.

[0022] In a preferred embodiment of the present invention, a litigation case query module is also included. The litigation case query module is used to view and download cases stored on the litigation case management platform. The case images to be downloaded will be processed for confidentiality to achieve the security of the image content.

[0023] In summary, due to the adoption of the above technical solution, the present invention can safely log into the security management platform and ensure the security of the uploaded case content.

[0024] Additional aspects and advantages of the present invention will be given in part in the following description and in part will be obvious from the following description, or will be learned through practice of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] The above and / or additional aspects and advantages of the present invention will become apparent and easily understood from the description of the embodiments in conjunction with the following drawings, in which:

[0026] Figure 1 It is a schematic block diagram of the process of the present invention. DETAILED DESCRIPTION

[0027] Embodiments of the present invention are described in detail below, examples of which are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present invention, and cannot be understood as limiting the present invention.

[0028] The present invention provides a highly efficient and accurate management system for massive litigation cases, such as Figure 1 As shown, it includes a litigation case management platform login module and a litigation case upload storage module;

[0029] The litigation case management platform login module is used to log in to the litigation case management platform;

[0030] The litigation case upload storage module is used to upload the collected case images to the litigation case management platform for storage after logging into the litigation case management platform.

[0031] In a preferred embodiment of the present invention, in a litigation case management platform login module, one logs into the litigation case management platform using one's own mobile phone number and an information code received through the mobile phone number.

[0032] In a preferred embodiment of the present invention, the mobile phone number in the litigation case management platform login module is an eleven-digit mobile phone number.

[0033] In a preferred embodiment of the present invention, in the litigation case management platform login module, the mobile phone number is composed of any combination of digital characters 0 to 9, and the first digit is not 0.

[0034] In a preferred embodiment of the present invention, the information code in the litigation case management platform login module is a six-digit information code.

[0035] In a preferred embodiment of the present invention, the information code in the litigation case management platform login module is composed of any combination of digital characters 0 to 9.

[0036] In a preferred embodiment of the present invention, the information code in the litigation case management platform login module is composed of any combination of lowercase characters a to z;

[0037] Or the information code in the litigation case management platform login module is composed of any combination of uppercase characters A to Z;

[0038] Or the information code in the litigation case management platform login module is composed of any combination of numeric characters 0 to 9 and lowercase characters a to z;

[0039] Or the information code in the login module of the litigation case management platform is composed of any combination of numeric characters 0 to 9 and uppercase characters A to Z;

[0040] Or the information code in the litigation case management platform login module is composed of any combination of numeric characters 0 to 9, lowercase characters a to z, and uppercase characters A to Z;

[0041] Alternatively, in the litigation case management platform login module, the information code is any combination of lowercase characters a to z and uppercase characters A to Z.

[0042] In a preferred embodiment of the present invention, the case pictures collected in the litigation case upload storage module are litigation case pictures taken by a mobile phone or / and litigation case pictures scanned by a scanner;

[0043] Or / and in the litigation case upload storage module, upload to the litigation case management platform using 4G network, 5G network or WiFi network.

[0044] In a preferred embodiment of the present invention, the format of the case pictures in the litigation case upload storage module is one of jpg, png, tif, bmp, webp or any combination thereof.

[0045] In a preferred embodiment of the present invention, in order to ensure the security of uploading case pictures in the litigation case upload storage module, the collected case pictures will be processed for confidentiality to achieve the security of the picture content.

[0046] In a preferred embodiment of the present invention, the method for logging into the litigation case management platform in the litigation case management platform login module comprises the following steps:

[0047] S1-1, determine whether the acquisition information code trigger signal is received:

[0048] If the client (mobile phone) receives the trigger signal for obtaining the information code, it will obtain the eleven-digit mobile phone number entered on the login interface;

[0049] If the client does not receive the trigger signal for obtaining the information code, step S1-1 is executed;

[0050] S1-2, converting the mobile phone number obtained in step S1-1 into a mobile phone security number;

[0051] S1-3, upload the mobile phone security number to the litigation case management platform;

[0052] S1-4, after receiving the mobile phone security number sent by the client, the litigation case management platform converts the mobile phone security number into a mobile phone number;

[0053] S1-5, determine whether the mobile phone number in step S1-4 exists in the litigation case management platform:

[0054] If the mobile phone number does not exist in the litigation case management platform, the mobile phone number is stored in the litigation case management platform and the mobile phone number is registered; and the next step is executed;

[0055] If the mobile phone number exists in the litigation case management platform, proceed to the next step;

[0056] S1-6, the litigation case management platform randomly generates a six-digit information code, sends the randomly generated information code to the mobile phone number, and forms a verification pair with the mobile phone number and the randomly generated information code; the verification pair exists for 5 minutes to 10 minutes. After this time period, the information code in the verification pair is deleted or the verification pair is deleted.

[0057] S1-7, determine whether a trigger signal for logging into the litigation case management platform is received:

[0058] If the client receives a trigger signal for logging into the litigation case management platform, it obtains the eleven-digit mobile phone number and six-digit information code entered on the login interface;

[0059] If the client does not receive a trigger signal for logging into the litigation case management platform, then step S1-7 or S1-1 is executed;

[0060] S1-8, converting the mobile phone number obtained in step S1-7 into a mobile phone security number; and converting the information code obtained in step S1-7 into an information security code;

[0061] S1-9, uploading the mobile phone security number and information security code in step S1-8 to the litigation case management platform;

[0062] S1-10, after receiving the mobile phone security number and the information security code, the litigation case management platform converts the mobile phone security number into a mobile phone number; and converts the information security code into an information code;

[0063] S1-11, searching the information code in the verification pair with the mobile phone number in step S1-10, and determining whether the information code in the verification pair obtained by searching the mobile phone number in step S1-10 is the same as the information code obtained in step S1-10:

[0064] If the information code in the verification pair obtained by searching the mobile phone number in step S1-10 is the same as the information code obtained in step S1-10, the login to the litigation case management platform is successful; at this time, the information code in the verification pair is deleted or the verification pair is deleted.

[0065] Otherwise, the login to the litigation case management platform is unsuccessful. Execute step S1-7 or S1-1.

[0066] In a preferred embodiment of the present invention, the method for converting the mobile phone number obtained in step S1-1 into a mobile phone security number in step S1-2 is:

[0067] S1-2-1, treat the mobile phone number obtained in step S1-1 as a decimal number; define the character and value representation, as shown in Table 1.

[0068] Table 1 Character and numerical representation

[0069]

[0070]

[0071] S1-2-2, converting the decimal mobile phone number into binary to obtain the binary mobile phone number;

[0072] S1-2-3, counting the number of digits in the binary mobile phone number, calculating the β with the same number of digits as the binary mobile phone number, and obtaining a new binary string;

[0073] S1-2-4, convert the new binary string into γ base, where γ is a positive integer greater than 10, and the obtained γ base string is the mobile phone security number.

[0074] In a preferred embodiment of the present invention, in step S1-2-3, β is a binary string with the first bit being 1 and the remaining bits being 0.

[0075] In a preferred embodiment of the present invention, the method for obtaining a new binary string in step S1-2-3 is:

[0076]

[0077] That is, if β j = 0 and α j =1, or β j =1 and α j =0, β j ′=0;

[0078] If β j =α j=0, or β j =α j =1, β j ′=1;

[0079] Among them, β j ' represents the jth character in the new binary string; j = 1, 2, 3, ..., J, where J represents the number of digits in the binary mobile phone number;

[0080] α j Represents the jth character in a binary mobile phone number;

[0081] β j Represents the jth character in the binary string;

[0082] β′=β1′β2′β3′…β J ′,

[0083] β′ represents the new binary string;

[0084] β1′ represents the first character in the new binary string;

[0085] β2′ represents the second character in the new binary string;

[0086] β3′ represents the third character in the new binary string;

[0087] β J ' represents the Jth character in the new binary string; J represents the number of digits in the binary mobile phone number;

[0088] In a preferred embodiment of the present invention, the method for converting the mobile phone security number into a mobile phone number in step S1-4 is:

[0089] S1-4-1, converting the mobile phone security number into a binary mobile phone security number;

[0090] S1-4-2, counting the number of digits of the binary mobile phone security number, calculating n with the same number of digits as the binary mobile phone security number, and obtaining a new binary string;

[0091] S1-4-3, convert the new binary string into decimal, and the decimal string obtained is the mobile phone number.

[0092] In a preferred embodiment of the present invention, in step S1-4-2, n is a binary string with the first bit being 1 and the remaining bits being 0.

[0093] In a preferred embodiment of the present invention, the method for obtaining a new binary string in step S1-4-2 is:

[0094]

[0095] That is, if η j′ = 0 and α j ″=1, or η j′ =1 and α j When ″=0, η j "" = 0;

[0096] If η j′ =α j ″=0, or η j′ =α j When ″=1, η j "" = 1;

[0097] Among them, η j ″ represents the j′th character in the new binary string; j′=1, 2, 3, ..., J′, J′ represents the number of digits of the binary mobile phone security number;

[0098] α j ″ represents the j′th character in the binary mobile phone security number;

[0099] η j′ Represents the j′th character in the binary string;

[0100] η′=η1′η2′η3′…η′ J′ ,

[0101] η′ represents a new binary string;

[0102] η1′ represents the first character in the new binary string;

[0103] η2′ represents the second character in the new binary string;

[0104] η3′ represents the third character in the new binary string;

[0105] η′ J′ represents the J′th character in the new binary string; J′ represents the number of digits of the binary mobile phone security number;

[0106] In a preferred embodiment of the present invention, the method for converting the mobile phone number obtained in step S1-7 into a mobile phone security number in step S1-8 is:

[0107] S1-8-1, treating the mobile phone number obtained in step S1-7 as a decimal number;

[0108] S1-8-2, converting the decimal mobile phone number into binary to obtain the binary mobile phone number;

[0109] S1-8-3, counting the number of digits in the binary mobile phone number, calculating the β with the same number of digits as the binary mobile phone number, and obtaining a new binary string;

[0110] S1-8-4, convert the new binary string into γ base, where γ is a positive integer greater than 10, and the obtained γ base string is the mobile phone security number.

[0111] In a preferred embodiment of the present invention, in step S1-8-3, β is a binary string with the first bit being 1 and the remaining bits being 0.

[0112] In a preferred embodiment of the present invention, the method for obtaining a new binary string in step S1-8-3 is:

[0113]

[0114] That is, if β j = 0 and α j =1, or β j =1 and α j =0, β j ′=0;

[0115] If β j =α j =0, or β j =α j =1, β j ′=1;

[0116] Among them, β j ' represents the jth character in the new binary string; j = 1, 2, 3, ..., J, where J represents the number of digits in the binary mobile phone number;

[0117] α j Represents the jth character in a binary mobile phone number;

[0118] β j Represents the jth character in the binary string;

[0119] β′=β1′β2′β3′…β J ′,

[0120] β′ represents the new binary string;

[0121] β1′ represents the first character in the new binary string;

[0122] β2′ represents the second character in the new binary string;

[0123] β3′ represents the third character in the new binary string;

[0124] β J ' represents the Jth character in the new binary string; J represents the number of digits in the binary mobile phone number;

[0125] In a preferred embodiment of the present invention, the method for converting the information code obtained in step S1-7 into an information security code in step S1-8 is:

[0126] S1-8-1, treat the information code obtained in step S1-7 as decimal; at this time, the information code only contains digital characters 0 to 9. If the information code contains uppercase characters A to Z or lowercase characters a to z, the information code is treated as sixty-binary. At this time, γ is preferably a positive integer greater than 62.

[0127] S1-8-2, converting the decimal information code into binary to obtain a binary information code;

[0128] S1-8-3, counting the number of bits of the binary information code, calculating τ with the same number of bits of the binary information code as the binary information code, and obtaining a new binary information code string;

[0129] S1-8-4, convert the new binary information code string into γ base, where γ is a positive integer greater than 10, and the obtained γ base string is the information security code.

[0130] In a preferred embodiment of the present invention, in step S1-8-3, τ is a binary string with the first bit being 1 and the remaining bits being 0.

[0131] In a preferred embodiment of the present invention, the method for obtaining a new binary information code string in step S1-8-3 is:

[0132]

[0133] That is, if τ v = 0 and λ v =1, or τ v =1 and λ v = 0, τ v ′=0;

[0134] If τ v =λ v =0, or τ v =λ v =1, τ v ′=1;

[0135] Among them, τ v ′ represents the vth character in the new binary information code string; v = 1, 2, 3, ..., V, V represents the number of bits of the binary information code;

[0136] λ v Represents the vth character in the binary information code;

[0137] τ v Represents the vth character in the binary string;

[0138] τ′=τ1′τ2′τ3′…τ′ V ,

[0139] τ′ represents a new binary information code string;

[0140] τ1′ represents the first character in the new binary information code string;

[0141] τ2′ represents the second character in the new binary information code string;

[0142] τ3′ represents the third character in the new binary information code string;

[0143] τ′ V Represents the Vth character in the new binary information code string; V represents the number of bits of the binary information code;

[0144] In a preferred embodiment of the present invention, the method for converting the mobile phone security number into a mobile phone number in step S1-10 is:

[0145] S1-10-1, converting the mobile phone security number into a binary mobile phone security number;

[0146] S1-10-2, counting the number of digits of the binary mobile phone security number, calculating n with the same number of digits as the binary mobile phone security number, to obtain a new binary string;

[0147] S1-10-3, convert the new binary string into decimal, and the decimal string obtained is the mobile phone number.

[0148] In a preferred embodiment of the present invention, in step S1-10-2, n is a binary string with the first bit being 1 and the remaining bits being 0.

[0149] In a preferred embodiment of the present invention, the method for obtaining a new binary string in step S1-10-2 is:

[0150]

[0151] That is, if η j′ = 0 and α j ″=1, or η j′ =1 and α j When ″=0, ηj "" = 0;

[0152] If η j′ =α j ″=0, or η j′ =α j When ″=1, η j "" = 1;

[0153] Among them, η j ″ represents the j′th character in the new binary string; j′=1, 2, 3, ..., J′, J′ represents the number of digits of the binary mobile phone security number;

[0154] α j ″ represents the j′th character in the binary mobile phone security number;

[0155] η j′ Represents the j′th character in the binary string;

[0156] η′=η1′η2′η3′…η′ J′ ,

[0157] η′ represents a new binary string;

[0158] η1′ represents the first character in the new binary string;

[0159] η2′ represents the second character in the new binary string;

[0160] η3′ represents the third character in the new binary string;

[0161] η′ J′ represents the J′th character in the new binary string; J′ represents the number of digits of the binary mobile phone security number;

[0162] In a preferred embodiment of the present invention, the method for converting the information security code into the information code in step S1-10 is:

[0163] S1-8-1, converting the information security code into binary to obtain a binary information security code;

[0164] S1-8-2, counting the number of bits of the binary information security code, calculating the binary information security code with the same number of bits as the binary information security code τ′, and obtaining a new binary information security code string;

[0165] S1-8-3, convert the new binary information security code string into decimal, and the decimal string obtained is the information code.

[0166] In a preferred embodiment of the present invention, in step S1-8-2, τ′ is a binary string with the first bit being 1 and the remaining bits being 0.

[0167] In a preferred embodiment of the present invention, the method for obtaining a new binary information security code string in step S1-8-2 is:

[0168]

[0169] That is, if φ v′ = 0 and λ v ″=1, or φ v′ =1 and λ v When ″=0, φ v "" = 0;

[0170] If φ v′ =λ v ″=0, or φ v′ =λ v When ″=1,φ v "" = 1;

[0171] Among them, φ v ″ represents the v′th character in the new binary information security code string; v′=1, 2, 3, ..., V′, V′ represents the number of bits of the binary information security code;

[0172] φ v′ Represents the v′th character in the binary information security code;

[0173] λ v ″ represents the v′th character in the binary string;

[0174] φ′=φ1′φ2′φ3′…φ′ V′ ,

[0175] φ′ represents a new binary information security code string;

[0176] φ1′ represents the first character in the new binary information security code string;

[0177] φ2′ represents the second character in the new binary information security code string;

[0178] φ3′ represents the third character in the new binary information security code string;

[0179] φ′ V represents the Vth character in the new binary information security code string; V′ represents the number of digits of the binary information security code;

[0180] It should be noted that the method of converting the mobile phone number into the mobile phone security number in step S1-2 is exactly the same as the method of converting the mobile phone number into the mobile phone security number in step S1-8 and converting the information code into the information security code in step S1-8. This is the encryption process of the mobile phone number and the information code.

[0181] The method of converting the mobile phone security number to the mobile phone number in step S1-4 is exactly the same as the method of converting the mobile phone security number to the mobile phone number in step S1-10 and converting the information security code to the information code in step S1-10. This is the decryption process of the mobile phone number and the information code. The decryption process is the reverse operation of the encryption process.

[0182] For example, your mobile phone number is 139999999999, but there is no mobile phone number 13999999999 on the litigation case management platform. Here, γ is taken as sixty-two.

[0183] The first step is to enter the eleven-digit mobile phone number 13999999999 in the mobile phone number input box on the login interface;

[0184] In the second step, when you click the "Get Information Code" virtual button on the login interface, the client receives the Get Information Code trigger signal and obtains the eleven-digit mobile phone number 13999999999 entered on the login interface;

[0185] The third step is to convert the obtained mobile phone number 13999999999 into a binary mobile phone number 11010000100111011100001011111111111;

[0186] Step 4: Calculate the binary mobile phone number 11010000100111011100001011111111111 with the β value 100000000000000000000000000000000000 to get a new binary string 1010111101100010001111010000000000;

[0187] Step 5: Convert the new binary string 10101111011000100011110100000000000 into the mobile phone security number cQwTCM; upload the mobile phone security number cQwTCM to the litigation case management platform;

[0188] Step 6. After receiving the mobile phone security number cQwTCM sent by the client, the litigation case management platform converts the mobile phone security number cQwTCM into a binary mobile phone security number 10101111011000100011110100000000000;

[0189] Step 7, calculate the binary mobile phone security number 10101111011000100011110100000000000 and the n value 10000000000000000000000000000000000000 to obtain a new binary string 1101000010011101110000101111111111;

[0190] Step 8. Convert the new binary string 1101000010011101110000101111111111 to the mobile phone number 139999999999.

[0191] Step 9. Since the mobile phone number 13999999999 does not exist in the litigation case management platform, the mobile phone number 13999999999 is stored in the litigation case management platform, and the mobile phone number 13999999999 is registered;

[0192] Step 10: The litigation case management platform randomly generates a six-digit information code 240903, sends the randomly generated information code 240903 to the mobile phone number 13999999999, and forms a verification pair (139999999999, 240903) with the mobile phone number 13999999999;

[0193] Step 11. Enter the six-digit code 240903 in the code input box on the login interface;

[0194] Step 12: When you click the "Login" virtual button on the login interface, the client receives the login trigger signal and obtains the eleven-digit mobile phone number 13999999999 and the six-digit information code 240903 entered on the login interface;

[0195] Step 13: Convert the obtained mobile phone number 13999999999 into a binary mobile phone number 1101000010011101110000101111111111;

[0196] Step 14: Calculate the binary mobile phone number 11010000100111011100001011111111111 and the β value 100000000000000000000000000000000000 to get a new binary string 1010111101100010001111010000000000;

[0197] Step 15: Convert the new binary string 10101111011000100011110100000000000 to the mobile phone security number cQwTCM;

[0198] Step 16: Convert the acquired information code 240903 into a binary information code 111010110100000111;

[0199] Step 17, calculate the binary information code 111010110100000111 and the τ value 100000000000000000 to get a new binary string 100101001011111000;

[0200] Step 18, convert the new binary string 100101001011111000 into information security code DCE;

[0201] Step 19: Upload the mobile phone security number cQwTCM and information security code DCE to the litigation case management platform;

[0202] Step 20: After receiving the mobile phone security number cQwTCM and the information security code DCE, the litigation case management platform converts the mobile phone security number cQwTCM into a binary mobile phone security number 10101111011000100011110100000000000;

[0203] Step 21: Calculate the binary mobile phone security number 10101111011000100011110100000000000 and the n value 1000000000000000000000000000000000000 to obtain a new binary string 110100001001110111000010111111111;

[0205] Step 22: Convert the new binary string 1101000010011101110000101111111111 to the mobile phone number 13999999999;

[0206] Step 23: Convert the information security code DCE into a binary information security code 100101001011111000;

[0207] Step 24: Calculate the binary information security code 100101001011111000 and the τ′ value 100000000000000000 to obtain a new binary information security code string 111010110100000111;

[0208] Step 25: Convert the new binary information security code string 111010110100000111 into the information code 240903;

[0209] Step 26: Use the mobile phone number 139999999999 to search for the information code 240903 in the verification pair (13999999999, 240903). Since the information code 240903 in the verification pair (13999999999, 240903) obtained by searching for the mobile phone number 13999999999 is the same as the obtained information code 240903, the login to the litigation case management platform is successful. By changing the character expression form of the mobile phone number and the SMS code in the above manner, the security of the mobile phone number and the SMS code is guaranteed.

[0210] For another example, your mobile phone number is 139999999999, and the mobile phone number 13999999999 exists on the litigation case management platform. Here, γ is ninety-two.

[0211] The first step is to enter the eleven-digit mobile phone number 13999999999 in the mobile phone number input box on the login interface;

[0212] In the second step, when you click the "Get Information Code" virtual button on the login interface, the client receives the Get Information Code trigger signal and obtains the eleven-digit mobile phone number 13999999999 entered on the login interface;

[0213] The third step is to convert the obtained mobile phone number 13999999999 into a binary mobile phone number 11010000100111011100001011111111111;

[0214] Step 4: Calculate the binary mobile phone number 11010000100111011100001011111111111 with the β value 100000000000000000000000000000000000 to get a new binary string 1010111101100010001111010000000000;

[0215] Step 5: Convert the new binary string 10101111011000100011110100000000000 into a mobile phone security number 1)q?p^; upload the mobile phone security number 1)q?p^ to the litigation case management platform;

[0216] Step 6: After receiving the mobile phone security number 1)q?p^ sent by the client, the litigation case management platform converts the mobile phone security number 1)q?p^ into a binary mobile phone security number 1010111101100010001111010000000000;

[0217] Step 7, calculate the binary mobile phone security number 10101111011000100011110100000000000 and the n value 10000000000000000000000000000000000000 to obtain a new binary string 1101000010011101110000101111111111;

[0218] Step 8. Convert the new binary string 1101000010011101110000101111111111 to the mobile phone number 139999999999.

[0219] Step 9. Since the mobile phone number 13999999999 exists in the litigation case management platform, the litigation case management platform randomly generates a six-digit information code 240903, sends the randomly generated information code 240903 to the mobile phone number 13999999999, and forms a verification pair (139999999999, 240903) with the mobile phone number 13999999999.

[0220] Step 10. Enter the six-digit code 240903 in the code input box on the login interface;

[0221] Step 11. When you click the "Login" virtual button on the login interface, the client receives the login trigger signal and obtains the 11-digit mobile phone number 13999999999 and the six-digit information code 240903 entered on the login interface;

[0222] Step 12: Convert the obtained mobile phone number 13999999999 into a binary mobile phone number 1101000010011101110000101111111111;

[0223] Step 13: Calculate the binary mobile phone number 11010000100111011100001011111111111 and the β value 100000000000000000000000000000000000 to get a new binary string 1010111101100010001111010000000000;

[0224] Step 14: Convert the new binary string 10101111011000100011110100000000000 into a mobile phone security number 1)q? p^;

[0225] Step 15: Convert the acquired information code 240903 into a binary information code 111010110100000111;

[0226] Step 16, calculate the binary information code 111010110100000111 and the τ value 100000000000000000 to get a new binary string 100101001011111000;

[0227] Step 17: Convert the new binary string 100101001011111000 into the information security code hQ;

[0228] Step 18: Upload the mobile phone security number 1)q? p^ and information security code hQ to the litigation case management platform;

[0229] Step 19: After receiving the mobile phone security number 1)q?p^ and the information security code hQ, the litigation case management platform converts the mobile phone security number 1)q?p^ into a binary mobile phone security number 1010111101100010001111010000000000;

[0230] Step 20: Calculate the binary mobile phone security number 10101111011000100011110100000000000 and the n value 10000000000000000000000000000000000000 to obtain a new binary string 1101000010011101110000101111111111;

[0231] Step 21: Convert the new binary string 1101000010011101110000101111111111 to the mobile phone number 139999999999;

[0232] Step 22: Convert the information security code hQ into a binary information security code 100101001011111000;

[0233] Step 23: Calculate the binary information security code 100101001011111000 and the τ′ value 100000000000000000 to obtain a new binary information security code string 111010110100000111;

[0234] Step 24: Convert the new binary information security code string 111010110100000111 into the information code 240903;

[0235] Step 25: Use the mobile phone number 13999999999 to search for the information code 240903 in the verification pair (13999999999, 240903). Since the information code 240903 in the verification pair (13999999999, 240903) obtained by searching for the mobile phone number 13999999999 is the same as the obtained information code 240903, the login to the litigation case management platform is successful. By changing the character expression form of the mobile phone number and the SMS code in the above manner, the security of the mobile phone number and the SMS code is guaranteed.

[0236] For another example, your mobile phone number is 139999999999, and the mobile phone number 13999999999 exists on the litigation case management platform. Here, γ is sixteen.

[0237] The first step is to enter the eleven-digit mobile phone number 13999999999 in the mobile phone number input box on the login interface;

[0238] In the second step, when you click the "Get Information Code" virtual button on the login interface, the client receives the Get Information Code trigger signal and obtains the eleven-digit mobile phone number 13999999999 entered on the login interface;

[0239] The third step is to convert the obtained mobile phone number 13999999999 into a binary mobile phone number 11010000100111011100001011111111111;

[0240] Step 4: Calculate the binary mobile phone number 11010000100111011100001011111111111 with the β value 100000000000000000000000000000000000 to get a new binary string 1010111101100010001111010000000000;

[0241] Step 5: Convert the new binary string 10101111011000100011110100000000000 into the mobile phone security number 2bd88f400; upload the mobile phone security number 2bd88f400 to the litigation case management platform;

[0242] Step 6. After receiving the mobile phone security number 2bd88f400 sent by the client, the litigation case management platform converts the mobile phone security number 2bd88f400 into a binary mobile phone security number 10101111011000100011110100000000000;

[0243] Step 7, calculate the binary mobile phone security number 10101111011000100011110100000000000 and the n value 10000000000000000000000000000000000000 to obtain a new binary string 1101000010011101110000101111111111;

[0244] Step 8. Convert the new binary string 1101000010011101110000101111111111 to the mobile phone number 139999999999.

[0245] Step 9. Since the mobile phone number 13999999999 exists in the litigation case management platform, the litigation case management platform randomly generates a six-digit information code 240903, sends the randomly generated information code 240903 to the mobile phone number 13999999999, and forms a verification pair (139999999999, 240903) with the mobile phone number 13999999999.

[0246] Step 10. Enter the six-digit code 240903 in the code input box on the login interface;

[0247] Step 11. When you click the "Login" virtual button on the login interface, the client receives the login trigger signal and obtains the 11-digit mobile phone number 13999999999 and the six-digit information code 240903 entered on the login interface;

[0248] Step 12: Convert the obtained mobile phone number 13999999999 into a binary mobile phone number 1101000010011101110000101111111111;

[0249] Step 13: Calculate the binary mobile phone number 11010000100111011100001011111111111 and the β value 100000000000000000000000000000000000 to get a new binary string 1010111101100010001111010000000000;

[0250] Step 14: Convert the new binary string 10101111011000100011110100000000000 to the mobile phone security number 2bd88f400;

[0251] Step 15: Convert the acquired information code 240903 into a binary information code 111010110100000111;

[0252] Step 16, calculate the binary information code 111010110100000111 and the τ value 100000000000000000 to get a new binary string 100101001011111000;

[0253] Step 17: Convert the new binary string 100101001011111000 into the information security code 252f8;

[0254] Step 18: Upload the mobile phone security number 2bd88f400 and information security code 252f8 to the litigation case management platform;

[0255] Step 19: After receiving the mobile phone security number 2bd88f400 and the information security code 252f8, the litigation case management platform converts the mobile phone security number 2bd88f400 into a binary mobile phone security number 10101111011000100011110100000000000;

[0256] Step 20: Calculate the binary mobile phone security number 10101111011000100011110100000000000 and the n value 10000000000000000000000000000000000000 to obtain a new binary string 1101000010011101110000101111111111;

[0257] Step 21: Convert the new binary string 1101000010011101110000101111111111 to the mobile phone number 139999999999;

[0258] Step 22: Convert the information security code 252f8 into a binary information security code 100101001011111000;

[0259] Step 23: Calculate the binary information security code 100101001011111000 and the τ′ value 100000000000000000 to obtain a new binary information security code string 111010110100000111;

[0260] Step 24: Convert the new binary information security code string 111010110100000111 into the information code 240903;

[0261] In the twenty-fifth step, the information code 240903 in the check pair (13999999999, 240903) is searched for by the mobile phone number 13999999999. Since the information code 240903 in the check pair (13999999999, 240903) obtained by searching by the mobile phone number 13999999999 is the same as the obtained information code 240903, the login to the litigation case management platform is successful. By changing the character expression form of the mobile phone number and the SMS code in the above manner, the security of the mobile phone number and the SMS code is guaranteed. The login and image processing method of the present invention is not limited to the case management of lawyers, but can also be applied to the test paper management of teachers, and can also be applied to the management of personal privacy photos.

[0262] In a preferred embodiment of the present invention, the method of uploading the collected case pictures to the litigation case management platform for storage in the litigation case upload storage module includes the following steps:

[0263] S21, determining whether the collected image is a color image:

[0264] If the collected image is a color image, determine the depth of the color image and convert the color image into a gray image; execute the next step;

[0265] If the collected image is a gray image, determine the depth of the gray image and proceed to the next step;

[0266] S22, converting the pixel values ​​of all pixels in the image into binary to obtain binary pixel values;

[0267] S23, converting the number of bits of all binary pixel values ​​into binary pixel values ​​having the same number of bits as the depth;

[0268] S24, calculating all binary pixel values ​​and pixel sequence codes to obtain changed binary pixel values;

[0269] S25, generating a changed picture according to all changed binary pixel values;

[0270] S26, uploading the pixel code and the changed image to the litigation case management platform;

[0271] S27, after receiving the pixel code and the changed image, the litigation case management platform uses the received pixel code and the changed image to obtain the image to be stored;

[0272] S28, storing the images to be stored in the litigation case management platform.

[0273] In a preferred embodiment of the present invention, the method for converting the color image into a gray image in step S21 is:

[0274]

[0275] Among them, Gray(x,y) represents the pixel value at the pixel point (x,y);

[0276] Red(x,y) represents the pixel value of the red channel at the pixel point (x,y);

[0277] Green(x,y) represents the pixel value of the green channel at the pixel point (x,y);

[0278] Blue(x,y) represents the pixel value of the blue channel at the pixel point (x,y); x = 1, 2, 3, ..., X, y = 1, 2, 3, ..., Y, X represents the number of horizontal pixels, Y represents the number of vertical pixels,

[0279] It represents the integer part function;

[0280] Constraints:

[0281] r+g+b=1;

[0282] 0≤r≤1;

[0283] 0≤g≤1;

[0284] 0≤b≤1;

[0285] Here, r=0.299, g=0.587, r=0.144.

[0286] In a preferred embodiment of the present invention, the method of converting the number of bits of all binary pixel values ​​into binary pixel values ​​having the same number of bits as the depth in step S23 is:

[0287] If the number of bits of the binary pixel value is less than the number of bits of the depth, add 0 in front of the binary pixel value so that the number of bits after adding 0 is equal to the number of bits of the depth.

[0288] In a preferred embodiment of the present invention, the calculation method of the pixel code in step S26 is:

[0289] PixelNO=PixelNOcalculateway(Pixelstring),

[0290] Among them, PixelNO represents the pixel code;

[0291] PixelNOcalculateway() represents the calculation method of the pixel code; MD5 can be used for calculation, and the result is a 128-bit binary value; when transmitting, in order to shorten the number of bits of the pixel code, the pixel code can be converted into sixty-binary or ninety-binary or other forms for transmission.

[0292] Pixelstring represents a pixel value string;

[0293] Pixelstring=Gray(1,1) 10 Gray(1,2) 10 Gray(1,3) 10 …Gray(1,Y) 10 Gray(2,1) 10 Gray(2,2) 10 Gray(2,3) 10 …Gray(2,Y) 10 Gray(3,1) 10 Gray(3,2) 10 Gray(3,3) 10 …Gray(3,Y) 10 …Gray(X,1) 10 Gray(X,2) 10 Gray(X,3) 10 …Gray(X,Y) 10 ,

[0294] Among them, Pixelstring represents a pixel value string;

[0295] Gray(1,1) 10 Represents the decimal pixel value at the pixel point (1,1);

[0296] Gray(1,2) 10 Represents the decimal pixel value at the pixel point (1,2);

[0297] Gray(1,3) 10 Represents the decimal pixel value at the pixel point (1,3);

[0298] Gray(1,Y) 10 Represents the decimal pixel value at the pixel point (1, Y);

[0299] Gray(2,1) 10 Represents the decimal pixel value at the pixel point (2,1);

[0300] Gray(2,2) 10 Represents the decimal pixel value at the pixel point (2,2);

[0301] Gray(2,3) 10 Represents the decimal pixel value at the pixel point (2,3);

[0302] Gray(2,Y)10 Represents the decimal pixel value at the pixel point (2, Y);

[0303] Gray(3,1) 10 Represents the decimal pixel value at the pixel point (3,1);

[0304] Gray(3,2) 10 Represents the decimal pixel value at the pixel point (3,2);

[0305] Gray(3,3) 10 Represents the decimal pixel value at the pixel point (3,3);

[0306] Gray(3,Y) 10 Represents the decimal pixel value at the pixel point (3, Y);

[0307] Gray(X,1) 10 Represents the decimal pixel value at the pixel point (X,1);

[0308] Gray(X,2) 10 Represents the decimal pixel value at the pixel point (X,2);

[0309] Gray(X,3) 10 Represents the decimal pixel value at the pixel point (X,3);

[0310] Gray(X,Y) 10 Represents the decimal pixel value at the pixel point (X, Y);

[0311] In a preferred embodiment of the present invention, the calculation method of the pixel sequence code in step S24 is:

[0312] The pixel sequence code is obtained by taking the characters from the last 1 to the last T in the pixel code from left to right. The size of T is the number of depth bits;

[0313] In a preferred embodiment of the present invention, the calculation method of the binary pixel value changed in step S24 is:

[0314]

[0315] That is, if Gray(x,y) 2,h =F 2,h =0, or Gray(x,y) 2,h =F 2,h =1, then Gray′(x,y) 2,h =0;

[0316] If Gray(x,y) 2,h=1 and F 2,h =0, or Gray(x,y) 2,h = 0 and F 2,h =1, then Gray′(x,y) 2,h =1;

[0317] Among them, Gray′(x,y) 2,h The character representing the hth bit in the changed binary pixel value;

[0318] Gray(x,y) 2,h The character representing the hth bit in the binary pixel value;

[0319] F 2,h The character representing the hth position in the pixel sequence code;

[0320] x=1, 2, 3, ..., X, where X represents the number of horizontal pixels;

[0321] y=1, 2, 3, ..., Y, where Y represents the number of vertical pixels;

[0322] h=1, 2, 3, ..., T; the size of T is the number of depth bits;

[0323] In a preferred embodiment of the present invention, the method of obtaining the image to be stored by using the received pixel code and the changed image in step S27 comprises the following steps:

[0324] S271, determining the number of bits of depth of the received changed picture;

[0325] S272, converting the pixel values ​​of all pixels in the changed image into binary to obtain binary pixel values;

[0326] S273, converting the number of bits of all binary pixel values ​​into binary pixel values ​​having the same number of bits as the depth;

[0327] S274, calculating all binary pixel values ​​and pixel sequence codes to obtain restored binary pixel values;

[0328] S275, generating a restored image according to all restored binary pixel values; the restored image is the image to be stored.

[0329] In a preferred embodiment of the present invention, step S275 is to generate a restored image according to all restored binary pixel values;

[0330] The pixel code is calculated based on the restored image. If the calculated pixel code is the same as the received pixel code, the restored image is the image to be stored; otherwise, the restored image is not the image to be stored.

[0331] In a preferred embodiment of the present invention, step S275 is to generate a restored image according to all restored binary pixel values;

[0332] The pixel code is calculated based on the restored image, and the pixel code is converted into a sixty-binary pixel code, a ninety-binary pixel code, or a pixel code of another base. If the converted sixty-binary pixel code, ninety-binary pixel code, or other base pixel code is the same as the received pixel code, the restored image is the image to be stored; otherwise, the restored image is not the image to be stored.

[0333] In a preferred embodiment of the present invention, the method of converting the number of bits of all binary pixel values ​​into binary pixel values ​​having the same number of bits as the depth in step S273 is:

[0334] If the number of bits of the binary pixel value is less than the number of bits of the depth, add 0 in front of the binary pixel value so that the number of bits after adding 0 is equal to the number of bits of the depth.

[0335] In a preferred embodiment of the present invention, the calculation method of the pixel sequence code in step S274 is:

[0336] The pixel sequence code is obtained by taking the characters from the last 1 to the last T′ from the received pixel code in order from left to right. The size of T′ is the number of depth bits;

[0337] In a preferred embodiment of the present invention, the calculation method of the binary pixel value restored in step S274 is:

[0338]

[0339] That is, if Gray(x′,y′) 2,h′ =F 2,h′ =0, or Gray(x′,y′) 2,h′ =F 2,h′ =1, then Gray′(x′,y′) 2,h′ =0;

[0340] If Gray(x′,y′) 2,h′ =1 and F 2,h′ =0, or Gray(x′,y′) 2,h′ = 0 and F 2,h′ =1, then Gray′(x′,y′) 2,h′ =1;

[0341] Among them, Gray′(x′,y′) 2,h′ The character representing the hth bit in the recovered binary pixel value;

[0342] Gray(x,y) 2,h′The character representing the h′th bit in the binary pixel value;

[0343] F 2,h The character representing the h′th position in the pixel sequence code;

[0344] x′=1, 2, 3, ..., X′, where X′ represents the number of horizontal pixels;

[0345] y′=1, 2, 3, ..., Y′, where Y′ represents the number of vertical pixels;

[0346] h′=1, 2, 3, ..., T′; the size of T′ is the number of depth bits;

[0347] In a preferred embodiment of the present invention, the calculation method of the pixel code in step S275 is:

[0348] PixelNO′=PixelNOcalculateway(Pixelstring′),

[0349] Among them, PixelNO′ represents the pixel code;

[0350] PixelNOcalculateway() indicates the calculation method of the pixel code; MD5 can be used for calculation, and the result is a 128-bit binary value;

[0351] Pixelstring′ represents a pixel value string;

[0352] Pixelstring′=Gray(1,1) 10 Gray(1,2) 10 Gray(1,3) 10 …Gray(1,Y′) 10 Gray(2,1) 10 Gray(2,2) 10 Gray(2,3) 10 …Gray(2,Y′) 10 Gray(3,1) 10 Gray(3,2) 10 Gray(3,3) 10 …Gray(3,Y′) 10 …Gray(X′,1) 10 Gray(X′,2) 10 Gray(X′,3) 10 …Gray(X′,Y′) 10 ,

[0353] Wherein, Pixelstring′ represents a pixel value string;

[0354] Gray(1,1) 10 Represents the decimal pixel value at the pixel point (1,1);

[0355] Gray(1,2) 10 Represents the decimal pixel value at the pixel point (1,2);

[0356] Gray(1,3) 10 Represents the decimal pixel value at the pixel point (1,3);

[0357] Gray(1,Y′) 10 Represents the decimal pixel value at the pixel point (1, Y′);

[0358] Gray(2,1) 10 Represents the decimal pixel value at the pixel point (2,1);

[0359] Gray(2,2) 10 Represents the decimal pixel value at the pixel point (2,2);

[0360] Gray(2,3) 10 Represents the decimal pixel value at the pixel point (2,3);

[0361] Gray(2,Y′) 10 Represents the decimal pixel value at the pixel point (2, Y′);

[0362] Gray(3,1) 10 Represents the decimal pixel value at the pixel point (3,1);

[0363] Gray(3,2) 10 Represents the decimal pixel value at the pixel point (3,2);

[0364] Gray(3,3) 10 Represents the decimal pixel value at the pixel point (3,3);

[0365] Gray(3,Y′) 10 Represents the decimal pixel value at the pixel point (3, Y′);

[0366] Gray(X′,1) 10 Represents the decimal pixel value at the pixel point (X′,1);

[0367] Gray(X′,2) 10 Represents the decimal pixel value at the pixel point (X′,2);

[0368] Gray(X′,3) 10Represents the decimal pixel value at the pixel point (X′,3);

[0369] Gray(X′,Y′) 10 Represents the decimal pixel value at the pixel point (X′, Y′);

[0370] It should be noted that converting the gray image into the changed image can be regarded as a forward operation, while converting the received changed image into the restored image can be regarded as a reverse operation.

[0371] For example, the collected image is a color image with a depth of 8 bits, 4 horizontal pixels, and 3 vertical pixels. The decimal RGB three-channel pixel values ​​of the color image are shown in Table 2.

[0372] Table 2 Decimal RGB three-channel pixel values

[0373] (33,133,233) (87,145,243) (129,169,211) (92,107,208) (9,64,29) (33,55,61) (8,51,47) (211,28,86) (76,250,16) (41,66,124) (123,213,33) (61,82,93)

[0374] The first step is to use the formula Convert the color image to gray image as shown in Table 3.

[0375] Table 3 Decimal single channel pixel values

[0376] 120 145 167 118 43 49 37 91 170 68 165 79

[0377] The second step is to convert the pixel values ​​of all pixels in the image into binary, as shown in Table 4.

[0378] Table 4 Binary single channel pixel values

[0379] 1111000 10010001 10100111 1110110 101011 110001 100101 1011011 10101010 1000100 10100101 1001111

[0380] In the third step, since the depth bit number of the color image is 8, the bit number of all binary pixel values ​​is converted to 8-bit binary pixel values, as shown in Table 5.

[0381] Table 5 Eight-bit binary single channel pixel value

[0382] 01111000 10010001 10100111 01110110 00101011 00110001 00100101 01011011 10101010 01000100 10100101 01001111

[0383] Step 4: According to the pixel value of the gray image, obtain the pixel value string Pixelstring=120145167118434937911706816579;

[0384] Step 5. According to the calculation formula of the pixel code, the pixel code PixelNO is obtained: PixelNOcalculateway(120145167118434937911706816579)=00110010101100011001011100000011000010010110001010010010010000110111001101000001101000111000001100000000011001000101010111000101010.

[0385] Step 6. From left to right, the characters from the first to the eighth last digit 00101010 in the pixel code 00110010101100011001011100000011000010010100100001101110011010000011010001110000011000000000110010001010101010 are the pixel sequence code.

[0386] In the seventh step, all eight-bit binary pixel values ​​are calculated with the pixel sequence code 00101010 to obtain the changed binary pixel values, as shown in Table 6.

[0387] Table 6 Changed binary pixel values

[0388] 01010010 10111011 10001101 01011100 00000001 00011011 00001111 01110001 10000000 01101110 10001111 01100101

[0389] In the eighth step, all changed binary pixel values ​​generate changed images, and the decimal pixel values ​​corresponding to the changed images are shown in Table 7.

[0390] Table 7 Change the decimal pixel value corresponding to the image

[0391] 82 187 141 92 1 27 15 113 128 110 143 101

[0392] Step 9. Upload the pixel code 00110010101100011001011100000011000010010110001010010010000110111001101000001101000111000001100000000011001000101010101010 and the changed picture to the litigation case management platform.

[0393] In the tenth step, after the litigation case management platform receives the pixel code 001100101011000110010111000000110000100101001001000011011100110100000110100011100000110000000001100100010101010 and the changed picture, the pixel values ​​of all pixels in the changed picture are converted into binary, as shown in Table 8.

[0394] Table 8 Binary pixel values

[0395] 1010010 10111011 10001101 1011100 1 11011 1111 1110001 10000000 1101110 10001111 1100101

[0396] In the eleventh step, since the depth bit number of the received changed image is 8, the bit number of all binary pixel values ​​is converted into 8-bit binary pixel values, as shown in Table 9.

[0397] Table 9 Eight-bit binary pixel values

[0398]

[0399]

[0400] In the twelfth step, from the received pixel code 00110010101100011001011100000011000010010110001010010000110111001101000001101000111000001100000000011001000101010111000101010, the characters from the first to the eighth to the last 00101010 are taken out in order from left to right, which is the pixel sequence code.

[0401] In the thirteenth step, all eight-bit binary pixel values ​​are calculated with the pixel sequence code 00101010 to obtain the restored binary pixel values, as shown in Table 10.

[0402] Table 10 Restored binary pixel values

[0403] 01111000 10010001 10100111 01110110 00101011 00110001 00100101 01011011 10101010 01000100 10100101 01001111

[0404] In the fourteenth step, all restored binary pixel values ​​generate a restored image, which is the image to be stored, and the restored image is stored on the litigation case management platform. The above steps are only for uploading and storing a collected litigation case image, which is applicable to a large number of litigation case images.

[0405] For another example, the collected image is a color image, the depth bit number is 8, the number of horizontal pixels is 4, and the number of vertical pixels is 3. The decimal RGB three-channel pixel values ​​of the color image are shown in Table 11.

[0406] Table 11 Decimal RGB three-channel pixel values

[0407] (33,133,233) (87,145,243) (129,169,211) (92,107,208) (9,64,29) (33,55,61) (8,51,47) (211,28,86) (76,250,16) (41,66,124) (123,213,33) (61,82,93)

[0408] The first step is to use the formula Convert the color image to gray image as shown in Table 12.

[0409] Table 12 Decimal single channel pixel values

[0410] 120 145 167 118 43 49 37 91 170 68 165 79

[0411] The second step is to convert the pixel values ​​of all pixels in the image into binary, as shown in Table 13.

[0412] Table 13 Binary single channel pixel values

[0413]

[0414]

[0415] In the third step, since the depth bit number of the color image is 8, the bit number of all binary pixel values ​​is converted to 8-bit binary pixel values, as shown in Table 14.

[0416] Table 14 8-bit binary single channel pixel value

[0417] 01111000 10010001 10100111 01110110 00101011 00110001 00100101 01011011 10101010 01000100 10100101 01001111

[0418] Step 4: According to the pixel value of the gray image, obtain the pixel value string Pixelstring=120145167118434937911706816579;

[0419] Step 5. According to the calculation formula of the pixel code, the pixel code PixelNO is obtained: PixelNOcalculateway(120145167118434937911706816579)=00110010101100011001011100000011000010010110001010010010010000110111001101000001101000111000001100000000011001000101010111000101010.

[0420] Step 6. From left to right, the characters from the first to the eighth last digit 00101010 in the pixel code 00110010101100011001011100000011000010010100100001101110011010000011010001110000011000000000110010001010101010 are the pixel sequence code.

[0421] In the seventh step, all eight-bit binary pixel values ​​are calculated with the pixel sequence code 00101010 to obtain the changed binary pixel values, as shown in Table 15.

[0422] Table 15 Changed binary pixel values

[0423] 01010010 10111011 10001101 01011100 00000001 00011011 00001111 01110001 10000000 01101110 10001111 01100101

[0424] In the eighth step, all changed binary pixel values ​​generate changed images, and the decimal pixel values ​​corresponding to the changed images are shown in Table 16.

[0425] Table 16 Change the decimal pixel value corresponding to the image

[0426]

[0427]

[0428] Step 9. Upload the pixel code 00110010101100011001011100000011000010010110001010010010000110111001101000001101000111000001100000000011001000101010101010 and the changed picture to the litigation case management platform.

[0429] In the tenth step, after the litigation case management platform receives the pixel code 001100101011000110010111000000110000100101001001000011011100110100000110100011100000110000000001100100010101010 and the changed picture, the pixel values ​​of all pixels in the changed picture are converted into binary, as shown in Table 17.

[0430] Table 17 Binary pixel values

[0431] 1010010 10111011 10001101 1011100 1 11011 1111 1110001 10000000 1101110 10001111 1100101

[0432] In the eleventh step, since the depth bit number of the received changed image is 8, the bit number of all binary pixel values ​​is converted into 8-bit binary pixel values, as shown in Table 18.

[0433] Table 18 Eight-bit binary pixel values

[0434] 01010010 10111011 10001101 01011100 00000001 00011011 00001111 01110001 10000000 01101110 10001111 01100101

[0435] In the twelfth step, from the received pixel code 00110010101100011001011100000011000010010110001010010000110111001101000001101000111000001100000000011001000101010111000101010, the characters from the first to the eighth to the last 00101010 are taken out in order from left to right, which is the pixel sequence code.

[0436] In the thirteenth step, all eight-bit binary pixel values ​​are calculated with the pixel sequence code 00101010 to obtain the restored binary pixel values, as shown in Table 19.

[0437] Table 19 Recovered binary pixel values

[0438] 01111000 10010001 10100111 01110110 00101011 00110001 00100101 01011011 10101010 01000100 10100101 01001111

[0439] In step 14, all restored binary pixel values ​​generate a restored image, and the decimal pixel values ​​corresponding to the restored image are shown in Table 20.

[0440] Table 20 Decimal pixel values ​​corresponding to the restored images

[0441] 120 145 167 118 43 49 37 91 170 68 165 79

[0442] Step 15, according to the decimal pixel value of the restored image, obtain the pixel value string Pixelstring=120145167118434937911706816579;

[0443] Step 16. According to the calculation formula of the pixel code, the pixel code PixelNO′=PixelNOcalculateway(120145167118434937911706816579)=00110010101100011001011100000011000010010110001010010010010000110111001101000001101000111000001100010001110000000011001000101011100010101010.

[0444] Step 17: Since the calculated pixel code 001100101011000110010111000000110000100101100010100100100001101110011010000011010001110000011000000000110010001010101010 is the same as the received pixel code 00110010101100011001011100000011000010010110 0010100100101000011011100110100000110100011100000110000000001100100010101110001010 are the same, so the restored image is the image to be stored, which can ensure the accuracy of the restored image and store the restored image on the litigation case management platform.

[0445] For another example, the collected picture is a color picture with a depth bit number of 8, a horizontal pixel number of 4, and a vertical pixel number of 3. The decimal RGB three-channel pixel values ​​of the color picture are shown in Table 21.

[0446] Table 21 Decimal RGB three-channel pixel values

[0447] (33,133,233) (87,145,243) (129,169,211) (92,107,208) (9,64,29) (33,55,61) (8,51,47) (211,28,86) (76,250,16) (41,66,124) (123,213,33) (61,82,93)

[0448] The first step is to use the formula Convert the color image to a gray image, as shown in Table 22.

[0449] Table 22 Decimal single channel pixel values

[0450] 120 145 167 118 43 49 37 91 170 68 165 79

[0451] The second step is to convert the pixel values ​​of all pixels in the image into binary, as shown in Table 23.

[0452] Table 23 Binary single channel pixel values

[0453] 1111000 10010001 10100111 1110110 101011 110001 100101 1011011 10101010 1000100 10100101 1001111

[0454] In the third step, since the depth bit number of the color image is 8, the bit number of all binary pixel values ​​is converted to 8-bit binary pixel values, as shown in Table 24.

[0455] Table 24 Eight-bit binary single channel pixel value

[0456] 01111000 10010001 10100111 01110110 00101011 00110001 00100101 01011011 10101010 01000100 10100101 01001111

[0457] Step 4: According to the pixel value of the gray image, obtain the pixel value string Pixelstring=120145167118434937911706816579;

[0458] Step 5: According to the calculation formula of the pixel code, the pixel code PixelNO=PixelNOcalculateway(120145167118434937911706816579)=001100101011000110010111000000110000100101010010010000110111001101000001101000111000001100011000000000110010001010101010. Then convert the pixel code into a sixty-binary pixel code 1xEM3HmzCky44k6JD2fb3Y.

[0459] Step 6. From left to right, the characters from the first to the eighth last digit 00101010 in the pixel code 00110010101100011001011100000011000010010100100001101110011010000011010001110000011000000000110010001010101010 are the pixel sequence code.

[0460] In the seventh step, all eight-bit binary pixel values ​​are calculated with the pixel sequence code 00101010 to obtain the changed binary pixel values, as shown in Table 25.

[0461] Table 25 Changed binary pixel values

[0462]

[0463]

[0464] In the eighth step, all changed binary pixel values ​​generate changed images, and the decimal pixel values ​​corresponding to the changed images are shown in Table 26.

[0465] Table 26 Change the decimal pixel value corresponding to the image

[0466] 82 187 141 92 1 27 15 113 128 110 143 101

[0467] Step 9. Upload the pixel code 1xEM3HmzCky44k6JD2fb3Y and the changed image to the litigation case management platform.

[0468] In the tenth step, after receiving the pixel code 1xEM3HmzCky44k6JD2fb3Y and the changed image, the litigation case management platform converts the pixel values ​​of all pixels in the changed image into binary, as shown in Table 27.

[0469] Table 27 Binary pixel values

[0470] 1010010 10111011 10001101 1011100 1 11011 1111 1110001 10000000 1101110 10001111 1100101

[0471] In the eleventh step, since the depth bit number of the received changed image is 8, the bit number of all binary pixel values ​​is converted into 8-bit binary pixel values, as shown in Table 28.

[0472] Table 28 Eight-bit binary pixel values

[0473] 01010010 10111011 10001101 01011100 00000001 00011011 00001111 01110001 10000000 01101110 10001111 01100101

[0474] Step 12: Convert the received pixel code 1xEM3HmzCky44k6JD2fb3Y into binary pixel code 110010101100011001011100000011000010010110001010010010010000110111001101000001101000111000001100000000011001000101010101010, according to the From left to right, the characters from the first to the eighth last bit 00101010 are taken from the binary pixel code 11001010110001100101110000001100001001010010000110111001101000001101000111000001100000000011001000101010101010, which is the pixel sequence code.

[0475] In the thirteenth step, all eight-bit binary pixel values ​​are calculated with the pixel sequence code 00101010 to obtain the restored binary pixel values, as shown in Table 29.

[0476] Table 29 Restored binary pixel values

[0477] 01111000 10010001 10100111 01110110 00101011 00110001 00100101 01011011 10101010 01000100 10100101 01001111

[0478] In step 14, all restored binary pixel values ​​generate a restored image, and the decimal pixel values ​​corresponding to the restored image are shown in Table 30.

[0479] Table 30 Decimal pixel values ​​corresponding to the restored images

[0480] 120 145 167 118 43 49 37 91 170 68 165 79

[0481] Step 15, according to the decimal pixel value of the restored image, obtain the pixel value string Pixelstring=120145167118434937911706816579;

[0482] Step 16. According to the calculation formula of the pixel code, the pixel code PixelNO′=PixelNOcalculateway(120145167118434937911706816579)=00110010101100011001011100000011000010010110001010010010010000110111001101000001101000111000001100010001110000000011001000101011100010101010.

[0483] Step 16: Convert the calculated pixel code 001100101011000110010111000000110000100101100101001001000011011100110100000110100011100000110000000001100100010101010 into a sixty-binary pixel code 1xEM3HmzCky44k6JD2fb3Y.

[0484] In step 17, since the converted sixty-binary pixel code 1xEM3HmzCky44k6JD2fb3Y is the same as the received pixel code 1xEM3HmzCky44k6JD2fb3Y, the restored image is the image to be stored, and the restored image is stored on the litigation case management platform.

[0485] In a preferred embodiment of the present invention, a litigation case query module is further included. The litigation case query module is used to view and download cases stored on the litigation case management platform, and the case images to be downloaded are processed for image confidentiality to achieve the security of the image content. The method for processing the case images to be downloaded for image confidentiality is the same as the method for uploading the collected case images to the litigation case management platform. After the client receives the downloaded case images, the method for analyzing the images is the same as the method for analyzing the images after the litigation case management platform receives the changed images.

[0486] Although the embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the claims and their equivalents.

Claims

1. An efficient and accurate management system for massive litigation cases, characterized by: It includes a litigation case management platform login module and a litigation case upload storage module; The litigation case management platform login module is used to log in to the litigation case management platform; The litigation case upload storage module is used to upload the collected case images to the litigation case management platform for storage after logging into the litigation case management platform.

2. The system for efficiently implementing a precise management system for massive litigation cases according to claim 1 is characterized in that: In the litigation case management platform login module, users can log in to the litigation case management platform using their own mobile phone number and the information code received from their mobile phone number.

3. The system for efficiently implementing a precise management system for massive litigation cases according to claim 1 is characterized in that: The mobile phone number in the litigation case management platform login module is an eleven-digit mobile phone number.

4. The system for efficiently implementing a precise management system for massive litigation cases according to claim 1 is characterized in that: In the litigation case management platform login module, the mobile phone number is composed of any combination of digital characters 0 to 9, and the first digit is not 0.

5. The system for efficiently implementing a precise management system for massive litigation cases according to claim 1 is characterized in that: In the litigation case management platform login module, the information code is a six-digit information code.

6. The system for efficiently implementing a precise management system for massive litigation cases according to claim 1 is characterized in that: In the litigation case management platform login module, the information code is composed of any combination of digital characters 0 to 9.

7. The system for efficiently implementing a precise management system for massive litigation cases according to claim 1 is characterized in that: The case images collected in the litigation case upload storage module are litigation case images taken by a mobile phone and / or litigation case images scanned by a scanner; Or / and in the litigation case upload storage module, upload to the litigation case management platform using 4G network, 5G network or WiFi network.

8. The system for efficiently implementing a precise management system for massive litigation cases according to claim 1 is characterized in that: The format of case images in the litigation case upload storage module is one of jpg, png, tif, bmp, webp or any combination thereof.

9. The system for efficiently implementing a precise management system for massive litigation cases according to claim 1 is characterized in that: In order to ensure the security of uploading case pictures in the litigation case upload storage module, the collected case pictures will be processed for confidentiality to achieve the security of the picture content.

10. The system for efficiently implementing a precise management system for massive litigation cases according to claim 1 is characterized in that: It also includes a litigation case query module, which is used to view and download cases stored on the litigation case management platform. The case images to be downloaded will be processed for confidentiality to ensure the security of the image content.

Images