Relation between brain architecture and mathematical ability in children: A DBM study

Population-based studies indicate that between 5 and 9 percent of US children exhibit significant deficits in mathematical reasoning, yet little is understood about the brain morphological features related to mathematical performances. In this work, deformation-based morphometry (DBM) analyses have been performed on magnetic resonance images of the brains of 79 third graders to investigate whether there is a correlation between brain morphological features and mathematical proficiency. Group comparison was also performed between Math Difficulties (MD-worst math performers) and Normal Controls (NC), where each subgroup consists of 20 age and gender matched subjects. DBM analysis is based on the analysis of the deformation fields generated by non-rigid registration algorithms, which warp the individual volumes to a common space. To evaluate the effect of registration algorithms on DBM results, five nonrigid registration algorithms have been used: (1) the Adaptive Bases Algorithm (ABA); (2) the Image Registration Toolkit (IRTK); (3) the FSL Nonlinear Image Registration Tool; (4) the Automatic Registration Tool (ART); and (5) the normalization algorithm available in SPM8. The deformation field magnitude (DFM) was used to measure the displacement at each voxel, and the Jacobian determinant (JAC) was used to quantify local volumetric changes. Results show there are no statistically significant volumetric differences between the NC and the MD groups using JAC. However, DBM analysis using DFM found statistically significant anatomical variations between the two groups around the left occipital-temporal cortex, left orbital-frontal cortex, and right insular cortex. Regions of agreement between at least two algorithms based on voxel-wise analysis were used to define Regions of Interest (ROIs) to perform an ROI-based correlation analysis on all 79 volumes. Correlations between average DFM values and standard mathematical scores over these regions were found to be significant. We also found that the choice of registration algorithm has an impact on DBM-based results, so we recommend using more than one algorithm when conducting DBM studies. To the best of our knowledge, this is the first study that uses DBM to investigate brain anatomical features related to mathematical performance in a relatively large population of children.     

基于大脑模板的MRI扫描自动定位方法

在大脑磁共振成像(MRI)影像学的数据采集中,通常先扫描一幅定位图像,并根据解剖学先验知识手动调整合适的扫描定位参数,再进行后续的正式扫描.该文实现了一种直接以大脑模板为参照的自动定位的方法:首先采集一幅中等分辨率的快速三维定位图像,然后通过与模板的配准确定定位参数,并应用到后续序列的扫描,以保证不同被试在图像采集时采用与模板一致的空间定位.该方法一方面便于不同被试的图像数据之间进行系统性比较与参照,帮助诊断者快速定位病灶,也可在后续常用的基于体素分析过程最大化数据的利用效率.另一方面,针对单个体多次扫描之间的自动定位,该文进一步使用迭代方法,通过多次"扫描、配准、自动定位"步骤,逐步减小图像配准算法的误差.实验证明,该文基于大脑模板的自动定位方法能够确保不同被试之间和同一被试之内在图像数据采集时的空间定位高度一致性,其中同一被试内多次扫描的空间定位误差1.0 mm和1.0o.     

基于尺度不变特征变换和区域互信息优化的多源遥感图像配准

为了进一步提高遥感图像配准精度, 提出了尺度不变特征变换(SIFT)结合区域互信息优化的遥感图像配准方法. 首先利用混沌序列的随机性和遍历性, 提出一种混沌量子粒子群优化(CQPSO)算法, 在量子粒子群优化(QPSO)算法迭代陷入早熟收敛时, 采用一种新的机理引入混沌序列, 进化粒子克服早熟. 图像配准算法分为预配准和精配准两个过程. 基于SIFT算法提取特征点, 经匹配和有效地外点排除完成预配准, 然后对匹配特征点坐标进行亚像素级微调, 通过最小二乘法求得一系列匹配参数构造初始粒子群, 最后利用混沌量子粒子群优化区域互信息完成精配准, 得到最优匹配参数. 用一些标准测试函数对所提出的CQPSO和QPSO及粒子群优化(PSO)算法进行了实验比较, 另外, 对SIFT, SIFT结合PSO算法优化区域互信息, SIFT结合QPSO算法优化区域互信息和SIFT结合CQPSO算法优化区域互信息(SRC)等四种算法进行了不同分辨率遥感图像配准实验比较和不同时相遥感图像配准实验比较, 实验结果验证了所提出的CQPSO算法的优越性和SRC配准方法的有效性.     

