CN101778284A - Lossy compression method for multifocal multiphoton microscopic imaging data - Google Patents

Lossy compression method for multifocal multiphoton microscopic imaging data Download PDF

Info

Publication number
CN101778284A
CN101778284A CN 201010106332 CN201010106332A CN101778284A CN 101778284 A CN101778284 A CN 101778284A CN 201010106332 CN201010106332 CN 201010106332 CN 201010106332 A CN201010106332 A CN 201010106332A CN 101778284 A CN101778284 A CN 101778284A
Authority
CN
China
Prior art keywords
coding
coefficient
centerdot
subimage
image
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
CN 201010106332
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.)
Hangzhou Dianzi University
Hangzhou Electronic Science and Technology University
Original Assignee
Hangzhou Electronic Science and Technology University
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 Hangzhou Electronic Science and Technology University filed Critical Hangzhou Electronic Science and Technology University
Priority to CN 201010106332 priority Critical patent/CN101778284A/en
Publication of CN101778284A publication Critical patent/CN101778284A/en
Pending legal-status Critical Current

Links

Landscapes

  • Compression Of Band Width Or Redundancy In Fax (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

The invention relates to a lossy compression method for multifocal multiphoton microscopic imaging data. The existing data compression effects are not good. The method of the invention comprises the following steps: extracting binary format imaging data from an imaging data file and carrying out lossy compression on the extracted image data by a JPEG algorithm. The extracted binary format data file forms an image matrix; any layer of the image matrix is compressed by the JPEG algorithm; firstly, the image of the layer is divided into nonoverlapping 8*8 subimages; then the subimages are coded by carrying out grey level moving, forward discrete cosine transformation, normalization, quantization and Huffman coding on the subimages; and finally, all the subimages of the layer are coded by the method. The invention takes example by the characteristic of a JPEG coding standard that the information which has less effect on the image quality is neglected, carries out lossy compression on a multifocal multiphoton microscopic imaging image data block, and obtains considerable compressibility.

Description

A kind of lossy compression method method of imaging data of multifocal multiphoton microscope
Technical field
The invention belongs to the multifocal multiphoton microscopic imaging field, relate to a kind of lossy compression method method of imaging data of multifocal multiphoton microscope.
Background technology
Multifocal multiphoton microscope is one of the most effective biological tissue three-dimensional imaging technology in the world today.This technology is to adopt laser as light source on traditional fluorescence microscope imaging basis, installed laser scanning device additional, converge in the focal position with near-infrared laser and make it to realize that multiphoton fluorescence excites, utilize multiphoton excitation to reach the effect that weakens photodamaged and photobleaching simultaneously, and then the fluoroscopic image of the high-resolution cell or tissue interior detail micro-structural that obtains, and utilize the image processing techniques of computer, make the researcher can observation of cell or the fine structure and the metamorphosis of organization internal.Multifocal multiphoton microscope has become important research means in the fields such as morphology, molecular cytobiology, Neuscience, tumor research and the detection of optics live body at present.
Because the more traditional two-photon microscope of multifocal multiphoton microscope has that image taking speed is faster, the outstanding effect advantage of imaging depth and contrast.Yet this development has also caused the micro-image data volume of its imaging to become more and more huger.The liver specimens imaging data of being quoted as embodiment part in this specification only data block of place scanning just reaches 4MB, carries out the data volume that complete scan detects and will reach the GB magnitude.So huge data volume give image storage, transmit and the technology that reads has proposed stern challenge, one of key technology that solves this class problem is exactly the lossy compression of image.The lossy compression method of image can make image under the prerequisite that guarantees certain mass, and existing expression of image information is transformed into the expression-form that another can make the comparatively considerable minimizing of data volume acquisition.
Summary of the invention
The object of the present invention is to provide a kind of lossy compression method method of imaging data of multifocal multiphoton microscope.
The lossy compression method method of imaging data of multifocal multiphoton microscope of the present invention comprises the imaging data that extracts binary format from the imaging data file and adopts jpeg algorithm that the view data of extracting is carried out lossy compression method that concrete steps are:
Step (1) reads the binary format data file of multifocal multiphoton microscopic imaging, and making this binary format data file generate resolution is that M * N, each pixel are 8, the image of L layer altogether.M, N and L are by the scanning imagery characteristic decision of multifocal multiphoton microscope.
The binary format data file forms the image array of the M * N resolution of L layer, and it is stored among the three-dimensional matrice img (be the formed layering image of imaging data block, its size is M * N * L, and the element span is 0~255).
Step (2) extract the i layer data of three-dimensional matrice img as the input f of compression (x, y), 1≤i≤L wherein, adopt jpeg algorithm come to f (x y) compresses, and its concrete steps are as follows:
1. (x y) is divided into nonoverlapping 8 * 8 subimage, and j piece subimage is f with f 8(x, y), its by
Figure GSA00000024442400021
2. (x, y) each pixel of all subimages in from left to right deducts 2 from top to bottom to f K-1Do gray scale and move, obtain the subimage f ' after j piece subimage gray scale moves 8(x, y), wherein k is the bit number of image;
3. the subimage f ' after j piece subimage gray scale being moved 8(x y) carries out Forward Discrete Cosine Transform (DCT) conversion, obtains f ' 8(x, Forward Discrete Cosine Transform T y) (u, v),
T ( u , v ) = Σ x = 0 7 Σ y = 0 7 f 8 ′ ( x , y ) α ( u ) α ( v ) cos [ ( 2 x + 1 ) uπ 16 ] cos [ ( 2 y + 1 ) vπ 16 ]
u=0,1,2,…7,v=0,1,2,…7 α ( u ) = 1 8 u = 0 1 2 u = 1,2 , . . . , 7 ; α ( u ) = 1 8 u = 0 1 2 u = 1,2 , . . . , 7
4. (u v) carries out normalization and quantification and obtains with T
Figure GSA00000024442400025
Figure GSA00000024442400026
u=0,1,…,7 v=0,1,…,7
In the formula, round rounds up to get the function of nearest integer, and (u v) is a luminance component quantization table in the Joint Photographic Experts Group Annex K item to Z;
5. will
Figure GSA00000024442400027
Rearrange element position according to the Z-shaped pattern in the Joint Photographic Experts Group, obtain an one-dimension array that 64 elements are arranged, to first element DC coefficient in this one-dimension array
Figure GSA00000024442400028
Carry out huffman coding with other elements A C coefficient that removes first element in this one-dimension array; Ask for j piece subimage in the i tomographic image
Figure GSA00000024442400029
And the DC difference coefficient DC between the j-1 piece subimage DC coefficient Diff,
DC diff = T ^ j ( 0,0 ) - T ^ j - 1 ( 0,0 ) In the formula,
Figure GSA000000244424000211
Figure GSA000000244424000212
JPEG coefficient coding classification chart among the Annex K is determined j piece subimage difference coefficient DC in the contrast Joint Photographic Experts Group DiffAffiliated DC difference class, contrast the DC coefficient luminance component huffman coding table of giving tacit consent among the Joint Photographic Experts Group Annex K then and inquire about j piece subimage difference coefficient DC DiffBasic coding and coding total length value;
When coding total length value during, but deduct basic coding length value value K, with j piece subimage difference coefficient Dc with the total length value of encoding greater than the basic coding length value DiffLeast significant bit be arranged in the binary number of K bit and subtract 1, obtain the additional coding of binary number at last;
Basic coding and additional coded sequence are combined into j piece subimage difference coefficient DC DiffThe coding of variable-length;
6. non zero AC coefficient in the one-dimension array of step in is 5. encoded one by one; JPEG coefficient coding classification chart among the Annex K is determined the AC class that non zero AC coefficient is affiliated one by one in the contrast Joint Photographic Experts Group;
According to the number of null value before aforementioned AC generic data that inquire and the non zero AC coefficient, contrast basic coding and the coding total length value that the AC coefficient luminance component huffman coding table of giving tacit consent among the Joint Photographic Experts Group Annex K is inquired about each non zero AC coefficient with these two data;
When coding total length value during, but deduct basic coding length value value K, the least significant bit of AC coefficient is arranged in the binary number of K bit and subtracts 1, obtain the additional coding of binary number at last with the total length value of encoding greater than the basic coding length value;
Basic coding and additional coded sequence are combined into the coding of the variable-length of non zero AC coefficient;
7. the coefficient that step is null value to the end item in the one-dimension array in is 5. represented with EOB sign EOB, the AC coefficient luminance component huffman coding table inquiry EOB that gives tacit consent among the contrast Joint Photographic Experts Group Annex K is encoded to 1010, and the coding of EOB is added into step coding end 6., finish the coding of j piece subimage in the i tomographic image;
8. according to step method 1.~7., ask for the coding of other subimage blocks of i tomographic image;
Step (3) is compressed other layers among the three-dimensional matrice img according to the method for step (2), finishes the lossy compression method of imaging data of multifocal multiphoton microscope.
The present invention's employing is encoded the multifocal multiphoton microscopic imaging view data and is formed the purpose that new data file reaches packed data by Joint Photographic Experts Group, its biggest advantage is to have used for reference ignoring of the JPEG coding standard information feature little to picture quality influence, compression multifocal multiphoton microscopic imaging video data block makes initial data descend to some extent in picture quality but influences under the little situation and obtained considerable compression ratio obtaining image information itself with diminishing.
Embodiment
The lossy compression method method of imaging data of multifocal multiphoton microscope, the step of the following concrete enforcement of employing on the MATLAB6.5 programming platform:
Step (1) is used the binary format data file gfp_106000.int that fopen () function is opened, fread () function reads multifocal multiphoton microscopic imaging, makes that this binary format data file generates that resolution is 192 * 192, each pixel is 8, totally 30 layers image.
The binary format data file forms the image array of 30 layers 192 * 192 resolution, and it is stored among the three-dimensional matrice img (be the formed layering image of imaging data block, its size is 192 * 192 * 30, and the element span is 0~255).
The 1st layer data that step (2) is extracted three-dimensional matrice img as the used input f of compression (x, y) (be f (x, y)=img (::, 1)), adopt jpeg algorithm come to f (x y) compresses, and its concrete steps are as follows:
1. (x y) is divided into nonoverlapping 8 * 8 subimage, and j piece subimage is f with f 8(x, y), wherein
Figure GSA00000024442400041
2. (x, y) each pixel of all subimages in from left to right deducts 2 from top to bottom to f 8-1=128 do gray scale moves, and obtains the subimage f ' after j piece word image gray scale moves 8(x, y), wherein k=8 is the bit number of image;
3. use the subimage f ' after dctmtx () and blkproc () function move j piece word image gray scale 8(x y) carries out dct transform, obtains f ' 8(x, and Forward Discrete Cosine Transform T y) (u, v);
4. (u v) uses the luminance component quantization table of giving tacit consent among the Joint Photographic Experts Group Annex K and blkproc () function carries out normalization and quantification obtains with T
Figure GSA00000024442400042
5. will
Figure GSA00000024442400043
Rearrange element position according to the Z-shaped pattern in the Joint Photographic Experts Group, obtain an one-dimension array that 64 elements are arranged, to first element DC coefficient in this one-dimension array Carry out huffman coding with other elements A C coefficient that removes first element in this one-dimension array; Ask for j piece subimage in the i tomographic image
Figure GSA00000024442400045
And the DC difference coefficient DC between the subimage DC coefficient of front Diff,
DC diff = T ^ j ( 0,0 ) - T ^ j - 1 ( 0,0 )
In the formula, 1≤j≤576,
Figure GSA00000024442400047
JPEG coefficient coding classification chart among the Annex K is determined j piece subimage difference coefficient DC in the contrast Joint Photographic Experts Group DiffAffiliated DC difference class, the DC coefficient luminance component huffman coding table of giving tacit consent among the contrast Joint Photographic Experts Group Annex K is inquired about j piece subimage difference coefficient DC DiffBasic coding and coding total length value;
When coding total length value during, but deduct basic coding length value value K, with j piece subimage difference coefficient DC with the total length value of encoding greater than the basic coding length value DiffLeast significant bit be arranged in the binary number of K bit and subtract 1, the last binary number that obtains is for replenishing coding;
Basic coding and additional coded sequence are combined into j piece subimage difference coefficient DC DiffThe coding of variable-length;
6. non zero AC coefficient in the one-dimension array of step in is 5. encoded one by one; JPEG coefficient coding classification chart among the Annex K is determined the AC class that non zero AC coefficient is affiliated one by one in the contrast Joint Photographic Experts Group;
According to the number of null value before aforementioned data that inquire the AC generic and the non zero AC coefficient, contrast basic coding and the coding total length value that the AC coefficient luminance component huffman coding table of giving tacit consent among the Joint Photographic Experts Group Annex K is inquired about each non zero AC coefficient with these two data;
When coding total length value during greater than the basic coding length value, but deduct basic coding length value value K with coding total length value, the least significant bit of AC coefficient is arranged in the binary number of K bit and subtracts 1, the last binary number that obtains is encoded for replenishing;
Basic coding and additional coded sequence are combined into the coding of the variable-length of non zero AC coefficient;
7. the coefficient that step is null value to the end item in the one-dimension array in is 5. represented with EOB sign EOB, the AC coefficient luminance component huffman coding table inquiry EOB that gives tacit consent among the contrast Joint Photographic Experts Group Annex K is encoded to 1010, and the coding of EOB is added into step coding end 6., finish the coding of j piece subimage in the i tomographic image;
8. according to step method 1.~7., (x, the coding of other subimage blocks y) all dispose up to all 576 number of sub images pieces to ask for the 1st tomographic image f;
Step (3) is compressed other 29 layers among the three-dimensional matrice img according to the method for step (2), finishes the lossy compression method of imaging data of multifocal multiphoton microscope.
Step (4) adopts image compression rate CR that the compression method of image is quantitatively described, and its expression formula is as follows: C R = n 1 n 2
Wherein, n 1Represent occupied storage size in the former data acquisition system (being original image), n 2The data of representative after through coding in conjunction with (i.e. compression after image) occupied storage size.
Adopt use lossy compression method method compression multifocal multiphoton microscopic imaging video data block of the present invention, by using certain liver specimens data block file gfp_106000.int experiment to show, the compression ratio of the 1st tomographic image of this image block is 50.5852, the compression ratio of other 29 tomographic images is between 50~93, image after the compression descends to some extent than the original image quality, but can obtain considerable compression ratio.

Claims (1)

1. the lossy compression method method of an imaging data of multifocal multiphoton microscope is characterized in that this method comprises the steps:
Step (1) reads the binary format data file of multifocal multiphoton microscopic imaging, and generation resolution is that M * N, each pixel are 8, the image of L layer altogether; Wherein M, N and L are by the scanning imagery characteristic decision of multifocal multiphoton microscope; The image array that the binary format data file is formed the M * N resolution of L layer is stored among the three-dimensional matrice img;
Step (2) extract the i layer data of three-dimensional matrice img as the input f of compression (x, y), 1≤i≤L wherein, adopt jpeg algorithm to f (x y) compresses, and concrete steps are as follows:
1. (x y) is divided into nonoverlapping 8 * 8 subimage, and j piece subimage is designated as f with f 8(x, y), wherein 1 ≤ j ≤ M × N 8 × 8 ;
2. (x, y) each pixel of all subimages in from left to right deducts 2 from top to bottom to f K-1Do gray scale and move, obtain the subimage f ' after j piece subimage gray scale moves 8(x, y), wherein k is the bit number of image;
3. the subimage f ' after j piece subimage gray scale being moved 8(x y) carries out the Forward Discrete Cosine Transform conversion, obtains f ' 8(x, Forward Discrete Cosine Transform T y) (u, v),
T ( u , v ) = Σ x = 0 7 Σ y = 0 7 f 8 ′ ( x , y ) α ( u ) α ( v ) cos [ ( 2 x + 1 ) uπ 16 ] cos [ ( 2 y + 1 ) vπ 16 ]
u = 0,1,2 , · · · 7 , v = 0,1,2 , · · · 7 , α ( u ) = 1 8 u = 0 1 2 u = 1,2 , · · · , 7 , α ( v ) = 1 8 v = 0 1 2 v = 1,2 , · · · , 7
4. (u v) carries out normalization and quantification and obtains with T
Figure FSA00000024442300015
T ^ ( u , v ) = round [ T ( u , v ) Z ( u , v ) ] , u = 0,1 , · · · , 7 , v = 0,1 , · · · , 7
In the formula, round rounds up to get the function of nearest integer, and (u v) is a luminance component quantization table in the Joint Photographic Experts Group Annex K item to Z;
5. will
Figure FSA00000024442300017
Rearrange element position according to the Z-shaped pattern in the Joint Photographic Experts Group, obtain an one-dimension array that 64 elements are arranged, to first element DC coefficient in this one-dimension array
Figure FSA00000024442300018
Carry out huffman coding with other elements A C coefficient that removes first element in this one-dimension array;
Ask for j piece subimage in the i tomographic image
Figure FSA00000024442300021
And the DC difference coefficient DC between the j-1 piece subimage DC coefficient Diff,
DC diff = T ^ j ( 0,0 ) - T ^ j - 1 ( 0,0 ) , 1 ≤ j ≤ ( M × N 8 × 8 ) , T ^ 0 ( 0,0 ) = 0
JPEG coefficient coding classification chart among the Annex K is determined j piece subimage difference coefficient DC in the contrast Joint Photographic Experts Group DiffAffiliated DC difference class, contrast the DC coefficient luminance component huffman coding table of giving tacit consent among the Joint Photographic Experts Group Annex K then and inquire about j piece subimage difference coefficient DC DiffBasic coding and coding total length value;
When coding total length value during, but deduct basic coding length value value K, with j piece subimage difference coefficient DC with the total length value of encoding greater than the basic coding length value DiffLeast significant bit be arranged in the binary number of K bit and subtract 1, obtain the additional coding of binary number at last;
Basic coding and additional coded sequence are combined into j piece subimage difference coefficient DC DiffThe coding of variable-length;
6. non zero AC coefficient in the one-dimension array of step in is 5. encoded one by one; JPEG coefficient coding classification chart among the Annex K is determined the AC class that non zero AC coefficient is affiliated one by one in the contrast Joint Photographic Experts Group;
The number of null value before AC generic data that inquire and the non zero AC coefficient contrasts basic coding and the coding total length value that the AC coefficient luminance component huffman coding table of giving tacit consent among the Joint Photographic Experts Group Annex K is inquired about each non zero AC coefficient with these two data;
When coding total length value during, but deduct basic coding length value value K, the least significant bit of AC coefficient is arranged in the binary number of K bit and subtracts 1, obtain the additional coding of binary number at last with the total length value of encoding greater than the basic coding length value;
Basic coding and additional coded sequence are combined into the coding of the variable-length of non zero AC coefficient;
7. the coefficient that step is null value to the end item in the one-dimension array in is 5. represented with EOB sign EOB, the AC coefficient luminance component huffman coding table inquiry EOB that gives tacit consent among the contrast Joint Photographic Experts Group Annex K is encoded to 1010, and the coding of EOB is added into step coding end 6., finish the coding of j piece subimage in the i tomographic image;
8. according to step method 1.~7., ask for the coding of other subimage blocks of i tomographic image;
Step (3) is compressed other layers among the three-dimensional matrice img according to the method for step (2), finishes the lossy compression method of imaging data of multifocal multiphoton microscope.
CN 201010106332 2010-02-02 2010-02-02 Lossy compression method for multifocal multiphoton microscopic imaging data Pending CN101778284A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201010106332 CN101778284A (en) 2010-02-02 2010-02-02 Lossy compression method for multifocal multiphoton microscopic imaging data

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201010106332 CN101778284A (en) 2010-02-02 2010-02-02 Lossy compression method for multifocal multiphoton microscopic imaging data

Publications (1)

Publication Number Publication Date
CN101778284A true CN101778284A (en) 2010-07-14

Family

ID=42514581

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201010106332 Pending CN101778284A (en) 2010-02-02 2010-02-02 Lossy compression method for multifocal multiphoton microscopic imaging data

Country Status (1)

Country Link
CN (1) CN101778284A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103108179A (en) * 2011-11-15 2013-05-15 上海宝康电子控制工程有限公司 Self-adaptive compression method achieving matching of joint photographic experts group (JPEG) image size upper limits of intelligent transportation system
CN103108179B (en) * 2011-11-15 2016-12-14 上海宝康电子控制工程有限公司 Intelligent transportation system realizes the self-adapting compressing method that JPEG picture upper dimension bound can be joined
US10687062B1 (en) 2019-02-22 2020-06-16 Google Llc Compression across multiple images

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103108179A (en) * 2011-11-15 2013-05-15 上海宝康电子控制工程有限公司 Self-adaptive compression method achieving matching of joint photographic experts group (JPEG) image size upper limits of intelligent transportation system
CN103108179B (en) * 2011-11-15 2016-12-14 上海宝康电子控制工程有限公司 Intelligent transportation system realizes the self-adapting compressing method that JPEG picture upper dimension bound can be joined
US10687062B1 (en) 2019-02-22 2020-06-16 Google Llc Compression across multiple images

Similar Documents

Publication Publication Date Title
CN101755461B (en) Image processing apparatus, image processing method
CN101513069B (en) Method and equipment for encoding and decoding video color enhancement layer
CN105006018B (en) Three dimensional CT core image super resolution ratio reconstruction method
EP1566769A3 (en) Method and apparatus for encoding and decoding 3D data
CN110348487A (en) A kind of method for compressing high spectrum image and device based on deep learning
CN105118053B (en) A kind of full reference picture assessment method for encoding quality based on compressed sensing
Wang et al. Pore structure damages in cement-based materials by mercury intrusion: A non-destructive assessment by X-ray computed tomography
CN104778665B (en) Compression ghost image reconstruction method and system based on the driving of natural image block priori
Sanchez et al. HEVC-based lossless compression of whole slide pathology images
Pashaei et al. Deep learning-based single image super-resolution: an investigation for dense scene reconstruction with UAS photogrammetry
CN103164850B (en) A kind of multi-focus image fusing method based on compressed sensing and device
Thawakar et al. Image and video super resolution using recurrent generative adversarial network
CN105931181B (en) Super resolution image reconstruction method and system based on non-coupled mapping relations
CN101778284A (en) Lossy compression method for multifocal multiphoton microscopic imaging data
Zhouping Fusion algorithm of optical images and SAR with SVT and sparse representation
Jaferzadeh et al. Lossless and lossy compression of quantitative phase images of red blood cells obtained by digital holographic imaging
CN101738718B (en) Lossless compression method for imaging data of multifocal multiphoton microscope
CN104268169B (en) A kind of remote sensing image data immediate processing method based on PS softwares
CN107950025A (en) Method and apparatus for the prediction of the current block that determines enhancement layer
CN110111257A (en) A kind of super resolution image reconstruction method based on the weighting of feature channel adaptive
Moser et al. Dwa: Differential wavelet amplifier for image super-resolution
CN111784572B (en) Image fusion and super-resolution joint implementation method based on discriminant dictionary learning
Artuğer et al. Chaotic quantization based JPEG for effective compression of whole slide images
Dong et al. An interactive tool for ROI extraction and compression on whole slide images
CN103065336A (en) Directional pyramid coding method of image

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Open date: 20100714