CN116723337B - HDMI high definition data optimized transmission method and system - Google Patents
HDMI high definition data optimized transmission method and system Download PDFInfo
- Publication number
- CN116723337B CN116723337B CN202311001629.3A CN202311001629A CN116723337B CN 116723337 B CN116723337 B CN 116723337B CN 202311001629 A CN202311001629 A CN 202311001629A CN 116723337 B CN116723337 B CN 116723337B
- Authority
- CN
- China
- Prior art keywords
- character
- merging
- sliding window
- marked
- string
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 40
- 230000005540 biological transmission Effects 0.000 title claims abstract description 35
- 230000035772 mutation Effects 0.000 claims abstract description 28
- 230000009466 transformation Effects 0.000 claims abstract description 18
- 230000008859 change Effects 0.000 claims abstract description 11
- 238000006243 chemical reaction Methods 0.000 claims description 23
- 238000011549 displacement method Methods 0.000 claims description 6
- 238000005457 optimization Methods 0.000 claims description 5
- 230000011218 segmentation Effects 0.000 claims description 5
- 238000006073 displacement reaction Methods 0.000 claims description 4
- 239000003550 marker Substances 0.000 claims description 3
- 238000007906 compression Methods 0.000 abstract description 16
- 230000006835 compression Effects 0.000 abstract description 16
- 230000000295 complement effect Effects 0.000 description 8
- 238000013144 data compression Methods 0.000 description 6
- 230000000694 effects Effects 0.000 description 6
- 230000008569 process Effects 0.000 description 3
- 238000006467 substitution reaction Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 230000006837 decompression Effects 0.000 description 2
- 238000003672 processing method Methods 0.000 description 2
- 241000287196 Asthenes Species 0.000 description 1
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000002411 adverse Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 230000001788 irregular Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000007781 pre-processing Methods 0.000 description 1
- 238000001454 recorded image Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The invention relates to the technical field of image data transmission, in particular to an HDMI high-definition data optimized transmission method and system, comprising the following steps: obtaining a plurality of bit layers of an image, obtaining a plurality of binary sequences, and obtaining character mutation times according to the similarity relation among characters in the binary sequences; obtaining a merging coefficient, obtaining a merging type according to the value of the merging coefficient, obtaining a marked character sub-string, obtaining a change mode of characters in the marked character sub-string according to the ratio of strong and weak association relations among the characters in the marked character sub-string, obtaining an optimal character combination according to the distribution density degree of the characters in the character combination type with the largest frequency in the marked character sub-string, obtaining the calculated character sub-string according to the change mode of the characters in the marked character sub-string and the optimal character combination, and compressing and transmitting. The invention makes the redundancy degree of the character string as large as possible by carrying out character transformation of different degrees on the binary sequence, thereby achieving the purpose of high-efficiency compression.
Description
Technical Field
The invention relates to the technical field of image data transmission, in particular to an HDMI high-definition data optimized transmission method and system.
Background
The digital audio-video interface standard is widely applied to high-definition televisions, computer displays, projectors and other devices to realize high-quality audio-video transmission. Due to the high transmission pressure ∈>Problems such as signal attenuation and delay are easy to occur in the transmission process, and the problems can cause adverse effects such as image quality degradation and audio distortion. The existing solution is usually a physical solution, and the cable quality is improved, but the method has high cost and strong limitation, so the invention compresses the audio and video data by adopting a high-efficiency data compression algorithm, reduces the data quantity and reduces the bandwidth requirement during transmission. At the receiving end, the data is decompressed by using a corresponding decompression algorithm, and the original audio and video data is recovered, so that the aim of optimized transmission of HDMI high-definition data is fulfilled.
Considering compression effect and decompression efficiency, the traditional compression algorithm generally adopts run-length coding to perform compression processing, but the run-length coding only has a good compression effect on data with large redundancy degree, and is difficult to effectively compress the data with small redundancy degree.
The invention obtains the corresponding binary data by carrying out code conversion on the image data to be compressed, obtains the binary data of different layers by carrying out bit layering on the binary data, and achieves the aim of improving the data compression rate by carrying out self-adaptive change sequencing on the data of different layers and carrying out exclusive OR operation to ensure that the data redundancy degree of each bit layer is as large as possible, thereby solving the problems of the prior artSignal attenuation, delay and the like generated in the transmission process.
Disclosure of Invention
The invention provides an HDMI high-definition data optimized transmission method and system, which are used for solving the existing problems.
The invention relates to an HDMI high-definition data optimized transmission method and a system, which adopt the following technical scheme:
in one aspect, an embodiment of the present invention provides an HDMI high-definition data optimized transmission method, including the steps of:
acquiring a video frame image to be compressed and transmitted;
obtaining a plurality of bit layers of a video frame image, obtaining a plurality of binary sequences by scanning each bit layer, and obtaining character mutation times according to the similarity relationship among characters in each binary sequence;
acquiring a merging coefficient according to the mutation times of characters in a binary sequence, acquiring a merging type according to the value of the merging coefficient, merging the characters according to the merging type to acquire a marked character sub-string, and acquiring the preference degree of a change mode of the characters in the marked character sub-string according to the ratio of strong and weak association relations between character combinations in the marked character sub-string, wherein the change mode comprises shift and replacement;
acquiring an optimal character combination according to the density degree of character combination distribution in the character combination type with the largest frequency in the marked character sub-strings, and acquiring the calculated character sub-strings according to the transformation mode with the largest optimization degree and the optimal character combination;
and acquiring the binary sequence character string after operation, acquiring compressed data through code conversion, and transmitting the compressed data.
Preferably, the obtaining the plurality of bit layers of the video frame image includes the following specific steps:
converting the gray value of each pixel point in the video frame image into binary codes, dividing the first and second bits from left to right in the binary codes of each pixel point into first bit layers, dividing the third and fourth bits into second bit layers, and the like to obtain four bit layers.
Preferably, the step of obtaining a plurality of binary sequences by scanning each bit layer and obtaining the number of character mutation times according to the similarity relationship between characters in each binary sequence includes the following specific steps:
scanning each bit layer by adopting a z-shaped scanning method to obtain each binary sequence, taking the first character in each binary sequence as a starting point of a sliding window, establishing the sliding window with the length of n in a preset size, comparing the first character in the sliding window with the second character in the sliding window, wherein the first character in the sliding window is identical to the second character in the sliding window, adding 0 for mutation times, wherein the first character in the sliding window is different from the second character in the sliding window, adding one for mutation times, comparing all adjacent characters in the sliding window, and iteratively stopping until the last character in the sliding window is compared, thereby obtaining the character mutation times of the character string in the sliding window.
Preferably, the merging coefficient is obtained according to the number of character mutation times in the binary sequence, and the specific formula is as follows:
where b represents the merging coefficient of adjacent sliding windows, n represents the sliding window size,indicating the>And the result of the exclusive nor operation of the individual characters.
Preferably, the step of merging the characters according to the merging type to obtain the marked character sub-string includes the following specific steps:
starting from a first sliding window in the binary sequence, if the merging coefficients of the first sliding window and the second sliding window belong to the same class of merging coefficients as the merging coefficients of the second sliding window and the third sliding window, continuing to judge whether the merging coefficients of the second sliding window and the third sliding window belong to the same class of merging coefficients as the merging coefficients of the third sliding window and the fourth sliding window, if so, continuing to judge whether the merging coefficients of the third sliding window and the fourth sliding window and the merging coefficients of the fifth sliding window belong to the same class of merging coefficients, and sequentially analogizing until the merging coefficients of the ith sliding window and the (i+1) sliding window and the merging coefficients of the (i+2) sliding window are not in the same class of merging coefficients, and recording the character strings in the ith+1 sliding window and before the ith+1 sliding window as a first character string;
removing the first character sub-string from each binary sequence, and continuing the self-adaptive segmentation processing of the rest binary sequences until all characters in the first binary sequence are judged to be finished, and stopping, so that a plurality of character sub-strings are obtained; and marking all character sub-strings belonging to the third class of merging coefficients to obtain marked character sub-strings, and marking the marked character sub-strings as marked character sub-strings.
Preferably, the step of merging the characters according to the merging type to obtain the marked character sub-string includes the following specific steps:
the merging type comprises a first merging type, a second merging type and a third merging type, when the value of the merging coefficient is 1, the merging coefficient is marked as a first merging coefficient, and the value result of the merging coefficient belongs to the first merging coefficient and is marked as the first merging type; when the value of the merging coefficient is 0, the merging coefficient is marked as a second type merging coefficient and mergedThe value result of the merging coefficients belongs to the second type of merging coefficients and is marked as the second merging type; when the merging coefficient takes the value ofAnd when the value of the merging coefficient belongs to the third type of merging coefficient, the third type of merging coefficient is marked as the third merging type.
Preferably, the obtaining the preferred degree of the changing mode of the characters in the marked character sub-string according to the ratio of the strong and weak association relationship between the character combinations in the marked character sub-string includes the following specific steps:
taking the first character in the first marked character sub-string as the starting point of the sliding window, and establishing a preset size asThe sliding window sliding step length is 1, the types of character combinations in all sliding windows in the first marked character sub-string are counted, a statistical histogram is established, the character combination type with the largest frequency in the statistical histogram is obtained, then the character combination type frequency number with the character combination type with the largest frequency in the statistical histogram being in a strong association relation is obtained, the preference degree of a conversion mode is obtained according to the frequency number of the character combination with the largest frequency in the statistical histogram, the character combination type with the largest frequency is in the strong association relation with each other, and the preference degree of the conversion mode is as follows:
in the middle ofIndicating the degree of preference of the transformation of the first marker character sub-string, < >>Representing the number of character combination types which are in strong association with the character combination type with the largest frequency in the statistical histogram, and the number of character combination types is->Indicate->Frequency of character combinations with strong association relationship with the character combination type with largest frequency in the statistical histogram, < ->The sum of the frequency numbers representing all character combinations in the first tagged character sub-string.
Preferably, the obtaining the optimal character combination according to the intensity of the character combination distribution in the character combination type with the largest frequency in the marked character sub-string includes the following specific steps:
the optimal character combination type primitive is the character combination type with the largest frequency in the statistical histogram; if a plurality of character combination types with the largest frequency exist in the statistical histogram, judging the density degree of character combination distribution in the character combination type with the largest frequency in the marked character substring, and selecting the character combination type with the largest density degree as an optimal character combination type element.
Preferably, the obtaining the operated character sub-string according to the transformation mode with the maximum preference degree and the optimal character combination includes the following specific steps:
selecting a corresponding conversion mode to perform character conversion on the marked character sub-strings, recording the positions of converted characters, recording the positions of the conversion if a displacement method is adopted, and recording the positions and the step sizes of the displacement if a displacement method is adopted;
if a shifting method is adopted, character sub-strings with the same length as the first marked character sub-string are established according to the optimal character combination type primitive, the character sub-strings are marked as template character sub-strings, the two character sub-strings are matched, the position with the largest difference is preferentially moved, iteration is stopped until the similarity of the two character sub-strings is the largest, wherein backward movement is marked as +, and forward movement is marked as-; and obtaining the operated character substring.
On the other hand, the embodiment of the invention provides an HDMI high-definition data optimization transmission system, which comprises a data acquisition module, a data transmission module and a data transmission module, wherein the data acquisition module is used for acquiring video frame images to be compressed and transmitted; the data conversion module is used for obtaining a plurality of bit layers of the video frame image, obtaining a plurality of binary sequences by scanning each bit layer, and obtaining character mutation times according to the similarity relationship among characters in each binary sequence;
acquiring a merging coefficient according to the mutation times of characters in a binary sequence, acquiring a merging type according to the value of the merging coefficient, merging the characters according to the merging type to acquire a marked character sub-string, and acquiring the preference degree of a change mode of the characters in the marked character sub-string according to the ratio of strong and weak association relations between character combinations in the marked character sub-string, wherein the change mode comprises shift and replacement;
acquiring an optimal character combination according to the density degree of character combination distribution in the character combination type with the largest frequency in the marked character sub-strings, and acquiring the calculated character sub-strings according to the transformation mode with the largest optimization degree and the optimal character combination;
the data compression transmission module is used for acquiring the binary sequence character string after operation, acquiring compressed data through code conversion and transmitting the compressed data.
The technical scheme of the invention has the beneficial effects that: the method comprises the steps of carrying out binary conversion on gray values of pixel points and carrying out bit layering, so that the redundancy degree of binary data of the same bit layer is as large as possible, carrying out self-adaptive marking on sequences constructed by each bit layer, obtaining data subsections with poor regularity, carrying out conversion on the data subsections with poor regularity to enhance the regularity, carrying out exclusive nor operation on the processed binary data, and maximizing the redundancy degree of the binary sequence, so that the final compression rate is maximized, thereby achieving the purpose of efficient transmission.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flowchart of steps of an HDMI high-definition data optimized transmission method of the present invention.
Detailed Description
In order to further describe the technical means and effects adopted by the present invention to achieve the preset purpose, the following detailed description refers to specific implementation, structure, features and effects of an HDMI high-definition data optimized transmission method and system according to the present invention with reference to the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" means that the embodiments are not necessarily the same. Furthermore, the particular features, structures, or characteristics of one or more embodiments may be combined in any suitable manner.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
The following specifically describes a specific scheme of the optimized transmission method and system for HDMI high-definition data provided by the present invention with reference to the accompanying drawings.
Referring to fig. 1, a flowchart of steps of an HDMI high-definition data optimized transmission method according to an embodiment of the present invention is shown, the method includes the steps of:
s001, acquiring a video frame to be compressed and transmitted, and preprocessing to obtain a single-channel binary image.
Will beThe output is connected to the input port of the dispenser, which is then connected to the input port of the video capture card. The video capture card can be +.>The signal is converted into computer readable data, and the recorded image data is transferred to compression processing system by using correspondent software for recording or processing, and the obtained data is video frame image data or audio dataTaking video frame image data as an example, the commonly acquired image is a three-channel RGB image, if color difference information of the image is not required to be reserved, the image is subjected to gray-scale processing to obtain a single-channel gray-scale image, if the color information of the image is required to be reserved, the three-channel image is respectively subjected to compression processing, as shown in FIG. 1, and the three-channel image is three-channelThe digital image of each channel is processed by the subsequent compression processing.
The gray value of each pixel point of the acquired video frame image is processed, the gray value is decimal data, and the range of gray level is 0-255, so that the decimal number is converted into an eight-bit binary number, and the gray values of all the pixel points are subjected to binary conversion, so that a converted first binary video frame image is obtained.
S002, obtaining a plurality of bit layer images through bit layering.
It should be noted that: when the run-length coding is adopted for data compression, when the redundancy degree of a data string is larger, the compression effect is better, but when the redundancy degree of data is smaller, effective compression is difficult to carry out, because the gray value of a video frame image has local similarity, for an eight-bit binary data string of a single pixel point, the redundancy degree is smaller, but the same positions of eight-bit binary data strings of a plurality of local pixel points are always the same, the first binary video frame is subjected to layering processing by adopting bit layering, a first bit layer, a second bit layer, a third bit layer and a fourth bit layer are obtained, the processing necessary degree of the data segments is obtained by screening the data segments of each bit layer, and the optimal operation rule of each data segment is obtained, and the redundancy degree of the data is maximized by carrying out exclusive nor operation on the processed data, namely the data compression rate is ensured to be maximum.
The first binary video frame image is subjected to bit layering processing, the gray value of each pixel point position is converted into a binary coded data string with the length of eight through eight bits of binary conversion, for example, the gray value of the first pixel point position from the upper right corner in the first binary video frame image is 54, and the corresponding eight bits of binary coded data string is 00110110.
There is often a greater similarity between the higher order bits of the binary code of the image data, where the eight-bit binary code is the highest order bit from left to right, the eighth order bit from left to right is the lowest order bit, e.g., the decimal number 11000000 is 192, the decimal number 10000000 is 128, and if the higher order bits of the binary code are to be converted, e.g., from 11 to 10, the minimum difference between the corresponding decimal numbers is 192-128=64, where, for example, the higher order bits of the eight-bit binary code are used, the greater the number of bits of the binary code, the greater the difference value of the higher order bits are, and the image data often has a local similarity, and the local gray values are different, but the difference is usually within a certain range. The redundancy degree of the decimal gray values is low, compression storage is difficult, so that the image gray values are converted into binary sequences, and high-order binary data often have strong similarity, so that the binary coded data strings are subjected to layering treatment, and the data similarity of the same level is large. Bit threshold selection when bit layering is employedNamely, the first bit and the second bit from left to right in the eight-bit binary coding of each pixel point in the first binary video frame image are divided into a first bit layer, the third bit and the fourth bit are divided into a second bit layer, and the like, so that four bit layers are obtained. And carrying out the processing on all pixel points in the first binary video frame image to obtain four bit layers which are equal to the size of the first binary video frame image.
S003, acquiring a binary sequence of a bit layer, and acquiring mutation times according to the transformation of characters.
And scanning each bit layer by adopting a z-type scanning method to obtain four binary sequences which are respectively marked as a first binary sequence, a second binary sequence, a third binary sequence and a fourth binary sequence, wherein each binary sequence only comprises two values of 0 and 1. The analysis can obtain that when the values in the binary sequence are 1 or 0, and the run-length coding is adopted for compression, the compression rate can reach the maximum, but in the practical situation, 0 and 1 in the sequence show irregular distribution, and the analysis finds that if a single character shows continuous distribution or 0 and 1 show alternate distribution, the redundancy degree of the characters after the adjacent characters are subjected to the exclusive nor operation is increased, for example, the character string is as follows: 11111111000000001010101010101010, the adjacent characters are processed by the exclusive nor operation and then become 1111111011111110000000000000000, and the redundancy degree of the data is obviously greater than that of the original data, so that the data of the type is selected and processed, character strings which are alternately distributed and continuously distributed are marked as target character strings, data segments which are not of the type are marked, and the data of the type is converted into data of the type as far as possible, and the specific process is as follows:
the first character in the first binary sequence is used as the starting point of the sliding window to establish the sliding window with the size and the length of n, and the embodiment is thatFor example, other values may be set during implementation, the embodiment is not limited specifically, the sliding step length of the sliding window is 1, the number of character mutation times of the character string in the sliding window is calculated, and the number of mutation times is ∈ ->The method for obtaining the mutation times comprises the following steps: comparing a first character in the sliding window with a second character in the sliding window, if the first character in the sliding window is the same as the second character in the sliding window, the mutation times are 0, if the first character in the sliding window is different from the second character in the sliding window, the mutation times are increased by one, the second character in the sliding window is compared with a third character in the sliding window in a similar way, if the first character in the sliding window is different from the second character in the sliding window, the mutation times are increased by one, until iteration is stopped after the last character in the sliding window is compared, and the character mutation times of character strings in the sliding window are obtained.
S004, carrying out self-adaptive segmentation on the binary sequence according to the mutation times to obtain the marked character substring.
According to the character mutation times of the character strings in the sliding windows, the sliding windows are combined, namely, the character strings in the adjacent sliding windows are subjected to the exclusive nor operation, and the characters in the same position in the adjacent sliding windows are subjected to the exclusive nor operationThe result of (2) is recorded asObtaining a merging coefficient according to the result of the exclusive nor operation, wherein the merging coefficient is as follows:
where b represents the merging coefficient of adjacent sliding windows, n represents the sliding window size,indicating the>And the result of the exclusive nor operation of the individual characters. The value result of the merging coefficient is three types, when the value of the merging coefficient is 1, the merging coefficient is marked as a first type merging coefficient, the value result of the merging coefficient belongs to the first type merging coefficient and is marked as a first merging type, and the characters in two adjacent sliding windows are indicated to be 0 or 1; when the value of the merging coefficient is 0, the merging coefficient is marked as a second merging coefficient, the merging coefficient of the second merging coefficient is marked as a second merging type, the character in two adjacent sliding windows is complementary, for example, the character in the sliding window 1 is 010, the character in the sliding window 2 is 101, when the merging coefficient of the adjacent sliding windows is 0 or 1, the character string after merging exactly meets the requirement of the target character string, and when the merging coefficient of the adjacent sliding windows is marked as the value of the merging coefficientWhen the character string is marked as a third type of merging coefficient, the merging coefficient value result belongs to the third type of merging coefficient, the character string after merging is marked as a third merging type, but the character string just meets the marking requirement, and the self-adaptive segmentation processing is carried out on the first binary sequence, wherein the specific method comprises the following steps:
starting from the first sliding window in the first binary sequence, if the merging coefficients of the first sliding window and the second sliding window belong to the same class of merging coefficients as the merging coefficients of the second sliding window and the third sliding window, continuing to judge whether the merging coefficients of the second sliding window and the third sliding window belong to the same class of merging coefficients as the merging coefficients of the third sliding window and the fourth sliding window, if so, continuing to judge whether the merging coefficients of the third sliding window and the fourth sliding window and the merging coefficients of the fifth sliding window belong to the same class of merging coefficients, and analogizing until the merging coefficients of the ith sliding window and the ith+1 sliding window and the merging coefficients of the ith+2 sliding window do not belong to the same class of merging coefficients, and recording the character strings in the ith+1 sliding window and before the ith+1 sliding window as the first character string. And removing the first character sub-string from the first binary sequence, and continuing the adaptive segmentation processing of the rest first binary sequence until all characters in the first binary sequence are judged to be finished, and stopping, so that a plurality of character sub-strings are obtained. And marking all character sub-strings belonging to the third class of merging coefficients to obtain marked character sub-strings, and marking the marked character sub-strings as marked character sub-strings.
S005, obtaining an optimal operation rule in a self-adaptive mode according to character distribution in the marked character substring.
The character distribution regularity of the marked character sub-strings is weaker, so that the character sub-strings with weaker regularity need to be converted into the character sub-strings with stronger regularity through processing, and the specific process is as follows:
the first character in the first marked character sub-string is taken as the starting point of the sliding window, and the size is established asIn the present embodiment +.>To illustrate, the sliding window slides by a step length of 1, the types of character combinations in all sliding windows in the first marked character sub-string are counted, a statistical histogram is established, the abscissa of the histogram represents the types of the character combinations in the sliding window of the first marked character sub-string, and the ordinate represents the number (frequency) of the character combinations of the corresponding types, wherein the types of the character combinations have four typesThe number of the characters is 00, 01, 10 and 11, and the strong and weak association relationship between the character combinations is determined according to the complementary relationship of the character combinations, if the character combinations are in a complete complementary relationship, for example, 00 and 11 are in a complete complementary relationship, and 10 and 01 are in a complete complementary relationship, the two are in a weak association relationship, if the character combinations are not in a complete complementary relationship, for example, 00 and 01 are not in a complete complementary relationship, and 10 and 11 are not in a complete complementary relationship, the two are in a strong association relationship. The difficulty of presenting the rule of the character combination with weak association relation is high, for example 1100, if 1100 is changed into a regular character string, 00 is changed into 11 or 11 is changed into 00, but if a shift method is adopted, 1100 is changed into 1010, and only one bit is needed to be moved; the difficulty of presenting rules by character combinations with strong association relationship is small, for example 1101, 1101 is changed into a regular character string, and only 0 is changed into 1.
Determining an operation mode according to the frequency of the character combination and the duty ratio of the strong and weak association relation between the character combinations; firstly, obtaining the character combination type with the largest frequency in the statistical histogram, and marking the character combination type asThen, the character combination type frequency number with the biggest character combination type of frequency in the statistical histogram as the strong association relation is obtained and recorded as S, and the preferred degree of the transformation mode is as follows:
in the middle ofIndicating the degree of preference of the transformation of the first marker character sub-string, < >>Representing the number of character combination types which are in strong association with the character combination type with the largest frequency in the statistical histogram, and the number of character combination types is->Indicate->Frequency of character combinations with strong association relationship with the character combination type with largest frequency in the statistical histogram, < ->The sum of the frequency numbers representing all character combinations in the first tagged character sub-string. The greater the degree of preference of the conversion mode of the first marked character sub-string, the more character combinations which show that the character combination types with the greatest frequency are in strong association with each other, so that the larger degree of regularity can be achieved by only changing the value of a small number of characters, and the threshold value of the degree of preference is set>In this embodiment->For example, other values may be set during implementation, and when the preference degree of the transformation mode of the first marked character sub-string is greater than the preset threshold, a replacement method is adopted, and otherwise, a shift method is adopted.
The method for determining the optimal character combination type primitive comprises the following steps: the purpose of the method through replacement or shift is to enable the first marked character sub-string to achieve a larger degree of regularity, so that the optimal character combination type element is the character combination type with the largest frequency in the statistical histogram, namely, other character combination types are all converted into the character combination type with the largest frequency in the statistical histogram; if a plurality of character combination types with the largest frequency exist in the statistical histogram, judging the degree of density of character combination distribution in the character combination type with the largest frequency in the first marked character sub-string, wherein the degree of density is as follows: the frequency of the largest character combination types continuously appears is the largest, the number of the character combination continuous distribution with the largest frequency is larger, the density degree is larger, the distribution density degree is larger, the corresponding character combination types are used as the optimal degree of preference of the optimal character combination type primitives, the density degree is obtained in the prior art, the character combination types with the largest density degree are selected as the optimal character combination type primitives without repeated description, the corresponding transformation mode is selected to perform character transformation on the first marked character sub-string, and the position of the transformed character is recorded. If a displacement method is adopted, the displacement position is recorded, and if a displacement method is adopted, the displacement position and step size are recorded.
If a shift method is adopted, a character sub-string equal to the first marked character sub-string is established according to the optimal character combination type primitive, and is recorded as a template character sub-string, the two character sub-strings are matched, the position with the largest difference is preferentially moved, and iteration is stopped until the similarity of the two character sub-strings reaches the maximum, and the following is an example illustration:
for example, the character sub-string is 110110110, the calculated optimal character combination type primitive is 11, the transformation mode is substitution, if 0 in the character sub-string 110110110 is substituted to 1, the substitution positions are required to be recorded, and the substitution positions are 3, 6 and 9; for example, the character sub-string is 0011011010, the calculated optimal character combination type primitive is 10, the conversion mode is shift, the generated template character sub-string is 1010101010, so the first 0 in the character sub-string 0011011010 is moved backwards by 2 bits, the character sub-string is updated to be 0101011010, the position and the step length of recording movement are recorded and recorded as (1, 2), the process continues, the first 0 in the updated character sub-string 0101011010 is moved backwards by 5 bits, the updated character sub-string is updated to be 1010101010, the position and the step length of recording movement are recorded as (1, 5), the similarity between the updated character sub-string and the template character sub-string is maximum, and the iteration is stopped. Where backward movement is denoted as +, and forward movement is denoted as +. And similarly, carrying out the operation on all the marked character sub-strings to finish the operation of the character sub-strings.
S006, performing code conversion on the binary sequence according to an operation rule, and obtaining compressed data through compression.
After processing, all character sub-strings have stronger rules, so that the adjacent characters of the first binary sequence after operation are subjected to exclusive nor operation, for example, the character strings of the first binary sequence after operation are: 11111111000000001010101010101010 is then processed by or operation and then becomes 1111111011111110000000000000000, the first character of the first binary sequence character string is reserved and used as a decryption wharf, the binary sequence at this time becomes 11111111011111110000000000000000, the redundancy degree of the data is obviously greater than that of the original data, the first binary sequence character string after operation is compressed by run-length coding, compressed data is obtained, the replacement positions, the moving positions and the step length recorded by all the marked character sub-strings are recorded separately, and the identifier is added after the compressed data of the first bit layer. The processing method for other bit layers is the same, and the bit layers are stored in sequence.
S007, transmitting the compressed data, and carrying out data reduction by a receiving end by adopting the same compression rule to obtain the original data.
The compressed data is transmitted, the receiving end decompresses by adopting the same method, the compressed data is divided into four parts according to identifiers and is respectively four bit layers, the compressed data is decoded by run-length coding, the data is restored according to a wharf to obtain data before the same-OR operation, the characters participating in the operation are restored according to the recorded replacement positions, the moving positions and the step length recorded for all the marked character sub-strings, wherein the characters participating in the operation are replaced and shifted, a first bit layer sequence is obtained after all the characters are restored, the first bit layer sequence is restored to the first bit layer according to the image resolution, the processing methods of other bit layers are the same, after the four bit layers are restored, the bit layers are fused in sequence to obtain eight-bit binary character strings, and then the corresponding gray values are obtained by carrying out the binary conversion, and the receiving end completes the decoding of the data.
Through the steps, the HDMI high-definition data optimized transmission method is completed.
The embodiment provides an HDMI high-definition data optimized transmission system, which comprises the following modules:
the data acquisition module is used for acquiring video frame images to be compressed and transmitted;
the data conversion module is used for obtaining a plurality of bit layers of the video frame image, obtaining a plurality of binary sequences by scanning each bit layer, and obtaining character mutation times according to the similarity relationship among characters in each binary sequence;
acquiring a merging coefficient according to the mutation times of characters in a binary sequence, acquiring a merging type according to the value of the merging coefficient, merging the characters according to the merging type to acquire a marked character sub-string, and acquiring the preference degree of a change mode of the characters in the marked character sub-string according to the ratio of strong and weak association relations between character combinations in the marked character sub-string, wherein the change mode comprises shift and replacement;
acquiring an optimal character combination according to the density degree of character combination distribution in the character combination type with the largest frequency in the marked character sub-strings, and acquiring the calculated character sub-strings according to the transformation mode with the largest optimization degree and the optimal character combination;
the data compression transmission module is used for acquiring the binary sequence character string after operation, acquiring compressed data through code conversion and transmitting the compressed data.
The embodiment of the invention provides an HDMI high-definition data optimized transmission system.
The foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather is intended to cover all modifications, equivalents, alternatives, and improvements that fall within the spirit and scope of the invention.
Claims (7)
1. An HDMI high-definition data optimized transmission method is characterized by comprising the following steps:
acquiring a video frame image to be compressed and transmitted;
obtaining a plurality of bit layers of a video frame image, obtaining a plurality of binary sequences by scanning each bit layer, and obtaining character mutation times according to the similarity relationship among characters in each binary sequence;
acquiring a merging coefficient according to the mutation times of characters in a binary sequence, acquiring a merging type according to the value of the merging coefficient, merging the characters according to the merging type to acquire a marked character sub-string, and acquiring the preference degree of a change mode of the characters in the marked character sub-string according to the ratio of strong and weak association relations between character combinations in the marked character sub-string, wherein the change mode comprises shift and replacement;
acquiring an optimal character combination according to the density degree of character combination distribution in the character combination type with the largest frequency in the marked character sub-strings, and acquiring the calculated character sub-strings according to the transformation mode with the largest optimization degree and the optimal character combination;
acquiring the binary sequence character string after operation, acquiring compressed data through code conversion, and transmitting the compressed data;
the method comprises the following specific steps of:
scanning each bit layer by adopting a z-type scanning method to obtain each binary sequence, taking the first character in each binary sequence as a starting point of a sliding window, establishing the sliding window with the length of n in a preset size, comparing the first character in the sliding window with the second character in the sliding window, wherein the first character in the sliding window is identical to the second character in the sliding window, adding 0 for mutation times, wherein the first character in the sliding window is different from the second character in the sliding window, adding one for mutation times, comparing all adjacent characters in the sliding window, and iteratively stopping until the last character in the sliding window is compared to obtain the character mutation times of the character string in the sliding window;
the character is combined according to the combination type to obtain the marked character substring, which comprises the following specific steps:
starting from a first sliding window in the binary sequence, if the merging coefficients of the first sliding window and the second sliding window belong to the same class of merging coefficients as the merging coefficients of the second sliding window and the third sliding window, continuing to judge whether the merging coefficients of the second sliding window and the third sliding window belong to the same class of merging coefficients as the merging coefficients of the third sliding window and the fourth sliding window, if so, continuing to judge whether the merging coefficients of the third sliding window and the fourth sliding window and the merging coefficients of the fifth sliding window belong to the same class of merging coefficients, and sequentially analogizing until the merging coefficients of the ith sliding window and the (i+1) sliding window and the merging coefficients of the (i+2) sliding window are not in the same class of merging coefficients, and recording the character strings in the ith+1 sliding window and before the ith+1 sliding window as a first character string;
removing the first character sub-string from each binary sequence, and continuing the self-adaptive segmentation processing of the rest binary sequences until all characters in the first binary sequence are judged to be finished, and stopping, so that a plurality of character sub-strings are obtained; and marking all character sub-strings belonging to the third class of merging coefficients to obtain marked character sub-strings, and marking the marked character sub-strings as marked character sub-strings.
2. The method for optimized transmission of HDMI data according to claim 1, wherein said obtaining a plurality of bit layers of a video frame image comprises the specific steps of:
converting the gray value of each pixel point in the video frame image into binary codes, dividing the first and second bits from left to right in the binary codes of each pixel point into first bit layers, dividing the third and fourth bits into second bit layers, and the like to obtain four bit layers.
3. The optimized transmission method of HDMI data according to claim 1, wherein the obtaining the merging coefficient according to the number of character mutations in the binary sequence comprises the following specific formulas:
where b represents the merging coefficient of adjacent sliding windows, n represents the sliding window size,indicating the>And the result of the exclusive nor operation of the individual characters.
4. The optimized transmission method of HDMI data according to claim 1, wherein the merging of characters according to the merging type to obtain the tag character substring comprises the following specific steps:
the merging type comprises a first merging type, a second merging type and a third merging type, when the value of the merging coefficient is 1, the merging coefficient is marked as a first merging coefficient, and the value result of the merging coefficient belongs to the first merging coefficient and is marked as the first merging type; when the value of the merging coefficient is 0, the merging coefficient is marked as a second type merging coefficient, and the value result of the merging coefficient belongs to the second type merging coefficient and is marked as a second merging type; when the merging coefficient takes the value ofAnd when the value of the merging coefficient belongs to the third type of merging coefficient, the third type of merging coefficient is marked as the third merging type.
5. The method for optimized transmission of HDMI data according to claim 1, wherein the obtaining the preference degree of the variation pattern of the character in the tag character sub-string according to the ratio of the strong and weak association relationship between the character combinations in the tag character sub-string comprises the following specific steps:
taking the first character in the first marked character sub-string as the starting point of the sliding window, and establishing a preset size asThe sliding window sliding step length is 1, the types of character combinations in all sliding windows in the first marked character sub-string are counted, a statistical histogram is established, and the maximum frequency in the statistical histogram is obtainedThen obtaining the frequency of the character combination type which has strong association relation with the character combination type with the largest frequency in the statistical histogram, and obtaining the preference degree of the transformation mode according to the frequency of the character combination which has strong association relation with the character combination type with the largest frequency in the statistical histogram, wherein the preference degree of the transformation mode is as follows:
in the middle ofIndicating the degree of preference of the transformation of the first marker character sub-string, < >>Representing the number of character combination types which are in strong association with the character combination type with the largest frequency in the statistical histogram, and the number of character combination types is->Indicate->Frequency of character combinations with strong association relationship with the character combination type with largest frequency in the statistical histogram, < ->The sum of the frequency numbers representing all character combinations in the first tagged character sub-string.
6. The method for optimized transmission of HDMI data according to claim 4, wherein said obtaining optimal character combinations according to the degree of density of character combination distribution in the character combination type with the greatest frequency in the tag character sub-string comprises the steps of:
the optimal character combination type primitive is the character combination type with the largest frequency in the statistical histogram; if a plurality of character combination types with the largest frequency exist in the statistical histogram, judging the density degree of character combination distribution in the character combination type with the largest frequency in the marked character substring, and selecting the character combination type with the largest density degree as an optimal character combination type element.
7. The method for optimized transmission of HDMI data according to claim 1, wherein the obtaining the operated character sub-string according to the transformation mode with the greatest degree of preference and the optimal character combination comprises the following steps:
selecting a corresponding conversion mode to perform character conversion on the marked character sub-strings, recording the positions of converted characters, recording the positions of the conversion if a displacement method is adopted, and recording the positions and the step sizes of the displacement if a displacement method is adopted;
if a shifting method is adopted, character sub-strings with the same length as the first marked character sub-string are established according to the optimal character combination type primitive, the character sub-strings are marked as template character sub-strings, the two character sub-strings are matched, the position with the largest difference is preferentially moved, iteration is stopped until the similarity of the two character sub-strings is the largest, wherein backward movement is marked as +, and forward movement is marked as-; and obtaining the operated character substring.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311001629.3A CN116723337B (en) | 2023-08-10 | 2023-08-10 | HDMI high definition data optimized transmission method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311001629.3A CN116723337B (en) | 2023-08-10 | 2023-08-10 | HDMI high definition data optimized transmission method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116723337A CN116723337A (en) | 2023-09-08 |
| CN116723337B true CN116723337B (en) | 2023-11-24 |
Family
ID=87866467
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311001629.3A Active CN116723337B (en) | 2023-08-10 | 2023-08-10 | HDMI high definition data optimized transmission method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116723337B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116915258B (en) * | 2023-09-12 | 2023-12-01 | 湖南省湘辉人力资源服务有限公司 | Enterprise pay management method and system |
| CN116915260B (en) * | 2023-09-13 | 2023-11-24 | 无锡市明通动力工业有限公司 | Wind power motor cooling fan fault data optimization acquisition method |
| CN117134777B (en) * | 2023-10-27 | 2024-01-26 | 苏州英孚思科技有限公司 | Intelligent compression method for positioning data |
| CN117155407B (en) * | 2023-10-31 | 2024-04-05 | 博洛尼智能科技（青岛）有限公司 | Intelligent mirror cabinet disinfection log data optimal storage method |
| CN117195006B (en) * | 2023-11-06 | 2024-03-05 | 南通双和食品有限公司 | Veterinary drug residue data management system for chicken |
| CN117254819B (en) * | 2023-11-20 | 2024-02-27 | 深圳市瑞健医信科技有限公司 | Medical waste intelligent supervision system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20130015798A (en) * | 2011-08-05 | 2013-02-14 | 고려대학교 산학협력단 | Apparatus and method for encoding/coding data |
| CN106529532A (en) * | 2016-11-07 | 2017-03-22 | 湖南源信光电科技有限公司 | License plate identification system based on integral feature channels and gray projection |
| CN110995753A (en) * | 2019-12-19 | 2020-04-10 | 中国电力科学研究院有限公司 | Combined compression method for remote communication message in electricity consumption information acquisition system |
| WO2022015509A1 (en) * | 2020-07-15 | 2022-01-20 | Interdigital Patent Holdings, Inc. | Systems, apparatus and methods to enhance delivery and presentation of content |
| CN116303374A (en) * | 2023-05-22 | 2023-06-23 | 深圳市维度数据科技股份有限公司 | Multi-dimensional report data optimization compression method based on SQL database |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2530311B (en) * | 2014-09-19 | 2017-01-11 | Imagination Tech Ltd | Data compression |
-
2023
- 2023-08-10 CN CN202311001629.3A patent/CN116723337B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20130015798A (en) * | 2011-08-05 | 2013-02-14 | 고려대학교 산학협력단 | Apparatus and method for encoding/coding data |
| CN106529532A (en) * | 2016-11-07 | 2017-03-22 | 湖南源信光电科技有限公司 | License plate identification system based on integral feature channels and gray projection |
| CN110995753A (en) * | 2019-12-19 | 2020-04-10 | 中国电力科学研究院有限公司 | Combined compression method for remote communication message in electricity consumption information acquisition system |
| WO2022015509A1 (en) * | 2020-07-15 | 2022-01-20 | Interdigital Patent Holdings, Inc. | Systems, apparatus and methods to enhance delivery and presentation of content |
| CN116303374A (en) * | 2023-05-22 | 2023-06-23 | 深圳市维度数据科技股份有限公司 | Multi-dimensional report data optimization compression method based on SQL database |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116723337A (en) | 2023-09-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN116723337B (en) | HDMI high definition data optimized transmission method and system | |
| US20010003544A1 (en) | Image processing apparatus and method and storage medium | |
| JP4365957B2 (en) | Image processing method and apparatus and storage medium | |
| CN107481295B (en) | Image compression system of convolutional neural network based on dynamic byte length distribution | |
| CN1155221C (en) | Method and system for encoding and decoding method and system | |
| US6614939B1 (en) | Image compression apparatus and decoding apparatus suited to lossless image compression | |
| CN115242475A (en) | Big data secure transmission method and system | |
| CN116405574B (en) | Remote medical image optimization communication method and system | |
| KR20070046852A (en) | System and method for compression of mixed graphic and video sources | |
| JP4784281B2 (en) | Decoding device, inverse quantization method, and program thereof | |
| CN115955569B (en) | Monitoring video data transmission method for animal epidemic prevention quarantine center | |
| CN102396223A (en) | Method of compression of graphics images and videos | |
| CN111787335B (en) | Reversible information hiding method based on AMBTC compression technology and Huffman coding | |
| CN107105208A (en) | A kind of lossless coding and coding/decoding method of Bayer images | |
| CN111131828B (en) | Image compression method and device, electronic equipment and storage medium | |
| JP2017192078A (en) | Picture encoder and control method thereof | |
| JPH08280014A (en) | Video signal encoding device | |
| US8311090B2 (en) | Method for encoding a first and a second data word | |
| CN116668710A (en) | Color image transmission method, system, device and storage medium | |
| US5699122A (en) | Method and apparatus for encoding a video signal by using a modified block truncation coding method | |
| CN108833920A (en) | A kind of DVC side information fusion method based on light stream and Block- matching | |
| Al-Hashemi et al. | A Grayscale Semi-Lossless Image Compression Technique Using RLE. | |
| CN113822801A (en) | Compressed video super-resolution reconstruction method based on multi-branch convolutional neural network | |
| JP4054430B2 (en) | Image processing apparatus and method, and storage medium | |
| US7016541B2 (en) | Image processing method for facilitating data transmission |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |