一种目标提取新方法-光谱排序编码法

为了进一步提高光学遥感目标提取精度,拓展目标提取方法的适用范围,推进遥感智能化信息提取方法的发展,本文从谱带强度与波形特征有机结合的角度出发提出了光谱排序编码法.首先介绍了该方法的基本原理:对端元光谱与图像光谱按谱带强度大小各自进行排序的基础上,通过比较同一顺序上的波段位置的异同来计算两条光谱曲线的相似度;然后开展了与约束能量最小法(CEM)、光谱二阶导数法(SSD)的目标提取精度对比实验,结果表明该方法的目标提取精度为95%,比CEM提高了41.9%,比SSD提高了46.9%;最后利用SPOT多光谱和AVIRIS高光谱数据检验了该方法在目标提取适用范围上的能力,结果表明该方法既适用于多光谱遥感,又适用于高光谱遥感.总之,算法具有速度快、精度高、适用范围广的特点.     

Lossless color medical image compression using adaptive block‐based encoding for human computed tomographic images

The advancement in medical imaging systems such as computed tomography (CT), magnetic resonance imaging (MRI), positron emitted tomography (PET), and computed radiography (CR) produces huge amount of volumetric images about various anatomical structure of human body. There exists a need for lossless compression of these images for storage and communication purposes. The major issue in medical image is the sequence of operations to be performed for compression and decompression should not degrade the original quality of the image, it should be compressed loss lessly. In this article, we proposed a lossless method of volumetric medical image compression and decompression using adaptive block‐based encoding technique. The algorithm is tested for different sets of CT color images using Matlab. The Digital Imaging and Communications in Medicine (DICOM) images are compressed using the proposed algorithm and stored as DICOM formatted images. The inverse process of adaptive block‐based algorithm is used to reconstruct the original image information loss lessly from the compressed DICOM files. We present the simulation results for large set of human color CT images to produce a comparative analysis of the proposed methodology with block‐based compression, and JPEG2000 lossless image compression technique. This article finally proves the proposed methodology gives better compression ratio than block‐based coding and computationally better than JPEG 2000 coding. © 2013 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 23, 227–234, 2013     

3D multiwavelet based block coding algorithm for compression of volumetric medical images

Three dimensional (3D) medical images possess some specific characteristics that should be utilized by an efficient compression scheme. In this article, one such compression scheme for volumetric 3D medical image data is presented. Two processes involved in this scheme are decorrelation and encoding. Decorrelation of the 3D data is realized through 3D multiwavelet transform with apt prefiltering so as to give good representation of the image which could be exploited by the encoder. Encoding is done through proposed Block Coding Algorithm, which is embedded, block based, and wavelet transform coding algorithm without maintaining any list structures. The idea behind this algorithm is to sort the 3D transform coefficients in to a 1D array with respect to declining thresholds and to use state table to keep track of the blocks and coefficients that has been coded. In the experiment conducted on various 3D magnetic resonance and computed tomography images of human brain with multiwavelets such as Geronimo–Hardin–Massopust, Chui‐Lian, and orthogonal symmetric/antisymmetric (SA4), efficiency of the proposed scheme was weighed against the state of art encoders such as 3D Set Partitioning in Hierarchical Trees, 2D Set Partitioned Embedded BloCK Coder, and No List SPIHT. Attributes used for performance measurements are peak signal to noise ratio, bit rate, and structural similarity index of reconstructed image with respect to original image. © 2014 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 24, 182–192, 2014     

Binary medical image compression using the volumetric run-length approach

Image compression has become an inevitable tool along with the advancing medical data acquisition and telemedicine systems. The run-length encoding (RLE), one of the most effective and practical lossless compression techniques, is widely used in two-dimensional space with common scanning forms such as zigzag and linear. In this study, an algorithm which takes advantage of the potential simplicity of the run-length algorithm is devised in a volumetric approach for three-dimensional (3D) binary medical data. The proposed algorithm, namely 3D-RLE, being different from the two-dimensional approach that utilizes only intra-slice correlations, is designed to compress binary volumetric data by employing also the inter-slice correlation between the voxels. Furthermore, it is extended to several scanning forms such as Hilbert and perimeter to determine an optimal scanning procedure coherent with the morphology of the segmented organ in data. The algorithm is employed on four datasets for a comprehensive assessment. Numerical simulation results demonstrated that the performance of the algorithm is 1:30 better than those of the state-of-the-art techniques, on average.     

