Pose Depth Volume extraction from RGB-D streams for frontal gait recognition

We explore the applicability of Kinect RGB-D streams in recognizing gait patterns of individuals. Gait energy volume (GEV) is a recently proposed feature that performs gait recognition in frontal view using only depth image frames from Kinect. Since depth frames from Kinect are inherently noisy, corresponding silhouette shapes are inaccurate, often merging with the background. We register the depth and RGB frames from Kinect to obtain smooth silhouette shape along with depth information. A partial volume reconstruction of the frontal surface of each silhouette is done and a novel feature termed as Pose Depth Volume (PDV) is derived from this volumetric model. Recognition performance of the proposed approach has been tested on a data set captured using Microsoft Kinect in an indoor environment. Experimental results clearly demonstrate the effectiveness of the approach in comparison with other existing methods.     

Distribution of the surface radio brightness of asteroid Golevka constructed from the radar data

A method for construction of a 2D radio image of an asteroid from the radar data obtained with the use of a continuous monochromatic signal has been tested. The method is based on the inverse focused synthesis of the antenna aperture due to the rotational motion of the object and reconstructive computeraided tomography. On the basis of the analysis of the echo signals from asteroid Golevka, a 2D distribution of its surface radio brightness has been constructed. Reconstruction of the asteroid silhouette confirmed that Golevka has a not very elongated angular body whose maximum diameter is 620 m and the minimum diameter is 460 m.     

Concealment of damaged block transform coded images usingprojections onto convex sets

An algorithm for lost signal restoration in block-based still image and video sequence coding is presented. Problems arising from imperfect transmission of block-coded images result in lost blocks. The resulting image is flawed by the absence of square pixel regions that are notably perceived by human vision, even in real-time video sequences. Error concealment is aimed at masking the effect of missing blocks by use of temporal or spatial interpolation to create a subjectively acceptable approximation to the true error-free image. This paper presents a spatial interpolation algorithm that addresses concealment of lost image blocks using only intra-frame information. It attempts to utilize spatially correlated edge information from a large local neighborhood of surrounding pixels to restore missing blocks. The algorithm is a Gerchberg (1974) type spatial domain/spectral domain constraint-satisfying iterative process, and may be viewed as an alternating projections onto convex sets method.     

可重构智能表面辅助的非正交多址接入网络鲁棒能量效率资源分配算法

为提高非正交多址接入(NOMA)网络的鲁棒性和系统能效(EE),考虑了不完美信道状态信息,该文提出一种可重构智能表面(RIS)辅助的NOMA网络鲁棒能效最大资源分配算法。考虑用户信干噪比(SINR)中断概率约束、基站的最大发射功率约束以及连续相移约束,建立了一个非线性的能效最大化资源分配模型。用Dinkelbach方法将分式形式的目标函数转换为线性的参数相减的形式,利用S-procedure方法将含有信道不确定性的SINR中断概率约束转换成确定性形式,利用交替优化算法将多变量耦合的非凸优化问题分解成多个凸优化子问题,最后用CVX对分解出的子问题进行求解。仿真结果表明,在EE方面,所提算法比无可重构智能表面(RIS)算法提高了7.4%。在SINR中断概率方面,所提算法比非鲁棒算法降低了85.5%。     

Atlas-based indexing of brain sections via 2-D to 3-D image registration

A 2-D to 3-D nonlinear intensity-based registration method is proposed in which the alignment of histological brain sections with a volumetric brain atlas is performed. First, sparsely cut brain sections were linearly matched with an oblique slice automatically extracted from the atlas. Second, a planar-to-curved surface alignment was employed in order to match each section with its corresponding image overlaid on a curved-surface within the atlas. For the latter, a PDE-based registration technique was developed that is driven by a local normalized-mutual-information similarity measure. We demonstrate the method and evaluate its performance with simulated and real data experiments. An atlas-guided segmentation of mouse brains' hippocampal complex, retrieved from the Mouse Brain Library (MBL) database, is demonstrated with the proposed algorithm.     

LAT模型中基于次用户权值优化的频谱感知

