Palatal Patterns Based RGB Technique for Personal Identification

Compressive sensing (CS) is a new technique that give an approach to reconstruct the signal with few numbers of observations or measurements. The CS is based on L1 -norm minimizations to find the sparse solutions and it is known as basis pursuit. In this investigation, CS scheme with different transforms is proposed. The three utilized transform techniques are: Discrete Fourier Transform(DFT), Discrete Cosine Transform(DCT) and Discrete Wavelet Transform(DWT) with daubechies1(DB1) and coiflets1(coif1) basis. The proposed system is tested by employing the following signals: Blocks, Heavy Sine, ‘Bumps’ and ‘Doppler’ which cover wide range of applications. The four testing signals are represented in sparse domain using different transforms. In order to threshold the coefficients of the signals in sparse domain, the universal threshold is utilized in the case of CS with FFT and DWT whereas, the universal threshold is modified to prune the DCT coefficients. The main aim of this study is to investigate the differences among CS with DFT, CS with DCT and CS with DWT, and consequently a suitable transform domain used with CS to be selected. The comparative study is established by assessing the performance of the proposed system using Root Mean Square Error (RMSE), output SNR, and the time required to reconstruct approximated signals. Simulation results have shown that the CS with DWT outperforms the CS with FFT and DCT. CS with DWT has achieved good RMSE values about (0.0014 to 3.359e-8) even when half of the signal elements are removed. CS with FFT and DCT enhanced the noisy Blocks and Bumps signals by 3dB and 1dB respectively, while it is failed to enhance noisy Heavy Sine and Doppler signals. CS with DWT of two basis and for single decomposition level have improved the noisy Blocks, Bumps, Heavy Sine and Doppler signals by 5dB, 4dB, 3dB, and 3dB respectively.

The recently proposed compressive sensing (CS) theory provides a new solution for multiple description coding (MDC) with fine granularity, by treating each random CS measurement as a description. The performance of CS-based MDC (CS-MDC) depends on the efficacy of the CS recovery algorithm. Existing CS recovery algorithms recover the signal in a fixed space (e.g., Wavelet, DCT, and gradient spaces) for the entire duration of the signal, even though a typical multimedia signal exhibits sparsity in time/space variant spaces. To rectify this problem and develop a better CS recovery algorithm for CSMDC, we propose a learning-based framework to conduct the CS recovery in locally adaptive spaces, and carry out a case study on image MDC. A set of prior image models are learned offline from a training set to facilitate the CS recovery in local adaptive bases. Experiments show that the learning-based CS recovery algorithm can significantly improve the performance of the previous CS-MDC technique in both PSNR and visual quality.

Transform coding has been the focus of the research for image compression. In previous research, the Amplitude and Group Partitioning (AGP) coding scheme is proved to be a low complexity algorithm with higher performance, clearly one of the state-of-art transform coding techniques. However, the previous AGP is used along with the Discrete Cosine Transform (DCT) and the discrete wavelet transform. In this paper, a different transform, the Lapped Orthogonal Transform (LOT), replaces the DCT in conjunction with the AGP. This is the first time LOT and AGP have been combined in a coding method. The definition and design of the LOT are discussed. An objective metric to measure the performance of transform, coding gain, is calculated for both the DCT and the LOT. The LOT has slightly higher coding gain than the DCT. The principles of the LOT based AGP image codec (LOT-AGP) are presented and a complete codec, encoder and decoder, is implemented in software. The performance of the LOT-AGP is compared with other block transform coding schemes: the baseline JPEG codec and the DCT based AGP image codec (DCT- AGP) by both objective evaluation and subjective evaluation. The Peak Signal to Noise Ratio (PSNR) is calculated for these three coding schemes. The two AGP codecs are much better than the JPEG codec on PSNR, from about 1.7 dB to 3 dB depending on bit rate. The two AGP schemes have PSNR differences only to a small degree. Visually, the LOT-AGP has the best-reconstructed images among these three at all bit rates. In addition, the coding results of two other state-of-art progressive image codecs are cited for further comparison. One is the Set Partitioning in Hierarchical Trees (SPIHT) algorithm with a dyadic wavelet transform, and the other is Tran and Nguyen's method with the generalized LOT transform. The AGP coding and the adaptive Huffman entropy coding of LOT-AGP are less complex and the memory usage is smaller than in these two progressive codecs. Comparing these three codecs, i.e. the LOT-AGP and the two progressive codecs in PSNR small only small differences in PSNR. SPIHT has about 1 dB higher PSNR than the LOT-AGP and Tran and Nguyen's method for the test image Lena. For the test image Barbara, the PSNR of the LOT- AGP is about 0.5 dB higher than that of the SPIHT and 0.5 dB lower than that of Tran and Nguyen's method. This low- complexity and high performance codec may provide a new direction for the implementation of image compression.