A framework for voxel-based morphometric analysis of the optic radiation using diffusion tensor imaging in glaucoma

Glaucoma is an optic neuropathy affecting the entire visual system. The understanding of the glaucoma mechanism and causes remains unresolved. Diffusion tensor imaging (DTI) has been used to analyze the optic nerve and optic radiation showing global fiber abnormalities associated with glaucoma. Nevertheless, the complex structure of the optic radiation and the limitations of DTI make the localization of the glaucoma effect a difficult task. The aim of this work is to establish a framework for the determination of the local changes of the optic radiation due to glaucoma using DTI. The proposed system utilizes a semiautomated algorithm to produce an efficient identification of the optic radiation. Segmented optic radiations are transformed to a unified space using shape-based nonrigid registration. Using the deformation fields that resulted from the registration, the maps of the diffusion tensor-derived parameters are transformed to the unified space. This allows for statistical voxel-wise analysis to produce significant abnormality maps. The proposed system is applied to a group of 13 glaucoma patients and a normal control group of 10 subjects. The groups are age matched to eliminate the age effect on the analysis. Diffusion-related parameters (axial, radial and mean diffusivities) and an anisotropy index (fractional anisotropy) are studied. The anisotropy analysis indicates that the majority of the significant voxels show decreased fractional anisotropy in the glaucoma patients compared with the control group. In addition, the significant regions are mainly distributed in the middle (in reference to anterior–posterior orientation) of the optic radiation. Glaucoma subjects have increased radial diffusivity and mean diffusivity significant voxels with a main concentration in the proximal part of the right optic radiation. The proposed analysis provides a framework to capture the significant local changes of the optic radiation due to glaucoma. The preliminary analysis suggests that the glaucomatous optic radiation may suffer from localized white matter degeneration. The framework facilitates further studies and understanding of the pathophysiology of glaucoma.     

MR image-based measurement of rates of change in volumes of brain structures. Part I: method and validation

A detailed analysis procedure is described for evaluating rates of volumetric change in brain structures based on structural magnetic resonance (MR) images. In this procedure, a series of image processing tools have been employed to address the problems encountered in measuring rates of change based on structural MR images. These tools include an algorithm for intensity non-uniformity correction, a robust algorithm for three-dimensional image registration with sub-voxel precision and an algorithm for brain tissue segmentation. However, a unique feature in the procedure is the use of a fractional volume model that has been developed to provide a quantitative measure for the partial volume effect. With this model, the fractional constituent tissue volumes are evaluated for voxels at the tissue boundary that manifest partial volume effect, thus allowing tissue boundaries be defined at a sub-voxel level and in an automated fashion. Validation studies are presented on key algorithms including segmentation and registration. An overall assessment of the method is provided through the evaluation of the rates of brain atrophy in a group of normal elderly subjects for which the rate of brain atrophy due to normal aging is predictably small. An application of the method is given in Part II where the rates of brain atrophy in various brain regions are studied in relation to normal aging and Alzheimer's disease.     

Balanced multi-image demons for non-rigid registration of magnetic resonance images

A new approach is introduced for non-rigid registration of a pair of magnetic resonance images (MRI). It is a generalization of the demons algorithm with low computational cost, based on local information augmentation (by integrating multiple images) and balanced implementation. Specifically, a single deformation that best registers more pairs of images is estimated. All these images are extracted by applying different operators to the two original ones, processing local neighbors of each pixel. The following five images were found to be appropriate for MRI registration: the raw image and those obtained by contrast-limited adaptive histogram equalization, local median, local entropy and phase symmetry. Thus, each local point in the images is supplemented by augmented information coming by processing its neighbor. Moreover, image pairs are processed in alternation for each iteration of the algorithm (in a balanced way), computing both a forward and a backward registration.The new method (called balanced multi-image demons) is tested on sagittal MRIs from 10 patients, both in simulated and experimental conditions, improving the performances over the classical demons approach with minimal increase of the computational cost (processing time around twice that of standard demons). Specifically, a simulated deformation was applied to the MRIs (either original or corrupted by additive Gaussian or speckle noises). In all tested cases, the new algorithm improved the estimation of the simulated deformation (squared estimation error decreased by about 65% in the average). Moreover, statistically significant improvements were obtained in experimental tests, in which different brain regions (i.e., brain, posterior fossa and cerebellum) were identified by the atlas approach and compared to those manually delineated (in the average, Dice coefficient increased of about 6%).The conclusion is that a balanced method applied to multiple information extracted from neighboring pixels is a low cost approach to improve registration of MRIs.     

