High compressive ghost imaging method based on discrete cosine transform using weight coefficient matching

ABSTRACT

Ghost imaging can capture a scene without directly catching sight of the target, but in the case of high compression ratio, high-quality imaging is challenging at present. Here a ghost imaging method using weight coefficient matching based on discrete cosine transform (DCT) is proposed, in which the high-quality target images can be retrieved by obtaining the larger weight value in one-dimensional (1D) DCT spectrum. In the case of low sampling, the proposed method can not only acquire the spectral coefficients with large weight, but also put them in the correct position; eventually it can obtain the desired image by inverse discrete cosine transform of the spectrum. At the same sampling ratio, both simulation results and optical experiments show that the reconstructed image quality of the proposed method exhibits better performance. In addition, even the sampling ratio is as low as about 3%, the outline of the target image can still be roughly recognized.     

Lossless compression-based progressive image transmission scheme

Abstract

The lossless compression of images is widely used in medical imaging and remote sensing applications. Also, progressive transmission of images is often desirable because it can reduce the transmission bits of an image. Therefore, combining the features of lossless compression and progressive transmission of images has been intensely researched. The bitplane method (BPM) is the simplest way to implement a lossless progressive image transmission system. In the present paper, a new block-based scheme for lossless progressive image transmission is proposed. This scheme will reduce the transmission load and improve the image quality of BPM. This method first performs a quantization operation upon the blocks of an image. Next, these blocks are encoded with fewer bits, and the bits are then transmitted phase by phase. The experimental results show that the image quality of this method is better than those in the BPM and improved BPM in related traditional works under the same transmission load. Moreover, during the first phase, the difference in peak signal-to-noise ratio between the present method and BPM is exactly equal up to 8.85 dB. This method is therefore effective for lossless progressive image transmission.     

Volumetric medical image compression using inter-slice correlation switched prediction approach

With the advancement in medical data acquisition and telemedicine systems, image compression has become an important tool for image handling, as the tremendous amount of data generated in medical field needs to be stored and transmitted effectively. Volumetric MRI and CT images comprise a set of image slices that are correlated to each other. The prediction of the pixels in a slice depends not only upon the spatial information of the slice, but also the inter-slice information to achieve compression. This article proposes an inter-slice correlation switched predictor (ICSP) with block adaptive arithmetic encoding (BAAE) technique for 3D medical image data. The proposed ICSP exploits both inter-slice and intra-slice redundancies from the volumetric images efficiently. Novelty of the proposed technique is in selecting the correlation coefficient threshold (T_ϒ) for switching of ICSP. Resolution independent gradient edge detector (RIGED) at optimal prediction threshold value is proposed for intra-slice prediction. Use of RIGED, which is modality and resolution independent, brings the novelty and improved performance for 3D prediction of volumetric images. BAAE is employed for encoding of prediction error image to resulting in higher compression efficiency. The proposed technique is also extended for higher bit depth volumetric medical images (16-bit depth) presenting significant compression gain of 3D images. The performance of the proposed technique is compared with the state-of-the art techniques in terms of bits per pixel (BPP) for 8-bit depth and was found to be 31.21%, 27.55%, 21.89%, and 2.39% better than the JPEG-2000, CALIC, JPEG-LS, M-CALIC, and 3D-CALIC respectively. The proposed technique is 11.86%, 8.56%, 7.97%, 6.80%, and 4.86% better than the M-CALIC, 3D CALIC, JPEG-2000, JPEG-LS and CALIC respectively for 16-bit depth image datasets. The average value of compression ratio for 8-bit and 16-bit image dataset is obtained as 3.70 and 3.11 respectively by the proposed technique.     

Perceptual image hashing using local entropies and DWT

Abstract

