CN108513136A - The compression method and read method of magnanimity space three-dimensional image data - Google Patents

The compression method and read method of magnanimity space three-dimensional image data Download PDF

Info

Publication number
CN108513136A
CN108513136A CN201810306440.8A CN201810306440A CN108513136A CN 108513136 A CN108513136 A CN 108513136A CN 201810306440 A CN201810306440 A CN 201810306440A CN 108513136 A CN108513136 A CN 108513136A
Authority
CN
China
Prior art keywords
image data
dimensional image
dimensional
data
space
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.)
Pending
Application number
CN201810306440.8A
Other languages
Chinese (zh)
Inventor
李安安
陈勇
骆清铭
龚辉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Suzhou Institute Of Brain Space Information Huazhong University Of Science And Technology
Original Assignee
Suzhou Institute Of Brain Space Information Huazhong University Of Science And Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Suzhou Institute Of Brain Space Information Huazhong University Of Science And Technology filed Critical Suzhou Institute Of Brain Space Information Huazhong University Of Science And Technology
Priority to CN201810306440.8A priority Critical patent/CN108513136A/en
Publication of CN108513136A publication Critical patent/CN108513136A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/597Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding specially adapted for multi-view video sequence encoding
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T19/00Manipulating 3D models or images for computer graphics
    • G06T19/20Editing of 3D images, e.g. changing shapes or colours, aligning objects or positioning parts
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/42Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Architecture (AREA)
  • Computer Graphics (AREA)
  • Computer Hardware Design (AREA)
  • General Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Processing Or Creating Images (AREA)

Abstract

The present invention provides a kind of compression method and read method of magnanimity space three-dimensional image data, and the compression method of the magnanimity space three-dimensional image data includes the following steps:Magnanimity space three-dimensional image data is divided into the identical three-dimensional data fritter of size;Video coding compression is carried out using video encoder to each three-dimensional data fritter that piecemeal obtains, obtains Video coding file set.By first carrying out piecemeal to magnanimity space three-dimensional image data, the method that then Video coding compresses again can efficiently and effectively compress magnanimity space three-dimensional image data the present invention, and read and be convenient to fast.

Description

