Ultrahigh-definition video compression transmission system
By cutting and deduplication of ultra-high-definition videos and building compression branches with preset compression dictionaries, the problem of failing to make full use of video data association relationships in the prior art is solved, and efficient video compression and storage is achieved.
Patent Information
- Application Number
- CN202411180547.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-27
- Publication Date
- 2024-12-03
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
The existing ultra-high-definition video compression technology fails to fully utilize the intrinsic relationships in video data, resulting in unsatisfactory compression and poses huge challenges to data transmission and storage.
By cutting ultra-high-definition videos in binary format, building a pre-level list, deduplication and filtering out a compressed reference list based on frequency, building a compressed branch with a preset compressed dictionary, generating compressed data packets, and transmitting them to the cloud sharing platform.
It improves the compression efficiency and quality of ultra-high-definition video, reduces redundant data, reduces data transmission and storage pressure, ensures picture quality and content integrity, and has good adaptability and scalability.
Smart Images

Figure HDA0005012017650000011 
Figure HDA0005012017650000021
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of ultra-high definition video compression, and in particular to an ultra-high definition video compression transmission system. Background Art
[0002] With the rapid development and widespread application of ultra-high-definition video technology, users' demand for ultra-high-definition videos is growing. In today's digital age, users are increasingly inclined to shoot and create ultra-high-definition videos and upload them to the cloud so that they can be accessed and shared with others at any time on different devices.
[0003] However, the massive amount of data contained in ultra-high-definition videos poses a huge challenge to uploading and storing them. Due to the extremely high resolution, frame rate, and color depth of ultra-high-definition videos, the amount of data increases exponentially compared to traditional high-definition videos. This not only causes the uploading process to take too long, but also places extremely high demands on network bandwidth and cloud storage space.
[0004] An existing compression technology is applied to video processing. It uses binary stream technology to compress video data. Data with a higher frequency is compressed using a shorter character combination. This method is indeed effective, but it fails to fully consider the internal relationship between the combinations in the data. In actual video data, there are often associations and dependencies between data combinations. The above compression method cannot effectively identify and fully utilize their internal relationships, resulting in unsatisfactory compression effects.
[0005] In order to solve the above problems, the present invention proposes a solution. Summary of the invention
[0006] The purpose of the present invention is to provide an ultra-high definition video compression transmission system to solve the problems raised in the above background technology;
[0007] The purpose of the present invention can be achieved through the following technical solutions:
[0008] An ultra-high definition video compression transmission system, comprising:
[0009] The compression upload unit obtains the target video selected by the authorized user for pre-upload and cuts the target video in binary format to obtain a plurality of groups of pre-processing combinations, wherein the character length of a group of the pre-processing combinations is 4;
[0010] According to a plurality of preprocessing combinations, every 4 preprocessing combinations are classified into an empty list to obtain a plurality of preprocessing lists, the plurality of preprocessing lists are deduplicated to obtain a plurality of preprocessing feature lists, and a preprocessing feature list is screened out from the plurality of preprocessing feature lists according to the frequency of each preprocessing feature list as a compressed reference list;
[0011] For any compressed reference list, the elements with subscript indexes 0, 1, 2, and 3 in the compressed reference list are compared for consistency with the elements corresponding to the same subscript index in each previous list, and the frequency weights of the elements with subscript indexes 0, 1, 2, and 3 in the compressed reference list are obtained based on the comparison results, and the frequency evaluation index of the compressed reference list is obtained;
[0012] Constructing a first compression branch and a second compression branch of a plurality of compression reference lists according to a preset diversion construction rule based on the frequency evaluation indexes of all compression reference lists;
[0013] For each group of front-end lists, according to the first compression branches and the second compression branches of the plurality of compression reference lists and in combination with a preset front-end compression dictionary, a plurality of compressed data packets corresponding to the front-end lists are obtained;
[0014] The cloud sharing platform is used to store and share target videos uploaded by authorized users.
[0015] Furthermore, a front-end compression dictionary is pre-stored in the compression upload unit, and the front-end compression field includes 16 key-value pairs.
[0016] Furthermore, the steps of generating several compressed data packets of all the preceding lists are as follows:
[0017] SS21: Label the elements in the previous list B1 with subscript indices 0, 1, 2, and 3 as L1, L2, L3, and L4, respectively;
[0018] SS22: Then, all the shunt lists contained in the first and second compression branches of all the selected compression reference lists are traversed, and if there is a shunt list with elements of subscript indexes 0, 1, 2, and 3 corresponding to L1, L2, L3, and L4, respectively, then the associated characters of the elements of the shunt list with subscript indexes 1, 2, and 3 are extracted in sequence;
[0019] The element L1 and the associated characters with subscript indices 1, 2, and 3 are concatenated to obtain the compressed string of the previous list B1, and the compressed data packet of the previous list B1 is generated based on the compressed string;
[0020] SS23: If there is no element with subscript index 0, 1, 2, 3 corresponding to L1, L2, L3, L4 in a certain flow list, then extract the values corresponding to the elements L1, L2, L3 and L4 in sequence from the preset front compression dictionary, and generate a compressed data packet of the front list B1 for each extracted value, and 4 compressed data packets can be obtained based on the front list B1;
[0021] SS24: Generate several compressed data packets of the previous lists B2, B3, ..., Bb in sequence according to SS21 to SS23, and transmit the corresponding several compressed data packets to the cloud sharing platform in sequence according to the sequence of the previous lists B1, B2, ..., Bb;
[0022] At the same time, the first and second compression branches of the selected compression reference lists are synchronously transmitted to the cloud sharing platform.
[0023] Beneficial effects of the present invention:
[0024] (1) The present invention sets an address tracking unit to obtain the storage address of the target video selected for upload by the authorized user, sets a compression upload unit to obtain the target video and compress it for upload. During the compression process, the target video in binary format is cut and a plurality of prefix lists are constructed. A plurality of prefix combinations are deduplicated and the occurrence frequency of each prefix combination after deduplication is statistically screened to obtain a plurality of compression reference lists. The plurality of compressed reference lists obtained by screening are sorted in combination with the frequency weight of each element therein, and a first compression branch and a second compression branch of the plurality of compressed reference lists are constructed based on the sorting result. All the prefix lists obtained by processing the target video are compressed in combination with a preset prefix compression dictionary. In this way, the efficiency and quality of ultra-high-definition video compression can be greatly improved. On the one hand, operations such as deduplication, frequency-based sorting, and branch construction enable the compression algorithm to be more accurately optimized according to the characteristics of the video data, effectively reducing redundancy. The existence of redundant data reduces the pressure of data transmission and storage; on the other hand, the use of the preset pre-compression dictionary provides a reliable reference standard and mode for the compression process, so that the compressed video data can minimize the data volume under the premise of ensuring image quality and content integrity; (2) When constructing the first compression branch and the second compression branch of a plurality of compression reference lists, the first compression branch and the second compression branch of one of the compression reference lists can simultaneously meet the combination form of 8 kinds of 4 groups of pre-processing combinations, and the first compression branch and the second compression branch of the compression reference list are obtained based on the combination form of characters in the target video, so that the compression process is targeted and can minimize redundant data. In this way, the target video can be greatly compressed, and at the same time, this compression method has good adaptability and extensibility, and can be flexibly adjusted and optimized according to different types of videos and constantly changing video data characteristics. BRIEF DESCRIPTION OF THE DRAWINGS
[0025] The present invention will be further described below in conjunction with the accompanying drawings.
[0026] Figure 1 is a system block diagram of the present invention;
[0027] Figure 2 It is a flow chart of the method of the present invention. DETAILED DESCRIPTION
[0028] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0029] like Figure 1 , 2 As shown, an ultra-high-definition video compression transmission system includes a video uploading terminal and a cloud sharing platform;
[0030] The video upload terminal is used to authorize users to upload ultra-high-definition videos to the cloud sharing platform. The video upload terminal includes an address tracking unit and a compression upload unit;
[0031] The authorized user selects a pre-uploaded target video on the authorized device, and the address tracking unit obtains the storage address of the target video on the authorized device and transmits the storage address to the compression upload unit, wherein the authorized user refers to a user who has registered a sharing account on the cloud sharing platform and has passed identity authentication; the authorized device refers to the electronic device used by the authorized user to register or log in to the sharing account on the cloud sharing platform;
[0032] In this embodiment, the authorized user selects the target video to be pre-uploaded as an ultra-high-definition video;
[0033] In this embodiment, the authorization device may be any one of a smart phone, a tablet computer, a laptop computer, and a desktop computer;
[0034] The compression upload unit pre-stores a compression dictionary. After receiving the transmitted storage address, the compression upload unit obtains the corresponding target video according to the storage address and pre-processes the target video according to a preset pre-processing rule. The pre-processing rule is as follows:
[0035] S11: performing binary conversion on the target video, and marking the binary data obtained by the conversion as pre-processing data;
[0036] S12: Specifying a cutting step length of 4, cutting the preprocessed data from left to right to obtain a plurality of preprocessed combinations, wherein the number of characters in any preprocessed combination is 4, wherein if the total number of characters remaining in the cutting process is less than 4, the remaining characters are aggregated to obtain a group of rejected combinations;
[0037] S13: marking all the preprocessing combinations obtained by cutting as A1, A2, ..., Aa at a time according to the positions of the preprocessing combinations before cutting in the preprocessing data from left to right, where a≥1, and a is the total number of preprocessing combinations obtained by cutting the preprocessing data;
[0038] S14: Construct the front list B1, B2, ..., Bb according to the preset construction rules, the construction rules are as follows:
[0039] S141: in the order of preprocessing combinations A1, A2, ..., Aa, firstly select preprocessing combination A1 as the identification combination and add it into an empty list;
[0040] S142: based on the identification combination, the three pre-processing combinations arranged behind it are added into the list in order of distance from the identification combination, from near to far, to obtain the front list B1;
[0041] Explanation: Based on the three preprocessing combinations A2, A3, and A4 indicated by the identifier combination, the order of the preprocessing combinations A2, A3, and A4 in the order of the preprocessing combinations A1, A2, ..., Aa from the preprocessing combination A1 is A2, A3, and A4 from the preprocessing combination A1, so the expression of the final preprocessing list B1 in the programming field is B1 = [A1, A2, A3, A4];
[0042] S143: According to the order of preprocessing combinations A1, A2, ..., Aa, preprocessing combinations A5, A9, ... are selected as identification combinations in turn, and the preceding lists B2, B3, ..., Bb are obtained in turn according to S141 to S142, where b = ceil(a / 4), where ceil() is a rounding up function;
[0043] S15: De-duplicate the previous lists B1, B2, ..., Bb, and re-mark all the previous lists remaining after de-duplicate as previous feature lists, and re-mark them as C1, C2, ..., Cc, 1≤c≤b, and c refers to the total number of previous feature lists after de-duplicate;
[0044] It should be noted here that when marking the previous feature lists, all the previous feature lists are marked in ascending order according to the minimum value of the marking subscript of each previous feature list in the previous lists B1, B2, ..., Bb;
[0045] S16: Filter and obtain several compressed reference lists from the previous lists B1, B2, ..., Bb according to the preset filtering rules. The filtering rules are as follows:
[0046] S161: Traverse the previous feature lists C1, C2, ..., Cc, obtain the total number of previous feature lists that are completely consistent with the previous feature list C1, and mark it as the frequency value D1 of the previous feature list C1, where completely consistent means that the contents of the elements corresponding to the same table in the list are completely consistent;
[0047] S162: according to S161, the frequency quantities of the preceding feature lists C2, C3, ..., Cc are calculated in sequence, and the preceding feature lists corresponding to the frequency quantities with values greater than or equal to P2 are cut out, and recalibrated as compressed reference lists, where P2 is a preset frequency screening comparison threshold;
[0048] S17: Mark the compressed reference lists obtained by screening from the previous lists B1, B2, ..., Bb as D1, D2, ..., Dd, respectively, where d is the total number of compressed reference lists obtained by screening, and the value range of d is 1≤d≤b;
[0049] S18: Calculate and obtain the frequency evaluation index I1 of the compressed reference list D1 according to a preset calculation rule. The calculation rule is as follows:
[0050] S181: Mark the elements with subscript indexes 0, 1, 2, and 3 in the compressed reference list D1 as E1, E2, E3, and E4 respectively;
[0051] S182: extracting the elements with subscript index 0 from the previous lists B1, B2, ..., Bb in sequence, comparing the extracted elements with the element E1 for consistency each time, obtaining the total number F1 of elements consistent with the element E1, and calculating the frequency weight G1 of the element E1 using the formula G1=F1 / b;
[0052] S183: re-mark the previous list to which the elements consistent with element E1 extracted in S182 belong as the first branch list of the compressed reference list D1, and then extract the elements with subscript index 1 from all the first branch lists respectively, and compare the extracted elements with element E2 for consistency each time, obtain the total number F2 of elements consistent with element E2, and calculate the frequency weight G2 of element E2 using the formula G2=F2 / h1, where h1 is the total number of the first branch list of the compressed reference list D1;
[0053] S184: re-marking the first branch list to which the elements consistent with the element E2 extracted in S183 belong as the second branch list of the compressed reference list D1, and then extracting the elements with the subscript index 2 from all the second branch lists respectively, and comparing the extracted elements with the element E3 for consistency each time, obtaining the total number F3 of elements consistent with the element E3, and calculating the frequency weight G3 of obtaining the element E3 using the formula G3=F3 / h2, where h2 is the total number of the second branch lists of the compressed reference list D1;
[0054] S185: re-mark the second split list to which the element consistent with the element E3 extracted in S184 belongs as the third split list of the compressed reference list D1, and then extract the elements with the subscript index 3 from all the third split lists respectively, and compare the extracted elements with the element E4 for consistency each time, obtain the total number F4 of elements consistent with the element E4, and calculate the frequency weight G4 of the element E4 using the formula G4=F4 / h3, where h3 is the total number of the third split list of the compressed reference list D1;
[0055] S186: Calculate and obtain the frequency evaluation index I1 of the compressed reference list D1 using the formula I1=G1×ɑ1+G2×ɑ2+G3×ɑ3+G4×ɑ4, where ɑ1, ɑ2, ɑ3 and ɑ4 are respectively the first, second, third and fourth weight proportion factors preset;
[0056] S19: Calculate and obtain frequency evaluation indicators I2, I3, ..., Id of the compressed reference lists D2, D3, ..., Dd in sequence according to S18;
[0057] S110: Construct the first and second compression branches of the compression reference list according to the preset diversion construction rules. The diversion construction rules are as follows:
[0058] SS1: Filter out the compressed reference lists corresponding to the frequency evaluation indicators whose values are greater than or equal to P3 from the frequency evaluation indicators I1, I2, ..., Id of the compressed reference lists D1, D2, ..., Dd, and recalibrate all the filtered compressed reference lists to J1, J2, ..., Jj in descending order of the frequency evaluation indicators, 1≤j≤d, where P3 is the preset frequency indicator screening threshold;
[0059] SS2: extract the elements with subscript indices 0, 1, 2, and 3 in the compressed reference list J1 in sequence, and label them as K1, K2, K3, and K4 respectively;
[0060] SS3: Filter out several compressed reference lists from the compressed reference lists J2, J3, ..., Jj, and select the compressed reference list with the largest frequency evaluation index as the first diversion list of the compressed reference list J1. The elements in the first diversion list meet the first diversion condition: the elements with subscript indexes 0, 1, and 2 in the first diversion list are K1, K2, and K3 respectively, and the element with subscript index 3 in the first diversion list is not K4;
[0061] SS4: Filter out a number of compressed reference lists from the compressed reference lists J2, J3, ..., Jj, and select the compressed reference list with the largest frequency evaluation index as the second diversion list of the compressed reference list J1;
[0062] The elements in the second flow splitting list satisfy the second flow splitting condition: the elements with subscript indexes 0 and 1 in the second flow splitting list are K1 and K2 respectively, and the element with subscript index 2 in the second flow splitting list is not K3;
[0063] SS5: Filter out a number of compressed reference lists from the compressed reference lists J2, J3, ..., Jj and select the compressed reference list with the largest frequency evaluation index as the third diversion list of the compressed reference list J1;
[0064] The elements in the third flow splitting list satisfy the third flow splitting condition: the elements in the third flow splitting list with subscript indexes 0, 1, and 2 are respectively consistent with the elements in the second flow splitting list with subscript indexes 0, 1, and 2, and the element in the third flow splitting list with subscript index 3 is inconsistent with the element in the second flow splitting list with subscript index 3;
[0065] SS6: Use the selected first, second and third flow lists as the first compression branch of the compression reference list J1;
[0066] SS7: Map the elements with subscript indices 1, 2, and 3 in the compressed reference list J1 to the character 0, map the elements with subscript indices 1, 2, and 3 in the first diversion list to the characters 0, 0, and 1 in sequence, map the elements with subscript indices 1, 2, and 3 in the second diversion list to the characters 0, 1, and 0 in sequence, and map the elements with subscript indices 1, 2, and 3 in the third diversion list to the characters 0, 0, and 1 in sequence;
[0067] After the mapping is completed, the associated character of the element with index subscript 1 in the compressed reference list J1, the first, second and third flow lists in the first compressed branch based on the compressed reference list J1 is 0;
[0068] The associated character of the element with index subscript 2 in the compressed reference list J1 and the first diversion list is 00, and the associated character of the element with index subscript 2 in the second and third diversion lists is 1;
[0069] The associated characters of the elements with index subscript 3 in the compressed reference list J1, the first, second and third stream lists are 0, 1, 0 and 1 respectively;
[0070] It should be noted here that, in the process of selecting the first, second and third diversion lists, if the corresponding diversion list is not selected according to the preset diversion condition, the diversion list not selected in SS7 does not participate in the mapping process;
[0071] SS8: Filter out a number of compressed reference lists from the compressed reference lists J2, J3, ..., Jj, and select the compressed reference list with the largest frequency evaluation index as the fourth branch list of the compressed reference list J1;
[0072] The fourth flow splitting list satisfies the fourth flow splitting condition: the element with subscript index 0 in the fourth flow splitting list is K1, and the element with subscript index 1 in the fourth flow splitting list is not K2;
[0073] SS9: Filter out a number of compressed reference lists from the compressed reference lists J2, J3, ..., Jj, and select the compressed reference list with the largest frequency evaluation index as the fifth branch list of the compressed reference list J1;
[0074] The fifth flow splitting list satisfies the fifth flow splitting condition: the elements with subscript indexes 0 and 1 in the fifth flow splitting list are K1 and K2 respectively, the element with subscript index 2 in the fifth flow splitting list is the same as the element with subscript index 2 in the fourth flow splitting list, and the element with subscript index 3 in the fifth flow splitting list is different from the element with subscript index 3 in the fourth flow splitting list;
[0075] SS10: Filter out a number of compressed reference lists from the compressed reference lists J2, J3, ..., Jj, and select the compressed reference list with the largest frequency evaluation index as the sixth diversion list of the compressed reference list J1;
[0076] The sixth flow splitting list satisfies the sixth flow splitting condition: the elements with subscript indexes 0 and 1 in the sixth flow splitting list are respectively the same as the elements with subscript indexes 0 and 1 in the fourth flow splitting list, and the element with subscript index 2 in the sixth flow splitting list is different from the element with subscript index 2 in the fourth flow splitting list;
[0077] SS11: Filter out a number of compressed reference lists from the compressed reference lists J2, J3, ..., Jj, and select the compressed reference list with the largest frequency evaluation index as the seventh branch list of the compressed reference list J1;
[0078] The seventh flow splitting list satisfies the seventh flow splitting condition: the elements with subscript indexes 0, 1, and 2 in the seventh flow splitting list are the same as the elements with subscript indexes 0, 1, and 2 in the sixth flow splitting list, and the element with subscript index 3 in the seventh flow splitting list is not the same as the element with subscript index 3 in the sixth flow splitting list;
[0079] SS12: using the selected fourth, fifth, sixth and seventh branch flow lists as the second compression branch of the compression reference list J1, wherein the compression reference lists that have been selected as the first, second, ..., seventh branch flow lists in the process of selecting the first, second, ..., seventh branch flow lists no longer participate in the selection process of the first, second, ..., seventh branch flow lists;
[0080] SS13: Map the elements with subscript indexes 1, 2, and 3 in the fourth diversion list to the characters 1, 0, and 0 in sequence, map the elements with subscript indexes 1, 2, and 3 in the fifth diversion list to 1, 0, and 1 in sequence, map the elements with subscript indexes 1, 2, and 3 in the sixth diversion list to 1, 1, and 0 in sequence, and map the elements with subscript indexes 1, 2, and 3 in the seventh diversion list to 1, 1, and 1 in sequence;
[0081] S111: in the order of the compressed reference lists J2, J3, ..., Jj, all the compressed reference lists that have not been selected as the diversion lists are selected in turn, and the first and second compression branches thereof are constructed based on all the selected compressed reference lists according to S110;
[0082] S112: Generate several compressed data packets of the preceding lists B1, B2, ..., Bb in sequence according to a preset generation rule, the generation rule being as follows:
[0083] SS21: Label the elements in the previous list B1 with subscript indices 0, 1, 2, and 3 as L1, L2, L3, and L4, respectively;
[0084] SS22: Then, all the shunt lists contained in the first and second compression branches of all the selected compression reference lists are traversed, and if there is a shunt list with elements of subscript indexes 0, 1, 2, and 3 corresponding to L1, L2, L3, and L4, respectively, then the associated characters of the elements of the shunt list with subscript indexes 1, 2, and 3 are extracted in sequence;
[0085] The element L1 and the associated characters with subscript indices 1, 2, and 3 are concatenated to obtain the compressed string of the previous list B1, and the compressed data packet of the previous list B1 is generated based on the compressed string;
[0086] During the splicing process, the elements or corresponding associated characters are spliced in the order of elements L1, 1, 2, 3;
[0087] SS23: If there is no element with subscript index 0, 1, 2, 3 corresponding to L1, L2, L3, L4 in a certain flow list, then extract the values corresponding to the elements L1, L2, L3 and L4 in sequence from the preset front compression dictionary, and generate a compressed data packet of the front list B1 for each extracted value, and 4 compressed data packets can be obtained based on the front list B1;
[0088] SS24: Generate several compressed data packets of the previous lists B2, B3, ..., Bb in sequence according to SS21 to SS23, and transmit the corresponding several compressed data packets to the cloud sharing platform in sequence according to the sequence of the previous lists B1, B2, ..., Bb;
[0089] At the same time, the first and second compressed branches of the selected plurality of compressed reference lists are synchronously transmitted to the cloud sharing platform;
[0090] A cloud sharing platform is used to receive and store ultra-high-definition videos uploaded by authorized users. A front-end compression dictionary is pre-stored in the cloud sharing platform. The front-end compression field contains 16 key-value pairs, wherein the keys are four-bit binary numbers 0000, 0001, 0010, 0011, 0100, 0101, 0110, 0111, 1000, 1001, 1010, 1011, 1100, 1101, 1110, 1111. In this embodiment, the values corresponding to the above keys are 0, 1, 00, 01, 10, 11, 000, 001, 010, 011, 100, 101, 110, 1110, 1111.
[0091] Here, the correspondence between keys and values is selected by the administrators of the cloud sharing platform by analyzing the frequency probability of each binary number;
[0092] After receiving the transmitted compressed data packets of the previous lists B1, B2, ..., Bb and the first and second compressed branches of the selected compressed reference lists, the cloud sharing platform restores the previous lists B1, B2, ..., Bb based on the first and second compressed branches of the selected compressed reference lists to obtain the target video, stores the target video and sets sharing permissions;
[0093] In the description of the specification, the description with reference to the terms "one embodiment", "example", "specific example", etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any one or more embodiments or examples in a suitable manner.
[0094] The above contents are merely examples and explanations of the present invention. Those skilled in the art may make various modifications or additions to the specific embodiments described or replace them in a similar manner. As long as they do not deviate from the invention or exceed the scope defined by the claims, they shall all fall within the protection scope of the present invention.
[0095] The above is a detailed description of an embodiment of the present invention, but the content is only a preferred embodiment of the present invention and cannot be considered to limit the scope of implementation of the present invention. All equivalent changes and improvements made within the scope of the present invention should still fall within the scope of the patent coverage of the present invention.
Claims
1. An ultra-high definition video compression transmission system, It is characterized in that include: The compression upload unit obtains the target video selected by the authorized user for pre-upload and cuts the target video in binary format to obtain a plurality of groups of pre-processing combinations, wherein the character length of a group of the pre-processing combinations is 4; According to a plurality of preprocessing combinations, every 4 preprocessing combinations are classified into an empty list to obtain a plurality of preprocessing lists, the plurality of preprocessing lists are deduplicated to obtain a plurality of preprocessing feature lists, and a preprocessing feature list is screened out from the plurality of preprocessing feature lists according to the frequency of each preprocessing feature list as a compressed reference list; For any compressed reference list, the elements with subscript indexes 0, 1, 2, and 3 in the compressed reference list are compared for consistency with the elements corresponding to the same subscript index in each previous list, and the frequency weights of the elements with subscript indexes 0, 1, 2, and 3 in the compressed reference list are obtained based on the comparison results, and the frequency evaluation index of the compressed reference list is obtained; Constructing a first compression branch and a second compression branch of a plurality of compression reference lists according to a preset diversion construction rule based on the frequency evaluation indexes of all compression reference lists; For each group of front-end lists, according to the first compression branches and the second compression branches of the plurality of compression reference lists and in combination with a preset front-end compression dictionary, a plurality of compressed data packets corresponding to the front-end lists are obtained; The cloud sharing platform is used to store and share target videos uploaded by authorized users.
2. The ultra-high definition video compression transmission system according to claim 1, It is characterized in that A front-end compression dictionary is pre-stored in the compression upload unit, and the front-end compression field contains 16 key-value pairs.
3. The ultra-high definition video compression transmission system according to claim 1, It is characterized in that The steps to obtain several previous feature lists are as follows: S11: performing binary conversion on the target video, and marking the binary data obtained by the conversion as pre-processing data; S12: specifying a cutting step length of 4, cutting the preprocessed data from left to right to obtain a plurality of preprocessing combinations; S13: marking all the preprocessing combinations obtained by cutting as A1, A2, ..., Aa at a time according to the positions of the preprocessing combinations before cutting in the preprocessing data from left to right, where a≥1, and a is the total number of preprocessing combinations obtained by cutting the preprocessing data; S14: Construct the front list B1, B2, ..., Bb according to the preset construction rules, the construction rules are as follows: S141: in the order of preprocessing combinations A1, A2, ..., Aa, firstly select preprocessing combination A1 as the identification combination and add it into an empty list; S142: based on the identification combination, the three pre-processing combinations arranged behind it are added into the list in order of distance from the identification combination, from near to far, to obtain the front list B1; S143: According to the order of preprocessing combinations A1, A2, ..., Aa, preprocessing combinations A5, A9, ... are selected as identification combinations in turn, and the preceding lists B2, B3, ..., Bb are obtained in turn according to S141 to S142, where b = ceil(a / 4), where ceil() is a rounding up function; S15: De-duplicate the previous lists B1, B2, ..., Bb, and re-mark all the previous lists remaining after de-duplicate as previous feature lists, and re-mark them as C1, C2, ..., Cc, 1≤c≤b.
4. The ultra-high definition video compression transmission system according to claim 3, It is characterized in that The steps to filter and obtain several compressed reference lists are as follows: S16: Filter and obtain several compressed reference lists from the previous feature lists C1, C2, ..., Cc according to the preset filtering rules. The filtering rules are as follows: S161: Traverse the previous lists B1, B2, ..., Bb, obtain the total number of previous lists that are completely consistent with the previous feature list C1, and mark it as the frequency value D1 of the previous feature list C1, where completely consistent means that the contents of the elements corresponding to the same table in the list are completely consistent; S162: according to S161, the frequency quantities of the preceding feature lists C2, C3, ..., Cc are calculated in sequence, and the preceding feature lists corresponding to the frequency quantities with values greater than or equal to P2 are cut out, and recalibrated as compressed reference lists, where P2 is a preset frequency screening comparison threshold; S17: Mark several compressed reference lists obtained by screening from the previous lists B1, B2, ..., Bb as D1, D2, ..., Dd, respectively, 1≤d≤b.
5. The ultra-high definition video compression transmission system according to claim 4, It is characterized in that The frequency evaluation index of the compressed reference lists D1, D2, ..., Dd is calculated as follows: S18: Calculate and obtain the frequency evaluation index I1 of the compressed reference list D1 according to a preset calculation rule. The calculation rule is as follows: S181: Mark the elements with subscript indexes 0, 1, 2, and 3 in the compressed reference list D1 as E1, E2, E3, and E4 respectively; S182: extracting the elements with subscript index 0 from the previous lists B1, B2, ..., Bb in sequence, comparing the extracted elements with the element E1 for consistency each time, obtaining the total number F1 of elements consistent with the element E1, and calculating the frequency weight G1 of the element E1 using the formula G1=F1 / b; S183: re-mark the previous list to which the elements consistent with element E1 extracted in S182 belong as the first branch list of the compressed reference list D1, and then extract the elements with subscript index 1 from all the first branch lists respectively, and compare the extracted elements with element E2 for consistency each time, obtain the total number F2 of elements consistent with element E2, and calculate the frequency weight G2 of element E2 using the formula G2=F2 / h1, where h1 is the total number of the first branch list of the compressed reference list D1; S184: re-marking the first branch list to which the elements consistent with the element E2 extracted in S183 belong as the second branch list of the compressed reference list D1, and then extracting the elements with the subscript index 2 from all the second branch lists respectively, and comparing the extracted elements with the element E3 for consistency each time, obtaining the total number F3 of elements consistent with the element E3, and calculating the frequency weight G3 of obtaining the element E3 using the formula G3=F3 / h2, where h2 is the total number of the second branch lists of the compressed reference list D1; S185: re-mark the second split list to which the element consistent with the element E3 extracted in S184 belongs as the third split list of the compressed reference list D1, and then extract the elements with the subscript index 3 from all the third split lists respectively, and compare the extracted elements with the element E4 for consistency each time, obtain the total number F4 of elements consistent with the element E4, and calculate the frequency weight G4 of the element E4 using the formula G4=F4 / h3, where h3 is the total number of the third split list of the compressed reference list D1; S186: Calculate and obtain the frequency evaluation index I1 of the compressed reference list D1 using the formula I1=G1×ɑ1+G2×ɑ2+G3×ɑ3+G4×ɑ4, where ɑ1, ɑ2, ɑ3 and ɑ4 are respectively the first, second, third and fourth weight proportion factors preset; S19: According to S18, the frequency evaluation indices I2, I3, ..., Id of the compressed reference lists D2, D3, ..., Dd are calculated in sequence.
6. The ultra-high definition video compression transmission system according to claim 1, It is characterized in that The first compression branch and the second compression branch of constructing a plurality of compression reference lists are divided into the following steps: S110: Construct the first and second compression branches of the compression reference list D1 according to the preset diversion construction rules. The diversion construction rules are as follows: SS1: Filter out the compressed reference lists corresponding to the frequency evaluation indicators whose values are greater than or equal to P3 from the frequency evaluation indicators I1, I2, ..., Id of the compressed reference lists D1, D2, ..., Dd, and recalibrate all the filtered compressed reference lists to J1, J2, ..., Jj in descending order of the frequency evaluation indicators, 1≤j≤d, where P3 is the preset frequency indicator screening threshold; SS2: extract the elements with subscript indices 0, 1, 2, and 3 in the compressed reference list J1 in sequence, and label them as K1, K2, K3, and K4 respectively; SS3: Filter out several compressed reference lists from the compressed reference lists J2, J3, ..., Jj, and select the compressed reference list with the largest frequency evaluation index as the first diversion list of the compressed reference list J1; SS4: Filter out a number of compressed reference lists from the compressed reference lists J2, J3, ..., Jj, and select the compressed reference list with the largest frequency evaluation index as the second diversion list of the compressed reference list J1; SS5: Filter out a number of compressed reference lists from the compressed reference lists J2, J3, ..., Jj and select the compressed reference list with the largest frequency evaluation index as the third diversion list of the compressed reference list J1; SS6: Use the selected first, second and third flow lists as the first compression branch of the compression reference list J1; SS7: Map the elements with subscript indices 1, 2, and 3 in the compressed reference list J1 to the character 0, map the elements with subscript indices 1, 2, and 3 in the first diversion list to the characters 0, 0, and 1 in sequence, map the elements with subscript indices 1, 2, and 3 in the second diversion list to the characters 0, 1, and 0 in sequence, and map the elements with subscript indices 1, 2, and 3 in the third diversion list to the characters 0, 0, and 1 in sequence; SS8: Filter out a number of compressed reference lists from the compressed reference lists J2, J3, ..., Jj, and select the compressed reference list with the largest frequency evaluation index as the fourth branch list of the compressed reference list J1; SS9: Filter out a number of compressed reference lists from the compressed reference lists J2, J3, ..., Jj, and select the compressed reference list with the largest frequency evaluation index as the fifth branch list of the compressed reference list J1; SS10: Filter out a number of compressed reference lists from the compressed reference lists J2, J3, ..., Jj, and select the compressed reference list with the largest frequency evaluation index as the sixth diversion list of the compressed reference list J1; SS11: Filter out a number of compressed reference lists from the compressed reference lists J2, J3, ..., Jj, and select the compressed reference list with the largest frequency evaluation index as the seventh branch list of the compressed reference list J1; SS12: Use the selected fourth, fifth, sixth and seventh branch lists as the second compression branch of the compressed reference list J1; SS13: Map the elements with subscript indexes 1, 2, and 3 in the fourth diversion list to the characters 1, 0, and 0 in sequence, map the elements with subscript indexes 1, 2, and 3 in the fifth diversion list to 1, 0, and 1 in sequence, map the elements with subscript indexes 1, 2, and 3 in the sixth diversion list to 1, 1, and 0 in sequence, and map the elements with subscript indexes 1, 2, and 3 in the seventh diversion list to 1, 1, and 1 in sequence; S111: In the order of the compressed reference lists J2, J3, ..., Jj, all the compressed reference lists that have not been selected as the diversion lists are selected in turn, and the first and second compression branches thereof are constructed based on all the selected compressed reference lists according to S110.
7. The ultra-high definition video compression transmission system according to claim 6, It is characterized in that In SS3, the elements in the first shunt list satisfy the first shunt condition: the elements with subscript indexes 0, 1, and 2 in the first shunt list are K1, K2, and K3, respectively, and the element with subscript index 3 in the first shunt list is not K4; In SS4, the elements in the second split list satisfy the second split condition: the elements with subscript indexes 0 and 1 in the second split list are K1 and K2 respectively, and the element with subscript index 2 in the second split list is not K3; In SS5, the elements in the third diversion list satisfy the third diversion condition: the elements in the third diversion list with subscript indexes 0, 1, and 2 are respectively consistent with the elements in the second diversion list with subscript indexes 0, 1, and 2, and the element in the third diversion list with subscript 3 is inconsistent with the element in the second diversion list with subscript 3.
8. The ultra-high definition video compression transmission system according to claim 6, It is characterized in that In SS8, the fourth flow splitting list satisfies the fourth flow splitting condition: the element with subscript index 0 in the fourth flow splitting list is K1, and the element with subscript index 1 in the fourth flow splitting list is not K2; In SS9, the fifth diversion list satisfies the fifth diversion condition: the elements with subscript indexes 0 and 1 in the fifth diversion list are K1 and K2 respectively, the element with subscript index 2 in the fifth diversion list is the same as the element with subscript index 2 in the fourth diversion list, and the element with subscript index 3 in the fifth diversion list is different from the element with subscript index 3 in the fourth diversion list; In SS10, the sixth diversion list satisfies the sixth diversion condition: the elements with subscript indexes 0 and 1 in the sixth diversion list are respectively the same as the elements with subscript indexes 0 and 1 in the fourth diversion list, and the element with subscript index 2 in the sixth diversion list is not the same as the element with subscript index 2 in the fourth diversion list; In SS11, the seventh diversion list satisfies the seventh diversion condition: the elements with subscript indexes 0, 1, and 2 in the seventh diversion list are the same as the elements with subscript indexes 0, 1, and 2 in the sixth diversion list, and the elements with subscript index 3 in the seventh diversion list are not the same as the elements with subscript index 3 in the sixth diversion list.
9. The ultra-high definition video compression transmission system according to claim 2, It is characterized in that The steps to generate several compressed data packets of all the above lists are as follows: SS21: Label the elements in the previous list B1 with subscript indices 0, 1, 2, and 3 as L1, L2, L3, and L4, respectively; SS22: Then, all the shunt lists contained in the first and second compression branches of all the selected compression reference lists are traversed, and if there is a shunt list with elements of subscript indexes 0, 1, 2, and 3 corresponding to L1, L2, L3, and L4, respectively, then the associated characters of the elements of the shunt list with subscript indexes 1, 2, and 3 are extracted in sequence; The element L1 and the associated characters with subscript indices 1, 2, and 3 are concatenated to obtain the compressed string of the previous list B1, and the compressed data packet of the previous list B1 is generated based on the compressed string; SS23: If there is no element with subscript index 0, 1, 2, 3 corresponding to L1, L2, L3, L4 in a certain flow list, then extract the values corresponding to the elements L1, L2, L3 and L4 in sequence from the preset front compression dictionary, and generate a compressed data packet of the front list B1 for each extracted value, and 4 compressed data packets can be obtained based on the front list B1; SS24: Generate several compressed data packets of the previous lists B2, B3, ..., Bb in sequence according to SS21 to SS23, and transmit the corresponding several compressed data packets to the cloud sharing platform in sequence according to the sequence of the previous lists B1, B2, ..., Bb; At the same time, the first and second compression branches of the selected compression reference lists are synchronously transmitted to the cloud sharing platform.
