一种稀布矩形平面阵的多约束优化方法

针对矩形孔径平面稀布阵的多约束优化问题(包括阵元数、阵列孔径和最小阵元间距约束), 提出了一种基于矩阵映射的差分进化算法.该方法把差分进化算法的优化变量与阵元位置坐标按照特定的关系进行矩阵映射, 使含有多约束的阵元分布优化问题转换为仅含差分进化算法优化变量上、下限约束的优化问题, 从根本上避免了进化过程中的不可行解.通过抑制阵列峰值副瓣电平进行仿真实验, 结果显示了该算法的高效性和稳健性, 且能获得比现有方法更好的优化结果.     

激光捷联惯导多矢量定姿法晃动基座粗对准

针对激光捷联惯导晃动基座下受载体运动干扰难以实现粗对准这一问题,提出了一种惯性系下基于多矢量定姿的粗对准方法。首先分析了基于双矢量定姿的惯性系粗对准算法的原理和不足,在此基础上推导了基于多矢量定姿的粗对准模型,并对新方法进行了仿真验证。结果表明,与传统双矢量定姿惯性系对准方法相比,采用多矢量定姿能更充分利用观测信息,有效抑制干扰运动对对准精度的影响,建立更准确的捷联矩阵,同时使对准结果具有更好的稳定性。     

物理可实现的相位编码压缩成像

 压缩成像是压缩感知理论最重要的研究领域之一.在分析压缩成像中实际测量矩阵与测量值约束的基础上,提出一种基于4-f光学架构的物理可实现的频域相位编码压缩成像方法.该方法利用两路光学架构之间的补偿实现相位编码压缩成像中测量值的非负记录,然后从该测量值精确恢复原图像,解决压缩成像应用中理论与实际物理约束之间不一致的问题.该方法可以单次曝光获得充分的测量值精确重建原图像,不需要其它附加信息,是压缩成像物理实现的一种非常可行的方案.模拟实验证明该方法可以有效地实现图像的压缩测量与超分辨率重建.     

基于异法则矩阵映射的稀布矩形面阵优化

针对多约束条件下稀布矩形平面阵列天线的优化问题,提出异法则矩阵映射方法,以获得更低的峰值旁瓣电平。该方法在现有矩阵映射方法的基础上,对矩形平面中不同方向的坐标定义不同的映射法则,以满足实际工程应用中的多个约束条件,将有约束优化问题转化为无约束优化问题。异法则矩阵映射方法可以改善现有方法随机性强和搜索精度低的不足,提高搜索效率。为检验该方法的可行性进行了仿真实验,实验结果表明该方法可以有效降低阵列天线的峰值旁瓣电平。     

Two-dimensional angle-of-arrival estimation in the presence offinite distance sources

When sources are a finite distance away from an array system, most high-resolution bearing estimation techniques exhibit unsatisfactory performance due to the invalidity of the planar wavefront assumption. This problem has been addressed by a far-field approximation (FFA) method based on a preprocessing scheme. By exploiting favorable characteristics of a uniform linear array, the method constructs a FFA covariance matrix, which is Toeplitz and approximates to the far-field data covariance matrix, from the observed data covariance matrix. Then eigenstructure methods can be applied to perform bearing estimation without revising the planar wavefront assumption. This method is extended to the problem of two-dimensional angle-of-arrival (AOA) estimation using a uniform planar array in the presence of finite distance sources. A procedure is derived for reconstructing the 2-D FFA covariance matrix with block-Toeplitz structure. Using the 2-D FFA covariance matrix, eigenstructure methods can be applied in conjunction with a 2-D AOA search to solve the problem. Simulation results confirm the theoretical work     

基于平滑l_0范数的压缩感知近场声全息方法