The compression method and read method of magnanimity space three-dimensional image data
Technical field
The present invention relates to image data processing technique more particularly to a kind of compression methods of magnanimity space three-dimensional image data And read method.
Background technology
Space three-dimensional image is able to record complete structure information of the object in three dimensions, for the complete of research object Structure is of great significance.Such as in Neurobiology field, in order to study the structure of brain, the sky for obtaining brain is needed Between 3 d image data.With the development of imaging technique, pass through the number for the space three-dimensional image data that micro imaging system obtains According to measuring increasing, even up to 10TB magnitudes, the space three-dimensional image data of this magnanimity to store, transmit all cause it is huge Big pressure.Therefore, phase of the data compression for magnanimity space three-dimensional image data is carried out to magnanimity space three-dimensional image data Application is closed, is had a very important significance.
Above-mentioned space three-dimensional image is made of the identical two-dimensional grating image of multiple sizes.At present to space three-dimensional image The universal method that data set is compressed independently is compressed to multiple two dimensional images for forming space three-dimensional image.Such as: Using the coding modes such as common lzw, jpeg in picture compression, it is compressed.But above-mentioned compression method is to constituting Each two dimensional image of space three-dimensional image carries out independent compression coding, with only redundancy of the data in two-dimensional space Information does not make full use of the redundancy of data in three dimensions, therefore its compression effectiveness is not satisfactory.
People very early, it is realized that the redundancy of space three-dimensional image be not only present in indicate its multiple two dimensional images in Portion also exists simultaneously between adjacent two dimensional image.Since video data is by multiple continuous two dimensional images on time shaft It is formed, the 3 d image data on actually a kind of time shaft.Therefore, people are it is also contemplated that Video coding can be utilized Technology realizes the data compression to space three-dimensional image.Such as in medical domain, just there is researcher to utilize video coding technique pair The space three-dimensional image data that nuclear magnetic resonance obtains is compressed.Specifically scheme is:Space three-dimensional image data will be formed A frame input video encoder of the every two dimensional image as video carries out Video coding to complete space three-dimensional data, obtains To a Video coding file.But for some magnanimity space three-dimensional image datas, the size of image often substantially exceeds The size that existing all video encoders are supported, directly carry out video compress to it using existing video encoder can not It realizes.Even if being improved to existing video encoder, the video encoder of the such large-size data of support is realized out, according to It is straight with the space three-dimensional image data of the way of nuclear magnetic resonance space three-dimensional image type, the magnanimity of TBs up to tens of to data volume Row Video coding is tapped into, complete magnanimity space three-dimensional image data direct coding is obtained into a video file and calculation amount Greatly and it is difficult to the work executed parallel.Also, when using such compressed data, even if it is only necessary to obtain space three The data of the subspace of some very little in dimensional data image also have to carry out video solution to complete 3 d image data Code, it is extremely inefficient.In addition, the image data in scientific research also has the characteristics of multichannel, high dynamic range.Therefore, existing Video compression scheme for space three-dimensional image data is not particularly suited for the video compress of magnanimity space three-dimensional image data.
Therefore, it is necessary to a kind of compression method that effectively and efficiently magnanimity space three-dimensional image data can be compressed with And corresponding read method.
Invention content
A kind of effective and efficient magnanimity space three-dimensional image is provided the purpose of the present invention is to solve the above problem The compression method and read method of data.
The purpose of the present invention is what is realized by following technical solution:
A kind of compression method of magnanimity space three-dimensional image data, includes the following steps:
Magnanimity space three-dimensional image data is divided into the identical three-dimensional data fritter of size by S11. piecemeal;
S12. Video coding compresses, and video volume is carried out using video encoder to each three-dimensional data fritter that piecemeal obtains Code compression, obtains Video coding file set.
Further, the magnanimity space three-dimensional image data is made of the identical two-dimensional grating image of size.
Further, the S11. blocking steps carry out supplying data when to frontier district domain partitioning, make borderline region piecemeal The size of obtained three-dimensional data fritter is identical as the size of three-dimensional data fritter that non-borderline region piecemeal obtains.
Further, the size of the three-dimensional data fritter is identical.
Further, the length of the three-dimensional data fritter is more than 200 pixels, and is less than 5000 pixels.
Further, the S11. blocking steps, while three-dimensional data fritter is generated in former magnanimity space three-dimensional image data In spatial position index.
Further, the pixel single channel bit depth of the S11. blocking steps, described image data is more than 8bits, along Bit depth direction carries out piecemeal from low level to a high position in data space to data, and the bit depth of data is equal to after piecemeal 8bits, the part less than 8bits mend 0 in a high position.
Further, the S12. Video codings compression step is lossy compression or lossless compression.
Further, the S12. Video codings compression step, is calculated, or accelerated using GPU using CPU.
A kind of read method of magnanimity space three-dimensional image data, includes the following steps:
S21. input needs the coordinate range of the data read;
S22. the Video coding file set for needing to read is calculated according to coordinate range, and obtains the Video coding file Set;
S23. video is carried out to the Video coding file set to decode to obtain the identical three-dimensional data fritter of multiple sizes;
S24. the three-dimensional data fritter is read into memory headroom, to the multiple three-dimensional data in memory headroom Fritter is spliced and is cut, and the magnanimity space three-dimensional image data of required coordinate range is finally obtained.
Further, the S23. decodes to obtain multiple sizes identical three to Video coding file set progress video Dimension data fritter using CPU calculate or be accelerated using GPU.
Beneficial effects of the present invention are embodied in, and by first carrying out piecemeal to magnanimity space three-dimensional image data, are suitble to The data patch of video compress is carried out, it, can be effectively and high then to the method for each data patch application Video coding compression Effect compresses magnanimity space three-dimensional image data, and reads and be convenient to fast.
Description of the drawings
Fig. 1 is the flow chart of the compression method of specific embodiment of the invention magnanimity space three-dimensional image data;
Fig. 2 is the schematic diagram of the compression method of specific embodiment of the invention magnanimity space three-dimensional image data;
Fig. 3 is the right in data space of the compression method of specific embodiment of the invention magnanimity space three-dimensional image data Data carry out the schematic diagram of piecemeal;
Fig. 4 is the flow chart of the read method of specific embodiment of the invention magnanimity space three-dimensional image data.
Specific implementation mode
The present invention will be further described in detail with embodiment below in conjunction with the accompanying drawings.
Fig. 1 show the flow chart of the compression method of specific embodiment of the invention magnanimity space three-dimensional image data.Fig. 2 For the schematic diagram of the compression method of specific embodiment of the invention magnanimity space three-dimensional image data.Refer to Fig. 1 and Fig. 2 institutes Show, the compression method of the magnanimity space three-dimensional image data includes the following steps:
Magnanimity space three-dimensional image data is divided into the identical three-dimensional data fritter of size by S11. blocking step;
S12. Video coding compression step regards each three-dimensional data fritter that piecemeal obtains using video encoder Frequency coding compression, obtains Video coding file set.
Wherein, the magnanimity space three-dimensional image data is to be different from the raster image of vector image, and is by size Identical two-dimensional grating image composition.
The identical three-dimensional data fritter of the size is that the length of each three-dimensional data fritter distinguishes correspondent equal.
If the length of complete magnanimity space three-dimensional image data can not be whole by the length of three-dimensional data fritter It removes, the size of borderline region is extended, to the region expanded by the S11. blocking steps when to frontier district domain partitioning It carries out supplying data, 0 or arbitrary constant can be used to fill.Because 0 represents black, it is equivalent to cover around element data block The frame of a black, the three-dimensional for making the size for the three-dimensional data fritter that borderline region piecemeal obtains be obtained with non-borderline region piecemeal The size of data patch is identical.
The length of the three-dimensional data fritter can be equal, can also be other arbitrary proportions.In this reality It applies in mode, the length of the three-dimensional data fritter is equal.
In order to improve Video coding and decoded efficiency, the length of the three-dimensional data fritter is more than 200 pictures Element, and it is less than 5000 pixels.
In order to which the three-dimensional data fritter splicing for obtaining piecemeal merges back into former magnanimity space three-dimensional image data, the S11. Blocking step, while generating spatial position index of the three-dimensional data fritter in former magnanimity space three-dimensional image data.
The S11. blocking steps can carry out piecemeal in locational space to data, can also be right in data space Data carry out piecemeal.Currently, most of video encoder can only all be encoded for the image data of each channel 8bits, But in scientific research, each even greater image datas of channel 16bits are also in daily use, in order to utilize support 8bits data Video encoder to 16bits data carry out Video coding compression, can be in data space to the 3-D view number of 16bits According to piecemeal is carried out, the high 8bits and low 8bits of the 3 d image data block of a 16bits are split, decomposition obtains two A 8bits data blocks.If the pixel single channel bit depth of image data is more than 8bits, need to also be along bit depth direction, in number According to piecemeal is carried out in space from low level to a high position, the bit depth of data is equal to 8bits after piecemeal, and the part less than 8bits is in height Mend 0 in position.As shown in Figure 3.
The S12. Video codings compression step, can be lossy compression, can also be lossless compression, can be according to specific Application scenarios select suitable Video coding compress mode.
The S12. Video codings compression step can be calculated using CPU, can also be accelerated using GPU.
It is shown in Figure 4, it is the stream of the read method of specific embodiment of the invention magnanimity space three-dimensional image data Cheng Tu.
Present invention further teaches a kind of read methods of the magnanimity space three-dimensional image data, include the following steps:
S21. input needs the coordinate range of the data read;
S22. the Video coding file set for needing to read is calculated according to coordinate range, and obtains the Video coding file Set;
S23. video is carried out to the Video coding file set to decode to obtain the identical three-dimensional data fritter of multiple sizes;
S24. the three-dimensional data fritter is read into memory headroom, to the multiple three-dimensional data in memory headroom Fritter is spliced and is cut, and the magnanimity space three-dimensional image data of required coordinate range is finally obtained.
Wherein, the S23. decodes to obtain the identical three-dimensional of multiple sizes to Video coding file set progress video Data patch can be calculated, decoding operate using CPU, can also be accelerated using GPU.
The compression method of specific implementation mode magnanimity space three-dimensional image data is illustrated the present invention individually below.
Example 1:
(1) piecemeal software TDat is used to carry out piecemeal to optical 3-dimensional image data set, it is 512*512*512 to obtain size Data block, the filename of data block includes its coordinate information in original data set;
(2) two dimensional image that the data block of each 512*512*512 is saved as to 512 512*512 adds at filename end It is the data of which layer in former 3-D view to add the digital representation two dimensional image;
(3) H.264 video is carried out using video coding tool ffmeg combinations libx264 to the two-dimensional image sequence of generation Coding, set coding parameter as:
-preset slow crf 18 tune film
Lossy compression is carried out, each data block corresponds to obtain the video file that a suffix is mp4.
Example 2:
(1) it uses deblocking software TDat to carry out piecemeal to the 3 d image data that electron microscope obtains, obtains big The small data block for 1024*800*400;
(2) the 3 d image data block of multiple 1024*800*400 is formed in memory, and records it in initial three-dimensional figure As the coordinate information in data set;
(3) data block generated to (2) process is handled, which is regarded as to the X-Y scheme of 400 1024*800 As sequence;
(4) by 400 two dimensional images obtained during (3) as 400 frames, input frame by frame is carried out using mov encoders Coding;
(5) each data block corresponds to the video file for generating an entitled .mov of suffix.
Example 3:
(1) 3 d image data is obtained by light microscope, by the 1000pixels* that 1000 bit depth are 8bits The two-dimensional grating image of 1000pixels forms;
(2) each tile size is designed as 512pixels*512pixels*512pixels.In order to ensure right When the boundary position of the original three-dimensional image data of 1000pixels*1000pixels*1000pixels carries out piecemeal, obtain The size of three-dimensional fritter is also 512pixels*512pixels*512pixels, to the borderline region of original three-dimensional image data It is supplied, the numerical value supplied is 0, and the size expansion by original three-dimensional image data is:1024pixels*1024pixels* 1024pixels.The three-dimensional data fritter that it is 512pixels*512pixels*512pixels that piecemeal, which obtains 8 sizes all,;
(3) H.264 Video coding is carried out respectively to 8 three-dimensional data fritters that piecemeal obtains in memory, and according to it Position in initial data, 8 data patch are saved as into 0_0_0.mp4,0_0_1.mp4,0_1_0.mp4,0_ respectively 1_1.mp4,1_0_0.mp4,1_0_1.mp4,1_1_0.mp4,1_1_1.mp4。
Example 4:
(1) 3 d image data is obtained by light microscope, pixel bit depth is 12bits, 1000 1000pixels* The two-dimensional grating image of 1000pixels forms;
(2) each tile size is designed as 512pixels*512pixels*512pixels.In order to ensure right When the boundary position of the original three-dimensional image data of 1000pixels*1000pixels*1000pixels carries out piecemeal, obtain The size of three-dimensional fritter is also 512pixels*512pixels*512pixels, to the borderline region of original three-dimensional image data It is supplied, the numerical value supplied is 0, and the size expansion by original three-dimensional image data is:1024pixels*1024pixels* 1024pixels.To three-dimensional data piecemeal in locational space, obtain that 8 bit depth are 12bits, size is all The three-dimensional data fritter of 512pixels*512pixels*512pixels;
(3) piecemeal, each fritter piecemeal in data space are carried out to 8 data blocks that piecemeal obtains in data space Obtain two bit depth be 8bits fritter, one of 8bits fritter storage be former 12bits fritters least-significant byte letter Breath, another 8bits fritter storage it is low 4 storage be former 12bits fritters high 4 information, high four are supplied 0;
(4) it is in memory that 8bits three-dimensional datas fritter carries out H.264 video respectively to 16 bit depth that piecemeal obtains Coding, and according to their positions in initial data, 8 data patch are saved as into 0_0_0_high.mp4,0_0_ respectively 0_low.mp4,0_0_1_high.mp4,0_0_low.mp4,0_1_0_high.mp4,0_1_0_low.mp4,0_1_1_ high.mp4,0_1_1_low.mp4,1_0_0_high.mp4,1_0_0_low.mp4,1_0_1_high.mp4,1_0_1_ low.mp4,1_1_0_high.mp4,1_1_0_low.mp4,1_1_1_high.mp4,1_1_1_high.mp4.In filename First three relative position of digital representation data block in the locational space of former three-dimensional data, the last high of filename is indicated should Data block is the high position data in former three-dimensional data space, and low indicates that the data block is the lower-order digit in former three-dimensional data space According to.
Example 5:Video coding compression is carried out to RGB color image data
(1) color three dimensional image data are obtained by optical microscopy imaging system, image data is divided into RGB triple channels, each Channel bit depth is 8bits.3 d image data by 1024 1024pixels*1024pixels two-dimensional grating image group At;
(2) each tile size is designed as 512pixels*512pixels*512pixels.To three in locational space Dimension data piecemeal, it is the color three dimension data patch of 512pixels*512pixels*512pixels to obtain 8 sizes all;
(3) H.264 Video coding is carried out respectively to 8 three-dimensional data fritters that piecemeal obtains in memory, and according to it Position in initial data, 8 data patch are saved as into 0_0_0.mp4,0_0_1.mp4,0_1_0.mp4,0_ respectively 1_1.mp4,1_0_0.mp4,1_0_1.mp4,1_1_0.mp4,1_1_1.mp4。
It can be seen that, the present invention to magnanimity space three-dimensional image data by first carrying out piecemeal, then according to the above Again Video coding compression method, can effectively and efficiently magnanimity space three-dimensional image data is compressed.And it reads It is convenient to quick.
It should be noted last that the above examples are only used to illustrate the technical scheme of the present invention and are not limiting, although ginseng It is described the invention in detail according to preferred embodiment, it will be understood by those of ordinary skill in the art that, it can be to the present invention Technical solution be modified or replaced equivalently, without departing from the spirit of the technical scheme of the invention and range, should all cover In the scope of the claims of the present invention.

