2‐D/3‐D displays based on switchable lenticulars

Abstract— An attractive concept for 3‐D displays is the one based on LCDs equipped with lenticular lenses. This enables autostereoscopic multiview 3‐D displays without a loss in brightness. A general issue in multiview 3‐D displays is their relatively low spatial resolution because the pixels are divided among the different views. To overcome this problem, we have developed switchable displays, using liquid‐crystal (LC) filled switchable lenticulars. In this way, it is possible to have a high‐brightness 3‐D display capable of fully exploiting the native 2‐D resolution of the underlying LCD. The feasibility of LC‐filled switchable lenticulars was shown in several applications. For applications in which it is advantageous to be able to display 3‐D and 2‐D content simultaneously, a 42‐in. locally switchable prototype having a matrix electrode structure was developed. These displays were realized using cylindrically shaped lenticular lenses in contact with LC. An alternative for these are lenticulars based on gradient‐index (GRIN) LC lenses. Preliminary results for such switchable GRIN lenses are presented as well.     

一种模板匹配与高适应性的裂缝骨架提取算法

在对裂缝图像骨架进行提取时,已有的算法通常存在细化后骨架主体信息缺失、毛刺去除效果随图像规模增大而快速下降等问题。针对上述问题,该算法提出一种模板匹配与高适应性的裂缝骨架提取算法。首先,结合模板匹配对Rosenfeld细化算法进行改进,以保留骨架主体结构;然后提出一种高适应性毛刺去除算法,以分支像素点数量与细化后骨架图像目标像素点数量之比作为判断标准,可以高效适应不同目标像素点密度和规模的裂缝图像。实验结果表明,该算法能够有效实现单一像素宽度骨架并尽可能去除骨架毛刺,有一定的可行性及优越性。     

一种基于形态学滤波的视频对象空间分割新策略

视频对象提取是现代信息科学领域的一个研究热点。为了改进常见的视频对象时空分割方法,提取具有理想边缘的视频对象,本文提出了一种新颖的结合交替顺序重建滤波和自适应阈值判别的空间分水岭分割策略。该策略中结构元素逐渐变大的形态学开闭重建迭代使得分水岭分割所获区域数大大减少,有效地避免了复杂的区域融合。同时,迭代过程使得对象边缘像素的梯度与前景、背景中平坦区域内部像素的梯度更易区分,从而能够应用自适应阈值算法进一步消除由局部梯度极值造成的分割小区域。应用基于该策略的时空分割方法对标准测试序列进行分割实验,实验结果表明,该策略能够带来令人满意的空间分割结果,有助于提高视频对象时空分割方法的主客观性能。此外,该策略能够自动确定交替顺序重建滤波器中结构元素的大小以及非线性判别的阈值,算法的通用性和易用性较好。     

基于自适应MSB与差值预测的大容量密文域可逆信息隐藏算法

为提高密文域可逆信息隐藏（reversible data hiding in encrypted images,RDH-EI）的嵌入容量,提出了一种基于自适应MSB（most significant bit）与差值预测的RDH-EI方案。首先将图像进行分块,然后进行块级加密和置乱以抵抗对于加密图像的分析。在嵌入数据阶段,对于自适应MSB预测的方法进行改进,将没有嵌入数据的块,利用部分块内像素之间差值很小的特点采用自适应差值预测的方法嵌入数据,以块中左上角像素为目标像素,用于预测其他像素从而腾出更多的嵌入空间。实验结果表明,所提方法具有可逆性和可分离性,并且在自适应MSB预测方法的基础上进一步提高了嵌入容量,对于512×512大小的灰度图像,平均嵌入容量提高了大约7 445 bit。     

像素差自适应隐写方案*