全双工认知无线电LAT(Listen-and-Talk)模型因自干扰消除不完全而使得频谱感知能力下降.为提升频谱感知性能,提出了LAT模型下基于次用户加权的协作式频谱感知方法,分别研究了决策融合和数据融合下次用户最优权值的算法.求解最优权值时利用了凸优化方法,在处理非凸问题时利用了序列规划的方法,得到了较好的优化结果.仿真实验表明,在加权融合机制下的LAT模型得到了趋近于传统LBT(Listen-before-Talk)模型的频谱感知能力.     

基于AF中继协议下的抗信道偏差波束成形算法

在协作通信中,各节点获得信道状态信息存在偏差会直接导致系统性能的衰减。同时,在保证基本服务质量的前提下,采用优化方法最大限度地节约传输成本,可以延长无线网络寿命。针对上述问题,在放大—转发协议中,采用最坏情况的设计思想,提出了CSI偏差下的双约束波束成形算法。该算法利用凸函数的性质和扩展的S引理将不易求解的半正定问题转化成拟凸优化问题,再利用二分法获得最优解。算法使用重要性采样构建椭圆形收敛域,在保证该收敛域是凸集的条件下,减少了搜索范围。通过仿真证明,该算法在中继总功率和单个中继功率的双重约束条件下,仍然能够通过协作分集提高系统增益,并有效抵抗CSI偏差带来的性能损失。     

Ant colony algorithm of partially optimal programming based on dynamic convex hull guidance for solving TSP problem

To solve basic ant colony algorithm’s drawbacks of large search space,low convergence rate and easiness of trapping in local optimal solution,an ant colony algorithm of partially optimal programming based on dynamic convex hull guidance was proposed.The improved algorithm dynamically controlled the urban selection range of the ants,which could reduce the search space of ants on basis of helping the algorithm to jump out of local optimal solution to global optimal solution.Meanwhile,the delayed drift factor and the convex hull constructed by the cities to be chosen were introduced to intervene the current ants’ urban choice,it could increase the diversity of the early solution of the algorithm and improve the ability of ants’ partially optimal programming.Then the pheromone updating was coordinated by using construction information of convex hull and the complete path information that combined local with whole,it could improve the accuracy of the algorithm by guiding the subsequent ants to partially optimal programming.The pheromone maximum and minimum limit strategy with convergence was designed to avoid the algorithm’s premature stagnation and accelerate the solving speed of the algorithm.Finally,the proposed algorithm was applied to four classic TSP models.Simulation results show that the algorithm has better optimal solution,higher convergence rate and better applicability.     

源在曲面上的NURBS-UTD方法的爬行波射线寻迹算法研究

辐射源位于凸曲面上的一致性几何绕射理论(UTD)在分析设计电大尺寸平台上天线的应用广泛,本文给出了一种源点位于任意光滑凸曲面上的UTD爬行波射线寻迹算法,使用数值的微分几何方法对暗区爬行波射线进行寻迹.对目标模型引入非均匀有理B样条(NURBS)曲面进行建模,这使得UTD方法可以应用于以往板、柱、锥模型以外的任意光滑曲面模型.本文算法可应用于任意曲面上,数值结果表明了本文算法的有效性及工程适用性.     

基于凸优化的抗旋转图像盲源分离算法研究

盲源分离是指在没有源信号任何先验知识的情况下,只根据多个观测信号实现对源信号的恢复。本文在CAMNS算法的基础上提出了一种抗旋转的图像盲源分离新算法,该算法首先对观测图像进行预处理,提取图像旋转不变因子,然后利用图像空间局部显著性的假设将旋转后的图像盲源分离转化为可解的凸优化问题,进而求出分离矩阵,最后反解混合方程组确定源图像。实验结果表明:新算法有效地消除了旋转对盲源分离的影响,算法性能指标较ICA算法、NMF算法和CAMNS算法提高了近80%以上。      

面向窃听用户的RIS-MISO系统鲁棒资源分配算法

