红外图像伪彩色编码和处理

利用红外热成像系统可将物体的热分布转化为可视图像，并在监视器上以灰度级或伪彩色显示出来，从而得到被测目标的温度分布场。根据热成像测温原理以及红外图像的特点，在对室温热成像系统研究的基础上，对红外图像伪彩色编码进行了研究，提出一种新的伪彩色编码方法，即自动阈值法。利用自动阈值法可以在室温环境下，对目标的温度及其分布进行测量。在TMS320C6202和FPGA室温热成像系统中对提出的方法进行了验证。实验结果表明，该方法可使红外图像层次分明，容易分辨出不同的温度区域。     

Coding of geodesics on some modular surfaces and applications to odd and even continued fractions

The connection between geodesics on the modular surface $PSL(2,\mathbb{Z})?\mathbb{H}$ and regular continued fractions, established by Series, is extended to a connection between geodesics on $\Gamma ?\mathbb{H}$ and odd and grotesque continued fractions, where $\Gamma ?{\mathbb{Z}}_{3}1{\mathbb{Z}}_3$ is the index two subgroup of $PSL(2,\mathbb{Z})$ generated by the order three elements $\left(\begin{array}{cc}\hfill 0\hfill & \hfill ?1\hfill \\ \hfill 1\hfill & \hfill 1\hfill \end{array}\right)$ and $\left(\begin{array}{cc}\hfill 0\hfill & \hfill 1\hfill \\ \hfill ?1\hfill & \hfill 1\hfill \end{array}\right)$, and having an ideal quadrilateral as fundamental domain.A similar connection between geodesics on $\Theta ?\mathbb{H}$ and even continued fractions is discussed in our framework, where $\Theta$ denotes the Theta subgroup of $PSL(2,\mathbb{Z})$ generated by $\left(\begin{array}{cc}\hfill 0\hfill & \hfill ?1\hfill \\ \hfill 1\hfill & \hfill 0\hfill \end{array}\right)$ and $\left(\begin{array}{cc}\hfill 1\hfill & \hfill 2\hfill \\ \hfill 0\hfill & \hfill 1\hfill \end{array}\right)$.     

基于光程编码与相干合成的三维超分辨术

光学相干层析成像的轴向分辨率和横向分辨率是互为独立的,其轴向分辨率由系统光源带宽和探测光束的聚焦条件共同决定,而横向分辨率由系统样品臂的聚焦条件决定. 提高光学相干层析成像的轴向分辨率的方法主要基于宽带光源技术以及变迹术与相干门相结合的方法,而这些方法对于横向分辨率并没有提高. 提出了一种通过光程编码与相干合成的方法,可以同时提高其轴向分辨率和横向分辨率. 通过在光学相干层析成像系统的样品臂中加入光程编码分束器形成多种对应不同光程延迟的有效响应函数,基于光学相干层析成像术固有的光程分辨能力可以得到同一样品对应于不同有效响应函数的多幅图像. 通过数字控制不同有效响应函数的相对贡献对其进行相干合成,可以同时实现轴向和横向的超分辨效果. 与以前的方法相比,光程编码与相干合成方法简单易行、成本低廉,不仅可以避免系统复杂和价格昂贵等不足,而且可以同时较大幅度地提高系统的轴向分辨率和横向分辨率. 关键词： 光学相干层析成像 轴向超分辨 横向超分辨 光程编码     

Polarization synchronization in quasi-isotropic CO2 lasers

We present experimental evidence of the in-phase and out-phase synchronization of the polarization in two coupled quasi-isotropic CO₂ lasers. We also show, by means of numerical simulations, how it is possible to retrieve message encoded in the polarization of the master laser from the observation of the slave laser alone, due to the synchronization.     

基于谱间DPCM和整数小波变换的超光谱图像无损压缩

分析了干涉成像光谱仪所获取图像的谱间和空间相关性,提出了一种混合无损压缩方案.首先进行谱间DPCM预测,再对残差图像采用整数小波变换,最后对小波系数进行二值自适应算术编码.实验结果表明,该算法可实现无损压缩,压缩比平均可达2.018,较二维整数小波变换算法提高40.3%.并且算法复杂度较低,只有加减和移位运算,易于硬件实现.     