Symmetric‐key block cipher for image and text cryptography

Public‐key cryptography has been widely accepted as the method in which data is encrypted, using algorithms such as the widely known and popularly used RSA algorithm. However, management of the public‐key and its storage is an on‐going issue. To avoid these problems the symmetric‐key approach can be taken, where there is only one key and it must be kept secret. Presented in this paper is a new cipher based on symmetric‐key cryptography, called the NASA/Kennedy Cipher (N/KC), and further designed as a block cipher using 128‐bit blocks. The minimum key size is set at 128 bits with a maximum allowable of 2048 bits, modulus 2. The main focus of this work is encryption of image data for the purpose of protecting intellectual properties. However, empirical results are presented on N/KC's ability of encrypting and decrypting text data in the form of vectors and documents as well. © 2005 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 15, 178–188, 2005     

An efficient and high quality medical CT image enhancement algorithm

Aiming at the process of medical diagnosis, many problems such as unclear images and low contrast are often caused by noise and interference in the process of medical image acquisition and transmission. This article proposes a new image enhancement method that combines the wavelet domain with the spatial domain. First, we input two identical images (Both of the identical images are original images.) in which the first image is enhanced by histogram equalization. Then, the two images are divided into four sub-images by a two-dimensional wavelet transform. The average of the low-frequency coefficients of the low-frequency sub-images of the two images is taken as the low-frequency coefficients of the final reconstruction. Second, aiming at the problem that the contrast may be too low, the fourth high-frequency sub-image is blurred (sharpened) twice. The fourth high-frequency sub-image after blurring is denoised by median filtering. Finally, the four sub-images are fused to obtain the enhanced image. The experimental results show that the peak signal-to-noise ratio, structural similarity, and processing time of the proposed algorithm are better than those of other contrast algorithms, especially the processing time. These objective indicators show that the proposed algorithm can not only effectively suppress noise but also significantly enhance the contrast. Subjectively, compared with other algorithms, the proposed algorithm achieves a better visual effect and greatly reduces the processing time.     

Cross-cumulative residual entropy-based medical image registration via hybrid differential search algorithm

Image registration is the process of overlaying images of the same scene taken at different times by different sensors from different viewpoints. The cross-cumulative residual entropy (CCRE)-based medical image registration could achieve a high precision and a strong robustness performance. However, the optimization problem formulated by CCRE consists of some local extrema, especially for noise images. In order to address these difficulties, this article proposes a new optimization algorithm named hybrid differential search algorithm (HDSA) to optimize CCRE. As HDSA consists of simple control parameters, it is independent of the initial searching point. In addition, HDSA ameliorated the search method and the iterative conditions. As a result, the optimization process is more stable and efficient. Image registration experiments of HDSA are performed and compared with the conventional differential search algorithm (DSA) and adaptive differential evolution with optional external archive (JADE). The results show that HDSA does not only overcome the difficulties of sticking in the local extrema but also enhances the precision of registration. It is effective, robust, and fast for both the single-mode rigid medical image registration and the multispectral-mode rigid medical image registration.     

基于字符串匹配技术的图像检索算法

为提高图像检索的效果,提出了一种基于字符串匹配技术的图像检索算法。该算法根据人眼的视觉特性及方块编码(BTC)的原理首先对图像进行分割,构造对表征图像内容有意义的图像特征。在此基础上,根据字符出现的概率对字符表征意义的重要性,把图像特征动态映射成字符串形式,然后采用字符串匹配技术进行图像检索。该算法不仅利用了图像中的边缘及纹理分布,而且将字符串匹配技术引入到图像检索中,在提高检索率的同时又加快了检索速度。实验结果表明,该算法具有较高的检索效率。     

REPro.JPEG: a new image compression approach based on reduction/expansion image and JPEG compression for dermatological medical images

