Stochastic Contrast Measures for SAR Data: A Survey

“Contrast” is an generic denomination for “difference”. Measures of contrast are a powerful tool in image processing and analysis, e.g., in denoising, edge detection, segmentation, classification, parameter estimation, change detection, and feature selection. We present a survey on techniques that aim at measuring the contrast between (i) samples of SAR imagery, and (ii) samples and models, with emphasis on those that employ the statistical properties of the data.      

光学期刊联合编辑部成功参展中国国际光电周

第十一届ILOPE展会于2006年12月5-7日在北京召开,此次展会包含了一个光电展览,四个技术/产业论坛和一个中外贸易交流会.吸引了来自14个国家近400家参展商,展出面积达1万多平米.国内主流的激光、光学和红外厂商悉数到场,同时国外FLIR、光谱物理、相干、镭宝、贰陆、HGH、Senko、美国Photonics、尼康等国际知名企业也携新产品、新技术参与.     

Graph Laplacian Matrix Learning from Smooth Time-Vertex Signal

In this paper,we focus on inferring graph Laplacian matrix from the spatiotemporal signal which is defined as“time-vertex signal”.To realize this,we first represent the signals on a joint graph which is the Cartesian product graph of the time-and vertex-graphs.By assuming the signals follow a Gaussian prior distribution on the joint graph,a meaningful representation that promotes the smoothness property of the joint graph signal is derived.Furthermore,by decoupling the joint graph,the graph learning framework is formulated as a joint optimization problem which includes signal denoising,timeand vertex-graphs learning together.Specifically,two algorithms are proposed to solve the optimization problem,where the discrete second-order difference operator with reversed sign(DSODO)in the time domain is used as the time-graph Laplacian operator to recover the signal and infer a vertex-graph in the first algorithm,and the time-graph,as well as the vertex-graph,is estimated by the other algorithm.Experiments on both synthetic and real-world datasets demonstrate that the proposed algorithms can effectively infer meaningful time-and vertex-graphs from noisy and incomplete data.     

8848从顶峰走向衰微的历史见证

人不可能两次迈进同一条河流，而8848却似乎可以。近段时间，因为速达的“收购传闻”，8848再一次成为业界关注的焦点。因为如今的8848内部风雨飘摇，外部官司缠身，它有何被收购的价值?公司总裁吕春维为何早早投怀送抱、急于为收购造势?谁是这一出“收购闹剧”的幕后主使?在诸多疑问背后，很少有人能看清事情本质。老8848的创始人王峻涛知道，但他不说，因为此8848已非当年之彼8848。几年前，盛极一时的老8848就是这样被幕后资本强行拉入分拆和兼并的资本游戏，被胜利冲昏头脑的大股东妄图运用资本力量主导企业发展，对他们来说，更重要的是上市圈钱。但因为牵扯的利益太多，诱惑太多，8848的发展最终陷入极度迷茫中，在资本疯狂追逐最大利益的时候，企业却错过了发展的最佳时机，并从此一步步走向衰微。6年来，8848经历了最辉煌的巅峰时期，同样也经历了无数是是非非。即使当时剩下的钱仍可使8848运营数十年，但是，商人们已经对8848的未来失去了耐心与信心，老8848最终难逃遭清算厄运。后来，所谓“王者归来”的新8848更是虚有其表，连核心业务也惹上纠纷，最后股东终于按捺不住……现在经常有人问王峻涛，如果当时不要上市，如果当时不分拆，如果……但王说：假设没有意义，我懂得了一点：创业者要坚持、坚持、再坚持。张朝阳也说：做自己的，不要听华尔街的。或许这就是本文要寻找的答案。     

中国这样进行专利谈判肯定不行——美国移通半径公司亚太区总裁雷鸣硅谷对话《IT时代周刊》

3G谈判受阻的主要原因是在谈判中，电信研究院作为一家研究机构实力太弱，如果能聘请外国在专利谈判上有丰富经验的律师或律师行主谈，加上中国政府的免费授权政策和运营商有关采购3G设备政策的出台，专利谈判可能是另外一个结果。     