Image hashing is an emerging technology in multimedia security. It uses a short string called image hash to represent an input image and finds applications in image authentication, tamper detection, digital watermark, image indexing, content-based image retrieval and image copy detection. This paper presents a hashing algorithm based on the observation that block entropies are approximately linearly changed after content-preserving manipulations. This is done by converting the input image to a fixed size, dividing the normalised image into non-overlapping blocks, extracting entropies of image blocks and applying a single-level 2D discrete wavelet transform to perform feature compression. Correlation coefficient is exploited to evaluate similarity between hashes. Experimental results show that the proposed algorithm is robust against content-preserving operations, such as JPEG compression, watermark embedding, Gamma correction, Gaussian low-pass filtering, adjustments of brightness and contrast, scaling and small angle rotation. Similarity values between hashes of different images are small, indicating good performances in discriminative capability.     

A robust variational approach to super-resolution with nonlocal TV regularisation term

Abstract

Multi frame super-resolution (SR) reconstruction algorithms make use of complimentary information among low-resolution (LR) images to yield a high-resolution (HR) image. Inspired by recent development on the video denoising problem, we propose a robust variational approach for SR-based on a constrained variational model that uses the nonlocal total variation (TV) as a regularisation term. In our method, a weighted fidelity term is proposed to take into account inaccurate estimates of the registration parameters and the point spread function. Moreover, we introduce the nonlocal TV as a regularisation term in order to take into account complex spatial interactions within images. In this way, important features and fine details are enhanced simultaneously with noise reduction. Furthermore, an alternative nonlocal TV regularisation is proposed based on a better weight function which integrates gradient similarity and radiometric similarity. Experiments show the effectiveness and practicability of the proposed method.     

A sub-pixel edge detection algorithm based on Zernike moments

Abstract

A novel hybrid technique of combining an improved morphological gradient operator and Zernike moments, named MGZ edge detection algorithm, is developed to meet the stringent requirements for measuring accuracies of charge coupled device metrology system. The mathematical morphological gradient and Zernike moment algorithm are discussed based on the pixels grey-scale and spatial structure information of the images. To improve the algorithm process, the image edge is oriented and extracted by using improved morphological gradient operator firstly; then, the calculation errors of the typical ideal step edge model are analysed and corrected by the proposed error compensation formula. The edge point is relocated with sub-pixel accuracy by means of Zernike moment operator based on the edge point vectors and the threshold value. Finally, the sub-pixel edge detecting of the image is attained. The extensive experimental results show that the measuring error of the edge point is compensated reliably and accurately, and the new algorithm has short operation time, more precise and stronger robustness to noise than the prior similar algorithms. Meanwhile, the proposed method can well meet the need of charge coupled device metrology system for sub-pixel edge detection.     

Colour image coding scheme using absolute moment block truncation coding and block prediction technique

Abstract

A predictive colour image compression scheme based on absolute moment block truncation coding is proposed. In this scheme, the high correlations among neighbouring image blocks are exploited by using the similar block prediction technique. In addition, the bit plane omission technique and the coding of quantisation levels are used to cut down the storage cost of smooth blocks and complex blocks respectively. According to the experimental results, the proposed scheme provides better performance than the comparative schemes based on block truncation coding. It provides better image qualities of compressed images at low bit rates. Meanwhile, it consumes very little computational cost. In other words, the proposed scheme is quite suitable for real time multimedia applications.     

Robust multi-planar region detection for image mosaic based on hierarchical clustering mechanism

Abstract

Planar structures exist widely in the images of various scenes, and the detection of planar regions is important in many applications related to computer vision, such as image mosaic and three-dimensional reconstruction. In this paper, a robust detection method for multi-planar regions is proposed. After the feature point pairs are extracted, their preference vectors are generated in similar conceptual space. By introducing the shared nearest neighbour in clustering procedure, the feature point pairs with smaller Jaccard distance and more shared nearest neighbours simultaneously are clustered into the same planar region. Because the relationship between the feature point pairs is considered, the accuracy of the inlier probability is high. Our method can detect multi-planar regions correctly without pre-determining the number of regions, and the corresponding clustered feature point pairs can be easily utilised for image mosaic. The experimental results show the effectiveness of the proposed method.     

Artifact reduction of compressed color images using modified mean‐removed classified vector quantization

Abstract

