Image enlargement with high-frequency component augmentation based on predefined codebook describing edge blurring properties

Image super-resolution as high-quality image enlargement is achieved by some type of restoration for high-frequency components that deteriorate through the image enlargement. The estimation methods using the given image itself are effective for the restoration, and we have proposed a method employing the codebook describing edge blurring properties that are derived from the given image. It is, however, unfavourable to apply those image-dependent methods to movies whose scene varies momentarily. In this paper, an image-independent codebook incorporating local edge patterns of images is proposed, and then the predefined codebook is applied. The effectiveness is shown through some experiments.     

Double image encryption using double pixel scrambling and random phase encoding

A novel double image encryption method is proposed by utilizing double pixel scrambling technique and random fractional Fourier domain encoding. One of the two original images is encoded into the phase of a complex signal after being scrambled by one matrix, and the other original image encoded into its amplitude after being scrambled by another matrix. The complex signal is then encrypted into stationary white noise by utilizing double random phase encoding in fractional Fourier domain. By applying the correct keys with fractional orders, the random phase masks and the pixel scrambling operation, the two original images can be retrieved without cross-talk. Numerical simulations have been done to prove the validity and the security of the proposed encryption method.     

基于半像素错位的多幅图像重建高分辨率图像技术研究

介绍了一种基于半像素错位的多幅图像重建高分辨率图像技术。分析了半像素错位的多幅图像与高分辨率图像各像素灰度值的对应关系 ,并从CCD数字化采样的角度进行了论证。同时 ,结合实际摄像机CCD结构 ,求出了高分辨率图像重建的计算公式 ,并通过实验进行了验证和完善。重建的本质是以原高分辨率图像的 4邻域平均图像为基础 ,增加一定比例的边缘细节信息 ,去接近原高分辨率图像。CCD的动态范围越大 ,图像的灰度级越多 ,那么计算误差就越小 ,图像的边缘细节信息就可以利用更多 ,重建的图像就越接近原高分辨率图像。通过实验和分析表明 ,利用半像素错位的多幅低分辨率图像重建高分辨率图像的原理是正确的 ,方案是可行的     

Fast local reconstruction by selective backprojection for low dose in dental computed tomography

The high radiation dose in computed tomography （CT） scans increases the lifetime risk of cancer, which becomes a major clinical concern. The backprojection-filtration （BPF） algorithm could reduce the radiation dose by reconstructing the images from truncated data in a short scan. In a dental CT, it could reduce the radiation dose for the teeth by using the projection acquired in a short scan, and could avoid irradiation to the other part by using truncated projection. However, the limit of integration for backprojection varies per PI-line, resulting in low calculation efficiency and poor parallel performance. Recently, a tent BPF has been proposed to improve the calculation efficiency by rearranging the projection. However, the memory-consuming data rebinning process is included. Accordingly, the selective BPF （S-BPF） algorithm is proposed in this paper. In this algorithm, the derivative of the projection is backprojected to the points whose x coordinate is less than that of the source focal spot to obtain the differentiated backprojection. The finite Hilbert inverse is then applied to each PI-line segment. S-BPF avoids the influence of the variable limit of integration by selective backprojection without additional time cost or memory cost. The simulation experiment and the real experiment demonstrated the higher reconstruction efficiency of S-BPF.     

Fast local reconstruction by selective backprojection for low dose in dental computed tomography

The high radiation dose in computed tomography (CT) scans increases the lifetime risk of cancer, which becomes a major clinical concern. The backprojection-filtration (BPF) algorithm could reduce the radiation dose by reconstructing the images from truncated data in a short scan. In a dental CT, it could reduce the radiation dose for the teeth by using the projection acquired in a short scan, and could avoid irradiation to the other part by using truncated projection. However, the limit of integration for backprojection varies per PI-line, resulting in low calculation efficiency and poor parallel performance. Recently, a tent BPF has been proposed to improve the calculation efficiency by rearranging the projection. However, the memory-consuming data rebinning process is included. Accordingly, the selective BPF (S-BPF) algorithm is proposed in this paper. In this algorithm, the derivative of the projection is backprojected to the points whose x coordinate is less than that of the source focal spot to obtain the differentiated backprojection. The finite Hilbert inverse is then applied to each PI-line segment. S-BPF avoids the influence of the variable limit of integration by selective backprojection without additional time cost or memory cost. The simulation experiment and the real experiment demonstrated the higher reconstruction efficiency of S-BPF.     

Multi chaotic systems based pixel shuffle for image encryption