Multiphase flow measurements, based on tomographic imaging techniques, have made substantial progress in the past several years. In particular, ultrasonic tomographic reconstruction has shown its high potential in accurately measuring fluid fractions in a flow cross-section based on direct flow measurements. These types of measurements are very attractive as the system is nonradioactive, has direct contact to fluid, yet without flow obstruction. An ultrasonic tomographic multiphase flow meter (UTM) is being developed to capture the fluid flow rates and phase compositions in producing oil wells. The UTM aims to generate cross-sectional images of the flow inside the pipe. To recover these images, complex computations and high processing time are required, based on a limited amount of available data. For this purpose, compressive sensing (CS) reconstruction methods have shown great potential in overcoming the mentioned data quality and quantity issues. CS builds upon the fact that one can recover certain data of interest from potentially very few measurements. Many CS algorithms have been proposed in the literature. In this paper, we seek to find a suitable algorithm by comparing different CS algorithms in terms of the resulting recovered image quality. Specifically, we survey three algorithms in CS, namely basis pursuit, iterative soft thresholding (IST), and orthogonal matching pursuit (OMP). We also compare the results of the CS algorithms to that of a least-square based conventional algorithm. The numerical results show the superiority of CS recovery algorithms over the conventional approach, both qualitatively and quantitatively. The results also suggest that high image quality could potentially be achieved with less complex CS algorithms, i.e., the IST and OMP algorithms. As presented in the paper, our goal is to adapt CS reconstruction algorithms for images generated by the UTM, for the purpose of accurate quantification of oil, gas, and water phase fractions produced from different wells.

this study presents an eight array ultrasonic signal phased array sparse sampling experiment system based ultrasonic phased array technology and Compressed Sensing (CS). Proposed system considers recovery ultrasonic beam signal received eight phased array elements with sparse samples captured using sub-Nyquist model in CS recovery algorithm. We have the block defect detection test in the system. The test result approximated the actual block defect position. Based on block defect detection test, We compared sparse sampling value using spectrum estimation to Compressed Sensing recovery algorithm imaging, and no focus and focus detection effect, proved the phased array experiment system based on Compressed Sensing .it can greatly improve the detection signal to noise ratio (SNR) and sensitivity. So we verify the phased array focus can improve the detection ability.

Confocal laser scanning microscopy (CLSM) is a non-destructive optical measurement system of high precision, applicable to the construction of three-dimensional (3-D) topographies of biological cells and engineered materials at the micro- and sub-micro scales. Compressive sensing (CS) has recently been applied in microscope systems to reduce the amount of sampled data required for the reconstruction of images; however, the iterative nature of the CS recovery algorithm imposes high computational complexity. This article presents an end-to-end non-iterative deep residual convolutional neural network (CNN) applicable to CLSM systems for CS-based reconstruction. In experiments and numerical simulations, the proposed scheme outperformed the existing CS recovery algorithms in terms of reconstructed image quality and computation time. The proposed algorithm also enabled the reconstruction of images using samples obtained in different regions of an image at various sampling rates to overcome nonuniform information density. The reconstruction performance of the model in terms of robustness and efficiency was validated using real-world CLSM data obtained via random scanning patterns.

