基于视觉的虚拟现实与增强现实融合技术

 基于视觉的虚拟现实（VR）和增强现实（AR）的融合发展是不可避免的趋势,定位与地图构建（SLAM）是虚拟现实与增强现实融合应用的主要组成部分,但在鲁棒性等方面仍存在很多具有挑战性的问题。本文提出了一种基于视觉的虚拟现实与增强现实融合技术,总结了室内场景三维重建过程中设备选择、追踪和运动干扰、平面识别等问题,并分析了当前SLAM中存在的5个具有挑战性的问题。     

基于信号重构的伪随机跳频引信信号处理技术

针对多普勒失配引起的伪随机跳频引信定距精度差及工程实现难度大的问题,提出了一种基于信号重构的伪随机跳频引信信号处理方法.首先利用发射信号重构一组用于匹配滤波的本地参考信号,然后将这组信号分别与目标回波信号进行相干积累,当其中任一通道相关值超过预设门限时,即可判为定距成功.仿真实验结果表明,该算法能够对目标区域进行精确探测,有效地解决了伪随机跳频引信多普勒失配引起的定距精度差、虚警概率高等问题.     

多电极电磁血液流速仪仿真建模研究

基于电磁流量计权函数理论,将多电极电磁测量方式应用于肢体动脉、静脉血液流速测量。通过将流动截面处划分为不同的区域,利用权函数理论重构流动截面处不同区域内的平均轴向速度值,实现对动脉、静脉血管中互为逆向流动的速度信息测量。在此基础上,通过获取不同位置的弦端电压,利用区域权函数的计算方法,确定流动截面上不同位置的权函数,进而计算流动截面处各个区域的局部轴向平均速度。三维有限元模型仿真和计算结果表明电极的位置、数量以及不同的划分方式重构结果不同,实现了速度重构并测量了局部速度分布。     

基于贝叶斯方法的Meta-分析

本文基于贝叶斯Meta-分析给出了Jeffreys无信息先验B(1/2,1/2)时的链接分布,并将其进行推广,给出了先验分布为B(α,β)时的链接分布。     

基于压缩感知的心电信号稀疏采样与重构算法

实时心电监测的数据量过大，给系统的传输和存储带来很大压力.为降低采集端的功耗，达到既减轻采样复杂度又降低传输数据量的目的，使用压缩感知技术对心电信号进行压缩采样及重构.以信号重构时间和重构误差为关键指标，研究不同重构算法和小波基的性能表现.结果表明，当压缩率在30%以内时，基追踪作为信号重构算法的百分比均方根差小于4%，同时其重构耗时最短;当压缩率在70%以内时，子空间追踪的误差小于10%，且始终保持较低的重构耗时.最优小波基往往和具体压缩率有关.     

基于卷积神经网络和稀疏滤波的调制识别方法

针对当前通信系统所采用的主要调制方式,提出了一种基于卷积神经网络和稀疏滤波的调制识别方法。首先,分析了利用信号循环谱二维灰度图进行通信信号调制识别的可行性;然后,通过降采样和裁剪技术对循环谱图预处理;最后,设计了深度卷积神经网络架构,并提出了稀疏滤波预训练的方法。仿真结果表明:相比于经典的基于深度学习的调制识别方法,该方法模型简单,优化量少,且在小样本场景下性能最佳,具有很高应用价值。     

Comparison of Near Neighbour and Neural Network in Travel Forecasting

In this paper we confirm the existence of nonlinear dynamics in a time series of airport arrivals. We subsequently propose alternative non‐parametric forecasting techniques to be used in a travel forecasting problem, emphasizing the difference between the reconstruction and learning approach. We compare the results achieved in point prediction versus sign prediction. The reconstruction approach offers better results in sign prediction and the learning approach in point prediction. Copyright © 2015 John Wiley & Sons, Ltd.     

核稀疏概念编码算法及在图像表示中的应用

稀疏编码算法是一种常用的图像数据表示方法.为了处理高度非线性分布的数据,文中提出了一种核稀疏概念编码算法,并应用于图像表示.该算法首先对邻域图进行谱分析,提取数据的几何流形结构信息;然后将原始特征空间数据映射到高维特征空间中,利用谱回归在高维特征空间中来计算基向量;最后在高维特征空间中对每个样本逐个进行表示.文中算法不仅能有效地处理非线性结构数据,而且只需求解一个稀疏特征值问题和两个回归问题,计算简单有效.在Yale、ORL和PIE图像库的聚类实验表明,文中算法的准确率和归一化互信息均优于其它几种对比算法.     

Underdetermined DOA estimation and blind separation of non-disjoint sources in time-frequency domain based on sparse representation method

This paper deals with the blind separation of nonstation-ary sources and direction-of-arrival （DOA） estimation in the under-determined case, when there are more sources than sensors. We assume the sources to be time-frequency （TF） disjoint to a certain extent. In particular, the number of sources presented at any TF neighborhood is strictly less than that of sensors. We can identify the real number of active sources and achieve separation in any TF neighborhood by the sparse representation method. Compared with the subspace-based algorithm under the same sparseness assumption, which suffers from the extra noise effect since it can-not estimate the true number of active sources, the proposed algorithm can estimate the number of active sources and their cor-responding TF values in any TF neighborhood simultaneously. An-other contribution of this paper is a new estimation procedure for the DOA of sources in the underdetermined case, which combines the TF sparseness of sources and the clustering technique. Sim-ulation results demonstrate the validity and high performance of the proposed algorithm in both blind source separation （BSS） and DOA estimation.     

Image separation using wavelet-complex shearlet dictionary

This paper presents a new method for image separation through employing a combined dictionary consisting of wavelets and complex shearlets. Because the combined dictionary sparsely represents points and curvilinear singularities respectively, the image can be decomposed into pointlike and curvelike parts as accurate as possible. The proposed method based on the geo- metric separation theory introduced by Donoho in 2005 shows that accurate geometric separation of the morphologically distinct fea- tures of points and curves can be achieved by l1 minimization. The experimental results show that the proposed method can not only be effective but also greatly reduce the computing time.