Intelligent Passive Detection of Aerial Target in Space-Air-Ground Integrated Networks

Passive detection of moving target is an important part of intelligent surveillance. Satellite has the potential to play a key role in many applications of space-air-ground integrated networks(SAGIN). In this paper, we propose a novel intelligent passive detection method for aerial target based on reservoir computing networks. Specifically, delayed feedback networks are utilized to refine the direct signals from the satellite in the reference channels. In addition, the satellite direct wave interference in the monitoring channels adopts adaptive interference suppression using the minimum mean square error filter. Furthermore, we employ decoupling echo state networks to predict the clutter interference in the monitoring channels and construct the detection statistics accordingly. Finally, a multilayer perceptron is adopted to detect the echo signal after interference suppression. Extensive simulations is conducted to evaluate the performance of our proposed method. Results show that the detection probability is almost 100% when the signal-to-interference ratio of echo signal is-36 dB, which demonstrates that our proposed method achieves efficient passive detection for aerial targets in typical SAGIN scenarios.     

CDMA直放站干扰案例分析

2007年11月17日22点35分.我站值班人员接到中国联通梅州分公司的电话投诉.称其在梅州城区的多个CDMA基站收到不明信号的干扰.严重影响CDMA用户的正常使用。接到投诉后.我站迅速组织技术力量查找干扰     

信息产业部苟仲文副部长亲临一线指导江西抗寒救灾

2月4日,信息产业部苟仲文副部长深入省内通信运营企业现场查看了机房、通信基站和野外倒塌的电线杆,并召开座谈会,详细了解全省通信行业的受灾情况,指导江西通信业抗灾保通信畅通工作。苟仲文高度评价了江西省通信行业抗灾保通信畅通工作,对全省通信行业广大干部员工在抗雪灾行动中的无私奉献表示感谢,并勉励全省通信行业要继续战斗,做好后期的抗灾工作。     

Boston-Power集资发展新一代锂离子电池技术

Boston-Power公司(Boston-Power,Inc.)是创新便携式电源解决方案的供应商,其解决方案可满足当今市场对更安全、更持久锂离子电池的需求.日前,该公司宣布募集了4500万美元的新资金.C系列融资是由Oak Investment Partners主导,并包括现有的蓝筹投资者Venrock Associates、Granite Global Ventures及Gabriel Venture Partners.     

新起点 新机遇——BIRTV2008吹响广播影视新技术的集结号

2008年7月11日.BIRTV2008筹备工作通报会在北京梅地亚中心召开,广电总局科技司王效杰司长、中央电视台何宗就副台长、中央人民广播电台钱岳林总工、广电总局广播科学研究院马炬院长、广播电视规划院姜文波院长、中央电视台技管办黄平刚主任以及中广国际总公司李金荣总经理等领导出席会议,与120多位参展厂家的代表和媒体界的朋友们在会上进行了座谈.     

Joint queue control and user scheduling in MIMO broadcast channel under zero‐forcing multiplexing

This paper studies the problem of queue control and user scheduling in multi‐antenna broadcast (downlink) systems under zero forcing beamforming transmit strategy. In the system, we assume that the data packet arrives randomly to the buffered transmitter. By taking the broadcast channel as a controlled queueing system, we deduce the property of queue control function that maximizes the weighted system throughput while guarantees the delay fairness among users. We also present a low‐complexity user selection algorithm with the consideration of queue state and channel state together. Simulation results show that the joint queue control and user selection policy can achieve considerable fairness and stability among users. Copyright © 2009 John Wiley & Sons, Ltd.     

Subgrouping‐based multicast transmission over high‐throughput satellite systems with beam cooperation

This paper investigates the multicast transmission for multicast services in high‐throughput satellite (HTS) systems. Considering the multibeam multicast feature of HTSs, cooperative transmission among beams is involved in to improve the efficiency of the multicast transmission. Since the multicast transmission rate depends on the worst user channel state, all the users experience an unreasonably low rate. In this situation, subgrouping techniques are employed to increase transmission rates of users. A subgrouping‐based multicast transmission problem aiming at maximizing the lowest transmission rate of the users is studied to guarantee fairness among users. We formulate the problem as a max–min optimization problem and propose two low‐complex subgrouping algorithms for this problem. Additionally, we also consider multicasting in a single beam and devise a two‐layer transmission scheme for it. In the performance evaluation part, besides the impact of parameters on subgrouping performance, we analyze the performance and the computational complexity of the proposed algorithms. The results indicate that the two subgrouping algorithms can achieve favorable performance with low complexity.     