具有混音功能的新型语音卡设计与实现

为满足某控制系统实时记录语音和播放录音的实际需求,基于语音压缩编码技术,以现场可编程门阵列(FPGA)为控制核心,设计实现了16个通道采集语音信号,进行ADPCM编码,将语音文件以WAVE格式存储,集监听、播放指定语音通道及任意时间段录音于一体的紧凑型PCI(CPCI)板卡。该板卡区别于传统语音卡的创新点在于运用语音叠加技术使板卡具有混音功能,能够将不同通道语音混音、记录存储,同时具有压缩比可自由选择的功能。详细介绍了板卡的组成机构、工作原理、硬件设计和软件设计。最后进行实验测试,板卡语音存储、语音回放等各项功能正常,音质良好,验证了设计方案的可行性与实用性。     

基于分布式视频编码的低能耗视频传感器节点研究

在无线多媒体传感器网络中,如何提高节点能源的利用率,延长整个网络的生命周期是当前迫切需要解决的关键问题。从视频数据处理和传输能耗的角度出发,对分布式视频编码(DVC)基础理论及视频传感器节点的能耗模型进行分析和研究。通过实验仿真的方式将H.264帧内编码方案同DVC方案进行比较,实验结果表明了DISCOVER-DVC方案在节点节能方面的优势。最后基于DISCOVER-DVC算法,在S3C6410硬件平台和嵌入式Linux操作系统平台之上完成视频传感器节点设计,来降低节点能耗,提高节点生命周期。     

List Decoding of Arıkan’s PAC Codes

Polar coding gives rise to the first explicit family of codes that provably achieve capacity with efficient encoding and decoding for a wide range of channels. However, its performance at short blocklengths under standard successive cancellation decoding is far from optimal. A well-known way to improve the performance of polar codes at short blocklengths is CRC precoding followed by successive-cancellation list decoding. This approach, along with various refinements thereof, has largely remained the state of the art in polar coding since it was introduced in 2011. Recently, Arıkan presented a new polar coding scheme, which he called polarization-adjusted convolutional (PAC) codes. At short blocklengths, such codes offer a dramatic improvement in performance as compared to CRC-aided list decoding of conventional polar codes. PAC codes are based primarily upon the following main ideas: replacing CRC codes with convolutional precoding (under appropriate rate profiling) and replacing list decoding by sequential decoding. One of our primary goals in this paper is to answer the following question: is sequential decoding essential for the superior performance of PAC codes? We show that similar performance can be achieved using list decoding when the list size L is moderately large (say, L⩾128). List decoding has distinct advantages over sequential decoding in certain scenarios, such as low-SNR regimes or situations where the worst-case complexity/latency is the primary constraint. Another objective is to provide some insights into the remarkable performance of PAC codes. We first observe that both sequential decoding and list decoding of PAC codes closely match ML decoding thereof. We then estimate the number of low weight codewords in PAC codes, and use these estimates to approximate the union bound on their performance. These results indicate that PAC codes are superior to both polar codes and Reed–Muller codes. We also consider random time-varying convolutional precoding for PAC codes, and observe that this scheme achieves the same superior performance with constraint length as low as ν=2.     

Two-batch liar games on a general bounded channel

We consider an extension of the 2-person Rényi-Ulam liar game in which lies are governed by a channel C, a set of allowable lie strings of maximum length k. Carole selects x∈[n], and Paul makes t-ary queries to uniquely determine x. In each of q rounds, Paul weakly partitions [n]=A₀∪?∪At−1 and asks for a such that x∈Aa. Carole responds with some b, and if a≠b, then x accumulates a lie (a,b). Carole's string of lies for x must be in the channel C. Paul wins if he determines x within q rounds. We further restrict Paul to ask his questions in two off-line batches. We show that for a range of sizes of the second batch, the maximum size of the search space [n] for which Paul can guarantee finding the distinguished element is as q→∞, where Ek(C) is the number of lie strings in C of maximum length k. This generalizes previous work of Dumitriu and Spencer, and of Ahlswede, Cicalese, and Deppe. We extend Paul's strategy to solve also the pathological liar variant, in a unified manner which gives the existence of asymptotically perfect two-batch adaptive codes for the channel C.