In this paper, a new artifact reduction algorithm for compressed color images using MMRCVQ is proposed. The algorithm extends and modifies vector quantization (VQ) for discovering the relationships between the uncompressed color images and their deblocked compressed versions by classifying the deblocked compressed blocks into several categories using information from their neighboring blocks. The discovered relationships are stored in two codebooks and are used to recover the missing information of compressed color images. To increase the availability of codewords and reduce the memory needed for storing codewords, mean‐removed vectors are used to generate codebooks. The experimental results show that the proposed approach can remove, effectively, the artifacts caused by high compression and improve perceptual quality significantly. Compared to existing methods, the proposed approach usually uses much less computing time to recover a compressed color image and has much better image quality.     

迹迹相关在声呐显示中的应用

通过迹迹相关(trace——to—trace correlation)的显示方式，可以在原有声呐信号处理的基础上，进一步提高声呐检测性能，而且方法简单易行。文章论述了一种新的基于迹迹相关的图像增强算法，对于检测微弱信号具有一定的应用价值，通过湖试数据验证了该算法的性能。     

A proposed circle/circular arc detection method using the modified randomized hough transform

Abstract

The randomized Hough transform (RHT) is a useful tool to locate patterns in an image. In this study, we propose a modified RHT to detect circles/circular arcs efficiently. First, we segment an image into sub‐images based on edge information, then we use the proposed circular arc analysis and density check rule to modify RHT for circle/circular arc detection. In the experiments, real images are used to show the capability of the proposed method.     

An Algorithm to Reduce Compression Ratio in Multimedia Applications

In recent years, it has been evident that internet is the most effective means of transmitting information in the form of documents, photographs, or videos around the world. The purpose of an image compression method is to encode a picture with fewer bits while retaining the decompressed image’s visual quality. During transmission, this massive data necessitates a lot of channel space. In order to overcome this problem, an effective visual compression approach is required to resize this large amount of data. This work is based on lossy image compression and is offered for static color images. The quantization procedure determines the compressed data quality characteristics. The images are converted from RGB to International Commission on Illumination CIE La^*b^*; and YCbCr color spaces before being used. In the transform domain, the color planes are encoded using the proposed quantization matrix. To improve the efficiency and quality of the compressed image, the standard quantization matrix is updated with the respective image block. We used seven discrete orthogonal transforms, including five variations of the Complex Hadamard Transform, Discrete Fourier Transform and Discrete Cosine Transform, as well as thresholding, quantization, de-quantization and inverse discrete orthogonal transforms with CIE La^*b^*; and YCbCr to RGB conversion. Peak to signal noise ratio, signal to noise ratio, picture similarity index and compression ratio are all used to assess the quality of compressed images. With the relevant transforms, the image size and bits per pixel are also explored. Using the (n, n) block of transform, adaptive scanning is used to acquire the best feasible compression ratio. Because of these characteristics, multimedia systems and services have a wide range of possible applications.     

Adaptive,scalable and robust watermarking for wavelet-based progressive image transmission

Abstract

Image watermarking refers to the process of embedding an authentication message, called watermark, into the host image to uniquely identify the ownership. In this paper, an adaptive, scalable, blind and robust wavelet-based watermarking approach is proposed. The proposed approach enables scalable watermark detection and provides robustness against progressive wavelet image compression. A multiresolution decomposition of the binary watermark is inserted into the selected coefficients of the wavelet-decomposed image that represent the high activity regions of the image. The watermark insertion is started from the lowest frequency sub-band of the decomposed image and each decomposed watermark sub-band is inserted into its counterpart sub-band of the decomposed image. In the lowest frequency sub-band, coefficients with maximum local variance and in the higher frequency sub-bands, coefficients with maximum magnitude are selected. The watermarked test images are transparent according to the human vision system characteristics and do not show any perceptual degradation. The experimental results very efficiently prove the robustness of the approach against progressive wavelet image coding even at very low bit rates. The watermark extraction process is completely blind and multiple spatial resolutions of the watermark are progressively detectable from the compressed watermarked image. This approach is a suitable candidate for providing efficient authentication for progressive image transmission applications especially over heterogeneous networks, such as the Internet.     

Two-dimensional weak-object transfer functions in the scanning harmonic microscope