传统平面近场声全息(CPNAH)是一类典型的不适定问题,采用波数域滤波或Tikhonov正则化等方法都无法彻底解决,因此,提出一种基于平滑l_0范数的压缩感知平面近场声全息法(SL0-CS-PNAH)。根据全息面上测量声压的特点,采用symlets8小波函数构建正交小波变换矩阵,将其作为重建面质点法向振速的稀疏基。将CPNAH中使用的瑞利(Rayleigh)第一积分公式离散化,确定SL0-CS-PNAH中满足约束等距原则的测量矩阵,设置合适的压缩比,利用测量矩阵对稀疏信号进行压缩采样。在由感知矩阵、全息面测量声压和稀疏向量共同构成的约束条件下,建立稀疏向量的最小l_0范数优化模型,采用平滑l_0范数重建算法求解此模型下的最优化问题,得到质点法向振速的最优稀疏解,再将最优稀疏解和稀疏基相乘恢复重建面质点法向振速。在数值仿真实验中,将测量点由64×64减少到32×64的情况下将传统CPNAH、基于正交匹配追踪算法的压缩感知近场声全息(OMPCS-PNAH)、基于子空间追踪算法的压缩感知近场声全息(SP-CS-PNAH)和SL0-CS-PNAH进行比较。实验结果表明,在相同采样率和压缩比条件下,采用SL0-CS-PNAH的声场重建质量较好且重建效率较高。     

Underconstrained planar cable-direct-driven robots: A trajectory planning method ensuring positive and bounded cable tensions

A major open issue in the design and operation of cable-direct-driven-robots (CDDRs) is ensuring tensile cable forces for any admissible motion of the CDDR. Such a problem is particularly challenging when underconstrained and non-redundant CDDR configurations are considered. In this paper a new and general trajectory planning method is introduced, which has been specifically developed to ensure always positive and bounded cable tensions in underconstrained planar two-degree-of-freedom translational CDDRs. The proposed method translates the typical bilateral force constraints of the cables (i.e. positive and bounded tensions) into constraints on the velocity and acceleration of the CDDR end-effector along the path. Such constraints are computed making use of the robot dynamic model and are then incorporated in a suitable trajectory planning algorithm also yielding the minimum traversal time. The method is explained and validated numerically by applying it to a novel concept of underconstrained hybrid (serial/parallel) CDDR. The results achieved prove that the proposed method may a priori ensure positive and bounded cable tensions along any straight line and circular path.     

平面近场测量的共轭梯度法分析

从被测天线(AUT)和探头的耦合方程出发，利用Nyquist定理，推导出了扫描面上近场和波谱函数之间的矩阵方程。用共轭梯度法(CG)求解这一矩阵方程，得到波谱函数，从而算出远场方向图。这种方法只需要知道测量点的位置就足够，并不要求测量点必须位于某些特定点上。计算结果表明，用此方法原理上可消除常规平面近场测量中位置误差的影响。     

基于秩极小化的压缩感知图像恢复算法

本文将压缩感知图像恢复问题作为低秩矩阵恢复问题来进行研究.为了构建这样的低秩矩阵,我们采样非局部相似度模型,将相似图像块作为列向量构建一个二维相似块矩阵.由于列向量间的强相关性,因此该矩阵具有低秩属性.然后以压缩感知测量作为约束条件对这样的二维相似块矩阵进行低秩矩阵恢复求解.在算法求解的过程中,使用增广拉格朗日方法将受限优化问题转换为非受限优化问题,同时为了减少计算复杂度,使用基于泰勒展开的线性化技术来加速算法求解.实验表明该算法的收敛率、图像恢复性能均优于目前主流压缩感知图像恢复算法.     

平面图像立体化研究

将平面图像转换成立体图像很有意义。Hou等人(2002)提出了一种平面图像立体化方法,称为Hou方法。在这个方法中Hou等人使用随机变量等参数控制转换过程,但没有讨论这些参数对立体效果的影响。该文利用Hou方法在标准的计算机监视器上对含有心理深度暗示的平面图像进行了立体化,给出了评价转换后的立体效果的定量指标,并讨论了各参数对立体效果的影响。实验结果表明:当随机变量矩阵中的每一个随机变量都服从同一种均匀分布时,随机变量的取值对立体效果没有多大的影响;当监视器屏幕与观察者的距离为一个合适的值(例如1m)时,图像子块的个数取不同的值对立体效果没有多大的影响。     