Claims (11)

1. a kind of compression method of magnanimity space three-dimensional image data, which is characterized in that include the following steps:
Magnanimity space three-dimensional image data is divided into the identical three-dimensional data fritter of size by S11. blocking step;
S12. Video coding compression step carries out video to each three-dimensional data fritter that piecemeal obtains using video encoder Coding compression, obtains Video coding file set.
2. the compression method of magnanimity space three-dimensional image data according to claim 1, it is characterised in that:The magnanimity is empty Between 3 d image data be made of the identical two-dimensional grating image of size.
3. the compression method of magnanimity space three-dimensional image data according to claim 1, it is characterised in that:The S11. points Block step carries out supplying data when to frontier district domain partitioning, makes the size for the three-dimensional data fritter that borderline region piecemeal obtains It is identical as the size of three-dimensional data fritter that non-borderline region piecemeal obtains.
4. the compression method of magnanimity space three-dimensional image data according to claim 1, it is characterised in that:Three dimension It is identical according to the size of fritter.
5. the compression method of magnanimity space three-dimensional image data according to claim 1, it is characterised in that:Three dimension According to the length of fritter, it is more than 200 pixels, and be less than 5000 pixels.
6. the compression method of magnanimity space three-dimensional image data according to claim 1, it is characterised in that:The S11. points Block step, while generating spatial position index of the three-dimensional data fritter in former magnanimity space three-dimensional image data.
7. the compression method of magnanimity space three-dimensional image data according to claim 1, it is characterised in that:The S11. The pixel single channel bit depth of blocking step, described image data is more than 8 bits, along bit depth direction, in data space Piecemeal is carried out from low level to a high position, the bit depth of data is equal to 8 bits after piecemeal, and the part less than 8 bits mends 0 in a high position.
8. the compression method of magnanimity space three-dimensional image data according to claim 1, it is characterised in that:The S12. is regarded Frequency coding compression step, is lossy compression or lossless compression.
9. the compression method of magnanimity space three-dimensional image data according to claim 1, it is characterised in that:The S12. is regarded Frequency coding compression step, is calculated, or accelerated using GPU using CPU.
10. a kind of read method of magnanimity space three-dimensional image data, which is characterized in that include the following steps:
S21. input needs the coordinate range of the data read;
S22. the Video coding file set for needing to read is calculated according to coordinate range, and obtains the Video coding file set It closes;
S23. video is carried out to the Video coding file set to decode to obtain the identical three-dimensional data fritter of multiple sizes;
S24. the three-dimensional data fritter is read into memory headroom, it is small to the multiple three-dimensional data in memory headroom Block is spliced and is cut, and the magnanimity space three-dimensional image data of required coordinate range is finally obtained.
11. a kind of read method of magnanimity space three-dimensional image data according to claim 10, it is characterised in that:It is described S23. it carries out video to the Video coding file set to decode to obtain the identical three-dimensional data fritter of multiple sizes, uses CPU Calculate or is accelerated using GPU.
CN201810306440.8A 2018-04-08 2018-04-08 The compression method and read method of magnanimity space three-dimensional image data Pending CN108513136A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810306440.8A CN108513136A (en) 2018-04-08 2018-04-08 The compression method and read method of magnanimity space three-dimensional image data

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810306440.8A CN108513136A (en) 2018-04-08 2018-04-08 The compression method and read method of magnanimity space three-dimensional image data