In this paper, channel overhead is reduced by exploiting channel sparsity for multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) system. Where, compressive sensing (CS) based dictionary design algorithms has been adopted as a channel estimation technique in high mobile systems with minimal number of pilots, such as high-speed train (HST) systems. A novel framework design of the dictionary-based CS was proposed considering both delay and Doppler effects in order to correctly recover the channel response. The channel under consideration is a 2 by 2 space-time block code (STBC) MIMO channel. Simulation tests according to the international telecommunication union (ITU) channel model demonstrated the suitability of the proposed dictionary for estimating the channel impulse response (CIR) of a liner time varying (LTV) channel with a mobility approaches 675 Km/h related to a Doppler frequency of 1500 Hz and 2.4 GHz carrier frequency. Two CS recovery algorithms were applied; orthogonal matching pursuit (OMP) and basis pursuit (BP), where by about 7 dB gain in signal to noise ratio (SNR) was achieved with mobility of 675 Km/h using OMP as compared to BP at a bit error rate (BER) of with 128 OFDM subcarriers.

WITHDRAWN: Contrasting the performance metrics of discrete transformations on digital image steganography using artificial intelligence

In the paper “An analog 2-D DCT processor,” authors have presented a row-column method for computing 2-D discrete cosine transform (DCT). They have reported minimum peak signal-to-noise ratios (PSNR) 40.6 dB and 31.4 dB for 4-point and 8-point DCT, respectively. The main objective of this comment letter is to point out that those PSNR values are not correctly calculated. The actual minimum PSNR values are shown to be 24.7 dB and 22.7 dB for 4-point and 8-point DCT, respectively. Similarly, maximum PSNR values are corrected in this letter.

Compressed sensing (CS) is a novel developed theoretical framework for information acquisition and processing. Taking advantages of the sparsity or compressibility inherent in real world signals, CS can collect compressed data at the sampling rate much lower than that needed in Shannon's theorem. When it has been used for medical imaging techniques, CS theory can fast the scanning speed of MRI, reduce the radiation doses and alleviate the patients' suffering. In order to obtain the effective sparse representation, the nonsubsampled contourlet transform in the frequency domain (NSCT-FD) is adopted, then an improved fast iterative soft thresholding algorithm (FISTA) is applied for CS-MRA reconstruction. This novel method not only inherits the simplicity and effectiveness of the original FISTA, and the sparse curvy representation ability of the contourlet transform, but also has the advantages of the shift-invariant property and much less computational burden. The performance is evaluated qualitatively and quantitatively both in noiseless and noisy situations, compared to the classic wavelet and the sharp frequency localization contourlet transform (SFLCT) method. Three quantitative indices are employed including the peak signal to noise ratio (PSNR), mutual information (MI) and relative l 2 norm error (RLNE) and qualitative performance evaluations use the profiles in horizontal direction and local region magnification comparison. Experimental results demonstrate the superiority of the NSCT-FD algorithm, displaying higher PSNR and MI, and lower RLNE indices in both noiseless and noisy MRA images, which have good reconstruction accuracy with reasonable real time computation speed. It is manifest that the NSCT-FD algorithm can be applied in fast medical imaging fields to achieve quality images in a relatively fast process, which will benefit cardiac and carotid MRI, dynamic MRI and MRA.

This paper presents hiding one to eight gray images or texts (secret information) inside color image (cover image) based on Least Significant Bits (LSB) algorithm. The main idea is to insert the secret message (one to eight texts or one to eight gray images) in the three LSB of the cover image (color image). The color cover image RGB model (R channel, G channel and B channel) is separated into three cover images (the red cover, green cover, and blue cover). Each one of these three cover images is used to hide secret messages (gray image (two secret images in R channel, three secret images in G channel and three secret images in B channel) or text). The experiments and comparative studies show that the algorithms are characterized by many features of the ability of hiding huge data, and then the ability of extracting secret message without errors. Beside the reconstructed image, has efficacies (to human acquaintance) according to peak signal to noise ratio (PSNR) and mean square error (MSE), also retain both the explicitness and the characteristics of the both secret message and cover image.