MagTable: A tabletop system for 6-DOF large range and completely contactless operation using magnetic levitation

This paper presents a new magnetic levitation system, MagTable, which provides six-degrees-of-freedom (6-DOF) and completely contactless operation of a magnetized object. The MagTable consists of a planar array of square coils and a permanent magnet type carrier. The maximum levitation height of the carrier is 30mm within a 400mm × 200mm horizontal translation range. The novelty of this research lies in the fully untethered manipulation of levitated carriers in such a large area, and in the fast and accurate computation of wrench matrix using the magnetic nodes method and the Lorentz force law. In this paper, the design method is firstly provided. Then, the optimization of the carrier's magnet topology, based on better controllability and minimum power consumption, is documented. Experimental results of the 5-DOF motion control of two single-permanent-magnet carriers and the 6-DOF motion control of a three-permanent-magnets carrier are presented. The results demonstrate the performance of the MagTable in 100mm × 40mm horizontal translation range with maximum levitation height of 20mm. The rotation range are ±6° in both roll and pitch, and ±12° yaw motion about the vertical axis. The proposed system has potential applications in fast and high precision manipulation tasks.     

基于分块压缩感知的图像全局重构模型

已有的基于分块压缩感知（Block Compressed Sensing,Block CS）的图像重构模型采用相同的测量矩阵以块×块的方式获取数据,解决了传统CS方法中测量矩阵所需存储量较大的问题,但由于采用分块重构,没有考虑到图像的全局稀疏度,出现了大量的块效应。本文分析了图像分块重构产生块效应的三个主要原因:块稀疏度不均匀、频谱泄漏和块尺寸受限,提出了一种基于Block CS的图像全局重构模型。该模型在编码端采用高斯随机矩阵逐块作非相关测量;在解码端,引入排序算子,重新构造测量矩阵,该测量矩阵既适合于进行全局重构,又适合于分块测量的CS观测值,并仍与图像的稀疏矩阵高度不相关,所以其可充分利用图像的全局稀疏度进行CS重构。仿真实验表明,所提出的全局重构模型有效地消除了块效应现象,并且对块尺寸的变化有较强的鲁棒性。      

一种新的仿射不变特征及其在平面曲线匹配中的应用

构造了一种新的仿射变换不变特征,提出了一种适合于仿射变换的曲线匹配算法。首先将整个轮廓区域进行仿射区域划分,得到一系列子区域质心点;然后将质心和子区域的质心点按规则构成三角形,计算三角形的面积比序列,并将其规范化,构造新的仿射不变特征。在该不变特征的基础上设计新的识别向量和差异度度量函数,通过计算待识别目标与模型曲线之...     

基于马尔科夫判别谱聚类的极化SAR图像分类方法

该文针对现有的谱聚类方法用于极化SAR图像分类时精度较低的问题,提出一种基于马尔科夫的判别谱聚类方法(MDSC),具有低秩和稀疏分解的特点。该方法首先恢复一个真实的低秩概率转移矩阵,将其作为标准马尔科夫谱聚类方法的输入,以减少噪声对分类结果的影响;然后在目标函数中引入判别信息,使极化SAR图像的数据信息能够得到更加充分地利用;最后采用增广拉格朗日乘子法来解决低秩和概率单纯形约束下的目标函数优化问题。在荷兰小农田、德国、西安和荷兰大农田4个不同数据集上的实验证明,该方法具有较好的准确率,且参数敏感性较低,表现出了良好的分类性能。      

Network Topology Inference Based on End-to-End Measurements

