536 research outputs found
Experimental Validation for Spectrum Cartography using Adaptive Multi-kernels
acceptedVersionNivå
Spectrum Cartography using Adaptive Multi-kernels – Experimental validation
Master's thesis Information- and communication technology IKT590 - University of Agder 201
Spectrum cartography techniques, challenges, opportunities, and applications: A survey
The spectrum cartography finds applications in several areas such as cognitive radios, spectrum aware communications, machine-type communications, Internet of Things, connected vehicles, wireless sensor networks, and radio frequency management systems, etc. This paper presents a survey on state-of-the-art of spectrum cartography techniques for the construction of various radio environment maps (REMs). Following a brief overview on spectrum cartography, various techniques considered to construct the REMs such as channel gain map, power spectral density map, power map, spectrum map, power propagation map, radio frequency map, and interference map are reviewed. In this paper, we compare the performance of the different spectrum cartography methods in terms of mean absolute error, mean square error, normalized mean square error, and root mean square error. The information presented in this paper aims to serve as a practical reference guide for various spectrum cartography methods for constructing different REMs. Finally, some of the open issues and challenges for future research and development are discussed.publishedVersio
Interpolating point spread function anisotropy
Planned wide-field weak lensing surveys are expected to reduce the
statistical errors on the shear field to unprecedented levels. In contrast,
systematic errors like those induced by the convolution with the point spread
function (PSF) will not benefit from that scaling effect and will require very
accurate modeling and correction. While numerous methods have been devised to
carry out the PSF correction itself, modeling of the PSF shape and its spatial
variations across the instrument field of view has, so far, attracted much less
attention. This step is nevertheless crucial because the PSF is only known at
star positions while the correction has to be performed at any position on the
sky. A reliable interpolation scheme is therefore mandatory and a popular
approach has been to use low-order bivariate polynomials. In the present paper,
we evaluate four other classical spatial interpolation methods based on splines
(B-splines), inverse distance weighting (IDW), radial basis functions (RBF) and
ordinary Kriging (OK). These methods are tested on the Star-challenge part of
the GRavitational lEnsing Accuracy Testing 2010 (GREAT10) simulated data and
are compared with the classical polynomial fitting (Polyfit). We also test all
our interpolation methods independently of the way the PSF is modeled, by
interpolating the GREAT10 star fields themselves (i.e., the PSF parameters are
known exactly at star positions). We find in that case RBF to be the clear
winner, closely followed by the other local methods, IDW and OK. The global
methods, Polyfit and B-splines, are largely behind, especially in fields with
(ground-based) turbulent PSFs. In fields with non-turbulent PSFs, all
interpolators reach a variance on PSF systematics better than
the upper bound expected by future space-based surveys, with
the local interpolators performing better than the global ones
Graph ambiguity
In this paper, we propose a rigorous way to define the concept of ambiguity in the domain of graphs. In past studies, the classical definition of ambiguity has been derived starting from fuzzy set and fuzzy information theories. Our aim is to show that also in the domain of the graphs it is possible to derive a formulation able to capture the same semantic and mathematical concept. To strengthen the theoretical results, we discuss the application of the graph ambiguity concept to the graph classification setting, conceiving a new kind of inexact graph matching procedure. The results prove that the graph ambiguity concept is a characterizing and discriminative property of graphs. (C) 2013 Elsevier B.V. All rights reserved
Geo-rectification and cloud-cover correction of multi-temporal Earth observation imagery
Over the past decades, improvements in remote sensing technology have led to mass proliferation of aerial imagery. This, in turn, opened vast new possibilities relating to land cover classification, cartography, and so forth.
As applications in these fields became increasingly more complex, the amount of data required also rose accordingly and so, to satisfy these new needs, automated systems had to be developed. Geometric distortions in raw imagery must be rectified, otherwise the high accuracy requirements of the newest applications will not be attained.
This dissertation proposes an automated solution for the pre-stages of multi-spectral satellite imagery classification, focusing on Fast Fourier Shift theorem based geo-rectification and multi-temporal cloud-cover correction.
By automatizing the first stages of image processing, automatic classifiers can take advantage of a larger supply of image data, eventually allowing for the creation of semi-real-time mapping applications
A new kernel method for hyperspectral image feature extraction
Hyperspectral image provides abundant spectral information for remote discrimination of subtle differences in ground covers. However, the increasing spectral dimensions, as well as the information redundancy, make the analysis and interpretation of hyperspectral images a challenge. Feature extraction is a very important step for hyperspectral image processing. Feature extraction methods aim at reducing the dimension of data, while preserving as much information as possible. Particularly, nonlinear feature extraction methods (e.g. kernel minimum noise fraction (KMNF) transformation) have been reported to benefit many applications of hyperspectral remote sensing, due to their good preservation of high-order structures of the original data. However, conventional KMNF or its extensions have some limitations on noise fraction estimation during the feature extraction, and this leads to poor performances for post-applications. This paper proposes a novel nonlinear feature extraction method for hyperspectral images. Instead of estimating noise fraction by the nearest neighborhood information (within a sliding window), the proposed method explores the use of image segmentation. The approach benefits both noise fraction estimation and information preservation, and enables a significant improvement for classification. Experimental results on two real hyperspectral images demonstrate the efficiency of the proposed method. Compared to conventional KMNF, the improvements of the method on two hyperspectral image classification are 8 and 11%. This nonlinear feature extraction method can be also applied to other disciplines where high-dimensional data analysis is required
A Tutorial on Environment-Aware Communications via Channel Knowledge Map for 6G
Sixth-generation (6G) mobile communication networks are expected to have
dense infrastructures, large-dimensional channels, cost-effective hardware,
diversified positioning methods, and enhanced intelligence. Such trends bring
both new challenges and opportunities for the practical design of 6G. On one
hand, acquiring channel state information (CSI) in real time for all wireless
links becomes quite challenging in 6G. On the other hand, there would be
numerous data sources in 6G containing high-quality location-tagged channel
data, making it possible to better learn the local wireless environment. By
exploiting such new opportunities and for tackling the CSI acquisition
challenge, there is a promising paradigm shift from the conventional
environment-unaware communications to the new environment-aware communications
based on the novel approach of channel knowledge map (CKM). This article aims
to provide a comprehensive tutorial overview on environment-aware
communications enabled by CKM to fully harness its benefits for 6G. First, the
basic concept of CKM is presented, and a comparison of CKM with various
existing channel inference techniques is discussed. Next, the main techniques
for CKM construction are discussed, including both the model-free and
model-assisted approaches. Furthermore, a general framework is presented for
the utilization of CKM to achieve environment-aware communications, followed by
some typical CKM-aided communication scenarios. Finally, important open
problems in CKM research are highlighted and potential solutions are discussed
to inspire future work
Enhancing temporal series of Sentinel-2 and Sentinel-3 data products: from classical regression to deep learning approach
Treball de Final de Mà ster Universitari Erasmus Mundus en Tecnologia Geoespacial (Pla de 2013). Codi: SIW013. Curs acadèmic 2020-2021The free and open availability of satellite images covering global extent in recent days provides many novel opportunities for global monitoring of the earth’s surface. Sentinel-2 (S2) and Sentinel-3 (S3) satellite missions capture mid to high resolution imagery with frequent revisit and show data synergy as they both focus on land and ocean observational needs. Specifically, the high temporal resolution of S3 (1-2 day revisit) presents potential in filling the data gaps in S2 (5 day revisit) vegetation products. In this scenario, this study assesses the feasibility of using Sentinel-3 images for Sentinel-2 vegetation products estimation using machine learning (ML) and deep learning (DL) approaches. This study employs four state of the art ML regression algorithms, linear regression, ridge regression, Support Vector Regression (SVR) and Random Forest Regression (RFR) and two DL network architectures with different depth and complexities, Multi-Layer Perceptron (MLP) and Convolutional Neural Network (CNN) to predict the S2 NDVI and SAVI maps from the S3 spectral bands information. A paired S2/S3 dataset is prepared for the study area covering one S2 tile in Extremadura, Spain. The results demonstrate that all the DL architectures except pixel-wise MLP outperformed the ML models with the 3D CNN performing the best. The best performing 3D CNN architecture obtained remarkable mean squared error (MSE) of 0.00198 for NDVI and 0.00282 for SAVI while the best performing ML algorithms were patch-wise RFR with MSE of 0.0035 in case of NDVI and patchwise SVR with MSE of 0.00586 for SAVI. The models and the dataset prepared for this study will be useful for further research that focus on capitalizing the free and open availability of Sentinel-2 and Sentinel-3 imagery as well as new and advanced technologies to provide better vegetation monitoring capabilities for our planet
Parallel Multistage Wide Neural Network
Deep learning networks have achieved great success in many areas such as in large scale image processing. They usually need large computing resources and time, and process easy and hard samples inefficiently in the same way. Another undesirable problem is that the network generally needs to be retrained to learn new incoming data. Efforts have been made to reduce the computing resources and realize incremental learning by adjusting architectures, such as scalable effort classifiers, multi-grained cascade forest (gc forest), conditional deep learning (CDL), tree CNN, decision tree structure with knowledge transfer (ERDK), forest of decision trees with RBF networks and knowledge transfer (FDRK). In this paper, a parallel multistage wide neural network (PMWNN) is presented. It is composed of multiple stages to classify different parts of data. First, a wide radial basis function (WRBF) network is designed to learn features efficiently in the wide direction. It can work on both vector and image instances, and be trained fast in one epoch using subsampling and least squares (LS). Secondly, successive stages of WRBF networks are combined to make up the PMWNN. Each stage focuses on the misclassified samples of the previous stage. It can stop growing at an early stage, and a stage can be added incrementally when new training data is acquired. Finally, the stages of the PMWNN can be tested in parallel, thus speeding up the testing process. To sum up, the proposed PMWNN network has the advantages of (1) fast training, (2) optimized computing resources, (3) incremental learning, and (4) parallel testing with stages. The experimental results with the MNIST, a number of large hyperspectral remote sensing data, CVL single digits, SVHN datasets, and audio signal datasets show that the WRBF and PMWNN have the competitive accuracy compared to learning models such as stacked auto encoders, deep belief nets, SVM, MLP, LeNet-5, RBF network, recently proposed CDL, broad learning, gc forest etc. In fact, the PMWNN has often the best classification performance
- …