提出了一种新的基于相邻像素差的自适应隐写算法。该算法结合图像位平面性质以及人眼对像素值起伏剧烈的区域敏感性较差的视觉特性,根据相邻像素高五位比特值之差的不同选择不同的嵌入策略,通过改变每对像素的最低三位比特值实现信息嵌入。通过理论分析和实验证明,该算法具有较高的嵌入容量,具有良好的隐写安全性,同时算法复杂度低,实现简单。     

Adaptive hypergraph superpixels

Superpixel segmentation, which amounts to partitioning an image into a number of superpixels each of which is a set of pixels sharing common visual meanings, requires specific needs for different computer vision tasks. Graph based methods, as a kind of popular superpixel segmentation method, regard an image as a weighted graph whose nodes correspond to pixels of the image, and partition all pixels into superpixels according to the similarity between pixels over various feature spaces. Despite their improvement of the performance of segmentation, these methods ignore high-order relationship between them incurred from either locally neighboring pixels or structured layout of the image. Moreover, they measure the similarity of pairwise pixels using Gaussian kernel where a robust radius parameter is difficult to find for pixels which exhibit multiple features (e.g., texture, color, brightness). In this paper, we propose an adaptive hypergraph superpixel segmentation (AHS) of intensity images for solving both issues. AHS constructs a hypergraph by building the hyperedges with an adaptive neighborhood scheme, which explores an intrinsic relationship of pixels. Afterwards, AHS encodes the relationship between pairwise pixels using characteristics of current two pixels as well as their neighboring pixels defined by hyperedges. Essentially, AHS models the relationship of pairwise pixels in a high-order group fashion while graph based methods evaluate it in a one-vs-one fashion. Experiments on four datasets demonstrate that AHS achieves higher or comparable performance compared with state-of-the-art methods.     

Efficient manifold-preserving edit propagation using quad-tree data structures

In this paper, we propose an edit propagation algorithm using quad-tree data structures for image manipulation. First, we use a quad-tree to adaptively group all pixels into clusters. Then, we build a manifold-preserving propagation function based on clusters using locally linear embedding for improved distance. Moreover, we employ an adaptive weight function built on cell corners instead of individual pixels. Because the number of corners is smaller than the number of individual pixels, it results in runtime performance improvement. Finally, the edits of all pixels can be computed by interpolating the edits solved from the clusters. Compared with previous approaches, our method requires less time without sacrificing the visualization quality. Experimental results demonstrate two applications of our algorithm: grayscale image colorization and color image recoloring.     

基于局部空间像素特征的自适应加权滤波算法

提出了一种新的基于局部空间像素特征的椒盐噪声自适应加权滤波算法。该算法首先对含噪图像逐点进行噪声检测,把所有像素分为含噪像素点和信号像素点;然后采用自适应加权滤波方法,对检测到的噪声点进行滤波,滤波权重由确定的数学公式来确定,自适应于滤波窗内临近像素的局部特征。实验结果表明,该算法不仅可以有效地除去椒盐噪声,又可以较好地保持图像边缘细节,尤其在噪声密度较大时,效果明显优于传统的中值滤波算法。     

Microstrip triplexer and switchable triplexer using new impedance matching circuits

A triplexer with new impedance matching circuit (IMC) is presented in this article firstly, which exhibits compact size, low insertion loss, and wide passband. Then, the series‐parallel configuration p‐i‐n diode switches are introduced in the above IMC, and a new switchable impedance matching circuit is proposed to design a switchable triplexer. The designed switchable triplexer has eight available operation states, so that it realizes multiple functional blocks in a single module. The fabricated switchable triplexer also features compact size, wide passband, high isolation, and independently switchable operation states.     

基于模糊逻辑的脉冲噪声自适应滤除

为了去除具有多个随机值的普通脉冲噪声,提出一种基于模糊逻辑的自适应去噪方法。首先,利用像素邻域梯度并结合模糊逻辑相关理论进行噪声点初步检测;然后,通过噪声直方图统计对噪声点作二次检测,排除误判的噪声点;最后,保留非噪声点,对噪声点进行自适应加权均值滤波,滤除噪声。仿真结果表明,该算法可以取得优于传统方法的去噪效果,并且能很好地保护图像的边缘和纹理信息。     