Publications (1)

Publication Number Publication Date
CN108513136A true CN108513136A (en) 2018-09-07

Family

ID=63380928

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810306440.8A Pending CN108513136A (en) 2018-04-08 2018-04-08 The compression method and read method of magnanimity space three-dimensional image data

Country Status (1)

Country Link
CN (1) CN108513136A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113704207A (en) * 2021-08-10 2021-11-26 南京信息工程大学 High-altitude meteorological data compression and decoding method based on video compression technology

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103237216A (en) * 2013-04-12 2013-08-07 华为技术有限公司 Encoding and decoding method and encoding and decoding device for depth image
CN103947209A (en) * 2011-11-18 2014-07-23 皇家飞利浦有限公司 Encoding high quality (medical) images using standard lower quality (web) image formats
CN104504760A (en) * 2014-12-09 2015-04-08 北京畅游天下网络技术有限公司 Method and system for updating three-dimensional image in real time
CN104615739A (en) * 2015-02-11 2015-05-13 华中科技大学 Rapid data archiving method applicable to three-dimensional brain tissue high-resolution mass atlases
US20170208336A1 (en) * 2016-01-15 2017-07-20 Qualcomm Incorporated Multi-type-tree framework for video coding
US20180084281A1 (en) * 2016-09-20 2018-03-22 Qualcomm Incorporated Storing and retrieving high bit depth image data

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103947209A (en) * 2011-11-18 2014-07-23 皇家飞利浦有限公司 Encoding high quality (medical) images using standard lower quality (web) image formats
CN103237216A (en) * 2013-04-12 2013-08-07 华为技术有限公司 Encoding and decoding method and encoding and decoding device for depth image
CN104504760A (en) * 2014-12-09 2015-04-08 北京畅游天下网络技术有限公司 Method and system for updating three-dimensional image in real time
CN104615739A (en) * 2015-02-11 2015-05-13 华中科技大学 Rapid data archiving method applicable to three-dimensional brain tissue high-resolution mass atlases
US20170208336A1 (en) * 2016-01-15 2017-07-20 Qualcomm Incorporated Multi-type-tree framework for video coding
US20180084281A1 (en) * 2016-09-20 2018-03-22 Qualcomm Incorporated Storing and retrieving high bit depth image data

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
YUXIN LI等: ""TDat: An Efficient Platform for Processing Petabyte-Scale Whole-Brain Volumetric Images"", 《FRONTIERS IN NEURAL CIRCUITS》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113704207A (en) * 2021-08-10 2021-11-26 南京信息工程大学 High-altitude meteorological data compression and decoding method based on video compression technology
CN113704207B (en) * 2021-08-10 2023-05-09 南京信息工程大学 High-altitude meteorological data compression and decoding method based on video compression technology