Medical images are known for their huge volume which becomes a real problem for their archiving or transmission notably for telemedicine applications. In this context, we present a new method for medical image compression which combines image definition resizing and JPEG compression. We baptise this new protocol REPro.JPEG (reduction/expansion protocol combined with JPEG compression). At first, the image is reduced then compressed before its archiving or transmission. At last, the user or the receiver decompresses the image then enlarges it before its display. The obtain results prove that, at the same number of bits per pixel lower than 0.42, that REPRo.JPEG guarantees a better preservation of image quality compared to the JPEG compression for dermatological medical images. Besides, applying the REPRo.JPEG on these colour medical images is more efficient while using the HSV colour space compared to the use of RGB or YCbCr colour spaces.     

A new approach to medical image stitching using minimum average correlation energy filter and peak to side‐lobe ratio

Standard X‐ray images using conventional screen‐film technique have a limited field of view and failed to visualize the entire long bone on a single image. To produce images with whole body parts, digitized images from the films that contain portions of the body parts are assembled using image stitching. This article presents a new medical image stitching method that uses minimum average correlation energy filters to identify and merge pairs of X‐ray medical images. The effectiveness of the proposed method is demonstrated in the experiments involving two databases that contain a total of 40 pairs of overlapping and nonoverlapping images. Then the experimental results are compared to those of the normalized cross correlation (NCC) method. It is found that the proposed method outperforms the NCC method in identifying both the overlapping and nonoverlapping medical images. The efficacy of the proposed method is further vindicated by its average execution time which is about five times shorter than that of the NCC method. © 2012 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 22, 166–171, 2012     

IGM‐based perceptual multimodal medical image fusion using free energy motivated adaptive PCNN

Multimodal medical image fusion merges two medical images to produce a visual enhanced fused image, to provide more accurate comprehensive pathological information to doctors for better diagnosis and treatment. In this article, we present a perceptual multimodal medical image fusion method with free energy (FE) motivated adaptive pulse coupled neural network (PCNN) by employing Internal Generative Mechanism (IGM). First, source images are divided into predicted layers and detail layers with Bayesian prediction model. Then to retain human visual system inspired features, FE is used to motivate the PCNN for processing detail layers, and large firing times are selected as coefficients. The predicted layers are fused with the averaging strategy as activity level measurement. Finally, the fused image is reconstructed by merging coefficients in both fused layers. Experimental results visually and quantitatively show that the proposed fusion strategy is superior to the state‐of‐the‐art methods.     

Multimodal sensor medical image fusion based on mutual‐structure for joint filtering using sparse representation

Multimodal sensor medical image fusion has been widely reported in recent years, but the fused image by the existing methods introduces low contrast information and little detail information. To overcome this problem, the new image fusion method is proposed based on mutual‐structure for joint filtering and sparse representation in this article. First, the source image is decomposed into a series of detail images and coarse images by mutual‐structure for joint filtering. Second, sparse representation is adopted to fuse coarse images and then local contrast is applied for fusing detail images. Finally, the fused image is reconstructed by the addition of the fused coarse images and the fused detail images. By experimental results, the proposed method shows the best performance on preserving detail information and contrast information in the views of subjective and objective evaluations.     

Modified Global Flower Pollination Algorithm‐based image fusion for medical diagnosis using computed tomography and magnetic resonance imaging

Recently, the computed tomography (CT) and magnetic resonance imaging (MRI) medical image fusion have turned into a challenging issue in the medical field. The optimal fused image is a significant component to detect the disease easily. In this research, we propose an iterative optimization approach for CT and MRI image fusion. Initially, the CT and MRI image fusion is subjected to a multilabel optimization problem. The main aim is to minimize the data and smoothness cost during image fusion. To optimize the fusion parameters, the Modified Global Flower Pollination Algorithm is proposed. Here, six sets of fusion images with different experimental analysis are evaluated in terms of different evaluation metrics such as accuracy, specificity, sensitivity, SD, structural similarity index, feature similarity index, mutual information, fusion quality, and root mean square error (RMSE). While comparing to state‐of‐art methods, the proposed fusion model provides best RMSE with higher fusion performance. Experiments on a set of MRI and CT images of medical data set show that the proposed method outperforms a very competitive performance in terms of fusion quality.