A Cross-Layer Approach to Heterogeneous Multi-User Diversity with Link Adaptation

Multi-user diversity (MUD) scheduling is based on the idea that access to the channel should be given to users with better channel state. In a system with many users whose channels vary independently, such strategy maximizes the probability that the channel of the scheduled user is near its peak. Consequently, the total ergodic capacity of the system is maximized. However, from a network point of view, performance is usually evaluated in terms of average throughput and average delay rather than ergodic capacity and fairness. Furthermore, information-theoretic rates are not achievable at the PHY layer and more practical solutions must be considered. In this paper the MUD problem is approached from a MAC layer perspective and the throughput maximal MUD scheduling policy, i.e., the policy that maximizes the total average throughput is investigated. We also study the average throughput region and show the suitability of optimal information-theoretic approaches in practical environments. The average throughput region is also contemplated in wireless networks where Heterogeneous multi-user diversity (HMUD) can be exploited. Finally, the average throughput region is related to the stability region and some average delay bounds for different ARQ mechanisms are provided.     

Queue-Aware Resource Allocation for Multi-cell OFDMA Systems with QoS Provisioning

This paper proposes a queue-aware resource allocation algorithm which provides quality of service (QoS) guarantees. The proposed solution adopts a cross-layer design approach since it is aware of both users’ queue buffer states (data link layer) and channel quality state (physical layer). Main advantages of the proposed resource allocation algorithm are: the low computational complexity and its capacity of maintaining lower QoS violation probability than other multi-cellular schemes. The proposed solution can also result in enhanced cell-edge data rate and improved fairness performance. User minimum data rate and target bit error rate as considered as QoS parameters. Validation of the proposed algorithm is achieved through various simulation scenarios wherein QoS violation probability, system fairness, user average data rate and cell-edge throughput are investigated. Numerical results and complexity analysis demonstrate the efficiency and the feasibility of the proposed QoS-oriented approach.     

Achieving Long-Term Fairness and Optimum Multiuser Diversity Gain in Time-Varying Broadcast Channels

In this paper, a downlink system in which a single-antenna base station communicates with k single antenna users over a time-correlated fading channel is considered. It is assumed that each receiver knows its own channel state, while the rate of the channel variation for all users and the corresponding initial fading gains are known to the base station. The average (per channel use) throughput of the system is studied by applying various adaptive signaling schemes. Assuming a large number of users in the system, it is shown that using a scheduling scheme in which the base station transmits to the user with the maximum initial fading gain, while using a fixed codeword length for all users, achieves the order of the maximum throughput. Moreover, an alternative scheduling scheme is proposed (by accounting for users' delays) and shown to achieve the optimum long-term fairness, while preserving the order of the maximum throughput.     

基于应用时间窗多用户MIMO-OFDM系统中的比例公平算法

该文针对基于延时信道状态信息的多用户MIMO-OFDM系统,在用户比例速率要求和功率限制的情况下,以最大化时间窗内系统吞吐量为目标,提出了一种基于应用时间窗比例公平算法。该算法首先设计各子载波上满足用户误比特率要求的星座距离,然后把系统中每个用户按照其比例映射为相应数目的虚拟用户,最后根据影子价格把子载波最优地分配给虚拟用户。仿真结果表明,该算法在保证用户公平性的基础上,有效地提高了系统吞吐量。     

Opportunistic Feedback for Multiuser MIMO Systems With Linear Receivers

A novel multiuser scheduling and feedback strategy for the multiple-input multiple-output (MIMO) downlink is proposed in this paper. It achieves multiuser diversity gain without substantial feedback requirements. The proposed strategy uses per-antenna scheduling at the base station, which maps each transmit antenna at the base station (equivalently, a spatial channel) to a user. Each user has a number of receive antennas that is greater than or equal to the number of transmit antennas at the base station. Zero-forcing receivers are deployed by each user to decode the transmitted data streams. In this system, the base station requires users' channel quality on each spatial channel for scheduling. An opportunistic feedback protocol is proposed to reduce the feedback requirements. The proposed protocol uses a contention channel that consists of a fixed number of feedback minislots to convey channel state information. Feedback control parameters including the channel quality threshold and the random access feedback probability are jointly adjusted to maximize the average throughput performance of this system. Multiple receive antennas at the base station are used on the feedback channel to allow decoding multiple feedback messages sent simultaneously by different users. This further reduces the bandwidth of the feedback channel. Iterative search algorithms are proposed to solve the optimization for selection of these parameters under both scenarios that the cumulative distribution functions of users are known or unknown to the base station     

基于非正交多址接入系统的多用户分组优化算法

用户分组算法作为非正交多址接入(NOMA)的关键部分,对系统吞吐量和用户公平性具有重要影响。当用户数量和可用的资源增加时,用户分组的最佳调度将变得不可行,该文提出一种子带间多用户分组优化算法。该算法首先根据用户信道增益差异和子带复用用户数限制条件进行多用户初始分组处理,减小用户搜索空间,然后逐步完成初始分组用户间的优化组合,以几何平均用户吞吐量最大为用户分组准则,进一步提升小区边缘用户的吞吐量。仿真结果表明,所提算法与传统的用户分组算法相比,系统总吞吐量和几何平均用户吞吐量性能提升均超过3%。     

Proportional fair scheduling with superposition coding in a cellular cooperative relay system

Many works have tackled on the problem of throughput and fairness optimization in cellular cooperative relaying systems. Considering firstly a two-user relay broadcast channel, we design a scheme based on superposition coding (SC) which maximizes the achievable sum-rate under a proportional fairness constraint. Unlike most relaying schemes where users are allocated orthogonally, our scheme serves the two users simultaneously on the same time-frequency resource unit by superposing their messages into three SC layers. The optimal power allocation parameters of each SC layer are derived by analysis. Next, we consider the general multi-user case in a cellular relay system, for which we design resource allocation algorithms based on proportional fair scheduling exploiting the proposed SC-based scheme. Numerical results show that the proposed algorithms allowing simultaneous user allocation outperform conventional schedulers based on orthogonal user allocation, both in terms of throughput and proportional fairness. These results indicate promising new directions for the design of future radio resource allocation and scheduling algorithms.     

Antenna and User Subset Selection in Downlink Multiuser Orthogonal Space-Division Multiplexing

Block diagonalization (BD) and successive optimization (SO) are two suboptimal but more practical (compared to dirty paper coding (DPC)) orthogonal linear precoding techniques for the downlink of multiuser MIMO systems. Since the numbers of users supported by BD or SO for a given number of transmit antennas are limited, BD or SO should be combined with scheduling so that a subset of users is selected at a given time slot while meeting the dimensionality requirements of these techniques. On the other hand, receive antenna selection (RAS) is a promising hardware complexity reduction technique. In this paper, we consider user scheduling in conjunction with receive antenna selection. Since exhaustive search is computationally prohibitive, we propose simplified and suboptimal user scheduling algorithms for both BD and SO. For BD, we propose capacity and Frobenius-norm based suboptimal algorithms with the objective of sum rate maximization. Starting from an empty set, each step of proposed algorithms adds the best user from the set of users not selected yet until the desired number of users have been selected. Proposed receive antenna selection works in conjunction with user scheduling to further enhance the sum rate of BD. For SO, a Frobenius-norm based low complexity algorithm is proposed, which maximizes the ratio of the squared Frobenius norm of the equivalent channel (projected to the joint null space of the previously selected users) to the sum of the squared Frobenius norms of the previously selected users’ preprocessed channels. Simulation results demonstrate that the proposed algorithms achieve sum rates close to exhaustive search algorithms with much reduced complexity. We also show that in addition to reduced hardware complexity at the receiver, antenna selection enhances multiuser diversity gain that is achieved with user scheduling.