Similar Documents

Publication Publication Date Title
CN114424542B (en) Video-based point cloud compression with non-canonical smoothing
CN108810571B (en) Method and apparatus for encoding and decoding two-dimensional point clouds
EP2805307B1 (en) Method and apparatus for compressing texture information of three-dimensional (3d) models
CN103703779B (en) Use the image compression of Sub-reso image
JP7431742B2 (en) Method and apparatus for encoding/decoding a point cloud representing a three-dimensional object
US10798389B2 (en) Method and apparatus for content-aware point cloud compression using HEVC tiles
CN102821279A (en) Picture compression method keeping with alpha channel
CN112219398A (en) Method and apparatus for depth coding and decoding
JP2016226001A (en) Decoder and decoding method
MX2008013647A (en) Flexible quantization.
CN111402380B (en) GPU compressed texture processing method
JP7389751B2 (en) Method and apparatus for encoding/decoding a point cloud representing a three-dimensional object
US20220014767A1 (en) Bit plane encoding of data arrays
CN102113305A (en) High dynamic range texture compression
US20220292730A1 (en) Method and apparatus for haar-based point cloud coding
KR20220069086A (en) Method and apparatus for encoding, transmitting and decoding volumetric video
CN114503553A (en) Video-based point cloud compression model to world signaling information
CN102970544A (en) JPEG (Joint Photographic Experts Group) encoding and decoding method and JPEG encoding and decoding system
JP2022525599A (en) Coding and decoding of patch data units for point cloud coding
CN112565790B (en) Method and device for encoding and decoding string prediction by using minimum base vector mark
CN108513136A (en) The compression method and read method of magnanimity space three-dimensional image data
CN114270863A (en) Method and device for coding and decoding stereoscopic video
CN107770543B (en) Data compression method and device for sequentially increasing cutoff values in multiple types of matching parameters
CN104735459B (en) Compression method, system and the video-frequency compression method of video local feature description
CN103763555A (en) Motion estimation method for reducing memory bandwidth requirements

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20180907

RJ01 Rejection of invention patent application after publication