In the Compressed Sensing (CS) framework, the underdetermined system of linear equation (USLE) can have infinitely many possible solutions. However, we intend to find the sparsest possible solution, which is l0-norm minimization. However, finding an l0 norm solution out of infinitely many possible solutions is NP-hard problem that becomes non-convex optimization problem. It has been a practically proven fact that l0 norm penalty can be adequately estimated by l1 norm, which recasts a non-convex minimization problem to a convex problem. However, l1 norm non-differentiable and gradient-based minimization algorithms are not applicable, due to this very reason there is a need to approximate l1 norm by its smooth approximation. Iterative shrinkage algorithms provide an efficient method to numerically minimize l1-regularized least square optimization problem. These algorithms are required to induce sparsity in their solutions to meet the CS recovery requirement. In this research article, we have developed a novel recovery method that uses hyperbolic tangent function to recover undersampled signal/images in CS framework. In our work, l1 norm and soft thresholding are both approximated with the hyperbolic tangent functions. We have also proposed the criteria to tune optimization parameters to get optimal results. The error bounds for the proposed l1 norm approximation are evaluated. To evaluate performance of our proposed method, we have utilized a dataset comprised of 1-D sparse signal, compressively sampled MR image and cardiac cine MRI. The MRI is an important imaging modality for assessing cardiac vascular function. It provides the ejection fraction and cardiac output of the heart. However, this advantage comes at the cost of a slow acquisition process. Hence, it is essential to speed up the acquisition process to take the full benefits of cardiac cine MRI. Numerical results based on performance metrics, such as Structural Similarity (SSIM), Peak Signal to Noise Ratio (PSNR) and Root Mean Square Error (RMSE) show that the proposed tangent hyperbolic based CS recovery offers a much better performance as compared to the traditional Iterative Soft Thresholding (IST) recovery methods.

Image encryption based on compressive sensing and chaos systems

Antenna 3D pattern measurement can be a tedious and time consuming task even for antennas with manageable sizes inside anechoic chambers. Performing onsite measurements by scanning the whole 4π [sr] solid angle around the antenna under test (AUT) is more complicated. In this paper, with the aim of minimum duration of flight, a test scenario using unmanned aerial vehicles (UAV) is proposed. A practically optimal scanning strategy is presented. The suggested techniques are beneficial particularly for the case of large directive antennas. The UAV follows a predefined trajectory in the scanning windows around the AUT and reads the field strength. Then, using compressed sensing (CS) method, the antenna pattern is reconstructed. It is shown that applying Bayesian CS algorithm to the samples of field intensity gathered by UAV can efficiently reconstruct the pattern. Discrete cosine Transform (DCT) is utilized for sparsifying the antenna patterns. Performance is evaluated by obtaining the reconstructed patterns for different antenna types. The effects of the antenna type and area of scanning are analyzed. It is shown that satisfying performance can be achieved with measuring about 50 percent of the total pattern samples. The reconstruction error of different CS implementations is computed and superiority of Bayesian CS is illustrated.

Most recently, an emerging Compressed Sensing (CS) theory has brought a major breakthrough for data acquisition and recovery. It asserts that a signal, which is highly compressible in a known basis, can be reconstructed with high probability through sampling frequency which is well below Nyquist Sampling Frequency. When applying CS to Remote Sensing (RS) Video imaging, it can directly and efficiently acquire compressed image data by randomly projecting original data to obtain linear and non-adaptive measurements. In this paper, with the help of distributed video coding scheme which is a low-complexity technique for resource limited sensors, the frames of a RS video sequence are divided into Key frames (K frames) and Non-Key frames (CS frames). In other words, the input video sequence consists of many groups of pictures (GOPs) and each GOP consists of one K frame followed by several CS frames. Both of them are measured based on block, but at different sampling rates. In this way, the major encoding computation burden will be shifted to the decoder. At the decoder, the Side Information (SI) is generated for the CS frames using traditional Motion-Compensated Interpolation (MCI) technique according to the reconstructed key frames. The over-complete dictionary is trained by dictionary learning methods based on SI. These learning methods include ICA-like, PCA, K-SVD, MOD, etc. Using these dictionaries, the CS frames could be reconstructed according to sparse-land model. In the numerical experiments, the reconstruction performance of ICA algorithm, which is often evaluated by Peak Signal-to-Noise Ratio (PSNR), has been made compared with other online sparse representation algorithms. The simulation results show its advantages in reducing reconstruction time and robustness in reconstruction performance when applying ICA algorithm to remote sensing video reconstruction.