遥感影像检索中高维特征的快速匹配

提高特征点匹配效率是将高维局部特征运用于遥感影像检索的关键,该文提出一种新的压缩优先过滤(CPF)索引算法。该算法通过量化特征向量构建近似向量空间上的高维索引结构,利用优先队列过滤得到近似近邻候选集,精确计算候选实际特征向量得到最终近邻。在CPF算法基础上提出了基于快速鲁棒性特征(SURF)的遥感影像快速检索算法。实验及分析表明,与经典的最佳桶优先(BBF)算法相比较,CPF降低了磁盘读写(I/O)和浮点运算次数,特征点数目较大时,查询效率和总体查询精度均有显著提高,基于SURF特征的遥感影像快速检索算法能快速返回正确目标与相似目标影像。     

基于“当前”统计模型的自适应不敏卡尔曼滤波算法

基于机动目标"当前"统计模型在直角坐标系下建立了三坐标雷达跟踪系统的状态方程和观测方程。针对非线性自适应滤波这一问题,提出了一种基于"当前"统计模型的自适应不敏卡尔曼滤波算法(CS-UKF),并对算法作了说明。通过计算机仿真验证了CS-UKF算法的有效性,并且该算法跟踪效果良好,精度好于基于"当前"统计模型的自适应扩展卡尔曼滤波算法(CS-EKF)算法。     

一种权限提升图的生成算法

随着IT业的迅速发展,网络安全也越来越受到重视。一种可适应不同网络、不同初始主机权限的网络权限图的生成算法可以发现已有的网络安全漏洞,帮助网络管理人员提高网络的安全性。这种算法以主机间的连接为分析基础,根据网络状态及各主机的初始权限,得出权限提升路径,从而分析此网络的安全性,同时对网络变化和主机权限调整具有良好的适应性。     

低电压驱动的MEMS F-P可调光学滤波器研究

基于微机电系统（MEMS）技术,研制了一种新颖的光学腔与静电驱动器分离的Fabry-Pérot（F-P）可调谐滤波器。从光学设计、MEMS结构设计、制造工艺与器件测试等开展了F-P可调谐滤波器的研究,成功制备了工作在以1550 nm波长为中心、调谐范围为40 nm和驱动电压低于30 V的MEMS F-P可调滤波器。测试...     

采用光激励和光检测的LED电特性测试方法

针对目前用于测试LED光电特性多采用接触式的电注入检测方法存在系统复杂、成本高、检测效率低且易造成芯片损伤等不足,提出一种采用光激励和光检测的非接触式检测方法。通过获取光激励LED p-n结产生的光致发光（PL）光谱,在建立了LED PL、电致发光（EL）效应间的确切联系以及LED发光光谱特性与其电特性间的对应关系的基...     

基于计算机视觉的轮胎负荷轮廓测量系统

开发了一种基于计算机视觉的轮胎负荷轮廓测量系统。测量系统由CMOS摄像机、激光传感器、光栅尺和控制器等组成。通过轮胎胎侧轮廓的三维空间坐标,精确重构轮胎负荷胎侧轮廓,并实现了其几何参数快速测量,系统的测量精度可达±0.1 mm。与传统的机械手工测量方法相比,该系统具有非接触、无磨损和高效率的优点。     

Nonminimum-phase FIR channel estimation using cumulant matrix pencils

This paper studies the blind estimation of single-input-single-output channels with finite impulse response (FIR) and nonminimum phase. Based on higher order statistics, we introduce a new algorithm that exploits a matrix pencil constructed from a set of cumulant matrices. By solving a generalized eigenvalue problem, channel estimates (up to a scalar ambiguity) can be obtained from nontrivial generalized eigenvectors of this cumulant matrix pencil. With multiple estimation results available, different schemes are given to extract channel information effectively. The proposed algorithm does not require exact knowledge of the channel length and can function properly under channel length overestimation. Numerical simulations demonstrate the robustness of this new algorithm to various adverse conditions.     

PetaStar: a petabit photonic packet switch

This paper presents a new petabit photonic packet switch architecture, called PetaStar. Using a new multidimensional photonic multiplexing scheme that includes space, time, wavelength, and subcarrier domains, PetaStar is based on a three-stage Clos-network photonic switch fabric to provide scalable large-dimension switch interconnections with nanosecond reconfiguration speed. Packet buffering is implemented electronically at the input and output port controllers, allowing the central photonic switch fabric to transport high-speed optical signals without electrical-to-optical conversion. Optical time-division multiplexing technology further scales port speed beyond electronic speed up to 160 Gb/s to minimize the fiber connections. To solve output port contention and internal blocking in the three-stage Clos-network switch, we present a new matching scheme, called c-MAC, a concurrent matching algorithm for Clos-network switches. It is highly distributed such that the input-output matching and routing-path finding are concurrently performed by scheduling modules. One feasible architecture for the c-MAC scheme, where a crosspoint switch is used to provide the interconnections between the arbitration modules, is also proposed. With the c-MAC scheme, and an internal speedup of 1.5, PetaStar with a switch size of 6400 /spl times/ 6400 and total capacity of 1.024 petabit/s can be achieved at a throughput close to 100% under various traffic conditions.     

Blind MIMO system identification based on cumulant subspace decomposition

Blind identification of multiple-input multiple-output (MIMO) linear systems can be achieved by utilizing higher order statistics of the output signals. We study the blind identification of MIMO systems whose inputs are mutually independent, temporally white, non-Gaussian source signals. Based on sub-space analysis, we develop a new linear batch algorithm to identify MIMO systems from the common space of a set of fourth-order cumulant matrices of the channel outputs. Given knowledge of the channel orders, the identifiability conditions required by the proposed algorithm are properly established. Like most subspace-based approaches, this new algorithm remains sensitive to channel order overestimation. Simulation results illustrate its performance for various channel models.     

Distributed wireless communication system: a new architecture for future public wireless access

The distributed wireless communication system (DWCS) is a new architecture for a wireless access system with distributed antennas, distributed processors, and distributed control. With distributed antennas, the system capacity can be expanded through dense frequency reuse, and the transmission power can be greatly decreased. With distributed processors control, the system works like a software or network radio, so different standards can coexist, and the system capacity can be increased by coprocessing of signals to and from multiple antennas.