A non-rigid cardiac image registration method based on an optical flow model

According to non-rigid medical image registration, new method of classification registration is proposed. First, Feature points are extracted based on SIFT (Scale Invariant Feature Transform) from reference images and floating images to match feature points. And the coarse registration is performed using the least square method. Then the precise registration is achieved using the optical flow model algorithm. SIFT algorithm is based on local image features that are with good scale, rotation and illumination invariance. Optical flow algorithm does not extract features and use the image gray information directly, and its registration speed is faster. The both algorithms are complementary. SIFT algorithm is used for improving the convergence speed of optical flow algorithm, and optical flow algorithm makes the registration result more accurate. The experimental results prove that the algorithm can improve the accuracy of the non-rigid medical image registration and enhance the convergence speed. Therefore, the algorithm has some advantages in the image registration.     

非刚体配准在肝癌手术中的应用

提出了一种在由MR图像引导的肝癌手术中对癌症肿块定位的方法。该方法采用非刚体配准技术,将手术前获得的含有清晰肝癌肿块的CT图像与手术中实时获得的MR图像配准,从而确定MR图像中的癌症肿块的位置。该方法分为三个步骤:将CT和MR图像中的肝脏部位分割出来;对分割后的图像采用仿射变换进行粗配准;采用自由形变模型对图像进行精确配准。配准后肝脏表面的距离误差在1.5mm之内;通过视觉检查,其结果令人十分满意。     

Affine and polynomial mutual information coregistration for artifact elimination in diffusion tensor imaging of newborns

We have investigated the use of two different image coregistration algorithms for identifying local regions of erroneously high fractional anisotropy (FA) as derived from diffusion tensor imaging (DTI) data sets in newborns. The first algorithm uses conventional affine registration of each of the diffusion-weighted images to the unweighted (b = 0) image for each slice, while the second algorithm uses second-order polynomial warping. Similarity between images was determined using the mutual information (MI) criterion, which is the preferred 'cost' criterion for coregistration of images with significantly different image intensity distributions. We have found that subtle differences exist in the FA values resulting from affine and second-order polynomial coregistration and demonstrate that nonlinear distortions introduce artifacts of spatial extent similar to real white matter structures in the newborn subcortex. We show that polynomial coregistration systematically reduces the presence of erroneous regions of high FA and that such artifacts can be identified by visual inspection of FA maps resulting from affine and polynomial coregistrations. Furthermore, we show that nonlinear distortions may be particularly pronounced when acquiring image slices of axial orientation at the height of the nasal cavity. Finally, we show that third-order polynomial MI coregistration (using the images resulting from second-order coregistration as input) has no observable effect on the resulting FA maps.     

Combining Sparse and Dense Features to Improve Multi-Modal Registration for Brain DTI Images

A new solution to overcome the constraints of multimodality medical intra-subject image registration is proposed, using the mutual information (MI) of image histogram-oriented gradients as a new matching criterion. We present a rigid, multi-modal image registration algorithm based on linear transformation and oriented gradients for the alignment of T2-weighted (T2w) images (as a fixed reference) and diffusion tensor imaging (DTI) (b-values of 500 and 1250 s/mm²) as floating images of three patients to compensate for the motion during the acquisition process. Diffusion MRI is very sensitive to motion, especially when the intensity and duration of the gradient pulses (characterized by the b-value) increases. The proposed method relies on the whole brain surface and addresses the variability of anatomical features into an image stack. The sparse features refer to corners detected using the Harris corner detector operator, while dense features use all image pixels through the image histogram of oriented gradients (HOG) as a measure of the degree of statistical dependence between a pair of registered images. HOG as a dense feature is focused on the structure and extracts the oriented gradient image in the x and y directions. MI is used as an objective function for the optimization process. The entropy functions and joint entropy function are determined using the HOGs data. To determine the best image transformation, the fiducial registration error (FRE) measure is used. We compare the results against the MI-based intensities results computed using a statistical intensity relationship between corresponding pixels in source and target images. Our approach, which is devoted to the whole brain, shows improved registration accuracy, robustness, and computational cost compared with the registration algorithms, which use anatomical features or regions of interest areas with specific neuroanatomy. Despite the supplementary HOG computation task, the computation time is comparable for MI-based intensities and MI-based HOG methods.     