This paper proposes a novel pixel shuffling method for image encryption. The output trajectory of chaotic system is very unpredictable. Therefore, based on the unpredictable character, we use the chaotic sequences generated by chaotic systems as encryption codes and then implement the digital-color image encryption with high confidential security. The proposed method combined with four differential chaotic systems and pixel shuffling can fully banish the outlines of the original image, disorders the distributive characteristics of RGB levels, and dramatically decreases the probability of exhaustive attacks. The statistic methods involving FIPS PUB 140-1 and the correlation coefficient r are adopted to test on the security analysis. Also NPCR (Number of Pixel Change Rate) and UACI (Unified Average Changing Intensity) are proceeded for the proof of the distinguished characteristic of pixels in the encrypted image. Eventually, empirical images are conducted as illustrations and show that the proposed method has the great encryption performance and achieves the high confidential security.     

Chromotomography for a rotating-prism instrument using backprojection, then filtering

A simple closed-form solution is derived for reconstructing a 3D spatial-chromatic image cube from a set of chromatically dispersed 2D image frames. The algorithm is tailored for a particular instrument in which the dispersion element is a matching set of mechanically rotated direct vision prisms positioned between a lens and a focal plane array. By using a linear operator formalism to derive the Tikhonov-regularized pseudoinverse operator, it is found that the unique minimum-norm solution is obtained by applying the adjoint operator, followed by 1D filtering with respect to the chromatic variable. Thus the filtering and backprojection (adjoint) steps are applied in reverse order relative to an existing method. Computational efficiency is provided by use of the fast Fourier transform in the filtering step.     

Fractional Fourier-domain random encoding and pixel scrambling technique for double image encryption

A double image encryption method is proposed using fractional Fourier-domain random encoding and pixel scrambling technique. One of the two original images is encoded into the phase function of a synthesized input signal after being scrambled, and the other original image encoded into its amplitude. The phase function serves as phase mask in the input domain, and the synthesized input signal is then encrypted into stationary white noise by utilizing random phase encoding in fractional Fourier domain. The two original images can be retrieved without cross-talk by using the correct keys with fractional orders, the random phase mask and the pixel scrambling operator. Numerical simulations and security analysis have been done to prove the validity and the security of the proposed encryption method.     

Range-restricted pixel difference global histogram equalization for infrared image contrast enhancement

Optical Review - Histogram equalization (HE)-based technology has been widely applied in infrared image contrast enhancement due to its effectiveness and simple implementation. However, HE and its...     

Fast image enhancement using multi-scale saliency extraction in infrared imagery

We propose a multi-scale saliency extraction based fast infrared image enhancement approach. A local frequency-tuned based saliency extraction technique is designed for highlighting the salient regions, firstly. Then, multi-scale saliency extraction is demonstrated, introducing multi-scale local windows with different sizes to extract regions of interest at different scales. Finally, the original image is enhanced with combining multi-scale salient image regions into one image. The experimental results prove the proposed approach is robust and efficient for infrared image enhancement.     

Image enhancement through contrast enlargement using the image regions extracted by multiscale top-hat by reconstruction

An image enhancement algorithm based on multiscale top-hat by reconstruction is proposed in this paper. Firstly, multiscale top-hat by reconstruction using multiscale structuring elements is discussed. Then, multiscale bright and black image regions are extracted. Thirdly, useful image regions for image enhancement are obtained from the extracted multiscale bright and black image regions. Finally, after a base image is calculated from the results of the opening and closing by reconstruction operations, the original image is enhanced through combing the useful image regions into the base image. Experimental results on different types of images show that the proposed algorithm is efficient.     

一种基因芯片光学扫描图像倾斜校正方法研究

针对在基因芯片光学扫描时产生的图像倾斜问题,提出了一种基于像素灰度的芯片图像倾斜校正方法。结合基因芯片图像的结构特点,基于行、列方向像素灰度定义芯片图像的校正指标。在角度检测范围内,利用折半搜索方法,基于校正指标来检测芯片图像的校正角度和芯片图像的校正位置。实验结果表明,该方法能有效地检测多类基因芯片图像的倾斜角度,具有较强的鲁棒性和实用性。     

Fast single image super-resolution using estimated low-frequency k-space data in MRI