Adaptive Data Hiding,Using Pixel-Value-Differencing and LSB Substitution

With the development of Internet communications, the security of message sending on the Internet has become very important. This article proposes a new adaptive data hiding method with a large data-embedding capacity for gray-scale images to raise the security of sending a message between sender and receiver in networks. At first, the image is divided into some blocks consisting of two consecutive pixels. If the values of both pixels are small, fewer secret bits will be embedded within the two pixels, otherwise, the difference value of two pixels is calculated, and according to the obtained difference value, the method will estimate the number of embedding bits into LSBs of two pixels. This number is adaptive and depends on the range to which the difference value belongs. A readjusting phase is presented to keep the difference of value pixels in the same range before and after embedding. Experimental results show that our method has increased the capacity of embedding bits in comparison with the several other methods.     

Pixel-selected ray tracing

An acceleration method based on an idea that T. Whitted (Commun. ACM, vol.23, no.6 pp.343-349, June 1980) presented on ray tracing is discussed. He proposed making antialiased images by hierarchical adaptive oversampling. The present authors use hierarchical adaptive undersampling to reduce the number of pixels whose intensity must be calculated by ray tracing. To implement pixel-selected ray tracing (PSRT), homogeneous regions in images must first be found. Generally, adaptive undersampling can result in some image-quality defects, because small objects and parts of thin or wedge-shaped objects may disappear when they are located between the initially sampled pixels. PSRT has an improved algorithm that uses pixels with the correct object information from among the sampled pixels to find pixels with erroneous color and correct them. Moreover, PRST uses ray-object intersection trees for precise classification of the homogeneity of regions and for fast intensity calculation in homogeneous regions. Experimental results are presented. They show that PSRT is two to nine times faster than standard ray tracing     

Adaptive Unsymmetrical Trim-Based Morphological Filter for High-Density Impulse Noise Removal

The modified decision-based unsymmetrical trimmed median filter (MDBUTMF), which is an efficient tool for restoring images corrupted with high-density impulse noise, is only effective for certain types of images. This is because the size of the selected window is fixed and some of the center pixels are replaced by a mean value of pixels in the window. To address these issues, this paper proposes an adaptive unsymmetrical trim-based morphological filter. Firstly, a strict extremum estimation approach is used, in order to decide whether the pixel to be processed belongs to a monochrome or non-monochrome area. Then, the center pixel is replaced by a median value of pixels in a window for the monochrome area. Secondly, a relaxed extremum estimation approach is used to control the size of structuring elements. Then an adaptive structuring element is obtained and the center pixel is replaced by the output of constrained morphological operators, i.e., the minimum or maximum of pixels in a trimmed structuring element. Our experimental results show that the proposed filter is more robust and practical than the MDBUTMF. Moreover, the proposed filter provides a preferable performance compared to the existing median filters and vector median filters for high-density impulse noise removal.

     

小波域的快速自适应图像修复算法

传统的基于偏微分方程的图像修复算法需要大量迭代,修复所耗时间较长,复杂度高。针对这一问题,提出了一种小波域的非迭代自适应图像修复算法。该算法对破损图像进行小波分解,找到待修复区域,根据待修复区域及其邻域像素值自适应选择修复模板大小,对修复模板内的像素值进行方向筛选,使修复过程严格按照等照度线方向行进,对修复后的图像进行小波重构。实验结果表明,该方法显著地缩短了修复时间,且对于图像的纹理细节、结构信息都达到了更好的修复效果。     

一种有效的自适应加权中值滤波算法