How does distortion correction correlate with anisotropic indices? A diffusion tensor imaging study

PURPOSE: The purpose of this study was to determine a suitable registration algorithm for diffusion tensor imaging (DTI) using conventional preprocessing tools [statistical parametric mapping (SPM) and automated image registration (AIR)] and to investigate how anisotropic indices for clinical assessments are affected by these distortion corrections. MATERIALS AND METHODS: Brain DTI data from 15 normal healthy volunteers were used to evaluate four spatial registration schemes within subjects to correct image distortions: noncorrection, SPM-based affine registration, AIR-based affine registration and AIR-based nonlinear polynomial warping. The performance of each distortion correction was assessed using: (a) quantitative parameters: tensor-fitting error (Ef), mean dispersion index (MDI), mean fractional anisotropy (MFA) and mean variance (MV) within 11 regions of interest (ROI) defined from homogeneous fiber bundles; and (b) fiber tractography through the uncinate fasciculus and the corpus callosum. Fractional anisotropy (FA) and mean diffusivity (MD) were calculated to demonstrate the effects of distortion correction. Repeated-measures analysis of variance was used to investigate differences among the four registration paradigms. RESULTS: AIR-based nonlinear registration showed the best performance for reducing image distortions with respect to smaller Ef (P<.02), MDI (P<.01) and MV (P<.01) with larger MFA (P<.01). FA was decreased to correct distortions (P<.0001) whether the applied registration was linear or nonlinear and was lowest after nonlinear correction (P<.001). No significant differences were found in MD. CONCLUSION: In conventional DTI processing, anisotropic indices of FA can be misestimated by noncorrection or inappropriate distortion correction, which leads to an erroneous increase in FA. AIR-based nonlinear distortion correction would be required for a more accurate measurement of this diffusion parameter.     

Motion detection in moving background using a novel algorithm based on image features guiding self-adaptive Sequential Similarity Detection Algorithm

A novel efficient algorithm for motion detection in dynamic background was proposed. In image registration step, a feature-based and self-adaptive Sequential Similarity Detection Algorithm (SSDA) algorithm was proposed, which searches for matching position under constraints induced by image features with variational threshold. Then perform change detection by calculating and classifying the Mean Absolute Difference (MAD) around detected features in the middle frames of three consecutive images. Moving objects position was determined according to the rule that the feature from moving regions shows a lager MAD. Experiments on data sets of four typical scenes show that the improved registration algorithm is accurate and costs less than 0.4 s in computation, much faster compared with other four methods, and the proposed Dual Maximum Mean Absolute Difference Algorithm (DMMADA) can obtain a robust set of moving object features. Our algorithm can be used for fast detection of moving targets in dynamic background as well as change detection.     

Nonrigid image registration using similarity measure based on spatially weighted global probability distribution function

In nonrigid image registration, similarity measures including spatial information have been shown to perform better than those measures without spatial information. In this work, we provide new insight to the relationships among regional mutual information, regional probability distribution functions (PDFs) and global PDFs, and propose a novel nonrigid registration scheme with spatially weighted global probability distribution function (SWGPDF). Similarity measures based on SWGPDF (SWGPDFSM) are constructed. Three different spatial sub-region division methods are compared: the equally spaced sub-region (ESSR), the local binary pattern sub-region (LBPSR) and the gradient sub-region (GSR). The registration scheme applies B-spline based free form deformations (FFDs) as the transformation model. A Parzen window and linear interpolation are used to construct histograms. The SWGPDFSM registration scheme with ESSR space division is compared with the traditional global mutual information (gMI), the traditional global normalized mutual information (gNMI), regional mutual information and the SWGPDFSM with LBPSR or GSR space division. The test results show that SWGPDFSM scheme with ESSR space division outperforms the other schemes for elastically aligning images in the presence of big geometrical transformations, bias fields and illumination changes.     

Atlas-based automatic mouse brain image segmentation revisited: model complexity vs. image registration