针对信道不确定性影响、用户信息泄露和能效提升等问题,该文提出一种基于不完美信道状态信息的可重构智能反射面(RIS)多输入单输出系统鲁棒资源分配算法。首先,考虑能量收集最小接收功率约束、合法用户最小保密速率约束、基站最大发射功率约束及RIS相移约束,基于有界信道不确定性,建立一个联合优化基站主动波束、能量波束、RIS相移矩阵的多变量耦合非线性资源分配问题。然后,利用Dinkelbach,S-procedure和交替优化方法,将原非凸问题转换成确定性凸优化问题,并提出一种基于连续凸近似的交替优化算法。仿真结果表明,与传统非鲁棒算法对比,所提算法具有较低的中断概率。     

Topology-graph Directed Separating Boundary Surfaces Approximation of Nonmanifold Neuroanatomical Structures: Application to Mouse Brain Olfactory Bulb

Boundary surface approximation of 3-D neuroanatomical regions from sparse 2-D images (e.g., mouse brain olfactory bulb structures from a 2-D brain atlas) has proven to be difficult due to the presence of abutting, shared boundary surfaces that are not handled by traditional boundary-representation data structures and surfaces-from-contours algorithms. We describe a data structure and an algorithm to reconstruct separating surfaces among multiple regions from sparse cross-sectional contours. We define a topology graph for each region, that describes the topological skeleton of the region's boundary surface and that shows between which contours the surface patches should be generated. We provide a graph-directed triangulation algorithm to reconstruct surface patches between contours. We combine our graph-directed triangulation algorithm together with a piecewise parametric curve fitting technique to ensure that abutting or shared surface patches are precisely coincident. We show that our method overcomes limitations in 1) traditional contours-from-surfaces algorithms that assume binary, not multiple, regionalization of space, and in 2) few existing separating surfaces algorithms that assume conversion of input into a regular volumetric grid, which is not possible with sparse interplanar resolution.      

Evaluation of the Volumetric Erosion of Spherical Electrical Contacts Using the Defect Removal Method

Volumetric erosion is regarded as a significant index for studying the erosion process of electrical switching contacts. Three-dimensional (3-D) surface measurement techniques provide an approach to investigate the geometric characteristics and volumetric erosion of electrical contacts. This paper presents a concrete data-processing procedure for evaluating volumetric erosion of spherical electrical contacts from 3-D surface measurement data using the defect removal method (DRM). The DRM outlined by McBride is an algorithm for evaluating the underlying form (prior to erosion) parameters of the surfaces with localized erosion and allowing the erosion characteristics themselves to be isolated. In this paper, a number of spherical electrical contacts that had undergone various electrical operations were measured using a 3-D surface profiler, the underlying form parameters of the eroded contacts were evaluated using the DRM, and then the volumetric erosions were isolated and calculated. The analysis of the correlations between the volumetric erosion and the number of switching cycles of electrical operation that the contacts had undergone showed a more accurate and reliable volumetric erosion evaluation using the DRM than that without using the DRM     

基于三维凹包学习算法的海面小目标检测方法

对于特征类的海面小目标检测方法,现有3特征检测器通常采用凸包分类算法完成检测。在实际应用时发现,该分类算法生成的判决区域在某些情况下不能很好地反映海杂波样本集合在特征空间中的分布情况,进而对检测器性能造成一定程度的损失。相比之下,使用凹包算法生成的判决区域是由凸包内剖得到的,它能更加贴合海杂波样本的分布,因此该文将判决区域的形式由凸包转化为凹包,并在此基础之上提出一种基于3维凹包学习算法的海面小目标检测方法。同时,针对现有3维凹包算法存在的内剖效率低、无法实现恒虚警检测的缺点,该文通过优化内剖点选择方法、增加“外补”环节的方式对算法进行改进。最后,经实测CSIR数据及X波段试验雷达数据共同验证,在其他参数均相同时,该文方法的检测性能要优于已有的多特征检测方法,并且通过对凹包算法的复杂度分析证明了所提方法的应用潜力。     

基于图论的单线激光雷达数据匹配方法