针对传统中值滤波算法的优缺点,提出了一种基于相似度函数的自适应加权中值滤波算法。该算法首先通过噪声检测确定图像中的噪声点,然后根据窗口内噪声点的个数自适应地调整滤波窗口的尺寸,再根据相似度大小,巧妙地将滤波窗口内各个像素点按一定的规律自适应地分组并赋予每组像素点相应的权重,最后采用加权中值滤波算法对检测出的噪声点进行滤波处理。计算机模拟实验结果表明：该算法既能有效地滤除噪声,又能较好地保护图像细节,滤波性能比传统中值滤波算法更理想。     

针对椒盐噪声的开关模糊滤波器

自适应中值滤波随着椒盐噪声密度增加滤波图像细节损失较大。在开关滤波和自适应中值滤波的基础上提出了开关模糊滤波（SF）。SF用Max-Min算子检测噪声点,然后根据滤波窗口中正常点数量以均值方法或者T-S模糊方法去噪。仿真实验表明,开关模糊滤波比自适应中值滤波能更好地保护边界和细节。开关模糊滤波在消除噪声和细节保护之间取得了良好的平衡。     

基于刚体模型的视频自适应中值去噪算法

传统的去噪研究主要针对图像进行滤波,未考虑视频信号的时域与空域相关性。为充分利用视频信号的时空联系进行去噪,首先建立了视频刚体模型,然后基于刚体模型进行了自适应中值滤波的研究和对比。刚体模型将视频信号分解为只包含平移和旋转运动的刚体块,以线性关系组织视频像素。基于刚体模型的中值滤波使用被滤波点在刚体内空域相邻和时域对应的像素参与中值计算,并根据时域和空域的污染程度不同选择参考像素集的范围。通过对常用测试视频的去噪实验,证实了基于刚体模型去噪的可行性;基于刚体模型的自适应中值滤波的去噪效果优于普通空域自适应滤波,证明了时空联合去噪的优越性。     

High‐resolution autostereoscopic 3‐D projection display with a space‐dividing iris‐plane shutter

Abstract— A high‐resolution autostereoscopic 3‐D projection display with a polarization‐control space dividing the iris‐plane liquid‐crystal shutter is proposed. The polarization‐control iris‐plane shutter can control the direction of stereo images without reducing the image quality of the microdis‐play. This autostereoscopic 3‐D projection display is 2‐D/3‐D switchable and has a high resolution and high luminance. In addition, it has no cross‐talk between the left and right viewing zones, a simple structure, and the capability to show multi‐view images.     

基于SLIC的自适应多主体图像分割算法

为了解决多主体图像分割的交互分割问题,提出了一种基于SLIC超像素的自适应图像分割算法。首先利用SLIC对图像进行超像素分割处理,把原图像分割为大小相似、形状规则的超像素,以超像素中心点的五维特征值作为原始数据点通过自适应参数的DBSCAN算法聚类,确定多主体数目和分割边界。算法不需要用户交互,自适应确定分割数目。为了验证算法的有效性,在伯克利大学标准数据集BSDS500上与人工标注的分割图像进行比较, 前期的超像素处理使算法在时间上有很好的提升,对于一幅481×321像素的图像,只需要1.5 s就可以获得结果。实验结果表明,该方法可以有效解决多主体图像分割中的人工交互问题,同时在PRI和VOI的指数对比上也优于传统算法,本文算法可以在保证分割效果的基础上自适应确定分割数目,提高分割效率。     

自适应偏心窗口平滑滤波图像修复

提出一种自适应平滑滤波数字图像修复新算法,采用变动中心的非线性平滑滤波算子,克服了固定中心点算子产生的边缘模糊问题。为了兼顾处理效果和计算效率,根据待修复的像素是位于图像平滑区还是边缘突变区,自适应地切换处理方法。实验表明,该算法对2种类型的像素均能取得较好的修复效果。提出用“分块校验和”方法在需要保护的图像中嵌入脆弱数字水印,一旦图像受损,即可精确得到损坏像素的定位模板,在修复中不再需要人工干预。