Although many atlas-based segmentation methods have been developed and validated for the human brain, limited work has been done for the mouse brain. This paper investigated roles of image registration and segmentation model complexity in the mouse brain segmentation. We employed four segmentation models [single atlas, multiatlas, simultaneous truth and performance level estimation (STAPLE) and Markov random field (MRF) via four different image registration algorithms (affine, B-spline free-form deformation (FFD), Demons and large deformation diffeomorphic metric mapping (LDDMM)] for delineating 19 structures from in vivo magnetic resonance microscopy images. We validated their accuracies against manual segmentation. Our results revealed that LDDMM outperformed Demons, FFD and affine in any of the segmentation models. Under the same registration, increasing segmentation model complexity from single atlas to multiatlas, STAPLE or MRF significantly improved the segmentation accuracy. Interestingly, the multiatlas-based segmentation using nonlinear registrations (FFD, Demons and LDDMM) had similar performance to their STAPLE counterparts, while they both outperformed their MRF counterparts. Furthermore, when the single-atlas affine segmentation was used as reference, the improvement due to nonlinear registrations (FFD, Demons and LDDMM) in the single-atlas segmentation model was greater than that due to increasing model complexity (multiatlas, STAPLE and MRF affine segmentation). Hence, we concluded that image registration plays a more crucial role in the atlas-based automatic mouse brain segmentation as compared to model complexity. Multiple atlases with LDDMM can best improve the segmentation accuracy in the mouse brain among all segmentation models tested in this study.     

基于小波变换的脑部医学Demons图像配准

非刚性配准是医学图像处理的一个重要研究方向。针对Demons衍生出的一系列经典的配准算法在医学图像应用上计算复杂、方向信息不足问题进行了研究。基于光流场模型的Demons算法依赖图像灰度梯度是图像发生变形,当缺乏梯度信息时,力不能确定,因而容易造成误差,并且该算法仅适合于单模态图像配准。为此本文提出了一种基于小波变换理论的频域Demons配准处理方法(B-Demons)。该方法利用小波变换能够对各个尺度、方向和位置实现较好定位的优势,通过高频、低频的图像变换反映出图像的特征信息。实验结果证明了算法的有效性和鲁棒性。     

Evaluation of atlas-based segmentation of hippocampi in healthy humans

Introduction and aim

Region of interest (ROI)-based functional magnetic resonance imaging (fMRI) data analysis relies on extracting signals from a specific area which is presumed to be involved in the brain activity being studied. The hippocampus is of interest in many functional connectivity studies for example in epilepsy as it plays an important role in epileptogenesis. In this context, ROI may be defined using different techniques. Our study aims at evaluating the spatial correspondence of hippocampal ROIs obtained using three brain atlases with hippocampal ROI obtained using an automatic segmentation algorithm dedicated to the hippocampus.

Material and methods

High-resolution volumetric T1-weighted MR images of 18 healthy volunteers (five females) were acquired on a 3T scanner. Individual ROIs for both hippocampi of each subject were segmented from the MR images using an automatic hippocampus and amygdala segmentation software called SACHA providing the gold standard ROI for comparison with the atlas-derived results. For each subject, hippocampal ROIs were also obtained using three brain atlases: PickAtlas available as a commonly used software toolbox; automated anatomical labeling (AAL) atlas included as a subset of ROI into PickAtlas toolbox and a frequency-based brain atlas by Hammers et al. The levels of agreement between the SACHA results and those obtained using the atlases were assessed based on quantitative indices measuring volume differences and spatial overlap. The comparison was performed in standard Montreal Neurological Institute space, the registration being obtained with SPM5 (http://www.fil.ion.ucl.ac.uk/spm/).

Results

The mean volumetric error across all subjects was 73% for hippocampal ROIs derived from AAL atlas; 20% in case of ROIs derived from the Hammers atlas and 107% for ROIs derived from PickAtlas. The mean false-positive and false-negative classification rates were 60% and 10% respectively for the AAL atlas; 16% and 32% for the Hammers atlas and 6% and 72% for the PickAtlas.

Conclusion

Though atlas-based ROI definition may be convenient, the resulting ROIs may be poor representations of the hippocampus in some studies critical to under- or oversampling. Performance of the AAL atlas was inferior to that of the Hammers atlas. Hippocampal ROIs derived from PickAtlas are highly significantly smaller, and this results in the worst performance out of three atlases. It is advisable that the defined ROIs should be verified with knowledge of neuroanatomy before using it for further data analysis.     

基于图像集拓扑中心的群体配准方法

传统的图像配准通常指定一幅参考图像在配准过程中保持不变,将另一幅图像变换到参考图像空间,使得两幅图像在空间上互相匹配,从而可以精确比较两者之间的差异.针对多幅个体差异较大的图像配准问题,如果指定一幅作为参考,将其他图像配准到参考图像空间,则会引入该幅参考图像的个体形状偏差,从而影响最终的对比结果.为此,本文首先介绍了目前针对该问题的主要解决方法,然后提出了基于图像集拓扑中心的群体配准方法——TopologyCenter.为验证所提出的群体配准方法的性能,通过使用国外公开的数据集,详细比较了本文提出的方法与当前两种主要方法的群体配准结果的差异.实验结果表明,本文提出的方法具有更小的群体配准偏差,群体配准结果更好;同时,在对实验结果的评价中,本文还提出了一种简捷的群体偏差度量指标.     

An image encryption scheme based on three-dimensional Brownian motion and chaotic system

At present, many chaos-based image encryption algorithms have proved to be unsafe, few encryption schemes permute the plain images as three-dimensional(3D) bit matrices, and thus bits cannot move to any position, the movement range of bits are limited, and based on them, in this paper we present a novel image encryption algorithm based on 3D Brownian motion and chaotic systems. The architecture of confusion and diffusion is adopted. Firstly, the plain image is converted into a 3D bit matrix and split into sub blocks. Secondly, block confusion based on 3D Brownian motion(BCB3DBM)is proposed to permute the position of the bits within the sub blocks, and the direction of particle movement is generated by logistic-tent system(LTS). Furthermore, block confusion based on position sequence group(BCBPSG) is introduced, a four-order memristive chaotic system is utilized to give random chaotic sequences, and the chaotic sequences are sorted and a position sequence group is chosen based on the plain image, then the sub blocks are confused. The proposed confusion strategy can change the positions of the bits and modify their weights, and effectively improve the statistical performance of the algorithm. Finally, a pixel level confusion is employed to enhance the encryption effect. The initial values and parameters of chaotic systems are produced by the SHA 256 hash function of the plain image. Simulation results and security analyses illustrate that our algorithm has excellent encryption performance in terms of security and speed.     

Iterative algorithm for spatial and intensity normalization of MEMRI images. Application to tract-tracing of rat olfactory pathways

Manganese (Mn)-enhanced magnetic resonance imaging (MEMRI) is an emerging technique for visualizing neuronal pathways and mapping brain activity modulation in animal models. Spatial and intensity normalizations of MEMRI images acquired from different subjects are crucial steps as they can influence the results of groupwise analysis. However, no commonly accepted procedure has yet emerged. Here, a normalization method is proposed that performs both spatial and intensity normalizations in a single iterative process without the arbitrary choice of a reference image. Spatial and intensity normalizations benefit from this iterative process. On one hand, spatial normalization increases the accuracy of region of interest (ROI) positioning for intensity normalization. On the other hand, improving the intensity normalization of the different MEMRI images leads to a better-averaged target on which the images are spatially registered. After automatic fast brain segmentation and optimization of the normalization process, this algorithm revealed the presence of Mn up to the posterior entorhinal cortex in a tract-tracing experiment on rat olfactory pathways. Quantitative comparison of registration algorithms showed that a rigid model with anisotropic scaling is the best deformation model for intersubject registration of three-dimensional MEMRI images. Furthermore, intensity normalization errors may occur if the ROI chosen for intensity normalization intersects regions where Mn concentration differs between experimental groups. Our study suggests that cross-comparing Mn-injected animals against a Mn-free group may provide a control to avoid bias introduced by intensity normalization quality. It is essential to optimize spatial and intensity normalization as the detectability of local between-group variations in Mn concentration is directly tied to normalization quality.     

基于分布式信源编码的干涉多光谱图像压缩

根据干涉多光谱图像的特点.提出一种基于分布式信源编码的干涉多光谱图像压缩箅法.干涉多光谱图像序列的相邻图像之间具有明显的平移特性,编码端通过块匹配算法检测出相邻帧间的相对位移量,联合块匹配算法估计的边信息帧进行比特平面码率估计,采用基于率失真提升的感兴趣区域编码,调整图像不同区域的率失真斜率来进行更合理的码率分配.实验结果表明.该算法比传统算法更好地保护了多光谱图像的光谱信息,在不同压缩比的情况下.满足卫星干涉多光谱图像压缩系统要求.易于硬件实现,更适于星上环境的应用.