针对传统的基于单线激光雷达的匹配方法在多障碍物环境下匹配精度低的问题,提出了一种基于图论的匹配方法。该方法从数据点集中提取出具有凹凸性质的特征点,提取对应的线段并构建属性图模型,将点集配准问题转化为属性图匹配问题。与传统的基于线段的匹配算法相比,所提方法基于图模型引入了更多的线段之间的几何关系,使算法可以适用于多障碍物环境以及动态多障碍物环境;与传统的基于点的匹配方法相比,该方法依据特征点组成的线段进行几何意义上的匹配,通过属性图模型快速找到局部观测数据与全局数据的最佳匹配,提升了运算效率,同时也避免了传统方法易陷入局部最优解的缺点。     

Fast and low complexity blind equalization via subgradient projections

We propose a novel blind equalization method based on subgradient search over a convex cost surface. This is an alternative to the existing iterative blind equalization approaches such as the Constant Modulus Algorithm (CMA), which often suffer from the convergence problems caused by their nonconvex cost functions. The proposed method is an iterative algorithm called SubGradient based Blind Algorithm (SGBA) for both real and complex constellations, with a very simple update rule. It is based on the minimization of the l/sub /spl infin// norm of the equalizer output under a linear constraint on the equalizer coefficients using subgradient iterations. The algorithm has a nice convergence behavior attributed to the convex l/sub /spl infin// cost surface as well as the step size selection rules associated with the subgradient search. We illustrate the performance of the algorithm using examples with both complex and real constellations, where we show that the proposed algorithm's convergence is less sensitive to initial point selection, and a fast convergence behavior can be achieved with a judicious selection of step sizes. Furthermore, the amount of data required for the training of the equalizer is significantly lower than most of the existing schemes.     

子孔径拼接和计算全息混合补偿检测大口径凸非球面(特邀)

为了实现大口径凸非球面的高精度检测,提出了将子孔径拼接检测法和计算全息补偿检测法相结合的检测方法。由于其中心的非球面度较小,采用球面波直接检测;而外圈的非球面度较大,采用子孔径拼接和计算全息混合补偿的方法进行测量,再通过拼接算法将中心检测数据和外圈检测数据进行拼接从而得到全口径面形。结合实例对一块口径为540 mm的大口径凸非球面进行测量,并将检测结果与Luphoscan 检测结果进行对比,两种方法检测面形残差的RMS值为0.019λ,自检验子孔径与拼接结果点对点相减后的RMS值为0.017λ。结果表明该方法能够实现大口径凸非球面的高精度检测。     

面向指背关节纹识别的图像集与凸壳优化算法

本文将指背关节纹作为生物特征识别对象,提出了基于图像集与凸壳优化模型的指背关节识别算法。所提算法以指背关节纹图像集作为输入,并将局部相位特征方法用于指背关节纹特征提取,进而寻求适用于指背关节纹识别的凸壳优化模型,研究凸壳模型的构建方法并对其进行优化,从而完成指背关节纹的识别。仿真实验表明,所提算法在公开的指背关节纹中,均取得了不错的识别结果。      

基于工业断层图像的面绘制技术研究

针对MC算法的缺点进行改进和优化.提出了一种基于相似性区域分割的三维工业图像表面重建算法,根据工业图像特点采用相似性区域分割方法,实现准确分割,并利用分割结果精确地提取等值面.同时,运用渐近线判别法解决了原有算法的二义性问题,改善了生成图像的质量.实验证明,显示速度和显示精度均有提高.     

线激光、遮挡轮廓结合的雕塑形体3D扫描方法研究

随着数字化技术的逐步普及,越来越多的形体通过3D扫描设备输入计算机,然后通过一系列操作转化为CAD模型.但由于价格、适用性、易用性等条件影响,现有的3D扫描设备不能满足许多用户的需求.本文集成线激光法扫描发与遮挡轮廓重构法,实现了一套简便、易用的3D光学扫描系统,充分利用不同特性的形体空间信息,生成可靠的数字模型.文中详细介绍了相关原理、系统集成方法,并提出了一种基于分片能量泛函的数据融合方法.最后给出了一个典型扫描实例,验证了本文方法的有效性.