We consider using traceroute-like end-to-end measurement to infer the underlay topology for a group of hosts. One major issue is the measurement cost. Given N hosts in an asymmetric network without anonymous routers, traditionally full N(N-1) traceroutes are needed to determine the underlay topology. We investigate how to efficiently infer an underlay topology with low measurement cost, and propose a heuristic called Max-Delta. In the heuristic, a server selects appropriate host-pairs to measure in each iteration so as to reveal the most undiscovered information on the underlay. We further observe that the presence of anonymous routers significantly distorts and inflates the inferred topology. Previous research has shown that obtaining both exact and approximate topology in the presence of anonymous routers under certain consistency constraints is intractable. We hence propose fast algorithms on how to practically construct an approximate topology by relaxing some constraints. We investigate and compare two algorithms to merge anonymous routers. The first one uses Isomap to map routers into a multidimensional space and merges anonymous routers according to their interdistances. The second algorithm is based on neighbor router information, which trades off some accuracy with speed. We evaluate our inference algorithms on Internet-like and real Internet topologies. Our results show that almost full measurement is needed to fully discover the underlay topology. However, substantial reduction in measurements can be achieved if a little accuracy, say 5%, can be compromised. Moreover, our merging algorithms in the presence of anonymous routers can efficiently infer an underlay topology with good accuracy     

Automated Motion Estimation for 2-D Cine DENSE MRI

Cine displacement encoding with stimulated echoes (DENSE) is a magnetic resonance (MR) method that directly encodes tissue displacement into MR phase images. This technique has successfully interrogated many forms of tissue motion, but is most commonly used to evaluate cardiac mechanics. Currently, motion analysis from cine DENSE images requires manually delineated anatomical structures. An automated analysis would improve measurement throughput, simplify data interpretation, and potentially access important physiological information during the MR exam. In this paper, we present the first fully automated solution for the estimation of tissue motion and strain from 2-D cine DENSE data. Results using both simulated and human cardiac cine DENSE data indicate good agreement between the automated algorithm and the standard semi-manual analysis method.     

Penalty function-based precoding for downlink multiuser MIMO systems

In this paper, a novel linear precoding scheme is proposed for downlink multiuser multiple-input multiple-output (MIMO) systems. The new algorithm uses the penalty function method to mitigate the co-channel interference and is formulated as a convex problem with general linear constraints. The constraints can be sum power, per-antenna power or per-antenna-group power constraints, hence the new algorithm is general and can be used in both single-cell and fully cooperative multi-cell scenarios. Moreover, the famous block diagonalization (BD) precoding can be considered as a special case of our method when a very large penalty factor is used. We study the optimal solution of this convex problem and propose an iterative algorithm to obtain the optimum based on the Lagrange dual method. Simulation results show that the proposed method significantly outperforms the BD method at low and moderate SNR values in terms of the weighted sum rate.     

宽带全极化垂直昆虫雷达设计及校准关键技术研究

宽带全极化垂直昆虫雷达是一种利用宽带信号实现空中单只昆虫分辨,利用多极化通道实现昆虫全极化测量的雷达系统.当被测昆虫体型在不同极化轴向的电磁波反射功率可明显分辨时,该雷达可利用"当极化方向平行于昆虫体轴时,回波功率最大"的基本原理,通过测量昆虫极化散射矩阵,获取昆虫体轴方向,对研究昆虫定向迁飞规律具有重要的作用.当前垂...     

Motion control of a novel planar biped with nearly linear dynamics

In this paper, we propose the design of a planar biped for which the model is nearly linear, i.e., the inertia matrix is a constant and the gravity terms in the equations of motion are still nonlinear, but simplified. The legs are designed such that the inertia matrix is independent of the joint variables. As a result, the nonlinear terms in the centrifugal and Coriolis terms disappear. In this design, each leg has two links that are connected by a revolute joint at the knee. The two legs are connected to each other at the hip. The center of mass of each leg is located at the hip, using counterweights. We assume that the stance leg is locked at the knee during the support phase. For this system, dynamic model for complete walking, i.e., swing phase, knee lock, and foot impact are considered. Motion control for trajectory following of this design is studied using a nonlinear controller. The paper discusses the issue of tracking of desired trajectories during the full cycle motion.     

LCD运动伪像仿真

如何客观地评价和减小运动伪像是目前LCD科研人员急需解决的难题.根据人眼平滑追踪和亮度积分原理,基于实际采集的LCD亮度响应变化,采用模拟计算产生了运动模糊图像,并通过视觉感知实验,对仿真所得的模糊图像和实际观察到的运动模糊图像进行了实验,结果表明模拟产生的运动图像的模糊和人眼实际观看感觉到的模糊吻合得很好.