PurposeSingle image super-resolution (SR) is highly desired in many fields but obtaining it is often technically limited in practice. The purpose of this study was to propose a simple, rapid and robust single image SR method in magnetic resonance (MR) imaging (MRI).MethodsThe idea is based on the mathematical formulation of the intrinsic link in k-space between a given (modulus) low-resolution (LR) image and the desired SR image. The method consists of two steps: 1) estimating the low-frequency k-space data of the desired SR image from a single LR image; 2) reconstructing the SR image using the estimated low-frequency and zero-filled high-frequency k-space data. The method was evaluated on digital phantom images, physical phantom MR images and real brain MR images, and compared with existing SR methods.ResultsThe proposed SR method exhibited a good robustness by reaching a clearly higher PSNR (25.77dB) and SSIM (0.991) averaged over different noise levels in comparison with existing edge-guided nonlinear interpolation (EGNI) (PSNR=23.78dB, SSIM=0.983), zero-filling (ZF) (PSNR=24.09dB, SSIM=0.985) and total variation (TV) (PSNR=24.54dB, SSIM=0.987) methods while presenting the same order of computation time as the ZF method but being much faster than the EGNI or TV method. The average PSNR or SSIM over different slice images of the proposed method (PSNR=26.33 dB or SSIM=0.955) was also higher than the EGNI (PSNR=25.07dB or SSIM=0.952), ZF (PSNR=24.97dB or SSIM=0.950) and TV (PSNR=25.70dB or SSIM=0.953) methods, demonstrating its good robustness to variation in anatomical structure of the images. Meanwhile, the proposed method always produced less ringing artifacts than the ZF method, gave a clearer image than the EGNI method, and did not exhibit any blocking effect presented in the TV method. In addition, the proposed method yielded the highest spatial consistency in the inter-slice dimension among the four methods.ConclusionsThis study proposed a fast, robust and efficient single image SR method with high spatial consistency in the inter-slice dimension for clinical MR images by estimating the low-frequency k-space data of the desired SR image from a single spatial modulus LR image.     

Robust image encryption by combined use of integral imaging and pixel scrambling techniques

A robust image encryption method by using the integral imaging and pixel scrambling (PS) techniques is proposed. In this method, pixels of the cover image are scrambled with the PS technique and elemental images for this scrambled image are picked up through a lenslet array. Subsequently, an encrypted image is obtained by scrambling these picked-up elemental images. Since this encrypted image has the hologram-like property of data redundancy resulted from the integral imaging scheme, while it can as well be decoded by multiple keys such as the orders of pixel scrambling and the pickup conditions of the elemental images, its security against the various attacks could be dramatically improved. Good experimental results also confirm that the proposed method could provide more enhanced robustness against data loss and Gaussian noises compared to the conventional methods.     

图像区域不变矩的快速计算方法

为了实时提取图像中任意尺寸窗口区域的不变矩,提出了一种快速计算方法。该算法通过构造一组积分图像,避免了在直接计算中出现的大量重复运算,使得图像中任一子窗口区域的不变矩都可以通过组合几个查找表运算得到。由于查找表运算的加法和乘法次数是恒定的,从而使得不同尺寸窗口区域的不变矩的计算均能在相同时间内完成。实验结果表明,该方法不会引起计算精度的损失,极大地降低了计算复杂度。对于从300×300pixels图像中提取的所有81×81pixels的窗口区域的不变矩这一任务而言,快速算法仅需31ms,比直接计算的速度提高了324倍。     

长脉冲激光对组成CCD图像传感器的MOS光敏单元的硬破坏机理研究

以帧转移型面阵CCD图像传感器为例,采用有限元法研究了波长1.06 μm,脉宽ms量级长脉冲Nd:YAG激光与组成CCD传感器的MOS光敏单元的作用过程及硬破坏机理.建立了长脉冲激光辐照MOS光敏单元的热力耦合模型,模拟了MOS光敏单元的温度分布和应力分布.研究结果表明:在长脉冲激光作用下,由于S层表面径向压应力超过其抗压强度引起MOS光敏单元出现了OS层间分裂,进而受径向、环向和轴向压应力的共同作用下,在光敏单元还未熔融时,层间分裂就扩大至光敏单元的整个OS层间.OS层间完全分裂会使光敏单元发生硬破坏,并造成CCD传感器中激光照射区的单个或一列光敏单元的功能完全失效.文章的研究结果可为CCD图像传感器的激光损伤及防护提供必要的理论依据. 关键词： 长脉冲激光 CCD图像传感器 硬破坏机理 层间分裂     

Optical image encryption based on binary Fourier transform computer-generated hologram and pixel scrambling technology

A new method of optical image encryption with binary Fourier transform computer-generated hologram (CGH) and pixel-scrambling technology is presented. In this method, the orders of the pixel scrambling, as well as the encrypted image, are used as the keys to decrypt the original image. Therefore, higher security is achieved. Furthermore, the encrypted image is binary, so it is easy to be fabricated and robust against noise and distortion. Computer simulation results are given to verify the feasibility of this method and its robustness against occlusion and additional noise.