Abstract

The two-dimensional imaging properties of scanning harmonic microscopes are considered. The two-dimensional weak-object transfer functions for non-confocal (point source and large-area incoherent detector) and confocal (point source and point detector) scanning harmonic microscopes are calculated. Results show that the harmonic microscopes are capable of super-resolution in that the spatial frequency cut-off is twice that for a microscope working at the fundamental wavelength. Confocal scanning harmonic microscopes exhibit better resolution than the conventional type.     

Significance of pre-processing and its impact on lossless hyperspectral image compression

The primitive aspect of hyperspectral imagery is its inherent spatial and spectral correlation. This correlation is exploited by subjecting the imaging cube to compression. A new approach to accomplish lossless hyperspectral image compression has been proposed. The imaging cube is subjected to pre-processing stage prior to entropy coding. Pre-processing stage comprises band normalization, ordering of bands followed by image scanning. A new sorting technique entitled Greedy Heap Sorting is suggested. The proposed strategy yields an average compression ratio (CR) of 4.93 and average bits per pixel (bpp) of 3.08. The proficiency of the system is on par with the existing contemporary algorithms for lossless hyperspectral image compression in terms of CR, bpp and reduced complexity.     

类圆柱标签等效阶梯柱面展开方法

目的针对半径不等的类圆柱标签的全表面展开问题,提出类圆柱标签等效阶梯柱面展开方法。方法提取4个视角下图像中的类圆柱标签最小外接矩形,根据提取结果建立位姿估计模型。基于微积分的化曲为直的思想,结合标签的位姿和各视角的轮廓,建立等效阶梯的类圆柱标签3D点云。利用双线性插值法对点云进行渲染,并通过NCC算法进行图像拼接,最终实现半径不等的类圆柱标签全表面展开。结果类圆柱棋盘格标签仿真模型与某品牌口香糖标签全表面展开实验表明,文中提出的算法较传统算法具有较高的精度,针对1号模型,在x轴、y轴方向上的方差分别为1.37像素和0.58像素。结论类圆柱标签等效阶梯柱面展开方法可以有效地实现类圆柱标签全表面展开,为后续的标签检测提供基础。     

Evaluation of the Usefulness of Cloud Point Elevation to Predict Transdermal Delivery Enhancers

Abstract

The use of cloud point temperature elevation to predict transdermal delivery enhancers was evaluated by conducting cloud point experiments on penetration enhancers of known ability. The ability of a compound to elevate the cloud point temperature could not be related to penetration enhancement neither in ranking nor magnitude. After comparison of the molecular interactions that cause cloud point elevation and transdermal delivery enhancement, no correlation between these two mechanisms could be established.     

Research on Multi-View Image Reconstruction Technology Based on Auto-Encoding Learning

Traditional three-dimensional (3D) image reconstruction method, which highly dependent on the environment and has poor reconstruction effect, is easy to lead to mismatch and poor real-time performance. The accuracy of feature extraction from multiple images affects the reliability and real-time performance of 3D reconstruction technology. To solve the problem, a multi-view image 3D reconstruction algorithm based on self-encoding convolutional neural network is proposed in this paper. The algorithm first extracts the feature information of multiple two-dimensional (2D) images based on scale and rotation invariance parameters of Scale-invariant feature transform (SIFT) operator. Secondly, self-encoding learning neural network is introduced into the feature refinement process to take full advantage of its feature extraction ability. Then, Fish-Net is used to replace the U-Net structure inside the self-encoding network to improve gradient propagation between U-Net structures, and Generative Adversarial Networks (GAN) loss function is used to replace mean square error (MSE) to better express image features, discarding useless features to obtain effective image features. Finally, an incremental structure from motion (SFM) algorithm is performed to calculate rotation matrix and translation vector of the camera, and the feature points are triangulated to obtain a sparse spatial point cloud, and meshlab software is used to display the results. Simulation experiments show that compared with the traditional method, the image feature extraction method proposed in this paper can significantly improve the rendering effect of 3D point cloud, with an accuracy rate of 92.5% and a reconstruction complete rate of 83.6%.     

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