CN109922329A - Compression method, decompression method and the device of virtual reality imagery data - Google Patents
Compression method, decompression method and the device of virtual reality imagery data Download PDFInfo
- Publication number
- CN109922329A CN109922329A CN201711336475.8A CN201711336475A CN109922329A CN 109922329 A CN109922329 A CN 109922329A CN 201711336475 A CN201711336475 A CN 201711336475A CN 109922329 A CN109922329 A CN 109922329A
- Authority
- CN
- China
- Prior art keywords
- pixel point
- point sequence
- compressed
- packed
- pixel
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000007906 compression Methods 0.000 title claims abstract description 129
- 230000006835 compression Effects 0.000 title claims abstract description 126
- 238000000034 method Methods 0.000 title claims abstract description 92
- 230000006837 decompression Effects 0.000 title claims abstract description 58
- 239000011159 matrix material Substances 0.000 claims abstract description 166
- 230000008569 process Effects 0.000 claims description 35
- 230000001404 mediated effect Effects 0.000 claims description 15
- 238000005056 compaction Methods 0.000 claims description 12
- 239000002956 ash Substances 0.000 claims description 7
- 235000002918 Fraxinus excelsior Nutrition 0.000 claims description 4
- 230000008901 benefit Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 7
- 230000005540 biological transmission Effects 0.000 description 6
- 230000009467 reduction Effects 0.000 description 5
- 230000000694 effects Effects 0.000 description 3
- 238000004590 computer program Methods 0.000 description 2
- 238000012935 Averaging Methods 0.000 description 1
- 101100395023 Neurospora crassa (strain ATCC 24698 / 74-OR23-1A / CBS 708.71 / DSM 1257 / FGSC 987) his-7 gene Proteins 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000005094 computer simulation Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000004927 fusion Effects 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
Landscapes
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The present invention relates to the compression method of Image Compression field more particularly to virtual reality imagery data, decompression method and devices, comprising: obtains VR image data to be compressed；It based on default compression factor, treats every row pixel point sequence to be compressed that packed pixel dot matrix includes and compresses, obtain packed pixel dot matrix, will be exported as compression VR image data；Determine the quantity Q ' for the packed pixel point that the i-th row pressure contracting pixel point sequence includesi；Establishing includes Q 'iA packed pixel point and the i-th row pressure contracting pixel point sequence with the i-th row pixel point sequence to be compressed with identical image length；I-th row pixel point sequence to be compressed is aligned with the i-th row pressure contracting pixel point sequence head and the tail；The weighted average of m nearest apart from jth packed pixel point in the i-th row pixel point sequence to be compressed pixels to be compressed is calculated, and using weighted average as the pixel value of the jth packed pixel point in the i-th row pressure contracting pixel point sequence, m is taken less than or equal to QiPositive integer.
Description
Technical field
The present invention relates to the compression methods of Image Compression field more particularly to virtual reality imagery data, decompression
Method and device.
Background technique
Virtual reality (VR) technology is a kind of computer simulation system that can be created with the experiencing virtual world, it utilizes meter
Calculation machine generates a kind of simulated environment, is that a kind of Multi-source Information Fusion, interactive Three-Dimensional Dynamic what comes into a driver's and entity behavior are
System emulation.With the development increasingly of VR technology, there are more and more VR equipment, and in order to improve the easy to use of VR equipment
Property, wireless VR equipment is also increasingly instead of wired VR equipment.
For wireless VR equipment, during computer transmits VR image to wireless VR equipment, due to use
It is wireless transmission method, to guarantee to meet the bandwidth requirement of wireless transport module, it usually needs compressed to VR image.And show
There is technology to generally use JPEG compression mode to compress VR image, but uses above-mentioned compress mode to VR image compression
Afterwards, there is a problem of that image definition is low when restoring VR image.
Summary of the invention
In view of the above problems, it proposes on the present invention overcomes the above problem or at least be partially solved in order to provide one kind
State compression method, decompression method and the device of the virtual reality imagery data of problem.
The embodiment of the present invention provides a kind of compression method of virtual reality imagery data, which comprises
Obtain virtual reality to be compressed (VR) image data, wherein the VR image data to be compressed corresponds to be compressed
Pixel matrix, the pixel matrix to be compressed include that n arranges pixel point sequence to be compressed, and n takes the integer more than or equal to 1；
Based on default compression factor, every row pixel point sequence to be compressed for including to the pixel matrix to be compressed respectively
Compressed, obtain include n row pressure contracting pixel point sequence packed pixel dot matrix, and using the packed pixel dot matrix as
Compression VR image data is exported, wherein the i-th row pressure contracting pixel point sequence in the packed pixel dot matrix passes through to institute
It states the pixel point sequence to be compressed of the i-th row in pixel matrix to be compressed and carries out compression acquisition, i takes just whole less than or equal to n
Number；
Wherein, include: by the process that the i-th row pixel sequence compaction to be compressed is the i-th row pressure contracting pixel point sequence
Determine the quantity Q ' for the packed pixel point that the i-th row pressure contracting pixel point sequence includesi, wherein Q 'i=Qi(1-c), Qi
For the quantity for the pixel to be compressed that the i-th row pixel point sequence to be compressed includes, c is the default compression factor；
Establishing includes Q 'iA packed pixel point and with i-th row pixel point sequence to be compressed have identical image length
The i-th row pressure contracting pixel point sequence；
Assignment is carried out to each packed pixel point in the i-th row pressure contracting pixel point sequence respectively；
Wherein, j takes less than or equal to Q 'iPositive integer, to the jth packed pixel point in the i-th row pressure contracting pixel point sequence
Carry out assignment process include:
I-th row pixel point sequence to be compressed is aligned with the i-th row pressure contracting pixel point sequence head and the tail；
Calculate the nearest m of jth packed pixel point described in distance pictures to be compressed in i-th row pixel point sequence to be compressed
The weighted average of vegetarian refreshments, and using the weighted average as the jth packed pixel point in the i-th row pressure contracting pixel point sequence
Pixel value, m take less than or equal to QiPositive integer.
Preferably, the pixel matrix to be compressed is identical with the matrix-type of the packed pixel dot matrix, the square
Battle array type is two-dimensional matrix or three-dimensional matrice.
Preferably, the nearest m of jth packed pixel point described in distance in calculating the i-th row pixel point sequence to be compressed
During the weighted average of a pixel to be compressed, distance close to jth packed pixel point pixel to be compressed weight
The weight of pixel to be compressed greater than distance far from jth packed pixel point.
Preferably, after the acquisition VR image data to be compressed, and, it is described respectively to the pixel square to be compressed
Before every row pixel point sequence to be compressed that battle array includes compresses, the method also includes:
Corresponding relationship boil down to every four in the VR image data to be compressed between gray value and chromatic value are adjacent
The corresponding one group of chromatic value of gray value.
Preferably, if the corresponding relationship in the VR image data to be compressed between gray value and chromatic value is each ash
Angle value corresponds to one group of chromatic value, then, and the corresponding pass by the VR image data to be compressed between gray value and chromatic value
It is the corresponding one group of chromatic value of boil down to every four adjacent gray values, comprising:
It will be any in four groups of chromatic values corresponding to four adjacent gray values every in the VR image data to be compressed
Three groups of chromatic values are deleted, using remaining one group of chromatic value as the shared chromatic component of four adjacent gray values；Or
Four groups of chromatic values corresponding to four adjacent gray values every in the VR image data to be compressed are carried out asking flat
Mean operation obtains one group of average color angle value, and using the average color angle value as the shared color of four adjacent gray values
Spend component.
The embodiment of the present invention also provides a kind of decompression method of virtual reality imagery data, which comprises
Obtain compression VR image data, wherein the compression VR image data corresponds to packed pixel dot matrix, the pressure
Contracting pixel matrix includes n row pressure contracting pixel point sequence, and n takes the integer more than or equal to 1；
Based on default decompression ratio, every row pressure contracting pixel point sequence for including to the packed pixel dot matrix respectively into
Row decompression obtains and mediates the decompressed pixels dot matrix of packed pixel point sequence comprising n, and by the decompressed pixels point square
Battle array is exported as VR image data to be shown, wherein i-th in the decompressed pixels dot matrix mediates packed pixel point
By unziping it acquisition to the i-th row pressure contracting pixel point sequence in the packed pixel dot matrix, i takes to be less than or waits sequence
In the positive integer of n；
Wherein, include: for the process that i-th mediates packed pixel point sequence by the decompression of the i-th row pressure contracting pixel point sequence
Determine the i-th quantity Q for mediating the decompressed pixels point that packed pixel point sequence includesi, whereinQi′
For the quantity for the packed pixel point that the i-th row pressure contracting pixel point sequence includes, d is the default decompression ratio；
Establishing includes QiA decompressed pixels point and there is identical image length with the i-th row pressure contracting pixel point sequence
I-th mediates packed pixel point sequence；
The each decompressed pixels point mediated respectively i-th in packed pixel point sequence carries out assignment；
Wherein, j takes less than or equal to QiPositive integer, mediate i-th the jth decompressed pixels in packed pixel point sequence
Point carry out assignment process include:
The i-th row pressure contracting pixel point sequence is mediated packed pixel point sequence head and the tail with described i-th to be aligned；
Calculate m nearest packed pixel of jth decompressed pixels point described in distance in the i-th row pressure contracting pixel point sequence
The weighted average of point, and mediate using the weighted average as i-th the jth decompressed pixels point in packed pixel point sequence
Pixel value, m takes less than or equal to Qi' positive integer.
Preferably, after the acquisition mediates the decompressed pixels dot matrix of packed pixel point sequence comprising n, and in institute
It states before being exported the decompressed pixels dot matrix as VR image data to be shown, the method also includes:
Corresponding relationship decompression in the decompressed pixels dot matrix between gray value and chromatic value is condensed to each gray scale
It is worth corresponding one group of chromatic value.
Preferably, if the original corresponding relationship in the decompressed pixels dot matrix between gray value and chromatic value is every four
The corresponding one group of chromatic value of a adjacent gray value, then, it is described by gray value in the decompressed pixels dot matrix and chromatic value it
Between corresponding relationship decompression be condensed to the corresponding one group of chromatic value of each gray value, comprising:
One group of chromatic value corresponding to four adjacent gray values every in the decompressed pixels dot matrix is copied,
Four groups of chromatic values are obtained, and four groups of chromatic values chromatic value adjacent with this four is corresponded.
The embodiment of the present invention also provides a kind of compression set of virtual reality imagery data, including video interface, image pressure
Contracting module and wireless transmitter module；
The video interface obtains VR image data to be compressed for connecting main control device from the main control device,
The VR image data to be compressed corresponds to pixel matrix to be compressed, and the pixel matrix to be compressed includes that n row is to be compressed
Pixel point sequence, n take the integer more than or equal to 1；
Described image compression module is used for
Every row's pixel point sequence to be compressed compresses, and obtains the packed pixel dot matrix comprising n row pressure contracting pixel point sequence, wherein
The i-th row pressure contracting pixel point sequence in the packed pixel dot matrix passes through to the i-th row in the pixel matrix to be compressed
Pixel point sequence to be compressed carries out compression acquisition, and i takes the positive integer less than or equal to n；
Wherein, include: by the process that the i-th row pixel sequence compaction to be compressed is the i-th row pressure contracting pixel point sequence
Determine the quantity Q ' for the packed pixel point that the i-th row pressure contracting pixel point sequence includesi, wherein Q 'i=Qi(1-c), Qi
For the quantity for the pixel to be compressed that the i-th row pixel point sequence to be compressed includes, c is the default compression factor；
Establishing includes Q 'iA packed pixel point and with i-th row pixel point sequence to be compressed have identical image length
The i-th row pressure contracting pixel point sequence；
Assignment is carried out to each packed pixel point in the i-th row pressure contracting pixel point sequence respectively；
Wherein, j takes less than or equal to Q 'iPositive integer, to the jth packed pixel point in the i-th row pressure contracting pixel point sequence
Carry out assignment process include:
I-th row pixel point sequence to be compressed is aligned with the i-th row pressure contracting pixel point sequence head and the tail；
Calculate the nearest m of jth packed pixel point described in distance pictures to be compressed in i-th row pixel point sequence to be compressed
The weighted average of vegetarian refreshments, and using the weighted average as the jth packed pixel point in the i-th row pressure contracting pixel point sequence
Pixel value, m take less than or equal to QiPositive integer；
The wireless transmitter module is used to export the packed pixel dot matrix as compression VR image data.
The embodiment of the present invention also provides a kind of decompressing device of virtual reality imagery data, including wireless receiving module,
Image decompressor module and video interface；
The wireless receiving module corresponds to compression picture for receiving compression VR image data, the compression VR image data
Vegetarian refreshments matrix, the packed pixel dot matrix include n row pressure contracting pixel point sequence, and n takes the integer more than or equal to 1；
Described image decompression module is used for
Every row pressure contracting pixel point sequence unzip it, obtain and mediate the decompressed pixels dot matrix of packed pixel point sequence comprising n,
Wherein, i-th in the decompressed pixels dot matrix mediates packed pixel point sequence and passes through in the packed pixel dot matrix
The i-th row pressure contracting pixel point sequence unzip it acquisition, i takes the positive integer less than or equal to n；
Wherein, include: for the process that i-th mediates packed pixel point sequence by the decompression of the i-th row pressure contracting pixel point sequence
Determine the i-th quantity Q for mediating the decompressed pixels point that packed pixel point sequence includesi, whereinQi′
For the quantity for the packed pixel point that the i-th row pressure contracting pixel point sequence includes, d is the default decompression ratio；
Establishing includes QiA decompressed pixels point and there is identical image length with the i-th row pressure contracting pixel point sequence
I-th mediates packed pixel point sequence；
The each decompressed pixels point mediated respectively i-th in packed pixel point sequence carries out assignment；
Wherein, j takes less than or equal to QiPositive integer, mediate i-th the jth decompressed pixels in packed pixel point sequence
Point carry out assignment process include:
The i-th row pressure contracting pixel point sequence is mediated packed pixel point sequence head and the tail with described i-th to be aligned；
Calculate m nearest packed pixel of jth decompressed pixels point described in distance in the i-th row pressure contracting pixel point sequence
The weighted average of point, and mediate using the weighted average as i-th the jth decompressed pixels point in packed pixel point sequence
Pixel value, m takes less than or equal to Qi' positive integer；
The video interface is used to connect VR equipment, and using the decompressed pixels dot matrix as VR image number to be shown
According to output to the VR equipment.
One or more technical solutions in the embodiment of the present invention, have at least the following technical effects or advantages:
The present invention, based on default compression factor, treats packed pixel point after getting VR image data to be compressed respectively
Every row that matrix includes pixel point sequence to be compressed compresses, and obtains the packed pixel point comprising n row pressure contracting pixel point sequence
Matrix, and exported packed pixel dot matrix as compression VR image data, the i-th row pressure contracting in packed pixel dot matrix
Pixel point sequence carries out compression acquisition by treating the pixel point sequence to be compressed of the i-th row in packed pixel dot matrix, and i, which takes, to be less than
Or the positive integer equal to n, it include: true by the process that the i-th row pixel sequence compaction to be compressed is the i-th row pressure contracting pixel point sequence
The quantity Q ' for the packed pixel point that fixed i-th row pressure contracting pixel point sequence includesi, wherein Q 'i=Qi(1-c), QiIt waits pressing for the i-th row
The quantity for the pixel to be compressed that contracting pixel point sequence includes, c are default compression factor, and establishing includes Q 'iA packed pixel point
And there is the i-th row pressure contracting pixel point sequence of identical image length with the i-th row pixel point sequence to be compressed, respectively to the i-th row pressure
Each packed pixel point in contracting pixel point sequence carries out assignment, and j takes less than or equal to Q 'iPositive integer, to the i-th row pressure contracting picture
It includes: by the i-th row pixel point sequence to be compressed and the i-th row pressure that jth packed pixel point in vegetarian refreshments sequence, which carries out the process of assignment,
Contracting pixel point sequence head and the tail are aligned, calculate m nearest apart from jth packed pixel point in the i-th row pixel point sequence to be compressed to
The weighted average of packed pixel point, and using weighted average as the jth packed pixel point in the i-th row pressure contracting pixel point sequence
Pixel value, m takes less than or equal to QiPositive integer, by execute the above process obtain compression VR image data, can protect
The size that compression VR image data is reduced while the clarity of the image of card reduction display, saves the transmission bandwidth of data,
Meanwhile compression factor flexibly configurable.
Detailed description of the invention
By reading the following detailed description of the preferred embodiment, various other advantages and benefits are common for this field
Technical staff will become clear.The drawings are only for the purpose of illustrating a preferred embodiment, and is not considered as to the present invention
Limitation.And throughout the drawings, identical component is indicated with identical reference pattern.In the accompanying drawings:
Fig. 1 shows the flow chart of the compression method of one of embodiment of the present invention virtual reality imagery data；
Fig. 2 shows the schematic diagrames of the pixel matrix A in the embodiment of the present invention；
Fig. 3 shows the schematic diagram of the pixel matrix B in the embodiment of the present invention；
A line pixel sequence compaction to be compressed that Fig. 4 shows pixel matrix A in the embodiment of the present invention is matrix B
A line compresses the schematic diagram as pixel point sequence；
Fig. 5 shows a kind of flow chart of the decompression method of virtual reality imagery data in the embodiment of the present invention；
Fig. 6 shows a kind of structural schematic diagram of the compression set of virtual reality imagery data in the embodiment of the present invention；
Fig. 7 shows the compression set of the virtual reality imagery data in the embodiment of the present invention comprising chroma compression module
Structural schematic diagram；
Fig. 8 shows a kind of structural schematic diagram of the decompressing device of virtual reality imagery data in the embodiment of the present invention；
Fig. 9 shows the decompression dress of the virtual reality imagery data in the embodiment of the present invention comprising coloration decompression module
The structural schematic diagram set.
Specific embodiment
Exemplary embodiments of the present disclosure are described in more detail below with reference to accompanying drawings.Although showing the disclosure in attached drawing
Exemplary embodiment, it being understood, however, that may be realized in various forms the disclosure without should be by embodiments set forth here
It is limited.On the contrary, these embodiments are provided to facilitate a more thoroughly understanding of the present invention, and can be by the scope of the present disclosure
It is fully disclosed to those skilled in the art.
First embodiment of the invention provides a kind of compression method of virtual reality imagery data, for VR image data into
Row compression.During main control device transmits VR image data to VR equipment, on the one hand, can be by the virtual reality of the application
The compression method of image data is applied in main control device, then main control device will be as the virtual reality imagery data of the application
The executing subject of compression method, main control device executes the compression to VR image data, and VR image data after compression is transferred to
VR equipment；On the other hand, the compression method of the virtual reality imagery data of the application can also be applied except main control device and
In third equipment other than VR equipment, then third equipment is by holding as the compression method of the virtual reality imagery data of the application
Row main body, after VR image data is transferred to third equipment by main control device, third equipment executes the compression to VR image data, together
When, VR image data after compression can be also transferred to VR equipment by third equipment.In addition, either main control device is by compressed VR
Image data is transferred to VR equipment or third equipment and compressed VR image data is transferred to VR equipment, for data
Transmission mode can use wire transmission mode, and in order to improve convenience, wireless transmission method can also be used.
It is described in detail below in conjunction with compression method of the Fig. 1 to the virtual reality imagery data of the application, the application
The compression methods of virtual reality imagery data include:
Step 101: obtaining VR image data to be compressed, wherein VR image data to be compressed corresponds to pixel to be compressed
Matrix, pixel matrix to be compressed include that n arranges pixel point sequence to be compressed, and n takes the integer more than or equal to 1.
Specifically, the matrix-type of pixel matrix to be compressed can be two-dimensional matrix, or three-dimensional matrice.When
When the matrix-type of pixel matrix to be compressed is two-dimensional matrix, pixel matrix to be compressed is made of row and column, specifically, to
Packed pixel dot matrix may include the pixel point sequence to be compressed of a line or more and/or a column or more.When pixel to be compressed
When the matrix-type of matrix is three-dimensional matrice, pixel matrix to be compressed is made of row, column and page, specifically, pixel to be compressed
Dot matrix may include the pixel point sequence to be compressed of a line or more and/or a column or more and/or one page or more.
In embodiments of the present invention, by by the matrix-type of pixel matrix to be compressed be two-dimensional matrix for the application
The compression methods of virtual reality imagery data be described in detail, and be three for the matrix-type of pixel matrix to be compressed
Compression how is carried out when tieing up matrix can similarly show that the application will not be described in great detail.The embodiment of the present invention will provide a tool below
The two dimension pixel matrix A to be compressed of body, and combine two dimension pixel matrix A to be compressed to the virtual reality imagery number of the application
According to compression method be described in detail, as shown in Fig. 2, two dimension pixel matrix A to be compressed includes 6 rows pixel sequence to be compressed
Column and 10 column pixel point sequences to be compressed.
After getting VR image data to be compressed, step 102 is executed: based on default compression factor, treating pressure respectively
Every row that contracting pixel matrix includes pixel point sequence to be compressed compresses, and obtains the pressure comprising n row pressure contracting pixel point sequence
Contracting pixel matrix, and exported packed pixel dot matrix as compression VR image data.
Specifically, the matrix-type of packed pixel dot matrix is identical as the matrix-type of pixel matrix to be compressed, that is,
When pixel matrix to be compressed is two-dimensional matrix, packed pixel dot matrix is also two-dimensional matrix；When pixel matrix to be compressed
When for three-dimensional matrice, packed pixel dot matrix is also three-dimensional matrice.When pixel matrix to be compressed is two-dimensional matrix, step
Compression process in 102 can be for the every row or each column packed pixel point sequence to be compressed in two-dimensional pixel matrix to be compressed
Column are compressed, and when pixel matrix to be compressed is three-dimensional matrice, compression process in step 102 can be with are as follows: to along three-dimensional
The line direction of pixel matrix to be compressed, every row's packed pixel point sequence to be compressed carries out present in column direction or page orientation
Compression.
In a step 102, packed pixel dot matrix is obtained and treating packed pixel dot matrix and being compressed, tool
Body, compression acquisition packed pixel point square is carried out by treating the pixel point sequence to be compressed of the i-th row in packed pixel dot matrix
The i-th row pressure contracting pixel point sequence in battle array, i take the positive integer less than or equal to n.
Further, include: by the process that the i-th row pixel sequence compaction to be compressed is the i-th row pressure contracting pixel point sequence
Step 201: determining the quantity Q ' for the packed pixel point that the i-th row pressure contracting pixel point sequence includesi, wherein Q 'i=Qi
(1-c), QiFor the quantity for the pixel to be compressed that the i-th row pixel point sequence to be compressed includes, c is default compression factor.
Step 202: establishing includes Q 'iA packed pixel point and with i-th row pixel point sequence to be compressed have it is identical
I-th row pressure contracting pixel point sequence of image length.
Step 203: assignment being carried out to each packed pixel point in the i-th row pressure contracting pixel point sequence respectively.
For step 201, for two dimension shown in Fig. 2 pixel matrix A to be compressed, if compress mode is pair
Every row pixel point sequence to be compressed of two dimension pixel matrix A to be compressed is compressed, and, presetting compression factor is 20%, then,
The quantity for the pixel to be compressed for including due to two dimension pixel matrix A any row pixel point sequence to be compressed to be compressed is 10,
That is QiQ ' then can be obtained according to formula for 10, c 20%iIt is 8, so that the two dimensional compaction pixel matrix B obtained after compression includes
6 row packed pixel point sequences, every row packed pixel point sequence include 8 packed pixel points, and two dimensional compaction pixel matrix B is as schemed
Shown in 3.
For step 202, in this application, pixel point sequence to be compressed and corresponding packed pixel point sequence
Image length it is identical, that is, the image length of the i-th row pixel point sequence to be compressed and the i-th row pressure contracting pixel point sequence is identical.
For step 203, j is taken less than or equal to Q 'iPositive integer, to the jth in the i-th row pressure contracting pixel point sequence
Packed pixel point carry out assignment process include:
Step 2031: the i-th row pixel point sequence to be compressed is aligned with the i-th row pressure contracting pixel point sequence head and the tail.
Step 2032: it is a to be compressed to calculate m nearest apart from jth packed pixel point in the i-th row pixel point sequence to be compressed
The weighted average of pixel, and using weighted average as the picture of the jth packed pixel point in the i-th row pressure contracting pixel point sequence
Element value, m take less than or equal to QiPositive integer.
Below by by taking the first row packed pixel point sequence of two dimensional compaction pixel matrix B as an example, to how to a row pressure
Contracting pixel carries out assignment and is described in detail.
As shown in figure 4, firstly, the first row pixel point sequence to be compressed and the first row packed pixel point sequence head and the tail is right
Together, also the first row pixel point sequence to be compressed and the first row packed pixel point sequence are overlapped point-blank.Then, according to
Secondary 8 packed pixel points in packed pixel point sequence carry out assignment, that is, j successively gets 8 from 1.For the 1st packed pixel
For point, m is pre-set quantity, and m takes the positive integer less than or equal to 10, for example, m can take 4, m that can also take 10.
When m takes 4,4 pixels to be compressed that the 1st packed pixel point of distance is nearest in the first row pixel point sequence to be compressed are calculated
Weighted average, as can be seen from FIG. 4, the 1st packed pixel point of distance is nearest in the first row pixel point sequence to be compressed 4 are wait press
Contracting pixel is respectively the 1st pixel to be compressed, the 2nd pixel, the 3rd pixel to be compressed and the 4th pixel to be compressed to be compressed
Point, further, using the weighted average of above-mentioned 4 pixels to be compressed as the pixel value of the 1st packed pixel point.When m takes 10
When, then the weighted average for all pixels to be compressed for including in the first row pixel point sequence to be compressed is calculated, and will obtain
Pixel value of the weighted average as the 1st packed pixel point.According to it is above-mentioned to the 1st packed pixel point carry out assignment process,
Similarly, it could be aware that how to be aligned his 7 packed pixel points carries out assignment, details are not described herein again.
In this application, m is meeting less than or equal to QiUnder conditions of, the value the big more compression VR image data can be made to exist
Close to lossless when reduction display, optimal display result, m take Q in order to obtaini。
In addition, waiting pressing calculating the i-th row to further increase clarity of the compression VR image data when restoring display
The weighted average of the m nearest apart from jth packed pixel point pixel to be compressed in contracting pixel point sequence, distance is close to jth
The weight of the pixel to be compressed of packed pixel point is greater than the weight of to be compressed pixel of the distance far from jth packed pixel point.
For example, for the first selection mode above-mentioned, as shown in figure 4, in the pixel to be compressed of calculating the 1st, the 2nd picture to be compressed
During the weighted average of vegetarian refreshments, the 3rd pixel to be compressed and the 4th pixel to be compressed, aforementioned four pixel to be compressed
The weight of point be followed successively by from big to small the 1st pixel to be compressed, the 2nd pixel to be compressed, the 3rd pixel to be compressed and the 4th to
Packed pixel point.
In the compression method of the virtual reality imagery data of the application, in order to further save bandwidth, step 101 it
Afterwards, and before step 102, following steps can also be performed:
By the every four adjacent ashes of corresponding relationship boil down in VR image data to be compressed between gray value and chromatic value
Angle value corresponds to one group of chromatic value.
Specifically, in general, before carrying out chroma compression, in VR image data to be compressed between gray value and chromatic value
Corresponding relationship be the corresponding one group of chromatic value of each gray value, wherein gray value Y, one group of chromatic value include a U and one
A V.In this case, the application provides the specific chroma compression mode of following two.
The first chroma compression mode are as follows: will be four corresponding to four adjacent gray values every in VR image data to be compressed
Any three groups of chromatic values in group chromatic value are deleted, using remaining one group of chromatic value as four adjacent gray values
Share chromatic component.The first chroma compression mode has the advantages that compression speed is fast.
Second of chroma compression mode are as follows: will be four corresponding to four adjacent gray values every in VR image data to be compressed
Group chromatic value carries out operation of averaging, and obtains one group of average color angle value, and using average color angle value as four adjacent ashes
The shared chromatic component of angle value.Second of chroma compression mode has the advantages that coloration reduction rate is high.
For above-mentioned chroma compression process, if the color depth of VR image data to be compressed is 24bit, show Y, U and V
Respectively account for 8bit, Y: U: V=8: 8: 8, after chroma compression, Y: U: V=8: 2: 2.The application is by by VR image to be compressed
The corresponding one group of chromatic value of every four adjacent gray values of corresponding relationship boil down in data between gray value and chromatic value, can
Under the premise of guaranteeing the reduction display effect of compression VR image data, halve required bandwidth.
Based on the same inventive concept, second embodiment of the invention also provides a kind of decompression side of virtual reality imagery data
Method, for being unziped it to compression VR image data.It on the one hand, can be by the decompression of the virtual reality imagery data of the application
Contracting method is applied in VR equipment, then VR equipment is by the execution as the decompression method of the virtual reality imagery data of the application
Main body, VR equipment executes the decompression to compression VR image data, and shows to the VR image data after decompression；It is another
Aspect can also apply the decompression method of the virtual reality imagery data of the application in addition to main control device and VR equipment
Third equipment in, then third equipment is by the executing subject as the decompression method of the virtual reality imagery data of the application,
Third equipment obtains compression VR image data and unzips it to compression VR image data, finally, third equipment will decompress
VR image data afterwards is transferred to VR equipment.
It is described in detail below in conjunction with decompression method of the Fig. 5 to the virtual reality imagery data of the application, this Shen
The decompression method of virtual reality imagery data please includes:
Step 501: obtaining compression VR image data, wherein compression VR image data corresponds to packed pixel dot matrix, pressure
Contracting pixel matrix includes n row pressure contracting pixel point sequence, and n takes the integer more than or equal to 1.
Specifically, with embodiment original having the same corresponding to the compression method of aforementioned virtual reality imagery data
It manages, in the embodiment corresponding to the decompression method of virtual reality imagery data, the matrix-type of packed pixel dot matrix can
Think two-dimensional matrix, or three-dimensional matrice, details are not described herein again.
After getting compression VR image data, step 502 is executed: based on default decompression ratio, respectively to compression
Every row pressure contracting pixel point sequence that pixel matrix includes unzips it, and obtains the solution that packed pixel point sequence is mediated comprising n
Packed pixel dot matrix, and exported decompressed pixels dot matrix as VR image data to be shown.
Specifically, decompressed pixels dot matrix is identical as the matrix-type of packed pixel dot matrix.In step 402,
Decompressed pixels dot matrix is obtained and unziping it to packed pixel dot matrix, specifically, by compression picture
The i-th row pressure contracting pixel point sequence in vegetarian refreshments matrix unzips it i-th obtained in decompressed pixels dot matrix and mediates compression
Pixel point sequence, i take the positive integer less than or equal to n.
Further, include: for the process that i-th mediates packed pixel point sequence by the decompression of the i-th row pressure contracting pixel point sequence
Step 601: determining the i-th quantity Q for mediating the decompressed pixels point that packed pixel point sequence includesi, whereinQiThe quantity of ' packed pixel the point for including for the i-th row pressure contracting pixel point sequence, d are the default decompression ratio
Example.
Step 602: establishing includes QiA decompressed pixels point and with the i-th row pressure contracting pixel point sequence have identical image it is long
The i-th of degree mediates packed pixel point sequence.
Step 603: each decompressed pixels point mediated respectively i-th in packed pixel point sequence carries out assignment.
For step 601, for pixel matrix B shown in Fig. 3, if decompression mode is to pixel square
Every row packed pixel point sequence of battle array B unzips it, and, presetting decompression ratio is 20%, then, due to pixel matrix B
The quantity for the packed pixel point that any row packed pixel point sequence includes is 8, that is, Qi' it is 8, d 20%, then it can according to formula
Obtain QiIt is 10, so that the pixel matrix A obtained after decompression includes 6 row decompressed pixels point sequences, every row decompressed pixels
Point sequence includes 10 decompressed pixels points, as shown in Figure 2.
For step 602, in this application, packed pixel point sequence and corresponding decompressed pixels point sequence
Image length it is identical, that is, the i-th row pressure contracting pixel point sequence and i-th mediate packed pixel point sequence image length it is identical.
For step 603, j is taken less than or equal to QiPositive integer, mediate i-th in packed pixel point sequence
J decompressed pixels point carry out assignment process include:
Step 6031: the i-th row pressure contracting pixel point sequence being mediated into packed pixel point sequence head and the tail with i-th and is aligned.
Step 6032: calculating m compression picture nearest apart from jth decompressed pixels point in the i-th row pressure contracting pixel point sequence
The weighted average of vegetarian refreshments, and mediate using weighted average as i-th jth decompressed pixels point in packed pixel point sequence
Pixel value, m take less than or equal to Qi' positive integer.
Below by by taking the first row decompressed pixels point sequence of pixel matrix A as an example, to how mediating compression picture to one
Vegetarian refreshments carries out assignment and is described in detail.
As shown in figure 4, firstly, the first row packed pixel point sequence and the first row decompressed pixels point sequence head and the tail is right
Together, also the first row packed pixel point sequence and the first row decompressed pixels point are overlapped point-blank.Then, successively right
10 decompressed pixels points in decompressed pixels point sequence carry out assignment, that is, j successively gets 10 from 1.For the first decompression
For pixel, m is pre-set quantity, and m takes the positive integer less than or equal to 8, for example, m can take 4, m that can also take
8, when m takes 4, calculate 4 packed pixel points that the 1st decompressed pixels point of distance is nearest in the first row packed pixel point sequence
Weighted average, as can be seen from FIG. 4,4 nearest compressions of the 1st decompressed pixels point of distance in the first row packed pixel point sequence
Pixel is respectively the 1st packed pixel point, the 2nd packed pixel point, the 3rd packed pixel point and the 4th packed pixel point, further,
Using the weighted average of above-mentioned 4 packed pixels point as the pixel value of the 1st decompressed pixels point.When m takes 8, then is calculated
The weighted average for all packed pixel points for including in a line packed pixel point sequence, and using obtained weighted average as
The pixel value of 1st decompressed pixels point.It similarly could be aware that according to the above-mentioned process for carrying out assignment to the 1st decompressed pixels point
How to be aligned his 9 decompressed pixels points and carry out assignment, details are not described herein again.
In addition, calculating the i-th row pressure contracting pixel to further increase the display resolution of decompression VR image data
The weighted average of m nearest packed pixel point of jth decompressed pixels point described in distance in sequence, distance are compressed close to jth
The weight of the packed pixel point of pixel is greater than the weight of packed pixel point of the distance far from jth packed pixel point.
In the decompression method of the virtual reality imagery data of the application, when compression VR image data is chroma compression number
According to when, after obtaining and mediating the decompressed pixels dot matrix of packed pixel point sequence comprising n, and by decompressed pixels point square
Before battle array is exported as VR image data to be shown, the method also includes:
Corresponding relationship decompression in decompressed pixels dot matrix between gray value and chromatic value is condensed to each gray value pair
Answer one group of chromatic value.
Specifically, if the original corresponding relationship in decompressed pixels dot matrix between gray value and chromatic value is every four
The corresponding one group of chromatic value of adjacent gray value, then, by the corresponding pass in decompressed pixels dot matrix between gray value and chromatic value
System's decompression is condensed to the corresponding one group of chromatic value of each gray value, comprising:
One group of chromatic value corresponding to four adjacent gray values every in decompressed pixels dot matrix is copied, is obtained
Four groups of chromatic values, and four groups of chromatic values chromatic value adjacent with this four is corresponded.
For above-mentioned coloration decompression process, if the color depth of compression VR image data is Y: U: V=8: 2: 2, pass through
After coloration decompression, Y: U: V=8: 8: 8.
Based on the same inventive concept, third embodiment of the invention also provides a kind of compression dress of virtual reality imagery data
It sets, as shown in fig. 6, including video interface 61, image compression module 62 and wireless transmitter module 63.
Video interface 61 obtains VR image data to be compressed, institute for connecting main control device from the main control device
VR image data to be compressed is stated corresponding to pixel matrix to be compressed, the pixel matrix to be compressed includes that n arranges picture to be compressed
Vegetarian refreshments sequence, n take the integer more than or equal to 1；
Image compression module 62 is used for based on default compression factor, respectively to the pixel matrix to be compressed include it is every
It arranges pixel point sequence to be compressed to be compressed, obtains the packed pixel dot matrix comprising n row pressure contracting pixel point sequence, wherein institute
The i-th row pressure contracting pixel point sequence in packed pixel dot matrix is stated by waiting for the i-th row in the pixel matrix to be compressed
Packed pixel point sequence carries out compression acquisition, and i takes the positive integer less than or equal to n；
Wherein, include: by the process that the i-th row pixel sequence compaction to be compressed is the i-th row pressure contracting pixel point sequence
Determine the quantity Q ' for the packed pixel point that the i-th row pressure contracting pixel point sequence includesi, wherein Q 'i=Qi(1-c), Qi
For the quantity for the pixel to be compressed that the i-th row pixel point sequence to be compressed includes, c is the default compression factor；
Establishing includes Q 'iA packed pixel point and with i-th row pixel point sequence to be compressed have identical image length
The i-th row pressure contracting pixel point sequence；
Assignment is carried out to each packed pixel point in the i-th row pressure contracting pixel point sequence respectively；
Wherein, j takes less than or equal to Q 'iPositive integer, to the jth packed pixel point in the i-th row pressure contracting pixel point sequence
Carry out assignment process include:
I-th row pixel point sequence to be compressed is aligned with the i-th row pressure contracting pixel point sequence head and the tail；
Calculate the nearest m of jth packed pixel point described in distance pictures to be compressed in i-th row pixel point sequence to be compressed
The weighted average of vegetarian refreshments, and using the weighted average as the jth packed pixel point in the i-th row pressure contracting pixel point sequence
Pixel value, m take less than or equal to QiPositive integer.
Wireless transmitter module 63 is used to export the packed pixel dot matrix as compression VR image data.
Further, as shown in fig. 7, the compression set can also include chroma compression module 64, chroma compression module 64
For by the every four adjacent ashes of corresponding relationship boil down in the VR image data to be compressed between gray value and chromatic value
Angle value corresponds to one group of chromatic value.
Record in first embodiment may refer to for the course of work of above-mentioned each module, details are not described herein again.
Based on the same inventive concept, fourth embodiment of the invention also provides a kind of decompression dress of virtual reality imagery data
It sets, as shown in figure 8, including wireless receiving module 71, image decompressor module 72 and video interface 73；
Wireless receiving module 71 corresponds to packed pixel for receiving compression VR image data, the compression VR image data
Dot matrix, the packed pixel dot matrix include n row pressure contracting pixel point sequence, and n takes the integer more than or equal to 1；
Image decompressor module 72 is used for
Every row pressure contracting pixel point sequence unzips it, and obtains the decompressed pixels dot matrix that packed pixel point sequence is mediated comprising n,
In, i-th in the decompressed pixels dot matrix, which mediates packed pixel point sequence, passes through in the packed pixel dot matrix
I-th row pressure contracting pixel point sequence unzips it acquisition, and i takes the positive integer less than or equal to n；
Wherein, include: for the process that i-th mediates packed pixel point sequence by the decompression of the i-th row pressure contracting pixel point sequence
Determine the i-th quantity Q for mediating the decompressed pixels point that packed pixel point sequence includesi, whereinQi′
For the quantity for the packed pixel point that the i-th row pressure contracting pixel point sequence includes, d is the default decompression ratio；
Establishing includes QiA decompressed pixels point and there is identical image length with the i-th row pressure contracting pixel point sequence
I-th mediates packed pixel point sequence；
The each decompressed pixels point mediated respectively i-th in packed pixel point sequence carries out assignment；
Wherein, j takes less than or equal to QiPositive integer, mediate i-th the jth decompressed pixels in packed pixel point sequence
Point carry out assignment process include:
The i-th row pressure contracting pixel point sequence is mediated packed pixel point sequence head and the tail with described i-th to be aligned；
Calculate m nearest packed pixel of jth decompressed pixels point described in distance in the i-th row pressure contracting pixel point sequence
The weighted average of point, and mediate using the weighted average as i-th the jth decompressed pixels point in packed pixel point sequence
Pixel value, m takes less than or equal to Qi' positive integer；
Video interface 73 is used to connect VR equipment, and using the decompressed pixels dot matrix as VR image data to be shown
It exports to the VR equipment.
Further, as shown in figure 9, the decompressing device can also include coloration decompression module 74, coloration decompression
Module 74 is used to the corresponding relationship decompression in the decompressed pixels dot matrix between gray value and chromatic value being condensed to each ash
Angle value corresponds to one group of chromatic value.
Record in second embodiment may refer to for the course of work of above-mentioned each module, details are not described herein again.
One or more technical solutions in the embodiment of the present invention, have at least the following technical effects or advantages:
The present invention, based on default compression factor, treats packed pixel point after getting VR image data to be compressed respectively
Every row that matrix includes pixel point sequence to be compressed compresses, and obtains the packed pixel point comprising n row pressure contracting pixel point sequence
Matrix, and exported packed pixel dot matrix as compression VR image data, the i-th row pressure contracting in packed pixel dot matrix
Pixel point sequence carries out compression acquisition by treating the pixel point sequence to be compressed of the i-th row in packed pixel dot matrix, and i, which takes, to be less than
Or the positive integer equal to n, it include: true by the process that the i-th row pixel sequence compaction to be compressed is the i-th row pressure contracting pixel point sequence
The quantity Q ' for the packed pixel point that fixed i-th row pressure contracting pixel point sequence includesi, wherein Q 'i=Qi(1-c), QiIt waits pressing for the i-th row
The quantity for the pixel to be compressed that contracting pixel point sequence includes, c are default compression factor, and establishing includes Q 'iA packed pixel point
And there is the i-th row pressure contracting pixel point sequence of identical image length with the i-th row pixel point sequence to be compressed, respectively to the i-th row pressure
Each packed pixel point in contracting pixel point sequence carries out assignment, and j takes less than or equal to Q 'iPositive integer, to the i-th row pressure contracting picture
It includes: by the i-th row pixel point sequence to be compressed and the i-th row pressure that jth packed pixel point in vegetarian refreshments sequence, which carries out the process of assignment,
Contracting pixel point sequence head and the tail are aligned, calculate m nearest apart from jth packed pixel point in the i-th row pixel point sequence to be compressed to
The weighted average of packed pixel point, and using weighted average as the jth packed pixel point in the i-th row pressure contracting pixel point sequence
Pixel value, m takes less than or equal to QiPositive integer, by execute the above process obtain compression VR image data, can protect
The size that compression VR image data is reduced while the clarity of the image of card reduction display, saves the transmission bandwidth of data,
Meanwhile compression factor flexibly configurable.
Algorithm and display are not inherently related to any particular computer, virtual system, or other device provided herein.
Various general-purpose systems can also be used together with teachings based herein.As described above, it constructs required by this kind of system
Structure be obvious.In addition, the present invention is also not directed to any particular programming language.It should be understood that can use various
Programming language realizes summary of the invention described herein, and the description done above to language-specific is to disclose this hair
Bright preferred forms.
In the instructions provided here, numerous specific details are set forth.It is to be appreciated, however, that implementation of the invention
Example can be practiced without these specific details.In some instances, well known method, structure is not been shown in detail
And technology, so as not to obscure the understanding of this specification.
Similarly, it should be understood that in order to simplify the disclosure and help to understand one or more of the various inventive aspects,
Above in the description of exemplary embodiment of the present invention, each feature of the invention is grouped together into single implementation sometimes
In the description of example, figure or alignment.However, the disclosed method should not be interpreted as reflecting the following intention: i.e. required to protect
Shield the present invention claims features more more than feature expressly recited in each claim.More precisely, as following
Claims reflect as, inventive aspect is all features less than single embodiment disclosed above.Therefore,
Thus the claims for following specific embodiment are expressly incorporated in the specific embodiment, wherein each claim itself
All as a separate embodiment of the present invention.
Those skilled in the art will understand that can be carried out adaptively to the module in the equipment in embodiment
Change and they are arranged in one or more devices different from this embodiment.It can be the module or list in embodiment
Member or component are combined into a module or unit or component, and furthermore they can be divided into multiple submodule or subelement or
Sub-component.Other than such feature and/or at least some of process or unit exclude each other, it can use any
Combination is to all features disclosed in this specification (including adjoint claim, abstract and attached drawing) and so disclosed
All process or units of what method or apparatus are combined.Unless expressly stated otherwise, this specification is (including adjoint power
Benefit require, abstract and attached drawing) disclosed in each feature can carry out generation with an alternative feature that provides the same, equivalent, or similar purpose
It replaces.
In addition, it will be appreciated by those of skill in the art that although some embodiments described herein include other embodiments
In included certain features rather than other feature, but the combination of the feature of different embodiments mean it is of the invention
Within the scope of and form different embodiments.For example, in the following claims, embodiment claimed is appointed
Meaning one of can in any combination mode come using.
Various component embodiments of the invention can be implemented in hardware, or to run on one or more processors
Software module realize, or be implemented in a combination thereof.It will be understood by those of skill in the art that can be used in practice
Microprocessor or digital signal processor (DSP) realize some or all portions in device according to an embodiment of the present invention
The some or all functions of part.The present invention is also implemented as a part or complete for executing method as described herein
The device or device program (for example, computer program and computer program product) in portion.It is such to realize program of the invention
It can store on a computer-readable medium, or may be in the form of one or more signals.Such signal can be with
It downloads from internet website, is perhaps provided on the carrier signal or is provided in any other form.
It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and ability
Field technique personnel can be designed alternative embodiment without departing from the scope of the appended claims.In the claims,
Any reference symbol between parentheses should not be configured to limitations on claims.Word "comprising" does not exclude the presence of not
Element or step listed in the claims.Word "a" or "an" located in front of the element does not exclude the presence of multiple such
Element.The present invention can be by means of including the hardware of several different elements and being come by means of properly programmed computer real
It is existing.In the unit claims listing several devices, several in these devices can be through the same hardware branch
To embody.The use of word first, second, and third does not indicate any sequence.These words can be explained and be run after fame
Claim.
Claims (10)
1. a kind of compression method of virtual reality imagery data, which is characterized in that the described method includes:
Obtain virtual reality to be compressed (VR) image data, wherein the VR image data to be compressed corresponds to pixel to be compressed
Dot matrix, the pixel matrix to be compressed include that n arranges pixel point sequence to be compressed, and n takes the integer more than or equal to 1；
Based on default compression factor, every row pixel point sequence to be compressed that the pixel matrix to be compressed includes is carried out respectively
Compression obtains the packed pixel dot matrix comprising n row pressure contracting pixel point sequence, and using the packed pixel dot matrix as compression
VR image data is exported, wherein the i-th row pressure contracting pixel point sequence in the packed pixel dot matrix by it is described to
The i-th row pixel point sequence to be compressed in packed pixel dot matrix carries out compression acquisition, and i takes the positive integer less than or equal to n；
Wherein, include: by the process that the i-th row pixel sequence compaction to be compressed is the i-th row pressure contracting pixel point sequence
Determine the quantity Q ' for the packed pixel point that the i-th row pressure contracting pixel point sequence includesi, wherein Q 'i=Qi(1-c), QiIt is i-th
The quantity for the pixel to be compressed that pixel point sequence to be compressed includes is arranged, c is the default compression factor；
Establishing includes Q 'iA packed pixel point and with i-th row pixel point sequence to be compressed have identical image length i-th
Row pressure contracting pixel point sequence；
Assignment is carried out to each packed pixel point in the i-th row pressure contracting pixel point sequence respectively；
Wherein, j takes less than or equal to Q 'iPositive integer, the jth packed pixel point in the i-th row pressure contracting pixel point sequence is assigned
The process of value includes:
I-th row pixel point sequence to be compressed is aligned with the i-th row pressure contracting pixel point sequence head and the tail；
Calculate the nearest m of jth packed pixel point described in distance pixels to be compressed in i-th row pixel point sequence to be compressed
Weighted average, and using the weighted average as the pixel of the jth packed pixel point in the i-th row pressure contracting pixel point sequence
Value, m take less than or equal to QiPositive integer.
2. the method as described in claim 1, which is characterized in that the pixel matrix to be compressed and packed pixel point square
The matrix-type of battle array is identical, and the matrix-type is two-dimensional matrix or three-dimensional matrice.
3. the method as described in claim 1, which is characterized in that the distance in calculating the i-th row pixel point sequence to be compressed
During the weighted average of nearest m pixels to be compressed of the jth packed pixel point, distance compresses picture close to jth
The weight of the pixel to be compressed of vegetarian refreshments is greater than the weight of to be compressed pixel of the distance far from jth packed pixel point.
4. the method as described in claim 1, which is characterized in that after the acquisition VR image data to be compressed, and, it is described
Before compressing respectively to every row pixel point sequence to be compressed that the pixel matrix to be compressed includes, the method is also wrapped
It includes:
By the every four adjacent ashes of corresponding relationship boil down in the VR image data to be compressed between gray value and chromatic value
Angle value corresponds to one group of chromatic value.
5. method as claimed in claim 4, which is characterized in that if gray value and chromatic value in the VR image data to be compressed
Between corresponding relationship be the corresponding one group of chromatic value of each gray value, then, and described will ash in the VR image data to be compressed
The corresponding one group of chromatic value of every four adjacent gray values of corresponding relationship boil down between angle value and chromatic value, comprising:
By any three groups in four groups of chromatic values corresponding to four adjacent gray values every in the VR image data to be compressed
Chromatic value is deleted, using remaining one group of chromatic value as the shared chromatic component of four adjacent gray values；Or
Four groups of chromatic values corresponding to four adjacent gray values every in the VR image data to be compressed are averaged
Operation obtains one group of average color angle value, and using the average color angle value as the shared coloration of four adjacent gray values point
Amount.
6. a kind of decompression method of virtual reality imagery data, which is characterized in that the described method includes:
Obtain compression VR image data, wherein the compression VR image data corresponds to packed pixel dot matrix, the compression picture
Vegetarian refreshments matrix includes n row pressure contracting pixel point sequence, and n takes the integer more than or equal to 1；
Based on default decompression ratio, every row pressure contracting pixel point sequence that the packed pixel dot matrix includes is solved respectively
Compression obtains the decompressed pixels dot matrix for mediating packed pixel point sequence comprising n, and the decompressed pixels dot matrix is made
It is exported for VR image data to be shown, wherein i-th in the decompressed pixels dot matrix mediates packed pixel point sequence
By unziping it acquisition to the i-th row pressure contracting pixel point sequence in the packed pixel dot matrix, i is taken less than or equal to n
Positive integer；
Wherein, include: for the process that i-th mediates packed pixel point sequence by the decompression of the i-th row pressure contracting pixel point sequence
Determine the i-th quantity Q for mediating the decompressed pixels point that packed pixel point sequence includesi, whereinQ′iIt is i-th
The quantity for the packed pixel point that row pressure contracting pixel point sequence includes, d are the default decompression ratio；
Establishing includes QiA decompressed pixels point and i-th row with the i-th row pressure contracting pixel point sequence with identical image length
Decompressed pixels point sequence；
The each decompressed pixels point mediated respectively i-th in packed pixel point sequence carries out assignment；
Wherein, j takes less than or equal to QiPositive integer, mediate jth decompressed pixels in packed pixel point sequence to i-th and click through
The process of row assignment includes:
The i-th row pressure contracting pixel point sequence is mediated packed pixel point sequence head and the tail with described i-th to be aligned；
Calculate the m packed pixel point that jth decompressed pixels point described in distance is nearest in the i-th row pressure contracting pixel point sequence
Weighted average, and mediate using the weighted average as i-th the picture of the jth decompressed pixels point in packed pixel point sequence
Element value, m take less than or equal to Q 'iPositive integer.
7. method as claimed in claim 6, which is characterized in that mediate the solution of packed pixel point sequence comprising n in the acquisition
After packed pixel dot matrix, and exported described using the decompressed pixels dot matrix as VR image data to be shown
Before, the method also includes:
Corresponding relationship decompression in the decompressed pixels dot matrix between gray value and chromatic value is condensed to each gray value pair
Answer one group of chromatic value.
8. the method for claim 7, which is characterized in that if gray value and chromatic value in the decompressed pixels dot matrix
Between original corresponding relationship be the corresponding one group of chromatic value of every four adjacent gray values, then it is, described by the decompressed pixels
Corresponding relationship decompression in dot matrix between gray value and chromatic value is condensed to the corresponding one group of chromatic value of each gray value, comprising:
One group of chromatic value corresponding to four adjacent gray values every in the decompressed pixels dot matrix is copied, is obtained
Four groups of chromatic values, and four groups of chromatic values chromatic value adjacent with this four is corresponded.
9. a kind of compression set of virtual reality imagery data, which is characterized in that including video interface, image compression module and nothing
Line transmitting module；
The video interface obtains VR image data to be compressed for connecting main control device from the main control device, described
VR image data to be compressed corresponds to pixel matrix to be compressed, and the pixel matrix to be compressed includes that n arranges pixel to be compressed
Point sequence, n take the integer more than or equal to 1；
Described image compression module is used for based on default compression factor, the every row for including to the pixel matrix to be compressed respectively
Pixel point sequence to be compressed is compressed, and obtains the packed pixel dot matrix comprising n row pressure contracting pixel point sequence, wherein described
The i-th row pressure contracting pixel point sequence in packed pixel dot matrix to the i-th row in the pixel matrix to be compressed by waiting pressing
Contracting pixel point sequence carries out compression acquisition, and i takes the positive integer less than or equal to n；
Wherein, include: by the process that the i-th row pixel sequence compaction to be compressed is the i-th row pressure contracting pixel point sequence
Determine the quantity Q ' for the packed pixel point that the i-th row pressure contracting pixel point sequence includesi, wherein Q 'i=Qi(1-c), QiIt is i-th
The quantity for the pixel to be compressed that pixel point sequence to be compressed includes is arranged, c is the default compression factor；
Establishing includes Q 'iA packed pixel point and with i-th row pixel point sequence to be compressed have identical image length i-th
Row pressure contracting pixel point sequence；
Assignment is carried out to each packed pixel point in the i-th row pressure contracting pixel point sequence respectively；
Wherein, j takes less than or equal to Q 'iPositive integer, the jth packed pixel point in the i-th row pressure contracting pixel point sequence is assigned
The process of value includes:
I-th row pixel point sequence to be compressed is aligned with the i-th row pressure contracting pixel point sequence head and the tail；
Calculate the nearest m of jth packed pixel point described in distance pixels to be compressed in i-th row pixel point sequence to be compressed
Weighted average, and using the weighted average as the pixel of the jth packed pixel point in the i-th row pressure contracting pixel point sequence
Value, m take less than or equal to QiPositive integer；
The wireless transmitter module is used to export the packed pixel dot matrix as compression VR image data.
10. a kind of decompressing device of virtual reality imagery data, which is characterized in that including wireless receiving module, image decompression
Contracting module and video interface；
The wireless receiving module corresponds to packed pixel point for receiving compression VR image data, the compression VR image data
Matrix, the packed pixel dot matrix include n row pressure contracting pixel point sequence, and n takes the integer more than or equal to 1；
Described image decompression module is used for based on default decompression ratio, respectively to the packed pixel dot matrix include it is every
Row pressure contracting pixel point sequence unzips it, and obtains the decompressed pixels dot matrix that packed pixel point sequence is mediated comprising n,
In, i-th in the decompressed pixels dot matrix, which mediates packed pixel point sequence, passes through in the packed pixel dot matrix
I-th row pressure contracting pixel point sequence unzips it acquisition, and i takes the positive integer less than or equal to n；
Wherein, include: for the process that i-th mediates packed pixel point sequence by the decompression of the i-th row pressure contracting pixel point sequence
Determine the i-th quantity Q for mediating the decompressed pixels point that packed pixel point sequence includesi, whereinQ′iIt is i-th
The quantity for the packed pixel point that row pressure contracting pixel point sequence includes, d are the default decompression ratio；
Establishing includes QiA decompressed pixels point and i-th row with the i-th row pressure contracting pixel point sequence with identical image length
Decompressed pixels point sequence；
The each decompressed pixels point mediated respectively i-th in packed pixel point sequence carries out assignment；
Wherein, j takes less than or equal to QiPositive integer, mediate jth decompressed pixels in packed pixel point sequence to i-th and click through
The process of row assignment includes:
The i-th row pressure contracting pixel point sequence is mediated packed pixel point sequence head and the tail with described i-th to be aligned；
Calculate the m packed pixel point that jth decompressed pixels point described in distance is nearest in the i-th row pressure contracting pixel point sequence
Weighted average, and mediate using the weighted average as i-th the picture of the jth decompressed pixels point in packed pixel point sequence
Element value, m take less than or equal to Q 'iPositive integer；
The video interface is used to connect VR equipment, and the decompressed pixels dot matrix is defeated as VR image data to be shown
Out to the VR equipment.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711336475.8A CN109922329B (en) | 2017-12-13 | 2017-12-13 | Compression method, decompression method and device for virtual reality image data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711336475.8A CN109922329B (en) | 2017-12-13 | 2017-12-13 | Compression method, decompression method and device for virtual reality image data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109922329A true CN109922329A (en) | 2019-06-21 |
| CN109922329B CN109922329B (en) | 2021-02-26 |
Family
ID=66959286
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711336475.8A Expired - Fee Related CN109922329B (en) | 2017-12-13 | 2017-12-13 | Compression method, decompression method and device for virtual reality image data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109922329B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1537384A (en) * | 2001-09-17 | 2004-10-13 | ��˹��ŵ�� | Method for sub-pixel valve interpolation |
| US20080019601A1 (en) * | 2006-07-20 | 2008-01-24 | Casio Computer Co., Ltd. | Color noise reduction image processing apparatus |
| CN102763411A (en) * | 2009-12-09 | 2012-10-31 | 三星电子株式会社 | Method and apparatus for encoding video, and method and apparatus for decoding video |
| CN107959856A (en) * | 2010-07-16 | 2018-04-24 | 三星电子株式会社 | By infra-frame prediction come the method and apparatus that is coded and decoded to image |
-
2017
- 2017-12-13 CN CN201711336475.8A patent/CN109922329B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1537384A (en) * | 2001-09-17 | 2004-10-13 | ��˹��ŵ�� | Method for sub-pixel valve interpolation |
| US20080019601A1 (en) * | 2006-07-20 | 2008-01-24 | Casio Computer Co., Ltd. | Color noise reduction image processing apparatus |
| CN102763411A (en) * | 2009-12-09 | 2012-10-31 | 三星电子株式会社 | Method and apparatus for encoding video, and method and apparatus for decoding video |
| CN107959856A (en) * | 2010-07-16 | 2018-04-24 | 三星电子株式会社 | By infra-frame prediction come the method and apparatus that is coded and decoded to image |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109922329B (en) | 2021-02-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6459429B1 (en) | Segmenting compressed graphics data for parallel decompression and rendering | |
| CN103440612B (en) | Image processing method and device in a kind of GPU vitualization | |
| US6628277B1 (en) | Decompression of three-dimensional graphics data using mesh buffer references to reduce redundancy of processing | |
| US10878527B2 (en) | Variable resolution graphics processing | |
| CN109871510B (en) | Two-dimensional convolution operation processing method, system, equipment and computer storage medium | |
| CN102752594B (en) | Cluster rendering method based on image decoding and decoding and parallel transmission | |
| US10481852B2 (en) | Display data processing | |
| CN108235057A (en) | A kind of network transmission and method for visualizing of extensive utilizing ocean current data | |
| CN111984114A (en) | Multi-person interaction system based on virtual space and multi-person interaction method thereof | |
| CN115794913B (en) | Data processing method and device in artificial intelligence system | |
| CN112991231B (en) | Single-image super-image and perception image enhancement joint task learning system | |
| CN111915673A (en) | Image processing method, image processing device, terminal equipment and storage medium | |
| CN102880454A (en) | Method for webpage displaying of three-dimensional medical model and system thereof | |
| WO2018133312A1 (en) | Processing method and device | |
| CN109922329A (en) | Compression method, decompression method and the device of virtual reality imagery data | |
| CN104639834A (en) | Method and system for transmitting camera image data | |
| CN113835890A (en) | Rendering data processing method, device, equipment and storage medium | |
| US10319063B2 (en) | System and method for compacting compressed graphics streams for transfer between GPUs | |
| WO2023169369A1 (en) | Pedestrian re-identification method, system, apparatus and device, and medium | |
| US8441487B1 (en) | Bandwidth compression for shader engine store operations | |
| CN107274348B (en) | Calibration method and calibration device for optical fiber bundle image transmission | |
| Malkin et al. | CUDA-Optimized real-time rendering of a Foveated Visual System | |
| CN103268619B (en) | The method of image data batch compression in swf file and device | |
| CN103646427A (en) | Method and device for acquiring image data | |
| CN111260768B (en) | Picture processing method and device, storage medium and electronic device |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20210226 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |