A Novel Wireless Power Transfer-Based Weighed Clustering Cooperative Spectrum Sensing Method for Cognitive Sensor Networks.

Science.gov (United States)

Liu, Xin

2015-10-30

In a cognitive sensor network (CSN), the wastage of sensing time and energy is a challenge to cooperative spectrum sensing, when the number of cooperative cognitive nodes (CNs) becomes very large. In this paper, a novel wireless power transfer (WPT)-based weighed clustering cooperative spectrum sensing model is proposed, which divides all the CNs into several clusters, and then selects the most favorable CNs as the cluster heads and allows the common CNs to transfer the received radio frequency (RF) energy of the primary node (PN) to the cluster heads, in order to supply the electrical energy needed for sensing and cooperation. A joint resource optimization is formulated to maximize the spectrum access probability of the CSN, through jointly allocating sensing time and clustering number. According to the resource optimization results, a clustering algorithm is proposed. The simulation results have shown that compared to the traditional model, the cluster heads of the proposed model can achieve more transmission power and there exists optimal sensing time and clustering number to maximize the spectrum access probability.

A Novel Wireless Power Transfer-Based Weighed Clustering Cooperative Spectrum Sensing Method for Cognitive Sensor Networks

Directory of Open Access Journals (Sweden)

Xin Liu

2015-10-01

Full Text Available In a cognitive sensor network (CSN, the wastage of sensing time and energy is a challenge to cooperative spectrum sensing, when the number of cooperative cognitive nodes (CNs becomes very large. In this paper, a novel wireless power transfer (WPT-based weighed clustering cooperative spectrum sensing model is proposed, which divides all the CNs into several clusters, and then selects the most favorable CNs as the cluster heads and allows the common CNs to transfer the received radio frequency (RF energy of the primary node (PN to the cluster heads, in order to supply the electrical energy needed for sensing and cooperation. A joint resource optimization is formulated to maximize the spectrum access probability of the CSN, through jointly allocating sensing time and clustering number. According to the resource optimization results, a clustering algorithm is proposed. The simulation results have shown that compared to the traditional model, the cluster heads of the proposed model can achieve more transmission power and there exists optimal sensing time and clustering number to maximize the spectrum access probability.

Generalized eigenvalue based spectrum sensing

KAUST Repository

Shakir, Muhammad

2012-01-01

Spectrum sensing is one of the fundamental components in cognitive radio networks. In this chapter, a generalized spectrum sensing framework which is referred to as Generalized Mean Detector (GMD) has been introduced. In this context, we generalize the detectors based on the eigenvalues of the received signal covariance matrix and transform the eigenvalue based spectrum sensing detectors namely: (i) the Eigenvalue Ratio Detector (ERD) and two newly proposed detectors which are referred to as (ii) the GEometric Mean Detector (GEMD) and (iii) the ARithmetic Mean Detector (ARMD) into an unified framework of generalize spectrum sensing. The foundation of the proposed framework is based on the calculation of exact analytical moments of the random variables of the decision threshold of the respective detectors. The decision threshold has been calculated in a closed form which is based on the approximation of Cumulative Distribution Functions (CDFs) of the respective test statistics. In this context, we exchange the analytical moments of the two random variables of the respective test statistics with the moments of the Gaussian (or Gamma) distribution function. The performance of the eigenvalue based detectors is compared with the several traditional detectors including the energy detector (ED) to validate the importance of the eigenvalue based detectors and the performance of the GEMD and the ARMD particularly in realistic wireless cognitive radio network. Analytical and simulation results show that the newly proposed detectors yields considerable performance advantage in realistic spectrum sensing scenarios. Moreover, the presented results based on proposed approximation approaches are in perfect agreement with the empirical results. © 2012 Springer Science+Business Media Dordrecht.

An Energy-Efficient Spectrum-Aware Reinforcement Learning-Based Clustering Algorithm for Cognitive Radio Sensor Networks.

Science.gov (United States)

Mustapha, Ibrahim; Mohd Ali, Borhanuddin; Rasid, Mohd Fadlee A; Sali, Aduwati; Mohamad, Hafizal

2015-08-13

It is well-known that clustering partitions network into logical groups of nodes in order to achieve energy efficiency and to enhance dynamic channel access in cognitive radio through cooperative sensing. While the topic of energy efficiency has been well investigated in conventional wireless sensor networks, the latter has not been extensively explored. In this paper, we propose a reinforcement learning-based spectrum-aware clustering algorithm that allows a member node to learn the energy and cooperative sensing costs for neighboring clusters to achieve an optimal solution. Each member node selects an optimal cluster that satisfies pairwise constraints, minimizes network energy consumption and enhances channel sensing performance through an exploration technique. We first model the network energy consumption and then determine the optimal number of clusters for the network. The problem of selecting an optimal cluster is formulated as a Markov Decision Process (MDP) in the algorithm and the obtained simulation results show convergence, learning and adaptability of the algorithm to dynamic environment towards achieving an optimal solution. Performance comparisons of our algorithm with the Groupwise Spectrum Aware (GWSA)-based algorithm in terms of Sum of Square Error (SSE), complexity, network energy consumption and probability of detection indicate improved performance from the proposed approach. The results further reveal that an energy savings of 9% and a significant Primary User (PU) detection improvement can be achieved with the proposed approach.

Concept for a hyperspectral remote sensing algorithm for floating marine macro plastics.

Science.gov (United States)

Goddijn-Murphy, Lonneke; Peters, Steef; van Sebille, Erik; James, Neil A; Gibb, Stuart

2018-01-01

There is growing global concern over the chemical, biological and ecological impact of plastics in the ocean. Remote sensing has the potential to provide long-term, global monitoring but for marine plastics it is still in its early stages. Some progress has been made in hyperspectral remote sensing of marine macroplastics in the visible (VIS) to short wave infrared (SWIR) spectrum. We present a reflectance model of sunlight interacting with a sea surface littered with macro plastics, based on geometrical optics and the spectral signatures of plastic and seawater. This is a first step towards the development of a remote sensing algorithm for marine plastic using light reflectance measurements in air. Our model takes the colour, transparency, reflectivity and shape of plastic litter into account. This concept model can aid the design of laboratory, field and Earth observation measurements in the VIS-SWIR spectrum and explain the results. Copyright © 2017 Elsevier Ltd. All rights reserved.

A localized cooperative wideband spectrum sensing for dynamic access of TV bands using RF sensor networks

KAUST Repository

Mirza, Mohammed

2011-07-01

In this paper we address and simulate a Radio Frequency (RF) sensor network for a cooperative spectrum sensing and localization scheme. The proposed method integrates a Wavelet based Multi-Resolution Spectrum Sensing (MRSS), an N-bit hard combination technique for cooperative decision making and a Received Signal Strength (RSS) based localization algorithm to detect the availability of frequency bands and the location of the usable base station. We develop an N-bit hard combination technique and compare its performance to a traditionally used 2-bit hard combination for cooperative sensing. The key idea is to design a novel RF sensor network based cooperative wideband spectrum sensing and localization scheme by using a wavelet based Multi-Resolution Spectrum Sensing (MRSS) and Received Signal Strength (RSS) Localization techniques which were originally proposed for cognitive radio applications. The performance evaluations are also done to show the different detection accuracies for varying parameters such as number of sensor nodes, Signal to Noise Ratios (SNR) and number of averaged Power Spectral Densities (PSD). The proposed scheme improves the problems of shadowing, fading and noise. In addition, the RSS based localization technique was shown to be an acceptable means of estimating the position of the available transmitter. © 2011 IEEE.

Cooperative Spectrum Sensing over Non-Identical Nakagami Fading Channels

KAUST Repository

Rao, Anlei

2012-09-08

Previous works in cooperative spectrum sensing assumed that the channels for sensing and reporting are independent identical distributed (i.i.d). A more practical and appropriate assumption, however, should be that the sensing channels and reporting channels are independent but not necessarily identically distributed (i.n.i.d). In this paper, we derive the false-alarm probability and the detection probability of cooperative spectrum sensing with energy fusion over i.n.i.d Nakagami fading channels. Selected numerical results show that cooperative spectrum sensing still gives considerably better performance results even over i.n.i.d fading channels.

A Review on Spectrum Sensing for Cognitive Radio: Challenges and Solutions

Directory of Open Access Journals (Sweden)

Yonghong Zeng

2010-01-01

Full Text Available Cognitive radio is widely expected to be the next Big Bang in wireless communications. Spectrum sensing, that is, detecting the presence of the primary users in a licensed spectrum, is a fundamental problem for cognitive radio. As a result, spectrum sensing has reborn as a very active research area in recent years despite its long history. In this paper, spectrum sensing techniques from the optimal likelihood ratio test to energy detection, matched filtering detection, cyclostationary detection, eigenvalue-based sensing, joint space-time sensing, and robust sensing methods are reviewed. Cooperative spectrum sensing with multiple receivers is also discussed. Special attention is paid to sensing methods that need little prior information on the source signal and the propagation channel. Practical challenges such as noise power uncertainty are discussed and possible solutions are provided. Theoretical analysis on the test statistic distribution and threshold setting is also investigated.

PERFORMANCE OPTIMIZATION OF COGNITIVE RADIO WITH WIDEBAND SPECTRUM SENSING

Directory of Open Access Journals (Sweden)

E. Saraniya

2014-09-01

Full Text Available Cognitive radio (CR technology allows the unlicensed user to access the licensed spectrum bands. Spectrum sensing is an essential function in cognitive radio to detect the spectrum holes and opportunistically use the underutilized frequency bands without causing interference to primary user (PU. In this paper we are maximizing the throughput capacity of cognitive radio user and hence the performance of spectrum sensing and protection to licensed user improves over a wideband spectrum sensing band. The simulation of cognitive radio is done by analyzing the performance of energy detector spectrum sensing technique to detect primary user and to formulate the optimization using multiband joint detection method (MJD to achieve suitable trade- off between secondary user access and primary user network. The main aim of this paper is to maximize the probability of detection and to decrease the probabilities of miss detection and false alarm. To maximize the throughput it requires minimizing the throughput loss caused by miss detection and the significant reduction in probability of false alarm helps in achieving the spectral efficiency from the secondary user’s perspective. The simulation results show that the performance increases with the MJD method.

A Decentralized Eigenvalue Computation Method for Spectrum Sensing Based on Average Consensus

Science.gov (United States)

Mohammadi, Jafar; Limmer, Steffen; Stańczak, Sławomir

2016-07-01

This paper considers eigenvalue estimation for the decentralized inference problem for spectrum sensing. We propose a decentralized eigenvalue computation algorithm based on the power method, which is referred to as generalized power method GPM; it is capable of estimating the eigenvalues of a given covariance matrix under certain conditions. Furthermore, we have developed a decentralized implementation of GPM by splitting the iterative operations into local and global computation tasks. The global tasks require data exchange to be performed among the nodes. For this task, we apply an average consensus algorithm to efficiently perform the global computations. As a special case, we consider a structured graph that is a tree with clusters of nodes at its leaves. For an accelerated distributed implementation, we propose to use computation over multiple access channel (CoMAC) as a building block of the algorithm. Numerical simulations are provided to illustrate the performance of the two algorithms.

Multislot Simultaneous Spectrum Sensing and Energy Harvesting in Cognitive Radio

Directory of Open Access Journals (Sweden)

Xin Liu

2016-07-01

Full Text Available In cognitive radio (CR, the spectrum sensing of the primary user (PU may consume some electrical power from the battery capacity of the secondary user (SU, resulting in a decrease in the transmission power of the SU. In this paper, a multislot simultaneous spectrum sensing and energy harvesting model is proposed, which uses the harvested radio frequency (RF energy of the PU signal to supply the spectrum sensing. In the proposed model, the sensing duration is divided into multiple sensing slots consisting of one local-sensing subslot and one energy-harvesting subslot. If the PU is detected to be present in the local-sensing subslot, the SU will harvest RF energy of the PU signal in the energy-harvesting slot, otherwise, the SU will continue spectrum sensing. The global decision on the presence of the PU is obtained through combining local sensing results from all the sensing slots by adopting “Or-logic Rule”. A joint optimization problem of sensing time and time splitter factor is proposed to maximize the throughput of the SU under the constraints of probabilities of false alarm and detection and energy harvesting. The simulation results have shown that the proposed model can clearly improve the maximal throughput of the SU compared to the traditional sensing-throughput tradeoff model.

Sum Utilization of Spectrum with Spectrum Handoff and Imperfect Sensing in Interweave Multi-Channel Cognitive Radio Networks

Directory of Open Access Journals (Sweden)

Waqas Khalid

2018-05-01

Full Text Available Fifth-generation (5G heterogeneous network deployment poses new challenges for 5G-based cognitive radio networks (5G-CRNs as the primary user (PU is required to be more active because of the small cells, random user arrival, and spectrum handoff. Interweave CRNs (I-CRNs improve spectrum utilization by allowing opportunistic spectrum access (OSA for secondary users (SUs. The sum utilization of spectrum, i.e., joint utilization of spectrum by the SU and PU, depends on the spatial and temporal variations of PU activities, sensing outcomes, transmitting conditions, and spectrum handoff. In this study, we formulate and analyze the sum utilization of spectrum with different sets of channels under different PU and SU co-existing network topologies. We consider realistic multi-channel scenarios for the SU, with each channel licensed to a PU. The SU, aided by spectrum handoff, is authorized to utilize the channels on the basis of sensing outcomes and PU interruptions. The numerical evaluation of the proposed work is presented under different network and sensing parameters. Moreover, the sum utilization gain is investigated to analyze the sensitivities of different sensing parameters. It is demonstrated that different sets of channels, PU activities, and sensing outcomes have a significant impact on the sum utilization of spectrum associated with a specific network topology.

Spectrum Sensing and Primary User Localization in Cognitive Radio Networks via Sparsity

Directory of Open Access Journals (Sweden)

Lanchao Liu

2016-01-01

Full Text Available The theory of compressive sensing (CS has been employed to detect available spectrum resource in cognitive radio (CR networks recently. Capitalizing on the spectrum resource underutilization and spatial sparsity of primary user (PU locations, CS enables the identification of the unused spectrum bands and PU locations at a low sampling rate. Although CS has been studied in the cooperative spectrum sensing mechanism in which CR nodes work collaboratively to accomplish the spectrum sensing and PU localization task, many important issues remain unsettled. Does the designed compressive spectrum sensing mechanism satisfy the Restricted Isometry Property, which guarantees a successful recovery of the original sparse signal? Can the spectrum sensing results help the localization of PUs? What are the characteristics of localization errors? To answer those questions, we try to justify the applicability of the CS theory to the compressive spectrum sensing framework in this paper, and propose a design of PU localization utilizing the spectrum usage information. The localization error is analyzed by the Cramér-Rao lower bound, which can be exploited to improve the localization performance. Detail analysis and simulations are presented to support the claims and demonstrate the efficacy and efficiency of the proposed mechanism.

Centralized cooperative spectrum sensing for ad-hoc disaster relief network clusters

DEFF Research Database (Denmark)

Pratas, Nuno; Marchetti, Nicola; Prasad, Neeli R.

2010-01-01

Disaster relief networks have to be highly adaptable and resilient. Cognitive radio enhanced ad-hoc architecture have been put forward as a candidate to enable such networks. Spectrum sensing is the cornerstone of the cognitive radio paradigm, and it has been the target of intensive research....... The main common conclusion was that the achievable spectrum sensing accuracy can be greatly enhanced through the use of cooperative sensing schemes. When considering applying Cognitive Radio to ad-hoc disaster relief networks, spectrum sensing cooperative schemes are paramount. A centralized cluster...

Spectrum Sensing Experimentation for LTE and WiFi Unlicensed Band Operation

Directory of Open Access Journals (Sweden)

N. Milošević

2016-11-01

Full Text Available If several different systems operate in the same frequency band, a coordination between them is needed for effective use of the available spectrum. The coordination is especially important if the systems are not designed to operate in such an environment. The very important initial phase of the coordination process is acquiring of the spectrum usage map or spectrum sensing. The paper describes the spectrum sensing experimentation in the unlicensed 5 GHz band during the WiFi or LTE transmission. It describes the experiment workflow and depicts the obtained results. The experiments were performed at NITOS testbed at the University of Thessaly, Greece, and show that it is possible to determine whether WiFi or LTE transmission is sensed. Therefore, based on spectrum sensing it will be possible to coordinate a shared access of WiFi and LTE users in the unlicensed 5 GHz band.

Performance of Cooperative Spectrum Sensing over Non-Identical Fading Environments

KAUST Repository

Rao, Anlei; Alouini, Mohamed-Slim

2012-01-01

Different from previous works in cooperative spec- trum sensing that assumed the sensing channels independent identically distributed (i.i.d.), we investigate in this paper the independent but not identically distributed (i.n.i.d.) situations. In particular, we derive the false-alarm probability and the detection probability of cooperative spectrum sensing with the scheme of energy fusion over i.n.i.d. Rayleigh, Nakagami, and Rician fading channels. From the selected numerical results, we can see that cooperative spectrum sensing still gives considerably better performance even over i.n.i.d. fading environments.

Performance of Cooperative Spectrum Sensing over Non-Identical Fading Environments

KAUST Repository

Rao, Anlei

2012-09-08

Different from previous works in cooperative spec- trum sensing that assumed the sensing channels independent identically distributed (i.i.d.), we investigate in this paper the independent but not identically distributed (i.n.i.d.) situations. In particular, we derive the false-alarm probability and the detection probability of cooperative spectrum sensing with the scheme of energy fusion over i.n.i.d. Rayleigh, Nakagami, and Rician fading channels. From the selected numerical results, we can see that cooperative spectrum sensing still gives considerably better performance even over i.n.i.d. fading environments.

Experimental scheme and restoration algorithm of block compression sensing

Science.gov (United States)

Zhang, Linxia; Zhou, Qun; Ke, Jun

2018-01-01

Compressed Sensing (CS) can use the sparseness of a target to obtain its image with much less data than that defined by the Nyquist sampling theorem. In this paper, we study the hardware implementation of a block compression sensing system and its reconstruction algorithms. Different block sizes are used. Two algorithms, the orthogonal matching algorithm (OMP) and the full variation minimum algorithm (TV) are used to obtain good reconstructions. The influence of block size on reconstruction is also discussed.

Remote sensing with laser spectrum radar

Science.gov (United States)

Wang, Tianhe; Zhou, Tao; Jia, Xiaodong

2016-10-01

The unmanned airborne (UAV) laser spectrum radar has played a leading role in remote sensing because the transmitter and the receiver are together at laser spectrum radar. The advantages of the integrated transceiver laser spectrum radar is that it can be used in the oil and gas pipeline leak detection patrol line which needs the non-contact reflective detection. The UAV laser spectrum radar can patrol the line and specially detect the swept the area are now in no man's land because most of the oil and gas pipelines are in no man's land. It can save labor costs compared to the manned aircraft and ensure the safety of the pilots. The UAV laser spectrum radar can be also applied in the post disaster relief which detects the gas composition before the firefighters entering the scene of the rescue.

Achieving Efficient Spectrum Usage in Passive and Active Sensing

Science.gov (United States)

Wang, Huaiyi

Increasing demand for supporting more wireless services with higher performance and reliability within the frequency bands that are most conducive to operating cost-effective cellular and mobile broadband is aggravating current electromagnetic spectrum congestion. This situation motivates technology and management innovation to increase the efficiency of spectral use. If primary-secondary spectrum sharing can be shown possible without compromising (or while even improving) performance in an existing application, opportunities for efficiency may be realizable by making the freed spectrum available for commercial use. While both active and passive sensing systems are vitally important for many public good applications, opportunities for increasing the efficiency of spectrum use can be shown to exist for both systems. This dissertation explores methods and technologies for remote sensing systems that enhance spectral efficiency and enable dynamic spectrum access both within and outside traditionally allocated bands.

Upper bounds for Neyman-Pearson cooperative spectrum sensing

KAUST Repository

Zahabi, Sayed Jalal; Tadaion, Ali Akbar; Aissa, Sonia

2011-01-01

We consider a cooperative spectrum sensing scenario where the local sensors at the secondary users are viewed as one-level quantizers, and the quantized data are to be fused under Neyman-Pearson (N-P) criterion. We demonstrate how the N-P fusion results in a randomized test, which represents the total performance of our spectrum sensing scheme. We further introduce an upper performance bound for the overall primary user signal detection. An analytical procedure towards the upper bound and its relevant quantization setup at the local sensors are proposed and examined through simulations. © 2011 IEEE.

Upper bounds for Neyman-Pearson cooperative spectrum sensing

KAUST Repository

Zahabi, Sayed Jalal

2011-06-01

We consider a cooperative spectrum sensing scenario where the local sensors at the secondary users are viewed as one-level quantizers, and the quantized data are to be fused under Neyman-Pearson (N-P) criterion. We demonstrate how the N-P fusion results in a randomized test, which represents the total performance of our spectrum sensing scheme. We further introduce an upper performance bound for the overall primary user signal detection. An analytical procedure towards the upper bound and its relevant quantization setup at the local sensors are proposed and examined through simulations. © 2011 IEEE.

Hard Fusion Based Spectrum Sensing over Mobile Fading Channels in Cognitive Vehicular Networks.

Science.gov (United States)

Qian, Xiaomin; Hao, Li; Ni, Dadong; Tran, Quang Thanh

2018-02-06

An explosive growth in vehicular wireless applications gives rise to spectrum resource starvation. Cognitive radio has been used in vehicular networks to mitigate the impending spectrum starvation problem by allowing vehicles to fully exploit spectrum opportunities unoccupied by licensed users. Efficient and effective detection of licensed user is a critical issue to realize cognitive radio applications. However, spectrum sensing in vehicular environments is a very challenging task due to vehicle mobility. For instance, vehicle mobility has a large effect on the wireless channel, thereby impacting the detection performance of spectrum sensing. Thus, gargantuan efforts have been made in order to analyze the fading properties of mobile radio channel in vehicular environments. Indeed, numerous studies have demonstrated that the wireless channel in vehicular environments can be characterized by a temporally correlated Rayleigh fading. In this paper, we focus on energy detection for spectrum sensing and a counting rule for cooperative sensing based on Neyman-Pearson criteria. Further, we go into the effect of the sensing and reporting channel conditions on the sensing performance under the temporally correlated Rayleigh channel. For local and cooperative sensing, we derive some alternative expressions for the average probability of misdetection. The pertinent numerical and simulating results are provided to further validate our theoretical analyses under a variety of scenarios.

Digital FMCW for ultrawideband spectrum sensing

Science.gov (United States)

Cheema, A. A.; Salous, S.

2016-08-01

An ultrawideband digital frequency-modulated continuous wave sensing engine is proposed as an alternative technique for cognitive radio applications. A dual-band demonstrator capable of sensing 750 MHz bandwidth in 204.8 µs is presented. Its performance is illustrated from both bench tests and from real-time measurements of the GSM 900 band and the 2.4 GHz wireless local area network (WLAN) band. The measured sensitivity and noise figure values are -90 dBm for a signal-to-noise ratio margin of at least 10 dB and ~13-14 dB, respectively. Data were collected over 24 h and were analyzed by using the energy detection method. The obtained results show the time variability of occupancy, and considerable sections of the spectrum are unoccupied. In addition, unlike the cyclic temporal variations of spectrum occupancy in the GSM 900 band, the detected variations in the 2.4 GHz WLAN band have an impulsive nature.

The Spectrum Analysis Solution (SAS) System: Theoretical Analysis, Hardware Design and Implementation.

Science.gov (United States)

Narayanan, Ram M; Pooler, Richard K; Martone, Anthony F; Gallagher, Kyle A; Sherbondy, Kelly D

2018-02-22

This paper describes a multichannel super-heterodyne signal analyzer, called the Spectrum Analysis Solution (SAS), which performs multi-purpose spectrum sensing to support spectrally adaptive and cognitive radar applications. The SAS operates from ultrahigh frequency (UHF) to the S-band and features a wideband channel with eight narrowband channels. The wideband channel acts as a monitoring channel that can be used to tune the instantaneous band of the narrowband channels to areas of interest in the spectrum. The data collected from the SAS has been utilized to develop spectrum sensing algorithms for the budding field of spectrum sharing (SS) radar. Bandwidth (BW), average total power, percent occupancy (PO), signal-to-interference-plus-noise ratio (SINR), and power spectral entropy (PSE) have been examined as metrics for the characterization of the spectrum. These metrics are utilized to determine a contiguous optimal sub-band (OSB) for a SS radar transmission in a given spectrum for different modalities. Three OSB algorithms are presented and evaluated: the spectrum sensing multi objective (SS-MO), the spectrum sensing with brute force PSE (SS-BFE), and the spectrum sensing multi-objective with brute force PSE (SS-MO-BFE).

Cluster-based spectrum sensing for cognitive radios with imperfect channel to cluster-head

KAUST Repository

Ben Ghorbel, Mahdi

2012-04-01

Spectrum sensing is considered as the first and main step for cognitive radio systems to achieve an efficient use of spectrum. Cooperation and clustering among cognitive radio users are two techniques that can be employed with spectrum sensing in order to improve the sensing performance by reducing miss-detection and false alarm. In this paper, within the framework of a clustering-based cooperative spectrum sensing scheme, we study the effect of errors in transmitting the local decisions from the secondary users to the cluster heads (or the fusion center), while considering non-identical channel conditions between the secondary users. Closed-form expressions for the global probabilities of detection and false alarm at the cluster head are derived. © 2012 IEEE.

Cluster-based spectrum sensing for cognitive radios with imperfect channel to cluster-head

KAUST Repository

Ben Ghorbel, Mahdi; Nam, Haewoon; Alouini, Mohamed-Slim

2012-01-01

Spectrum sensing is considered as the first and main step for cognitive radio systems to achieve an efficient use of spectrum. Cooperation and clustering among cognitive radio users are two techniques that can be employed with spectrum sensing in order to improve the sensing performance by reducing miss-detection and false alarm. In this paper, within the framework of a clustering-based cooperative spectrum sensing scheme, we study the effect of errors in transmitting the local decisions from the secondary users to the cluster heads (or the fusion center), while considering non-identical channel conditions between the secondary users. Closed-form expressions for the global probabilities of detection and false alarm at the cluster head are derived. © 2012 IEEE.

Analysis of Practical Implementation for Secure Spectrum Sensing in Cognitive Radio Networks

DEFF Research Database (Denmark)

Ivanov, Antoni; Mihovska, Albena Dimitrova; Tonchev, Krasimir

2017-01-01

Spectrum sensing is vitally important functionality for the cognitive radio (CR) device because it allows for assessing, which part of the spectrum is unoccupied and suitable for temporal use. Most of the proposed research efforts until now have been based on theoretical findings about the perfor......Spectrum sensing is vitally important functionality for the cognitive radio (CR) device because it allows for assessing, which part of the spectrum is unoccupied and suitable for temporal use. Most of the proposed research efforts until now have been based on theoretical findings about...

Soft cooperative spectrum sensing performance under imperfect and non identical reporting channels

KAUST Repository

Ben Ghorbel, Mahdi

2015-02-01

Cooperation among cognitive radio users improves the spectrum sensing performance by combining local decisions measured over independent sensing channels, allowing reduction of miss-detection and false alarm probabilities. While most of the works in cooperative spectrum sensing techniques assume perfect channels between the cooperating users, this paper studies the effect of imperfect channels when local users report their sensed information to the fusion center. Cooperative detection and false-alarm probabilities are derived for a general scheme of imperfect reporting channels under non necessarily identical sensing and reporting channels. Numerical simulations show that imperfect reporting channels should be considered to optimize the cooperative sensing in terms of consumed energy and probability of error.

Linear Algorithms for Radioelectric Spectrum Forecast

Directory of Open Access Journals (Sweden)

Luis F. Pedraza

2016-12-01

Full Text Available This paper presents the development and evaluation of two linear algorithms for forecasting reception power for different channels at an assigned spectrum band of global systems for mobile communications (GSM, in order to analyze the spatial opportunity for reuse of frequencies by secondary users (SUs in a cognitive radio (CR network. The algorithms employed correspond to seasonal autoregressive integrated moving average (SARIMA and generalized autoregressive conditional heteroskedasticity (GARCH, which allow for a forecast of channel occupancy status. Results are evaluated using the following criteria: availability and occupancy time for channels, different types of mean absolute error, and observation time. The contributions of this work include a more integral forecast as the algorithm not only forecasts reception power but also the occupancy and availability time of a channel to determine its precision percentage during the use by primary users (PUs and SUs within a CR system. Algorithm analyses demonstrate a better performance for SARIMA over GARCH algorithm in most of the evaluated variables.

Green Cooperative Spectrum Sensing and Scheduling in Heterogeneous Cognitive Radio Networks

KAUST Repository

Celik, Abdulkadir

2016-09-12

In this paper, we consider heterogeneous cognitive radio networks (CRNs) comprising primary channels (PCs) with heterogeneous characteristics and secondary users (SUs) with various sensing and reporting qualities for different PCs. We first define the opportunity as the achievable total data rate and its cost as the energy consumption caused from sensing, reporting, and channel switching operations and formulate a joint spectrum discovery and energy efficiency objective to minimize the energy spent per unit of data rate. Then, a mixed integer nonlinear programming problem is formulated to determine: 1) the optimal subset of PCs to be scheduled for sensing; 2) the SU assignment set for each scheduled PC; and 3) sensing durations and detection thresholds of each SU on PCs it is assigned to sense. Thereafter, an equivalent convex framework is developed for specific instances of the above combinatorial problem. For comparison, optimal detection and sensing thresholds are also derived analytically under the homogeneity assumption. Based on these, a prioritized ordering heuristic is developed to order channels under the spectrum, energy, and spectrum-energy limited regimes. After that, a scheduling and assignment heuristic is proposed and is shown to perform very close to the exhaustive optimal solution. Finally, the behavior of the CRN is numerically analyzed under these regimes with respect to different numbers of SUs, PCs, and sensing qualities.

Experimental Validation of Advanced Dispersed Fringe Sensing (ADFS) Algorithm Using Advanced Wavefront Sensing and Correction Testbed (AWCT)

Science.gov (United States)

Wang, Xu; Shi, Fang; Sigrist, Norbert; Seo, Byoung-Joon; Tang, Hong; Bikkannavar, Siddarayappa; Basinger, Scott; Lay, Oliver

2012-01-01

Large aperture telescope commonly features segment mirrors and a coarse phasing step is needed to bring these individual segments into the fine phasing capture range. Dispersed Fringe Sensing (DFS) is a powerful coarse phasing technique and its alteration is currently being used for JWST.An Advanced Dispersed Fringe Sensing (ADFS) algorithm is recently developed to improve the performance and robustness of previous DFS algorithms with better accuracy and unique solution. The first part of the paper introduces the basic ideas and the essential features of the ADFS algorithm and presents the some algorithm sensitivity study results. The second part of the paper describes the full details of algorithm validation process through the advanced wavefront sensing and correction testbed (AWCT): first, the optimization of the DFS hardware of AWCT to ensure the data accuracy and reliability is illustrated. Then, a few carefully designed algorithm validation experiments are implemented, and the corresponding data analysis results are shown. Finally the fiducial calibration using Range-Gate-Metrology technique is carried out and a <10nm or <1% algorithm accuracy is demonstrated.

Geometry correction Algorithm for UAV Remote Sensing Image Based on Improved Neural Network

Science.gov (United States)

Liu, Ruian; Liu, Nan; Zeng, Beibei; Chen, Tingting; Yin, Ninghao

2018-03-01

Aiming at the disadvantage of current geometry correction algorithm for UAV remote sensing image, a new algorithm is proposed. Adaptive genetic algorithm (AGA) and RBF neural network are introduced into this algorithm. And combined with the geometry correction principle for UAV remote sensing image, the algorithm and solving steps of AGA-RBF are presented in order to realize geometry correction for UAV remote sensing. The correction accuracy and operational efficiency is improved through optimizing the structure and connection weight of RBF neural network separately with AGA and LMS algorithm. Finally, experiments show that AGA-RBF algorithm has the advantages of high correction accuracy, high running rate and strong generalization ability.

Distributed Schemes for Crowdsourcing-Based Sensing Task Assignment in Cognitive Radio Networks

Directory of Open Access Journals (Sweden)

Linbo Zhai

2017-01-01

Full Text Available Spectrum sensing is an important issue in cognitive radio networks. The unlicensed users can access the licensed wireless spectrum only when the licensed wireless spectrum is sensed to be idle. Since mobile terminals such as smartphones and tablets are popular among people, spectrum sensing can be assigned to these mobile intelligent terminals, which is called crowdsourcing method. Based on the crowdsourcing method, this paper studies the distributed scheme to assign spectrum sensing task to mobile terminals such as smartphones and tablets. Considering the fact that mobile terminals’ positions may influence the sensing results, a precise sensing effect function is designed for the crowdsourcing-based sensing task assignment. We aim to maximize the sensing effect function and cast this optimization problem to address crowdsensing task assignment in cognitive radio networks. This problem is difficult to be solved because the complexity of this problem increases exponentially with the growth in mobile terminals. To assign crowdsensing task, we propose four distributed algorithms with different transition probabilities and use a Markov chain to analyze the approximation gap of our proposed schemes. Simulation results evaluate the average performance of our proposed algorithms and validate the algorithm’s convergence.

Multicarrier Spread Spectrum Modulation Schemes and Efficient FFT Algorithms for Cognitive Radio Systems

Directory of Open Access Journals (Sweden)

Mohandass Sundararajan

2014-07-01

Full Text Available Spread spectrum (SS and multicarrier modulation (MCM techniques are recognized as potential candidates for the design of underlay and interweave cognitive radio (CR systems, respectively. Direct Sequence Code Division Multiple Access (DS-CDMA is a spread spectrum technique generally used in underlay CR systems. Orthogonal Frequency Division Multiplexing (OFDM is the basic MCM technique, primarily used in interweave CR systems. There are other MCM schemes derived from OFDM technique, like Non-Contiguous OFDM, Spread OFDM, and OFDM-OQAM, which are more suitable for CR systems. Multicarrier Spread Spectrum Modulation (MCSSM schemes like MC-CDMA, MC-DS-CDMA and SS-MC-CDMA, combine DS-CDMA and OFDM techniques in order to improve the CR system performance and adaptability. This article gives a detailed survey of the various spread spectrum and multicarrier modulation schemes proposed in the literature. Fast Fourier Transform (FFT plays a vital role in all the multicarrier modulation techniques. The FFT part of the modem can be used for spectrum sensing. The performance of the FFT operator plays a crucial role in the overall performance of the system. Since the cognitive radio is an adaptive system, the FFT operator must also be adaptive for various input/output values, in order to save energy and time taken for execution. This article also includes the various efficient FFT algorithms proposed in the literature, which are suitable for CR systems.

A Collaborative Approach for Monitoring Nodes Behavior during Spectrum Sensing to Mitigate Multiple Attacks in Cognitive Radio Networks

Directory of Open Access Journals (Sweden)

Mahmoud Khasawneh

2017-01-01

Full Text Available Spectrum sensing is the first step to overcome the spectrum scarcity problem in Cognitive Radio Networks (CRNs wherein all unutilized subbands in the radio environment are explored for better spectrum utilization. Adversary nodes can threaten these spectrum sensing results by launching passive and active attacks that prevent legitimate nodes from using the spectrum efficiently. Securing the spectrum sensing process has become an important issue in CRNs in order to ensure reliable and secure spectrum sensing and fair management of resources. In this paper, a novel collaborative approach during spectrum sensing process is proposed. It monitors the behavior of sensing nodes and identifies the malicious and misbehaving sensing nodes. The proposed approach measures the node’s sensing reliability using a value called belief level. All the sensing nodes are grouped into a specific number of clusters. In each cluster, a sensing node is selected as a cluster head that is responsible for collecting sensing-reputation reports from different cognitive nodes about each node in the same cluster. The cluster head analyzes information to monitor and judge the nodes’ behavior. By simulating the proposed approach, we showed its importance and its efficiency for achieving better spectrum security by mitigating multiple passive and active attacks.

Decentralized cooperative spectrum sensing for ad-hoc disaster relief network clusters

DEFF Research Database (Denmark)

Pratas, Nuno; Marchetti, Nicola; Prasad, Neeli R.

2010-01-01

cooperative schemes becomes essential. A cluster based decentralized orchestration cooperative sensing scheme is proposed, where each node in the cluster decides which spectrum it should monitor, according to the past sensing decisions of all the cluster nodes. The proposed scheme performance is evaluated...... through a framework, which allows gauging the accuracy of multi narrow-band spectrum sensing cooperative schemes as well as to gauge the error in the estimation of each of the channels un-occupancy. Through that evaluation it is shown that the proposed decentralized scheme performance reaches...... the performance of the correspondent centralized scheme while outperforming the Round Robin scheme....

A Novel Spectrum Scheduling Scheme with Ant Colony Optimization Algorithm

Directory of Open Access Journals (Sweden)

Liping Liu

2018-01-01

Full Text Available Cognitive radio is a promising technology for improving spectrum utilization, which allows cognitive users access to the licensed spectrum while primary users are absent. In this paper, we design a resource allocation framework based on graph theory for spectrum assignment in cognitive radio networks. The framework takes into account the constraints that interference for primary users and possible collision among cognitive users. Based on the proposed model, we formulate a system utility function to maximize the system benefit. Based on the proposed model and objective problem, we design an improved ant colony optimization algorithm (IACO from two aspects: first, we introduce differential evolution (DE process to accelerate convergence speed by monitoring mechanism; then we design a variable neighborhood search (VNS process to avoid the algorithm falling into the local optimal. Simulation results demonstrate that the improved algorithm achieves better performance.

Capacity limits introduced by data fusion on cooperative spectrum sensing under correlated environments

DEFF Research Database (Denmark)

Pratas, Nuno; Marchetti, Nicola; Rodrigues, Antonio

2010-01-01

spectrum sensing scheme, by measuring the perceived capacity limits introduced by the use of data fusion on cooperative sensing schemes. The analysis is supported by evaluation metrics which account for the perceived capacity limits. The analysis is performed along the data fusion chain, comparing several...... scenarios encompassing different degree of environment correlation between the cluster nodes, number of cluster nodes and sensed channel occupation statistics. Through this study we motivate that to maximize the perceived capacity by the cooperative spectrum sensing, the use of data fusion needs...

A Robust FLOM Based Spectrum Sensing Scheme under Middleton Class A Noise in IoT

Directory of Open Access Journals (Sweden)

Enwei Xu

2017-01-01

Full Text Available Accessibility to remote users in dynamic environment, high spectrum utilization, and no spectrum purchase make Cognitive Radio (CR a feasible solution of wireless communications in the Internet of Things (IoT. Reliable spectrum sensing becomes the prerequisite for the establishment of communication between IoT-capable objects. Considering the application environment, spectrum sensing not only has to cope with man-made impulsive noises but also needs to overcome noise fluctuations. In this paper, we study the Fractional Lower Order Moments (FLOM based spectrum sensing method under Middleton Class A noise and incorporate a Noise Power Estimation (NPE module into the sensing system to deal with the issue of noise uncertainty. Moreover, the NPE process does not need noise-only samples. The analytical expressions of the probabilities of detection and the probability of false alarm are derived. The impact on sensing performance of the parameters of the NPE module is also analyzed. The theoretical analysis and simulation results show that our proposed sensing method achieves a satisfactory performance at low SNR.

Securing Collaborative Spectrum Sensing against Untrustworthy Secondary Users in Cognitive Radio Networks

Science.gov (United States)

Wang, Wenkai; Li, Husheng; Sun, Yan(Lindsay); Han, Zhu

2009-12-01

Cognitive radio is a revolutionary paradigm to migrate the spectrum scarcity problem in wireless networks. In cognitive radio networks, collaborative spectrum sensing is considered as an effective method to improve the performance of primary user detection. For current collaborative spectrum sensing schemes, secondary users are usually assumed to report their sensing information honestly. However, compromised nodes can send false sensing information to mislead the system. In this paper, we study the detection of untrustworthy secondary users in cognitive radio networks. We first analyze the case when there is only one compromised node in collaborative spectrum sensing schemes. Then we investigate the scenario that there are multiple compromised nodes. Defense schemes are proposed to detect malicious nodes according to their reporting histories. We calculate the suspicious level of all nodes based on their reports. The reports from nodes with high suspicious levels will be excluded in decision-making. Compared with existing defense methods, the proposed scheme can effectively differentiate malicious nodes and honest nodes. As a result, it can significantly improve the performance of collaborative sensing. For example, when there are 10 secondary users, with the primary user detection rate being equal to 0.99, one malicious user can make the false alarm rate [InlineEquation not available: see fulltext.] increase to 72%. The proposed scheme can reduce it to 5%. Two malicious users can make [InlineEquation not available: see fulltext.] increase to 85% and the proposed scheme reduces it to 8%.

An Orthogonal Learning Differential Evolution Algorithm for Remote Sensing Image Registration

Directory of Open Access Journals (Sweden)

Wenping Ma

2014-01-01

Full Text Available We introduce an area-based method for remote sensing image registration. We use orthogonal learning differential evolution algorithm to optimize the similarity metric between the reference image and the target image. Many local and global methods have been used to achieve the optimal similarity metric in the last few years. Because remote sensing images are usually influenced by large distortions and high noise, local methods will fail in some cases. For this reason, global methods are often required. The orthogonal learning (OL strategy is efficient when searching in complex problem spaces. In addition, it can discover more useful information via orthogonal experimental design (OED. Differential evolution (DE is a heuristic algorithm. It has shown to be efficient in solving the remote sensing image registration problem. So orthogonal learning differential evolution algorithm (OLDE is efficient for many optimization problems. The OLDE method uses the OL strategy to guide the DE algorithm to discover more useful information. Experiments show that the OLDE method is more robust and efficient for registering remote sensing images.

Hard Decision Fusion based Cooperative Spectrum Sensing in Cognitive Radio System

Directory of Open Access Journals (Sweden)

N. Armi N.M. Saad

2013-09-01

Full Text Available Cooperative spectrum sensing was proposed to combat fading, noise uncertainty, shadowing, and even hidden node problem due to primary users (PUs activity that is not spatially localized. It improves the probability of detection by collaborating to detect PUs signal in cognitive radio (CR system as well. This paper studies cooperative spectrum sensing and signal detection in CR system by implementing hard decision combining in data fusion centre. Through computer simulation, we evaluate the performances of cooperative spectrum sensing and signal detection by employing OR and AND rules as decision combining. Energy detector is used to observe the presence of primary user (PU signal. Those results are compared to non-cooperative signal detection for evaluation. They show that cooperative technique has better performance than non-cooperative. Moreover, signal to noise ratio (SNR with greater than or equal 10 dB and 15 collaborated users in CR system has optimal value for probability of detection.

Secure Cooperative Spectrum Sensing for the Cognitive Radio Network Using Nonuniform Reliability

Directory of Open Access Journals (Sweden)

Muhammad Usman

2014-01-01

Full Text Available Both reliable detection of the primary signal in a noisy and fading environment and nullifying the effect of unauthorized users are important tasks in cognitive radio networks. To address these issues, we consider a cooperative spectrum sensing approach where each user is assigned nonuniform reliability based on the sensing performance. Users with poor channel or faulty sensor are assigned low reliability. The nonuniform reliabilities serve as identification tags and are used to isolate users with malicious behavior. We consider a link layer attack similar to the Byzantine attack, which falsifies the spectrum sensing data. Three different strategies are presented in this paper to ignore unreliable and malicious users in the network. Considering only reliable users for global decision improves sensing time and decreases collisions in the control channel. The fusion center uses the degree of reliability as a weighting factor to determine the global decision in scheme I. Schemes II and III consider the unreliability of users, which makes the computations even simpler. The proposed schemes reduce the number of sensing reports and increase the inference accuracy. The advantages of our proposed schemes over conventional cooperative spectrum sensing and the Chair-Varshney optimum rule are demonstrated through simulations.

Local Competition-Based Superpixel Segmentation Algorithm in Remote Sensing.

Science.gov (United States)

Liu, Jiayin; Tang, Zhenmin; Cui, Ying; Wu, Guoxing

2017-06-12

Remote sensing technologies have been widely applied in urban environments' monitoring, synthesis and modeling. Incorporating spatial information in perceptually coherent regions, superpixel-based approaches can effectively eliminate the "salt and pepper" phenomenon which is common in pixel-wise approaches. Compared with fixed-size windows, superpixels have adaptive sizes and shapes for different spatial structures. Moreover, superpixel-based algorithms can significantly improve computational efficiency owing to the greatly reduced number of image primitives. Hence, the superpixel algorithm, as a preprocessing technique, is more and more popularly used in remote sensing and many other fields. In this paper, we propose a superpixel segmentation algorithm called Superpixel Segmentation with Local Competition (SSLC), which utilizes a local competition mechanism to construct energy terms and label pixels. The local competition mechanism leads to energy terms locality and relativity, and thus, the proposed algorithm is less sensitive to the diversity of image content and scene layout. Consequently, SSLC could achieve consistent performance in different image regions. In addition, the Probability Density Function (PDF), which is estimated by Kernel Density Estimation (KDE) with the Gaussian kernel, is introduced to describe the color distribution of superpixels as a more sophisticated and accurate measure. To reduce computational complexity, a boundary optimization framework is introduced to only handle boundary pixels instead of the whole image. We conduct experiments to benchmark the proposed algorithm with the other state-of-the-art ones on the Berkeley Segmentation Dataset (BSD) and remote sensing images. Results demonstrate that the SSLC algorithm yields the best overall performance, while the computation time-efficiency is still competitive.

Comparison of RF spectrum prediction methods for dynamic spectrum access

Science.gov (United States)

Kovarskiy, Jacob A.; Martone, Anthony F.; Gallagher, Kyle A.; Sherbondy, Kelly D.; Narayanan, Ram M.

2017-05-01

Dynamic spectrum access (DSA) refers to the adaptive utilization of today's busy electromagnetic spectrum. Cognitive radio/radar technologies require DSA to intelligently transmit and receive information in changing environments. Predicting radio frequency (RF) activity reduces sensing time and energy consumption for identifying usable spectrum. Typical spectrum prediction methods involve modeling spectral statistics with Hidden Markov Models (HMM) or various neural network structures. HMMs describe the time-varying state probabilities of Markov processes as a dynamic Bayesian network. Neural Networks model biological brain neuron connections to perform a wide range of complex and often non-linear computations. This work compares HMM, Multilayer Perceptron (MLP), and Recurrent Neural Network (RNN) algorithms and their ability to perform RF channel state prediction. Monte Carlo simulations on both measured and simulated spectrum data evaluate the performance of these algorithms. Generalizing spectrum occupancy as an alternating renewal process allows Poisson random variables to generate simulated data while energy detection determines the occupancy state of measured RF spectrum data for testing. The results suggest that neural networks achieve better prediction accuracy and prove more adaptable to changing spectral statistics than HMMs given sufficient training data.

Local Competition-Based Superpixel Segmentation Algorithm in Remote Sensing

Directory of Open Access Journals (Sweden)

Jiayin Liu

2017-06-01

Full Text Available Remote sensing technologies have been widely applied in urban environments’ monitoring, synthesis and modeling. Incorporating spatial information in perceptually coherent regions, superpixel-based approaches can effectively eliminate the “salt and pepper” phenomenon which is common in pixel-wise approaches. Compared with fixed-size windows, superpixels have adaptive sizes and shapes for different spatial structures. Moreover, superpixel-based algorithms can significantly improve computational efficiency owing to the greatly reduced number of image primitives. Hence, the superpixel algorithm, as a preprocessing technique, is more and more popularly used in remote sensing and many other fields. In this paper, we propose a superpixel segmentation algorithm called Superpixel Segmentation with Local Competition (SSLC, which utilizes a local competition mechanism to construct energy terms and label pixels. The local competition mechanism leads to energy terms locality and relativity, and thus, the proposed algorithm is less sensitive to the diversity of image content and scene layout. Consequently, SSLC could achieve consistent performance in different image regions. In addition, the Probability Density Function (PDF, which is estimated by Kernel Density Estimation (KDE with the Gaussian kernel, is introduced to describe the color distribution of superpixels as a more sophisticated and accurate measure. To reduce computational complexity, a boundary optimization framework is introduced to only handle boundary pixels instead of the whole image. We conduct experiments to benchmark the proposed algorithm with the other state-of-the-art ones on the Berkeley Segmentation Dataset (BSD and remote sensing images. Results demonstrate that the SSLC algorithm yields the best overall performance, while the computation time-efficiency is still competitive.

Distributed optical fiber vibration sensing using phase-generated carrier demodulation algorithm

Science.gov (United States)

Yu, Zhihua; Zhang, Qi; Zhang, Mingyu; Dai, Haolong; Zhang, Jingjing; Liu, Li; Zhang, Lijun; Jin, Xing; Wang, Gaifang; Qi, Guang

2018-05-01

A novel optical fiber-distributed vibration-sensing system is proposed, which is based on self-interference of Rayleigh backscattering with phase-generated carrier (PGC) demodulation algorithm. Pulsed lights are sent into the sensing fiber and the Rayleigh backscattering light from a certain position along the sensing fiber would interfere through an unbalanced Michelson interferometry to generate the interference light. An improved PGC demodulation algorithm is carried out to recover the phase information of the interference signal, which carries the sensing information. Three vibration events were applied simultaneously to different positions over 2000 m sensing fiber and demodulated correctly. The spatial resolution is 10 m, and the noise level of the Φ-OTDR system we proposed is about 10-3 rad/\\surd {Hz}, and the signal-to-noise ratio is about 30.34 dB.

Throughput Maximization Using an SVM for Multi-Class Hypothesis-Based Spectrum Sensing in Cognitive Radio

Directory of Open Access Journals (Sweden)

Sana Ullah Jan

2018-03-01

Full Text Available A framework of spectrum sensing with a multi-class hypothesis is proposed to maximize the achievable throughput in cognitive radio networks. The energy range of a sensing signal under the hypothesis that the primary user is absent (in a conventional two-class hypothesis is further divided into quantized regions, whereas the hypothesis that the primary user is present is conserved. The non-radio frequency energy harvesting-equiped secondary user transmits, when the primary user is absent, with transmission power based on the hypothesis result (the energy level of the sensed signal and the residual energy in the battery: the lower the energy of the received signal, the higher the transmission power, and vice versa. Conversely, the lower is the residual energy in the node, the lower is the transmission power. This technique increases the throughput of a secondary link by providing a higher number of transmission events, compared to the conventional two-class hypothesis. Furthermore, transmission with low power for higher energy levels in the sensed signal reduces the probability of interference with primary users if, for instance, detection was missed. The familiar machine learning algorithm known as a support vector machine (SVM is used in a one-versus-rest approach to classify the input signal into predefined classes. The input signal to the SVM is composed of three statistical features extracted from the sensed signal and a number ranging from 0 to 100 representing the percentage of residual energy in the node’s battery. To increase the generalization of the classifier, k-fold cross-validation is utilized in the training phase. The experimental results show that an SVM with the given features performs satisfactorily for all kernels, but an SVM with a polynomial kernel outperforms linear and radial-basis function kernels in terms of accuracy. Furthermore, the proposed multi-class hypothesis achieves higher throughput compared to the

A combined spectrum sensing and OFDM demodulation scheme

NARCIS (Netherlands)

Heskamp, M.; Slump, Cornelis H.

2009-01-01

In this paper we propose a combined signaling and spectrum sensing scheme for cognitive radio that can detect in-band primary users while the networks own signal is active. The signaling scheme uses OFDM with phase shift keying modulated sub-carriers, and the detection scheme measures the deviation

Soft cooperative spectrum sensing performance under imperfect and non identical reporting channels

KAUST Repository

Ben Ghorbel, Mahdi; Nam, Haewoon; Alouini, Mohamed-Slim

2015-01-01

in cooperative spectrum sensing techniques assume perfect channels between the cooperating users, this paper studies the effect of imperfect channels when local users report their sensed information to the fusion center. Cooperative detection and false

Blind spectrum reconstruction algorithm with L0-sparse representation

International Nuclear Information System (INIS)

Liu, Hai; Zhang, Zhaoli; Liu, Sanyan; Shu, Jiangbo; Liu, Tingting; Zhang, Tianxu

2015-01-01

Raman spectrum often suffers from band overlap and Poisson noise. This paper presents a new blind Poissonian Raman spectrum reconstruction method, which incorporates the L 0 -sparse prior together with the total variation constraint into the maximum a posteriori framework. Furthermore, the greedy analysis pursuit algorithm is adopted to solve the L 0 -based minimization problem. Simulated and real spectrum experimental results show that the proposed method can effectively preserve spectral structure and suppress noise. The reconstructed Raman spectra are easily used for interpreting unknown chemical mixtures. (paper)

A CR Spectrum Allocation Algorithm in Smart Grid Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Wei He

2014-10-01

Full Text Available Cognitive radio (CR method was introduced in smart grid communication systems to resolve potential maladies such as the coexistence of heterogeneous networks, overloaded data flow, diversity in data structures, and unstable quality of service (QOS. In this paper, a cognitive spectrum allocation algorithm based on non-cooperative game theory is proposed. The CR spectrum allocation model was developed by modifying the traditional game model via the insertion of a time variable and a critical function. The computing simulation result shows that the improved spectrum allocation algorithm can achieve stable spectrum allocation strategies and avoid the appearance of multi-Nash equilibrium at the expense of certain sacrifices in the system utility. It is suitable for application in distributed cognitive networks in power grids, thus contributing to the improvement of the isomerism and data capacity of power communication systems.

A Multi-Band Analytical Algorithm for Deriving Absorption and Backscattering Coefficients from Remote-Sensing Reflectance of Optically Deep Waters

Science.gov (United States)

Lee, Zhong-Ping; Carder, Kendall L.

2001-01-01

A multi-band analytical (MBA) algorithm is developed to retrieve absorption and backscattering coefficients for optically deep waters, which can be applied to data from past and current satellite sensors, as well as data from hyperspectral sensors. This MBA algorithm applies a remote-sensing reflectance model derived from the Radiative Transfer Equation, and values of absorption and backscattering coefficients are analytically calculated from values of remote-sensing reflectance. There are only limited empirical relationships involved in the algorithm, which implies that this MBA algorithm could be applied to a wide dynamic range of waters. Applying the algorithm to a simulated non-"Case 1" data set, which has no relation to the development of the algorithm, the percentage error for the total absorption coefficient at 440 nm a (sub 440) is approximately 12% for a range of 0.012 - 2.1 per meter (approximately 6% for a (sub 440) less than approximately 0.3 per meter), while a traditional band-ratio approach returns a percentage error of approximately 30%. Applying it to a field data set ranging from 0.025 to 2.0 per meter, the result for a (sub 440) is very close to that using a full spectrum optimization technique (9.6% difference). Compared to the optimization approach, the MBA algorithm cuts the computation time dramatically with only a small sacrifice in accuracy, making it suitable for processing large data sets such as satellite images. Significant improvements over empirical algorithms have also been achieved in retrieving the optical properties of optically deep waters.

Parallel-Computing Architecture for JWST Wavefront-Sensing Algorithms

Science.gov (United States)

2011-09-01

results due to the increasing cost and complexity of each test. 2. ALGORITHM OVERVIEW Phase retrieval is an image-based wavefront-sensing...broadband illumination problems we have found that hand-tuning the right matrix sizes can account for a speedup of 86x faster. This comes from hand-picking...Wavefront Sensing and Control”. Proceedings of SPIE (2007) vol. 6687 (08). [5] Greenhouse, M. A., Drury , M. P., Dunn, J. L., Glazer, S. D., Greville, E

Learning Frameworks for Cooperative Spectrum Sensing and Energy-Efficient Data Protection in Cognitive Radio Networks

Directory of Open Access Journals (Sweden)

Vinh Quang Do

2018-05-01

Full Text Available This paper studies learning frameworks for energy-efficient data communications in an energy-harvesting cognitive radio network in which secondary users (SUs harvest energy from solar power while opportunistically accessing a licensed channel for data transmission. The SUs perform spectrum sensing individually, and send local decisions about the presence of the primary user (PU on the channel to a fusion center (FC. We first design a new cooperative spectrum-sensing technique based on a convolutional neural network in which the FC uses historical sensing data to train the network for classification problem. The system is assumed to operate in a time-slotted manner. At the beginning of each time slot, the FC uses the current local decisions as input for the trained network to decide whether the PU is active or not in that time slot. In addition, legitimate transmissions can be vulnerable to a hidden eavesdropper, which always passively listens to the communication. Therefore, we further propose a transfer learning actor–critic algorithm for an SU to decide its operation mode to increase the security level under the constraint of limited energy. In this approach, the SU directly interacts with the environment to learn its dynamics (i.e., an arrival of harvested energy; then, the SU can either stay idle to save energy or transmit to the FC secured data that are encrypted using a suitable private-key encryption method to maximize the long-term effective security level of the network. We finally present numerical simulation results under various configurations to evaluate our proposed schemes.

An improved optimum-path forest clustering algorithm for remote sensing image segmentation

Science.gov (United States)

Chen, Siya; Sun, Tieli; Yang, Fengqin; Sun, Hongguang; Guan, Yu

2018-03-01

Remote sensing image segmentation is a key technology for processing remote sensing images. The image segmentation results can be used for feature extraction, target identification and object description. Thus, image segmentation directly affects the subsequent processing results. This paper proposes a novel Optimum-Path Forest (OPF) clustering algorithm that can be used for remote sensing segmentation. The method utilizes the principle that the cluster centres are characterized based on their densities and the distances between the centres and samples with higher densities. A new OPF clustering algorithm probability density function is defined based on this principle and applied to remote sensing image segmentation. Experiments are conducted using five remote sensing land cover images. The experimental results illustrate that the proposed method can outperform the original OPF approach.

[An operational remote sensing algorithm of land surface evapotranspiration based on NOAA PAL dataset].

Science.gov (United States)

Hou, Ying-Yu; He, Yan-Bo; Wang, Jian-Lin; Tian, Guo-Liang

2009-10-01

Based on the time series 10-day composite NOAA Pathfinder AVHRR Land (PAL) dataset (8 km x 8 km), and by using land surface energy balance equation and "VI-Ts" (vegetation index-land surface temperature) method, a new algorithm of land surface evapotranspiration (ET) was constructed. This new algorithm did not need the support from meteorological observation data, and all of its parameters and variables were directly inversed or derived from remote sensing data. A widely accepted ET model of remote sensing, i. e., SEBS model, was chosen to validate the new algorithm. The validation test showed that both the ET and its seasonal variation trend estimated by SEBS model and our new algorithm accorded well, suggesting that the ET estimated from the new algorithm was reliable, being able to reflect the actual land surface ET. The new ET algorithm of remote sensing was practical and operational, which offered a new approach to study the spatiotemporal variation of ET in continental scale and global scale based on the long-term time series satellite remote sensing images.

A localized cooperative wideband spectrum sensing for dynamic access of TV bands using RF sensor networks

KAUST Repository

Mirza, Mohammed; Alouini, Mohamed-Slim

2011-01-01

In this paper we address and simulate a Radio Frequency (RF) sensor network for a cooperative spectrum sensing and localization scheme. The proposed method integrates a Wavelet based Multi-Resolution Spectrum Sensing (MRSS), an N-bit hard

An adaptive tensor voting algorithm combined with texture spectrum

Science.gov (United States)

Wang, Gang; Su, Qing-tang; Lü, Gao-huan; Zhang, Xiao-feng; Liu, Yu-huan; He, An-zhi

2015-01-01

An adaptive tensor voting algorithm combined with texture spectrum is proposed. The image texture spectrum is used to get the adaptive scale parameter of voting field. Then the texture information modifies both the attenuation coefficient and the attenuation field so that we can use this algorithm to create more significant and correct structures in the original image according to the human visual perception. At the same time, the proposed method can improve the edge extraction quality, which includes decreasing the flocculent region efficiently and making image clear. In the experiment for extracting pavement cracks, the original pavement image is processed by the proposed method which is combined with the significant curve feature threshold procedure, and the resulted image displays the faint crack signals submerged in the complicated background efficiently and clearly.

47 CFR 15.717 - TVBDs that rely on spectrum sensing.

Science.gov (United States)

2010-10-01

... Television Band Devices § 15.717 TVBDs that rely on spectrum sensing. (a) Parties may submit applications for... that are identical in electrical characteristics and antenna systems may be certified under the...

On Transform Domain Communication Systems under Spectrum Sensing Mismatch: A Deterministic Analysis.

Science.gov (United States)

Jin, Chuanxue; Hu, Su; Huang, Yixuan; Luo, Qu; Huang, Dan; Li, Yi; Gao, Yuan; Cheng, Shaochi

2017-07-08

Towards the era of mobile Internet and the Internet of Things (IoT), numerous sensors and devices are being introduced and interconnected. To support such an amount of data traffic, traditional wireless communication technologies are facing challenges both in terms of the increasing shortage of spectrum resources and massive multiple access. The transform-domain communication system (TDCS) is considered as an alternative multiple access system, where 5G and mobile IoT are mainly focused. However, previous studies about TDCS are under the assumption that the transceiver has the global spectrum information, without the consideration of spectrum sensing mismatch (SSM). In this paper, we present the deterministic analysis of TDCS systems under arbitrary given spectrum sensing scenarios, especially the influence of the SSM pattern to the signal to noise ratio (SNR) performance. Simulation results show that arbitrary SSM pattern can lead to inferior bit error rate (BER) performance.

Outage Analysis of Spectrum-Sharing over M-Block Fading with Sensing Information

KAUST Repository

Alabbasi, Abdulrahman

2016-07-13

Future wireless technologies, such as, 5G, are expected to support real-time applications with high data throughput, e.g., holographic meetings. From a bandwidth perspective, cognitive radio is a promising technology to enhance the system’s throughput via sharing the licensed spectrum. From a delay perspective, it is well known that increasing the number of decoding blocks will improve the system robustness against errors, while increasing the delay. Therefore, optimally allocating the resources to determine the tradeoff of tuning the length of decoding blocks while sharing the spectrum is a critical challenge for future wireless systems. In this work, we minimize the targeted outage probability over the block-fading channels while utilizing the spectrum-sharing concept. The secondary user’s outage region and the corresponding optimal power are derived, over twoblocks and M-blocks fading channels. We propose two suboptimal power strategies and derive the associated asymptotic lower and upper bounds on the outage probability with tractable expressions. These bounds allow us to derive the exact diversity order of the secondary user’s outage probability. To further enhance the system’s performance, we also investigate the impact of including the sensing information on the outage problem. The outage problem is then solved via proposing an alternating optimization algorithm, which utilizes the verified strict quasiconvex structure of the problem. Selected numerical results are presented to characterize the system’s behavior and show the improvements of several sharing concepts.

Self-organized spectrum chunk selection algorithm for Local Area LTE-Advanced

DEFF Research Database (Denmark)

Kumar, Sanjay; Wang, Yuanye; Marchetti, Nicola

2010-01-01

This paper presents a self organized spectrum chunk selection algorithm in order to minimize the mutual intercell interference among Home Node Bs (HeNBs), aiming to improve the system throughput performance compared to the existing frequency reuse one scheme. The proposed algorithm is useful...

PERFORMANCE OF OPPORTUNISTIC SPECTRUM ACCESS WITH SENSING ERROR IN COGNITIVE RADIO AD HOC NETWORKS

Directory of Open Access Journals (Sweden)

N. ARMI

2012-04-01

Full Text Available Sensing in opportunistic spectrum access (OSA has a responsibility to detect the available channel by performing binary hypothesis as busy or idle states. If channel is busy, secondary user (SU cannot access and refrain from data transmission. SU is allowed to access when primary user (PU does not use it (idle states. However, channel is sensed on imperfect communication link. Fading, noise and any obstacles existed can cause sensing errors in PU signal detection. False alarm detects idle states as a busy channel while miss-identification detects busy states as an idle channel. False detection makes SU refrain from transmission and reduces number of bits transmitted. On the other hand, miss-identification causes SU collide to PU transmission. This paper study the performance of OSA based on the greedy approach with sensing errors by the restriction of maximum collision probability allowed (collision threshold by PU network. The throughput of SU and spectrum capacity metric is used to evaluate OSA performance and make comparisons to those ones without sensing error as function of number of slot based on the greedy approach. The relations between throughput and signal to noise ratio (SNR with different collision probability as well as false detection with different SNR are presented. According to the obtained results show that CR users can gain the reward from the previous slot for both of with and without sensing errors. It is indicated by the throughput improvement as slot number increases. However, sensing on imperfect channel with sensing errors can degrade the throughput performance. Subsequently, the throughput of SU and spectrum capacity improves by increasing maximum collision probability allowed by PU network as well. Due to frequent collision with PU, the throughput of SU and spectrum capacity decreases at certain value of collision threshold. Computer simulation is used to evaluate and validate these works.

EMD self-adaptive selecting relevant modes algorithm for FBG spectrum signal

Science.gov (United States)

Chen, Yong; Wu, Chun-ting; Liu, Huan-lin

2017-07-01

Noise may reduce the demodulation accuracy of fiber Bragg grating (FBG) sensing signal so as to affect the quality of sensing detection. Thus, the recovery of a signal from observed noisy data is necessary. In this paper, a precise self-adaptive algorithm of selecting relevant modes is proposed to remove the noise of signal. Empirical mode decomposition (EMD) is first used to decompose a signal into a set of modes. The pseudo modes cancellation is introduced to identify and eliminate false modes, and then the Mutual Information (MI) of partial modes is calculated. MI is used to estimate the critical point of high and low frequency components. Simulation results show that the proposed algorithm estimates the critical point more accurately than the traditional algorithms for FBG spectral signal. While, compared to the similar algorithms, the signal noise ratio of the signal can be improved more than 10 dB after processing by the proposed algorithm, and correlation coefficient can be increased by 0.5, so it demonstrates better de-noising effect.

Zombie algorithms: a timesaving remote sensing systems engineering tool

Science.gov (United States)

Ardanuy, Philip E.; Powell, Dylan C.; Marley, Stephen

2008-08-01

In modern horror fiction, zombies are generally undead corpses brought back from the dead by supernatural or scientific means, and are rarely under anyone's direct control. They typically have very limited intelligence, and hunger for the flesh of the living [1]. Typical spectroradiometric or hyperspectral instruments providess calibrated radiances for a number of remote sensing algorithms. The algorithms typically must meet specified latency and availability requirements while yielding products at the required quality. These systems, whether research, operational, or a hybrid, are typically cost constrained. Complexity of the algorithms can be high, and may evolve and mature over time as sensor characterization changes, product validation occurs, and areas of scientific basis improvement are identified and completed. This suggests the need for a systems engineering process for algorithm maintenance that is agile, cost efficient, repeatable, and predictable. Experience on remote sensing science data systems suggests the benefits of "plug-n-play" concepts of operation. The concept, while intuitively simple, can be challenging to implement in practice. The use of zombie algorithms-empty shells that outwardly resemble the form, fit, and function of a "complete" algorithm without the implemented theoretical basis-provides the ground systems advantages equivalent to those obtained by integrating sensor engineering models onto the spacecraft bus. Combined with a mature, repeatable process for incorporating the theoretical basis, or scientific core, into the "head" of the zombie algorithm, along with associated scripting and registration, provides an easy "on ramp" for the rapid and low-risk integration of scientific applications into operational systems.

The Normalized-Rate Iterative Algorithm: A Practical Dynamic Spectrum Management Method for DSL

Science.gov (United States)

Statovci, Driton; Nordström, Tomas; Nilsson, Rickard

2006-12-01

We present a practical solution for dynamic spectrum management (DSM) in digital subscriber line systems: the normalized-rate iterative algorithm (NRIA). Supported by a novel optimization problem formulation, the NRIA is the only DSM algorithm that jointly addresses spectrum balancing for frequency division duplexing systems and power allocation for the users sharing a common cable bundle. With a focus on being implementable rather than obtaining the highest possible theoretical performance, the NRIA is designed to efficiently solve the DSM optimization problem with the operators' business models in mind. This is achieved with the help of two types of parameters: the desired network asymmetry and the desired user priorities. The NRIA is a centralized DSM algorithm based on the iterative water-filling algorithm (IWFA) for finding efficient power allocations, but extends the IWFA by finding the achievable bitrates and by optimizing the bandplan. It is compared with three other DSM proposals: the IWFA, the optimal spectrum balancing algorithm (OSBA), and the bidirectional IWFA (bi-IWFA). We show that the NRIA achieves better bitrate performance than the IWFA and the bi-IWFA. It can even achieve performance almost as good as the OSBA, but with dramatically lower requirements on complexity. Additionally, the NRIA can achieve bitrate combinations that cannot be supported by any other DSM algorithm.

Performance of target detection algorithm in compressive sensing miniature ultraspectral imaging compressed sensing system

Science.gov (United States)

Gedalin, Daniel; Oiknine, Yaniv; August, Isaac; Blumberg, Dan G.; Rotman, Stanley R.; Stern, Adrian

2017-04-01

Compressive sensing theory was proposed to deal with the high quantity of measurements demanded by traditional hyperspectral systems. Recently, a compressive spectral imaging technique dubbed compressive sensing miniature ultraspectral imaging (CS-MUSI) was presented. This system uses a voltage controlled liquid crystal device to create multiplexed hyperspectral cubes. We evaluate the utility of the data captured using the CS-MUSI system for the task of target detection. Specifically, we compare the performance of the matched filter target detection algorithm in traditional hyperspectral systems and in CS-MUSI multiplexed hyperspectral cubes. We found that the target detection algorithm performs similarly in both cases, despite the fact that the CS-MUSI data is up to an order of magnitude less than that in conventional hyperspectral cubes. Moreover, the target detection is approximately an order of magnitude faster in CS-MUSI data.

An efficient and fast detection algorithm for multimode FBG sensing

DEFF Research Database (Denmark)

Ganziy, Denis; Jespersen, O.; Rose, B.

2015-01-01

We propose a novel dynamic gate algorithm (DGA) for fast and accurate peak detection. The algorithm uses threshold determined detection window and Center of gravity algorithm with bias compensation. We analyze the wavelength fit resolution of the DGA for different values of signal to noise ratio...... and different typical peak shapes. Our simulations and experiments demonstrate that the DGA method is fast and robust with higher stability and accuracy compared to conventional algorithms. This makes it very attractive for future implementation in sensing systems especially based on multimode fiber Bragg...

An Improved Biclustering Algorithm and Its Application to Gene Expression Spectrum Analysis

OpenAIRE

Qu, Hua; Wang, Liu-Pu; Liang, Yan-Chun; Wu, Chun-Guo

2016-01-01

Cheng and Church algorithm is an important approach in biclustering algorithms. In this paper, the process of the extended space in the second stage of Cheng and Church algorithm is improved and the selections of two important parameters are discussed. The results of the improved algorithm used in the gene expression spectrum analysis show that, compared with Cheng and Church algorithm, the quality of clustering results is enhanced obviously, the mining expression models are better, and the d...

Optimality of Multichannel Myopic Sensing in the Presence of Sensing Error for Opportunistic Spectrum Access

Directory of Open Access Journals (Sweden)

Xiaofeng Jiang

2013-01-01

Full Text Available The optimization problem for the performance of opportunistic spectrum access is considered in this study. A user, with the limited sensing capacity, has opportunistic access to a communication system with multiple channels. The user can only choose several channels to sense and decides whether to access these channels based on the sensing information in each time slot. Meanwhile, the presence of sensing error is considered. A reward is obtained when the user accesses a channel. The objective is to maximize the expected (discounted or average reward accrued over an infinite horizon. This problem can be formulated as a partially observable Markov decision process. This study shows the optimality of the simple and robust myopic policy which focuses on maximizing the immediate reward. The results show that the myopic policy is optimal in the case of practical interest.

Distributed Algorithm for Voronoi Partition of Wireless Sensor Networks with a Limited Sensing Range.

Science.gov (United States)

He, Chenlong; Feng, Zuren; Ren, Zhigang

2018-02-03

For Wireless Sensor Networks (WSNs), the Voronoi partition of a region is a challenging problem owing to the limited sensing ability of each sensor and the distributed organization of the network. In this paper, an algorithm is proposed for each sensor having a limited sensing range to compute its limited Voronoi cell autonomously, so that the limited Voronoi partition of the entire WSN is generated in a distributed manner. Inspired by Graham's Scan (GS) algorithm used to compute the convex hull of a point set, the limited Voronoi cell of each sensor is obtained by sequentially scanning two consecutive bisectors between the sensor and its neighbors. The proposed algorithm called the Boundary Scan (BS) algorithm has a lower computational complexity than the existing Range-Constrained Voronoi Cell (RCVC) algorithm and reaches the lower bound of the computational complexity of the algorithms used to solve the problem of this kind. Moreover, it also improves the time efficiency of a key step in the Adjust-Sensing-Radius (ASR) algorithm used to compute the exact Voronoi cell. Extensive numerical simulations are performed to demonstrate the correctness and effectiveness of the BS algorithm. The distributed realization of the BS combined with a localization algorithm in WSNs is used to justify the WSN nature of the proposed algorithm.

A data compression algorithm for nuclear spectrum files

International Nuclear Information System (INIS)

Mika, J.F.; Martin, L.J.; Johnston, P.N.

1990-01-01

The total space occupied by computer files of spectra generated in nuclear spectroscopy systems can lead to problems of storage, and transmission time. An algorithm is presented which significantly reduces the space required to store nuclear spectra, without loss of any information content. Testing indicates that spectrum files can be routinely compressed by a factor of 5. (orig.)

Research on compressive sensing reconstruction algorithm based on total variation model

Science.gov (United States)

Gao, Yu-xuan; Sun, Huayan; Zhang, Tinghua; Du, Lin

2017-12-01

Compressed sensing for breakthrough Nyquist sampling theorem provides a strong theoretical , making compressive sampling for image signals be carried out simultaneously. In traditional imaging procedures using compressed sensing theory, not only can it reduces the storage space, but also can reduce the demand for detector resolution greatly. Using the sparsity of image signal, by solving the mathematical model of inverse reconfiguration, realize the super-resolution imaging. Reconstruction algorithm is the most critical part of compression perception, to a large extent determine the accuracy of the reconstruction of the image.The reconstruction algorithm based on the total variation (TV) model is more suitable for the compression reconstruction of the two-dimensional image, and the better edge information can be obtained. In order to verify the performance of the algorithm, Simulation Analysis the reconstruction result in different coding mode of the reconstruction algorithm based on the TV reconstruction algorithm. The reconstruction effect of the reconfigurable algorithm based on TV based on the different coding methods is analyzed to verify the stability of the algorithm. This paper compares and analyzes the typical reconstruction algorithm in the same coding mode. On the basis of the minimum total variation algorithm, the Augmented Lagrangian function term is added and the optimal value is solved by the alternating direction method.Experimental results show that the reconstruction algorithm is compared with the traditional classical algorithm based on TV has great advantages, under the low measurement rate can be quickly and accurately recovers target image.

Quasi Gradient Projection Algorithm for Sparse Reconstruction in Compressed Sensing

Directory of Open Access Journals (Sweden)

Xin Meng

2014-02-01

Full Text Available Compressed sensing is a novel signal sampling theory under the condition that the signal is sparse or compressible. The existing recovery algorithms based on the gradient projection can either need prior knowledge or recovery the signal poorly. In this paper, a new algorithm based on gradient projection is proposed, which is referred as Quasi Gradient Projection. The algorithm presented quasi gradient direction and two step sizes schemes along this direction. The algorithm doesn’t need any prior knowledge of the original signal. Simulation results demonstrate that the presented algorithm cans recovery the signal more correctly than GPSR which also don’t need prior knowledge. Meanwhile, the algorithm has a lower computation complexity.

The Normalized-Rate Iterative Algorithm: A Practical Dynamic Spectrum Management Method for DSL

Directory of Open Access Journals (Sweden)

Statovci Driton

2006-01-01

Full Text Available We present a practical solution for dynamic spectrum management (DSM in digital subscriber line systems: the normalized-rate iterative algorithm (NRIA. Supported by a novel optimization problem formulation, the NRIA is the only DSM algorithm that jointly addresses spectrum balancing for frequency division duplexing systems and power allocation for the users sharing a common cable bundle. With a focus on being implementable rather than obtaining the highest possible theoretical performance, the NRIA is designed to efficiently solve the DSM optimization problem with the operators' business models in mind. This is achieved with the help of two types of parameters: the desired network asymmetry and the desired user priorities. The NRIA is a centralized DSM algorithm based on the iterative water-filling algorithm (IWFA for finding efficient power allocations, but extends the IWFA by finding the achievable bitrates and by optimizing the bandplan. It is compared with three other DSM proposals: the IWFA, the optimal spectrum balancing algorithm (OSBA, and the bidirectional IWFA (bi-IWFA. We show that the NRIA achieves better bitrate performance than the IWFA and the bi-IWFA. It can even achieve performance almost as good as the OSBA, but with dramatically lower requirements on complexity. Additionally, the NRIA can achieve bitrate combinations that cannot be supported by any other DSM algorithm.

System Capacity Limits Introduced by Data Fusion on Cooperative Spectrum Sensing under Correlated Environments

DEFF Research Database (Denmark)

Pratas, Nuno; Marchetti, Nicola; Prasad, Neeli R.

2010-01-01

on cooperative sensing schemes. The analysis is supported by evaluation metrics which accounts for the perceived capacity limits. The analysis is performed along the data fusion chain, comparing several scenarios encompassing different degrees of environment correlation between the cluster nodes, number......Spectrum sensing, the cornerstone of the Cognitive Radio paradigm, has been the focus of intensive research, from which the main conclusion was that its performance can be greatly enhanced through the use of cooperative sensing schemes. Nevertheless, if a proper design of the cooperative scheme...... is not followed, then the use of cooperative schemes will introduce some limitations in the network perceived capacity. In this paper, we analyze the performance of a cooperative spectrum sensing scheme based on Data Fusion, by measuring the perceived capacity limits introduced by the use of Data Fusion...

A joint image encryption and watermarking algorithm based on compressive sensing and chaotic map

International Nuclear Information System (INIS)

Xiao Di; Cai Hong-Kun; Zheng Hong-Ying

2015-01-01

In this paper, a compressive sensing (CS) and chaotic map-based joint image encryption and watermarking algorithm is proposed. The transform domain coefficients of the original image are scrambled by Arnold map firstly. Then the watermark is adhered to the scrambled data. By compressive sensing, a set of watermarked measurements is obtained as the watermarked cipher image. In this algorithm, watermark embedding and data compression can be performed without knowing the original image; similarly, watermark extraction will not interfere with decryption. Due to the characteristics of CS, this algorithm features compressible cipher image size, flexible watermark capacity, and lossless watermark extraction from the compressed cipher image as well as robustness against packet loss. Simulation results and analyses show that the algorithm achieves good performance in the sense of security, watermark capacity, extraction accuracy, reconstruction, robustness, etc. (paper)

Enhancing Sensing and Channel Access in Cognitive Radio Networks

KAUST Repository

Hamza, Doha R.

2014-06-18

Cognitive radio technology is a promising technology to solve the wireless spectrum scarcity problem by intelligently allowing secondary, or unlicensed, users access to the primary, licensed, users\\' frequency bands. Cognitive technology involves two main tasks: 1) sensing the wireless medium to assess the presence of the primary users and 2) designing secondary spectrum access techniques that maximize the secondary users\\' benefits while maintaining the primary users\\' privileged status. On the spectrum sensing side, we make two contributions. First, we maximize a utility function representing the secondary throughput while constraining the collision probability with the primary below a certain value. We optimize therein the channel sensing time, the sensing decision threshold, the channel probing time, together with the channel sensing order for wideband primary channels. Second, we design a cooperative spectrum sensing technique termed sensing with equal gain combining whereby cognitive radios simultaneously transmit their sensing results to the fusion center over multipath fading reporting channels. The proposed scheme is shown to outperform orthogonal reporting systems in terms of achievable secondary throughput and to be robust against phase and synchronization errors. On the spectrum access side, we make four contributions. First, we design a secondary scheduling scheme with the goal of minimizing the secondary queueing delay under constraints on the average secondary transmit power and the maximum tolerable primary outage probability. Second, we design another secondary scheduling scheme based on the spectrum sensing results and the primary automatic repeat request feedback. The optimal medium access probabilities are obtained via maximizing the secondary throughput subject to constraints that guarantee quality of service parameters for the primary. Third, we propose a three-message superposition coding scheme to maximize the secondary throughput without

Neutron spectrum unfolding using genetic algorithm in a Monte Carlo simulation

Energy Technology Data Exchange (ETDEWEB)

Suman, Vitisha [Health Physics Division, Bhabha Atomic Research Centre, Mumbai 400085 (India); Sarkar, P.K., E-mail: pksarkar02@gmail.com [Manipal Centre for Natural Sciences, Manipal University, Manipal 576104 (India)

2014-02-11

A spectrum unfolding technique GAMCD (Genetic Algorithm and Monte Carlo based spectrum Deconvolution) has been developed using the genetic algorithm methodology within the framework of Monte Carlo simulations. Each Monte Carlo history starts with initial solution vectors (population) as randomly generated points in the hyper dimensional solution space that are related to the measured data by the response matrix of the detection system. The transition of the solution points in the solution space from one generation to another are governed by the genetic algorithm methodology using the techniques of cross-over (mating) and mutation in a probabilistic manner adding new solution points to the population. The population size is kept constant by discarding solutions having lesser fitness values (larger differences between measured and calculated results). Solutions having the highest fitness value at the end of each Monte Carlo history are averaged over all histories to obtain the final spectral solution. The present method shows promising results in neutron spectrum unfolding for both under-determined and over-determined problems with simulated test data as well as measured data when compared with some existing unfolding codes. An attractive advantage of the present method is the independence of the final spectra from the initial guess spectra.

Neutron spectrum unfolding using genetic algorithm in a Monte Carlo simulation

International Nuclear Information System (INIS)

Suman, Vitisha; Sarkar, P.K.

2014-01-01

A spectrum unfolding technique GAMCD (Genetic Algorithm and Monte Carlo based spectrum Deconvolution) has been developed using the genetic algorithm methodology within the framework of Monte Carlo simulations. Each Monte Carlo history starts with initial solution vectors (population) as randomly generated points in the hyper dimensional solution space that are related to the measured data by the response matrix of the detection system. The transition of the solution points in the solution space from one generation to another are governed by the genetic algorithm methodology using the techniques of cross-over (mating) and mutation in a probabilistic manner adding new solution points to the population. The population size is kept constant by discarding solutions having lesser fitness values (larger differences between measured and calculated results). Solutions having the highest fitness value at the end of each Monte Carlo history are averaged over all histories to obtain the final spectral solution. The present method shows promising results in neutron spectrum unfolding for both under-determined and over-determined problems with simulated test data as well as measured data when compared with some existing unfolding codes. An attractive advantage of the present method is the independence of the final spectra from the initial guess spectra

Energy/bandwidth-Saving Cooperative Spectrum Sensing for Two-hopWRAN

Directory of Open Access Journals (Sweden)

Ming-Tuo Zhou

2014-07-01

Full Text Available A two-hop wireless regional area network (WRAN providing monitoring services operating in Television White Space (TVWS, i.e., IEEE P802.22b, may employ a great number of subscriber customer-premises equipments (S-CPEs possibly without mains power supply, leading to requirement of cost-effective and power-saving design. This paper proposes a framework of cooperative spectrum sensing (CSS and an energy/bandwidth saving CSS scheme to P802.22b. In each round of sensing, S-CPEs with SNRs lower than a predefined threshold are excluded from reporting sensing results. Numerical results show that the fused missed-detection probability and false alarmprobability could remainmeeting sensing requirements, and the overall fused error probability changes very little. With 10 S-CPEs, it is possible to save more than 40% of the energy/bandwidth on a Rayleigh channel. The principle proposed can apply to other advanced sensing technologies capable of detecting primary signals with low average SNR.

A real-time MTFC algorithm of space remote-sensing camera based on FPGA

Science.gov (United States)

Zhao, Liting; Huang, Gang; Lin, Zhe

2018-01-01

A real-time MTFC algorithm of space remote-sensing camera based on FPGA was designed. The algorithm can provide real-time image processing to enhance image clarity when the remote-sensing camera running on-orbit. The image restoration algorithm adopted modular design. The MTF measurement calculation module on-orbit had the function of calculating the edge extension function, line extension function, ESF difference operation, normalization MTF and MTFC parameters. The MTFC image filtering and noise suppression had the function of filtering algorithm and effectively suppressing the noise. The algorithm used System Generator to design the image processing algorithms to simplify the design structure of system and the process redesign. The image gray gradient dot sharpness edge contrast and median-high frequency were enhanced. The image SNR after recovery reduced less than 1 dB compared to the original image. The image restoration system can be widely used in various fields.

Speech Enhancement by Multichannel Crosstalk Resistant ANC and Improved Spectrum Subtraction

Directory of Open Access Journals (Sweden)

Zeng Qingning

2006-01-01

Full Text Available A scheme combining multichannel crosstalk resistant adaptive noise cancellation (MCRANC algorithm and improved spectrum subtraction (ISS algorithm is presented to enhance noise carrying speech signals. The scheme would permit locating the microphones in close proximity by virtue of using MCRANC which has the capability of removing the crosstalk effect. MCRANC would also permit canceling out nonstationary noise and making the residual noise more stationary for further treatment by ISS algorithm. Experimental results have indicated that this scheme outperforms many commonly used techniques in the sense of SNR improvement and music effect reduction which is an inevitable byproduct of the spectrum subtraction algorithm.

Microwave Remote Sensing Modeling of Ocean Surface Salinity and Winds Using an Empirical Sea Surface Spectrum

Science.gov (United States)

Yueh, Simon H.

2004-01-01

Active and passive microwave remote sensing techniques have been investigated for the remote sensing of ocean surface wind and salinity. We revised an ocean surface spectrum using the CMOD-5 geophysical model function (GMF) for the European Remote Sensing (ERS) C-band scatterometer and the Ku-band GMF for the NASA SeaWinds scatterometer. The predictions of microwave brightness temperatures from this model agree well with satellite, aircraft and tower-based microwave radiometer data. This suggests that the impact of surface roughness on microwave brightness temperatures and radar scattering coefficients of sea surfaces can be consistently characterized by a roughness spectrum, providing physical basis for using combined active and passive remote sensing techniques for ocean surface wind and salinity remote sensing.

Integrating sensing across a broader spectrum to support homeland security

Science.gov (United States)

O'Brien, Thomas W.; Finkelstein, Marc

2003-08-01

All objects and activities give off energy in some part of the spectrum, may leave tell-tail signs from their previous activities (e.g., earth scaring or vapor trails), or leave information about relationships that they may have with other entities and activities (e.g., networks). Many of these phenomenologies are either not picked up by current stovepiped sensors, or the data supplied by those sensors are not fully exploited to properly observe them. In either case, new sensor data as well as the better exploitation of existing data could be used to provide, or at least cross cue or correlate with other sensor data to detect, identify, geolocate or track different kind of problems. Current sensors are often designed for specific purposes and are capable of sensing only limited parts of the spectrum. Significantly broadening the sensing spectrum will be an essential element of solving the emerging class of new "hard problems". There are many other observables available that could be exploited to assist in that process. Thus one could broaden the sensing to observe those phenomenologies associated with combustion effluents; thermal radiation; magnetic anomalies; seismic movement; acoustics; unintended electromagnetic emissions, changing weather conditions, logistics support indicators, debris trails; impressed observables (such as tagging); and others. What's needed is a disciplined, analytical process that can map observables to sensors, and ultimately to mission utility. The process, described in this SPIE presentation will address a specific example on the flow from the establishment of requirements to prosecutable observables, to objectives, to identification of sensors and assets, to the allocation of sensors and assets to observables, all based on optimizing mission utility.

Energy detection for spectrum sensing in cognitive radio

CERN Document Server

Atapattu, Saman; Jiang, Hai

2014-01-01

This Springer Brief focuses on the current state-of-the-art research on spectrum sensing by using energy detection, a low-complexity and low-cost technique. It includes a comprehensive summary of recent research, fundamental theories, possible architectures, useful performance measurements of energy detection and applications of energy detection. Concise, practical chapters explore conventional energy detectors, alternative forms of energy detectors, performance measurements, diversity techniques and cooperative networks. The careful analysis enables reader to identify the most efficient techn

The Physics of Compressive Sensing and the Gradient-Based Recovery Algorithms

OpenAIRE

Dai, Qi; Sha, Wei

2009-01-01

The physics of compressive sensing (CS) and the gradient-based recovery algorithms are presented. First, the different forms for CS are summarized. Second, the physical meanings of coherence and measurement are given. Third, the gradient-based recovery algorithms and their geometry explanations are provided. Finally, we conclude the report and give some suggestion for future work.

Generalized mean detector for collaborative spectrum sensing

KAUST Repository

Shakir, Muhammad Zeeshan

2013-04-01

In this paper, a unified generalized eigenvalue based spectrum sensing framework referred to as Generalized mean detector (GMD) has been introduced. The generalization of the detectors namely (i) the eigenvalue ratio detector (ERD) involving the ratio of the largest and the smallest eigenvalues; (ii) the Geometric mean detector (GEMD) involving the ratio of the largest eigenvalue and the geometric mean of the eigenvalues and (iii) the Arithmetic mean detector (ARMD) involving the ratio of the largest and the arithmetic mean of the eigenvalues is explored. The foundation of the proposed unified framework is based on the calculation of exact analytical moments of the random variables of test statistics of the respective detectors. In this context, we approximate the probability density function (PDF) of the test statistics of the respective detectors by Gaussian/Gamma PDF using the moment matching method. Finally, we derive closed-form expressions to calculate the decision threshold of the eigenvalue based detectors by exchanging the derived exact moments of the random variables of test statistics with the moments of the Gaussian/Gamma distribution function. The performance of the eigenvalue based detectors is compared with the traditional detectors such as energy detector (ED) and cyclostationary detector (CSD) and validate the importance of the eigenvalue based detectors particularly over realistic wireless cognitive environments. Analytical and simulation results show that the GEMD and the ARMD yields considerable performance advantage in realistic spectrum sensing scenarios. Moreover, our results based on proposed simple and tractable approximation approaches are in perfect agreement with the empirical results. © 1972-2012 IEEE.

a New Graduation Algorithm for Color Balance of Remote Sensing Image

Science.gov (United States)

Zhou, G.; Liu, X.; Yue, T.; Wang, Q.; Sha, H.; Huang, S.; Pan, Q.

2018-05-01

In order to expand the field of view to obtain more data and information when doing research on remote sensing image, workers always need to mosaicking images together. However, the image after mosaic always has the large color differences and produces the gap line. This paper based on the graduation algorithm of tarigonometric function proposed a new algorithm of Two Quarter-rounds Curves (TQC). The paper uses the Gaussian filter to solve the program about the image color noise and the gap line. The paper used one of Greenland compiled data acquired in 1963 from Declassified Intelligence Photography Project (DISP) by ARGON KH-5 satellite, and used the photography of North Gulf, China, by Landsat satellite to experiment. The experimental results show that the proposed method has improved the accuracy of the results in two parts: on the one hand, for the large color differences remote sensing image will become more balanced. On the other hands, the remote sensing image will achieve more smooth transition.

Novel Cooperative Spectrum Sensing Methods And Their Limitations

DEFF Research Database (Denmark)

Kiilerich Pratas, Nuno

2012-01-01

$-calculus, denoted as Bounded Broadcast Calculus. This analysis is done over centralized, decentralized and relay aided topologies. The outcome of this analysis is a theorem where it is stated, which properties a protocol should have so that it can be deemed correct, i.e. that it performs as intended, over each...... source. The node selection scheme is proposed in a centralized and in a decentralized version. These versions can complement each other and therefore lead to a more robust cooperative spectrum sensing mechanism....

Distortion correction algorithm for UAV remote sensing image based on CUDA

International Nuclear Information System (INIS)

Wenhao, Zhang; Yingcheng, Li; Delong, Li; Changsheng, Teng; Jin, Liu

2014-01-01

In China, natural disasters are characterized by wide distribution, severe destruction and high impact range, and they cause significant property damage and casualties every year. Following a disaster, timely and accurate acquisition of geospatial information can provide an important basis for disaster assessment, emergency relief, and reconstruction. In recent years, Unmanned Aerial Vehicle (UAV) remote sensing systems have played an important role in major natural disasters, with UAVs becoming an important technique of obtaining disaster information. UAV is equipped with a non-metric digital camera with lens distortion, resulting in larger geometric deformation for acquired images, and affecting the accuracy of subsequent processing. The slow speed of the traditional CPU-based distortion correction algorithm cannot meet the requirements of disaster emergencies. Therefore, we propose a Compute Unified Device Architecture (CUDA)-based image distortion correction algorithm for UAV remote sensing, which takes advantage of the powerful parallel processing capability of the GPU, greatly improving the efficiency of distortion correction. Our experiments show that, compared with traditional CPU algorithms and regardless of image loading and saving times, the maximum acceleration ratio using our proposed algorithm reaches 58 times that using the traditional algorithm. Thus, data processing time can be reduced by one to two hours, thereby considerably improving disaster emergency response capability

Multiobjective Optimization of Linear Cooperative Spectrum Sensing: Pareto Solutions and Refinement.

Science.gov (United States)

Yuan, Wei; You, Xinge; Xu, Jing; Leung, Henry; Zhang, Tianhang; Chen, Chun Lung Philip

2016-01-01

In linear cooperative spectrum sensing, the weights of secondary users and detection threshold should be optimally chosen to minimize missed detection probability and to maximize secondary network throughput. Since these two objectives are not completely compatible, we study this problem from the viewpoint of multiple-objective optimization. We aim to obtain a set of evenly distributed Pareto solutions. To this end, here, we introduce the normal constraint (NC) method to transform the problem into a set of single-objective optimization (SOO) problems. Each SOO problem usually results in a Pareto solution. However, NC does not provide any solution method to these SOO problems, nor any indication on the optimal number of Pareto solutions. Furthermore, NC has no preference over all Pareto solutions, while a designer may be only interested in some of them. In this paper, we employ a stochastic global optimization algorithm to solve the SOO problems, and then propose a simple method to determine the optimal number of Pareto solutions under a computational complexity constraint. In addition, we extend NC to refine the Pareto solutions and select the ones of interest. Finally, we verify the effectiveness and efficiency of the proposed methods through computer simulations.

Edge Detection from High Resolution Remote Sensing Images using Two-Dimensional log Gabor Filter in Frequency Domain

International Nuclear Information System (INIS)

Wang, K; Yu, T; Meng, Q Y; Wang, G K; Li, S P; Liu, S H

2014-01-01

Edges are vital features to describe the structural information of images, especially high spatial resolution remote sensing images. Edge features can be used to define the boundaries between different ground objects in high spatial resolution remote sensing images. Thus edge detection is important in the remote sensing image processing. Even though many different edge detection algorithms have been proposed, it is difficult to extract the edge features from high spatial resolution remote sensing image including complex ground objects. This paper introduces a novel method to detect edges from the high spatial resolution remote sensing image based on frequency domain. Firstly, the high spatial resolution remote sensing images are Fourier transformed to obtain the magnitude spectrum image (frequency image) by FFT. Then, the frequency spectrum is analyzed by using the radius and angle sampling. Finally, two-dimensional log Gabor filter with optimal parameters is designed according to the result of spectrum analysis. Finally, dot product between the result of Fourier transform and the log Gabor filter is inverse Fourier transformed to obtain the detections. The experimental result shows that the proposed algorithm can detect edge features from the high resolution remote sensing image commendably

A structure preserving Lanczos algorithm for computing the optical absorption spectrum

Energy Technology Data Exchange (ETDEWEB)

Shao, Meiyue [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Computational Research Div.; Jornada, Felipe H. da [Univ. of California, Berkeley, CA (United States). Dept. of Physics; Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Materials Science Div.; Lin, Lin [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Computational Research Div.; Univ. of California, Berkeley, CA (United States). Dept. of Mathematics; Yang, Chao [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Computational Research Div.; Deslippe, Jack [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). National Energy Research Scientific Computing Center (NERSC); Louie, Steven G. [Univ. of California, Berkeley, CA (United States). Dept. of Physics; Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Materials Science Div.

2016-11-16

We present a new structure preserving Lanczos algorithm for approximating the optical absorption spectrum in the context of solving full Bethe-Salpeter equation without Tamm-Dancoff approximation. The new algorithm is based on a structure preserving Lanczos procedure, which exploits the special block structure of Bethe-Salpeter Hamiltonian matrices. A recently developed technique of generalized averaged Gauss quadrature is incorporated to accelerate the convergence. We also establish the connection between our structure preserving Lanczos procedure with several existing Lanczos procedures developed in different contexts. Numerical examples are presented to demonstrate the effectiveness of our Lanczos algorithm.

RF Spectrum Sensing Based on an Overdamped Nonlinear Oscillator Ring for Cognitive Radios

Directory of Open Access Journals (Sweden)

Zhi-Ling Tang

2016-06-01

Full Text Available Existing spectrum-sensing techniques for cognitive radios require an analog-to-digital converter (ADC to work at high dynamic range and a high sampling rate, resulting in high cost. Therefore, in this paper, a spectrum-sensing method based on a unidirectionally coupled, overdamped nonlinear oscillator ring is proposed. First, the numerical model of such a system is established based on the circuit of the nonlinear oscillator. Through numerical analysis of the model, the critical condition of the system’s starting oscillation is determined, and the simulation results of the system’s response to Gaussian white noise and periodic signal are presented. The results show that once the radio signal is input into the system, it starts oscillating when in the critical region, and the oscillating frequency of each element is fo/N, where fo is the frequency of the radio signal and N is the number of elements in the ring. The oscillation indicates that the spectrum resources at fo are occupied. At the same time, the sampling rate required for an ADC is reduced to the original value, 1/N. A prototypical circuit to verify the functionality of the system is designed, and the sensing bandwidth of the system is measured.

The spectral positioning algorithm of new spectrum vehicle based on convex programming in wireless sensor network

Science.gov (United States)

Zhang, Yongjun; Lu, Zhixin

2017-10-01

Spectrum resources are very precious, so it is increasingly important to locate interference signals rapidly. Convex programming algorithms in wireless sensor networks are often used as localization algorithms. But in view of the traditional convex programming algorithm is too much overlap of wireless sensor nodes that bring low positioning accuracy, the paper proposed a new algorithm. Which is mainly based on the traditional convex programming algorithm, the spectrum car sends unmanned aerial vehicles (uses) that can be used to record data periodically along different trajectories. According to the probability density distribution, the positioning area is segmented to further reduce the location area. Because the algorithm only increases the communication process of the power value of the unknown node and the sensor node, the advantages of the convex programming algorithm are basically preserved to realize the simple and real-time performance. The experimental results show that the improved algorithm has a better positioning accuracy than the original convex programming algorithm.

Spectrum Hole Identification in IEEE 802.22 WRAN using Unsupervised Learning

OpenAIRE

V. Balaji; S. Anand; C.R. Hota; G. Raghurama

2016-01-01

In this paper we present a Cooperative Spectrum Sensing (CSS) algorithm for Cognitive Radios (CR) based on IEEE 802.22Wireless Regional Area Network (WRAN) standard. The core objective is to improve cooperative sensing efficiency which specifies how fast a decision can be reached in each round of cooperation (iteration) to sense an appropriate number of channels/bands (i.e. 86 channels of 7MHz bandwidth as per IEEE 802.22) within a time constraint (channel sensing time). To meet this objectiv...

An Uneven Illumination Correction Algorithm for Optical Remote Sensing Images Covered with Thin Clouds

Directory of Open Access Journals (Sweden)

Xiaole Shen

2015-09-01

Full Text Available The uneven illumination phenomenon caused by thin clouds will reduce the quality of remote sensing images, and bring adverse effects to the image interpretation. To remove the effect of thin clouds on images, an uneven illumination correction can be applied. In this paper, an effective uneven illumination correction algorithm is proposed to remove the effect of thin clouds and to restore the ground information of the optical remote sensing image. The imaging model of remote sensing images covered by thin clouds is analyzed. Due to the transmission attenuation, reflection, and scattering, the thin cloud cover usually increases region brightness and reduces saturation and contrast of the image. As a result, a wavelet domain enhancement is performed for the image in Hue-Saturation-Value (HSV color space. We use images with thin clouds in Wuhan area captured by QuickBird and ZiYuan-3 (ZY-3 satellites for experiments. Three traditional uneven illumination correction algorithms, i.e., multi-scale Retinex (MSR algorithm, homomorphic filtering (HF-based algorithm, and wavelet transform-based MASK (WT-MASK algorithm are performed for comparison. Five indicators, i.e., mean value, standard deviation, information entropy, average gradient, and hue deviation index (HDI are used to analyze the effect of the algorithms. The experimental results show that the proposed algorithm can effectively eliminate the influences of thin clouds and restore the real color of ground objects under thin clouds.

Reconstruction algorithm in compressed sensing based on maximum a posteriori estimation

International Nuclear Information System (INIS)

Takeda, Koujin; Kabashima, Yoshiyuki

2013-01-01

We propose a systematic method for constructing a sparse data reconstruction algorithm in compressed sensing at a relatively low computational cost for general observation matrix. It is known that the cost of ℓ 1 -norm minimization using a standard linear programming algorithm is O(N 3 ). We show that this cost can be reduced to O(N 2 ) by applying the approach of posterior maximization. Furthermore, in principle, the algorithm from our approach is expected to achieve the widest successful reconstruction region, which is evaluated from theoretical argument. We also discuss the relation between the belief propagation-based reconstruction algorithm introduced in preceding works and our approach

Accurate estimation of motion blur parameters in noisy remote sensing image

Science.gov (United States)

Shi, Xueyan; Wang, Lin; Shao, Xiaopeng; Wang, Huilin; Tao, Zhong

2015-05-01

The relative motion between remote sensing satellite sensor and objects is one of the most common reasons for remote sensing image degradation. It seriously weakens image data interpretation and information extraction. In practice, point spread function (PSF) should be estimated firstly for image restoration. Identifying motion blur direction and length accurately is very crucial for PSF and restoring image with precision. In general, the regular light-and-dark stripes in the spectrum can be employed to obtain the parameters by using Radon transform. However, serious noise existing in actual remote sensing images often causes the stripes unobvious. The parameters would be difficult to calculate and the error of the result relatively big. In this paper, an improved motion blur parameter identification method to noisy remote sensing image is proposed to solve this problem. The spectrum characteristic of noisy remote sensing image is analyzed firstly. An interactive image segmentation method based on graph theory called GrabCut is adopted to effectively extract the edge of the light center in the spectrum. Motion blur direction is estimated by applying Radon transform on the segmentation result. In order to reduce random error, a method based on whole column statistics is used during calculating blur length. Finally, Lucy-Richardson algorithm is applied to restore the remote sensing images of the moon after estimating blur parameters. The experimental results verify the effectiveness and robustness of our algorithm.

Advanced Dispersed Fringe Sensing Algorithm for Coarse Phasing Segmented Mirror Telescopes

Science.gov (United States)

Spechler, Joshua A.; Hoppe, Daniel J.; Sigrist, Norbert; Shi, Fang; Seo, Byoung-Joon; Bikkannavar, Siddarayappa A.

2013-01-01

Segment mirror phasing, a critical step of segment mirror alignment, requires the ability to sense and correct the relative pistons between segments from up to a few hundred microns to a fraction of wavelength in order to bring the mirror system to its full diffraction capability. When sampling the aperture of a telescope, using auto-collimating flats (ACFs) is more economical. The performance of a telescope with a segmented primary mirror strongly depends on how well those primary mirror segments can be phased. One such process to phase primary mirror segments in the axial piston direction is dispersed fringe sensing (DFS). DFS technology can be used to co-phase the ACFs. DFS is essentially a signal fitting and processing operation. It is an elegant method of coarse phasing segmented mirrors. DFS performance accuracy is dependent upon careful calibration of the system as well as other factors such as internal optical alignment, system wavefront errors, and detector quality. Novel improvements to the algorithm have led to substantial enhancements in DFS performance. The Advanced Dispersed Fringe Sensing (ADFS) Algorithm is designed to reduce the sensitivity to calibration errors by determining the optimal fringe extraction line. Applying an angular extraction line dithering procedure and combining this dithering process with an error function while minimizing the phase term of the fitted signal, defines in essence the ADFS algorithm.

A Robust Parallel Algorithm for Combinatorial Compressed Sensing

Science.gov (United States)

Mendoza-Smith, Rodrigo; Tanner, Jared W.; Wechsung, Florian

2018-04-01

In previous work two of the authors have shown that a vector $x \\in \\mathbb{R}^n$ with at most $k Parallel-$\\ell_0$ decoding algorithm, where $\\mathrm{nnz}(A)$ denotes the number of nonzero entries in $A \\in \\mathbb{R}^{m \\times n}$. In this paper we present the Robust-$\\ell_0$ decoding algorithm, which robustifies Parallel-$\\ell_0$ when the sketch $Ax$ is corrupted by additive noise. This robustness is achieved by approximating the asymptotic posterior distribution of values in the sketch given its corrupted measurements. We provide analytic expressions that approximate these posteriors under the assumptions that the nonzero entries in the signal and the noise are drawn from continuous distributions. Numerical experiments presented show that Robust-$\\ell_0$ is superior to existing greedy and combinatorial compressed sensing algorithms in the presence of small to moderate signal-to-noise ratios in the setting of Gaussian signals and Gaussian additive noise.

Equal gain combining for cooperative spectrum sensing in cognitive radio networks

KAUST Repository

Hamza, Doha R.

2014-08-01

Sensing with equal gain combining (SEGC), a novel cooperative spectrum sensing technique for cognitive radio networks, is proposed. Cognitive radios simultaneously transmit their sensing results to the fusion center (FC) over multipath fading reporting channels. The cognitive radios estimate the phases of the reporting channels and use those estimates for coherent combining of the sensing results at the FC. A global decision is made at the FC by comparing the received signal with a threshold. We obtain the global detection probabilities and secondary throughput exactly through a moment generating function approach. We verify our solution via system simulation and demonstrate that the Chernoff bound and central limit theory approximation are not tight. The cases of hard sensing and soft sensing are considered and we provide examples in which hard sensing is advantageous to soft sensing. We contrast the performance of SEGC with maximum ratio combining of the sensors\\' results and provide examples where the former is superior. Furthermore, we evaluate the performance of SEGC against existing orthogonal reporting techniques such as time division multiple access (TDMA). SEGC performance always dominates that of TDMA in terms of secondary throughput. We also study the impact of phase and synchronization errors and demonstrate the robustness of the SEGC technique against such imperfections. © 2002-2012 IEEE.

On the Impact of User Distribution on Cooperative Spectrum Sensing and Data Transmission with Multiuser Diversity

KAUST Repository

Rao, Anlei

2011-07-01

In this thesis, we investigate the independent but not identically distributed (i.n.i.d.) situations for spectrum sensing and data transmission. In particular, we derive the false-alarm probability and the detection probability of cooperative spectrum sensing with the scheme of energy fusion over i.n.i.d. Nakagami fading channels. Then, the performance of adaptive modulation with single-cell multiuser scheduling over i.n.i.d. Nakagami fading channels is analyzed. Closed-form expressions are derived for the average channel capacity, spectral efficiency, and bit-error-rate (BER) for both constant-power variable-rate and variable-power variable-rate uncoded M- ary quadrature amplitude modulation (M-QAM) schemes. In addition, we study the impact of time delay on the average BER of adaptive M-QAM. From the selected numerical results, we can see that cooperative spectrum sensing and multiuser diversity brings considerably better performance even over i.n.i.d. fading environments.

BONDI-97 A novel neutron energy spectrum unfolding tool using a genetic algorithm

CERN Document Server

Mukherjee, B

1999-01-01

The neutron spectrum unfolding procedure using the count rate data obtained from a set of Bonner sphere neutron detectors requires the solution of the Fredholm integral equation of the first kind by using complex mathematical methods. This paper reports a new approach for the unfolding of neutron spectra using the Genetic Algorithm tool BONDI-97 (BOnner sphere Neutron DIfferentiation). The BONDI-97 was used as the input for Genetic Algorithm engine EVOLVER to search for a globally optimised solution vector from a population of randomly generated solutions. This solution vector corresponds to the unfolded neutron energy spectrum. The Genetic Algorithm engine emulates the Darwinian 'Survival of the Fittest' strategy, the key ingredient of the 'Theory of Evolution'. The spectra of sup 2 sup 4 sup 1 Am/Be (alpha,n) and sup 2 sup 3 sup 9 Pu/Be (alpha,n) neutron sources were unfolded using the BONDI-97 tool. (author)

Spectrum Hole Identification in IEEE 802.22 WRAN using Unsupervised Learning

Directory of Open Access Journals (Sweden)

V. Balaji

2016-01-01

Full Text Available In this paper we present a Cooperative Spectrum Sensing (CSS algorithm for Cognitive Radios (CR based on IEEE 802.22Wireless Regional Area Network (WRAN standard. The core objective is to improve cooperative sensing efficiency which specifies how fast a decision can be reached in each round of cooperation (iteration to sense an appropriate number of channels/bands (i.e. 86 channels of 7MHz bandwidth as per IEEE 802.22 within a time constraint (channel sensing time. To meet this objective, we have developed CSS algorithm using unsupervised K-means clustering classification approach. The received energy level of each Secondary User (SU is considered as the parameter for determining channel availability. The performance of proposed algorithm is quantified in terms of detection accuracy, training and classification delay time. Further, the detection accuracy of our proposed scheme meets the requirement of IEEE 802.22 WRAN with the target probability of falsealrm as 0.1. All the simulations are carried out using Matlab tool.

Performance analysis of spectrum sensing with multiple status changes in primary user traffic

KAUST Repository

Tang, Liang

2012-06-01

In this letter, the impact of primary user traffic with multiple status changes on the spectrum sensing performance is analyzed. Closed-form expressions for the probabilities of false alarm and detection are derived. Numerical results show that the multiple status changes of the primary user cause considerable degradation in the sensing performance. This degradation depends on the number of changes, the primary user traffic model, the primary user traffic intensity and the signal-to-noise ratio of the received signal. Numerical results also show that the amount of degradation decreases when the number of changes increases, and converges to a minimum sensing performance due to the limited sensing period and primary holding time. © 2012 IEEE.

Advanced sensing techniques for cognitive radio

CERN Document Server

Zhao, Guodong; Li, Shaoqian

2017-01-01

This SpringerBrief investigates advanced sensing techniques to detect and estimate the primary receiver for cognitive radio systems. Along with a comprehensive overview of existing spectrum sensing techniques, this brief focuses on the design of new signal processing techniques, including the region-based sensing, jamming-based probing, and relay-based probing. The proposed sensing techniques aim to detect the nearby primary receiver and estimate the cross-channel gain between the cognitive transmitter and primary receiver. The performance of the proposed algorithms is evaluated by simulations in terms of several performance parameters, including detection probability, interference probability, and estimation error. The results show that the proposed sensing techniques can effectively sense the primary receiver and improve the cognitive transmission throughput. Researchers and postgraduate students in electrical engineering will find this an exceptional resource.

Quantification of whispering gallery mode spectrum variability in application to sensing nanobiophotonics

Science.gov (United States)

Saetchnikov, Anton; Skakun, Victor; Saetchnikov, Vladimir; Tcherniavskaia, Elina; Ostendorf, Andreas

2017-10-01

An approach for the automated whispering gallery mode (WGM) signal decomposition and its parameter estimation is discussed. The algorithm is based on the peak picking and can be applied for the preprocessing of the raw signal acquired from the multiplied WGM-based biosensing chips. Quantitative estimations representing physically meaningful parameters of the external disturbing factors on the WGM spectral shape are the output values. Derived parameters can be directly applied to the further deep qualitative and quantitative interpretations of the sensed disturbing factors. The algorithm is tested on both simulated and experimental data taken from the bovine serum albumin biosensing task. The proposed solution is expected to be a useful contribution to the preprocessing phase of the complete data analysis engine and is expected to push the WGM technology toward the real-live sensing nanobiophotonics.

Performance analysis of spectrum sensing with multiple status changes in primary user traffic

KAUST Repository

Tang, Liang; Chen, Yunfei; Hines, Evor L.; Alouini, Mohamed-Slim

2012-01-01

In this letter, the impact of primary user traffic with multiple status changes on the spectrum sensing performance is analyzed. Closed-form expressions for the probabilities of false alarm and detection are derived. Numerical results show

A research of road centerline extraction algorithm from high resolution remote sensing images

Science.gov (United States)

Zhang, Yushan; Xu, Tingfa

2017-09-01

Satellite remote sensing technology has become one of the most effective methods for land surface monitoring in recent years, due to its advantages such as short period, large scale and rich information. Meanwhile, road extraction is an important field in the applications of high resolution remote sensing images. An intelligent and automatic road extraction algorithm with high precision has great significance for transportation, road network updating and urban planning. The fuzzy c-means (FCM) clustering segmentation algorithms have been used in road extraction, but the traditional algorithms did not consider spatial information. An improved fuzzy C-means clustering algorithm combined with spatial information (SFCM) is proposed in this paper, which is proved to be effective for noisy image segmentation. Firstly, the image is segmented using the SFCM. Secondly, the segmentation result is processed by mathematical morphology to remover the joint region. Thirdly, the road centerlines are extracted by morphology thinning and burr trimming. The average integrity of the centerline extraction algorithm is 97.98%, the average accuracy is 95.36% and the average quality is 93.59%. Experimental results show that the proposed method in this paper is effective for road centerline extraction.

Laser Sensing of Vegetation Based on Dual Spectrum Measurements of Reflection Coefficients

Directory of Open Access Journals (Sweden)

M. L. Belov

2017-01-01

Full Text Available Currently, a promising trend in remote sensing of environment is to monitor the vegetative cover: evaluate the productivity of agricultural crops; evaluate the moisture content of soils and the state of ecosystems; provide mapping the sites of bogging, desertification, drought, etc.; control the phases of vegetation of crops, etc.Development of monitoring systems for remote detection of vegetation sites being under unfavorable conditions (low or high temperature, excess or lack of water, soil salinity, disease, etc. is of relevance. Optical methods are the most effective for this task. These methods are based on the physical features of reflection spectra in the visible and near infrared spectral range for vegetation under unfavorable conditions and vegetation under normal conditions.One of the options of optoelectronic equipment for monitoring vegetation condition is laser equipment that allows remote sensing of vegetation from the aircraft and mapping of vegetation sites with abnormal (inactive periods of vegetation reflection spectra with a high degree of spatial resolution.The paper deals with development of a promising dual-spectrum method for laser remote sensing of vegetation. Using the experimentally measured reflection spectra of different vegetation types, mathematical modeling of probability for appropriate detection and false alarms to solve a problem of detecting the vegetation under unfavorable conditions (with abnormal reflection spectra is performed based on the results of dual-spectrum measurements of the reflection coefficient.In mathematical modeling, the lidar system was supposed to provide sensing at wavelengths of 0.532 μm and 0.85 μm. The noise of the measurement was supposed to be normal with zero mean value and mean-square value of 1% -10%.It is shown that the method of laser sensing of vegetation condition based on the results of dual-spectrum measurement of the reflection coefficient at wavelengths of 0.532 μm and 0

Multi-Objective Clustering Optimization for Multi-Channel Cooperative Spectrum Sensing in Heterogeneous Green CRNs

KAUST Repository

Celik, Abdulkadir

2016-06-27

In this paper, we address energy efficient (EE) cooperative spectrum sensing policies for large scale heterogeneous cognitive radio networks (CRNs) which consist of multiple primary channels and large number of secondary users (SUs) with heterogeneous sensing and reporting channel qualities. We approach this issue from macro and micro perspectives. Macro perspective groups SUs into clusters with the objectives: 1) total energy consumption minimization; 2) total throughput maximization; and 3) inter-cluster energy and throughput fairness. We adopt and demonstrate how to solve these using the nondominated sorting genetic algorithm-II. The micro perspective, on the other hand, operates as a sub-procedure on cluster formations decided by the macro perspective. For the micro perspectives, we first propose a procedure to select the cluster head (CH) which yields: 1) the best CH which gives the minimum total multi-hop error rate and 2) the optimal routing paths from SUs to the CH. Exploiting Poisson-Binomial distribution, a novel and generalized K-out-of-N voting rule is developed for heterogeneous CRNs to allow SUs to have different local detection performances. Then, a convex optimization framework is established to minimize the intra-cluster energy cost by jointly obtaining the optimal sensing durations and thresholds of feature detectors for the proposed voting rule. Likewise, instead of a common fixed sample size test, we developed a weighted sample size test for quantized soft decision fusion to obtain a more EE regime under heterogeneity. We have shown that the combination of proposed CH selection and cooperation schemes gives a superior performance in terms of energy efficiency and robustness against reporting error wall.

An Unsupervised Algorithm for Change Detection in Hyperspectral Remote Sensing Data Using Synthetically Fused Images and Derivative Spectral Profiles

Directory of Open Access Journals (Sweden)

Youkyung Han

2017-01-01

Full Text Available Multitemporal hyperspectral remote sensing data have the potential to detect altered areas on the earth’s surface. However, dissimilar radiometric and geometric properties between the multitemporal data due to the acquisition time or position of the sensors should be resolved to enable hyperspectral imagery for detecting changes in natural and human-impacted areas. In addition, data noise in the hyperspectral imagery spectrum decreases the change-detection accuracy when general change-detection algorithms are applied to hyperspectral images. To address these problems, we present an unsupervised change-detection algorithm based on statistical analyses of spectral profiles; the profiles are generated from a synthetic image fusion method for multitemporal hyperspectral images. This method aims to minimize the noise between the spectra corresponding to the locations of identical positions by increasing the change-detection rate and decreasing the false-alarm rate without reducing the dimensionality of the original hyperspectral data. Using a quantitative comparison of an actual dataset acquired by airborne hyperspectral sensors, we demonstrate that the proposed method provides superb change-detection results relative to the state-of-the-art unsupervised change-detection algorithms.

Implementation Aspects of a Flexible Frequency Spectrum Usage Algorithm for Cognitive OFDM Systems

DEFF Research Database (Denmark)

Sacchi, Claudio; Tonelli, Oscar; Cattoni, Andrea Fabio

2011-01-01

time on a shared spectrum chunk, emphasizes the role of resource allocation as a critical system design issue. This work is aimed at analyzing the practical issues related to the Software Defined Radio (SDR)-based implementation of a dynamic spectrum allocation algorithm, designed for OFDM...... on a Xilinx ML506 development board is performed. The main novelty proposed in this paper consists in the SDR-based implementation of a computationally-sustainable resource allocation algorithm for FSU on low-cost commercial FPGA platforms. The proposed implementation is competitive with respect to other ones...... on a Virtex 5 FPGA. Experimental results will illustrate that the selected core functionalities are effectively implementable with around 3% or less of the total FPGA computing resources....

A Plane Target Detection Algorithm in Remote Sensing Images based on Deep Learning Network Technology

Science.gov (United States)

Shuxin, Li; Zhilong, Zhang; Biao, Li

2018-01-01

Plane is an important target category in remote sensing targets and it is of great value to detect the plane targets automatically. As remote imaging technology developing continuously, the resolution of the remote sensing image has been very high and we can get more detailed information for detecting the remote sensing targets automatically. Deep learning network technology is the most advanced technology in image target detection and recognition, which provided great performance improvement in the field of target detection and recognition in the everyday scenes. We combined the technology with the application in the remote sensing target detection and proposed an algorithm with end to end deep network, which can learn from the remote sensing images to detect the targets in the new images automatically and robustly. Our experiments shows that the algorithm can capture the feature information of the plane target and has better performance in target detection with the old methods.

WSNs Microseismic Signal Subsection Compression Algorithm Based on Compressed Sensing

Directory of Open Access Journals (Sweden)

Zhouzhou Liu

2015-01-01

Full Text Available For wireless network microseismic monitoring and the problems of low compression ratio and high energy consumption of communication, this paper proposes a segmentation compression algorithm according to the characteristics of the microseismic signals and the compression perception theory (CS used in the transmission process. The algorithm will be collected as a number of nonzero elements of data segmented basis, by reducing the number of combinations of nonzero elements within the segment to improve the accuracy of signal reconstruction, while taking advantage of the characteristics of compressive sensing theory to achieve a high compression ratio of the signal. Experimental results show that, in the quantum chaos immune clone refactoring (Q-CSDR algorithm for reconstruction algorithm, under the condition of signal sparse degree higher than 40, to be more than 0.4 of the compression ratio to compress the signal, the mean square error is less than 0.01, prolonging the network life by 2 times.

Research on fast Fourier transforms algorithm of huge remote sensing image technology with GPU and partitioning technology.

Science.gov (United States)

Yang, Xue; Li, Xue-You; Li, Jia-Guo; Ma, Jun; Zhang, Li; Yang, Jan; Du, Quan-Ye

2014-02-01

Fast Fourier transforms (FFT) is a basic approach to remote sensing image processing. With the improvement of capacity of remote sensing image capture with the features of hyperspectrum, high spatial resolution and high temporal resolution, how to use FFT technology to efficiently process huge remote sensing image becomes the critical step and research hot spot of current image processing technology. FFT algorithm, one of the basic algorithms of image processing, can be used for stripe noise removal, image compression, image registration, etc. in processing remote sensing image. CUFFT function library is the FFT algorithm library based on CPU and FFTW. FFTW is a FFT algorithm developed based on CPU in PC platform, and is currently the fastest CPU based FFT algorithm function library. However there is a common problem that once the available memory or memory is less than the capacity of image, there will be out of memory or memory overflow when using the above two methods to realize image FFT arithmetic. To address this problem, a CPU and partitioning technology based Huge Remote Fast Fourier Transform (HRFFT) algorithm is proposed in this paper. By improving the FFT algorithm in CUFFT function library, the problem of out of memory and memory overflow is solved. Moreover, this method is proved rational by experiment combined with the CCD image of HJ-1A satellite. When applied to practical image processing, it improves effect of the image processing, speeds up the processing, which saves the time of computation and achieves sound result.

Compressive Sensing in Communication Systems

DEFF Research Database (Denmark)

Fyhn, Karsten

2013-01-01

. The need for cheaper, smarter and more energy efficient wireless devices is greater now than ever. This thesis addresses this problem and concerns the application of the recently developed sampling theory of compressive sensing in communication systems. Compressive sensing is the merging of signal...... acquisition and compression. It allows for sampling a signal with a rate below the bound dictated by the celebrated Shannon-Nyquist sampling theorem. In some communication systems this necessary minimum sample rate, dictated by the Shannon-Nyquist sampling theorem, is so high it is at the limit of what...... with using compressive sensing in communication systems. The main contribution of this thesis is two-fold: 1) a new compressive sensing hardware structure for spread spectrum signals, which is simpler than the current state-of-the-art, and 2) a range of algorithms for parameter estimation for the class...

A novel start algorithm for CNG engines using ion sense technology

NARCIS (Netherlands)

Bie, T. de; Ericsson, M.; Rask, P.

2000-01-01

This paper presents a start algorithm that is able to control the air/fuel ratio (AFR) during the cranking phase and immediately hereafter, where the ordinary ?-control is not yet enabled. The control is based on the ion sense principle, which means that a current through the spark plug is measured

Comparison of remote sensing algorithms for retrieval of suspended particulate matter concentration from reflectance in coastal waters

Science.gov (United States)

Freeman, Lauren A.; Ackleson, Steven G.; Rhea, William Joseph

2017-10-01

Suspended particulate matter (SPM) is a key environmental indicator for rivers, estuaries, and coastal waters, which can be calculated from remote sensing reflectance obtained by an airborne or satellite imager. Here, algorithms from prior studies are applied to a dataset of in-situ at surface hyperspectral remote sensing reflectance, collected in three geographic regions representing different water types. These data show the optically inherent exponential nature of the relationship between reflectance and sediment concentration. However, linear models are also shown to provide a reasonable estimate of sediment concentration when utilized with care in similar conditions to those under which the algorithms were developed, particularly at lower SPM values (0 to 20 mg/L). Fifteen published SPM algorithms are tested, returning strong correlations of R2>0.7, and in most cases, R2>0.8. Very low SPM values show weaker correlation with algorithm calculated SPM that is not wavelength dependent. None of the tested algorithms performs well for high SPM values (>30 mg/L), with most algorithms underestimating SPM. A shift toward a smaller number of simple exponential or linear models relating satellite remote sensing reflectance to suspended sediment concentration with regional consideration will greatly aid larger spatiotemporal studies of suspended sediment trends.

Genetic algorithms - A new technique for solving the neutron spectrum unfolding problem

International Nuclear Information System (INIS)

Freeman, David W.; Edwards, D. Ray; Bolon, Albert E.

1999-01-01

A new technique utilizing genetic algorithms has been applied to the Bonner sphere neutron spectrum unfolding problem. Genetic algorithms are part of a relatively new field of 'evolutionary' solution techniques that mimic living systems with computer-simulated 'chromosome' solutions. Solutions mate and mutate to create better solutions. Several benchmark problems, considered representative of radiation protection environments, have been evaluated using the newly developed UMRGA code which implements the genetic algorithm unfolding technique. The results are compared with results from other well-established unfolding codes. The genetic algorithm technique works remarkably well and produces solutions with relatively high spectral qualities. UMRGA appears to be a superior technique in the absence of a priori data - it does not rely on 'lucky' guesses of input spectra. Calculated personnel doses associated with the unfolded spectra match benchmark values within a few percent

Higher-Order Cyclostationarity Detection for Spectrum Sensing

Directory of Open Access Journals (Sweden)

Julien Renard

2010-01-01

Full Text Available Recent years have shown a growing interest in the concept of Cognitive Radios (CRs, able to access portions of the electromagnetic spectrum in an opportunistic operating way. Such systems require efficient detectors able to work in low Signal-to-Noise Ratio (SNR environments, with little or no information about the signals they are trying to detect. Energy detectors are widely used to perform such blind detection tasks, but quickly reach the so-called SNR wall below which detection becomes impossible Tandra (2005. Cyclostationarity detectors are an interesting alternative to energy detectors, as they exploit hidden periodicities present in man-made signals, but absent in noise. Such detectors use quadratic transformations of the signals to extract the hidden sine-waves. While most of the literature focuses on the second-order transformations of the signals, we investigate the potential of higher-order transformations of the signals. Using the theory of Higher-Order Cyclostationarity (HOCS, we derive a fourth-order detector that performs similarly to the second-order ones to detect linearly modulated signals, at SNR around 0 dB, which may be used if the signals of interest do not exhibit second-order cyclostationarity. More generally this paper reviews the relevant aspects of the cyclostationary and HOCS theory, and shows their potential for spectrum sensing.

A Compressed Sensing-based Image Reconstruction Algorithm for Solar Flare X-Ray Observations

Energy Technology Data Exchange (ETDEWEB)

Felix, Simon; Bolzern, Roman; Battaglia, Marina, E-mail: simon.felix@fhnw.ch, E-mail: roman.bolzern@fhnw.ch, E-mail: marina.battaglia@fhnw.ch [University of Applied Sciences and Arts Northwestern Switzerland FHNW, 5210 Windisch (Switzerland)

2017-11-01

One way of imaging X-ray emission from solar flares is to measure Fourier components of the spatial X-ray source distribution. We present a new compressed sensing-based algorithm named VIS-CS, which reconstructs the spatial distribution from such Fourier components. We demonstrate the application of the algorithm on synthetic and observed solar flare X-ray data from the Reuven Ramaty High Energy Solar Spectroscopic Imager satellite and compare its performance with existing algorithms. VIS-CS produces competitive results with accurate photometry and morphology, without requiring any algorithm- and X-ray-source-specific parameter tuning. Its robustness and performance make this algorithm ideally suited for the generation of quicklook images or large image cubes without user intervention, such as for imaging spectroscopy analysis.

A Compressed Sensing-based Image Reconstruction Algorithm for Solar Flare X-Ray Observations

Science.gov (United States)

Felix, Simon; Bolzern, Roman; Battaglia, Marina

2017-11-01

One way of imaging X-ray emission from solar flares is to measure Fourier components of the spatial X-ray source distribution. We present a new compressed sensing-based algorithm named VIS_CS, which reconstructs the spatial distribution from such Fourier components. We demonstrate the application of the algorithm on synthetic and observed solar flare X-ray data from the Reuven Ramaty High Energy Solar Spectroscopic Imager satellite and compare its performance with existing algorithms. VIS_CS produces competitive results with accurate photometry and morphology, without requiring any algorithm- and X-ray-source-specific parameter tuning. Its robustness and performance make this algorithm ideally suited for the generation of quicklook images or large image cubes without user intervention, such as for imaging spectroscopy analysis.

Distributed opportunistic spectrum sharing in cognitive radio networks

KAUST Repository

Hawa, Mohammed

2016-05-19

In cases where the licensed radio spectrum is underutilized, cognitive radio technology enables cognitive devices to sense and then dynamically access this scarce resource making the most out of it. In this work, we introduce a simple and intuitive, yet powerful and efficient, technique that allows opportunistic channel access in cognitive radio systems in a completely distributed fashion. Our proposed method achieves very high values of spectrum utilization and throughput. It also minimizes interference between cognitive base stations and the primary users licensed to use the spectrum. The algorithm responds quickly and efficiently to variations in the network parameters and also achieves a high degree of fairness between cognitive base stations. © 2016 John Wiley & Sons, Ltd.

A new stellar spectrum interpolation algorithm and its application to Yunnan-III evolutionary population synthesis models

Science.gov (United States)

Cheng, Liantao; Zhang, Fenghui; Kang, Xiaoyu; Wang, Lang

2018-05-01

In evolutionary population synthesis (EPS) models, we need to convert stellar evolutionary parameters into spectra via interpolation in a stellar spectral library. For theoretical stellar spectral libraries, the spectrum grid is homogeneous on the effective-temperature and gravity plane for a given metallicity. It is relatively easy to derive stellar spectra. For empirical stellar spectral libraries, stellar parameters are irregularly distributed and the interpolation algorithm is relatively complicated. In those EPS models that use empirical stellar spectral libraries, different algorithms are used and the codes are often not released. Moreover, these algorithms are often complicated. In this work, based on a radial basis function (RBF) network, we present a new spectrum interpolation algorithm and its code. Compared with the other interpolation algorithms that are used in EPS models, it can be easily understood and is highly efficient in terms of computation. The code is written in MATLAB scripts and can be used on any computer system. Using it, we can obtain the interpolated spectra from a library or a combination of libraries. We apply this algorithm to several stellar spectral libraries (such as MILES, ELODIE-3.1 and STELIB-3.2) and give the integrated spectral energy distributions (ISEDs) of stellar populations (with ages from 1 Myr to 14 Gyr) by combining them with Yunnan-III isochrones. Our results show that the differences caused by the adoption of different EPS model components are less than 0.2 dex. All data about the stellar population ISEDs in this work and the RBF spectrum interpolation code can be obtained by request from the first author or downloaded from http://www1.ynao.ac.cn/˜zhangfh.

GMG: A Guaranteed, Efficient Global Optimization Algorithm for Remote Sensing.

Energy Technology Data Exchange (ETDEWEB)

D' Helon, CD

2004-08-18

The monocular passive ranging (MPR) problem in remote sensing consists of identifying the precise range of an airborne target (missile, plane, etc.) from its observed radiance. This inverse problem may be set as a global optimization problem (GOP) whereby the difference between the observed and model predicted radiances is minimized over the possible ranges and atmospheric conditions. Using additional information about the error function between the predicted and observed radiances of the target, we developed GMG, a new algorithm to find the Global Minimum with a Guarantee. The new algorithm transforms the original continuous GOP into a discrete search problem, thereby guaranteeing to find the position of the global minimum in a reasonably short time. The algorithm is first applied to the golf course problem, which serves as a litmus test for its performance in the presence of both complete and degraded additional information. GMG is further assessed on a set of standard benchmark functions and then applied to various realizations of the MPR problem.

Multimedia over cognitive radio networks algorithms, protocols, and experiments

CERN Document Server

Hu, Fei

2014-01-01

PrefaceAbout the EditorsContributorsNetwork Architecture to Support Multimedia over CRNA Management Architecture for Multimedia Communication in Cognitive Radio NetworksAlexandru O. Popescu, Yong Yao, Markus Fiedler , and Adrian P. PopescuPaving a Wider Way for Multimedia over Cognitive Radios: An Overview of Wideband Spectrum Sensing AlgorithmsBashar I. Ahmad, Hongjian Sun, Cong Ling, and Arumugam NallanathanBargaining-Based Spectrum Sharing for Broadband Multimedia Services in Cognitive Radio NetworkYang Yan, Xiang Chen, Xiaofeng Zhong, Ming Zhao, and Jing WangPhysical Layer Mobility Challen

Exact performance of cooperative spectrum sensing for cognitive radios with quantized information under imperfect reporting channels

KAUST Repository

Ben Ghorbel, Mahdi

2013-09-01

Spectrum sensing is the first and main step for cognitive radio systems to achieve an efficient use of the spectrum. Cooperation among cognitive radio users is a technique employed to improve the sensing performance by exploiting the diversity between the sensing channels to overcome the fading and shadowing effects which allows reduction of miss-detection and false alarm probabilities. Information can be exchanged between cooperating users in different formats from the binary hard information to the full soft information. Quantized information has shown its efficiency as a trade-off between binary hard and full soft for other cooperative schemes, in this paper, we investigate the use of quantized information between cooperating cognitive users. We derive closed-form expressions of the cooperative average false alarm and detection probabilities over fading channels for a generalized system model with not necessarily identical average sensing Signal-to-Noise Ratio (SNR) and imperfect reporting channels. Numerical simulations allow us to conclude a tradeoff between the quantization size and the reporting energy in order to achieve the optimal cooperative error probability. Copyright © 2013 by the Institute of Electrical and Electronic Engineers, Inc.

Method of T2 spectrum inversion with conjugate gradient algorithm from NMR data

International Nuclear Information System (INIS)

Li Pengju; Shi Shangming; Song Yanjie

2010-01-01

Based on the optimization techniques, the T 2 spectrum inversion method of conjugate gradient that is easy to realize non-negativity constraint of T2 spectrum is proposed. The method transforms the linear mixed-determined problem of T2 spectrum inversion into the typical optimization problem of searching the minimum of objective function by building up the objective function according to the basic idea of geophysics modeling. The optimization problem above is solved with the conjugate gradient algorithm that has quick convergence rate and quadratic termination. The method has been applied to the inversion of noise free echo train generated from artificial spectrum, artificial echo train with signal-to-noise ratio (SNR)=25 and NMR experimental data of drilling core. The comparison between the inversion results of this paper and artificial spectrum or the result of software imported in NMR laboratory shows that the method can correctly invert T 2 spectrum from artificial NMR relaxation data even though SNR=25 and that inversion T 2 spectrum with good continuity and smoothness from core NMR experimental data accords perfectly with that of laboratory software imported, and moreover,the absolute error between the NMR porosity computed from T 2 spectrum and helium (He) porosity in laboratory is 0.65%. (authors)

Multispectral remote-sensing algorithms for particulate organic carbon (POC): The Gulf of Mexico

OpenAIRE

Son, Young Baek; Gardner, Wilford D.; Mishonov, Alexey V.; Richardson, Mary Jo

2009-01-01

To greatly increase the spatial and temporal resolution for studying carbon dynamics in the marine environment, we have developed remote-sensing algorithms for particulate organic carbon (POC) by matching in situ POC measurements in the Gulf of Mexico with matching SeaWiFS remote-sensing reflectance. Data on total particulate matter (PM) as well as POC collected during nine cruises in spring, summer and early winter from 1997-2000 as part of the Northeastern Gulf of Mexico (NEGOM) study were ...

Multifractal signal reconstruction based on singularity power spectrum

International Nuclear Information System (INIS)

Xiong, Gang; Yu, Wenxian; Xia, Wenxiang; Zhang, Shuning

2016-01-01

Highlights: • We propose a novel multifractal reconstruction method based on singularity power spectrum analysis (MFR-SPS). • The proposed MFR-SPS method has better power characteristic than the algorithm in Fraclab. • Further, the SPS-ISE algorithm performs better than the SPS-MFS algorithm. • Based on the proposed MFR-SPS method, we can restructure singularity white fractal noise (SWFN) and linear singularity modulation (LSM) multifractal signal, in equivalent sense, similar with the linear frequency modulation(LFM) signal and WGN in the Fourier domain. - Abstract: Fractal reconstruction (FR) and multifractal reconstruction (MFR) can be considered as the inverse problem of singularity spectrum analysis, and it is challenging to reconstruct fractal signal in accord with multifractal spectrum (MFS). Due to the multiple solutions of fractal reconstruction, the traditional methods of FR/MFR, such as FBM based method, wavelet based method, random wavelet series, fail to reconstruct fractal signal deterministically, and besides, those methods neglect the power spectral distribution in the singular domain. In this paper, we propose a novel MFR method based singularity power spectrum (SPS). Supposing the consistent uniform covering of multifractal measurement, we control the traditional power law of each scale of wavelet coefficients based on the instantaneous singularity exponents (ISE) or MFS, simultaneously control the singularity power law based on the SPS, and deduce the principle and algorithm of MFR based on SPS. Reconstruction simulation and error analysis of estimated ISE, MFS and SPS show the effectiveness and the improvement of the proposed methods compared to those obtained by the Fraclab package.

Detection of Defective Sensors in Phased Array Using Compressed Sensing and Hybrid Genetic Algorithm

Directory of Open Access Journals (Sweden)

Shafqat Ullah Khan

2016-01-01

Full Text Available A compressed sensing based array diagnosis technique has been presented. This technique starts from collecting the measurements of the far-field pattern. The system linking the difference between the field measured using the healthy reference array and the field radiated by the array under test is solved using a genetic algorithm (GA, parallel coordinate descent (PCD algorithm, and then a hybridized GA with PCD algorithm. These algorithms are applied for fully and partially defective antenna arrays. The simulation results indicate that the proposed hybrid algorithm outperforms in terms of localization of element failure with a small number of measurements. In the proposed algorithm, the slow and early convergence of GA has been avoided by combining it with PCD algorithm. It has been shown that the hybrid GA-PCD algorithm provides an accurate diagnosis of fully and partially defective sensors as compared to GA or PCD alone. Different simulations have been provided to validate the performance of the designed algorithms in diversified scenarios.

Hybrid Accuracy-Time Trade-off Solution for Spectrum Sensing in Cognitive Radio Networks

DEFF Research Database (Denmark)

Ivanov, Antoni Stefkov; Mihovska, Albena Dimitrova; Poulkov, Vladimir

2018-01-01

parameters, therefore, a suitable trade-off is necessary for an optimal efficiency. We propose a dual-approach solution. The decision about the spectrum occupancy is made using the measured signal-to-noise ratio (SNR) and the received signal levels as inputs in a fuzzy logic algorithm. The result...

Smart Soft-Sensing for the Feedwater Flowrate at PWRs Using a GMDH Algorithm

Science.gov (United States)

Lim, Dong Hyuk; Lee, Sung Han; Na, Man Gyun

2010-02-01

The thermal reactor power in pressurized water reactors (PWRs) is typically assessed using secondary system calorimetric calculations based on accurate measurements of the feedwater flowrate. Therefore, precise measurements of the feedwater flowrate are essential. In most PWRs, Venturi meters are used to measure the feedwater flowrate. However, the fouling phenomena of the Venturi meter deteriorate the accuracy of the existing hardware sensors. Consequently, it is essential to resolve the inaccurate measurements of the feedwater flowrate. In this study, in order to estimate the feedwater flowrate online with high precision, a smart soft sensing model for monitoring the feedwater flowrate was developed using a group method of data handling (GMDH) algorithm combined with a sequential probability ratio test (SPRT). The uncertainty of the GMDH model was also analyzed. The proposed sensing and monitoring algorithm was verified using the acquired real plant data from Yonggwang Nuclear Power Plant Unit 3.

Research on fully distributed optical fiber sensing security system localization algorithm

Science.gov (United States)

Wu, Xu; Hou, Jiacheng; Liu, Kun; Liu, Tiegen

2013-12-01

A new fully distributed optical fiber sensing and location technology based on the Mach-Zehnder interferometers is studied. In this security system, a new climbing point locating algorithm based on short-time average zero-crossing rate is presented. By calculating the zero-crossing rates of the multiple grouped data separately, it not only utilizes the advantages of the frequency analysis method to determine the most effective data group more accurately, but also meets the requirement of the real-time monitoring system. Supplemented with short-term energy calculation group signal, the most effective data group can be quickly picked out. Finally, the accurate location of the climbing point can be effectively achieved through the cross-correlation localization algorithm. The experimental results show that the proposed algorithm can realize the accurate location of the climbing point and meanwhile the outside interference noise of the non-climbing behavior can be effectively filtered out.

Elaborate analysis and design of filter-bank-based sensing for wideband cognitive radios

Science.gov (United States)

Maliatsos, Konstantinos; Adamis, Athanasios; Kanatas, Athanasios G.

2014-12-01

The successful operation of a cognitive radio system strongly depends on its ability to sense the radio environment. With the use of spectrum sensing algorithms, the cognitive radio is required to detect co-existing licensed primary transmissions and to protect them from interference. This paper focuses on filter-bank-based sensing and provides a solid theoretical background for the design of these detectors. Optimum detectors based on the Neyman-Pearson theorem are developed for uniform discrete Fourier transform (DFT) and modified DFT filter banks with root-Nyquist filters. The proposed sensing framework does not require frequency alignment between the filter bank of the sensor and the primary signal. Each wideband primary channel is spanned and monitored by several sensor subchannels that analyse it in narrowband signals. Filter-bank-based sensing is proved to be robust and efficient under coloured noise. Moreover, the performance of the weighted energy detector as a sensing technique is evaluated. Finally, based on the Locally Most Powerful and the Generalized Likelihood Ratio test, real-world sensing algorithms that do not require a priori knowledge are proposed and tested.

Secondary access based on sensing and primary ARQ feedback in spectrum sharing systems

KAUST Repository

Hamza, Doha R.

2012-04-01

In the context of primary/secondary spectrum sharing, we propose a randomized secondary access strategy with access probabilities that are a function of both the primary automatic repeat request (ARQ) feedback and the spectrum sensing outcome. The primary terminal operates in a time slotted fashion and is active only when it has a packet to send. The primary receiver can send a positive acknowledgment (ACK) when the received packet is decoded correctly. Lack of ARQ feedback is interpreted as erroneous reception or inactivity. We call this the explicit ACK scheme. The primary receiver may also send a negative acknowledgment (NACK) when the packet is received in error. Lack of ARQ feedback is interpreted as an ACK or no-transmission. This is called the explicit NACK scheme. Under both schemes, when the primary feedback is interpreted as a NACK, the secondary user assumes that there will be retransmission in the next slot and accesses the channel with a certain probability. When the primary feedback is interpreted as an ACK, the secondary user accesses the channel with either one of two probabilities based on the sensing outcome. Under these settings, we find the three optimal access probabilities via maximizing the secondary throughput given a constraint on the primary throughput. We compare the performance of the explicit ACK and explicit NACK schemes and contrast them with schemes based on either sensing or primary ARQ feedback only. © 2012 IEEE.

Spectrum correction algorithm for detectors in airborne radioactivity monitoring equipment NH-UAV based on a ratio processing method

International Nuclear Information System (INIS)

Cao, Ye; Tang, Xiao-Bin; Wang, Peng; Meng, Jia; Huang, Xi; Wen, Liang-Sheng; Chen, Da

2015-01-01

The unmanned aerial vehicle (UAV) radiation monitoring method plays an important role in nuclear accidents emergency. In this research, a spectrum correction algorithm about the UAV airborne radioactivity monitoring equipment NH-UAV was studied to measure the radioactive nuclides within a small area in real time and in a fixed place. The simulation spectra of the high-purity germanium (HPGe) detector and the lanthanum bromide (LaBr 3 ) detector in the equipment were obtained using the Monte Carlo technique. Spectrum correction coefficients were calculated after performing ratio processing techniques about the net peak areas between the double detectors on the detection spectrum of the LaBr 3 detector according to the accuracy of the detection spectrum of the HPGe detector. The relationship between the spectrum correction coefficient and the size of the source term was also investigated. A good linear relation exists between the spectrum correction coefficient and the corresponding energy (R 2 =0.9765). The maximum relative deviation from the real condition reduced from 1.65 to 0.035. The spectrum correction method was verified as feasible. - Highlights: • An airborne radioactivity monitoring equipment NH-UAV was developed to measure radionuclide after a nuclear accident. • A spectrum correction algorithm was proposed to obtain precise information on the detected radioactivity within a small area. • The spectrum correction method was verified as feasible. • The corresponding spectrum correction coefficients increase first and then stay constant

Spectrum correction algorithm for detectors in airborne radioactivity monitoring equipment NH-UAV based on a ratio processing method

Energy Technology Data Exchange (ETDEWEB)

Cao, Ye [Department of Nuclear Science and Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016 (China); Tang, Xiao-Bin, E-mail: tangxiaobin@nuaa.edu.cn [Department of Nuclear Science and Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016 (China); Jiangsu Key Laboratory of Nuclear Energy Equipment Materials Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016 (China); Wang, Peng; Meng, Jia; Huang, Xi; Wen, Liang-Sheng [Department of Nuclear Science and Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016 (China); Chen, Da [Department of Nuclear Science and Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016 (China); Jiangsu Key Laboratory of Nuclear Energy Equipment Materials Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016 (China)

2015-10-11

The unmanned aerial vehicle (UAV) radiation monitoring method plays an important role in nuclear accidents emergency. In this research, a spectrum correction algorithm about the UAV airborne radioactivity monitoring equipment NH-UAV was studied to measure the radioactive nuclides within a small area in real time and in a fixed place. The simulation spectra of the high-purity germanium (HPGe) detector and the lanthanum bromide (LaBr{sub 3}) detector in the equipment were obtained using the Monte Carlo technique. Spectrum correction coefficients were calculated after performing ratio processing techniques about the net peak areas between the double detectors on the detection spectrum of the LaBr{sub 3} detector according to the accuracy of the detection spectrum of the HPGe detector. The relationship between the spectrum correction coefficient and the size of the source term was also investigated. A good linear relation exists between the spectrum correction coefficient and the corresponding energy (R{sup 2}=0.9765). The maximum relative deviation from the real condition reduced from 1.65 to 0.035. The spectrum correction method was verified as feasible. - Highlights: • An airborne radioactivity monitoring equipment NH-UAV was developed to measure radionuclide after a nuclear accident. • A spectrum correction algorithm was proposed to obtain precise information on the detected radioactivity within a small area. • The spectrum correction method was verified as feasible. • The corresponding spectrum correction coefficients increase first and then stay constant.

A Dynamic Spectrum Allocation Algorithm for a Maritime Cognitive Radio Communication System Based on a Queuing Model

Directory of Open Access Journals (Sweden)

Jingbo Zhang

2017-09-01

Full Text Available With the rapid development of maritime digital communication, the demand for spectrum resources is increasing, and building a maritime cognitive radio communication system is an effective solution. In this paper, the problem of how to effectively allocate the spectrum for secondary users (SUs with different priorities in a maritime cognitive radio communication system is studied. According to the characteristics of a maritime cognitive radio and existing research about cognitive radio systems, this paper establishes a centralized maritime cognitive radio communication model and creates a simplified queuing model with two queues for the communication model. In the view of the behaviors of SUs and primary users (PUs, we propose a dynamic spectrum allocation (DSA algorithm based on the system status, and analyze it with a two-dimensional Markov chain. Simulation results show that, when different types of SUs have similar arrival rates, the algorithm can vary the priority factor according to the change of users’ status in the system, so as to adjust the channel allocation, decreasing system congestion. The improvement of the algorithm is about 7–26%, and the specific improvement is negatively correlated with the SU arrival rate.

A stereo remote sensing feature selection method based on artificial bee colony algorithm

Science.gov (United States)

Yan, Yiming; Liu, Pigang; Zhang, Ye; Su, Nan; Tian, Shu; Gao, Fengjiao; Shen, Yi

2014-05-01

To improve the efficiency of stereo information for remote sensing classification, a stereo remote sensing feature selection method is proposed in this paper presents, which is based on artificial bee colony algorithm. Remote sensing stereo information could be described by digital surface model (DSM) and optical image, which contain information of the three-dimensional structure and optical characteristics, respectively. Firstly, three-dimensional structure characteristic could be analyzed by 3D-Zernike descriptors (3DZD). However, different parameters of 3DZD could descript different complexity of three-dimensional structure, and it needs to be better optimized selected for various objects on the ground. Secondly, features for representing optical characteristic also need to be optimized. If not properly handled, when a stereo feature vector composed of 3DZD and image features, that would be a lot of redundant information, and the redundant information may not improve the classification accuracy, even cause adverse effects. To reduce information redundancy while maintaining or improving the classification accuracy, an optimized frame for this stereo feature selection problem is created, and artificial bee colony algorithm is introduced for solving this optimization problem. Experimental results show that the proposed method can effectively improve the computational efficiency, improve the classification accuracy.

Ship detection using STFT sea background statistical modeling for large-scale oceansat remote sensing image

Science.gov (United States)

Wang, Lixia; Pei, Jihong; Xie, Weixin; Liu, Jinyuan

2018-03-01

Large-scale oceansat remote sensing images cover a big area sea surface, which fluctuation can be considered as a non-stationary process. Short-Time Fourier Transform (STFT) is a suitable analysis tool for the time varying nonstationary signal. In this paper, a novel ship detection method using 2-D STFT sea background statistical modeling for large-scale oceansat remote sensing images is proposed. First, the paper divides the large-scale oceansat remote sensing image into small sub-blocks, and 2-D STFT is applied to each sub-block individually. Second, the 2-D STFT spectrum of sub-blocks is studied and the obvious different characteristic between sea background and non-sea background is found. Finally, the statistical model for all valid frequency points in the STFT spectrum of sea background is given, and the ship detection method based on the 2-D STFT spectrum modeling is proposed. The experimental result shows that the proposed algorithm can detect ship targets with high recall rate and low missing rate.

Secure Cooperative Spectrum Sensing via a Novel User-Classification Scheme in Cognitive Radios for Future Communication Technologies

Directory of Open Access Journals (Sweden)

Muhammad Usman

2015-05-01

Full Text Available Future communication networks would be required to deliver data on a far greater scale than is known to us today, thus mandating the maximal utilization of the available radio spectrum using cognitive radios. In this paper, we have proposed a novel cooperative spectrum sensing approach for cognitive radios. In cooperative spectrum sensing, the fusion center relies on reports of the cognitive users to make a global decision. The global decision is obtained by assigning weights to the reports received from cognitive users. Computation of such weights requires prior information of the probability of detection and the probability of false alarms, which are not readily available in real scenarios. Further, the cognitive users are divided into reliable and unreliable categories based on their weighted energy by using some empirical threshold. In this paper, we propose a method to classify the cognitive users into reliable, neutral and unreliable categories without using any pre-defined or empirically-obtained threshold. Moreover, the computation of weights does not require the detection, or false alarm probabilities, or an estimate of these probabilities. Reliable cognitive users are assigned the highest weights; neutral cognitive users are assigned medium weights (less than the reliable and higher than the unreliable cognitive users’ weights; and unreliable users are assigned the least weights. We show the performance improvement of our proposed method through simulations by comparing it with the conventional cooperative spectrum sensing scheme through different metrics, like receiver operating characteristic (ROC curve and mean square error. For clarity, we also show the effect of malicious users on detection probability and false alarm probability individually through simulations.

A low complexity based spectrum management algorithm for ‘Near–Far’ problem in VDSL environment

Directory of Open Access Journals (Sweden)

Sunil Sharma

2015-10-01

Full Text Available In digital subscriber line (DSL system, crosstalk created by electromagnetic interference among twisted pairs degrades the system performance. Very high bit rate DSL (VDSL, utilizes higher bandwidth of copper cable for data transmission. During upstream transmission, a ‘Near–Far’ problem occurs in VDSL system. In this problem the far end crosstalk (FEXT is produced from near end user degrades the data rate achieved at the far end user. The effect of FEXT can be reduced by properly managing power spectral densities (PSD of transmitters of near and far users. This kind of power allocation is called dynamic spectrum management (DSM. In this paper, a new distributed DSM algorithm is proposed in which power from only those sub channels of near end user are reduced which create interference to far end user. This power back off strategy takes place with the help of power spectral density (PSD masks at interference creating sub channels of near end user. The simulation results of the proposed algorithm show an improvement in terms of data rate and approaches near to that of optimal spectrum balancing (OSB algorithm.

Sensing Technologies for Autism Spectrum Disorder Screening and Intervention

Directory of Open Access Journals (Sweden)

John-John Cabibihan

2016-12-01

Full Text Available This paper reviews the state-of-the-art in sensing technologies that are relevant for Autism Spectrum Disorder (ASD screening and therapy. This disorder is characterized by difficulties in social communication, social interactions, and repetitive behaviors. It is diagnosed during the first three years of life. Early and intensive interventions have been shown to improve the developmental trajectory of the affected children. The earlier the diagnosis, the sooner the intervention therapy can begin, thus, making early diagnosis an important research goal. Technological innovations have tremendous potential to assist with early diagnosis and improve intervention programs. The need for careful and methodological evaluation of such emerging technologies becomes important in order to assist not only the therapists and clinicians in their selection of suitable tools, but to also guide the developers of the technologies in improving hardware and software. In this paper, we survey the literatures on sensing technologies for ASD and we categorize them into eye trackers, movement trackers, electrodermal activity monitors, tactile sensors, vocal prosody and speech detectors, and sleep quality assessment devices. We assess their effectiveness and study their limitations. We also examine the challenges faced by this growing field that need to be addressed before these technologies can perform up to their theoretical potential.

Compressed-sensing wavenumber-scanning interferometry

Science.gov (United States)

Bai, Yulei; Zhou, Yanzhou; He, Zhaoshui; Ye, Shuangli; Dong, Bo; Xie, Shengli

2018-01-01

The Fourier transform (FT), the nonlinear least-squares algorithm (NLSA), and eigenvalue decomposition algorithm (EDA) are used to evaluate the phase field in depth-resolved wavenumber-scanning interferometry (DRWSI). However, because the wavenumber series of the laser's output is usually accompanied by nonlinearity and mode-hop, FT, NLSA, and EDA, which are only suitable for equidistant interference data, often lead to non-negligible phase errors. In this work, a compressed-sensing method for DRWSI (CS-DRWSI) is proposed to resolve this problem. By using the randomly spaced inverse Fourier matrix and solving the underdetermined equation in the wavenumber domain, CS-DRWSI determines the nonuniform sampling and spectral leakage of the interference spectrum. Furthermore, it can evaluate interference data without prior knowledge of the object. The experimental results show that CS-DRWSI improves the depth resolution and suppresses sidelobes. It can replace the FT as a standard algorithm for DRWSI.

SpecNet: Spectrum Sensing Sans Frontieres

OpenAIRE

Iyer, Anand Padmanabha; Chintalapudi, Krishna; Navda, Vishnu; Ramjee, Ramachandran; Padmanabhan, Venkata N; Murthy, Chandra R

2011-01-01

While the under-utilization of licensed spectrum based on measurement studies conducted in a few developed countries has spurred lots of interest in opportunistic spectrum access, there exists no infrastructure today for measuring real-time spectrum occupancy across vast geographical regions. In this paper, we present the design and implementation of SpecNet, a first-of-its-kind platform that allows spectrum analyzers around the world to be networked and efficiently used in a coordinated manner...

Joint Spectrum Sensing and Resource Allocation for OFDM-based Transmission with a Cognitive Relay

Directory of Open Access Journals (Sweden)

S. Eman Mahmoodi

2014-04-01

Full Text Available In this paper, we investigate the joint spectrum sensing and resource allocation problem to maximize throughput capacity of an OFDM-based cognitive radio link with a cognitive relay. By applying a cognitive relay that uses decode and forward (D&F, we achieve more reliable communications, generating less interference (by needing less transmit power and more diversity gain. In order to account for imperfections in spectrum sensing, the proposed schemes jointly modify energy detector thresholds and allocates transmit powers to all cognitive radio (CR subcarriers, while simultaneously assigning subcarrier pairs for secondary users (SU and the cognitive relay. This problem is cast as a constrained optimization problem with constraints on (1 interference introduced by the SU and the cognitive relay to the PUs; (2 miss-detection and false alarm probabilities and (3 subcarrier pairing for transmission on the SU transmitter and the cognitive relay and (4 minimum Quality of Service (QoS for each CR subcarrier. We propose one optimal and two suboptimal schemes all of which are compared to other schemes in the literature. Simulation results show that the proposed schemes achieve significantly higher throughput than other schemes in the literature for different relay situations.

Online identification algorithms for integrated dielectric electroactive polymer sensors and self-sensing concepts

International Nuclear Information System (INIS)

Hoffstadt, Thorben; Griese, Martin; Maas, Jürgen

2014-01-01

Transducers based on dielectric electroactive polymers (DEAP) use electrostatic pressure to convert electric energy into strain energy or vice versa. Besides this, they are also designed for sensor applications in monitoring the actual stretch state on the basis of the deformation dependent capacitive–resistive behavior of the DEAP. In order to enable an efficient and proper closed loop control operation of these transducers, e.g. in positioning or energy harvesting applications, on the one hand, sensors based on DEAP material can be integrated into the transducers and evaluated externally, and on the other hand, the transducer itself can be used as a sensor, also in terms of self-sensing. For this purpose the characteristic electrical behavior of the transducer has to be evaluated in order to determine the mechanical state. Also, adequate online identification algorithms with sufficient accuracy and dynamics are required, independent from the sensor concept utilized, in order to determine the electrical DEAP parameters in real time. Therefore, in this contribution, algorithms are developed in the frequency domain for identifications of the capacitance as well as the electrode and polymer resistance of a DEAP, which are validated by measurements. These algorithms are designed for self-sensing applications, especially if the power electronics utilized is operated at a constant switching frequency, and parasitic harmonic oscillations are induced besides the desired DC value. These oscillations can be used for the online identification, so an additional superimposed excitation is no longer necessary. For this purpose a dual active bridge (DAB) is introduced to drive the DEAP transducer. The capabilities of the real-time identification algorithm in combination with the DAB are presented in detail and discussed, finally. (paper)

Proceedings of the 1986 international geoscience and remote sensing symposium (IGARSS '86) on remote sensing: today's solutions for tomorrow's information needs, volume 1

Energy Technology Data Exchange (ETDEWEB)

Guyenne, T.D.; Hunt, J.J.

1986-08-01

New instruments with enormous information gathering abilities are being planned to provide data from all parts of the spectrum. New data processing and storage hardware, combined with fundamental advances in information systems concepts and algorithms are awaiting the research efforts to mold them for special use. Some topics covered in the proceedings are: Optical and infrared remote sensing systems; information transfer and Third World development; wave target interaction mechanisms; microwave remote sensing of sea ice; ERS-1 sensor performance, calibration, and data validation; geophysics; imaging spectrometry; image analysis systems; ocean radar scattering; marginal ice zone remote sensing; geomorphology; SAR applications; geology; multispectral image analysis; ocean wind scatterometry; passive microwave sensing; radar mapping and land use; meteorology and atmospheric sounding; and radar instrumentation.

Algorithm for removing the noise from γ energy spectrum by analyzing the evolution of the wavelet transform maxima across scales

International Nuclear Information System (INIS)

Li Tianduo; Xiao Gang; Di Yuming; Han Feng; Qiu Xiaoling

1999-01-01

The γ energy spectrum is expanded in allied energy-frequency space. By the different characterization of the evolution of wavelet transform modulus maxima across scales between energy spectrum and noise, the algorithm for removing the noise from γ energy spectrum by analyzing the evolution of the wavelet transform maxima across scales is presented. The results show, in contrast to the methods in energy space or in frequency space, the method has the advantages that the peak of energy spectrum can be indicated accurately and the energy spectrum can be reconstructed with a good approximation

Vertical Jump Height Estimation Algorithm Based on Takeoff and Landing Identification Via Foot-Worn Inertial Sensing.

Science.gov (United States)

Wang, Jianren; Xu, Junkai; Shull, Peter B

2018-03-01

Vertical jump height is widely used for assessing motor development, functional ability, and motor capacity. Traditional methods for estimating vertical jump height rely on force plates or optical marker-based motion capture systems limiting assessment to people with access to specialized laboratories. Current wearable designs need to be attached to the skin or strapped to an appendage which can potentially be uncomfortable and inconvenient to use. This paper presents a novel algorithm for estimating vertical jump height based on foot-worn inertial sensors. Twenty healthy subjects performed countermovement jumping trials and maximum jump height was determined via inertial sensors located above the toe and under the heel and was compared with the gold standard maximum jump height estimation via optical marker-based motion capture. Average vertical jump height estimation errors from inertial sensing at the toe and heel were -2.2±2.1 cm and -0.4±3.8 cm, respectively. Vertical jump height estimation with the presented algorithm via inertial sensing showed excellent reliability at the toe (ICC(2,1)=0.98) and heel (ICC(2,1)=0.97). There was no significant bias in the inertial sensing at the toe, but proportional bias (b=1.22) and fixed bias (a=-10.23cm) were detected in inertial sensing at the heel. These results indicate that the presented algorithm could be applied to foot-worn inertial sensors to estimate maximum jump height enabling assessment outside of traditional laboratory settings, and to avoid bias errors, the toe may be a more suitable location for inertial sensor placement than the heel.

Implementation of a Wavefront-Sensing Algorithm

Science.gov (United States)

Smith, Jeffrey S.; Dean, Bruce; Aronstein, David

2013-01-01

A computer program has been written as a unique implementation of an image-based wavefront-sensing algorithm reported in "Iterative-Transform Phase Retrieval Using Adaptive Diversity" (GSC-14879-1), NASA Tech Briefs, Vol. 31, No. 4 (April 2007), page 32. This software was originally intended for application to the James Webb Space Telescope, but is also applicable to other segmented-mirror telescopes. The software is capable of determining optical-wavefront information using, as input, a variable number of irradiance measurements collected in defocus planes about the best focal position. The software also uses input of the geometrical definition of the telescope exit pupil (otherwise denoted the pupil mask) to identify the locations of the segments of the primary telescope mirror. From the irradiance data and mask information, the software calculates an estimate of the optical wavefront (a measure of performance) of the telescope generally and across each primary mirror segment specifically. The software is capable of generating irradiance data, wavefront estimates, and basis functions for the full telescope and for each primary-mirror segment. Optionally, each of these pieces of information can be measured or computed outside of the software and incorporated during execution of the software.

Cognitive Radio for Smart Grid: Theory, Algorithms, and Security

Directory of Open Access Journals (Sweden)

Raghuram Ranganathan

2011-01-01

Full Text Available Recently, cognitive radio and smart grid are two areas which have received considerable research impetus. Cognitive radios are intelligent software defined radios (SDRs that efficiently utilize the unused regions of the spectrum, to achieve higher data rates. The smart grid is an automated electric power system that monitors and controls grid activities. In this paper, the novel concept of incorporating a cognitive radio network as the communications infrastructure for the smart grid is presented. A brief overview of the cognitive radio, IEEE 802.22 standard and smart grid, is provided. Experimental results obtained by using dimensionality reduction techniques such as principal component analysis (PCA, kernel PCA, and landmark maximum variance unfolding (LMVU on Wi-Fi signal measurements are presented in a spectrum sensing context. Furthermore, compressed sensing algorithms such as Bayesian compressed sensing and the compressed sensing Kalman filter is employed for recovering the sparse smart meter transmissions. From the power system point of view, a supervised learning method called support vector machine (SVM is used for the automated classification of power system disturbances. The impending problem of securing the smart grid is also addressed, in addition to the possibility of applying FPGA-based fuzzy logic intrusion detection for the smart grid.

A novel remote sensing algorithm to quantify phycocyanin in cyanobacterial algal blooms

International Nuclear Information System (INIS)

Mishra, S; Mishra, D R

2014-01-01

We present a novel three-band algorithm (PC 3 ) to retrieve phycocyanin (PC) pigment concentration in cyanobacteria laden inland waters. The water sample and remote sensing reflectance data used for PC 3 calibration and validation were acquired from highly turbid productive catfish aquaculture ponds. Since the characteristic PC absorption feature at 620 nm is contaminated with residual chlorophyll-a (Chl-a) absorption, we propose a coefficient (ψ) for isolating the PC absorption component at 620 nm. Results show that inclusion of the model coefficient relating Chl-a absorption at 620 nm–665 nm enables PC 3 to compensate for the confounding effect of Chl-a at the PC absorption band and considerably increases the accuracy of the PC prediction algorithm. In the current dataset, PC 3 produced the lowest mean relative error of prediction among all PC algorithms considered in this research. Moreover, PC 3 eliminates the nonlinear sensitivity issue of PC algorithms particularly at high PC range (>100 μg L −1 ). Therefore, introduction of PC 3 will have an immediate positive impact on studies monitoring inland and coastal cyanobacterial harmful algal blooms. (letter)

Correlation Wave-Front Sensing Algorithms for Shack-Hartmann-Based Adaptive Optics using a Point Source

International Nuclear Information System (INIS)

Poynee, L A

2003-01-01

Shack-Hartmann based Adaptive Optics system with a point-source reference normally use a wave-front sensing algorithm that estimates the centroid (center of mass) of the point-source image 'spot' to determine the wave-front slope. The centroiding algorithm suffers for several weaknesses. For a small number of pixels, the algorithm gain is dependent on spot size. The use of many pixels on the detector leads to significant propagation of read noise. Finally, background light or spot halo aberrations can skew results. In this paper an alternative algorithm that suffers from none of these problems is proposed: correlation of the spot with a ideal reference spot. The correlation method is derived and a theoretical analysis evaluates its performance in comparison with centroiding. Both simulation and data from real AO systems are used to illustrate the results. The correlation algorithm is more robust than centroiding, but requires more computation

Development of radio frequency interference detection algorithms for passive microwave remote sensing

Science.gov (United States)

Misra, Sidharth

Radio Frequency Interference (RFI) signals are man-made sources that are increasingly plaguing passive microwave remote sensing measurements. RFI is of insidious nature, with some signals low power enough to go undetected but large enough to impact science measurements and their results. With the launch of the European Space Agency (ESA) Soil Moisture and Ocean Salinity (SMOS) satellite in November 2009 and the upcoming launches of the new NASA sea-surface salinity measuring Aquarius mission in June 2011 and soil-moisture measuring Soil Moisture Active Passive (SMAP) mission around 2015, active steps are being taken to detect and mitigate RFI at L-band. An RFI detection algorithm was designed for the Aquarius mission. The algorithm performance was analyzed using kurtosis based RFI ground-truth. The algorithm has been developed with several adjustable location dependant parameters to control the detection statistics (false-alarm rate and probability of detection). The kurtosis statistical detection algorithm has been compared with the Aquarius pulse detection method. The comparative study determines the feasibility of the kurtosis detector for the SMAP radiometer, as a primary RFI detection algorithm in terms of detectability and data bandwidth. The kurtosis algorithm has superior detection capabilities for low duty-cycle radar like pulses, which are more prevalent according to analysis of field campaign data. Most RFI algorithms developed have generally been optimized for performance with individual pulsed-sinusoidal RFI sources. A new RFI detection model is developed that takes into account multiple RFI sources within an antenna footprint. The performance of the kurtosis detection algorithm under such central-limit conditions is evaluated. The SMOS mission has a unique hardware system, and conventional RFI detection techniques cannot be applied. Instead, an RFI detection algorithm for SMOS is developed and applied in the angular domain. This algorithm compares

Surpassing the Theoretical 1-Norm Phase Transition in Compressive Sensing by Tuning the Smoothed L0 Algorithm

DEFF Research Database (Denmark)

Oxvig, Christian Schou; Pedersen, Patrick Steffen; Arildsen, Thomas

2013-01-01

Reconstruction of an undersampled signal is at the root of compressive sensing: when is an algorithm capable of reconstructing the signal? what quality is achievable? and how much time does reconstruction require? We have considered the worst-case performance of the smoothed ℓ0 norm reconstruction...... algorithm in a noiseless setup. Through an empirical tuning of its parameters, we have improved the phase transition (capabilities) of the algorithm for fixed quality and required time. In this paper, we present simulation results that show a phase transition surpassing that of the theoretical ℓ1 approach......: the proposed modified algorithm obtains 1-norm phase transition with greatly reduced required computation time....

A compressed sensing based 3D resistivity inversion algorithm for hydrogeological applications

Science.gov (United States)

Ranjan, Shashi; Kambhammettu, B. V. N. P.; Peddinti, Srinivasa Rao; Adinarayana, J.

2018-04-01

Image reconstruction from discrete electrical responses pose a number of computational and mathematical challenges. Application of smoothness constrained regularized inversion from limited measurements may fail to detect resistivity anomalies and sharp interfaces separated by hydro stratigraphic units. Under favourable conditions, compressed sensing (CS) can be thought of an alternative to reconstruct the image features by finding sparse solutions to highly underdetermined linear systems. This paper deals with the development of a CS assisted, 3-D resistivity inversion algorithm for use with hydrogeologists and groundwater scientists. CS based l1-regularized least square algorithm was applied to solve the resistivity inversion problem. Sparseness in the model update vector is introduced through block oriented discrete cosine transformation, with recovery of the signal achieved through convex optimization. The equivalent quadratic program was solved using primal-dual interior point method. Applicability of the proposed algorithm was demonstrated using synthetic and field examples drawn from hydrogeology. The proposed algorithm has outperformed the conventional (smoothness constrained) least square method in recovering the model parameters with much fewer data, yet preserving the sharp resistivity fronts separated by geologic layers. Resistivity anomalies represented by discrete homogeneous blocks embedded in contrasting geologic layers were better imaged using the proposed algorithm. In comparison to conventional algorithm, CS has resulted in an efficient (an increase in R2 from 0.62 to 0.78; a decrease in RMSE from 125.14 Ω-m to 72.46 Ω-m), reliable, and fast converging (run time decreased by about 25%) solution.

Gaussian mixture models-based ship target recognition algorithm in remote sensing infrared images

Science.gov (United States)

Yao, Shoukui; Qin, Xiaojuan

2018-02-01

Since the resolution of remote sensing infrared images is low, the features of ship targets become unstable. The issue of how to recognize ships with fuzzy features is an open problem. In this paper, we propose a novel ship target recognition algorithm based on Gaussian mixture models (GMMs). In the proposed algorithm, there are mainly two steps. At the first step, the Hu moments of these ship target images are calculated, and the GMMs are trained on the moment features of ships. At the second step, the moment feature of each ship image is assigned to the trained GMMs for recognition. Because of the scale, rotation, translation invariance property of Hu moments and the power feature-space description ability of GMMs, the GMMs-based ship target recognition algorithm can recognize ship reliably. Experimental results of a large simulating image set show that our approach is effective in distinguishing different ship types, and obtains a satisfactory ship recognition performance.

A wavelet-based regularized reconstruction algorithm for SENSE parallel MRI with applications to neuroimaging

International Nuclear Information System (INIS)

Chaari, L.; Pesquet, J.Ch.; Chaari, L.; Ciuciu, Ph.; Benazza-Benyahia, A.

2011-01-01

To reduce scanning time and/or improve spatial/temporal resolution in some Magnetic Resonance Imaging (MRI) applications, parallel MRI acquisition techniques with multiple coils acquisition have emerged since the early 1990's as powerful imaging methods that allow a faster acquisition process. In these techniques, the full FOV image has to be reconstructed from the resulting acquired under sampled k-space data. To this end, several reconstruction techniques have been proposed such as the widely-used Sensitivity Encoding (SENSE) method. However, the reconstructed image generally presents artifacts when perturbations occur in both the measured data and the estimated coil sensitivity profiles. In this paper, we aim at achieving accurate image reconstruction under degraded experimental conditions (low magnetic field and high reduction factor), in which neither the SENSE method nor the Tikhonov regularization in the image domain give convincing results. To this end, we present a novel method for SENSE-based reconstruction which proceeds with regularization in the complex wavelet domain by promoting sparsity. The proposed approach relies on a fast algorithm that enables the minimization of regularized non-differentiable criteria including more general penalties than a classical l 1 term. To further enhance the reconstructed image quality, local convex constraints are added to the regularization process. In vivo human brain experiments carried out on Gradient-Echo (GRE) anatomical and Echo Planar Imaging (EPI) functional MRI data at 1.5 T indicate that our algorithm provides reconstructed images with reduced artifacts for high reduction factors. (authors)

Micro-Doppler Ambiguity Resolution Based on Short-Time Compressed Sensing

Directory of Open Access Journals (Sweden)

Jing-bo Zhuang

2015-01-01

Full Text Available When using a long range radar (LRR to track a target with micromotion, the micro-Doppler embodied in the radar echoes may suffer from ambiguity problem. In this paper, we propose a novel method based on compressed sensing (CS to solve micro-Doppler ambiguity. According to the RIP requirement, a sparse probing pulse train with its transmitting time random is designed. After matched filtering, the slow-time echo signals of the micromotion target can be viewed as randomly sparse sampling of Doppler spectrum. Select several successive pulses to form a short-time window and the CS sensing matrix can be built according to the time stamps of these pulses. Then performing Orthogonal Matching Pursuit (OMP, the unambiguous micro-Doppler spectrum can be obtained. The proposed algorithm is verified using the echo signals generated according to the theoretical model and the signals with micro-Doppler signature produced using the commercial electromagnetic simulation software FEKO.

Study on the effects of sample selection on spectral reflectance reconstruction based on the algorithm of compressive sensing

International Nuclear Information System (INIS)

Zhang, Leihong; Liang, Dong

2016-01-01

In order to solve the problem that reconstruction efficiency and precision is not high, in this paper different samples are selected to reconstruct spectral reflectance, and a new kind of spectral reflectance reconstruction method based on the algorithm of compressive sensing is provided. Four different color numbers of matte color cards such as the ColorChecker Color Rendition Chart and Color Checker SG, the copperplate paper spot color card of Panton, and the Munsell colors card are chosen as training samples, the spectral image is reconstructed respectively by the algorithm of compressive sensing and pseudo-inverse and Wiener, and the results are compared. These methods of spectral reconstruction are evaluated by root mean square error and color difference accuracy. The experiments show that the cumulative contribution rate and color difference of the Munsell colors card are better than those of the other three numbers of color cards in the same conditions of reconstruction, and the accuracy of the spectral reconstruction will be affected by the training sample of different numbers of color cards. The key technology of reconstruction means that the uniformity and representation of the training sample selection has important significance upon reconstruction. In this paper, the influence of the sample selection on the spectral image reconstruction is studied. The precision of the spectral reconstruction based on the algorithm of compressive sensing is higher than that of the traditional algorithm of spectral reconstruction. By the MATLAB simulation results, it can be seen that the spectral reconstruction precision and efficiency are affected by the different color numbers of the training sample. (paper)

Pyramidal Watershed Segmentation Algorithm for High-Resolution Remote Sensing Images Using Discrete Wavelet Transforms

Directory of Open Access Journals (Sweden)

K. Parvathi

2009-01-01

Full Text Available The watershed transformation is a useful morphological segmentation tool for a variety of grey-scale images. However, over segmentation and under segmentation have become the key problems for the conventional algorithm. In this paper, an efficient segmentation method for high-resolution remote sensing image analysis is presented. Wavelet analysis is one of the most popular techniques that can be used to detect local intensity variation and hence the wavelet transformation is used to analyze the image. Wavelet transform is applied to the image, producing detail (horizontal, vertical, and diagonal and Approximation coefficients. The image gradient with selective regional minima is estimated with the grey-scale morphology for the Approximation image at a suitable resolution, and then the watershed is applied to the gradient image to avoid over segmentation. The segmented image is projected up to high resolutions using the inverse wavelet transform. The watershed segmentation is applied to small subset size image, demanding less computational time. We have applied our new approach to analyze remote sensing images. The algorithm was implemented in MATLAB. Experimental results demonstrated the method to be effective.

Electronic Health Record Based Algorithm to Identify Patients with Autism Spectrum Disorder.

Directory of Open Access Journals (Sweden)

Todd Lingren

Full Text Available Cohort selection is challenging for large-scale electronic health record (EHR analyses, as International Classification of Diseases 9th edition (ICD-9 diagnostic codes are notoriously unreliable disease predictors. Our objective was to develop, evaluate, and validate an automated algorithm for determining an Autism Spectrum Disorder (ASD patient cohort from EHR. We demonstrate its utility via the largest investigation to date of the co-occurrence patterns of medical comorbidities in ASD.We extracted ICD-9 codes and concepts derived from the clinical notes. A gold standard patient set was labeled by clinicians at Boston Children's Hospital (BCH (N = 150 and Cincinnati Children's Hospital and Medical Center (CCHMC (N = 152. Two algorithms were created: (1 rule-based implementing the ASD criteria from Diagnostic and Statistical Manual of Mental Diseases 4th edition, (2 predictive classifier. The positive predictive values (PPV achieved by these algorithms were compared to an ICD-9 code baseline. We clustered the patients based on grouped ICD-9 codes and evaluated subgroups.The rule-based algorithm produced the best PPV: (a BCH: 0.885 vs. 0.273 (baseline; (b CCHMC: 0.840 vs. 0.645 (baseline; (c combined: 0.864 vs. 0.460 (baseline. A validation at Children's Hospital of Philadelphia yielded 0.848 (PPV. Clustering analyses of comorbidities on the three-site large cohort (N = 20,658 ASD patients identified psychiatric, developmental, and seizure disorder clusters.In a large cross-institutional cohort, co-occurrence patterns of comorbidities in ASDs provide further hypothetical evidence for distinct courses in ASD. The proposed automated algorithms for cohort selection open avenues for other large-scale EHR studies and individualized treatment of ASD.

Comparative Study on a Solving Model and Algorithm for a Flush Air Data Sensing System

Directory of Open Access Journals (Sweden)

Yanbin Liu

2014-05-01

Full Text Available With the development of high-performance aircraft, precise air data are necessary to complete challenging tasks such as flight maneuvering with large angles of attack and high speed. As a result, the flush air data sensing system (FADS was developed to satisfy the stricter control demands. In this paper, comparative stuides on the solving model and algorithm for FADS are conducted. First, the basic principles of FADS are given to elucidate the nonlinear relations between the inputs and the outputs. Then, several different solving models and algorithms of FADS are provided to compute the air data, including the angle of attck, sideslip angle, dynamic pressure and static pressure. Afterwards, the evaluation criteria of the resulting models and algorithms are discussed to satisfy the real design demands. Futhermore, a simulation using these algorithms is performed to identify the properites of the distinct models and algorithms such as the measuring precision and real-time features. The advantages of these models and algorithms corresponding to the different flight conditions are also analyzed, furthermore, some suggestions on their engineering applications are proposed to help future research.

A sea-land segmentation algorithm based on multi-feature fusion for a large-field remote sensing image

Science.gov (United States)

Li, Jing; Xie, Weixin; Pei, Jihong

2018-03-01

Sea-land segmentation is one of the key technologies of sea target detection in remote sensing images. At present, the existing algorithms have the problems of low accuracy, low universality and poor automatic performance. This paper puts forward a sea-land segmentation algorithm based on multi-feature fusion for a large-field remote sensing image removing island. Firstly, the coastline data is extracted and all of land area is labeled by using the geographic information in large-field remote sensing image. Secondly, three features (local entropy, local texture and local gradient mean) is extracted in the sea-land border area, and the three features combine a 3D feature vector. And then the MultiGaussian model is adopted to describe 3D feature vectors of sea background in the edge of the coastline. Based on this multi-gaussian sea background model, the sea pixels and land pixels near coastline are classified more precise. Finally, the coarse segmentation result and the fine segmentation result are fused to obtain the accurate sea-land segmentation. Comparing and analyzing the experimental results by subjective vision, it shows that the proposed method has high segmentation accuracy, wide applicability and strong anti-disturbance ability.

The Improved Adaptive Silence Period Algorithm over Time-Variant Channels in the Cognitive Radio System

Directory of Open Access Journals (Sweden)

Jingbo Zhang

2018-01-01

Full Text Available In the field of cognitive radio spectrum sensing, the adaptive silence period management mechanism (ASPM has improved the problem of the low time-resource utilization rate of the traditional silence period management mechanism (TSPM. However, in the case of the low signal-to-noise ratio (SNR, the ASPM algorithm will increase the probability of missed detection for the primary user (PU. Focusing on this problem, this paper proposes an improved adaptive silence period management (IA-SPM algorithm which can adaptively adjust the sensing parameters of the current period in combination with the feedback information from the data communication with the sensing results of the previous period. The feedback information in the channel is achieved with frequency resources rather than time resources in order to adapt to the parameter change in the time-varying channel. The Monte Carlo simulation results show that the detection probability of the IA-SPM is 10–15% higher than that of the ASPM under low SNR conditions.

Optimal Pricing of Spectrum Resources in Wireless Opportunistic Access

Directory of Open Access Journals (Sweden)

Hanna Bogucka

2012-01-01

Full Text Available We consider opportunistic access to spectrum resources in cognitive wireless networks. The users equipment, or the network nodes in general are able to sense the spectrum and adopt a subset of available resources (the spectrum and the power individually and independently in a distributed manner, that is, based on their local channel quality information and not knowing the Channel State Information (CSI of the other nodes' links in the considered network area. In such a network scenery, the competition of nodes for available resources is observed, which can be modeled as a game. To obtain spectrally efficient and fair spectrum allocation in this competitive environment with the nodes having no information on the other players, taxation of resources is applied to coerce desired behavior of the competitors. In the paper, we present mathematical formulation of the problem of finding the optimal taxation rate (common for all nodes and propose a reduced-complexity algorithm for this optimization. Simulation results for these derived optimal values in various scenarios are also provided.

Application of an ADS-B Sense and Avoid Algorithm

Science.gov (United States)

Arteaga, Ricardo; Kotcher, Robert; Cavalin, Moshe; Dandachy, Mohammed

2016-01-01

The National Aeronautics and Space Administration Armstrong Flight Research Center in Edwards, California is leading a program aimed towards integrating unmanned aircraft system into the national airspace system (UAS in the NAS). The overarching goal of the program is to reduce technical barriers associated with related safety issues as well as addressing challenges that will allow UAS routine access to the national airspace. This research paper focuses on three novel ideas: (1) A design of an integrated UAS equipped with Automatic Dependent Surveillance-Broadcast that constructs a more accurate state-based airspace model; (2) The use of Stratway Algorithm in a real-time environment; and (3) The verification and validation of sense and avoid performance and usability test results which provide a pilot's perspective on how our system will benefit the UAS in the NAS program for both piloted and unmanned aircraft.

Evaluation of Clear-Sky Incoming Radiation Estimating Equations Typically Used in Remote Sensing Evapotranspiration Algorithms

Directory of Open Access Journals (Sweden)

Ted W. Sammis

2013-09-01

Full Text Available Net radiation is a key component of the energy balance, whose estimation accuracy has an impact on energy flux estimates from satellite data. In typical remote sensing evapotranspiration (ET algorithms, the outgoing shortwave and longwave components of net radiation are obtained from remote sensing data, while the incoming shortwave (RS and longwave (RL components are typically estimated from weather data using empirical equations. This study evaluates the accuracy of empirical equations commonly used in remote sensing ET algorithms for estimating RS and RL radiation. Evaluation is carried out through comparison of estimates and observations at five sites that represent different climatic regions from humid to arid. Results reveal (1 both RS and RL estimates from all evaluated equations well correlate with observations (R2 ≥ 0.92, (2 RS estimating equations tend to overestimate, especially at higher values, (3 RL estimating equations tend to give more biased values in arid and semi-arid regions, (4 a model that parameterizes the diffuse component of radiation using two clearness indices and a simple model that assumes a linear increase of atmospheric transmissivity with elevation give better RS estimates, and (5 mean relative absolute errors in the net radiation (Rn estimates caused by the use of RS and RL estimating equations varies from 10% to 22%. This study suggests that Rn estimates using recommended incoming radiation estimating equations could improve ET estimates.

Incorporation of local dependent reliability information into the Prior Image Constrained Compressed Sensing (PICCS) reconstruction algorithm

International Nuclear Information System (INIS)

Vaegler, Sven; Sauer, Otto; Stsepankou, Dzmitry; Hesser, Juergen

2015-01-01

The reduction of dose in cone beam computer tomography (CBCT) arises from the decrease of the tube current for each projection as well as from the reduction of the number of projections. In order to maintain good image quality, sophisticated image reconstruction techniques are required. The Prior Image Constrained Compressed Sensing (PICCS) incorporates prior images into the reconstruction algorithm and outperforms the widespread used Feldkamp-Davis-Kress-algorithm (FDK) when the number of projections is reduced. However, prior images that contain major variations are not appropriately considered so far in PICCS. We therefore propose the partial-PICCS (pPICCS) algorithm. This framework is a problem-specific extension of PICCS and enables the incorporation of the reliability of the prior images additionally. We assumed that the prior images are composed of areas with large and small deviations. Accordingly, a weighting matrix considered the assigned areas in the objective function. We applied our algorithm to the problem of image reconstruction from few views by simulations with a computer phantom as well as on clinical CBCT projections from a head-and-neck case. All prior images contained large local variations. The reconstructed images were compared to the reconstruction results by the FDK-algorithm, by Compressed Sensing (CS) and by PICCS. To show the gain of image quality we compared image details with the reference image and used quantitative metrics (root-mean-square error (RMSE), contrast-to-noise-ratio (CNR)). The pPICCS reconstruction framework yield images with substantially improved quality even when the number of projections was very small. The images contained less streaking, blurring and inaccurately reconstructed structures compared to the images reconstructed by FDK, CS and conventional PICCS. The increased image quality is also reflected in large RMSE differences. We proposed a modification of the original PICCS algorithm. The pPICCS algorithm

Performance comparison between total variation (TV)-based compressed sensing and statistical iterative reconstruction algorithms

International Nuclear Information System (INIS)

Tang Jie; Nett, Brian E; Chen Guanghong

2009-01-01

Of all available reconstruction methods, statistical iterative reconstruction algorithms appear particularly promising since they enable accurate physical noise modeling. The newly developed compressive sampling/compressed sensing (CS) algorithm has shown the potential to accurately reconstruct images from highly undersampled data. The CS algorithm can be implemented in the statistical reconstruction framework as well. In this study, we compared the performance of two standard statistical reconstruction algorithms (penalized weighted least squares and q-GGMRF) to the CS algorithm. In assessing the image quality using these iterative reconstructions, it is critical to utilize realistic background anatomy as the reconstruction results are object dependent. A cadaver head was scanned on a Varian Trilogy system at different dose levels. Several figures of merit including the relative root mean square error and a quality factor which accounts for the noise performance and the spatial resolution were introduced to objectively evaluate reconstruction performance. A comparison is presented between the three algorithms for a constant undersampling factor comparing different algorithms at several dose levels. To facilitate this comparison, the original CS method was formulated in the framework of the statistical image reconstruction algorithms. Important conclusions of the measurements from our studies are that (1) for realistic neuro-anatomy, over 100 projections are required to avoid streak artifacts in the reconstructed images even with CS reconstruction, (2) regardless of the algorithm employed, it is beneficial to distribute the total dose to more views as long as each view remains quantum noise limited and (3) the total variation-based CS method is not appropriate for very low dose levels because while it can mitigate streaking artifacts, the images exhibit patchy behavior, which is potentially harmful for medical diagnosis.

Deterministic Compressed Sensing

Science.gov (United States)

2011-11-01

39 4.3 Digital Communications . . . . . . . . . . . . . . . . . . . . . . . . . 40 4.4 Group Testing ...deterministic de - sign matrices. All bounds ignore the O() constants. . . . . . . . . . . 131 xvi List of Algorithms 1 Iterative Hard Thresholding Algorithm...sensing is information theoretically possible using any (2k, )-RIP sensing matrix . The following celebrated results of Candès, Romberg and Tao [54

Defect-detection algorithm for noncontact acoustic inspection using spectrum entropy

Science.gov (United States)

Sugimoto, Kazuko; Akamatsu, Ryo; Sugimoto, Tsuneyoshi; Utagawa, Noriyuki; Kuroda, Chitose; Katakura, Kageyoshi

2015-07-01

In recent years, the detachment of concrete from bridges or tunnels and the degradation of concrete structures have become serious social problems. The importance of inspection, repair, and updating is recognized in measures against degradation. We have so far studied the noncontact acoustic inspection method using airborne sound and the laser Doppler vibrometer. In this method, depending on the surface state (reflectance, dirt, etc.), the quantity of the light of the returning laser decreases and optical noise resulting from the leakage of light reception arises. Some influencing factors are the stability of the output of the laser Doppler vibrometer, the low reflective characteristic of the measurement surface, the diffused reflection characteristic, measurement distance, and laser irradiation angle. If defect detection depends only on the vibration energy ratio since the frequency characteristic of the optical noise resembles white noise, the detection of optical noise resulting from the leakage of light reception may indicate a defective part. Therefore, in this work, the combination of the vibrational energy ratio and spectrum entropy is used to judge whether a measured point is healthy or defective or an abnormal measurement point. An algorithm that enables more vivid detection of a defective part is proposed. When our technique was applied in an experiment with real concrete structures, the defective part could be extracted more vividly and the validity of our proposed algorithm was confirmed.

Collaborative spectrum sensing based on the ratio between largest eigenvalue and Geometric mean of eigenvalues

KAUST Repository

Shakir, Muhammad

2011-12-01

In this paper, we introduce a new detector referred to as Geometric mean detector (GEMD) which is based on the ratio of the largest eigenvalue to the Geometric mean of the eigenvalues for collaborative spectrum sensing. The decision threshold has been derived by employing Gaussian approximation approach. In this approach, the two random variables, i.e. The largest eigenvalue and the Geometric mean of the eigenvalues are considered as independent Gaussian random variables such that their cumulative distribution functions (CDFs) are approximated by a univariate Gaussian distribution function for any number of cooperating secondary users and received samples. The approximation approach is based on the calculation of exact analytical moments of the largest eigenvalue and the Geometric mean of the eigenvalues of the received covariance matrix. The decision threshold has been calculated by exploiting the CDF of the ratio of two Gaussian distributed random variables. In this context, we exchange the analytical moments of the two random variables with the moments of the Gaussian distribution function. The performance of the detector is compared with the performance of the energy detector and eigenvalue ratio detector. Analytical and simulation results show that our newly proposed detector yields considerable performance advantage in realistic spectrum sensing scenarios. Moreover, our results based on proposed approximation approach are in perfect agreement with the empirical results. © 2011 IEEE.

Spectrum estimation method based on marginal spectrum

International Nuclear Information System (INIS)

Cai Jianhua; Hu Weiwen; Wang Xianchun

2011-01-01

FFT method can not meet the basic requirements of power spectrum for non-stationary signal and short signal. A new spectrum estimation method based on marginal spectrum from Hilbert-Huang transform (HHT) was proposed. The procession of obtaining marginal spectrum in HHT method was given and the linear property of marginal spectrum was demonstrated. Compared with the FFT method, the physical meaning and the frequency resolution of marginal spectrum were further analyzed. Then the Hilbert spectrum estimation algorithm was discussed in detail, and the simulation results were given at last. The theory and simulation shows that under the condition of short data signal and non-stationary signal, the frequency resolution and estimation precision of HHT method is better than that of FFT method. (authors)

Sensing across large-scale cognitive radio networks: Data processing, algorithms, and testbed for wireless tomography and moving target tracking

Science.gov (United States)

Bonior, Jason David

As the use of wireless devices has become more widespread so has the potential for utilizing wireless networks for remote sensing applications. Regular wireless communication devices are not typically designed for remote sensing. Remote sensing techniques must be carefully tailored to the capabilities of these networks before they can be applied. Experimental verification of these techniques and algorithms requires robust yet flexible testbeds. In this dissertation, two experimental testbeds for the advancement of research into sensing across large-scale cognitive radio networks are presented. System architectures, implementations, capabilities, experimental verification, and performance are discussed. One testbed is designed for the collection of scattering data to be used in RF and wireless tomography research. This system is used to collect full complex scattering data using a vector network analyzer (VNA) and amplitude-only data using non-synchronous software-defined radios (SDRs). Collected data is used to experimentally validate a technique for phase reconstruction using semidefinite relaxation and demonstrate the feasibility of wireless tomography. The second testbed is a SDR network for the collection of experimental data. The development of tools for network maintenance and data collection is presented and discussed. A novel recursive weighted centroid algorithm for device-free target localization using the variance of received signal strength for wireless links is proposed. The signal variance resulting from a moving target is modeled as having contours related to Cassini ovals. This model is used to formulate recursive weights which reduce the influence of wireless links that are farther from the target location estimate. The algorithm and its implementation on this testbed are presented and experimental results discussed.

Combined diversity and improved energy detection in cooperative spectrum sensing with faded reporting channels

Directory of Open Access Journals (Sweden)

Srinivas Nallagonda

2016-04-01

Full Text Available In this paper we evaluate the performance of cooperative spectrum sensing (CSS where each cognitive radio (CR employs an improved energy detector (IED with multiple antennas and uses selection combining (SC for detecting the primary user (PU in noisy and faded sensing (S channels. We derive an expression for the probability of false alarm and expressions for probability of missed detection in non-faded (AWGN and Rayleigh faded sensing environments in terms of cumulative distribution function (CDF. Each CR transmits its decision about PU via noisy and faded reporting (R channel to fusion center (FC. In this paper we assume that S-channels are noisy and Rayleigh faded while several cases of fading are considered for R-channels such as: (i Hoyt (or Nakagami-q, (ii Rayleigh, (iii Rician (or Nakagami-n, and (iv Weibull. A Binary Symmetric channel (BSC with a fixed error probability (r in the R-channel is also considered. The impact of fading in R-channel, S-channel and several network parameters such as IED parameter, normalized detection threshold, number of CRs, and number of antennas on missed detection and total error probability is assessed. The effects of Hoyt, Rician, and Weibull fading parameters on overall performance of IED-CSS are also highlighted.

Resource management for energy and spectrum harvesting sensor networks

CERN Document Server

Zhang, Deyu; Zhou, Haibo; Shen, Xuemin (Sherman)

2017-01-01

This SpringerBrief offers a comprehensive review and in-depth discussion of the current research on resource management. The authors explain how to best utilize harvested energy and temporally available licensed spectrum. Throughout the brief, the primary focus is energy and spectrum harvesting sensor networks (ESHNs) including energy harvesting (EH)-powered spectrum sensing and dynamic spectrum access. To efficiently collect data through the available licensed spectrum, this brief examines the joint management of energy and spectrum. An EH-powered spectrum sensing and management scheme for Heterogeneous Spectrum Harvesting Sensor Networks (HSHSNs) is presented in this brief. The scheme dynamically schedules the data sensing and spectrum access of sensors in ESHSNs to optimize the network utility, while considering the stochastic nature of EH process, PU activities and channel conditions. This brief also provides useful insights for the practical resource management scheme design for ESHSNs and motivates a ne...

Compressive power spectrum sensing for vibration-based output-only system identification of structural systems in the presence of noise

Science.gov (United States)

Tau Siesakul, Bamrung; Gkoktsi, Kyriaki; Giaralis, Agathoklis

2015-05-01

Motivated by the need to reduce monetary and energy consumption costs of wireless sensor networks in undertaking output-only/operational modal analysis of engineering structures, this paper considers a multi-coset analog-toinformation converter for structural system identification from acceleration response signals of white noise excited linear damped structures sampled at sub-Nyquist rates. The underlying natural frequencies, peak gains in the frequency domain, and critical damping ratios of the vibrating structures are estimated directly from the sub-Nyquist measurements and, therefore, the computationally demanding signal reconstruction step is by-passed. This is accomplished by first employing a power spectrum blind sampling (PSBS) technique for multi-band wide sense stationary stochastic processes in conjunction with deterministic non-uniform multi-coset sampling patterns derived from solving a weighted least square optimization problem. Next, modal properties are derived by the standard frequency domain peak picking algorithm. Special attention is focused on assessing the potential of the adopted PSBS technique, which poses no sparsity requirements to the sensed signals, to derive accurate estimates of modal structural system properties from noisy sub- Nyquist measurements. To this aim, sub-Nyquist sampled acceleration response signals corrupted by various levels of additive white noise pertaining to a benchmark space truss structure with closely spaced natural frequencies are obtained within an efficient Monte Carlo simulation-based framework. Accurate estimates of natural frequencies and reasonable estimates of local peak spectral ordinates and critical damping ratios are derived from measurements sampled at about 70% below the Nyquist rate and for SNR as low as 0db demonstrating that the adopted approach enjoys noise immunity.

Decision Analysis of Dynamic Spectrum Access Rules

Energy Technology Data Exchange (ETDEWEB)

Juan D. Deaton; Luiz A. DaSilva; Christian Wernz

2011-12-01

A current trend in spectrum regulation is to incorporate spectrum sharing through the design of spectrum access rules that support Dynamic Spectrum Access (DSA). This paper develops a decision-theoretic framework for regulators to assess the impacts of different decision rules on both primary and secondary operators. We analyze access rules based on sensing and exclusion areas, which in practice can be enforced through geolocation databases. Our results show that receiver-only sensing provides insufficient protection for primary and co-existing secondary users and overall low social welfare. On the other hand, using sensing information between the transmitter and receiver of a communication link, provides dramatic increases in system performance. The performance of using these link end points is relatively close to that of using many cooperative sensing nodes associated to the same access point and large link exclusion areas. These results are useful to regulators and network developers in understanding in developing rules for future DSA regulation.

抑制扩频系统中窄带干扰的新卡尔曼滤波算法%New Kalman Filtering Algorithm for Narrowband Interference Suppression in Spread Spectrum Systems

Institute of Scientific and Technical Information of China (English)

许光辉; 胡光锐

2005-01-01

A new Kalman filtering algorithm based on estimation of spread spectrum signal before suppression of narrowband interference (NBI) in spread spectrum systems, using the dependence of autoregressive (AR) interference, is presented compared with performance of the ACM nonlinear filtering algorithm, simulation results show that the proposed algorithm has preferable performance, there is about 5 dB SNR improvement in average.

Application of Reinforcement Learning in Cognitive Radio Networks: Models and Algorithms

Directory of Open Access Journals (Sweden)

Kok-Lim Alvin Yau

2014-01-01

Full Text Available Cognitive radio (CR enables unlicensed users to exploit the underutilized spectrum in licensed spectrum whilst minimizing interference to licensed users. Reinforcement learning (RL, which is an artificial intelligence approach, has been applied to enable each unlicensed user to observe and carry out optimal actions for performance enhancement in a wide range of schemes in CR, such as dynamic channel selection and channel sensing. This paper presents new discussions of RL in the context of CR networks. It provides an extensive review on how most schemes have been approached using the traditional and enhanced RL algorithms through state, action, and reward representations. Examples of the enhancements on RL, which do not appear in the traditional RL approach, are rules and cooperative learning. This paper also reviews performance enhancements brought about by the RL algorithms and open issues. This paper aims to establish a foundation in order to spark new research interests in this area. Our discussion has been presented in a tutorial manner so that it is comprehensive to readers outside the specialty of RL and CR.

Efficient Retrieval of Massive Ocean Remote Sensing Images via a Cloud-Based Mean-Shift Algorithm.

Science.gov (United States)

Yang, Mengzhao; Song, Wei; Mei, Haibin

2017-07-23

The rapid development of remote sensing (RS) technology has resulted in the proliferation of high-resolution images. There are challenges involved in not only storing large volumes of RS images but also in rapidly retrieving the images for ocean disaster analysis such as for storm surges and typhoon warnings. In this paper, we present an efficient retrieval of massive ocean RS images via a Cloud-based mean-shift algorithm. Distributed construction method via the pyramid model is proposed based on the maximum hierarchical layer algorithm and used to realize efficient storage structure of RS images on the Cloud platform. We achieve high-performance processing of massive RS images in the Hadoop system. Based on the pyramid Hadoop distributed file system (HDFS) storage method, an improved mean-shift algorithm for RS image retrieval is presented by fusion with the canopy algorithm via Hadoop MapReduce programming. The results show that the new method can achieve better performance for data storage than HDFS alone and WebGIS-based HDFS. Speedup and scaleup are very close to linear changes with an increase of RS images, which proves that image retrieval using our method is efficient.

A genetic algorithm based method for neutron spectrum unfolding

International Nuclear Information System (INIS)

Suman, Vitisha; Sarkar, P.K.

2013-03-01

An approach to neutron spectrum unfolding based on a stochastic evolutionary search mechanism - Genetic Algorithm (GA) is presented. It is tested to unfold a set of simulated spectra, the unfolded spectra is compared to the output of a standard code FERDOR. The method was then applied to a set of measured pulse height spectrum of neutrons from the AmBe source as well as of emitted neutrons from Li(p,n) and Ag(C,n) nuclear reactions carried out in the accelerator environment. The unfolded spectra compared to the output of FERDOR show good agreement in the case of AmBe spectra and Li(p,n) spectra. In the case of Ag(C,n) spectra GA method results in some fluctuations. Necessity of carrying out smoothening of the obtained solution is also studied, which leads to approximation of the solution yielding an appropriate solution finally. Few smoothing techniques like second difference smoothing, Monte Carlo averaging, combination of both and gaussian based smoothing methods are also studied. Unfolded results obtained after inclusion of the smoothening criteria are in close agreement with the output obtained from the FERDOR code. The present method is also tested on a set of underdetermined problems, the outputs of which is compared to the unfolded spectra obtained from the FERDOR applied to a completely determined problem, shows a good match. The distribution of the unfolded spectra is also studied. Uncertainty propagation in the unfolded spectra due to the errors present in the measurement as well as the response function is also carried out. The method appears to be promising for unfolding the completely determined as well as underdetermined problems. It also has provisions to carry out the uncertainty analysis. (author)

The MUSIC algorithm for sparse objects: a compressed sensing analysis

International Nuclear Information System (INIS)

Fannjiang, Albert C

2011-01-01

The multiple signal classification (MUSIC) algorithm, and its extension for imaging sparse extended objects, with noisy data is analyzed by compressed sensing (CS) techniques. A thresholding rule is developed to augment the standard MUSIC algorithm. The notion of restricted isometry property (RIP) and an upper bound on the restricted isometry constant (RIC) are employed to establish sufficient conditions for the exact localization by MUSIC with or without noise. In the noiseless case, the sufficient condition gives an upper bound on the numbers of random sampling and incident directions necessary for exact localization. In the noisy case, the sufficient condition assumes additionally an upper bound for the noise-to-object ratio in terms of the RIC and the dynamic range of objects. This bound points to the super-resolution capability of the MUSIC algorithm. Rigorous comparison of performance between MUSIC and the CS minimization principle, basis pursuit denoising (BPDN), is given. In general, the MUSIC algorithm guarantees to recover, with high probability, s scatterers with n=O(s 2 ) random sampling and incident directions and sufficiently high frequency. For the favorable imaging geometry where the scatterers are distributed on a transverse plane MUSIC guarantees to recover, with high probability, s scatterers with a median frequency and n=O(s) random sampling/incident directions. Moreover, for the problems of spectral estimation and source localizations both BPDN and MUSIC guarantee, with high probability, to identify exactly the frequencies of random signals with the number n=O(s) of sampling times. However, in the absence of abundant realizations of signals, BPDN is the preferred method for spectral estimation. Indeed, BPDN can identify the frequencies approximately with just one realization of signals with the recovery error at worst linearly proportional to the noise level. Numerical results confirm that BPDN outperforms MUSIC in the well-resolved case while

A novel power harmonic analysis method based on Nuttall-Kaiser combination window double spectrum interpolated FFT algorithm

Science.gov (United States)

Jin, Tao; Chen, Yiyang; Flesch, Rodolfo C. C.

2017-11-01

Harmonics pose a great threat to safe and economical operation of power grids. Therefore, it is critical to detect harmonic parameters accurately to design harmonic compensation equipment. The fast Fourier transform (FFT) is widely used for electrical popular power harmonics analysis. However, the barrier effect produced by the algorithm itself and spectrum leakage caused by asynchronous sampling often affects the harmonic analysis accuracy. This paper examines a new approach for harmonic analysis based on deducing the modifier formulas of frequency, phase angle, and amplitude, utilizing the Nuttall-Kaiser window double spectrum line interpolation method, which overcomes the shortcomings in traditional FFT harmonic calculations. The proposed approach is verified numerically and experimentally to be accurate and reliable.

Rapid and molecular selective electrochemical sensing of phthalates in aqueous solution

KAUST Repository

Zia, Asif I.

2015-05-01

Reported research work presents real time non-invasive detection of phthalates in spiked aqueous samples by employing electrochemical impedance spectroscopy (EIS) technique incorporating a novel interdigital capacitive sensor with multiple sensing thin film gold micro-electrodes fabricated on native silicon dioxide layer grown on semiconducting single crystal silicon wafer. The sensing surface was functionalized by a self-assembled monolayer of 3-aminopropyltrietoxysilane (APTES) with embedded molecular imprinted polymer (MIP) to introduce selectivity for the di(2-ethylhexyl) phthalate (DEHP) molecule. Various concentrations (1-100. ppm) of DEHP in deionized MilliQ water were tested using the functionalized sensing surface to capture the analyte. Frequency response analyzer (FRA) algorithm was used to obtain impedance spectra so as to determine sample conductance and capacitance for evaluation of phthalate concentration in the sample solution. Spectrum analysis algorithm interpreted the experimentally obtained impedance spectra by applying complex nonlinear least square (CNLS) curve fitting in order to obtain electrochemical equivalent circuit and corresponding circuit parameters describing the kinetics of the electrochemical cell. Principal component analysis was applied to deduce the effects of surface immobilized molecular imprinted polymer layer on the evaluated circuit parameters and its electrical response. The results obtained by the testing system were validated using commercially available high performance liquid chromatography diode array detector system.

Verification-Based Interval-Passing Algorithm for Compressed Sensing

OpenAIRE

Wu, Xiaofu; Yang, Zhen

2013-01-01

We propose a verification-based Interval-Passing (IP) algorithm for iteratively reconstruction of nonnegative sparse signals using parity check matrices of low-density parity check (LDPC) codes as measurement matrices. The proposed algorithm can be considered as an improved IP algorithm by further incorporation of the mechanism of verification algorithm. It is proved that the proposed algorithm performs always better than either the IP algorithm or the verification algorithm. Simulation resul...

A Region-Based GeneSIS Segmentation Algorithm for the Classification of Remotely Sensed Images

Directory of Open Access Journals (Sweden)

Stelios K. Mylonas

2015-03-01

Full Text Available This paper proposes an object-based segmentation/classification scheme for remotely sensed images, based on a novel variant of the recently proposed Genetic Sequential Image Segmentation (GeneSIS algorithm. GeneSIS segments the image in an iterative manner, whereby at each iteration a single object is extracted via a genetic-based object extraction algorithm. Contrary to the previous pixel-based GeneSIS where the candidate objects to be extracted were evaluated through the fuzzy content of their included pixels, in the newly developed region-based GeneSIS algorithm, a watershed-driven fine segmentation map is initially obtained from the original image, which serves as the basis for the forthcoming GeneSIS segmentation. Furthermore, in order to enhance the spatial search capabilities, we introduce a more descriptive encoding scheme in the object extraction algorithm, where the structural search modules are represented by polygonal shapes. Our objectives in the new framework are posed as follows: enhance the flexibility of the algorithm in extracting more flexible object shapes, assure high level classification accuracies, and reduce the execution time of the segmentation, while at the same time preserving all the inherent attributes of the GeneSIS approach. Finally, exploiting the inherent attribute of GeneSIS to produce multiple segmentations, we also propose two segmentation fusion schemes that operate on the ensemble of segmentations generated by GeneSIS. Our approaches are tested on an urban and two agricultural images. The results show that region-based GeneSIS has considerably lower computational demands compared to the pixel-based one. Furthermore, the suggested methods achieve higher classification accuracies and good segmentation maps compared to a series of existing algorithms.

Spectrum sharing in cognitive radio networks medium access control protocol based approach

CERN Document Server

Pandit, Shweta

2017-01-01

This book discusses the use of the spectrum sharing techniques in cognitive radio technology, in order to address the problem of spectrum scarcity for future wireless communications. The authors describe a cognitive radio medium access control (MAC) protocol, with which throughput maximization has been achieved. The discussion also includes use of this MAC protocol for imperfect sensing scenarios and its effect on the performance of cognitive radio systems. The authors also discuss how energy efficiency has been maximized in this system, by applying a simple algorithm for optimizing the transmit power of the cognitive user. The study about the channel fading in the cognitive user and licensed user and power adaption policy in this scenario under peak transmit power and interference power constraint is also present in this book.

A Proposed Algorithm for Improved Recognition and Treatment of the Depression/Anxiety Spectrum in Primary Care

Science.gov (United States)

Ballenger, James C.; Davidson, Jonathan R. T.; Lecrubier, Yves; Nutt, David J.

2001-01-01

The International Consensus Group on Depression and Anxiety has held 7 meetings over the last 3 years that focused on depression and specific anxiety disorders. During the course of the meeting series, a number of common themes have developed. At the last meeting of the Consensus Group, we reviewed these areas of commonality across the spectrum of depression and anxiety disorders. With the aim of improving the recognition and management of depression and anxiety in the primary care setting, we developed an algorithm that is presented in this article. We attempted to balance currently available scientific knowledge about the treatment of these disorders and to reformat it to provide an acceptable algorithm that meets the practical aspects of recognizing and treating these disorders in primary care. PMID:15014615

Recovering stellar population parameters via two full-spectrum fitting algorithms in the absence of model uncertainties

Science.gov (United States)

Ge, Junqiang; Yan, Renbin; Cappellari, Michele; Mao, Shude; Li, Hongyu; Lu, Youjun

2018-05-01

Using mock spectra based on Vazdekis/MILES library fitted within the wavelength region 3600-7350Å, we analyze the bias and scatter on the resulting physical parameters induced by the choice of fitting algorithms and observational uncertainties, but avoid effects of those model uncertainties. We consider two full-spectrum fitting codes: pPXF and STARLIGHT, in fitting for stellar population age, metallicity, mass-to-light ratio, and dust extinction. With pPXF we find that both the bias μ in the population parameters and the scatter σ in the recovered logarithmic values follows the expected trend μ ∝ σ ∝ 1/(S/N). The bias increases for younger ages and systematically makes recovered ages older, M*/Lr larger and metallicities lower than the true values. For reference, at S/N=30, and for the worst case (t = 108yr), the bias is 0.06 dex in M/Lr, 0.03 dex in both age and [M/H]. There is no significant dependence on either E(B-V) or the shape of the error spectrum. Moreover, the results are consistent for both our 1-SSP and 2-SSP tests. With the STARLIGHT algorithm, we find trends similar to pPXF, when the input E(B-V)values, with significantly underestimated dust extinction and [M/H], and larger ages and M*/Lr. Results degrade when moving from our 1-SSP to the 2-SSP tests. The STARLIGHT convergence to the true values can be improved by increasing Markov Chains and annealing loops to the "slow mode". For the same input spectrum, pPXF is about two order of magnitudes faster than STARLIGHT's "default mode" and about three order of magnitude faster than STARLIGHT's "slow mode".

Wideband spectrum sensing order for cognitive radios with sensing errors and channel SNR probing uncertainty

KAUST Repository

Hamza, Doha R.

2013-04-01

A secondary user (SU) seeks to transmit by sequentially sensing statistically independent primary user (PU) channels. If a channel is sensed free, it is probed to estimate the signal-to-noise ratio between the SU transmitter-receiver pair over the channel. We jointly optimize the channel sensing time, the sensing decision threshold, the channel probing time, together with the channel sensing order under imperfect synchronization between the PU and the SU. The sensing and probing times and the decision threshold are assumed to be the same for all channels. We maximize a utility function related to the SU throughput under the constraint that the collision probability with the PU is kept below a certain value and taking sensing errors into account. We illustrate the optimal policy and the variation of SU throughput with various system parameters. © 2012 IEEE.

Wideband spectrum sensing order for cognitive radios with sensing errors and channel SNR probing uncertainty

KAUST Repository

Hamza, Doha R.; Aï ssa, Sonia

2013-01-01

A secondary user (SU) seeks to transmit by sequentially sensing statistically independent primary user (PU) channels. If a channel is sensed free, it is probed to estimate the signal-to-noise ratio between the SU transmitter-receiver pair over the channel. We jointly optimize the channel sensing time, the sensing decision threshold, the channel probing time, together with the channel sensing order under imperfect synchronization between the PU and the SU. The sensing and probing times and the decision threshold are assumed to be the same for all channels. We maximize a utility function related to the SU throughput under the constraint that the collision probability with the PU is kept below a certain value and taking sensing errors into account. We illustrate the optimal policy and the variation of SU throughput with various system parameters. © 2012 IEEE.

Development of a computationally efficient algorithm for attitude estimation of a remote sensing satellite

Science.gov (United States)

Labibian, Amir; Bahrami, Amir Hossein; Haghshenas, Javad

2017-09-01

This paper presents a computationally efficient algorithm for attitude estimation of remote a sensing satellite. In this study, gyro, magnetometer, sun sensor and star tracker are used in Extended Kalman Filter (EKF) structure for the purpose of Attitude Determination (AD). However, utilizing all of the measurement data simultaneously in EKF structure increases computational burden. Specifically, assuming n observation vectors, an inverse of a 3n×3n matrix is required for gain calculation. In order to solve this problem, an efficient version of EKF, namely Murrell's version, is employed. This method utilizes measurements separately at each sampling time for gain computation. Therefore, an inverse of a 3n×3n matrix is replaced by an inverse of a 3×3 matrix for each measurement vector. Moreover, gyro drifts during the time can reduce the pointing accuracy. Therefore, a calibration algorithm is utilized for estimation of the main gyro parameters.

SENSOR++: Simulation of Remote Sensing Systems from Visible to Thermal Infrared

Science.gov (United States)

Paproth, C.; Schlüßler, E.; Scherbaum, P.; Börner, A.

2012-07-01

During the development process of a remote sensing system, the optimization and the verification of the sensor system are important tasks. To support these tasks, the simulation of the sensor and its output is valuable. This enables the developers to test algorithms, estimate errors, and evaluate the capabilities of the whole sensor system before the final remote sensing system is available and produces real data. The presented simulation concept, SENSOR++, consists of three parts. The first part is the geometric simulation which calculates where the sensor looks at by using a ray tracing algorithm. This also determines whether the observed part of the scene is shadowed or not. The second part describes the radiometry and results in the spectral at-sensor radiance from the visible spectrum to the thermal infrared according to the simulated sensor type. In the case of earth remote sensing, it also includes a model of the radiative transfer through the atmosphere. The final part uses the at-sensor radiance to generate digital images by using an optical and an electronic sensor model. Using SENSOR++ for an optimization requires the additional application of task-specific data processing algorithms. The principle of the simulation approach is explained, all relevant concepts of SENSOR++ are discussed, and first examples of its use are given, for example a camera simulation for a moon lander. Finally, the verification of SENSOR++ is demonstrated.

Development of an Algorithm for Automatic Analysis of the Impedance Spectrum Based on a Measurement Model

Science.gov (United States)

Kobayashi, Kiyoshi; Suzuki, Tohru S.

2018-03-01

A new algorithm for the automatic estimation of an equivalent circuit and the subsequent parameter optimization is developed by combining the data-mining concept and complex least-squares method. In this algorithm, the program generates an initial equivalent-circuit model based on the sampling data and then attempts to optimize the parameters. The basic hypothesis is that the measured impedance spectrum can be reproduced by the sum of the partial-impedance spectra presented by the resistor, inductor, resistor connected in parallel to a capacitor, and resistor connected in parallel to an inductor. The adequacy of the model is determined by using a simple artificial-intelligence function, which is applied to the output function of the Levenberg-Marquardt module. From the iteration of model modifications, the program finds an adequate equivalent-circuit model without any user input to the equivalent-circuit model.

Adaptive MCS selection and resource planning for energy-efficient communication in LTE-M based IoT sensing platform.

Science.gov (United States)

Dao, Nhu-Ngoc; Park, Minho; Kim, Joongheon; Cho, Sungrae

2017-01-01

As an important part of IoTization trends, wireless sensing technologies have been involved in many fields of human life. In cellular network evolution, the long term evolution advanced (LTE-A) networks including machine-type communication (MTC) features (named LTE-M) provide a promising infrastructure for a proliferation of Internet of things (IoT) sensing platform. However, LTE-M may not be optimally exploited for directly supporting such low-data-rate devices in terms of energy efficiency since it depends on core technologies of LTE that are originally designed for high-data-rate services. Focusing on this circumstance, we propose a novel adaptive modulation and coding selection (AMCS) algorithm to address the energy consumption problem in the LTE-M based IoT-sensing platform. The proposed algorithm determines the optimal pair of MCS and the number of primary resource blocks (#PRBs), at which the transport block size is sufficient to packetize the sensing data within the minimum transmit power. In addition, a quantity-oriented resource planning (QORP) technique that utilizes these optimal MCS levels as main criteria for spectrum allocation has been proposed for better adapting to the sensing node requirements. The simulation results reveal that the proposed approach significantly reduces the energy consumption of IoT sensing nodes and #PRBs up to 23.09% and 25.98%, respectively.

Predictors of sense of coherence in typically developing adolescent siblings of individuals with autism spectrum disorder.

Science.gov (United States)

Smith, L O; Elder, J H; Storch, E A; Rowe, M A

2015-01-01

Children with autism spectrum disorder (ASD) may be a stressor for family members yet there is little published research on the impact of having a child with ASD on their typically developing (TD) adolescent siblings. According to Antonovsky's salutogenic model, a strong sense of coherence leads to the view that the stressor is a manageable challenge rather than a burden and promotes healthier adaptation. This study examines the relationship between stress, TD sibling resources and the sense of coherence in TD siblings. This quantitative mail-based study uses a survey methodology, analysing the responses of TD adolescent siblings (n = 96) of individuals with autism, Asperger's syndrome, or pervasive developmental disorder - not otherwise specified to several rating scales. Adolescent siblings, ages 11 to 18 years, completed the Adolescent Coping Orientation for Problem Experience (ACOPE), Network of Relationship Inventory - Social Provision Version (NRI-SPV), Youth Self Report (YSR), and Sense of Coherence (SOC) instruments; parents completed the Child Autism Rating Scale - 2nd Edition (CARS-2). The salutogenesis model was used to guide and inform this research. Findings suggested the following: (a) the stress of ASD severity and resource of adjustment are related in TD adolescent siblings; (b) TD sibling adjustment has a strong relationship with sense of coherence levels; and (c) a greater number of positive coping strategies buffer TD sibling coherence levels when ASD severity scores are high. ASD severity and TD adolescent sibling resources influence sense of coherence in adolescent TD siblings of individuals with ASD. © 2014 MENCAP and International Association of the Scientific Study of Intellectual and Developmental Disabilities and John Wiley & Sons Ltd.

Analysis of the moderate resolution imaging spectroradiometer contextual algorithm for small fire detection, Journal of Applied Remote Sensing Vol.3

Science.gov (United States)

W. Wang; J.J. Qu; X. Hao; Y. Liu

2009-01-01

In the southeastern United States, most wildland fires are of low intensity. A substantial number of these fires cannot be detected by the MODIS contextual algorithm. To improve the accuracy of fire detection for this region, the remote-sensed characteristics of these fires have to be...

A compressed sensing based reconstruction algorithm for synchrotron source propagation-based X-ray phase contrast computed tomography

Energy Technology Data Exchange (ETDEWEB)

Melli, Seyed Ali, E-mail: sem649@mail.usask.ca [Department of Electrical and Computer Engineering, University of Saskatchewan, Saskatoon, SK (Canada); Wahid, Khan A. [Department of Electrical and Computer Engineering, University of Saskatchewan, Saskatoon, SK (Canada); Babyn, Paul [Department of Medical Imaging, University of Saskatchewan, Saskatoon, SK (Canada); Montgomery, James [College of Medicine, University of Saskatchewan, Saskatoon, SK (Canada); Snead, Elisabeth [Western College of Veterinary Medicine, University of Saskatchewan, Saskatoon, SK (Canada); El-Gayed, Ali [College of Medicine, University of Saskatchewan, Saskatoon, SK (Canada); Pettitt, Murray; Wolkowski, Bailey [College of Agriculture and Bioresources, University of Saskatchewan, Saskatoon, SK (Canada); Wesolowski, Michal [Department of Medical Imaging, University of Saskatchewan, Saskatoon, SK (Canada)

2016-01-11

Synchrotron source propagation-based X-ray phase contrast computed tomography is increasingly used in pre-clinical imaging. However, it typically requires a large number of projections, and subsequently a large radiation dose, to produce high quality images. To improve the applicability of this imaging technique, reconstruction algorithms that can reduce the radiation dose and acquisition time without degrading image quality are needed. The proposed research focused on using a novel combination of Douglas–Rachford splitting and randomized Kaczmarz algorithms to solve large-scale total variation based optimization in a compressed sensing framework to reconstruct 2D images from a reduced number of projections. Visual assessment and quantitative performance evaluations of a synthetic abdomen phantom and real reconstructed image of an ex-vivo slice of canine prostate tissue demonstrate that the proposed algorithm is competitive in reconstruction process compared with other well-known algorithms. An additional potential benefit of reducing the number of projections would be reduction of time for motion artifact to occur if the sample moves during image acquisition. Use of this reconstruction algorithm to reduce the required number of projections in synchrotron source propagation-based X-ray phase contrast computed tomography is an effective form of dose reduction that may pave the way for imaging of in-vivo samples.

Classification of remotely sensed images

CSIR Research Space (South Africa)

Dudeni, N

2008-10-01

Full Text Available For this research, the researchers examine various existing image classification algorithms with the aim of demonstrating how these algorithms can be applied to remote sensing images. These algorithms are broadly divided into supervised...

Robust frequency diversity based algorithm for clutter noise reduction of ultrasonic signals using multiple sub-spectrum phase coherence

Energy Technology Data Exchange (ETDEWEB)

Gongzhang, R.; Xiao, B.; Lardner, T.; Gachagan, A. [Centre for Ultrasonic Engineering, University of Strathclyde, Glasgow, G1 1XW (United Kingdom); Li, M. [School of Engineering, University of Glasgow, Glasgow, G12 8QQ (United Kingdom)

2014-02-18

This paper presents a robust frequency diversity based algorithm for clutter reduction in ultrasonic A-scan waveforms. The performance of conventional spectral-temporal techniques like Split Spectrum Processing (SSP) is highly dependent on the parameter selection, especially when the signal to noise ratio (SNR) is low. Although spatial beamforming offers noise reduction with less sensitivity to parameter variation, phased array techniques are not always available. The proposed algorithm first selects an ascending series of frequency bands. A signal is reconstructed for each selected band in which a defect is present when all frequency components are in uniform sign. Combining all reconstructed signals through averaging gives a probability profile of potential defect position. To facilitate data collection and validate the proposed algorithm, Full Matrix Capture is applied on the austenitic steel and high nickel alloy (HNA) samples with 5MHz transducer arrays. When processing A-scan signals with unrefined parameters, the proposed algorithm enhances SNR by 20dB for both samples and consequently, defects are more visible in B-scan images created from the large amount of A-scan traces. Importantly, the proposed algorithm is considered robust, while SSP is shown to fail on the austenitic steel data and achieves less SNR enhancement on the HNA data.

[A quick algorithm of dynamic spectrum photoelectric pulse wave detection based on LabVIEW].

Science.gov (United States)

Lin, Ling; Li, Na; Li, Gang

2010-02-01

Dynamic spectrum (DS) detection is attractive among the numerous noninvasive blood component detection methods because of the elimination of the main interference of the individual discrepancy and measure conditions. DS is a kind of spectrum extracted from the photoelectric pulse wave and closely relative to the artery blood. It can be used in a noninvasive blood component concentration examination. The key issues in DS detection are high detection precision and high operation speed. The precision of measure can be advanced by making use of over-sampling and lock-in amplifying on the pick-up of photoelectric pulse wave in DS detection. In the present paper, the theory expression formula of the over-sampling and lock-in amplifying method was deduced firstly. Then in order to overcome the problems of great data and excessive operation brought on by this technology, a quick algorithm based on LabVIEW and a method of using external C code applied in the pick-up of photoelectric pulse wave were presented. Experimental verification was conducted in the environment of LabVIEW. The results show that by the method pres ented, the speed of operation was promoted rapidly and the data memory was reduced largely.

Introducing molecular selectivity in rapid impedimetric sensing of phthalates

KAUST Repository

Zia, Asif I.

2014-05-01

This research article reports a real-time and non-invasive detection technique for phthalates in liquids by Electrochemical Impedance Spectroscopy (EIS), incorporating molecular imprinting technique to introduce selectivity for the phthalate molecule in the detection system. A functional polymer with Bis (2-ethylhexyl) phthalate (DEHP) template was immobilized on the sensing surface of the inter-digital (ID) capacitive sensor with sputtered gold sensing electrodes fabricated over a native layer of silicon dioxide on a single crystal silicon substrate. Various concentrations (10 to 200 ppm) of DEHP in deionized MilliQ water were exposed to the sensor surface functionalized with molecular imprinted polymer (MIP) in order to capture the analyte molecule, hence introducing molecular selectivity to the testing system. Impedance spectra were obtained using EIS in order to determine sample conductance for evaluation of phthalate concentration in the solution. Electrochemical Spectrum Analyzer algorithm was used to deduce equivalent circuit and equivalent component parameters from the experimentally obtained impedance spectra employing Randle\\'s cell model curve fitting technique. Experimental results confirmed that the immobilization of the functional polymer on sensing surface introduces selectivity for phthalates in the sensing system. The results were validated by testing the samples using High Performance Liquid Chromatography (HPLC-DAD). © 2014 IEEE.

Development of airborne remote sensing data assimilation system

International Nuclear Information System (INIS)

Gudu, B R; Bi, H Y; Wang, H Y; Qin, S X; Ma, J W

2014-01-01

In this paper, an airborne remote sensing data assimilation system for China Airborne Remote Sensing System is introduced. This data assimilation system is composed of a land surface model, data assimilation algorithms, observation data and fundamental parameters forcing the land surface model. In this data assimilation system, Variable Infiltration Capacity hydrologic model is selected as the land surface model, which also serves as the main framework of the system. Three-dimensional variation algorithm, four-dimensional variation algorithms, ensemble Kalman filter and Particle filter algorithms are integrated in this system. Observation data includes ground observations and remotely sensed data. The fundamental forcing parameters include soil parameters, vegetation parameters and the meteorological data

Incorporating a constrained optimization algorithm into remote sensing/precision agriculture methodology

Science.gov (United States)

Moreenthaler, George W.; Khatib, Nader; Kim, Byoungsoo

2003-08-01

Optimization Algorithm" to further improve these processes will be presented. The objective function of the model will used to maximize the farmer's profit via increasing yields while decreasing environmental damage and decreasing applications of costly treatments. This model will incorporate information from Remote Sensing, from in-situ weather sources, from soil history, and from tacit farmer knowledge of the relative productivity of selected "Management Zones" of the farm, to provide incremental advice throughout the growing season on the optimum usage of water and chemical treatments.

Development of a Machine Learning Algorithm for the Surveillance of Autism Spectrum Disorder.

Directory of Open Access Journals (Sweden)

Matthew J Maenner

Full Text Available The Autism and Developmental Disabilities Monitoring (ADDM Network conducts population-based surveillance of autism spectrum disorder (ASD among 8-year old children in multiple US sites. To classify ASD, trained clinicians review developmental evaluations collected from multiple health and education sources to determine whether the child meets the ASD surveillance case criteria. The number of evaluations collected has dramatically increased since the year 2000, challenging the resources and timeliness of the surveillance system. We developed and evaluated a machine learning approach to classify case status in ADDM using words and phrases contained in children's developmental evaluations. We trained a random forest classifier using data from the 2008 Georgia ADDM site which included 1,162 children with 5,396 evaluations (601 children met ADDM ASD criteria using standard ADDM methods. The classifier used the words and phrases from the evaluations to predict ASD case status. We evaluated its performance on the 2010 Georgia ADDM surveillance data (1,450 children with 9,811 evaluations; 754 children met ADDM ASD criteria. We also estimated ASD prevalence using predictions from the classification algorithm. Overall, the machine learning approach predicted ASD case statuses that were 86.5% concordant with the clinician-determined case statuses (84.0% sensitivity, 89.4% predictive value positive. The area under the resulting receiver-operating characteristic curve was 0.932. Algorithm-derived ASD "prevalence" was 1.46% compared to the published (clinician-determined estimate of 1.55%. Using only the text contained in developmental evaluations, a machine learning algorithm was able to discriminate between children that do and do not meet ASD surveillance criteria at one surveillance site.

Holding-time-aware asymmetric spectrum allocation in virtual optical networks

Science.gov (United States)

Lyu, Chunjian; Li, Hui; Liu, Yuze; Ji, Yuefeng

2017-10-01

Virtual optical networks (VONs) have been considered as a promising solution to support current high-capacity dynamic traffic and achieve rapid applications deployment. Since most of the network services (e.g., high-definition video service, cloud computing, distributed storage) in VONs are provisioned by dedicated data centers, needing different amount of bandwidth resources in both directions, the network traffic is mostly asymmetric. The common strategy, symmetric provisioning of traffic in optical networks, leads to a waste of spectrum resources in such traffic patterns. In this paper, we design a holding-time-aware asymmetric spectrum allocation module based on SDON architecture and an asymmetric spectrum allocation algorithm based on the module is proposed. For the purpose of reducing spectrum resources' waste, the algorithm attempts to reallocate the idle unidirectional spectrum slots in VONs, which are generated due to the asymmetry of services' bidirectional bandwidth. This part of resources can be exploited by other requests, such as short-time non-VON requests. We also introduce a two-dimensional asymmetric resource model for maintaining idle spectrum resources information of VON in spectrum and time domains. Moreover, a simulation is designed to evaluate the performance of the proposed algorithm, and results show that our proposed asymmetric spectrum allocation algorithm can improve the resource waste and reduce blocking probability.

AHIMSA - Ad hoc histogram information measure sensing algorithm for feature selection in the context of histogram inspired clustering techniques

Science.gov (United States)

Dasarathy, B. V.

1976-01-01

An algorithm is proposed for dimensionality reduction in the context of clustering techniques based on histogram analysis. The approach is based on an evaluation of the hills and valleys in the unidimensional histograms along the different features and provides an economical means of assessing the significance of the features in a nonparametric unsupervised data environment. The method has relevance to remote sensing applications.

Word Domain Disambiguation via Word Sense Disambiguation

Energy Technology Data Exchange (ETDEWEB)

Sanfilippo, Antonio P.; Tratz, Stephen C.; Gregory, Michelle L.

2006-06-04

Word subject domains have been widely used to improve the perform-ance of word sense disambiguation al-gorithms. However, comparatively little effort has been devoted so far to the disambiguation of word subject do-mains. The few existing approaches have focused on the development of al-gorithms specific to word domain dis-ambiguation. In this paper we explore an alternative approach where word domain disambiguation is achieved via word sense disambiguation. Our study shows that this approach yields very strong results, suggesting that word domain disambiguation can be ad-dressed in terms of word sense disam-biguation with no need for special purpose algorithms.

A Novel Object Tracking Algorithm Based on Compressed Sensing and Entropy of Information

Directory of Open Access Journals (Sweden)

Ding Ma

2015-01-01

Full Text Available Object tracking has always been a hot research topic in the field of computer vision; its purpose is to track objects with specific characteristics or representation and estimate the information of objects such as their locations, sizes, and rotation angles in the current frame. Object tracking in complex scenes will usually encounter various sorts of challenges, such as location change, dimension change, illumination change, perception change, and occlusion. This paper proposed a novel object tracking algorithm based on compressed sensing and information entropy to address these challenges. First, objects are characterized by the Haar (Haar-like and ORB features. Second, the dimensions of computation space of the Haar and ORB features are effectively reduced through compressed sensing. Then the above-mentioned features are fused based on information entropy. Finally, in the particle filter framework, an object location was obtained by selecting candidate object locations in the current frame from the local context neighboring the optimal locations in the last frame. Our extensive experimental results demonstrated that this method was able to effectively address the challenges of perception change, illumination change, and large area occlusion, which made it achieve better performance than existing approaches such as MIL and CT.

Water Extraction in High Resolution Remote Sensing Image Based on Hierarchical Spectrum and Shape Features

International Nuclear Information System (INIS)

Li, Bangyu; Zhang, Hui; Xu, Fanjiang

2014-01-01

This paper addresses the problem of water extraction from high resolution remote sensing images (including R, G, B, and NIR channels), which draws considerable attention in recent years. Previous work on water extraction mainly faced two difficulties. 1) It is difficult to obtain accurate position of water boundary because of using low resolution images. 2) Like all other image based object classification problems, the phenomena of ''different objects same image'' or ''different images same object'' affects the water extraction. Shadow of elevated objects (e.g. buildings, bridges, towers and trees) scattered in the remote sensing image is a typical noise objects for water extraction. In many cases, it is difficult to discriminate between water and shadow in a remote sensing image, especially in the urban region. We propose a water extraction method with two hierarchies: the statistical feature of spectral characteristic based on image segmentation and the shape feature based on shadow removing. In the first hierarchy, the Statistical Region Merging (SRM) algorithm is adopted for image segmentation. The SRM includes two key steps: one is sorting adjacent regions according to a pre-ascertained sort function, and the other one is merging adjacent regions based on a pre-ascertained merging predicate. The sort step is done one time during the whole processing without considering changes caused by merging which may cause imprecise results. Therefore, we modify the SRM with dynamic sort processing, which conducts sorting step repetitively when there is large adjacent region changes after doing merging. To achieve robust segmentation, we apply the merging region with six features (four remote sensing image bands, Normalized Difference Water Index (NDWI), and Normalized Saturation-value Difference Index (NSVDI)). All these features contribute to segment image into region of object. NDWI and NSVDI are discriminate between water and

Approximate equiangular tight frames for compressed sensing and CDMA applications

Science.gov (United States)

Tsiligianni, Evaggelia; Kondi, Lisimachos P.; Katsaggelos, Aggelos K.

2017-12-01

Performance guarantees for recovery algorithms employed in sparse representations, and compressed sensing highlights the importance of incoherence. Optimal bounds of incoherence are attained by equiangular unit norm tight frames (ETFs). Although ETFs are important in many applications, they do not exist for all dimensions, while their construction has been proven extremely difficult. In this paper, we construct frames that are close to ETFs. According to results from frame and graph theory, the existence of an ETF depends on the existence of its signature matrix, that is, a symmetric matrix with certain structure and spectrum consisting of two distinct eigenvalues. We view the construction of a signature matrix as an inverse eigenvalue problem and propose a method that produces frames of any dimensions that are close to ETFs. Due to the achieved equiangularity property, the so obtained frames can be employed as spreading sequences in synchronous code-division multiple access (s-CDMA) systems, besides compressed sensing.

Remote-sensing image encryption in hybrid domains

Science.gov (United States)

Zhang, Xiaoqiang; Zhu, Guiliang; Ma, Shilong

2012-04-01

Remote-sensing technology plays an important role in military and industrial fields. Remote-sensing image is the main means of acquiring information from satellites, which always contain some confidential information. To securely transmit and store remote-sensing images, we propose a new image encryption algorithm in hybrid domains. This algorithm makes full use of the advantages of image encryption in both spatial domain and transform domain. First, the low-pass subband coefficients of image DWT (discrete wavelet transform) decomposition are sorted by a PWLCM system in transform domain. Second, the image after IDWT (inverse discrete wavelet transform) reconstruction is diffused with 2D (two-dimensional) Logistic map and XOR operation in spatial domain. The experiment results and algorithm analyses show that the new algorithm possesses a large key space and can resist brute-force, statistical and differential attacks. Meanwhile, the proposed algorithm has the desirable encryption efficiency to satisfy requirements in practice.

Equal gain combining for cooperative spectrum sensing in cognitive radio networks

KAUST Repository

Hamza, Doha R.; Aï ssa, Sonia; Aniba, Ghassane

2014-01-01

are not tight. The cases of hard sensing and soft sensing are considered and we provide examples in which hard sensing is advantageous to soft sensing. We contrast the performance of SEGC with maximum ratio combining of the sensors' results and provide examples

Optical remote sensing

CERN Document Server

Prasad, Saurabh; Chanussot, Jocelyn

2011-01-01

Optical remote sensing relies on exploiting multispectral and hyper spectral imagery possessing high spatial and spectral resolutions respectively. These modalities, although useful for most remote sensing tasks, often present challenges that must be addressed for their effective exploitation. This book presents current state-of-the-art algorithms that address the following key challenges encountered in representation and analysis of such optical remotely sensed data: challenges in pre-processing images, storing and representing high dimensional data, fusing different sensor modalities, patter

Cognitive Spectrum Efficient Multiple Access Technique using Relay Systems

DEFF Research Database (Denmark)

Frederiksen, Flemming Bjerge; Prasad, Ramjee

2007-01-01

Methods to enhance the use of the frequency spectrum by automatical spectrum sensing plus spectrum sharing in a cognitive radio technology context will be presented and discussed in this paper. Ideas to increase the coverage of cellular systems by relay channels, relay stations and collaborate...

Parallel Algorithm for GPU Processing; for use in High Speed Machine Vision Sensing of Cotton Lint Trash

Directory of Open Access Journals (Sweden)

Mathew G. Pelletier

2008-02-01

Full Text Available One of the main hurdles standing in the way of optimal cleaning of cotton lint isthe lack of sensing systems that can react fast enough to provide the control system withreal-time information as to the level of trash contamination of the cotton lint. This researchexamines the use of programmable graphic processing units (GPU as an alternative to thePC’s traditional use of the central processing unit (CPU. The use of the GPU, as analternative computation platform, allowed for the machine vision system to gain asignificant improvement in processing time. By improving the processing time, thisresearch seeks to address the lack of availability of rapid trash sensing systems and thusalleviate a situation in which the current systems view the cotton lint either well before, orafter, the cotton is cleaned. This extended lag/lead time that is currently imposed on thecotton trash cleaning control systems, is what is responsible for system operators utilizing avery large dead-band safety buffer in order to ensure that the cotton lint is not undercleaned.Unfortunately, the utilization of a large dead-band buffer results in the majority ofthe cotton lint being over-cleaned which in turn causes lint fiber-damage as well assignificant losses of the valuable lint due to the excessive use of cleaning machinery. Thisresearch estimates that upwards of a 30% reduction in lint loss could be gained through theuse of a tightly coupled trash sensor to the cleaning machinery control systems. Thisresearch seeks to improve processing times through the development of a new algorithm forcotton trash sensing that allows for implementation on a highly parallel architecture.Additionally, by moving the new parallel algorithm onto an alternative computing platform,the graphic processing unit “GPU”, for processing of the cotton trash images, a speed up ofover 6.5 times, over optimized code running on the PC’s central processing

Resource-Efficient Fusion with Pre-Compensated Transmissions for Cooperative Spectrum Sensing

Directory of Open Access Journals (Sweden)

Dayan Adionel Guimarães

2015-05-01

Full Text Available Recently, a novel fusion scheme for cooperative spectrum sensing was proposed for saving resources in the control channel. Secondary users (SUs simultaneously report their decisions using binary modulations with the same carrier frequencies. The transmitted symbols add incoherently at the fusion centre (FC, leading to a larger set of symbols in which a subset is associated with the presence of the primary user (PU signal, and another subset is associated with the absence of such a signal. The decision criterion applied for discriminating these subsets works under the assumption that the channel gains are known at the FC. In this paper, we propose a new simultaneous transmission and decision scheme in which the task of channel estimation is shifted from the FC to the SUs, without the need for feeding-back of the estimates to the FC. The estimates are used at the SUs to pre-compensate for the reporting channel phase rotations and to partially compensate for the channel gains. This partial compensation is the result of signal clipping for peak-to-average power ratio (PAPR control. We show, analytically and with simulations, that this new scheme can produce large performance improvements, yet reduces the implementation complexity when compared with the original one.

Polarimetric Remote Sensing of Atmospheric Particulate Pollutants

Science.gov (United States)

Li, Z.; Zhang, Y.; Hong, J.

2018-04-01

Atmospheric particulate pollutants not only reduce atmospheric visibility, change the energy balance of the troposphere, but also affect human and vegetation health. For monitoring the particulate pollutants, we establish and develop a series of inversion algorithms based on polarimetric remote sensing technology which has unique advantages in dealing with atmospheric particulates. A solution is pointed out to estimate the near surface PM2.5 mass concentrations from full remote sensing measurements including polarimetric, active and infrared remote sensing technologies. It is found that the mean relative error of PM2.5 retrieved by full remote sensing measurements is 35.5 % in the case of October 5th 2013, improved to a certain degree compared to previous studies. A systematic comparison with the ground-based observations further indicates the effectiveness of the inversion algorithm and reliability of results. A new generation of polarized sensors (DPC and PCF), whose observation can support these algorithms, will be onboard GF series satellites and launched by China in the near future.

Extraction Method for Earthquake-Collapsed Building Information Based on High-Resolution Remote Sensing

International Nuclear Information System (INIS)

Chen, Peng; Wu, Jian; Liu, Yaolin; Wang, Jing

2014-01-01

At present, the extraction of earthquake disaster information from remote sensing data relies on visual interpretation. However, this technique cannot effectively and quickly obtain precise and efficient information for earthquake relief and emergency management. Collapsed buildings in the town of Zipingpu after the Wenchuan earthquake were used as a case study to validate two kinds of rapid extraction methods for earthquake-collapsed building information based on pixel-oriented and object-oriented theories. The pixel-oriented method is based on multi-layer regional segments that embody the core layers and segments of the object-oriented method. The key idea is to mask layer by layer all image information, including that on the collapsed buildings. Compared with traditional techniques, the pixel-oriented method is innovative because it allows considerably rapid computer processing. As for the object-oriented method, a multi-scale segment algorithm was applied to build a three-layer hierarchy. By analyzing the spectrum, texture, shape, location, and context of individual object classes in different layers, the fuzzy determined rule system was established for the extraction of earthquake-collapsed building information. We compared the two sets of results using three variables: precision assessment, visual effect, and principle. Both methods can extract earthquake-collapsed building information quickly and accurately. The object-oriented method successfully overcomes the pepper salt noise caused by the spectral diversity of high-resolution remote sensing data and solves the problem of same object, different spectrums and that of same spectrum, different objects. With an overall accuracy of 90.38%, the method achieves more scientific and accurate results compared with the pixel-oriented method (76.84%). The object-oriented image analysis method can be extensively applied in the extraction of earthquake disaster information based on high-resolution remote sensing

The application of particle swarm optimization to identify gamma spectrum with neural network

International Nuclear Information System (INIS)

Shi Dongsheng; Di Yuming; Zhou Chunlin

2006-01-01

Aiming at the shortcomings that BP algorithm is usually trapped to a local optimum and it has a low speed of convergence in the application of neural network to identify gamma spectrum, according to the advantage of the globe optimal searching of particle swarm optimization, this paper put forward a new algorithm for neural network training by combining BP algorithm and Particle Swarm Optimization-mixed PSO-BP algorithm. In the application to identify gamma spectrum, the new algorithm overcomes the shortcoming that BP algorithm is usually trapped to a local optimum and the neural network trained by it has a high ability of generalization with identification result of one hundred percent correct. Practical example shows that the mixed PSO-BP algorithm can effectively and reliably be used to identify gamma spectrum. (authors)

Testing the performance of empirical remote sensing algorithms in the Baltic Sea waters with modelled and in situ reflectance data

Directory of Open Access Journals (Sweden)

Martin Ligi

2017-01-01

Full Text Available Remote sensing studies published up to now show that the performance of empirical (band-ratio type algorithms in different parts of the Baltic Sea is highly variable. Best performing algorithms are different in the different regions of the Baltic Sea. Moreover, there is indication that the algorithms have to be seasonal as the optical properties of phytoplankton assemblages dominating in spring and summer are different. We modelled 15,600 reflectance spectra using HydroLight radiative transfer model to test 58 previously published empirical algorithms. 7200 of the spectra were modelled using specific inherent optical properties (SIOPs of the open parts of the Baltic Sea in summer and 8400 with SIOPs of spring season. Concentration range of chlorophyll-a, coloured dissolved organic matter (CDOM and suspended matter used in the model simulations were based on the actually measured values available in literature. For each optically active constituent we added one concentration below actually measured minimum and one concentration above the actually measured maximum value in order to test the performance of the algorithms in wider range. 77 in situ reflectance spectra from rocky (Sweden and sandy (Estonia, Latvia coastal areas were used to evaluate the performance of the algorithms also in coastal waters. Seasonal differences in the algorithm performance were confirmed but we found also algorithms that can be used in both spring and summer conditions. The algorithms that use bands available on OLCI, launched in February 2016, are highlighted as this sensor will be available for Baltic Sea monitoring for coming decades.

Compressive sensing sectional imaging for single-shot in-line self-interference incoherent holography

Science.gov (United States)

Weng, Jiawen; Clark, David C.; Kim, Myung K.

2016-05-01

A numerical reconstruction method based on compressive sensing (CS) for self-interference incoherent digital holography (SIDH) is proposed to achieve sectional imaging by single-shot in-line self-interference incoherent hologram. The sensing operator is built up based on the physical mechanism of SIDH according to CS theory, and a recovery algorithm is employed for image restoration. Numerical simulation and experimental studies employing LEDs as discrete point-sources and resolution targets as extended sources are performed to demonstrate the feasibility and validity of the method. The intensity distribution and the axial resolution along the propagation direction of SIDH by angular spectrum method (ASM) and by CS are discussed. The analysis result shows that compared to ASM the reconstruction by CS can improve the axial resolution of SIDH, and achieve sectional imaging. The proposed method may be useful to 3D analysis of dynamic systems.

Intelligent environmental sensing

CERN Document Server

Mukhopadhyay, Subhas

2015-01-01

Developing environmental sensing and monitoring technologies become essential especially for industries that may cause severe contamination. Intelligent environmental sensing uses novel sensor techniques, intelligent signal and data processing algorithms, and wireless sensor networks to enhance environmental sensing and monitoring. It finds applications in many environmental problems such as oil and gas, water quality, and agriculture. This book addresses issues related to three main approaches to intelligent environmental sensing and discusses their latest technological developments. Key contents of the book include:   Agricultural monitoring Classification, detection, and estimation Data fusion Geological monitoring Motor monitoring Multi-sensor systems Oil reservoirs monitoring Sensor motes Water quality monitoring Wireless sensor network protocol  

Comparison of Different Machine Learning Algorithms for Lithological Mapping Using Remote Sensing Data and Morphological Features: A Case Study in Kurdistan Region, NE Iraq

Science.gov (United States)

Othman, Arsalan; Gloaguen, Richard

2015-04-01

Topographic effects and complex vegetation cover hinder lithology classification in mountain regions based not only in field, but also in reflectance remote sensing data. The area of interest "Bardi-Zard" is located in the NE of Iraq. It is part of the Zagros orogenic belt, where seven lithological units outcrop and is known for its chromite deposit. The aim of this study is to compare three machine learning algorithms (MLAs): Maximum Likelihood (ML), Support Vector Machines (SVM), and Random Forest (RF) in the context of a supervised lithology classification task using Advanced Space-borne Thermal Emission and Reflection radiometer (ASTER) satellite, its derived, spatial information (spatial coordinates) and geomorphic data. We emphasize the enhancement in remote sensing lithological mapping accuracy that arises from the integration of geomorphic features and spatial information (spatial coordinates) in classifications. This study identifies that RF is better than ML and SVM algorithms in almost the sixteen combination datasets, which were tested. The overall accuracy of the best dataset combination with the RF map for the all seven classes reach ~80% and the producer and user's accuracies are ~73.91% and 76.09% respectively while the kappa coefficient is ~0.76. TPI is more effective with SVM algorithm than an RF algorithm. This paper demonstrates that adding geomorphic indices such as TPI and spatial information in the dataset increases the lithological classification accuracy.

Programmable genetic algorithm IP core for sensing and surveillance applications

Science.gov (United States)

Katkoori, Srinivas; Fernando, Pradeep; Sankaran, Hariharan; Stoica, Adrian; Keymeulen, Didier; Zebulum, Ricardo

2009-05-01

Real-time evolvable systems are possible with a hardware implementation of Genetic Algorithms (GA). We report the design of an IP core that implements a general purpose GA engine which has been successfully synthesized and verified on a Xilinx Virtex II Pro FPGA Device (XC2VP30). The placed and routed IP core has an area utilization of only 13% and clock speed of 50MHz. The GA core can be customized in terms of the population size, number of generations, cross-over and mutation rates, and the random number generator seed. The GA engine can be tailored to a given application by interfacing with the application specific fitness evaluation module as well as the required storage memory (to store the current and new populations). The core is soft in nature i.e., a gate-level netlist is provided which can be readily integrated with the user's system. The GA IP core can be readily used in FPGA based platforms for space and military applications (for e.g., surveillance, target tracking). The main advantages of the IP core are its programmability, small footprint, and low power consumption. Examples of concept systems in sensing and surveillance domains will be presented.

The possibilities of compressed sensing based migration

KAUST Repository

Aldawood, Ali

2013-09-22

Linearized waveform inversion or Least-square migration helps reduce migration artifacts caused by limited acquisition aperture, coarse sampling of sources and receivers, and low subsurface illumination. However, leastsquare migration, based on L2-norm minimization of the misfit function, tends to produce a smeared (smoothed) depiction of the true subsurface reflectivity. Assuming that the subsurface reflectivity distribution is a sparse signal, we use a compressed-sensing (Basis Pursuit) algorithm to retrieve this sparse distribution from a small number of linear measurements. We applied a compressed-sensing algorithm to image a synthetic fault model using dense and sparse acquisition geometries. Tests on synthetic data demonstrate the ability of compressed-sensing to produce highly resolved migrated images. We, also, studied the robustness of the Basis Pursuit algorithm in the presence of Gaussian random noise.

The possibilities of compressed sensing based migration

KAUST Repository

Aldawood, Ali; Hoteit, Ibrahim; Alkhalifah, Tariq Ali

2013-01-01

Linearized waveform inversion or Least-square migration helps reduce migration artifacts caused by limited acquisition aperture, coarse sampling of sources and receivers, and low subsurface illumination. However, leastsquare migration, based on L2-norm minimization of the misfit function, tends to produce a smeared (smoothed) depiction of the true subsurface reflectivity. Assuming that the subsurface reflectivity distribution is a sparse signal, we use a compressed-sensing (Basis Pursuit) algorithm to retrieve this sparse distribution from a small number of linear measurements. We applied a compressed-sensing algorithm to image a synthetic fault model using dense and sparse acquisition geometries. Tests on synthetic data demonstrate the ability of compressed-sensing to produce highly resolved migrated images. We, also, studied the robustness of the Basis Pursuit algorithm in the presence of Gaussian random noise.

ISTA-Net: Iterative Shrinkage-Thresholding Algorithm Inspired Deep Network for Image Compressive Sensing

KAUST Repository

Zhang, Jian

2017-06-24

Traditional methods for image compressive sensing (CS) reconstruction solve a well-defined inverse problem that is based on a predefined CS model, which defines the underlying structure of the problem and is generally solved by employing convergent iterative solvers. These optimization-based CS methods face the challenge of choosing optimal transforms and tuning parameters in their solvers, while also suffering from high computational complexity in most cases. Recently, some deep network based CS algorithms have been proposed to improve CS reconstruction performance, while dramatically reducing time complexity as compared to optimization-based methods. Despite their impressive results, the proposed networks (either with fully-connected or repetitive convolutional layers) lack any structural diversity and they are trained as a black box, void of any insights from the CS domain. In this paper, we combine the merits of both types of CS methods: the structure insights of optimization-based method and the performance/speed of network-based ones. We propose a novel structured deep network, dubbed ISTA-Net, which is inspired by the Iterative Shrinkage-Thresholding Algorithm (ISTA) for optimizing a general $l_1$ norm CS reconstruction model. ISTA-Net essentially implements a truncated form of ISTA, where all ISTA-Net parameters are learned end-to-end to minimize a reconstruction error in training. Borrowing more insights from the optimization realm, we propose an accelerated version of ISTA-Net, dubbed FISTA-Net, which is inspired by the fast iterative shrinkage-thresholding algorithm (FISTA). Interestingly, this acceleration naturally leads to skip connections in the underlying network design. Extensive CS experiments demonstrate that the proposed ISTA-Net and FISTA-Net outperform existing optimization-based and network-based CS methods by large margins, while maintaining a fast runtime.

REMOTE SENSING FOR ENVIRONMENTAL COMPLIANCE MONITORING

Science.gov (United States)

I. Remote Sensing Basics A. The electromagnetic spectrum demonstrates what we can see both in the visible and beyond the visible part of the spectrum through the use of various types of sensors. B. Resolution refers to what a remote sensor can see and how often. 1. Sp...

Cognitive communication and cooperative hetnet coexistence selected advances on spectrum sensing, learning, and security approaches

CERN Document Server

Bader, Faouzi

2014-01-01

This book, written by experts from universities and major industrial research laboratories, is devoted to the very hot topic of cognitive radio and networking for cooperative coexistence of heterogeneous wireless networks. Selected highly relevant advanced research is presented on spectrum sensing and progress toward the realization of accurate radio environment mapping, biomimetic learning for self-organizing networks, security threats (with a special focus on primary user emulation attack), and cognition as a tool for green next-generation networks. The research activities covered include work undertaken within the framework of the European COST Action IC0902, which is geared towards the definition of a European platform for cognitive radio and networks. Communications engineers, R&D engineers, researchers, and students will all benefit from this complete reference on recent advances in wireless communications and the design and implementation of cognitive radio systems and networks.

Compressed sensing for distributed systems

CERN Document Server

Coluccia, Giulio; Magli, Enrico

2015-01-01

This book presents a survey of the state-of-the art in the exciting and timely topic of compressed sensing for distributed systems. It has to be noted that, while compressed sensing has been studied for some time now, its distributed applications are relatively new. Remarkably, such applications are ideally suited to exploit all the benefits that compressed sensing can provide. The objective of this book is to provide the reader with a comprehensive survey of this topic, from the basic concepts to different classes of centralized and distributed reconstruction algorithms, as well as a comparison of these techniques. This book collects different contributions on these aspects. It presents the underlying theory in a complete and unified way for the first time, presenting various signal models and their use cases. It contains a theoretical part collecting latest results in rate-distortion analysis of distributed compressed sensing, as well as practical implementations of algorithms obtaining performance close to...

Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms With Directed Gossip Communication

Science.gov (United States)

Jakovetic, Dusan; Xavier, João; Moura, José M. F.

2011-08-01

We study distributed optimization in networked systems, where nodes cooperate to find the optimal quantity of common interest, x=x^\\star. The objective function of the corresponding optimization problem is the sum of private (known only by a node,) convex, nodes' objectives and each node imposes a private convex constraint on the allowed values of x. We solve this problem for generic connected network topologies with asymmetric random link failures with a novel distributed, decentralized algorithm. We refer to this algorithm as AL-G (augmented Lagrangian gossiping,) and to its variants as AL-MG (augmented Lagrangian multi neighbor gossiping) and AL-BG (augmented Lagrangian broadcast gossiping.) The AL-G algorithm is based on the augmented Lagrangian dual function. Dual variables are updated by the standard method of multipliers, at a slow time scale. To update the primal variables, we propose a novel, Gauss-Seidel type, randomized algorithm, at a fast time scale. AL-G uses unidirectional gossip communication, only between immediate neighbors in the network and is resilient to random link failures. For networks with reliable communication (i.e., no failures,) the simplified, AL-BG (augmented Lagrangian broadcast gossiping) algorithm reduces communication, computation and data storage cost. We prove convergence for all proposed algorithms and demonstrate by simulations the effectiveness on two applications: l_1-regularized logistic regression for classification and cooperative spectrum sensing for cognitive radio networks.

How to estimate the 3D power spectrum of the Lyman-α forest

Science.gov (United States)

Font-Ribera, Andreu; McDonald, Patrick; Slosar, Anže

2018-01-01

We derive and numerically implement an algorithm for estimating the 3D power spectrum of the Lyman-α (Lyα) forest flux fluctuations. The algorithm exploits the unique geometry of Lyα forest data to efficiently measure the cross-spectrum between lines of sight as a function of parallel wavenumber, transverse separation and redshift. We start by approximating the global covariance matrix as block-diagonal, where only pixels from the same spectrum are correlated. We then compute the eigenvectors of the derivative of the signal covariance with respect to cross-spectrum parameters, and project the inverse-covariance-weighted spectra onto them. This acts much like a radial Fourier transform over redshift windows. The resulting cross-spectrum inference is then converted into our final product, an approximation of the likelihood for the 3D power spectrum expressed as second order Taylor expansion around a fiducial model. We demonstrate the accuracy and scalability of the algorithm and comment on possible extensions. Our algorithm will allow efficient analysis of the upcoming Dark Energy Spectroscopic Instrument dataset.

Incorporating a Constrained Optimization Algorithm into Remote- Sensing/Precision Agriculture Methodology

Science.gov (United States)

Morgenthaler, George; Khatib, Nader; Kim, Byoungsoo

application of costly treatments. This model will incorporate information from remote sensing, in-situ weather sources, soil measurements, crop models, and tacit farmer knowledge of the relative productivity of the selected control regions of the farm to provide incremental advice throughout the growing season on water and chemical treatments. Genetic and meta-heuristic algorithms will be used to solve the constrained optimization problem that possesses complex constraints and a non-linear objective function. *

A Polygon Model for Wireless Sensor Network Deployment with Directional Sensing Areas

Science.gov (United States)

Wu, Chun-Hsien; Chung, Yeh-Ching

2009-01-01

The modeling of the sensing area of a sensor node is essential for the deployment algorithm of wireless sensor networks (WSNs). In this paper, a polygon model is proposed for the sensor node with directional sensing area. In addition, a WSN deployment algorithm is presented with topology control and scoring mechanisms to maintain network connectivity and improve sensing coverage rate. To evaluate the proposed polygon model and WSN deployment algorithm, a simulation is conducted. The simulation results show that the proposed polygon model outperforms the existed disk model and circular sector model in terms of the maximum sensing coverage rate. PMID:22303159

POLARIMETRIC REMOTE SENSING OF ATMOSPHERIC PARTICULATE POLLUTANTS

Directory of Open Access Journals (Sweden)

Z. Li

2018-04-01

Full Text Available Atmospheric particulate pollutants not only reduce atmospheric visibility, change the energy balance of the troposphere, but also affect human and vegetation health. For monitoring the particulate pollutants, we establish and develop a series of inversion algorithms based on polarimetric remote sensing technology which has unique advantages in dealing with atmospheric particulates. A solution is pointed out to estimate the near surface PM2.5 mass concentrations from full remote sensing measurements including polarimetric, active and infrared remote sensing technologies. It is found that the mean relative error of PM2.5 retrieved by full remote sensing measurements is 35.5 % in the case of October 5th 2013, improved to a certain degree compared to previous studies. A systematic comparison with the ground-based observations further indicates the effectiveness of the inversion algorithm and reliability of results. A new generation of polarized sensors (DPC and PCF, whose observation can support these algorithms, will be onboard GF series satellites and launched by China in the near future.

A Two-Stage Reconstruction Processor for Human Detection in Compressive Sensing CMOS Radar.

Science.gov (United States)

Tsao, Kuei-Chi; Lee, Ling; Chu, Ta-Shun; Huang, Yuan-Hao

2018-04-05

Complementary metal-oxide-semiconductor (CMOS) radar has recently gained much research attraction because small and low-power CMOS devices are very suitable for deploying sensing nodes in a low-power wireless sensing system. This study focuses on the signal processing of a wireless CMOS impulse radar system that can detect humans and objects in the home-care internet-of-things sensing system. The challenges of low-power CMOS radar systems are the weakness of human signals and the high computational complexity of the target detection algorithm. The compressive sensing-based detection algorithm can relax the computational costs by avoiding the utilization of matched filters and reducing the analog-to-digital converter bandwidth requirement. The orthogonal matching pursuit (OMP) is one of the popular signal reconstruction algorithms for compressive sensing radar; however, the complexity is still very high because the high resolution of human respiration leads to high-dimension signal reconstruction. Thus, this paper proposes a two-stage reconstruction algorithm for compressive sensing radar. The proposed algorithm not only has lower complexity than the OMP algorithm by 75% but also achieves better positioning performance than the OMP algorithm especially in noisy environments. This study also designed and implemented the algorithm by using Vertex-7 FPGA chip (Xilinx, San Jose, CA, USA). The proposed reconstruction processor can support the 256 × 13 real-time radar image display with a throughput of 28.2 frames per second.

A Two-Stage Reconstruction Processor for Human Detection in Compressive Sensing CMOS Radar

Directory of Open Access Journals (Sweden)

Kuei-Chi Tsao

2018-04-01

Full Text Available Complementary metal-oxide-semiconductor (CMOS radar has recently gained much research attraction because small and low-power CMOS devices are very suitable for deploying sensing nodes in a low-power wireless sensing system. This study focuses on the signal processing of a wireless CMOS impulse radar system that can detect humans and objects in the home-care internet-of-things sensing system. The challenges of low-power CMOS radar systems are the weakness of human signals and the high computational complexity of the target detection algorithm. The compressive sensing-based detection algorithm can relax the computational costs by avoiding the utilization of matched filters and reducing the analog-to-digital converter bandwidth requirement. The orthogonal matching pursuit (OMP is one of the popular signal reconstruction algorithms for compressive sensing radar; however, the complexity is still very high because the high resolution of human respiration leads to high-dimension signal reconstruction. Thus, this paper proposes a two-stage reconstruction algorithm for compressive sensing radar. The proposed algorithm not only has lower complexity than the OMP algorithm by 75% but also achieves better positioning performance than the OMP algorithm especially in noisy environments. This study also designed and implemented the algorithm by using Vertex-7 FPGA chip (Xilinx, San Jose, CA, USA. The proposed reconstruction processor can support the 256 × 13 real-time radar image display with a throughput of 28.2 frames per second.

Dynamic routing and spectrum assignment based on multilayer virtual topology and ant colony optimization in elastic software-defined optical networks

Science.gov (United States)

Wang, Fu; Liu, Bo; Zhang, Lijia; Zhang, Qi; Tian, Qinghua; Tian, Feng; Rao, Lan; Xin, Xiangjun

2017-07-01

Elastic software-defined optical networks greatly improve the flexibility of the optical switching network while it has brought challenges to the routing and spectrum assignment (RSA). A multilayer virtual topology model is proposed to solve RSA problems. Two RSA algorithms based on the virtual topology are proposed, which are the ant colony optimization (ACO) algorithm of minimum consecutiveness loss and the ACO algorithm of maximum spectrum consecutiveness. Due to the computing power of the control layer in the software-defined network, the routing algorithm avoids the frequent link-state information between routers. Based on the effect of the spectrum consecutiveness loss on the pheromone in the ACO, the path and spectrum of the minimal impact on the network are selected for the service request. The proposed algorithms have been compared with other algorithms. The results show that the proposed algorithms can reduce the blocking rate by at least 5% and perform better in spectrum efficiency. Moreover, the proposed algorithms can effectively decrease spectrum fragmentation and enhance available spectrum consecutiveness.

Compressive Sensing for Spread Spectrum Receivers

DEFF Research Database (Denmark)

Fyhn, Karsten; Jensen, Tobias Lindstrøm; Larsen, Torben

2013-01-01

With the advent of ubiquitous computing there are two design parameters of wireless communication devices that become very important: power efficiency and production cost. Compressive sensing enables the receiver in such devices to sample below the Shannon-Nyquist sampling rate, which may lead...... the bit error rate performance is degraded by the subsampling in the CS-enabled receivers, this may be remedied by including quantization in the receiver model.We also study the computational complexity of the proposed receiver design under different sparsity and measurement ratios. Our work shows...

A Novel Compressed Sensing Method for Magnetic Resonance Imaging: Exponential Wavelet Iterative Shrinkage-Thresholding Algorithm with Random Shift

Directory of Open Access Journals (Sweden)

Yudong Zhang

2016-01-01

Full Text Available Aim. It can help improve the hospital throughput to accelerate magnetic resonance imaging (MRI scanning. Patients will benefit from less waiting time. Task. In the last decade, various rapid MRI techniques on the basis of compressed sensing (CS were proposed. However, both computation time and reconstruction quality of traditional CS-MRI did not meet the requirement of clinical use. Method. In this study, a novel method was proposed with the name of exponential wavelet iterative shrinkage-thresholding algorithm with random shift (abbreviated as EWISTARS. It is composed of three successful components: (i exponential wavelet transform, (ii iterative shrinkage-thresholding algorithm, and (iii random shift. Results. Experimental results validated that, compared to state-of-the-art approaches, EWISTARS obtained the least mean absolute error, the least mean-squared error, and the highest peak signal-to-noise ratio. Conclusion. EWISTARS is superior to state-of-the-art approaches.

A Novel Compressed Sensing Method for Magnetic Resonance Imaging: Exponential Wavelet Iterative Shrinkage-Thresholding Algorithm with Random Shift

Science.gov (United States)

Zhang, Yudong; Yang, Jiquan; Yang, Jianfei; Liu, Aijun; Sun, Ping

2016-01-01

Aim. It can help improve the hospital throughput to accelerate magnetic resonance imaging (MRI) scanning. Patients will benefit from less waiting time. Task. In the last decade, various rapid MRI techniques on the basis of compressed sensing (CS) were proposed. However, both computation time and reconstruction quality of traditional CS-MRI did not meet the requirement of clinical use. Method. In this study, a novel method was proposed with the name of exponential wavelet iterative shrinkage-thresholding algorithm with random shift (abbreviated as EWISTARS). It is composed of three successful components: (i) exponential wavelet transform, (ii) iterative shrinkage-thresholding algorithm, and (iii) random shift. Results. Experimental results validated that, compared to state-of-the-art approaches, EWISTARS obtained the least mean absolute error, the least mean-squared error, and the highest peak signal-to-noise ratio. Conclusion. EWISTARS is superior to state-of-the-art approaches. PMID:27066068

Concurrent communication and sensing in cognitive radio devices: challenges and an enabling solution

DEFF Research Database (Denmark)

Tsakalaki, Elpiniki; Alrabadi, Osama; Tatomirescu, Alexandru

2014-01-01

Cognitive Radios (CRs) need to continuously monitor the availability of unoccupied spectrum. Prior work on spectrum sensing mainly focused on time-slotted schemes where sensing and communication take place on different time periods in the same frequency. This however leads to a) limited CR...

Noninvasive hemoglobin measurement using dynamic spectrum

Science.gov (United States)

Yi, Xiaoqing; Li, Gang; Lin, Ling

2017-08-01

Spectroscopy methods for noninvasive hemoglobin (Hgb) measurement are interfered by individual difference and particular weak signal. In order to address these problems, we have put forward a series of improvement methods based on dynamic spectrum (DS), including instrument design, spectrum extraction algorithm, and modeling approach. The instrument adopts light sources composed of eight laser diodes with the wavelength range from 600 nm to 1100 nm and records photoplethysmography signals at eight wavelengths synchronously. In order to simplify the optical design, we modulate the light sources with orthogonal square waves and design the corresponding demodulation algorithm, instead of adopting a beam-splitting system. A newly designed algorithm named difference accumulation has been proved to be effective in improving the accuracy of dynamic spectrum extraction. 220 subjects are involved in the clinical experiment. An extreme learning machine calibration model between the DS data and the Hgb levels is established. Correlation coefficient and root-mean-square error of prediction sets are 0.8645 and 8.48 g/l, respectively. The results indicate that the Hgb level can be derived by this approach noninvasively with acceptable precision and accuracy. It is expected to achieve a clinic application in the future.

Development of MODIS data-based algorithm for retrieving sea surface temperature in coastal waters.

Science.gov (United States)

Wang, Jiao; Deng, Zhiqiang

2017-06-01

A new algorithm was developed for retrieving sea surface temperature (SST) in coastal waters using satellite remote sensing data from Moderate Resolution Imaging Spectroradiometer (MODIS) aboard Aqua platform. The new SST algorithm was trained using the Artificial Neural Network (ANN) method and tested using 8 years of remote sensing data from MODIS Aqua sensor and in situ sensing data from the US coastal waters in Louisiana, Texas, Florida, California, and New Jersey. The ANN algorithm could be utilized to map SST in both deep offshore and particularly shallow nearshore waters at the high spatial resolution of 1 km, greatly expanding the coverage of remote sensing-based SST data from offshore waters to nearshore waters. Applications of the ANN algorithm require only the remotely sensed reflectance values from the two MODIS Aqua thermal bands 31 and 32 as input data. Application results indicated that the ANN algorithm was able to explaining 82-90% variations in observed SST in US coastal waters. While the algorithm is generally applicable to the retrieval of SST, it works best for nearshore waters where important coastal resources are located and existing algorithms are either not applicable or do not work well, making the new ANN-based SST algorithm unique and particularly useful to coastal resource management.

A Spectrum Allocation Mechanism Based on HJ-DQPSO for Cognitive Radio Networks

Directory of Open Access Journals (Sweden)

Zhu Jiang

2015-11-01

Full Text Available In cognitive radio network model consisting of secondary users and primary users, in order to solve the difficult multi-objective spectrum allocation issue about maximizing network efficiency and users’ fairness to access network, this paper proposes a new discrete multi-objective combinatorial optimization mechanism—HJ-DQPSO based on Hooke Jeeves (HJ and Quantum Particle Swarm Optimization (QPSO algorithm. The mechanism adopts HJ algorithm to local search to prevent falling into the local optimum, and proposes a discrete QPSO algorithm to match the discrete spectrum assignment model. The mechanism has the advantages of approximating optimal solution, rapid convergence, less parameters, avoiding falling into local optimum. Compared with existing spectrum assignment algorithms, the simulation results show that according to different optimization objectives, the HJ-DQPSO optimization mechanism for multi-objective optimization can better approximate optimal solution and　converge fast. We can obtain a reasonable spectrum allocation scheme in the case of satisfying multiple optimization objectives.

LOCAL ALGORITHM FOR MONITORING TOTAL SUSPENDED SEDIMENTS IN MICRO-WATERSHEDS USIN DRONES AND REMOTE SENSING APPLICATIONS. CASE STUDY: TEUSACÁ RIVER, LA CALERA, COLOMBIA

Directory of Open Access Journals (Sweden)

N. A. Sáenz

2015-08-01

Full Text Available An empirical relationship of Total Suspended Sediments (TSS concentrations and reflectance values obtained with Drones’ aerial photos and processed using remote sensing tools was set up as the main objective of this research. A local mathematic algorithm for the micro-watershed of the Teusacá River at La Calera, Colombia, was developed based on the computing of four component of bands from consumed-grade cameras obtaining from each their corresponding reflectance values from procedures for correcting digital camera imagery and using statistical analysis for study the fit and RMSE of 25 regressions. The assessment was characterized by the comparison of reflectance values and 34 in-situ data measurements concentrations between 1.6 and 33 mg L−1 taken from the superficial layer of the river in two campaigns. A large data set of empirical and referenced algorithm from literature were used to evaluate the accuracy and precision of the relationship. For estimation of TSS, a higher accuracy was achieved using the Tassan’s algorithm with the BAND X/ BANDX ratio. The correlation coefficient with R2 = X demonstrate the feasibility of use remote sensed data with consumed-grade cameras as an effective tool for a frequent monitoring and controlling of water quality parameters such as Total Suspended Solids of watersheds, these being the most vulnerable and less compliance with environmental regulations.

Real-world experimentation of distributed DSA network algorithms

DEFF Research Database (Denmark)

Tonelli, Oscar; Berardinelli, Gilberto; Tavares, Fernando Menezes Leitão

2013-01-01

such as a dynamic propagation environment, human presence impact and terminals mobility. This chapter focuses on the practical aspects related to the real world-experimentation with distributed DSA network algorithms over a testbed network. Challenges and solutions are extensively discussed, from the testbed design......The problem of spectrum scarcity in uncoordinated and/or heterogeneous wireless networks is the key aspect driving the research in the field of flexible management of frequency resources. In particular, distributed dynamic spectrum access (DSA) algorithms enable an efficient sharing...... to the setup of experiments. A practical example of experimentation process with a DSA algorithm is also provided....

Searching spectrum points of difference initial-boundary value problems with using GAS

International Nuclear Information System (INIS)

Mazepa, N.E.

1989-01-01

A new algorithm for searching spectrum points is proposed. The difference schemes which approximate systems of linear differential equations of hyperbolic type with constant coefficients and in one space dimension are considered. For important class of practiclas problems this algorithm reduces the hard spectrum calculation problem to the polynomial equation solution. For complicated analytic manipulations connected with realization of this algorithm the computation algebraic system REDUCE is used. 28 refs

Broad spectrum pro-quorum-sensing molecules as inhibitors of virulence in vibrios.

Directory of Open Access Journals (Sweden)

Wai-Leung Ng

Full Text Available Quorum sensing (QS is a bacterial cell-cell communication process that relies on the production and detection of extracellular signal molecules called autoinducers. QS allows bacteria to perform collective activities. Vibrio cholerae, a pathogen that causes an acute disease, uses QS to repress virulence factor production and biofilm formation. Thus, molecules that activate QS in V. cholerae have the potential to control pathogenicity in this globally important bacterium. Using a whole-cell high-throughput screen, we identified eleven molecules that activate V. cholerae QS: eight molecules are receptor agonists and three molecules are antagonists of LuxO, the central NtrC-type response regulator that controls the global V. cholerae QS cascade. The LuxO inhibitors act by an uncompetitive mechanism by binding to the pre-formed LuxO-ATP complex to inhibit ATP hydrolysis. Genetic analyses suggest that the inhibitors bind in close proximity to the Walker B motif. The inhibitors display broad-spectrum capability in activation of QS in Vibrio species that employ LuxO. To the best of our knowledge, these are the first molecules identified that inhibit the ATPase activity of a NtrC-type response regulator. Our discovery supports the idea that exploiting pro-QS molecules is a promising strategy for the development of novel anti-infectives.

Fast dictionary-based reconstruction for diffusion spectrum imaging.

Science.gov (United States)

Bilgic, Berkin; Chatnuntawech, Itthi; Setsompop, Kawin; Cauley, Stephen F; Yendiki, Anastasia; Wald, Lawrence L; Adalsteinsson, Elfar

2013-11-01

Diffusion spectrum imaging reveals detailed local diffusion properties at the expense of substantially long imaging times. It is possible to accelerate acquisition by undersampling in q-space, followed by image reconstruction that exploits prior knowledge on the diffusion probability density functions (pdfs). Previously proposed methods impose this prior in the form of sparsity under wavelet and total variation transforms, or under adaptive dictionaries that are trained on example datasets to maximize the sparsity of the representation. These compressed sensing (CS) methods require full-brain processing times on the order of hours using MATLAB running on a workstation. This work presents two dictionary-based reconstruction techniques that use analytical solutions, and are two orders of magnitude faster than the previously proposed dictionary-based CS approach. The first method generates a dictionary from the training data using principal component analysis (PCA), and performs the reconstruction in the PCA space. The second proposed method applies reconstruction using pseudoinverse with Tikhonov regularization with respect to a dictionary. This dictionary can either be obtained using the K-SVD algorithm, or it can simply be the training dataset of pdfs without any training. All of the proposed methods achieve reconstruction times on the order of seconds per imaging slice, and have reconstruction quality comparable to that of dictionary-based CS algorithm.

An adaptive inverse kinematics algorithm for robot manipulators

Science.gov (United States)

Colbaugh, R.; Glass, K.; Seraji, H.

1990-01-01

An adaptive algorithm for solving the inverse kinematics problem for robot manipulators is presented. The algorithm is derived using model reference adaptive control (MRAC) theory and is computationally efficient for online applications. The scheme requires no a priori knowledge of the kinematics of the robot if Cartesian end-effector sensing is available, and it requires knowledge of only the forward kinematics if joint position sensing is used. Computer simulation results are given for the redundant seven-DOF robotics research arm, demonstrating that the proposed algorithm yields accurate joint angle trajectories for a given end-effector position/orientation trajectory.

Compressed sensing & sparse filtering

CERN Document Server

Carmi, Avishy Y; Godsill, Simon J

2013-01-01

This book is aimed at presenting concepts, methods and algorithms ableto cope with undersampled and limited data. One such trend that recently gained popularity and to some extent revolutionised signal processing is compressed sensing. Compressed sensing builds upon the observation that many signals in nature are nearly sparse (or compressible, as they are normally referred to) in some domain, and consequently they can be reconstructed to within high accuracy from far fewer observations than traditionally held to be necessary. Apart from compressed sensing this book contains other related app

Concept of an advanced hyperspectral remote sensing system for pipeline monitoring

Science.gov (United States)

Keskin, Göksu; Teutsch, Caroline D.; Lenz, Andreas; Middelmann, Wolfgang

2015-10-01

Areas occupied by oil pipelines and storage facilities are prone to severe contamination due to leaks caused by natural forces, poor maintenance or third parties. These threats have to be detected as quickly as possible in order to prevent serious environmental damage. Periodical and emergency monitoring activities need to be carried out for successful disaster management and pollution minimization. Airborne remote sensing stands out as an appropriate choice to operate either in an emergency or periodically. Hydrocarbon Index (HI) and Hydrocarbon Detection Index (HDI) utilize the unique absorption features of hydrocarbon based materials at SWIR spectral region. These band ratio based methods require no a priori knowledge of the reference spectrum and can be calculated in real time. This work introduces a flexible airborne pipeline monitoring system based on the online quasi-operational hyperspectral remote sensing system developed at Fraunhofer IOSB, utilizing HI and HDI for oil leak detection on the data acquired by an SWIR imaging sensor. Robustness of HI and HDI compared to state of the art detection algorithms is evaluated in an experimental setup using a synthetic dataset, which was prepared in a systematic way to simulate linear mixtures of selected background and oil spectra consisting of gradually decreasing percentages of oil content. Real airborne measurements in Ettlingen, Germany are used to gather background data while the crude oil spectrum was measured with a field spectrometer. The results indicate that the system can be utilized for online and offline monitoring activities.

Spectral Compressive Sensing with Polar Interpolation

DEFF Research Database (Denmark)

Fyhn, Karsten; Dadkhahi, Hamid; F. Duarte, Marco

2013-01-01

. In this paper, we introduce a greedy recovery algorithm that leverages a band-exclusion function and a polar interpolation function to address these two issues in spectral compressive sensing. Our algorithm is geared towards line spectral estimation from compressive measurements and outperforms most existing...

Development of a Semi-Analytical Algorithm for the Retrieval of Suspended Particulate Matter from Remote Sensing over Clear to Very Turbid Waters

Directory of Open Access Journals (Sweden)

Bing Han

2016-03-01

Full Text Available Remote sensing of suspended particulate matter, SPM, from space has long been used to assess its spatio-temporal variability in various coastal areas. The associated algorithms were generally site specific or developed over a relatively narrow range of concentration, which make them inappropriate for global applications (or at least over broad SPM range. In the frame of the GlobCoast project, a large in situ data set of SPM and remote sensing reflectance, Rrs(λ, has been built gathering together measurements from various coastal areas around Europe, French Guiana, North Canada, Vietnam, and China. This data set covers various contrasting coastal environments diversely affected by different biogeochemical and physical processes such as sediment resuspension, phytoplankton bloom events, and rivers discharges (Amazon, Mekong, Yellow river, MacKenzie, etc.. The SPM concentration spans about four orders of magnitude, from 0.15 to 2626 g·m−3. Different empirical and semi-analytical approaches developed to assess SPM from Rrs(λ were tested over this in situ data set. As none of them provides satisfactory results over the whole SPM range, a generic semi-analytical approach has been developed. This algorithm is based on two standard semi-analytical equations calibrated for low-to-medium and highly turbid waters, respectively. A mixing law has also been developed for intermediate environments. Sources of uncertainties in SPM retrieval such as the bio-optical variability, atmospheric correction errors, and spectral bandwidth have been evaluated. The coefficients involved in these different algorithms have been calculated for ocean color (SeaWiFS, MODIS-A/T, MERIS/OLCI, VIIRS and high spatial resolution (LandSat8-OLI, and Sentinel2-MSI sensors. The performance of the proposed algorithm varies only slightly from one sensor to another demonstrating the great potential applicability of the proposed approach over global and contrasting coastal waters.

Data processing of remotely sensed airborne hyperspectral data using the Airborne Processing Library (APL): Geocorrection algorithm descriptions and spatial accuracy assessment

Science.gov (United States)

Warren, Mark A.; Taylor, Benjamin H.; Grant, Michael G.; Shutler, Jamie D.

2014-03-01

Remote sensing airborne hyperspectral data are routinely used for applications including algorithm development for satellite sensors, environmental monitoring and atmospheric studies. Single flight lines of airborne hyperspectral data are often in the region of tens of gigabytes in size. This means that a single aircraft can collect terabytes of remotely sensed hyperspectral data during a single year. Before these data can be used for scientific analyses, they need to be radiometrically calibrated, synchronised with the aircraft's position and attitude and then geocorrected. To enable efficient processing of these large datasets the UK Airborne Research and Survey Facility has recently developed a software suite, the Airborne Processing Library (APL), for processing airborne hyperspectral data acquired from the Specim AISA Eagle and Hawk instruments. The APL toolbox allows users to radiometrically calibrate, geocorrect, reproject and resample airborne data. Each stage of the toolbox outputs data in the common Band Interleaved Lines (BILs) format, which allows its integration with other standard remote sensing software packages. APL was developed to be user-friendly and suitable for use on a workstation PC as well as for the automated processing of the facility; to this end APL can be used under both Windows and Linux environments on a single desktop machine or through a Grid engine. A graphical user interface also exists. In this paper we describe the Airborne Processing Library software, its algorithms and approach. We present example results from using APL with an AISA Eagle sensor and we assess its spatial accuracy using data from multiple flight lines collected during a campaign in 2008 together with in situ surveyed ground control points.

Green Cooperative Spectrum Sensing and Scheduling in Heterogeneous Cognitive Radio Networks

KAUST Repository

Celik, Abdulkadir; Kamal, Ahmed E.

2016-01-01

the homogeneity assumption. Based on these, a prioritized ordering heuristic is developed to order channels under the spectrum, energy, and spectrum-energy limited regimes. After that, a scheduling and assignment heuristic is proposed and is shown to perform very

Studies on Five Senses Treatment

Science.gov (United States)

Sato, Sadaka; Miao, Tiejun; Oyama-Higa, Mayumi

2011-06-01

This study proposed a therapy from complementary and alternative medicine to treat mental disorder by through interactions of five senses between therapist and patient. In this method sounding a certain six voices play an important role in healing and recovery. First, we studied effects of speaking using scalp- EEG measurement. Chaos analysis of EEG showed a largely enhanced largest Lyapunov exponent (LLE) during the speaking. In addition, EEG power spectrum showed an increase over most frequencies. Second, we performed case studies on mental disorder using the therapy. Running power spectrum of EEG of patients indicated decreasing power at end of treatment, implying five senses therapy induced relaxed and lowered energy in central neural system. The results agreed with patient's reports that there were considerable decline in anxiety and improvements in mood.

Dynamic fair node spectrum allocation for ad hoc networks using random matrices

Science.gov (United States)

Rahmes, Mark; Lemieux, George; Chester, Dave; Sonnenberg, Jerry

2015-05-01

Dynamic Spectrum Access (DSA) is widely seen as a solution to the problem of limited spectrum, because of its ability to adapt the operating frequency of a radio. Mobile Ad Hoc Networks (MANETs) can extend high-capacity mobile communications over large areas where fixed and tethered-mobile systems are not available. In one use case with high potential impact, cognitive radio employs spectrum sensing to facilitate the identification of allocated frequencies not currently accessed by their primary users. Primary users own the rights to radiate at a specific frequency and geographic location, while secondary users opportunistically attempt to radiate at a specific frequency when the primary user is not using it. We populate a spatial radio environment map (REM) database with known information that can be leveraged in an ad hoc network to facilitate fair path use of the DSA-discovered links. Utilization of high-resolution geospatial data layers in RF propagation analysis is directly applicable. Random matrix theory (RMT) is useful in simulating network layer usage in nodes by a Wishart adjacency matrix. We use the Dijkstra algorithm for discovering ad hoc network node connection patterns. We present a method for analysts to dynamically allocate node-node path and link resources using fair division. User allocation of limited resources as a function of time must be dynamic and based on system fairness policies. The context of fair means that first available request for an asset is not envied as long as it is not yet allocated or tasked in order to prevent cycling of the system. This solution may also save money by offering a Pareto efficient repeatable process. We use a water fill queue algorithm to include Shapley value marginal contributions for allocation.

QR-decomposition based SENSE reconstruction using parallel architecture.

Science.gov (United States)

Ullah, Irfan; Nisar, Habab; Raza, Haseeb; Qasim, Malik; Inam, Omair; Omer, Hammad

2018-04-01

Magnetic Resonance Imaging (MRI) is a powerful medical imaging technique that provides essential clinical information about the human body. One major limitation of MRI is its long scan time. Implementation of advance MRI algorithms on a parallel architecture (to exploit inherent parallelism) has a great potential to reduce the scan time. Sensitivity Encoding (SENSE) is a Parallel Magnetic Resonance Imaging (pMRI) algorithm that utilizes receiver coil sensitivities to reconstruct MR images from the acquired under-sampled k-space data. At the heart of SENSE lies inversion of a rectangular encoding matrix. This work presents a novel implementation of GPU based SENSE algorithm, which employs QR decomposition for the inversion of the rectangular encoding matrix. For a fair comparison, the performance of the proposed GPU based SENSE reconstruction is evaluated against single and multicore CPU using openMP. Several experiments against various acceleration factors (AFs) are performed using multichannel (8, 12 and 30) phantom and in-vivo human head and cardiac datasets. Experimental results show that GPU significantly reduces the computation time of SENSE reconstruction as compared to multi-core CPU (approximately 12x speedup) and single-core CPU (approximately 53x speedup) without any degradation in the quality of the reconstructed images. Copyright © 2018 Elsevier Ltd. All rights reserved.

Implementation of an Optical-Wireless Network with Spectrum Sensing and Dynamic Resource Allocation Using Optically Controlled Reconfigurable Antennas

Directory of Open Access Journals (Sweden)

E. Raimundo-Neto

2014-01-01

Full Text Available This work proposes the concept and reports the implementation of an adaptive and cognitive radio over fiber architecture. It is aimed at dealing with the new demands for convergent networks by means of simultaneously providing the functionalities of multiband radiofrequency spectrum sensing, dynamic resource allocation, and centralized processing capability, as well as the use of optically controlled reconfigurable antennas and radio over fiber technology. The performance of this novel and innovative architecture has been evaluated in a geographically distributed optical-wireless network under real conditions and for different fiber lengths. Experimental results demonstrate reach extension of more than 40 times and an enhancement of more than 30 dB in the carrier to interference plus noise ratio parameter.

Creating Aerosol Types from CHemistry (CATCH): A New Algorithm to Extend the Link Between Remote Sensing and Models

Science.gov (United States)

Dawson, K. W.; Meskhidze, N.; Burton, S. P.; Johnson, M. S.; Kacenelenbogen, M. S.; Hostetler, C. A.; Hu, Y.

2017-11-01

Current remote sensing methods can identify aerosol types within an atmospheric column, presenting an opportunity to incrementally bridge the gap between remote sensing and models. Here a new algorithm was designed for Creating Aerosol Types from CHemistry (CATCH). CATCH-derived aerosol types—dusty mix, maritime, urban, smoke, and fresh smoke—are based on first-generation airborne High Spectral Resolution Lidar (HSRL-1) retrievals during the Ship-Aircraft Bio-Optical Research (SABOR) campaign, July/August 2014. CATCH is designed to derive aerosol types from model output of chemical composition. CATCH-derived aerosol types are determined by multivariate clustering of model-calculated variables that have been trained using retrievals of aerosol types from HSRL-1. CATCH-derived aerosol types (with the exception of smoke) compare well with HSRL-1 retrievals during SABOR with an average difference in aerosol optical depth (AOD) methods. In the future, spaceborne HSRL-1 and CATCH can be used to gain insight into chemical composition of aerosol types, reducing uncertainties in estimates of aerosol radiative forcing.

A fully automated algorithm of baseline correction based on wavelet feature points and segment interpolation

Science.gov (United States)

Qian, Fang; Wu, Yihui; Hao, Peng

2017-11-01

Baseline correction is a very important part of pre-processing. Baseline in the spectrum signal can induce uneven amplitude shifts across different wavenumbers and lead to bad results. Therefore, these amplitude shifts should be compensated before further analysis. Many algorithms are used to remove baseline, however fully automated baseline correction is convenient in practical application. A fully automated algorithm based on wavelet feature points and segment interpolation (AWFPSI) is proposed. This algorithm finds feature points through continuous wavelet transformation and estimates baseline through segment interpolation. AWFPSI is compared with three commonly introduced fully automated and semi-automated algorithms, using simulated spectrum signal, visible spectrum signal and Raman spectrum signal. The results show that AWFPSI gives better accuracy and has the advantage of easy use.

Multidimensional Signal Processing for Sensing & Communications

Science.gov (United States)

2015-07-29

Spectrum Sensing,” submitted to IEEE Intl. Workshop on Computational Advances in Multi-Sensor Adaptive Processing, Cancun, Mexico , 13-16 Dec. 2015...Sensing,” submitted to IEEE Intl. Workshop on Computational Advances in Multi-Sensor Adaptive Processing, Cancun, Mexico , 13-16 Dec. 2015...diversity in echolocating mammals ,” IEEE Signal Processing Magazine, vol. 26, no. 1, pp. 65- 75, Jan. 2009. DISTRIBUTION A: Distribution approved for

Quantum-circuit model of Hamiltonian search algorithms

International Nuclear Information System (INIS)

Roland, Jeremie; Cerf, Nicolas J.

2003-01-01

We analyze three different quantum search algorithms, namely, the traditional circuit-based Grover's algorithm, its continuous-time analog by Hamiltonian evolution, and the quantum search by local adiabatic evolution. We show that these algorithms are closely related in the sense that they all perform a rotation, at a constant angular velocity, from a uniform superposition of all states to the solution state. This makes it possible to implement the two Hamiltonian-evolution algorithms on a conventional quantum circuit, while keeping the quadratic speedup of Grover's original algorithm. It also clarifies the link between the adiabatic search algorithm and Grover's algorithm

A Fast DOA Estimation Algorithm Based on Polarization MUSIC

Directory of Open Access Journals (Sweden)

R. Guo

2015-04-01

Full Text Available A fast DOA estimation algorithm developed from MUSIC, which also benefits from the processing of the signals' polarization information, is presented. Besides performance enhancement in precision and resolution, the proposed algorithm can be exerted on various forms of polarization sensitive arrays, without specific requirement on the array's pattern. Depending on the continuity property of the space spectrum, a huge amount of computation incurred in the calculation of 4-D space spectrum is averted. Performance and computation complexity analysis of the proposed algorithm is discussed and the simulation results are presented. Compared with conventional MUSIC, it is indicated that the proposed algorithm has considerable advantage in aspects of precision and resolution, with a low computation complexity proportional to a conventional 2-D MUSIC.

Efficient two-dimensional compressive sensing in MIMO radar

Science.gov (United States)

Shahbazi, Nafiseh; Abbasfar, Aliazam; Jabbarian-Jahromi, Mohammad

2017-12-01

Compressive sensing (CS) has been a way to lower sampling rate leading to data reduction for processing in multiple-input multiple-output (MIMO) radar systems. In this paper, we further reduce the computational complexity of a pulse-Doppler collocated MIMO radar by introducing a two-dimensional (2D) compressive sensing. To do so, we first introduce a new 2D formulation for the compressed received signals and then we propose a new measurement matrix design for our 2D compressive sensing model that is based on minimizing the coherence of sensing matrix using gradient descent algorithm. The simulation results show that our proposed 2D measurement matrix design using gradient decent algorithm (2D-MMDGD) has much lower computational complexity compared to one-dimensional (1D) methods while having better performance in comparison with conventional methods such as Gaussian random measurement matrix.

A Real-Time Smooth Weighted Data Fusion Algorithm for Greenhouse Sensing Based on Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Tengyue Zou

2017-11-01

Full Text Available Wireless sensor networks are widely used to acquire environmental parameters to support agricultural production. However, data variation and noise caused by actuators often produce complex measurement conditions. These factors can lead to nonconformity in reporting samples from different nodes and cause errors when making a final decision. Data fusion is well suited to reduce the influence of actuator-based noise and improve automation accuracy. A key step is to identify the sensor nodes disturbed by actuator noise and reduce their degree of participation in the data fusion results. A smoothing value is introduced and a searching method based on Prim’s algorithm is designed to help obtain stable sensing data. A voting mechanism with dynamic weights is then proposed to obtain the data fusion result. The dynamic weighting process can sharply reduce the influence of actuator noise in data fusion and gradually condition the data to normal levels over time. To shorten the data fusion time in large networks, an acceleration method with prediction is also presented to reduce the data collection time. A real-time system is implemented on STMicroelectronics STM32F103 and NORDIC nRF24L01 platforms and the experimental results verify the improvement provided by these new algorithms.

The Real-time Frequency Spectrum Analysis of Neutron Pulse Signal Series

International Nuclear Information System (INIS)

Tang Yuelin; Ren Yong; Wei Biao; Feng Peng; Mi Deling; Pan Yingjun; Li Jiansheng; Ye Cenming

2009-01-01

The frequency spectrum analysis of neutron pulse signal is a very important method in nuclear stochastic signal processing Focused on the special '0' and '1' of neutron pulse signal series, this paper proposes new rotation-table and realizes a real-time frequency spectrum algorithm under 1G Hz sample rate based on PC with add, address and SSE. The numerical experimental results show that under the count rate of 3X10 6 s -1 , this algorithm is superior to FFTW in time-consumption and can meet the real-time requirement of frequency spectrum analysis. (authors)

Market-driven spectrum sharing in cognitive radio

CERN Document Server

Yi, Changyan

2016-01-01

This brief focuses on the current research on mechanism design for dynamic spectrum sharing in cognitive radio (CR) networks. Along with a review of CR architectures and characteristics, this brief presents the motivations, significances and unique challenges of implementing algorithmic mechanism design for encouraging both primary spectrum owners and secondary spectrum users to participate in dynamic spectrum sharing. The brief then focuses on recent advances in mechanism design in CR networks. With an emphasis on dealing with the uncertain spectrum availabilities, mechanisms based on spectrum recall, two-stage spectrum sharing and online spectrum allocation are introduced with the support of theoretic analyses and numerical illustrations. The brief concludes with a discussion of potential research directions and interests, which will motivate further studies on mechanism design for wireless communications. This brief is concise and approachable for researchers, professionals and advanced-level students in w...

Compressive sensing in medical imaging.

Science.gov (United States)

Graff, Christian G; Sidky, Emil Y

2015-03-10

The promise of compressive sensing, exploitation of compressibility to achieve high quality image reconstructions with less data, has attracted a great deal of attention in the medical imaging community. At the Compressed Sensing Incubator meeting held in April 2014 at OSA Headquarters in Washington, DC, presentations were given summarizing some of the research efforts ongoing in compressive sensing for x-ray computed tomography and magnetic resonance imaging systems. This article provides an expanded version of these presentations. Sparsity-exploiting reconstruction algorithms that have gained popularity in the medical imaging community are studied, and examples of clinical applications that could benefit from compressive sensing ideas are provided. The current and potential future impact of compressive sensing on the medical imaging field is discussed.

Fast Dictionary-Based Reconstruction for Diffusion Spectrum Imaging

Science.gov (United States)

Bilgic, Berkin; Chatnuntawech, Itthi; Setsompop, Kawin; Cauley, Stephen F.; Yendiki, Anastasia; Wald, Lawrence L.; Adalsteinsson, Elfar

2015-01-01

Diffusion Spectrum Imaging (DSI) reveals detailed local diffusion properties at the expense of substantially long imaging times. It is possible to accelerate acquisition by undersampling in q-space, followed by image reconstruction that exploits prior knowledge on the diffusion probability density functions (pdfs). Previously proposed methods impose this prior in the form of sparsity under wavelet and total variation (TV) transforms, or under adaptive dictionaries that are trained on example datasets to maximize the sparsity of the representation. These compressed sensing (CS) methods require full-brain processing times on the order of hours using Matlab running on a workstation. This work presents two dictionary-based reconstruction techniques that use analytical solutions, and are two orders of magnitude faster than the previously proposed dictionary-based CS approach. The first method generates a dictionary from the training data using Principal Component Analysis (PCA), and performs the reconstruction in the PCA space. The second proposed method applies reconstruction using pseudoinverse with Tikhonov regularization with respect to a dictionary. This dictionary can either be obtained using the K-SVD algorithm, or it can simply be the training dataset of pdfs without any training. All of the proposed methods achieve reconstruction times on the order of seconds per imaging slice, and have reconstruction quality comparable to that of dictionary-based CS algorithm. PMID:23846466

Speed testing of Sliding spectrum analysis

International Nuclear Information System (INIS)

Frenski, Emil; Manolev, Dimitar

2013-01-01

The standard method for spectrum analysis in DSP is the Discrete Fourier transform (DFT), typically implemented using a Fast Fourier transform (FFT) algorithm. The reconstruction of the time-domain signal is then performed by the IFFT (Inverse Fast Fourier transform) algorithm. The FFT calculates the spectral components in a window, on a block-by-block basis. If that window is move by one sample, it is obvious that most of the information will remain the same. This article shows how to measure execution time of scripts realizing SDFT algorithm written for MatLab

Image compression-encryption algorithms by combining hyper-chaotic system with discrete fractional random transform

Science.gov (United States)

Gong, Lihua; Deng, Chengzhi; Pan, Shumin; Zhou, Nanrun

2018-07-01

Based on hyper-chaotic system and discrete fractional random transform, an image compression-encryption algorithm is designed. The original image is first transformed into a spectrum by the discrete cosine transform and the resulting spectrum is compressed according to the method of spectrum cutting. The random matrix of the discrete fractional random transform is controlled by a chaotic sequence originated from the high dimensional hyper-chaotic system. Then the compressed spectrum is encrypted by the discrete fractional random transform. The order of DFrRT and the parameters of the hyper-chaotic system are the main keys of this image compression and encryption algorithm. The proposed algorithm can compress and encrypt image signal, especially can encrypt multiple images once. To achieve the compression of multiple images, the images are transformed into spectra by the discrete cosine transform, and then the spectra are incised and spliced into a composite spectrum by Zigzag scanning. Simulation results demonstrate that the proposed image compression and encryption algorithm is of high security and good compression performance.

Data compressive paradigm for multispectral sensing using tunable DWELL mid-infrared detectors.

Science.gov (United States)

Jang, Woo-Yong; Hayat, Majeed M; Godoy, Sebastián E; Bender, Steven C; Zarkesh-Ha, Payman; Krishna, Sanjay

2011-09-26

While quantum dots-in-a-well (DWELL) infrared photodetectors have the feature that their spectral responses can be shifted continuously by varying the applied bias, the width of the spectral response at any applied bias is not sufficiently narrow for use in multispectral sensing without the aid of spectral filters. To achieve higher spectral resolutions without using physical spectral filters, algorithms have been developed for post-processing the DWELL's bias-dependent photocurrents resulting from probing an object of interest repeatedly over a wide range of applied biases. At the heart of these algorithms is the ability to approximate an arbitrary spectral filter, which we desire the DWELL-algorithm combination to mimic, by forming a weighted superposition of the DWELL's non-orthogonal spectral responses over a range of applied biases. However, these algorithms assume availability of abundant DWELL data over a large number of applied biases (>30), leading to large overall acquisition times in proportion with the number of biases. This paper reports a new multispectral sensing algorithm to substantially compress the number of necessary bias values subject to a prescribed performance level across multiple sensing applications. The algorithm identifies a minimal set of biases to be used in sensing only the relevant spectral information for remote-sensing applications of interest. Experimental results on target spectrometry and classification demonstrate a reduction in the number of required biases by a factor of 7 (e.g., from 30 to 4). The tradeoff between performance and bias compression is thoroughly investigated. © 2011 Optical Society of America

Subsampling for graph power spectrum estimation

KAUST Repository

Chepuri, Sundeep Prabhakar; Leus, Geert

2016-01-01

In this paper we focus on subsampling stationary random signals that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum. Estimating the graph power spectrum forms a central component of stationary graph signal processing and related inference tasks. We show that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the power spectrum of the graph signal from the subsampled observations, without any spectral priors. In addition, a near-optimal greedy algorithm is developed to design the subsampling scheme.

Subsampling for graph power spectrum estimation

KAUST Repository

Chepuri, Sundeep Prabhakar

2016-10-06

In this paper we focus on subsampling stationary random signals that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum. Estimating the graph power spectrum forms a central component of stationary graph signal processing and related inference tasks. We show that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the power spectrum of the graph signal from the subsampled observations, without any spectral priors. In addition, a near-optimal greedy algorithm is developed to design the subsampling scheme.

Remote Sensing Applications to Water Quality Management in Florida

Science.gov (United States)

Lehrter, J. C.; Schaeffer, B. A.; Hagy, J.; Spiering, B.; Barnes, B.; Hu, C.; Le, C.; McEachron, L.; Underwood, L. W.; Ellis, C.; Fisher, B.

2013-12-01

Optical datasets from estuarine and coastal systems are increasingly available for remote sensing algorithm development, validation, and application. With validated algorithms, the data streams from satellite sensors can provide unprecedented spatial and temporal data for local and regional coastal water quality management. Our presentation will highlight two recent applications of optical data and remote sensing to water quality decision-making in coastal regions of the state of Florida; (1) informing the development of estuarine and coastal nutrient criteria for the state of Florida and (2) informing the rezoning of the Florida Keys National Marine Sanctuary. These efforts involved building up the underlying science to demonstrate the applicability of satellite data as well as an outreach component to educate decision-makers about the use, utility, and uncertainties of remote sensing data products. Scientific developments included testing existing algorithms and generating new algorithms for water clarity and chlorophylla in case II (CDOM or turbidity dominated) estuarine and coastal waters and demonstrating the accuracy of remote sensing data products in comparison to traditional field based measurements. Including members from decision-making organizations on the research team and interacting with decision-makers early and often in the process were key factors for the success of the outreach efforts and the eventual adoption of satellite data into the data records and analyses used in decision-making. Florida coastal water bodies (black boxes) for which remote sensing imagery were applied to derive numeric nutrient criteria and in situ observations (black dots) used to validate imagery. Florida ocean color applied to development of numeric nutrient criteria

High efficient optical remote sensing images acquisition for nano-satellite: reconstruction algorithms

Science.gov (United States)

Liu, Yang; Li, Feng; Xin, Lei; Fu, Jie; Huang, Puming

2017-10-01

Large amount of data is one of the most obvious features in satellite based remote sensing systems, which is also a burden for data processing and transmission. The theory of compressive sensing(CS) has been proposed for almost a decade, and massive experiments show that CS has favorable performance in data compression and recovery, so we apply CS theory to remote sensing images acquisition. In CS, the construction of classical sensing matrix for all sparse signals has to satisfy the Restricted Isometry Property (RIP) strictly, which limits applying CS in practical in image compression. While for remote sensing images, we know some inherent characteristics such as non-negative, smoothness and etc.. Therefore, the goal of this paper is to present a novel measurement matrix that breaks RIP. The new sensing matrix consists of two parts: the standard Nyquist sampling matrix for thumbnails and the conventional CS sampling matrix. Since most of sun-synchronous based satellites fly around the earth 90 minutes and the revisit cycle is also short, lots of previously captured remote sensing images of the same place are available in advance. This drives us to reconstruct remote sensing images through a deep learning approach with those measurements from the new framework. Therefore, we propose a novel deep convolutional neural network (CNN) architecture which takes in undersampsing measurements as input and outputs an intermediate reconstruction image. It is well known that the training procedure to the network costs long time, luckily, the training step can be done only once, which makes the approach attractive for a host of sparse recovery problems.

Satellite remote sensing of harmful algal blooms: A new multi-algorithm method for detecting the Florida Red Tide (Karenia brevis)

Science.gov (United States)

Carvalho, Gustavo A.; Minnett, Peter J.; Fleming, Lora E.; Banzon, Viva F.; Baringer, Warner

2010-01-01

In a continuing effort to develop suitable methods for the surveillance of Harmful Algal Blooms (HABs) of Karenia brevis using satellite radiometers, a new multi-algorithm method was developed to explore whether improvements in the remote sensing detection of the Florida Red Tide was possible. A Hybrid Scheme was introduced that sequentially applies the optimized versions of two pre-existing satellite-based algorithms: an Empirical Approach (using water-leaving radiance as a function of chlorophyll concentration) and a Bio-optical Technique (using particulate backscatter along with chlorophyll concentration). The long-term evaluation of the new multi-algorithm method was performed using a multi-year MODIS dataset (2002 to 2006; during the boreal Summer-Fall periods – July to December) along the Central West Florida Shelf between 25.75°N and 28.25°N. Algorithm validation was done with in situ measurements of the abundances of K. brevis; cell counts ≥1.5×104 cells l−1 defined a detectable HAB. Encouraging statistical results were derived when either or both algorithms correctly flagged known samples. The majority of the valid match-ups were correctly identified (~80% of both HABs and non-blooming conditions) and few false negatives or false positives were produced (~20% of each). Additionally, most of the HAB-positive identifications in the satellite data were indeed HAB samples (positive predictive value: ~70%) and those classified as HAB-negative were almost all non-bloom cases (negative predictive value: ~86%). These results demonstrate an excellent detection capability, on average ~10% more accurate than the individual algorithms used separately. Thus, the new Hybrid Scheme could become a powerful tool for environmental monitoring of K. brevis blooms, with valuable consequences including leading to the more rapid and efficient use of ships to make in situ measurements of HABs. PMID:21037979

Autonomous Coral Reef Survey in Support of Remote Sensing

Directory of Open Access Journals (Sweden)

Steven G. Ackleson

2017-10-01

Full Text Available An autonomous surface vehicle instrumented with optical and acoustical sensors was deployed in Kane'ohe Bay, HI, U.S.A., to provide high-resolution, in situ observations of coral reef reflectance with minimal human presence. The data represented a wide range in bottom type, water depth, and illumination and supported more thorough investigations of remote sensing methods for identifying and mapping shallow reef features. The in situ data were used to compute spectral bottom reflectance and remote sensing reflectance, Rrs,λ, as a function of water depth and benthic features. The signals were used to distinguish between live coral and uncolonized sediment within the depth range of the measurements (2.5–5 m. In situRrs, λ were found to compare well with remotely sensed measurements from an imaging spectrometer, the Airborne Visible and Infrared Imaging Spectrometer (AVIRIS, deployed on an aircraft at high altitude. Cloud cover and in situ sensor orientation were found to have minimal impact on in situRrs, λ, suggesting that valid reflectance data may be collected using autonomous surveys even when atmospheric conditions are not favorable for remote sensing operations. The use of reflectance in the red and near infrared portions of the spectrum, expressed as the red edge height, REHλ, was investigated for detecting live aquatic vegetative biomass, including coral symbionts and turf algae. The REHλ signal from live coral was detected in Kane'ohe Bay to a depth of approximately 4 m with in situ measurements. A remote sensing algorithm based on the REHλ signal was defined and applied to AVIRIS imagery of the entire bay and was found to reveal areas of shallow, dense coral and algal cover. The peak wavelength of REHλ decreased with increasing water depth, indicating that a more complete examination of the red edge signal may potentially yield a remote sensing approach to simultaneously estimate vegetative biomass and bathymetry in shallow water.

Online sparse representation for remote sensing compressed-sensed video sampling

Science.gov (United States)

Wang, Jie; Liu, Kun; Li, Sheng-liang; Zhang, Li

2014-11-01

Most recently, an emerging Compressed Sensing (CS) theory has brought a major breakthrough for data acquisition and recovery. It asserts that a signal, which is highly compressible in a known basis, can be reconstructed with high probability through sampling frequency which is well below Nyquist Sampling Frequency. When applying CS to Remote Sensing (RS) Video imaging, it can directly and efficiently acquire compressed image data by randomly projecting original data to obtain linear and non-adaptive measurements. In this paper, with the help of distributed video coding scheme which is a low-complexity technique for resource limited sensors, the frames of a RS video sequence are divided into Key frames (K frames) and Non-Key frames (CS frames). In other words, the input video sequence consists of many groups of pictures (GOPs) and each GOP consists of one K frame followed by several CS frames. Both of them are measured based on block, but at different sampling rates. In this way, the major encoding computation burden will be shifted to the decoder. At the decoder, the Side Information (SI) is generated for the CS frames using traditional Motion-Compensated Interpolation (MCI) technique according to the reconstructed key frames. The over-complete dictionary is trained by dictionary learning methods based on SI. These learning methods include ICA-like, PCA, K-SVD, MOD, etc. Using these dictionaries, the CS frames could be reconstructed according to sparse-land model. In the numerical experiments, the reconstruction performance of ICA algorithm, which is often evaluated by Peak Signal-to-Noise Ratio (PSNR), has been made compared with other online sparse representation algorithms. The simulation results show its advantages in reducing reconstruction time and robustness in reconstruction performance when applying ICA algorithm to remote sensing video reconstruction.

Diverse Planning for UAV Control and Remote Sensing

Directory of Open Access Journals (Sweden)

Jan Tožička

2016-12-01

Full Text Available Unmanned aerial vehicles (UAVs are suited to various remote sensing missions, such as measuring air quality. The conventional method of UAV control is by human operators. Such an approach is limited by the ability of cooperation among the operators controlling larger fleets of UAVs in a shared area. The remedy for this is to increase autonomy of the UAVs in planning their trajectories by considering other UAVs and their plans. To provide such improvement in autonomy, we need better algorithms for generating alternative trajectory variants that the UAV coordination algorithms can utilize. In this article, we define a novel family of multi-UAV sensing problems, solving task allocation of huge number of tasks (tens of thousands to a group of configurable UAVs with non-zero weight of equipped sensors (comprising the air quality measurement as well together with two base-line solvers. To solve the problem efficiently, we use an algorithm for diverse trajectory generation and integrate it with a solver for the multi-UAV coordination problem. Finally, we experimentally evaluate the multi-UAV sensing problem solver. The evaluation is done on synthetic and real-world-inspired benchmarks in a multi-UAV simulator. Results show that diverse planning is a valuable method for remote sensing applications containing multiple UAVs.

Energy-efficient routing, modulation and spectrum allocation in elastic optical networks

Science.gov (United States)

Tan, Yanxia; Gu, Rentao; Ji, Yuefeng

2017-07-01

With tremendous growth in bandwidth demand, energy consumption problem in elastic optical networks (EONs) becomes a hot topic with wide concern. The sliceable bandwidth-variable transponder in EON, which can transmit/receive multiple optical flows, was recently proposed to improve a transponder's flexibility and save energy. In this paper, energy-efficient routing, modulation and spectrum allocation (EE-RMSA) in EONs with sliceable bandwidth-variable transponder is studied. To decrease the energy consumption, we develop a Mixed Integer Linear Programming (MILP) model with corresponding EE-RMSA algorithm for EONs. The MILP model jointly considers the modulation format and optical grooming in the process of routing and spectrum allocation with the objective of minimizing the energy consumption. With the help of genetic operators, the EE-RMSA algorithm iteratively optimizes the feasible routing path, modulation format and spectrum resources solutions by explore the whole search space. In order to save energy, the optical-layer grooming strategy is designed to transmit the lightpath requests. Finally, simulation results verify that the proposed scheme is able to reduce the energy consumption of the network while maintaining the blocking probability (BP) performance compare with the existing First-Fit-KSP algorithm, Iterative Flipping algorithm and EAMGSP algorithm especially in large network topology. Our results also demonstrate that the proposed EE-RMSA algorithm achieves almost the same performance as MILP on an 8-node network.

Historical feature pattern extraction based network attack situation sensing algorithm.

Science.gov (United States)

Zeng, Yong; Liu, Dacheng; Lei, Zhou

2014-01-01

The situation sequence contains a series of complicated and multivariate random trends, which are very sudden, uncertain, and difficult to recognize and describe its principle by traditional algorithms. To solve the above questions, estimating parameters of super long situation sequence is essential, but very difficult, so this paper proposes a situation prediction method based on historical feature pattern extraction (HFPE). First, HFPE algorithm seeks similar indications from the history situation sequence recorded and weighs the link intensity between occurred indication and subsequent effect. Then it calculates the probability that a certain effect reappears according to the current indication and makes a prediction after weighting. Meanwhile, HFPE method gives an evolution algorithm to derive the prediction deviation from the views of pattern and accuracy. This algorithm can continuously promote the adaptability of HFPE through gradual fine-tuning. The method preserves the rules in sequence at its best, does not need data preprocessing, and can track and adapt to the variation of situation sequence continuously.

Historical Feature Pattern Extraction Based Network Attack Situation Sensing Algorithm

Directory of Open Access Journals (Sweden)

Yong Zeng

2014-01-01

Full Text Available The situation sequence contains a series of complicated and multivariate random trends, which are very sudden, uncertain, and difficult to recognize and describe its principle by traditional algorithms. To solve the above questions, estimating parameters of super long situation sequence is essential, but very difficult, so this paper proposes a situation prediction method based on historical feature pattern extraction (HFPE. First, HFPE algorithm seeks similar indications from the history situation sequence recorded and weighs the link intensity between occurred indication and subsequent effect. Then it calculates the probability that a certain effect reappears according to the current indication and makes a prediction after weighting. Meanwhile, HFPE method gives an evolution algorithm to derive the prediction deviation from the views of pattern and accuracy. This algorithm can continuously promote the adaptability of HFPE through gradual fine-tuning. The method preserves the rules in sequence at its best, does not need data preprocessing, and can track and adapt to the variation of situation sequence continuously.

An empirical line-by-line model for the infrared solar transmittance spectrum from 700 to 5000cm{sup -1}

Energy Technology Data Exchange (ETDEWEB)

Hase, F. [Institut fuer Meteorologie und Klimaforschung, Forschungszentrum Karlsruhe, Postfach 3640, D-76021 Karlsruhe (Germany)]. E-mail: frank.hase@imk.fzk.de; Demoulin, P. [Institut d' Astrophysique et de Geophysique, allee du VI aout, 17, batiment B5a, B-4000, Liege (Belgium); Sauval, A.J. [Observatoire Royal de Belgique, avenue circulaire, 3, B-1180, Bruxelles (Belgium); Toon, G.C. [Jet Propulsion Laboratory, 4800 Oak Grove Drive, Pasadena, CA 91109 (United States); Bernath, P.F. [Department of Chemistry, University of Waterloo, Waterloo, Ont., Canada N2L3G1 (Canada); Goldman, A. [Department of Physics, University of Denver, Denver, CO 80208 (United States); Hannigan, J.W. [Atmospheric Chemistry Division, National Center for Atmospheric Research, P.O. Box 3000, Boulder, CO 80303 (United States); Rinsland, C.P. [NASA Langley Research Center, Hampton, VA 23681-2199 (United States)

2006-12-15

An empirical line-by-line model for the infrared solar transmittance spectrum is presented. The model can be incorporated into radiative transfer codes to allow fast calculation of all relevant emission and absorption features in the solar spectrum in the mid-infrared region from 700 to 5000cm{sup -1}. The transmittance is modelled as a function of the diameter of the field-of-view centered on the solar disk: the line broadening due to solar rotation as well as center-to-limb variations in strength and width are taken into account for stronger lines. Applications of the model presented here are in the fields of terrestrial remote sensing in the mid-infrared spectral region when the sun is used as radiation source or scattered solar radiation contributes to the measured signal and in the fields of atmospheric radiative transfer algorithms which compute the propagation of infrared solar radiation in the terrestrial atmosphere.

Limit sets for the discrete spectrum of complex Jacobi matrices

International Nuclear Information System (INIS)

Golinskii, L B; Egorova, I E

2005-01-01

The discrete spectrum of complex Jacobi matrices that are compact perturbations of the discrete Laplacian is studied. The precise stabilization rate (in the sense of order) of the matrix elements ensuring the finiteness of the discrete spectrum is found. An example of a Jacobi matrix with discrete spectrum having a unique limit point is constructed. These results are discrete analogues of Pavlov's well-known results on Schroedinger operators with complex potential on a half-axis.

Randomized Filtering Algorithms

DEFF Research Database (Denmark)

Katriel, Irit; Van Hentenryck, Pascal

2008-01-01

of AllDifferent and is generalization, the Global Cardinality Constraint. The first delayed filtering scheme is a Monte Carlo algorithm: its running time is superior, in the worst case, to that of enforcing are consistency after every domain event, while its filtering effectiveness is analyzed...... in the expected sense. The second scheme is a Las Vegas algorithm using filtering triggers: Its effectiveness is the same as enforcing are consistency after every domain event, while in the expected case it is faster by a factor of m/n, where n and m are, respectively, the number of nodes and edges...

A Sensitive Secondary Users Selection Algorithm for Cognitive Radio Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Aohan Li

2016-03-01

Full Text Available Secondary Users (SUs are allowed to use the temporarily unused licensed spectrum without disturbing Primary Users (PUs in Cognitive Radio Ad Hoc Networks (CRAHNs. Existing architectures for CRAHNs impose energy-consuming Cognitive Radios (CRs on SUs. However, the advanced CRs will increase energy cost for their cognitive functionalities, which is undesirable for the battery powered devices. A new architecture referred to as spectral Requirement-based CRAHN (RCRAHN is proposed to enhance energy efficiency for CRAHNs in this paper. In RCRAHNs, only parts of SUs are equipped with CRs. SUs equipped with CRs are referred to as Cognitive Radio Users (CRUs. To further enhance energy efficiency of CRAHNs, we aim to select minimum CRUs to sense available spectrum. A non-linear programming problem is mathematically formulated under the constraints of energy efficiency and real-time. Considering the NP-hardness of the problem, a framework of a heuristic algorithm referred to as Sensitive Secondary Users Selection (SSUS was designed to compute the near-optimal solutions. The simulation results demonstrate that SSUS not only improves the energy efficiency, but also achieves satisfied performances in end-to-end delay and communication reliability.

A Sensitive Secondary Users Selection Algorithm for Cognitive Radio Ad Hoc Networks.

Science.gov (United States)

Li, Aohan; Han, Guangjie; Wan, Liangtian; Shu, Lei

2016-03-26

Secondary Users (SUs) are allowed to use the temporarily unused licensed spectrum without disturbing Primary Users (PUs) in Cognitive Radio Ad Hoc Networks (CRAHNs). Existing architectures for CRAHNs impose energy-consuming Cognitive Radios (CRs) on SUs. However, the advanced CRs will increase energy cost for their cognitive functionalities, which is undesirable for the battery powered devices. A new architecture referred to as spectral Requirement-based CRAHN (RCRAHN) is proposed to enhance energy efficiency for CRAHNs in this paper. In RCRAHNs, only parts of SUs are equipped with CRs. SUs equipped with CRs are referred to as Cognitive Radio Users (CRUs). To further enhance energy efficiency of CRAHNs, we aim to select minimum CRUs to sense available spectrum. A non-linear programming problem is mathematically formulated under the constraints of energy efficiency and real-time. Considering the NP-hardness of the problem, a framework of a heuristic algorithm referred to as Sensitive Secondary Users Selection (SSUS) was designed to compute the near-optimal solutions. The simulation results demonstrate that SSUS not only improves the energy efficiency, but also achieves satisfied performances in end-to-end delay and communication reliability.

Algorithms and Public Service Media

OpenAIRE

Sørensen, Jannick Kirk; Hutchinson, Jonathon

2018-01-01

When Public Service Media (PSM) organisations introduce algorithmic recommender systems to suggest media content to users, fundamental values of PSM are challenged. Beyond being confronted with ubiquitous computer ethics problems of causality and transparency, also the identity of PSM as curator and agenda-setter is challenged. The algorithms represents rules for which content to present to whom, and in this sense they may discriminate and bias the exposure of diversity. Furthermore, on a pra...

Accurate reconstruction of hyperspectral images from compressive sensing measurements

Science.gov (United States)

Greer, John B.; Flake, J. C.

2013-05-01

The emerging field of Compressive Sensing (CS) provides a new way to capture data by shifting the heaviest burden of data collection from the sensor to the computer on the user-end. This new means of sensing requires fewer measurements for a given amount of information than traditional sensors. We investigate the efficacy of CS for capturing HyperSpectral Imagery (HSI) remotely. We also introduce a new family of algorithms for constructing HSI from CS measurements with Split Bregman Iteration [Goldstein and Osher,2009]. These algorithms combine spatial Total Variation (TV) with smoothing in the spectral dimension. We examine models for three different CS sensors: the Coded Aperture Snapshot Spectral Imager-Single Disperser (CASSI-SD) [Wagadarikar et al.,2008] and Dual Disperser (CASSI-DD) [Gehm et al.,2007] cameras, and a hypothetical random sensing model closer to CS theory, but not necessarily implementable with existing technology. We simulate the capture of remotely sensed images by applying the sensor forward models to well-known HSI scenes - an AVIRIS image of Cuprite, Nevada and the HYMAP Urban image. To measure accuracy of the CS models, we compare the scenes constructed with our new algorithm to the original AVIRIS and HYMAP cubes. The results demonstrate the possibility of accurately sensing HSI remotely with significantly fewer measurements than standard hyperspectral cameras.

Overview of remote sensing of chlorophyll flourescene in ocean waters

African Journals Online (AJOL)

Overview of remote sensing of chlorophyll flourescene in ocean waters. ... Besides empirical algorithms with the blue-green ratio, the algorithms based on ... between fluorescence and chlorophyll concentration and the red shift phenomena.

Statistical mechanics approach to 1-bit compressed sensing

International Nuclear Information System (INIS)

Xu, Yingying; Kabashima, Yoshiyuki

2013-01-01

Compressed sensing is a framework that makes it possible to recover an N-dimensional sparse vector x∈R N from its linear transformation y∈R M of lower dimensionality M 1 -norm-based signal recovery scheme for 1-bit compressed sensing using statistical mechanics methods. We show that the signal recovery performance predicted by the replica method under the replica symmetric ansatz, which turns out to be locally unstable for modes breaking the replica symmetry, is in good consistency with experimental results of an approximate recovery algorithm developed earlier. This suggests that the l 1 -based recovery problem typically has many local optima of a similar recovery accuracy, which can be achieved by the approximate algorithm. We also develop another approximate recovery algorithm inspired by the cavity method. Numerical experiments show that when the density of nonzero entries in the original signal is relatively large the new algorithm offers better performance than the abovementioned scheme and does so with a lower computational cost. (paper)

An Uncertainty Quantification Framework for Remote Sensing Retrievals

Science.gov (United States)

Braverman, A. J.; Hobbs, J.

2017-12-01

Remote sensing data sets produced by NASA and other space agencies are the result of complex algorithms that infer geophysical state from observed radiances using retrieval algorithms. The processing must keep up with the downlinked data flow, and this necessitates computational compromises that affect the accuracies of retrieved estimates. The algorithms are also limited by imperfect knowledge of physics and of ancillary inputs that are required. All of this contributes to uncertainties that are generally not rigorously quantified by stepping outside the assumptions that underlie the retrieval methodology. In this talk we discuss a practical framework for uncertainty quantification that can be applied to a variety of remote sensing retrieval algorithms. Ours is a statistical approach that uses Monte Carlo simulation to approximate the sampling distribution of the retrieved estimates. We will discuss the strengths and weaknesses of this approach, and provide a case-study example from the Orbiting Carbon Observatory 2 mission.

Remote Sensing of Ecology, Biodiversity and Conservation: A Review from the Perspective of Remote Sensing Specialists

Directory of Open Access Journals (Sweden)

Marc Cattet

2010-11-01

Full Text Available Remote sensing, the science of obtaining information via noncontact recording, has swept the fields of ecology, biodiversity and conservation (EBC. Several quality review papers have contributed to this field. However, these papers often discuss the issues from the standpoint of an ecologist or a biodiversity specialist. This review focuses on the spaceborne remote sensing of EBC from the perspective of remote sensing specialists, i.e., it is organized in the context of state-of-the-art remote sensing technology, including instruments and techniques. Herein, the instruments to be discussed consist of high spatial resolution, hyperspectral, thermal infrared, small-satellite constellation, and LIDAR sensors; and the techniques refer to image classification, vegetation index (VI, inversion algorithm, data fusion, and the integration of remote sensing (RS and geographic information system (GIS.

Remote sensing of ecology, biodiversity and conservation: a review from the perspective of remote sensing specialists.

Science.gov (United States)

Wang, Kai; Franklin, Steven E; Guo, Xulin; Cattet, Marc

2010-01-01

Remote sensing, the science of obtaining information via noncontact recording, has swept the fields of ecology, biodiversity and conservation (EBC). Several quality review papers have contributed to this field. However, these papers often discuss the issues from the standpoint of an ecologist or a biodiversity specialist. This review focuses on the spaceborne remote sensing of EBC from the perspective of remote sensing specialists, i.e., it is organized in the context of state-of-the-art remote sensing technology, including instruments and techniques. Herein, the instruments to be discussed consist of high spatial resolution, hyperspectral, thermal infrared, small-satellite constellation, and LIDAR sensors; and the techniques refer to image classification, vegetation index (VI), inversion algorithm, data fusion, and the integration of remote sensing (RS) and geographic information system (GIS).

An algorithm for hyperspectral remote sensing of aerosols: 1. Development of theoretical framework

International Nuclear Information System (INIS)

Hou, Weizhen; Wang, Jun; Xu, Xiaoguang; Reid, Jeffrey S.; Han, Dong

2016-01-01

This paper describes the first part of a series of investigations to develop algorithms for simultaneous retrieval of aerosol parameters and surface reflectance from a newly developed hyperspectral instrument, the GEOstationary Trace gas and Aerosol Sensor Optimization (GEO-TASO), by taking full advantage of available hyperspectral measurement information in the visible bands. We describe the theoretical framework of an inversion algorithm for the hyperspectral remote sensing of the aerosol optical properties, in which major principal components (PCs) for surface reflectance is assumed known, and the spectrally dependent aerosol refractive indices are assumed to follow a power-law approximation with four unknown parameters (two for real and two for imaginary part of refractive index). New capabilities for computing the Jacobians of four Stokes parameters of reflected solar radiation at the top of the atmosphere with respect to these unknown aerosol parameters and the weighting coefficients for each PC of surface reflectance are added into the UNified Linearized Vector Radiative Transfer Model (UNL-VRTM), which in turn facilitates the optimization in the inversion process. Theoretical derivations of the formulas for these new capabilities are provided, and the analytical solutions of Jacobians are validated against the finite-difference calculations with relative error less than 0.2%. Finally, self-consistency check of the inversion algorithm is conducted for the idealized green-vegetation and rangeland surfaces that were spectrally characterized by the U.S. Geological Survey digital spectral library. It shows that the first six PCs can yield the reconstruction of spectral surface reflectance with errors less than 1%. Assuming that aerosol properties can be accurately characterized, the inversion yields a retrieval of hyperspectral surface reflectance with an uncertainty of 2% (and root-mean-square error of less than 0.003), which suggests self-consistency in the

New algorithms for parallel MRI

International Nuclear Information System (INIS)

Anzengruber, S; Ramlau, R; Bauer, F; Leitao, A

2008-01-01

Magnetic Resonance Imaging with parallel data acquisition requires algorithms for reconstructing the patient's image from a small number of measured lines of the Fourier domain (k-space). In contrast to well-known algorithms like SENSE and GRAPPA and its flavors we consider the problem as a non-linear inverse problem. However, in order to avoid cost intensive derivatives we will use Landweber-Kaczmarz iteration and in order to improve the overall results some additional sparsity constraints.

Internet of Things for Sensing: A Case Study in the Healthcare System

Directory of Open Access Journals (Sweden)

Syed Aziz Shah

2018-03-01

Full Text Available Medical healthcare is one of the fascinating applications using Internet of Things (IoTs. The pervasive smart environment in IoTs has the potential to monitor various human activities by deploying smart devices. In our pilot study, we look at narcolepsy, a disorder in which individuals lose the ability to regulate their sleep-wake cycle. An imbalance in the brain chemical called orexin makes the sleep pattern irregular. This sleep disorder in patients suffering from narcolepsy results in them experience irrepressible sleep episodes while performing daily routine activities. This study presents a novel method for detecting sleep attacks or sleepiness due to immune system attacks and affecting daily activities measured using the S-band sensing technique. The S-Band sensing technique is channel sensing based on frequency spectrum sensing using the orthogonal frequency division multiplexing transmission at a 2 to 4 GHz frequency range leveraging amplitude and calibrated phase information of different frequencies obtained using wireless devices such as card, and omni-directional antenna. Each human behavior induces a unique channel information (CI signature contained in amplitude and phase information. By linearly transforming raw phase measurements into calibrated phase information, we ascertain phase coherence. Classification and validation of various human activities such as walking, sitting on a chair, push-ups, and narcolepsy sleep episodes are done using support vector machine, K-nearest neighbor, and random forest algorithms. The measurement and evaluation were carried out several times with classification values of accuracy, precision, recall, specificity, Kappa, and F-measure of more than 90% that were achieved when delineating sleep attacks.

Variable forgetting factor mechanisms for diffusion recursive least squares algorithm in sensor networks

Science.gov (United States)

Zhang, Ling; Cai, Yunlong; Li, Chunguang; de Lamare, Rodrigo C.

2017-12-01

In this work, we present low-complexity variable forgetting factor (VFF) techniques for diffusion recursive least squares (DRLS) algorithms. Particularly, we propose low-complexity VFF-DRLS algorithms for distributed parameter and spectrum estimation in sensor networks. For the proposed algorithms, they can adjust the forgetting factor automatically according to the posteriori error signal. We develop detailed analyses in terms of mean and mean square performance for the proposed algorithms and derive mathematical expressions for the mean square deviation (MSD) and the excess mean square error (EMSE). The simulation results show that the proposed low-complexity VFF-DRLS algorithms achieve superior performance to the existing DRLS algorithm with fixed forgetting factor when applied to scenarios of distributed parameter and spectrum estimation. Besides, the simulation results also demonstrate a good match for our proposed analytical expressions.

A software architecture for adaptive modular sensing systems.

Science.gov (United States)

Lyle, Andrew C; Naish, Michael D

2010-01-01

By combining a number of simple transducer modules, an arbitrarily complex sensing system may be produced to accommodate a wide range of applications. This work outlines a novel software architecture and knowledge representation scheme that has been developed to support this type of flexible and reconfigurable modular sensing system. Template algorithms are used to embed intelligence within each module. As modules are added or removed, the composite sensor is able to automatically determine its overall geometry and assume an appropriate collective identity. A virtual machine-based middleware layer runs on top of a real-time operating system with a pre-emptive kernel, enabling platform-independent template algorithms to be written once and run on any module, irrespective of its underlying hardware architecture. Applications that may benefit from easily reconfigurable modular sensing systems include flexible inspection, mobile robotics, surveillance, and space exploration.

A Novel Perceptual Hash Algorithm for Multispectral Image Authentication

Directory of Open Access Journals (Sweden)

Kaimeng Ding

2018-01-01

Full Text Available The perceptual hash algorithm is a technique to authenticate the integrity of images. While a few scholars have worked on mono-spectral image perceptual hashing, there is limited research on multispectral image perceptual hashing. In this paper, we propose a perceptual hash algorithm for the content authentication of a multispectral remote sensing image based on the synthetic characteristics of each band: firstly, the multispectral remote sensing image is preprocessed with band clustering and grid partition; secondly, the edge feature of the band subsets is extracted by band fusion-based edge feature extraction; thirdly, the perceptual feature of the same region of the band subsets is compressed and normalized to generate the perceptual hash value. The authentication procedure is achieved via the normalized Hamming distance between the perceptual hash value of the recomputed perceptual hash value and the original hash value. The experiments indicated that our proposed algorithm is robust compared to content-preserved operations and it efficiently authenticates the integrity of multispectral remote sensing images.

Image quality enhancement in low-light-level ghost imaging using modified compressive sensing method

Science.gov (United States)

Shi, Xiaohui; Huang, Xianwei; Nan, Suqin; Li, Hengxing; Bai, Yanfeng; Fu, Xiquan

2018-04-01

Detector noise has a significantly negative impact on ghost imaging at low light levels, especially for existing recovery algorithm. Based on the characteristics of the additive detector noise, a method named modified compressive sensing ghost imaging is proposed to reduce the background imposed by the randomly distributed detector noise at signal path. Experimental results show that, with an appropriate choice of threshold value, modified compressive sensing ghost imaging algorithm can dramatically enhance the contrast-to-noise ratio of the object reconstruction significantly compared with traditional ghost imaging and compressive sensing ghost imaging methods. The relationship between the contrast-to-noise ratio of the reconstruction image and the intensity ratio (namely, the average signal intensity to average noise intensity ratio) for the three reconstruction algorithms are also discussed. This noise suppression imaging technique will have great applications in remote-sensing and security areas.

What is a picture worth? A history of remote sensing

Science.gov (United States)

Moore, Gerald K.

1979-01-01

Remote sensing is the use of electromagnetic energy to measure the physical properties of distant objects. It includes photography and geophysical surveying as well as newer techniques that use other parts of the electromagnetic spectrum. The history of remote sensing begins with photography. The origin of other types of remote sensing can be traced to World War II, with the development of radar, sonar, and thermal infrared detection systems. Since the 1960s, sensors have been designed to operate in virtually all of the electromagnetic spectrum. Today a wide variety of remote sensing instruments are available for use in hydrological studies; satellite data, such as Skylab photographs and Landsat images are particularly suitable for regional problems and studies. Planned future satellites will provide a ground resolution of 10–80 m. Remote sensing is currently used for hydrological applications in most countries of the world. The range of applications includes groundwater exploration determination of physical water quality, snowfield mapping, flood-inundation delineation, and making inventories of irrigated land. The use of remote sensing commonly results in considerable hydrological information at minimal cost. This information can be used to speed-up the development of water resources, to improve management practices, and to monitor environmental problems.

An overview of remote sensing of chlorophyll fluorescence

Science.gov (United States)

Xing, Xiao-Gang; Zhao, Dong-Zhi; Liu, Yu-Guang; Yang, Jian-Hong; Xiu, Peng; Wang, Lin

2007-03-01

Besides empirical algorithms with the blue-green ratio, the algorithms based on fluorescence are also important and valid methods for retrieving chlorophyll-a concentration in the ocean waters, especially for Case II waters and the sea with algal blooming. This study reviews the history of initial cognitions, investigations and detailed approaches towards chlorophyll fluorescence, and then introduces the biological mechanism of fluorescence remote sensing and main spectral characteristics such as the positive correlation between fluorescence and chlorophyll concentration, the red shift phenomena. Meanwhile, there exist many influence factors that increase complexity of fluorescence remote sensing, such as fluorescence quantum yield, physiological status of various algae, substances with related optical property in the ocean, atmospheric absorption etc. Based on these cognitions, scientists have found two ways to calculate the amount of fluorescence detected by ocean color sensors: fluorescence line height and reflectance ratio. These two ways are currently the foundation for retrieval of chlorophyl l - a concentration in the ocean. As the in-situ measurements and synchronous satellite data are continuously being accumulated, the fluorescence remote sensing of chlorophyll-a concentration in Case II waters should be recognized more thoroughly and new algorithms could be expected.

Dual Super-Systolic Core for Real-Time Reconstructive Algorithms of High-Resolution Radar/SAR Imaging Systems

Science.gov (United States)

Atoche, Alejandro Castillo; Castillo, Javier Vázquez

2012-01-01

A high-speed dual super-systolic core for reconstructive signal processing (SP) operations consists of a double parallel systolic array (SA) machine in which each processing element of the array is also conceptualized as another SA in a bit-level fashion. In this study, we addressed the design of a high-speed dual super-systolic array (SSA) core for the enhancement/reconstruction of remote sensing (RS) imaging of radar/synthetic aperture radar (SAR) sensor systems. The selected reconstructive SP algorithms are efficiently transformed in their parallel representation and then, they are mapped into an efficient high performance embedded computing (HPEC) architecture in reconfigurable Xilinx field programmable gate array (FPGA) platforms. As an implementation test case, the proposed approach was aggregated in a HW/SW co-design scheme in order to solve the nonlinear ill-posed inverse problem of nonparametric estimation of the power spatial spectrum pattern (SSP) from a remotely sensed scene. We show how such dual SSA core, drastically reduces the computational load of complex RS regularization techniques achieving the required real-time operational mode. PMID:22736964

Historical Feature Pattern Extraction Based Network Attack Situation Sensing Algorithm

OpenAIRE

Zeng, Yong; Liu, Dacheng; Lei, Zhou

2014-01-01

The situation sequence contains a series of complicated and multivariate random trends, which are very sudden, uncertain, and difficult to recognize and describe its principle by traditional algorithms. To solve the above questions, estimating parameters of super long situation sequence is essential, but very difficult, so this paper proposes a situation prediction method based on historical feature pattern extraction (HFPE). First, HFPE algorithm seeks similar indications from the history si...

Sparse BLIP: BLind Iterative Parallel imaging reconstruction using compressed sensing.

Science.gov (United States)

She, Huajun; Chen, Rong-Rong; Liang, Dong; DiBella, Edward V R; Ying, Leslie

2014-02-01

To develop a sensitivity-based parallel imaging reconstruction method to reconstruct iteratively both the coil sensitivities and MR image simultaneously based on their prior information. Parallel magnetic resonance imaging reconstruction problem can be formulated as a multichannel sampling problem where solutions are sought analytically. However, the channel functions given by the coil sensitivities in parallel imaging are not known exactly and the estimation error usually leads to artifacts. In this study, we propose a new reconstruction algorithm, termed Sparse BLind Iterative Parallel, for blind iterative parallel imaging reconstruction using compressed sensing. The proposed algorithm reconstructs both the sensitivity functions and the image simultaneously from undersampled data. It enforces the sparseness constraint in the image as done in compressed sensing, but is different from compressed sensing in that the sensing matrix is unknown and additional constraint is enforced on the sensitivities as well. Both phantom and in vivo imaging experiments were carried out with retrospective undersampling to evaluate the performance of the proposed method. Experiments show improvement in Sparse BLind Iterative Parallel reconstruction when compared with Sparse SENSE, JSENSE, IRGN-TV, and L1-SPIRiT reconstructions with the same number of measurements. The proposed Sparse BLind Iterative Parallel algorithm reduces the reconstruction errors when compared to the state-of-the-art parallel imaging methods. Copyright © 2013 Wiley Periodicals, Inc.

Clustered K nearest neighbor algorithm for daily inflow forecasting

NARCIS (Netherlands)

Akbari, M.; Van Overloop, P.J.A.T.M.; Afshar, A.

2010-01-01

Instance based learning (IBL) algorithms are a common choice among data driven algorithms for inflow forecasting. They are based on the similarity principle and prediction is made by the finite number of similar neighbors. In this sense, the similarity of a query instance is estimated according to

Noise estimation for remote sensing image data analysis

Science.gov (United States)

Du, Qian

2004-01-01

Noise estimation does not receive much attention in remote sensing society. It may be because normally noise is not large enough to impair image analysis result. Noise estimation is also very challenging due to the randomness nature of the noise (for random noise) and the difficulty of separating the noise component from the signal in each specific location. We review and propose seven different types of methods to estimate noise variance and noise covariance matrix in a remotely sensed image. In the experiment, it is demonstrated that a good noise estimate can improve the performance of an algorithm via noise whitening if this algorithm assumes white noise.

Improved Tensor-Based Singular Spectrum Analysis Based on Single Channel Blind Source Separation Algorithm and Its Application to Fault Diagnosis

Directory of Open Access Journals (Sweden)

Dan Yang

2017-04-01

Full Text Available To solve the problem of multi-fault blind source separation (BSS in the case that the observed signals are under-determined, a novel approach for single channel blind source separation (SCBSS based on the improved tensor-based singular spectrum analysis (TSSA is proposed. As the most natural representation of high-dimensional data, tensor can preserve the intrinsic structure of the data to the maximum extent. Thus, TSSA method can be employed to extract the multi-fault features from the measured single-channel vibration signal. However, SCBSS based on TSSA still has some limitations, mainly including unsatisfactory convergence of TSSA in many cases and the number of source signals is hard to accurately estimate. Therefore, the improved TSSA algorithm based on canonical decomposition and parallel factors (CANDECOMP/PARAFAC weighted optimization, namely CP-WOPT, is proposed in this paper. CP-WOPT algorithm is applied to process the factor matrix using a first-order optimization approach instead of the original least square method in TSSA, so as to improve the convergence of this algorithm. In order to accurately estimate the number of the source signals in BSS, EMD-SVD-BIC (empirical mode decomposition—singular value decomposition—Bayesian information criterion method, instead of the SVD in the conventional TSSA, is introduced. To validate the proposed method, we applied it to the analysis of the numerical simulation signal and the multi-fault rolling bearing signals.

A comparison in the reconstruction of neutron spectrums using classical iterative techniques

International Nuclear Information System (INIS)

Ortiz R, J. M.; Martinez B, M. R.; Vega C, H. R.; Gallego, E.

2009-10-01

One of the key drawbacks to the use of BUNKI code is that the process begins the reconstruction of the spectrum based on a priori knowledge as close as possible to the solution that is sought. The user has to specify the initial spectrum or do it through a subroutine called MAXIET to calculate a Maxwellian and a 1/E spectrum as initial spectrum. Because the application of iterative procedures by to resolve the reconstruction of neutron spectrum needs an initial spectrum, it is necessary to have new proposals for the election of the same. Based on the experience gained with a widely used method of reconstruction, called BUNKI, has developed a new computational tools for neutron spectrometry and dosimetry, which was first introduced, which operates by means of an iterative algorithm for the reconstruction of neutron spectra. The main feature of this tool is that unlike the existing iterative codes, the choice of the initial spectrum is performed automatically by the program, through a neutron spectra catalog. To develop the code, the algorithm was selected as the routine iterative SPUNIT be used in computing tool and response matrix UTA4 for 31 energy groups. (author)

Distributed opportunistic spectrum sharing in cognitive radio networks

KAUST Repository

Hawa, Mohammed; Alammouri, Ahmad; Alhiary, Ala; Alhamad, Nidal

2016-01-01

In cases where the licensed radio spectrum is underutilized, cognitive radio technology enables cognitive devices to sense and then dynamically access this scarce resource making the most out of it. In this work, we introduce a simple and intuitive

Proof-of-Concept System for Opportunistic Spectrum Access in Multi-user Decentralized Networks

Directory of Open Access Journals (Sweden)

Sumit J. Darak

2016-09-01

Full Text Available Poor utilization of an electromagnetic spectrum and ever increasing demand for spectrum have led to surge of interests in opportunistic spectrum access (OSA based paradigms like cognitive radio and unlicensed LTE. In OSA for decentralized networks, frequency band selection from wideband spectrum is a challenging task since secondary users (SUs do not share any information with each other. In this paper, a new decision making policy (DMP has been proposed for OSA in the multi-user decentralized networks. First contribution is an accurate characterization of frequency bands using Bayes-UCB algorithm. Then, a novel SU orthogonization scheme using Bayes-UCB algorithm is proposed replacing randomization based scheme. At the end, USRP testbed has been developed for analyzing the performance of DMPs using real radio signals. Experimental results show that the proposed DMP offers significant improvement in spectrum utilization, fewer subband switching and collisions compared to other DMPs.

Optimization of Selected Remote Sensing Algorithms for Embedded NVIDIA Kepler GPU Architecture

Science.gov (United States)

Riha, Lubomir; Le Moigne, Jacqueline; El-Ghazawi, Tarek

2015-01-01

This paper evaluates the potential of embedded Graphic Processing Units in the Nvidias Tegra K1 for onboard processing. The performance is compared to a general purpose multi-core CPU and full fledge GPU accelerator. This study uses two algorithms: Wavelet Spectral Dimension Reduction of Hyperspectral Imagery and Automated Cloud-Cover Assessment (ACCA) Algorithm. Tegra K1 achieved 51 for ACCA algorithm and 20 for the dimension reduction algorithm, as compared to the performance of the high-end 8-core server Intel Xeon CPU with 13.5 times higher power consumption.

Validation and Algorithms Comparative Study for Microwave Remote Sensing of Snow Depth over China

International Nuclear Information System (INIS)

Bin, C J; Qiu, Y B; Shi, L J

2014-01-01

In this study, five different snow algorithms (Chang algorithm, GSFC 96 algorithm, AMSR-E SWE algorithm, Improved Tibetan Plateau algorithm and Savoie algorithm) were selected to validate the accuracy of snow algorithms over China. These algorithms were compared for the accuracy of snow depth algorithms with AMSR-E brightness temperature data and ground measurements on February 10-12, 2010. Results showed that the GSFC 96 algorithm was more suitable in Xinjiang with the RMSE range from 6.85cm to 7.48 cm; in Inner Mongolia and Northeast China. Improved Tibetan Plateau algorithm is superior to the other four algorithms with the RMSE of 5.46cm∼6.11cm and 6.21cm∼7.83cm respectively; due to the lack of ground measurements, we couldn't get valid statistical results over the Tibetan Plateau. However, the mean relative error (MRE) of the selected algorithms was ranging from 37.95% to 189.13% in four study areas, which showed that the accuracy of the five snow depth algorithms is limited over China

Ultra-small v-shaped gold split ring resonators for biosensing using fundamental magnetic resonance in the visible spectrum

Science.gov (United States)

Mauluidy Soehartono, Alana; Mueller, Aaron David; Tobing, Landobasa Yosef Mario; Chan, Kok Ken; Zhang, Dao Hua; Yong, Ken-Tye

2017-10-01

Strong light localization within metal nanostructures occurs by collective oscillations of plasmons in the form of electric and magnetic resonances. This so-called localized surface plasmon resonance (LSPR) has gained much interest in the development of low-cost sensing platforms in the visible spectrum. However, demonstrations of LSPR-based sensing are mostly limited to electric resonances due to the technological limitations for achieving magnetic resonances in the visible spectrum. In this work, we report the first demonstration of LSPR sensing based on fundamental magnetic resonance in the visible spectrum using ultrasmall gold v-shaped split ring resonators. Specifically, we show the ability for detecting adsorption of bovine serum albumin and cytochrome c biomolecules at monolayer levels, and the selective binding of protein A/G to immunoglobulin G.

Evaluation of the image quality in digital breast tomosynthesis (DBT) employed with a compressed-sensing (CS)-based reconstruction algorithm by using the mammographic accreditation phantom

Energy Technology Data Exchange (ETDEWEB)

Park, Yeonok; Cho, Heemoon; Je, Uikyu; Cho, Hyosung, E-mail: hscho1@yonsei.ac.kr; Park, Chulkyu; Lim, Hyunwoo; Kim, Kyuseok; Kim, Guna; Park, Soyoung; Woo, Taeho; Choi, Sungil

2015-12-21

In this work, we have developed a prototype digital breast tomosynthesis (DBT) system which mainly consists of an x-ray generator (28 kV{sub p}, 7 mA s), a CMOS-type flat-panel detector (70-μm pixel size, 230.5×339 mm{sup 2} active area), and a rotational arm to move the x-ray generator in an arc. We employed a compressed-sensing (CS)-based reconstruction algorithm, rather than a common filtered-backprojection (FBP) one, for more accurate DBT reconstruction. Here the CS is a state-of-the-art mathematical theory for solving the inverse problems, which exploits the sparsity of the image with substantially high accuracy. We evaluated the reconstruction quality in terms of the detectability, the contrast-to-noise ratio (CNR), and the slice-sensitive profile (SSP) by using the mammographic accreditation phantom (Model 015, CIRS Inc.) and compared it to the FBP-based quality. The CS-based algorithm yielded much better image quality, preserving superior image homogeneity, edge sharpening, and cross-plane resolution, compared to the FBP-based one. - Highlights: • A prototype digital breast tomosynthesis (DBT) system is developed. • Compressed-sensing (CS) based reconstruction framework is employed. • We reconstructed high-quality DBT images by using the proposed reconstruction framework.

[Orthogonal Vector Projection Algorithm for Spectral Unmixing].

Science.gov (United States)

Song, Mei-ping; Xu, Xing-wei; Chang, Chein-I; An, Ju-bai; Yao, Li

2015-12-01

Spectrum unmixing is an important part of hyperspectral technologies, which is essential for material quantity analysis in hyperspectral imagery. Most linear unmixing algorithms require computations of matrix multiplication and matrix inversion or matrix determination. These are difficult for programming, especially hard for realization on hardware. At the same time, the computation costs of the algorithms increase significantly as the number of endmembers grows. Here, based on the traditional algorithm Orthogonal Subspace Projection, a new method called. Orthogonal Vector Projection is prompted using orthogonal principle. It simplifies this process by avoiding matrix multiplication and inversion. It firstly computes the final orthogonal vector via Gram-Schmidt process for each endmember spectrum. And then, these orthogonal vectors are used as projection vector for the pixel signature. The unconstrained abundance can be obtained directly by projecting the signature to the projection vectors, and computing the ratio of projected vector length and orthogonal vector length. Compared to the Orthogonal Subspace Projection and Least Squares Error algorithms, this method does not need matrix inversion, which is much computation costing and hard to implement on hardware. It just completes the orthogonalization process by repeated vector operations, easy for application on both parallel computation and hardware. The reasonability of the algorithm is proved by its relationship with Orthogonal Sub-space Projection and Least Squares Error algorithms. And its computational complexity is also compared with the other two algorithms', which is the lowest one. At last, the experimental results on synthetic image and real image are also provided, giving another evidence for effectiveness of the method.

Developing an eye-tracking algorithm as a potential tool for early diagnosis of autism spectrum disorder in children.

Directory of Open Access Journals (Sweden)

Natalia I Vargas-Cuentas

Full Text Available Autism spectrum disorder (ASD currently affects nearly 1 in 160 children worldwide. In over two-thirds of evaluations, no validated diagnostics are used and gold standard diagnostic tools are used in less than 5% of evaluations. Currently, the diagnosis of ASD requires lengthy and expensive tests, in addition to clinical confirmation. Therefore, fast, cheap, portable, and easy-to-administer screening instruments for ASD are required. Several studies have shown that children with ASD have a lower preference for social scenes compared with children without ASD. Based on this, eye-tracking and measurement of gaze preference for social scenes has been used as a screening tool for ASD. Currently available eye-tracking software requires intensive calibration, training, or holding of the head to prevent interference with gaze recognition limiting its use in children with ASD.In this study, we designed a simple eye-tracking algorithm that does not require calibration or head holding, as a platform for future validation of a cost-effective ASD potential screening instrument. This system operates on a portable and inexpensive tablet to measure gaze preference of children for social compared to abstract scenes. A child watches a one-minute stimulus video composed of a social scene projected on the left side and an abstract scene projected on the right side of the tablet's screen. We designed five stimulus videos by changing the social/abstract scenes. Every child observed all the five videos in random order. We developed an eye-tracking algorithm that calculates the child's gaze preference for the social and abstract scenes, estimated as the percentage of the accumulated time that the child observes the left or right side of the screen, respectively. Twenty-three children without a prior history of ASD and 8 children with a clinical diagnosis of ASD were evaluated. The recorded video of the child´s eye movement was analyzed both manually by an observer

A Software Architecture for Adaptive Modular Sensing Systems

Directory of Open Access Journals (Sweden)

Andrew C. Lyle

2010-08-01

Full Text Available By combining a number of simple transducer modules, an arbitrarily complex sensing system may be produced to accommodate a wide range of applications. This work outlines a novel software architecture and knowledge representation scheme that has been developed to support this type of flexible and reconfigurable modular sensing system. Template algorithms are used to embed intelligence within each module. As modules are added or removed, the composite sensor is able to automatically determine its overall geometry and assume an appropriate collective identity. A virtual machine-based middleware layer runs on top of a real-time operating system with a pre-emptive kernel, enabling platform-independent template algorithms to be written once and run on any module, irrespective of its underlying hardware architecture. Applications that may benefit from easily reconfigurable modular sensing systems include flexible inspection, mobile robotics, surveillance, and space exploration.

Advanced signal separation and recovery algorithms for digital x-ray spectroscopy

International Nuclear Information System (INIS)

Mahmoud, Imbaby I.; El-Tokhy, Mohamed S.

2015-01-01

X-ray spectroscopy is widely used for in-situ applications for samples analysis. Therefore, spectrum drawing and assessment of x-ray spectroscopy with high accuracy is the main scope of this paper. A Silicon Lithium Si(Li) detector that cooled with a nitrogen is used for signal extraction. The resolution of the ADC is 12 bits. Also, the sampling rate of ADC is 5 MHz. Hence, different algorithms are implemented. These algorithms were run on a personal computer with Intel core TM i5-3470 CPU and 3.20 GHz. These algorithms are signal preprocessing, signal separation and recovery algorithms, and spectrum drawing algorithm. Moreover, statistical measurements are used for evaluation of these algorithms. Signal preprocessing based on DC-offset correction and signal de-noising is performed. DC-offset correction was done by using minimum value of radiation signal. However, signal de-noising was implemented using fourth order finite impulse response (FIR) filter, linear phase least-square FIR filter, complex wavelet transforms (CWT) and Kalman filter methods. We noticed that Kalman filter achieves large peak signal to noise ratio (PSNR) and lower error than other methods. However, CWT takes much longer execution time. Moreover, three different algorithms that allow correction of x-ray signal overlapping are presented. These algorithms are 1D non-derivative peak search algorithm, second derivative peak search algorithm and extrema algorithm. Additionally, the effect of signal separation and recovery algorithms on spectrum drawing is measured. Comparison between these algorithms is introduced. The obtained results confirm that second derivative peak search algorithm as well as extrema algorithm have very small error in comparison with 1D non-derivative peak search algorithm. However, the second derivative peak search algorithm takes much longer execution time. Therefore, extrema algorithm introduces better results over other algorithms. It has the advantage of recovering and

Research on data auto-analysis algorithms in the explosive detection system

International Nuclear Information System (INIS)

Wang Haidong; Li Yuanjing; Yang Yigang; Li Tiezhu; Chen Boxian; Cheng Jianping

2006-01-01

This paper mainly describe some auto-analysis algorithms in explosive detection system with TNA method. These include the auto-calibration algorithm when disturbed by other factors, MCA auto-calibration algorithm with calibrated spectrum, the auto-fitting and integral of hydrogen and nitrogen elements data. With these numerical algorithms, the authors can automatically and precisely analysis the gamma-spectra and ultimately achieve the explosive auto-detection. (authors)

CHAM: a fast algorithm of modelling non-linear matter power spectrum in the sCreened HAlo Model

Science.gov (United States)

Hu, Bin; Liu, Xue-Wen; Cai, Rong-Gen

2018-05-01

We present a fast numerical screened halo model algorithm (CHAM, which stands for the sCreened HAlo Model) for modelling non-linear power spectrum for the alternative models to Λ cold dark matter. This method has three obvious advantages. First of all, it is not being restricted to a specific dark energy/modified gravity model. In principle, all of the screened scalar-tensor theories can be applied. Secondly, the least assumptions are made in the calculation. Hence, the physical picture is very easily understandable. Thirdly, it is very predictable and does not rely on the calibration from N-body simulation. As an example, we show the case of the Hu-Sawicki f(R) gravity. In this case, the typical CPU time with the current parallel PYTHON script (eight threads) is roughly within 10 min. The resulting spectra are in a good agreement with N-body data within a few percentage accuracy up to k ˜ 1 h Mpc-1.

Concept for a hyperspectral remote sensing algorithm for floating marine macro plastics

NARCIS (Netherlands)

Goddijn-Murphy, Lonneke; Peters, Steef; van Sebille, Erik; James, Neil A.; Gibb, Stuart

2018-01-01

There is growing global concern over the chemical, biological and ecological impact of plastics in the ocean. Remote sensing has the potential to provide long-term, global monitoring but for marine plastics it is still in its early stages. Some progress has been made in hyperspectral remote sensing

Harvesting the electromagnetic spectrum: from communications to renewables

OpenAIRE

Gremont, Boris

2011-01-01

The talk will give a unified perspective on one of the most precious commodities underpinning the globalised world: the electromagnetic spectrum. In particular, we will describe how electromagnetic waves have been used over the years to create the global village and the modern world as we know it. How waves can be used to help fight global warming will be discussed along with how waves and remote sensing help in saving lives. Finally, how can the electromagnetic spectrum be used to create the...

Spectrum and power allocation in cognitive multi-beam satellite communications with flexible satellite payloads

Science.gov (United States)

Liu, Zhihui; Wang, Haitao; Dong, Tao; Yin, Jie; Zhang, Tingting; Guo, Hui; Li, Dequan

2018-02-01

In this paper, the cognitive multi-beam satellite system, i.e., two satellite networks coexist through underlay spectrum sharing, is studied, and the power and spectrum allocation method is employed for interference control and throughput maximization. Specifically, the multi-beam satellite with flexible payload reuses the authorized spectrum of the primary satellite, adjusting its transmission band as well as power for each beam to limit its interference on the primary satellite below the prescribed threshold and maximize its own achievable rate. This power and spectrum allocation problem is formulated as a mixed nonconvex programming. For effective solving, we first introduce the concept of signal to leakage plus noise ratio (SLNR) to decouple multiple transmit power variables in the both objective and constraint, and then propose a heuristic algorithm to assign spectrum sub-bands. After that, a stepwise plus slice-wise algorithm is proposed to implement the discrete power allocation. Finally, simulation results show that adopting cognitive technology can improve spectrum efficiency of the satellite communication.

Spectrum optimization-based chaotification using time-delay feedback control

International Nuclear Information System (INIS)

Zhou Jiaxi; Xu Daolin; Zhang Jing; Liu Chunrong

2012-01-01

Highlights: ► A time-delay feedback controller is designed for chaotification. ► A spectrum optimization method is proposed to determine chaotification parameters. ► Numerical examples verify the spectrum optimization- based chaotification method. ► Engineering application in line spectrum reconfiguration is demonstrated. - Abstract: In this paper, a spectrum optimization method is developed for chaotification in conjunction with an application in line spectrum reconfiguration. A key performance index (the objective function) based on Fourier spectrum is specially devised with the idea of suppressing spectrum spikes and broadening frequency band. Minimization of the index empowered by a genetic algorithm enables to locate favorable parameters of the time-delay feedback controller, by which a line spectrum of harmonic vibration can be transformed into a broad-band continuous spectrum of chaotic motion. Numerical simulations are carried out to verify the feasibility of the method and to demonstrate its effectiveness of chaotifying a 2-DOFs linear mechanical system.

Study on fractal characteristics of remote sensing image in the typical volcanic uranium metallogenic areas

International Nuclear Information System (INIS)

Pan Wei; Ni Guoqiang; Li Hanbo

2010-01-01

Computing Methods of fractal dimension and multifractal spectrum about the remote sensing image are briefly introduced. The fractal method is used to study the characteristics of remote sensing images in Xiangshan and Yuhuashan volcanic uranium metallogenic areas in southern China. The research results indicate that the Xiangshan basin in which lots of volcanic uranium deposits occur,is of bigger fractal dimension based on remote sensing image texture than that of the Yuhuashan basin in which two uranium ore occurrences exist, and the multifractal spectrum in the Xiangshan basin obviously leans to less singularity index than in the Yuhuashan basin. The relation of the fractal dimension and multifractal singularity of remote sensing image to uranium metallogeny are discussed. The fractal dimension and multifractal singularity index of remote sensing image may be used to predict the volcanic uranium metallogenic areas. (authors)

Fast parallel MR image reconstruction via B1-based, adaptive restart, iterative soft thresholding algorithms (BARISTA).

Science.gov (United States)

Muckley, Matthew J; Noll, Douglas C; Fessler, Jeffrey A

2015-02-01

Sparsity-promoting regularization is useful for combining compressed sensing assumptions with parallel MRI for reducing scan time while preserving image quality. Variable splitting algorithms are the current state-of-the-art algorithms for SENSE-type MR image reconstruction with sparsity-promoting regularization. These methods are very general and have been observed to work with almost any regularizer; however, the tuning of associated convergence parameters is a commonly-cited hindrance in their adoption. Conversely, majorize-minimize algorithms based on a single Lipschitz constant have been observed to be slow in shift-variant applications such as SENSE-type MR image reconstruction since the associated Lipschitz constants are loose bounds for the shift-variant behavior. This paper bridges the gap between the Lipschitz constant and the shift-variant aspects of SENSE-type MR imaging by introducing majorizing matrices in the range of the regularizer matrix. The proposed majorize-minimize methods (called BARISTA) converge faster than state-of-the-art variable splitting algorithms when combined with momentum acceleration and adaptive momentum restarting. Furthermore, the tuning parameters associated with the proposed methods are unitless convergence tolerances that are easier to choose than the constraint penalty parameters required by variable splitting algorithms.

State of the Art and Challenges of Radio Spectrum Monitoring in China

Science.gov (United States)

Lu, Q. N.; Yang, J. J.; Jin, Z. Y.; Chen, D. Z.; Huang, M.

2017-10-01

This paper provides an overview of radio spectrum monitoring in China. First, research background, the motivation is described and then train of thought, the prototype system, and the accomplishments are presented. Current radio spectrum monitoring systems are man-machine communication systems, which are unable to detect and process the radio interference automatically. In order to realize intelligent radio monitoring and spectrum management, we proposed an Internet of Things-based spectrum sensing approach using information system architecture and implemented a pilot program; then some very interesting results were obtained.

Supervised remote sensing image classification: An example of a ...

African Journals Online (AJOL)

These conventional multi-class classifiers/algorithms are usually written in programming languages such as C, C++, and python. The objective of this research is to experiment the use of a binary classifier/algorithm for multi-class remote sensing task, implemented in MATLAB. MATLAB is a programming language just like C ...

Low dose reconstruction algorithm for differential phase contrast imaging.

Science.gov (United States)

Wang, Zhentian; Huang, Zhifeng; Zhang, Li; Chen, Zhiqiang; Kang, Kejun; Yin, Hongxia; Wang, Zhenchang; Marco, Stampanoni

2011-01-01

Differential phase contrast imaging computed tomography (DPCI-CT) is a novel x-ray inspection method to reconstruct the distribution of refraction index rather than the attenuation coefficient in weakly absorbing samples. In this paper, we propose an iterative reconstruction algorithm for DPCI-CT which benefits from the new compressed sensing theory. We first realize a differential algebraic reconstruction technique (DART) by discretizing the projection process of the differential phase contrast imaging into a linear partial derivative matrix. In this way the compressed sensing reconstruction problem of DPCI reconstruction can be transformed to a resolved problem in the transmission imaging CT. Our algorithm has the potential to reconstruct the refraction index distribution of the sample from highly undersampled projection data. Thus it can significantly reduce the dose and inspection time. The proposed algorithm has been validated by numerical simulations and actual experiments.

Coding Strategies and Implementations of Compressive Sensing

Science.gov (United States)

Tsai, Tsung-Han

This dissertation studies the coding strategies of computational imaging to overcome the limitation of conventional sensing techniques. The information capacity of conventional sensing is limited by the physical properties of optics, such as aperture size, detector pixels, quantum efficiency, and sampling rate. These parameters determine the spatial, depth, spectral, temporal, and polarization sensitivity of each imager. To increase sensitivity in any dimension can significantly compromise the others. This research implements various coding strategies subject to optical multidimensional imaging and acoustic sensing in order to extend their sensing abilities. The proposed coding strategies combine hardware modification and signal processing to exploiting bandwidth and sensitivity from conventional sensors. We discuss the hardware architecture, compression strategies, sensing process modeling, and reconstruction algorithm of each sensing system. Optical multidimensional imaging measures three or more dimensional information of the optical signal. Traditional multidimensional imagers acquire extra dimensional information at the cost of degrading temporal or spatial resolution. Compressive multidimensional imaging multiplexes the transverse spatial, spectral, temporal, and polarization information on a two-dimensional (2D) detector. The corresponding spectral, temporal and polarization coding strategies adapt optics, electronic devices, and designed modulation techniques for multiplex measurement. This computational imaging technique provides multispectral, temporal super-resolution, and polarization imaging abilities with minimal loss in spatial resolution and noise level while maintaining or gaining higher temporal resolution. The experimental results prove that the appropriate coding strategies may improve hundreds times more sensing capacity. Human auditory system has the astonishing ability in localizing, tracking, and filtering the selected sound sources or

The Sense of Agency in Autism Spectrum Disorders: a Dissociation between Prospective and Retrospective Mechanisms?

Directory of Open Access Journals (Sweden)

Tiziana eZalla

2015-09-01

Full Text Available While a large number of studies have reported impairments in social and interpersonal abilities in individuals with autism spectrum disorder (ASD, relatively few studies have focused on self-related knowledge in this population. One of the processes implicated in the physical dimension of the Self is the sense of agency (SoA, i.e., the experience of initiating and controlling one’s own actions and producing desired changes in the world via these actions. So far, the few studies investigating SoA in ASD have reported contrasting results, with some showing spared, others impaired SoA. Here, we review the existing literature and suggest that the distinction between prospective and retrospective mechanisms of the SoA might help reconcile the existing findings. In the light of a multi-componential model of SoA, we propose the view that a specific impairment at the level of prospective mechanisms acting on internal agency signals (i.e., the intention, action selection, or command produced to achieve the goal may be responsible for the reduced SoA in ASD, along with spared retrospective mechanisms. Future research should shed light on the impact of abnormal SoA on social and self-related dysfunctions in ASD.

Economic optimization and evolutionary programming when using remote sensing data

OpenAIRE

Shamin Roman; Alberto Gabriel Enrike; Uryngaliyeva Ayzhana; Semenov Aleksandr

2018-01-01

The article considers the issues of optimizing the use of remote sensing data. Built a mathematical model to describe the economic effect of the use of remote sensing data. It is shown that this model is incorrect optimisation task. Given a numerical method of solving this problem. Also discusses how to optimize organizational structure by using genetic algorithm based on remote sensing. The methods considered allow the use of remote sensing data in an optimal way. The proposed mathematical m...

Monitoring the performance of Aux. Feedwater Pump using Smart Sensing Model

Energy Technology Data Exchange (ETDEWEB)

No, Young Gyu; Seong, Poong Hyun [Korea Advanced Institute of Science and Technology, Daejeon (Korea, Republic of)

2015-10-15

Many artificial intelligence (AI) techniques equipped with learning systems have recently been proposed to monitor sensors and components in NPPs. Therefore, the objective of this study is the development of an integrity evaluation method for safety critical components such as Aux. feedwater pump, high pressure safety injection (HPSI) pump, etc. using smart sensing models based on AI techniques. In this work, the smart sensing model is developed at first to predict the performance of Aux. feedwater pump by estimating flowrate using group method of data handing (GMDH) method. If the performance prediction is achieved by this feasibility study, the smart sensing model will be applied to development of the integrity evaluation method for safety critical components. Also, the proposed algorithm for the performance prediction is verified by comparison with the simulation data of the MARS code for station blackout (SBO) events. In this study, the smart sensing model for the prediction performance of Aux. feedwater pump has been developed. In order to develop the smart sensing model, the GMDH algorithm is employed. The GMDH algorithm is the way to find a function that can well express a dependent variable from independent variables. This method uses a data structure similar to that of multiple regression models. The proposed GMDH model can accurately predict the performance of Aux.

Monitoring the performance of Aux. Feedwater Pump using Smart Sensing Model

International Nuclear Information System (INIS)

No, Young Gyu; Seong, Poong Hyun

2015-01-01

Many artificial intelligence (AI) techniques equipped with learning systems have recently been proposed to monitor sensors and components in NPPs. Therefore, the objective of this study is the development of an integrity evaluation method for safety critical components such as Aux. feedwater pump, high pressure safety injection (HPSI) pump, etc. using smart sensing models based on AI techniques. In this work, the smart sensing model is developed at first to predict the performance of Aux. feedwater pump by estimating flowrate using group method of data handing (GMDH) method. If the performance prediction is achieved by this feasibility study, the smart sensing model will be applied to development of the integrity evaluation method for safety critical components. Also, the proposed algorithm for the performance prediction is verified by comparison with the simulation data of the MARS code for station blackout (SBO) events. In this study, the smart sensing model for the prediction performance of Aux. feedwater pump has been developed. In order to develop the smart sensing model, the GMDH algorithm is employed. The GMDH algorithm is the way to find a function that can well express a dependent variable from independent variables. This method uses a data structure similar to that of multiple regression models. The proposed GMDH model can accurately predict the performance of Aux

Privacy Preservation in Distributed Subgradient Optimization Algorithms

OpenAIRE

Lou, Youcheng; Yu, Lean; Wang, Shouyang

2015-01-01

Privacy preservation is becoming an increasingly important issue in data mining and machine learning. In this paper, we consider the privacy preserving features of distributed subgradient optimization algorithms. We first show that a well-known distributed subgradient synchronous optimization algorithm, in which all agents make their optimization updates simultaneously at all times, is not privacy preserving in the sense that the malicious agent can learn other agents' subgradients asymptotic...

Partial Discharge Detection Using Low Cost RTL-SDR Model for Wideband Spectrum Sensing

DEFF Research Database (Denmark)

Mohamed, H.; Lazaridis, Pavlos; Upton, D.

2016-01-01

an optimal approach for PD signal analysis, and are very costly. In this paper an RTLSDR (Software Defined Radio) based spectrum analyser has been proposed in order to provide a potentially low cost solution for PD detection and monitoring. Initially, a portable spectrum analyser has been used for PD...

Molecular genetic analysis of the calcium sensing receptor gene in patients clinically suspected to have familial hypocalciuric hypercalcemia: phenotypic variation and mutation spectrum in a Danish population

DEFF Research Database (Denmark)

Nissen, Peter H; Christensen, Signe E; Heickendorff, Lene

2007-01-01

CONTEXT: The autosomal dominantly inherited condition familial hypocalciuric hypercalcemia (FHH) is characterized by elevated plasma calcium levels, relative or absolute hypocalciuria, and normal to moderately elevated plasma PTH. The condition is difficult to distinguish clinically from primary...... hyperparathyroidism and is caused by inactivating mutations in the calcium sensing receptor (CASR) gene. OBJECTIVE: We sought to define the mutation spectrum of the CASR gene in a Danish FHH population and to establish genotype-phenotype relationships regarding the different mutations. DESIGN AND PARTICIPANTS...

Algorithmic and user study of an autocompletion algorithm on a large medical vocabulary.

Science.gov (United States)

Sevenster, Merlijn; van Ommering, Rob; Qian, Yuechen

2012-02-01

Autocompletion supports human-computer interaction in software applications that let users enter textual data. We will be inspired by the use case in which medical professionals enter ontology concepts, catering the ongoing demand for structured and standardized data in medicine. Goal is to give an algorithmic analysis of one particular autocompletion algorithm, called multi-prefix matching algorithm, which suggests terms whose words' prefixes contain all words in the string typed by the user, e.g., in this sense, opt ner me matches optic nerve meningioma. Second we aim to investigate how well it supports users entering concepts from a large and comprehensive medical vocabulary (snomed ct). We give a concise description of the multi-prefix algorithm, and sketch how it can be optimized to meet required response time. Performance will be compared to a baseline algorithm, which gives suggestions that extend the string typed by the user to the right, e.g. optic nerve m gives optic nerve meningioma, but opt ner me does not. We conduct a user experiment in which 12 participants are invited to complete 40 snomed ct terms with the baseline algorithm and another set of 40 snomed ct terms with the multi-prefix algorithm. Our results show that users need significantly fewer keystrokes when supported by the multi-prefix algorithm than when supported by the baseline algorithm. The proposed algorithm is a competitive candidate for searching and retrieving terms from a large medical ontology. Copyright © 2011 Elsevier Inc. All rights reserved.

Reliable clarity automatic-evaluation method for optical remote sensing images

Science.gov (United States)

Qin, Bangyong; Shang, Ren; Li, Shengyang; Hei, Baoqin; Liu, Zhiwen

2015-10-01

Image clarity, which reflects the sharpness degree at the edge of objects in images, is an important quality evaluate index for optical remote sensing images. Scholars at home and abroad have done a lot of work on estimation of image clarity. At present, common clarity-estimation methods for digital images mainly include frequency-domain function methods, statistical parametric methods, gradient function methods and edge acutance methods. Frequency-domain function method is an accurate clarity-measure approach. However, its calculation process is complicate and cannot be carried out automatically. Statistical parametric methods and gradient function methods are both sensitive to clarity of images, while their results are easy to be affected by the complex degree of images. Edge acutance method is an effective approach for clarity estimate, while it needs picking out the edges manually. Due to the limits in accuracy, consistent or automation, these existing methods are not applicable to quality evaluation of optical remote sensing images. In this article, a new clarity-evaluation method, which is based on the principle of edge acutance algorithm, is proposed. In the new method, edge detection algorithm and gradient search algorithm are adopted to automatically search the object edges in images. Moreover, The calculation algorithm for edge sharpness has been improved. The new method has been tested with several groups of optical remote sensing images. Compared with the existing automatic evaluation methods, the new method perform better both in accuracy and consistency. Thus, the new method is an effective clarity evaluation method for optical remote sensing images.

Model-based remote sensing algorithms for particulate organic carbon

Indian Academy of Sciences (India)

negligible loss of spectral information from additional modes. The use of POC algorithms ... and mesoscale circulation system (Vastano et al. 1995; Walker 1996 .... fiber filters were combusted in a thermolyne type. 1300 furnace along with ...

Dense sampled transmission matrix for high resolution angular spectrum imaging through turbid media via compressed sensing (Conference Presentation)

Science.gov (United States)

Jang, Hwanchol; Yoon, Changhyeong; Choi, Wonshik; Eom, Tae Joong; Lee, Heung-No

2016-03-01

We provide an approach to improve the quality of image reconstruction in wide-field imaging through turbid media (WITM). In WITM, a calibration stage which measures the transmission matrix (TM), the set of responses of turbid medium to a set of plane waves with different incident angles, is preceded to the image recovery. Then, the TM is used for estimation of object image in image recovery stage. In this work, we aim to estimate highly resolved angular spectrum and use it for high quality image reconstruction. To this end, we propose to perform a dense sampling for TM measurement in calibration stage with finer incident angle spacing. In conventional approaches, incident angle spacing is made to be large enough so that the columns in TM are out of memory effect of turbid media. Otherwise, the columns in TM are correlated and the inversion becomes difficult. We employ compressed sensing (CS) for a successful high resolution angular spectrum recovery with dense sampled TM. CS is a relatively new information acquisition and reconstruction framework and has shown to provide superb performance in ill-conditioned inverse problems. We observe that the image quality metrics such as contrast-to-noise ratio and mean squared error are improved and the perceptual image quality is improved with reduced speckle noise in the reconstructed image. This results shows that the WITM performance can be improved only by executing dense sampling in the calibration stage and with an efficient signal reconstruction framework without elaborating the overall optical imaging systems.

Magnetic Field Sensing Based on Bi-Tapered Optical Fibers Using Spectral Phase Analysis.

Science.gov (United States)

Herrera-Piad, Luis A; Haus, Joseph W; Jauregui-Vazquez, Daniel; Sierra-Hernandez, Juan M; Estudillo-Ayala, Julian M; Lopez-Dieguez, Yanelis; Rojas-Laguna, Roberto

2017-10-20

A compact, magnetic field sensor system based on a short, bi-tapered optical fiber (BTOF) span lying on a magnetic tape was designed, fabricated, and characterized. We monitored the transmission spectrum from a broadband light source, which displayed a strong interference signal. After data collection, we applied a phase analysis of the interference optical spectrum. We here report the results on two fabricated, BTOFs with different interference spectrum characteristics; we analyzed the signal based on the interference between a high-order modal component and the core fiber mode. The sensor exhibited a linear response for magnetic field increments, and we achieved a phase sensitivity of around 0.28 rad/mT. The sensing setup presented remote sensing operation and low-cost transducer magnetic material.

Magnetic Field Sensing Based on Bi-Tapered Optical Fibers Using Spectral Phase Analysis

Directory of Open Access Journals (Sweden)

Luis A. Herrera-Piad

2017-10-01

Full Text Available A compact, magnetic field sensor system based on a short, bi-tapered optical fiber (BTOF span lying on a magnetic tape was designed, fabricated, and characterized. We monitored the transmission spectrum from a broadband light source, which displayed a strong interference signal. After data collection, we applied a phase analysis of the interference optical spectrum. We here report the results on two fabricated, BTOFs with different interference spectrum characteristics; we analyzed the signal based on the interference between a high-order modal component and the core fiber mode. The sensor exhibited a linear response for magnetic field increments, and we achieved a phase sensitivity of around 0.28 rad/mT. The sensing setup presented remote sensing operation and low-cost transducer magnetic material.

Joint random beam and spectrum selection for spectrum sharing systems with partial channel state information

KAUST Repository

Abdallah, Mohamed M.

2013-11-01

In this work, we develop joint interference-aware random beam and spectrum selection scheme that provide enhanced performance for the secondary network under the condition that the interference observed at the primary receiver is below a predetermined acceptable value. We consider a secondary link composed of a transmitter equipped with multiple antennas and a single-antenna receiver sharing the same spectrum with a set of primary links composed of a single-antenna transmitter and a single-antenna receiver. The proposed schemes jointly select a beam, among a set of power-optimized random beams, as well as the primary spectrum that maximizes the signal-to-interference-plus-noise ratio (SINR) of the secondary link while satisfying the primary interference constraint. In particular, we consider the case where the interference level is described by a q-bit description of its magnitude, whereby we propose a technique to find the optimal quantizer thresholds in a mean square error (MSE) sense. © 2013 IEEE.

Joint random beam and spectrum selection for spectrum sharing systems with partial channel state information

KAUST Repository

Abdallah, Mohamed M.; Sayed, Mostafa M.; Alouini, Mohamed-Slim; Qaraqe, Khalid A.

2013-01-01

In this work, we develop joint interference-aware random beam and spectrum selection scheme that provide enhanced performance for the secondary network under the condition that the interference observed at the primary receiver is below a predetermined acceptable value. We consider a secondary link composed of a transmitter equipped with multiple antennas and a single-antenna receiver sharing the same spectrum with a set of primary links composed of a single-antenna transmitter and a single-antenna receiver. The proposed schemes jointly select a beam, among a set of power-optimized random beams, as well as the primary spectrum that maximizes the signal-to-interference-plus-noise ratio (SINR) of the secondary link while satisfying the primary interference constraint. In particular, we consider the case where the interference level is described by a q-bit description of its magnitude, whereby we propose a technique to find the optimal quantizer thresholds in a mean square error (MSE) sense. © 2013 IEEE.

A New Waveform Signal Processing Method Based on Adaptive Clustering-Genetic Algorithms

International Nuclear Information System (INIS)

Noha Shaaban; Fukuzo Masuda; Hidetsugu Morota

2006-01-01

We present a fast digital signal processing method for numerical analysis of individual pulses from CdZnTe compound semiconductor detectors. Using Maxi-Mini Distance Algorithm and Genetic Algorithms based discrimination technique. A parametric approach has been used for classifying the discriminated waveforms into a set of clusters each has a similar signal shape with a corresponding pulse height spectrum. A corrected total pulse height spectrum was obtained by applying a normalization factor for the full energy peak for each cluster with a highly improvements in the energy spectrum characteristics. This method applied successfully for both simulated and real measured data, it can be applied to any detector suffers from signal shape variation. (authors)

Thermal infrared remote sensing of crude oil slicks

International Nuclear Information System (INIS)

Salisbury, J.W.; D'Aria, D.M.

1993-01-01

It is important to develop a remote sensing technique for reliable detection of oil slicks for reasons of both oil exploration and environmental protection. Yet, unambiguous detection has proven an elusive goal. This article presents new thermal infrared spectra of oil slicks made from five different crude oil samples with a wide range of API gravities and compositions. After a brief outgassing phase, all oil slick spectra are quite similar and little affected by thickness, extended exposure to air or sunlight, and even by emulsification with seawater (mousse formation). Thus, oil slicks provide a remarkably unvarying spectral signature as remote sensing targets in the thermal infrared compared to other regions of the spectrum. This spectral signature in the 8-14 μm atmospheric window is flat, with an average reflectance of 4%. Seawater, on the other hand, has a spectrum that varies in reflectance with wavelength in the 8-14 μm window from 0.90 to 3.65%. In addition, the authors show that sea foam displays a reflectance spectrum quite similar to that of seawater in the 8-14 μm region, because the very high absorption coefficient of water in this wavelength region prevents volume scattering in foam bubbles. This results in a relatively uniform spectral background, against which oil slicks can be detected, based on their different spectral signature. Thus, thermal infrared multispectral remote sensing appears to offer a simple and reliable technique for aircraft or satellite detection of oil slicks

Estimation error algorithm at analysis of beta-spectra

International Nuclear Information System (INIS)

Bakovets, N.V.; Zhukovskij, A.I.; Zubarev, V.N.; Khadzhinov, E.M.

2005-01-01

This work describes the estimation error algorithm at the operations with beta-spectrums, as well as compares the theoretical and experimental errors by the processing of beta-channel's data. (authors)

Study on Additional Carrier Sensing for IEEE 802.15.4 Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Bih-Hwang Lee

2010-06-01

Full Text Available Wireless sensor networks based on the IEEE 802.15.4 standard are able to achieve low-power transmissions in the guise of low-rate and short-distance wireless personal area networks (WPANs. The slotted carrier sense multiple access with collision avoidance (CSMA/CA is used for contention mechanism. Sensor nodes perform a backoff process as soon as the clear channel assessment (CCA detects a busy channel. In doing so they may neglect the implicit information of the failed CCA detection and further cause the redundant sensing. The blind backoff process in the slotted CSMA/CA will cause lower channel utilization. This paper proposes an additional carrier sensing (ACS algorithm based on IEEE 802.15.4 to enhance the carrier sensing mechanism for the original slotted CSMA/CA. An analytical Markov chain model is developed to evaluate the performance of the ACS algorithm. Both analytical and simulation results show that the proposed algorithm performs better than IEEE 802.15.4, which in turn significantly improves throughput, average medium access control (MAC delay and power consumption of CCA detection.

Study on additional carrier sensing for IEEE 802.15.4 wireless sensor networks.

Science.gov (United States)

Lee, Bih-Hwang; Lai, Ruei-Lung; Wu, Huai-Kuei; Wong, Chi-Ming

2010-01-01

Wireless sensor networks based on the IEEE 802.15.4 standard are able to achieve low-power transmissions in the guise of low-rate and short-distance wireless personal area networks (WPANs). The slotted carrier sense multiple access with collision avoidance (CSMA/CA) is used for contention mechanism. Sensor nodes perform a backoff process as soon as the clear channel assessment (CCA) detects a busy channel. In doing so they may neglect the implicit information of the failed CCA detection and further cause the redundant sensing. The blind backoff process in the slotted CSMA/CA will cause lower channel utilization. This paper proposes an additional carrier sensing (ACS) algorithm based on IEEE 802.15.4 to enhance the carrier sensing mechanism for the original slotted CSMA/CA. An analytical Markov chain model is developed to evaluate the performance of the ACS algorithm. Both analytical and simulation results show that the proposed algorithm performs better than IEEE 802.15.4, which in turn significantly improves throughput, average medium access control (MAC) delay and power consumption of CCA detection.

Spatial-Spectral Approaches to Edge Detection in Hyperspectral Remote Sensing

Science.gov (United States)

Cox, Cary M.

This dissertation advances geoinformation science at the intersection of hyperspectral remote sensing and edge detection methods. A relatively new phenomenology among its remote sensing peers, hyperspectral imagery (HSI) comprises only about 7% of all remote sensing research - there are five times as many radar-focused peer reviewed journal articles than hyperspectral-focused peer reviewed journal articles. Similarly, edge detection studies comprise only about 8% of image processing research, most of which is dedicated to image processing techniques most closely associated with end results, such as image classification and feature extraction. Given the centrality of edge detection to mapping, that most important of geographic functions, improving the collective understanding of hyperspectral imagery edge detection methods constitutes a research objective aligned to the heart of geoinformation sciences. Consequently, this dissertation endeavors to narrow the HSI edge detection research gap by advancing three HSI edge detection methods designed to leverage HSI's unique chemical identification capabilities in pursuit of generating accurate, high-quality edge planes. The Di Zenzo-based gradient edge detection algorithm, an innovative version of the Resmini HySPADE edge detection algorithm and a level set-based edge detection algorithm are tested against 15 traditional and non-traditional HSI datasets spanning a range of HSI data configurations, spectral resolutions, spatial resolutions, bandpasses and applications. This study empirically measures algorithm performance against Dr. John Canny's six criteria for a good edge operator: false positives, false negatives, localization, single-point response, robustness to noise and unbroken edges. The end state is a suite of spatial-spectral edge detection algorithms that produce satisfactory edge results against a range of hyperspectral data types applicable to a diverse set of earth remote sensing applications. This work

Target Channel Visiting Order Design Using Particle Swarm Optimization for Spectrum Handoff in Cognitive Radio Networks

Directory of Open Access Journals (Sweden)

Shilian Zheng

2014-08-01

Full Text Available In a dynamic spectrum access network, when a primary user (licensed user reappears on the current channel, cognitive radios (CRs need to vacate the channel and reestablish a communications link on some other channel to avoid interference to primary users, resulting in spectrum handoff. This paper studies the problem of designing target channel visiting order for spectrum handoff to minimize expected spectrum handoff delay. A particle swarm optimization (PSO based algorithm is proposed to solve the problem. Simulation results show that the proposed algorithm performs far better than random target channel visiting scheme. The solutions obtained by PSO are very close to the optimal solution which further validates the effectiveness of the proposed method.

Algorithmic-Reducibility = Renormalization-Group Fixed-Points; ``Noise''-Induced Phase-Transitions (NITs) to Accelerate Algorithmics (``NIT-Picking'') Replacing CRUTCHES!!!: Gauss Modular/Clock-Arithmetic Congruences = Signal X Noise PRODUCTS..

Science.gov (United States)

Siegel, J.; Siegel, Edward Carl-Ludwig

2011-03-01

Cook-Levin computational-"complexity"(C-C) algorithmic-equivalence reduction-theorem reducibility equivalence to renormalization-(semi)-group phase-transitions critical-phenomena statistical-physics universality-classes fixed-points, is exploited with Gauss modular/clock-arithmetic/model congruences = signal X noise PRODUCT reinterpretation. Siegel-Baez FUZZYICS=CATEGORYICS(SON of ``TRIZ''): Category-Semantics(C-S) tabular list-format truth-table matrix analytics predicts and implements "noise"-induced phase-transitions (NITs) to accelerate versus to decelerate Harel [Algorithmics(1987)]-Sipser[Intro. Theory Computation(1997) algorithmic C-C: "NIT-picking" to optimize optimization-problems optimally(OOPO). Versus iso-"noise" power-spectrum quantitative-only amplitude/magnitude-only variation stochastic-resonance, this "NIT-picking" is "noise" power-spectrum QUALitative-type variation via quantitative critical-exponents variation. Computer-"science" algorithmic C-C models: Turing-machine, finite-state-models/automata, are identified as early-days once-workable but NOW ONLY LIMITING CRUTCHES IMPEDING latter-days new-insights!!!

Study of key technology of ghost imaging via compressive sensing for a phase object based on phase-shifting digital holography

International Nuclear Information System (INIS)

Leihong, Zhang; Dong, Liang; Bei, Li; Zilan, Pan; Dawei, Zhang; Xiuhua, Ma

2015-01-01

In this article, the algorithm of compressing sensing is used to improve the imaging resolution and realize ghost imaging via compressive sensing for a phase object based on the theoretical analysis of the lensless Fourier imaging of the algorithm of ghost imaging based on phase-shifting digital holography. The algorithm of ghost imaging via compressive sensing based on phase-shifting digital holography uses the bucket detector to measure the total light intensity of the interference and the four-step phase-shifting method is used to obtain the total light intensity of differential interference light. The experimental platform is built based on the software simulation, and the experimental results show that the algorithm of ghost imaging via compressive sensing based on phase-shifting digital holography can obtain the high-resolution phase distribution figure of the phase object. With the same sampling times, the phase clarity of the phase distribution figure obtained by the algorithm of ghost imaging via compressive sensing based on phase-shifting digital holography is higher than that obtained by the algorithm of ghost imaging based on phase-shift digital holography. In this article, this study further extends the application range of ghost imaging and obtains the phase distribution of the phase object. (letter)

Advances in multi-sensor data fusion: algorithms and applications.

Science.gov (United States)

Dong, Jiang; Zhuang, Dafang; Huang, Yaohuan; Fu, Jingying

2009-01-01

With the development of satellite and remote sensing techniques, more and more image data from airborne/satellite sensors have become available. Multi-sensor image fusion seeks to combine information from different images to obtain more inferences than can be derived from a single sensor. In image-based application fields, image fusion has emerged as a promising research area since the end of the last century. The paper presents an overview of recent advances in multi-sensor satellite image fusion. Firstly, the most popular existing fusion algorithms are introduced, with emphasis on their recent improvements. Advances in main applications fields in remote sensing, including object identification, classification, change detection and maneuvering targets tracking, are described. Both advantages and limitations of those applications are then discussed. Recommendations are addressed, including: (1) Improvements of fusion algorithms; (2) Development of "algorithm fusion" methods; (3) Establishment of an automatic quality assessment scheme.

Spectrum recovery method based on sparse representation for segmented multi-Gaussian model

Science.gov (United States)

Teng, Yidan; Zhang, Ye; Ti, Chunli; Su, Nan

2016-09-01

Hyperspectral images can realize crackajack features discriminability for supplying diagnostic characteristics with high spectral resolution. However, various degradations may generate negative influence on the spectral information, including water absorption, bands-continuous noise. On the other hand, the huge data volume and strong redundancy among spectrums produced intense demand on compressing HSIs in spectral dimension, which also leads to the loss of spectral information. The reconstruction of spectral diagnostic characteristics has irreplaceable significance for the subsequent application of HSIs. This paper introduces a spectrum restoration method for HSIs making use of segmented multi-Gaussian model (SMGM) and sparse representation. A SMGM is established to indicating the unsymmetrical spectral absorption and reflection characteristics, meanwhile, its rationality and sparse property are discussed. With the application of compressed sensing (CS) theory, we implement sparse representation to the SMGM. Then, the degraded and compressed HSIs can be reconstructed utilizing the uninjured or key bands. Finally, we take low rank matrix recovery (LRMR) algorithm for post processing to restore the spatial details. The proposed method was tested on the spectral data captured on the ground with artificial water absorption condition and an AVIRIS-HSI data set. The experimental results in terms of qualitative and quantitative assessments demonstrate that the effectiveness on recovering the spectral information from both degradations and loss compression. The spectral diagnostic characteristics and the spatial geometry feature are well preserved.

A broad range quorum sensing inhibitor working through sRNA inhibition

DEFF Research Database (Denmark)

Jakobsen, Tim H.; Warming, Anders N.; Vejborg, Rebecca M.

2017-01-01

that the repressing effect of ajoene on quorum sensing occurs by inhibition of small regulatory RNAs (sRNA) in P. aeruginosa as well as in Staphylococcus aureus, another important human pathogen that employs quorum sensing to control virulence gene expression. Using various reporter constructs, we found that ajoene......-spectrum compounds transcending the Gram negative-positive borderline....

RMP: Reduced-set matching pursuit approach for efficient compressed sensing signal reconstruction

Directory of Open Access Journals (Sweden)

Michael M. Abdel-Sayed

2016-11-01

Full Text Available Compressed sensing enables the acquisition of sparse signals at a rate that is much lower than the Nyquist rate. Compressed sensing initially adopted ℓ1 minimization for signal reconstruction which is computationally expensive. Several greedy recovery algorithms have been recently proposed for signal reconstruction at a lower computational complexity compared to the optimal ℓ1 minimization, while maintaining a good reconstruction accuracy. In this paper, the Reduced-set Matching Pursuit (RMP greedy recovery algorithm is proposed for compressed sensing. Unlike existing approaches which either select too many or too few values per iteration, RMP aims at selecting the most sufficient number of correlation values per iteration, which improves both the reconstruction time and error. Furthermore, RMP prunes the estimated signal, and hence, excludes the incorrectly selected values. The RMP algorithm achieves a higher reconstruction accuracy at a significantly low computational complexity compared to existing greedy recovery algorithms. It is even superior to ℓ1 minimization in terms of the normalized time-error product, a new metric introduced to measure the trade-off between the reconstruction time and error. RMP superior performance is illustrated with both noiseless and noisy samples.

RMP: Reduced-set matching pursuit approach for efficient compressed sensing signal reconstruction.

Science.gov (United States)

Abdel-Sayed, Michael M; Khattab, Ahmed; Abu-Elyazeed, Mohamed F

2016-11-01

Compressed sensing enables the acquisition of sparse signals at a rate that is much lower than the Nyquist rate. Compressed sensing initially adopted [Formula: see text] minimization for signal reconstruction which is computationally expensive. Several greedy recovery algorithms have been recently proposed for signal reconstruction at a lower computational complexity compared to the optimal [Formula: see text] minimization, while maintaining a good reconstruction accuracy. In this paper, the Reduced-set Matching Pursuit (RMP) greedy recovery algorithm is proposed for compressed sensing. Unlike existing approaches which either select too many or too few values per iteration, RMP aims at selecting the most sufficient number of correlation values per iteration, which improves both the reconstruction time and error. Furthermore, RMP prunes the estimated signal, and hence, excludes the incorrectly selected values. The RMP algorithm achieves a higher reconstruction accuracy at a significantly low computational complexity compared to existing greedy recovery algorithms. It is even superior to [Formula: see text] minimization in terms of the normalized time-error product, a new metric introduced to measure the trade-off between the reconstruction time and error. RMP superior performance is illustrated with both noiseless and noisy samples.

Low-Altitude and Slow-Speed Small Target Detection Based on Spectrum Zoom Processing

Directory of Open Access Journals (Sweden)

Xuwang Zhang

2018-01-01

Full Text Available This paper proposes a spectrum zoom processing based target detection algorithm for detecting the weak echo of low-altitude and slow-speed small (LSS targets in heavy ground clutter environments, which can be used to retrofit the existing radar systems. With the existing range-Doppler frequency images, the proposed method firstly concatenates the data from the same Doppler frequency slot of different images and then applies the spectrum zoom processing. After performing the clutter suppression, the target detection can be finally implemented. Through the theoretical analysis and real data verification, it is shown that the proposed algorithm can obtain a preferable spectrum zoom result and improve the signal-to-clutter ratio (SCR with a very low computational load.

An optical water type framework for selecting and blending retrievals from bio-optical algorithms in lakes and coastal waters.

Science.gov (United States)

Moore, Timothy S; Dowell, Mark D; Bradt, Shane; Verdu, Antonio Ruiz

2014-03-05

Bio-optical models are based on relationships between the spectral remote sensing reflectance and optical properties of in-water constituents. The wavelength range where this information can be exploited changes depending on the water characteristics. In low chlorophyll- a waters, the blue/green region of the spectrum is more sensitive to changes in chlorophyll- a concentration, whereas the red/NIR region becomes more important in turbid and/or eutrophic waters. In this work we present an approach to manage the shift from blue/green ratios to red/NIR-based chlorophyll- a algorithms for optically complex waters. Based on a combined in situ data set of coastal and inland waters, measures of overall algorithm uncertainty were roughly equal for two chlorophyll- a algorithms-the standard NASA OC4 algorithm based on blue/green bands and a MERIS 3-band algorithm based on red/NIR bands-with RMS error of 0.416 and 0.437 for each in log chlorophyll- a units, respectively. However, it is clear that each algorithm performs better at different chlorophyll- a ranges. When a blending approach is used based on an optical water type classification, the overall RMS error was reduced to 0.320. Bias and relative error were also reduced when evaluating the blended chlorophyll- a product compared to either of the single algorithm products. As a demonstration for ocean color applications, the algorithm blending approach was applied to MERIS imagery over Lake Erie. We also examined the use of this approach in several coastal marine environments, and examined the long-term frequency of the OWTs to MODIS-Aqua imagery over Lake Erie.

Eliminating the zero spectrum in Fourier transform profilometry using empirical mode decomposition.

Science.gov (United States)

Li, Sikun; Su, Xianyu; Chen, Wenjing; Xiang, Liqun

2009-05-01

Empirical mode decomposition is introduced into Fourier transform profilometry to extract the zero spectrum included in the deformed fringe pattern without the need for capturing two fringe patterns with pi phase difference. The fringe pattern is subsequently demodulated using a standard Fourier transform profilometry algorithm. With this method, the deformed fringe pattern is adaptively decomposed into a finite number of intrinsic mode functions that vary from high frequency to low frequency by means of an algorithm referred to as a sifting process. Then the zero spectrum is separated from the high-frequency components effectively. Experiments validate the feasibility of this method.

Multiobjective generalized extremal optimization algorithm for simulation of daylight illuminants

Science.gov (United States)

Kumar, Srividya Ravindra; Kurian, Ciji Pearl; Gomes-Borges, Marcos Eduardo

2017-10-01

Daylight illuminants are widely used as references for color quality testing and optical vision testing applications. Presently used daylight simulators make use of fluorescent bulbs that are not tunable and occupy more space inside the quality testing chambers. By designing a spectrally tunable LED light source with an optimal number of LEDs, cost, space, and energy can be saved. This paper describes an application of the generalized extremal optimization (GEO) algorithm for selection of the appropriate quantity and quality of LEDs that compose the light source. The multiobjective approach of this algorithm tries to get the best spectral simulation with minimum fitness error toward the target spectrum, correlated color temperature (CCT) the same as the target spectrum, high color rendering index (CRI), and luminous flux as required for testing applications. GEO is a global search algorithm based on phenomena of natural evolution and is especially designed to be used in complex optimization problems. Several simulations have been conducted to validate the performance of the algorithm. The methodology applied to model the LEDs, together with the theoretical basis for CCT and CRI calculation, is presented in this paper. A comparative result analysis of M-GEO evolutionary algorithm with the Levenberg-Marquardt conventional deterministic algorithm is also presented.

Research on remote sensing image pixel attribute data acquisition method in AutoCAD

Science.gov (United States)

Liu, Xiaoyang; Sun, Guangtong; Liu, Jun; Liu, Hui

2013-07-01

The remote sensing image has been widely used in AutoCAD, but AutoCAD lack of the function of remote sensing image processing. In the paper, ObjectARX was used for the secondary development tool, combined with the Image Engine SDK to realize remote sensing image pixel attribute data acquisition in AutoCAD, which provides critical technical support for AutoCAD environment remote sensing image processing algorithms.

Analyzing Fourier Transforms for NASA DFRC's Fiber Optic Strain Sensing System

Science.gov (United States)

Fiechtner, Kaitlyn Leann

2010-01-01

This document provides a basic overview of the fiber optic technology used for sensing stress, strain, and temperature. Also, the document summarizes the research concerning speed and accuracy of the possible mathematical algorithms that can be used for NASA DFRC's Fiber Optic Strain Sensing (FOSS) system.

An Energy-Efficient Game-Theory-Based Spectrum Decision Scheme for Cognitive Radio Sensor Networks.

Science.gov (United States)

Salim, Shelly; Moh, Sangman

2016-06-30

A cognitive radio sensor network (CRSN) is a wireless sensor network in which sensor nodes are equipped with cognitive radio. In this paper, we propose an energy-efficient game-theory-based spectrum decision (EGSD) scheme for CRSNs to prolong the network lifetime. Note that energy efficiency is the most important design consideration in CRSNs because it determines the network lifetime. The central part of the EGSD scheme consists of two spectrum selection algorithms: random selection and game-theory-based selection. The EGSD scheme also includes a clustering algorithm, spectrum characterization with a Markov chain, and cluster member coordination. Our performance study shows that EGSD outperforms the existing popular framework in terms of network lifetime and coordination overhead.

Remote Sensing Digital Image Analysis An Introduction

CERN Document Server

Richards, John A

2013-01-01

Remote Sensing Digital Image Analysis provides the non-specialist with a treatment of the quantitative analysis of satellite and aircraft derived remotely sensed data. Since the first edition of the book there have been significant developments in the algorithms used for the processing and analysis of remote sensing imagery; nevertheless many of the fundamentals have substantially remained the same.  This new edition presents material that has retained value since those early days, along with new techniques that can be incorporated into an operational framework for the analysis of remote sensing data. The book is designed as a teaching text for the senior undergraduate and postgraduate student, and as a fundamental treatment for those engaged in research using digital image processing in remote sensing.  The presentation level is for the mathematical non-specialist.  Since the very great number of operational users of remote sensing come from the earth sciences communities, the text is pitched at a leve...

ALFA: an automated line fitting algorithm

Science.gov (United States)

Wesson, R.

2016-03-01

I present the automated line fitting algorithm, ALFA, a new code which can fit emission line spectra of arbitrary wavelength coverage and resolution, fully automatically. In contrast to traditional emission line fitting methods which require the identification of spectral features suspected to be emission lines, ALFA instead uses a list of lines which are expected to be present to construct a synthetic spectrum. The parameters used to construct the synthetic spectrum are optimized by means of a genetic algorithm. Uncertainties are estimated using the noise structure of the residuals. An emission line spectrum containing several hundred lines can be fitted in a few seconds using a single processor of a typical contemporary desktop or laptop PC. I show that the results are in excellent agreement with those measured manually for a number of spectra. Where discrepancies exist, the manually measured fluxes are found to be less accurate than those returned by ALFA. Together with the code NEAT, ALFA provides a powerful way to rapidly extract physical information from observations, an increasingly vital function in the era of highly multiplexed spectroscopy. The two codes can deliver a reliable and comprehensive analysis of very large data sets in a few hours with little or no user interaction.

Extending remote sensing estimates of Greenland ice sheet melting

Science.gov (United States)

Heavner, M.; Loveland, R.

2010-12-01

The Melt Area Detection Index (MADI), a remote sensing algorithm to discriminate between dry and wet snow, has been previously developed and applied to the western portion of the Greenland ice sheet for the years 2000-2006, using Moderate Resolution Imaging Radiospectrometer (MODIS) data (Chylek et al, 2007). We extend that work both spatially and temporally by taking advantage of newly available data, and developing algorithms that facilitate the sensing of cloud cover and the automated inference of wet snow regions. The automated methods allow the development of a composite melt area data product with 0.25 km^2 spatial resolution and approximately two week temporal resolution. We discuss melt area dynamics that are inferred from this high resolution composite melt area. Chylek, P., M. McCabe, M. K. Dubey, and J. Dozier (2007), Remote sensing of Greenland ice sheet using multispectral near-infrared and visible radiances, J. Geophys. Res., 112, D24S20, doi:10.1029/2007JD008742.

3D noise power spectrum applied on clinical MDCT scanners: effects of reconstruction algorithms and reconstruction filters

Science.gov (United States)

Miéville, Frédéric A.; Bolard, Gregory; Benkreira, Mohamed; Ayestaran, Paul; Gudinchet, François; Bochud, François; Verdun, Francis R.

2011-03-01

The noise power spectrum (NPS) is the reference metric for understanding the noise content in computed tomography (CT) images. To evaluate the noise properties of clinical multidetector (MDCT) scanners, local 2D and 3D NPSs were computed for different acquisition reconstruction parameters. A 64- and a 128-MDCT scanners were employed. Measurements were performed on a water phantom in axial and helical acquisition modes. CT dose index was identical for both installations. Influence of parameters such as the pitch, the reconstruction filter (soft, standard and bone) and the reconstruction algorithm (filtered-back projection (FBP), adaptive statistical iterative reconstruction (ASIR)) were investigated. Images were also reconstructed in the coronal plane using a reformat process. Then 2D and 3D NPS methods were computed. In axial acquisition mode, the 2D axial NPS showed an important magnitude variation as a function of the z-direction when measured at the phantom center. In helical mode, a directional dependency with lobular shape was observed while the magnitude of the NPS was kept constant. Important effects of the reconstruction filter, pitch and reconstruction algorithm were observed on 3D NPS results for both MDCTs. With ASIR, a reduction of the NPS magnitude and a shift of the NPS peak to the low frequency range were visible. 2D coronal NPS obtained from the reformat images was impacted by the interpolation when compared to 2D coronal NPS obtained from 3D measurements. The noise properties of volume measured in last generation MDCTs was studied using local 3D NPS metric. However, impact of the non-stationarity noise effect may need further investigations.

Remote sensing image segmentation based on Hadoop cloud platform

Science.gov (United States)

Li, Jie; Zhu, Lingling; Cao, Fubin

2018-01-01

To solve the problem that the remote sensing image segmentation speed is slow and the real-time performance is poor, this paper studies the method of remote sensing image segmentation based on Hadoop platform. On the basis of analyzing the structural characteristics of Hadoop cloud platform and its component MapReduce programming, this paper proposes a method of image segmentation based on the combination of OpenCV and Hadoop cloud platform. Firstly, the MapReduce image processing model of Hadoop cloud platform is designed, the input and output of image are customized and the segmentation method of the data file is rewritten. Then the Mean Shift image segmentation algorithm is implemented. Finally, this paper makes a segmentation experiment on remote sensing image, and uses MATLAB to realize the Mean Shift image segmentation algorithm to compare the same image segmentation experiment. The experimental results show that under the premise of ensuring good effect, the segmentation rate of remote sensing image segmentation based on Hadoop cloud Platform has been greatly improved compared with the single MATLAB image segmentation, and there is a great improvement in the effectiveness of image segmentation.

Switch and examine transmit diversity for spectrum sharing systems

KAUST Repository

Abdallah, Mohamed M.; Alouini, Mohamed-Slim; Qaraqe, Khalid A.

2011-01-01

In this paper, we develop a switch and examine transmit diversity algorithm for spectrum sharing cognitive networks. We consider a cognitive network composed of a primary link that employs constant rate and constant power transmission scheme

Equivalent Sensor Radiance Generation and Remote Sensing from Model Parameters. Part 1; Equivalent Sensor Radiance Formulation

Science.gov (United States)

Wind, Galina; DaSilva, Arlindo M.; Norris, Peter M.; Platnick, Steven E.

2013-01-01

In this paper we describe a general procedure for calculating equivalent sensor radiances from variables output from a global atmospheric forecast model. In order to take proper account of the discrepancies between model resolution and sensor footprint the algorithm takes explicit account of the model subgrid variability, in particular its description of the probably density function of total water (vapor and cloud condensate.) The equivalent sensor radiances are then substituted into an operational remote sensing algorithm processing chain to produce a variety of remote sensing products that would normally be produced from actual sensor output. This output can then be used for a wide variety of purposes such as model parameter verification, remote sensing algorithm validation, testing of new retrieval methods and future sensor studies. We show a specific implementation using the GEOS-5 model, the MODIS instrument and the MODIS Adaptive Processing System (MODAPS) Data Collection 5.1 operational remote sensing cloud algorithm processing chain (including the cloud mask, cloud top properties and cloud optical and microphysical properties products.) We focus on clouds and cloud/aerosol interactions, because they are very important to model development and improvement.

Local multiplicative Schwarz algorithms for convection-diffusion equations

Science.gov (United States)

Cai, Xiao-Chuan; Sarkis, Marcus

1995-01-01

We develop a new class of overlapping Schwarz type algorithms for solving scalar convection-diffusion equations discretized by finite element or finite difference methods. The preconditioners consist of two components, namely, the usual two-level additive Schwarz preconditioner and the sum of some quadratic terms constructed by using products of ordered neighboring subdomain preconditioners. The ordering of the subdomain preconditioners is determined by considering the direction of the flow. We prove that the algorithms are optimal in the sense that the convergence rates are independent of the mesh size, as well as the number of subdomains. We show by numerical examples that the new algorithms are less sensitive to the direction of the flow than either the classical multiplicative Schwarz algorithms, and converge faster than the additive Schwarz algorithms. Thus, the new algorithms are more suitable for fluid flow applications than the classical additive or multiplicative Schwarz algorithms.

A Novel Hybrid Firefly Algorithm for Global Optimization.

Directory of Open Access Journals (Sweden)

Lina Zhang

Full Text Available Global optimization is challenging to solve due to its nonlinearity and multimodality. Traditional algorithms such as the gradient-based methods often struggle to deal with such problems and one of the current trends is to use metaheuristic algorithms. In this paper, a novel hybrid population-based global optimization algorithm, called hybrid firefly algorithm (HFA, is proposed by combining the advantages of both the firefly algorithm (FA and differential evolution (DE. FA and DE are executed in parallel to promote information sharing among the population and thus enhance searching efficiency. In order to evaluate the performance and efficiency of the proposed algorithm, a diverse set of selected benchmark functions are employed and these functions fall into two groups: unimodal and multimodal. The experimental results show better performance of the proposed algorithm compared to the original version of the firefly algorithm (FA, differential evolution (DE and particle swarm optimization (PSO in the sense of avoiding local minima and increasing the convergence rate.

An Innovative Thinking-Based Intelligent Information Fusion Algorithm

Directory of Open Access Journals (Sweden)

Huimin Lu

2013-01-01

Full Text Available This study proposes an intelligent algorithm that can realize information fusion in reference to the relative research achievements in brain cognitive theory and innovative computation. This algorithm treats knowledge as core and information fusion as a knowledge-based innovative thinking process. Furthermore, the five key parts of this algorithm including information sense and perception, memory storage, divergent thinking, convergent thinking, and evaluation system are simulated and modeled. This algorithm fully develops innovative thinking skills of knowledge in information fusion and is a try to converse the abstract conception of brain cognitive science to specific and operable research routes and strategies. Furthermore, the influences of each parameter of this algorithm on algorithm performance are analyzed and compared with those of classical intelligent algorithms trough test. Test results suggest that the algorithm proposed in this study can obtain the optimum problem solution by less target evaluation times, improve optimization effectiveness, and achieve the effective fusion of information.

A robust cooperative spectrum sensing scheme based on Dempster-Shafer theory and trustworthiness degree calculation in cognitive radio networks

Science.gov (United States)

Wang, Jinlong; Feng, Shuo; Wu, Qihui; Zheng, Xueqiang; Xu, Yuhua; Ding, Guoru

2014-12-01

Cognitive radio (CR) is a promising technology that brings about remarkable improvement in spectrum utilization. To tackle the hidden terminal problem, cooperative spectrum sensing (CSS) which benefits from the spatial diversity has been studied extensively. Since CSS is vulnerable to the attacks initiated by malicious secondary users (SUs), several secure CSS schemes based on Dempster-Shafer theory have been proposed. However, the existing works only utilize the current difference of SUs, such as the difference in SNR or similarity degree, to evaluate the trustworthiness of each SU. As the current difference is only one-sided and sometimes inaccurate, the statistical information contained in each SU's historical behavior should not be overlooked. In this article, we propose a robust CSS scheme based on Dempster-Shafer theory and trustworthiness degree calculation. It is carried out in four successive steps, which are basic probability assignment (BPA), trustworthiness degree calculation, selection and adjustment of BPA, and combination by Dempster-Shafer rule, respectively. Our proposed scheme evaluates the trustworthiness degree of SUs from both current difference aspect and historical behavior aspect and exploits Dempster-Shafer theory's potential to establish a `soft update' approach for the reputation value maintenance. It can not only differentiate malicious SUs from honest ones based on their historical behaviors but also reserve the current difference for each SU to achieve a better real-time performance. Abundant simulation results have validated that the proposed scheme outperforms the existing ones under the impact of different attack patterns and different number of malicious SUs.

Quantum game application to spectrum scarcity problems

Science.gov (United States)

Zabaleta, O. G.; Barrangú, J. P.; Arizmendi, C. M.

2017-01-01

Recent spectrum-sharing research has produced a strategy to address spectrum scarcity problems. This novel idea, named cognitive radio, considers that secondary users can opportunistically exploit spectrum holes left temporarily unused by primary users. This presents a competitive scenario among cognitive users, making it suitable for game theory treatment. In this work, we show that the spectrum-sharing benefits of cognitive radio can be increased by designing a medium access control based on quantum game theory. In this context, we propose a model to manage spectrum fairly and effectively, based on a multiple-users multiple-choice quantum minority game. By taking advantage of quantum entanglement and quantum interference, it is possible to reduce the probability of collision problems commonly associated with classic algorithms. Collision avoidance is an essential property for classic and quantum communications systems. In our model, two different scenarios are considered, to meet the requirements of different user strategies. The first considers sensor networks where the rational use of energy is a cornerstone; the second focuses on installations where the quality of service of the entire network is a priority.

Multi-stage phase retrieval algorithm based upon the gyrator transform.

Science.gov (United States)

Rodrigo, José A; Duadi, Hamootal; Alieva, Tatiana; Zalevsky, Zeev

2010-01-18

The gyrator transform is a useful tool for optical information processing applications. In this work we propose a multi-stage phase retrieval approach based on this operation as well as on the well-known Gerchberg-Saxton algorithm. It results in an iterative algorithm able to retrieve the phase information using several measurements of the gyrator transform power spectrum. The viability and performance of the proposed algorithm is demonstrated by means of several numerical simulations and experimental results.

Multi-stage phase retrieval algorithm based upon the gyrator transform

OpenAIRE

Rodrigo Martín-Romo, José Augusto; Duadi, Hamootal; Alieva, Tatiana Krasheninnikova; Zalevsky, Zeev

2010-01-01

The gyrator transform is a useful tool for optical information processing applications. In this work we propose a multi-stage phase retrieval approach based on this operation as well as on the well-known Gerchberg-Saxton algorithm. It results in an iterative algorithm able to retrieve the phase information using several measurements of the gyrator transform power spectrum. The viability and performance of the proposed algorithm is demonstrated by means of several numerical simulations and exp...

Design of a Novel Flexible Capacitive Sensing Mattress for Monitoring Sleeping Respiratory

Directory of Open Access Journals (Sweden)

Wen-Ying Chang

2014-11-01

Full Text Available In this paper, an algorithm to extract respiration signals using a flexible projected capacitive sensing mattress (FPCSM designed for personal health assessment is proposed. Unlike the interfaces of conventional measurement systems for poly-somnography (PSG and other alternative contemporary systems, the proposed FPCSM uses projected capacitive sensing capability that is not worn or attached to the body. The FPCSM is composed of a multi-electrode sensor array that can not only observe gestures and motion behaviors, but also enables the FPCSM to function as a respiration monitor during sleep using the proposed approach. To improve long-term monitoring when body movement is possible, the FPCSM enables the selection of data from the sensing array, and the FPCSM methodology selects the electrodes with the optimal signals after the application of a channel reduction algorithm that counts the reversals in the capacitive sensing signals as a quality indicator. The simple algorithm is implemented in the time domain. The FPCSM system is used in experimental tests and is simultaneously compared with a commercial PSG system for verification. Multiple synchronous measurements are performed from different locations of body contact, and parallel data sets are collected. The experimental comparison yields a correlation coefficient of 0.88 between FPCSM and PSG, demonstrating the feasibility of the system design.

An Energy-Efficient Game-Theory-Based Spectrum Decision Scheme for Cognitive Radio Sensor Networks

Directory of Open Access Journals (Sweden)

Shelly Salim

2016-06-01

Full Text Available A cognitive radio sensor network (CRSN is a wireless sensor network in which sensor nodes are equipped with cognitive radio. In this paper, we propose an energy-efficient game-theory-based spectrum decision (EGSD scheme for CRSNs to prolong the network lifetime. Note that energy efficiency is the most important design consideration in CRSNs because it determines the network lifetime. The central part of the EGSD scheme consists of two spectrum selection algorithms: random selection and game-theory-based selection. The EGSD scheme also includes a clustering algorithm, spectrum characterization with a Markov chain, and cluster member coordination. Our performance study shows that EGSD outperforms the existing popular framework in terms of network lifetime and coordination overhead.

A Gaussian process and derivative spectral-based algorithm for red blood cell segmentation

Science.gov (United States)

Xue, Yingying; Wang, Jianbiao; Zhou, Mei; Hou, Xiyue; Li, Qingli; Liu, Hongying; Wang, Yiting

2017-07-01

As an imaging technology used in remote sensing, hyperspectral imaging can provide more information than traditional optical imaging of blood cells. In this paper, an AOTF based microscopic hyperspectral imaging system is used to capture hyperspectral images of blood cells. In order to achieve the segmentation of red blood cells, Gaussian process using squared exponential kernel function is applied first after the data preprocessing to make the preliminary segmentation. The derivative spectrum with spectral angle mapping algorithm is then applied to the original image to segment the boundary of cells, and using the boundary to cut out cells obtained from the Gaussian process to separated adjacent cells. Then the morphological processing method including closing, erosion and dilation is applied so as to keep adjacent cells apart, and by applying median filtering to remove noise points and filling holes inside the cell, the final segmentation result can be obtained. The experimental results show that this method appears better segmentation effect on human red blood cells.

[Extracting THz absorption coefficient spectrum based on accurate determination of sample thickness].

Science.gov (United States)

Li, Zhi; Zhang, Zhao-hui; Zhao, Xiao-yan; Su, Hai-xia; Yan, Fang

2012-04-01

Extracting absorption spectrum in THz band is one of the important aspects in THz applications. Sample's absorption coefficient has a complex nonlinear relationship with its thickness. However, as it is not convenient to measure the thickness directly, absorption spectrum is usually determined incorrectly. Based on the method proposed by Duvillaret which was used to precisely determine the thickness of LiNbO3, the approach to measuring the absorption coefficient spectra of glutamine and histidine in frequency range from 0.3 to 2.6 THz(1 THz = 10(12) Hz) was improved in this paper. In order to validate the correctness of this absorption spectrum, we designed a series of experiments to compare the linearity of absorption coefficient belonging to one kind amino acid in different concentrations. The results indicate that as agreed by Lambert-Beer's Law, absorption coefficient spectrum of amino acid from the improved algorithm performs better linearity with its concentration than that from the common algorithm, which can be the basis of quantitative analysis in further researches.

Validation of satellite data through the remote sensing techniques and the inclusion of them into agricultural education pilot programs

Science.gov (United States)

Papadavid, Georgios; Kountios, Georgios; Bournaris, T.; Michailidis, Anastasios; Hadjimitsis, Diofantos G.

2016-08-01

Nowadays, the remote sensing techniques have a significant role in all the fields of agricultural extensions as well as agricultural economics and education but they are used more specifically in hydrology. The aim of this paper is to demonstrate the use of field spectroscopy for validation of the satellite data and how combination of remote sensing techniques and field spectroscopy can have more accurate results for irrigation purposes. For this reason vegetation indices are used which are mostly empirical equations describing vegetation parameters during the lifecycle of the crops. These numbers are generated by some combination of remote sensing bands and may have some relationship to the amount of vegetation in a given image pixel. Due to the fact that most of the commonly used vegetation indices are only concerned with red-near-infrared spectrum and can be divided to perpendicular and ratio based indices the specific goal of the research is to illustrate the effect of the atmosphere to those indices, in both categories. In this frame field spectroscopy is employed in order to derive the spectral signatures of different crops in red and infrared spectrum after a campaign of ground measurements. The main indices have been calculated using satellite images taken at interval dates during the whole lifecycle of the crops by using a GER 1500 spectro-radiomete. These indices was compared to those extracted from satellite images after applying an atmospheric correction algorithm -darkest pixel- to the satellite images at a pre-processing level so as the indices would be in comparable form to those of the ground measurements. Furthermore, there has been a research made concerning the perspectives of the inclusion of the above mentioned remote satellite techniques to agricultural education pilot programs.

Efficient Error Detection in Soft Data Fusion for Cooperative Spectrum Sensing

KAUST Repository

Saqib Bhatti, Dost Muhammad; Ahmed, Saleem; Saeed, Nasir; Shaikh, Bushra

2018-01-01

. For CSS, all SUs report their sensing information through reporting channel to the central base station called fusion center (FC). During transmission, some of the SUs are subjected to fading and shadowing, due to which the overall performance of CSS

Unfolding neutron spectra obtained from BS–TLD system using genetic algorithm