139 results on '"Magli, Enrico"'
Search Results
2. Deep learning based prediction of traffic peaks in mobile networks
- Author
-
Li, Shuyang, Magli, Enrico, Francini, Gianluca, and Ghinamo, Giorgio
- Published
- 2024
- Full Text
- View/download PDF
3. Temporal dynamics clustering for analyzing cell behavior in mobile networks
- Author
-
Li, Shuyang, Francini, Gianluca, and Magli, Enrico
- Published
- 2023
- Full Text
- View/download PDF
4. Exploiting color for graph-based 3D point cloud denoising
- Author
-
Irfan, Muhammad Abeer and Magli, Enrico
- Published
- 2021
- Full Text
- View/download PDF
5. Cancelable templates for secure face verification based on deep learning and random projections.
- Author
-
Ali, Arslan, Migliorati, Andrea, Bianchi, Tiziano, and Magli, Enrico
- Subjects
DEEP learning ,RANDOM matrices ,HUMAN fingerprints ,DATA protection ,DESIGN templates ,BIOMETRIC identification ,BIOMETRY - Abstract
Recently, biometric recognition has become a significant field of research. The concept of cancelable biometrics (CB) has been introduced to address security concerns related to the handling of sensitive data. In this paper, we address unconstrained face verification by proposing a deep cancelable framework called BiometricNet+ that employs random projections (RP) to conceal face images and compressive sensing (CS) to reconstruct measurements in the original domain. Our lightweight design enforces the properties of unlinkability, revocability, and non-invertibility of the templates while preserving face recognition accuracy. We compare facial features by learning a regularized metric: at training time, we jointly learn facial features and the metric such that matching and non-matching pairs are mapped onto latent target distributions; then, for biometric verification, features are randomly projected via random matrices changed at every enrollment and query and reconstructed before the latent space mapping is computed. We assess the face recognition accuracy of our framework on challenging datasets such as LFW, CALFW, CPLFW, AgeDB, YTF, CFP, and RFW, showing notable improvements over state-of-the-art techniques while meeting the criteria for secure cancelable template design. Since our method requires no fine-tuning of the learned features, it can be applied to pre-trained networks to increase sensitive data protection. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
6. Robust license plate recognition using neural networks trained on synthetic images
- Author
-
Björklund, Tomas, Fiandrotti, Attilio, Annarumma, Mauro, Francini, Gianluca, and Magli, Enrico
- Published
- 2019
- Full Text
- View/download PDF
7. Vehicle joint make and model recognition with multiscale attention windows
- Author
-
Ghassemi, Sina, Fiandrotti, Attilio, Caimotti, Emanuele, Francini, Gianluca, and Magli, Enrico
- Published
- 2019
- Full Text
- View/download PDF
8. Network Coding Meets Multimedia: A Review
- Author
-
Magli, Enrico, Wang, Mea, Frossard, Pascal, and Markopoulou, Athina
- Subjects
Distributed media systems ,error resilience ,multimedia communications ,network coding ,peer-to-peer ,video streaming ,wireless media ,cs.MM ,cs.NI ,Information and Computing Sciences ,Engineering ,Artificial Intelligence & Image Processing - Abstract
While every network node only relays messages in a traditional communication system, the recent network coding (NC) paradigm proposes to implement simple in-network processing with packet combinations in the nodes. NC extends the concept of "encoding" a message beyond source coding (for compression) and channel coding (for protection against errors and losses). It has been shown to increase network throughput compared to traditional networks implementation, to reduce delay and to provide robustness to transmission errors and network dynamics. These features are so appealing for multimedia applications that they have spurred a large research effort towards the development of multimedia-specific NC techniques. This paper reviews the recent work in NC for multimedia applications and focuses on the techniques that fill the gap between NC theory and practical applications. It outlines the benefits of NC and presents the open challenges in this area. The paper initially focuses on multimedia-specific aspects of network coding, in particular delay, in-network error control, and media-specific error control. These aspects permit to handle varying network conditions as well as client heterogeneity, which are critical to the design and deployment of multimedia systems. After introducing these general concepts, the paper reviews in detail two applications that lend themselves naturally to NC via the cooperation and broadcast models, namely peer-to-peer multimedia streaming and wireless networking. © 1999-2012 IEEE.
- Published
- 2013
9. Sparsity estimation from compressive projections via sparse random matrices
- Author
-
Ravazzi, Chiara, Fosson, Sophie, Bianchi, Tiziano, and Magli, Enrico
- Published
- 2018
- Full Text
- View/download PDF
10. Improved iterative shrinkage-thresholding for sparse signal recovery via Laplace mixtures models
- Author
-
Ravazzi, Chiara and Magli, Enrico
- Published
- 2018
- Full Text
- View/download PDF
11. Block-sparsity-based localization in wireless sensor networks
- Author
-
Bay, Alessandro, Carrera, Diego, Fosson, Sophie M., Fragneto, Pasqualina, Grella, Marco, Ravazzi, Chiara, and Magli, Enrico
- Published
- 2015
- Full Text
- View/download PDF
12. Compressive Sensing Imaging Spectrometer for UV-Vis Stellar Spectroscopy: Instrumental Concept and Performance Analysis.
- Author
-
Nardino, Vanni, Guzzi, Donatella, Lastri, Cinzia, Palombi, Lorenzo, Coluccia, Giulio, Magli, Enrico, Labate, Demetrio, and Raimondi, Valentina
- Subjects
ULTRAVIOLET-visible spectroscopy ,SPECTROMETERS ,MEDICAL microscopy ,SPATIAL light modulators - Abstract
Compressive sensing (CS) has been proposed as a disruptive approach to developing a novel class of optical instrumentation used in diverse application domains. Thanks to sparsity as an inherent feature of many natural signals, CS allows for the acquisition of the signal in a very compact way, merging acquisition and compression in a single step and, furthermore, offering the capability of using a limited number of detector elements to obtain a reconstructed image with a larger number of pixels. Although the CS paradigm has already been applied in several application domains, from medical diagnostics to microscopy, studies related to space applications are very limited. In this paper, we present and discuss the instrumental concept, optical design, and performances of a CS imaging spectrometer for ultraviolet-visible (UV–Vis) stellar spectroscopy. The instrument—which is pixel-limited in the entire 300 nm–650 nm spectral range—features spectral sampling that ranges from 2.2 nm@300 nm to 22 nm@650 nm, with a total of 50 samples for each spectrum. For data reconstruction quality, the results showed good performance, measured by several quality metrics chosen from those recommended by CCSDS. The designed instrument can achieve compression ratios of 20 or higher without a significant loss of information. A pros and cons analysis of the CS approach is finally carried out, highlighting main differences with respect to a traditional system. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
13. Transparent encryption techniques for H.264/AVC and H.264/SVC compressed video
- Author
-
Magli, Enrico, Grangetto, Marco, and Olmo, Gabriella
- Published
- 2011
- Full Text
- View/download PDF
14. Distributed arithmetic coding for the slepian-wolf probelm
- Author
-
Grangetto, Marco, Magli, Enrico, and Olmo, Gabriella
- Subjects
Arithmetic functions -- Usage ,Distributed processing (Computers) -- Analysis ,Entropy (Information theory) -- Analysis ,Signal processing -- Research ,Distributed processing (Computers) ,Digital signal processor ,Business ,Computers ,Electronics ,Electronics and electrical industries - Published
- 2009
15. Multiband lossless compression of hyperspectral images
- Author
-
Magli, Enrico
- Subjects
Data compression -- Analysis ,Image processing -- Analysis ,Kalman filtering -- Analysis ,Business ,Earth sciences ,Electronics and electrical industries - Abstract
Hyperspectral images exhibit significant spectral correlation, whose exploitation is crucial for compression. In this paper, we investigate the problem of predicting a given band of a hyperspectral image using more than one previous band. We present an information-theoretic analysis based on the concept of conditional entropy, which is used to assess the available amount of correlation and the potential compression gain. Then, we propose a new lossless compression algorithm that employs a Kalman filter in the prediction stage. Simulation results are presented on Airborne Visible Infrared Imaging Spectrometer, Hyperspectral Digital Imagery Collection Experiment, and Hyperspectrai Mapper scenes, showing competitive performance with other state-of-the-art compression algorithms. Index Terms--Conditional entropy, hyperspectral data, Kalman filter, lossless compression, 3-D prediction.
- Published
- 2009
16. Joint Source, Channel Coding, and Secrecy
- Author
-
Magli, Enrico, Grangetto, Marco, and Olmo, Gabriella
- Published
- 2007
- Full Text
- View/download PDF
17. Transform coding techniques for lossy hyperspectral data compression
- Author
-
Penna, Barbara, Tillo, Tammam, Magli, Enrico, and Olmo, Gabriella
- Subjects
Wavelet transforms -- Analysis ,Business ,Earth sciences ,Electronics and electrical industries - Abstract
Transform-based lossy compression has a huge potential for hyperspectral data reduction. Hyperspectral data are 3-D, and the nature of their correlation is different in each dimension. This calls for a careful design of the 3-D transform to be used for compression. In this paper, we investigate the transform design and rate allocation stage for lossy compression of hyperspectral data. First, we select a set of 3-D transforms, obtained by combining in various ways wavelets, wavelet packets, the discrete cosine transform, and the Karhunen-Loeve transform (KLT), and evaluate the coding efficiency of these combinations. Second, we propose a low-complexity version of the KLT, in which complexity and performance can be balanced in a scalable way, allowing one to design the transform that better matches a specific application. Third, we integrate this, as well as other existing transforms, in the framework of Part 2 of the Joint Photographic Experts Group (JPEG) 2000 standard, taking advantage of the high coding efficiency of JPEG 2000, and exploiting the interoperability of an international standard. We introduce an evaluation framework based on both reconstruction fidelity and impact on image exploitation, and evaluate the proposed algorithm by applying this framework to AVIRIS scenes. It is shown that the scheme based on the proposed low-complexity KLT significantly outperforms previous schemes as to rate-distortion performance. As for impact on exploitation, we consider multiclass hard classification, spectral unmixing, binary classification, and anomaly detection as benchmark applications. Index Terms--Anomaly detection, classification, discrete cosine transform (DCT), hyperspectral data, Joint Photographic Experts Group (JPEG) 2000, Karhunen-Loeve transform (KLT), lossy compression, spectral unmixing, wavelets.
- Published
- 2007
18. A syntax-preserving error resilience tool for JPEG 2000 based on error correcting arithmetic coding
- Author
-
Grangetto, Marco, Magli, Enrico, and Olmo, Gabriella
- Subjects
Image coding -- Standards ,Mobile communication systems -- Standards ,Wireless communication systems -- Standards ,Wireless technology ,Business ,Computers ,Electronics ,Electronics and electrical industries - Abstract
A novel error-resilience tool for JPEG 2000 is proposed, based on the concept of ternary arithmetic coders employing a forbidden symbol. The proposed decoder extends the JPEG 2000 capabilities in error-prone scenarios, without violating the standard syntax, and extensive simulations on video sequences show that the proposed decoders largely outperform the standard in terms of PSNR and visual quality.
- Published
- 2006
19. Analysis of SparseHash: An efficient embedding of set-similarity via sparse projections
- Author
-
Valsesia, Diego, Fosson, Sophie M., Ravazzi, Chiara, Bianchi, Tiziano, and Magli, Enrico
- Published
- 2019
- Full Text
- View/download PDF
20. Energy-Efficient Coding and Error Control for Wireless Video-Surveillance Networks
- Author
-
Chiasserini, Carla-Fabiana and Magli, Enrico
- Published
- 2004
- Full Text
- View/download PDF
21. Fast code-rate optimization for robust image transmission over lossy packet networks
- Author
-
Grangetto, Marco, Magli, Enrico, and Olmo, Gabriella
- Subjects
Algorithm ,Data communications -- Methods ,Coding theory -- Methods ,Algorithms - Abstract
In this paper, we propose an efficient method for the allocation of Reed-Solomon codes to source symbols, for unequal loss protection. The proposed formulation recasts the multivariate optimization problem into a univariate one, dramatically reducing the computational complexity. Results are shown for image transmission over lossy packet networks, employing the JPEG2000 and SPIHT encoders. The proposed algorithm exhibits performance equivalent to previous methods, while providing a significant complexity reduction. Index Terms--JPEG2000, multiple description coding, Reed-Solomon codes, SPIHT, unequal loss protection.
- Published
- 2005
22. Ensuring quality of service for image transmission: hybrid loss protection
- Author
-
Grangetto, Marco, Magli, Enrico, and Olmo, Gabriella
- Subjects
Image coding -- Analysis ,Image processing -- Analysis ,Quality of service ,Business ,Computers ,Electronics ,Electronics and electrical industries - Abstract
Hybrid loss protection as a new channel of coding and packetization scheme for image transmission over nonprioritized lossy packet network is presented. A new code-allocation algorithm is proposed and the results are provided in the case of transmission of imagesencoded by SPIHT and JPEG 2000 over a wireline, as well as a wireless UMTS-based internet connection.
- Published
- 2004
23. Lossy predictive coding of SAR raw data
- Author
-
Magli, Enrico and Olmo, Gabriella
- Subjects
Synthetic aperture radar -- Research ,Business ,Earth sciences ,Electronics and electrical industries - Abstract
In this paper, we propose to employ predictive coding for lossy compression of synthetic aperture radar (SAR) raw data. We exploit the known result that a blockwise normalized SAR raw signal is a Gaussian stationary process in order to design an optimal decorrelator for this signal. We show that, due to the statistical properties of the SAR signal, an along-range linear predictor with few taps is able to effectively capture most of the raw signal correlation. The proposed predictive coding algorithm, which performs quantization of the prediction error, optionally followed by entropy coding, exhibits a number of advantages, and notably an interesting performance/complexity trade-off, with respect to other techniques such as flexible block adaptive quantization (FBAQ) or methods based on transform-coding; fractional output bit-rates can also be achieved in the entropy-constrained mode. Simulation results on real-world SIR-C/X-SAR as well as simulated raw and image data show that the proposed algorithm outperforms FBAQ as to SNR, at a computational cost compatible with modern SAR systems. Index Terms--Differential pulse code modulation (DPCM), entropy coding, entropy-constrained quantization, predictive coding, synthetic aperture radar (SAR) raw data compression.
- Published
- 2003
24. Speckle2Void: Deep Self-Supervised SAR Despeckling With Blind-Spot Convolutional Neural Networks.
- Author
-
Molini, Andrea Bordone, Valsesia, Diego, Fracastoro, Giulia, and Magli, Enrico
- Subjects
CONVOLUTIONAL neural networks ,SYNTHETIC aperture radar ,SPECKLE interference ,DEEP learning ,DATA mining ,SELF-efficacy - Abstract
Information extraction from synthetic aperture radar (SAR) images is heavily impaired by speckle noise, and hence, despeckling is a crucial preliminary step in scene analysis algorithms. The recent success of deep learning envisions a new generation of despeckling techniques that could outperform classical model-based methods. However, current deep learning approaches to despeckling require supervision for training, whereas clean SAR images are impossible to obtain. In the literature, this issue is tackled by resorting to either synthetically speckled optical images, which exhibit different properties with respect to true SAR images, or multitemporal SAR images, which are difficult to acquire or fuse accurately. In this article, inspired by recent works on blind-spot denoising networks, we propose a self-supervised Bayesian despeckling method. The proposed method is trained by employing only noisy SAR images and can, therefore, learn features of real SAR images rather than synthetic data. Experiments show that the performance of the proposed approach is very close to the supervised training approach on synthetic data and superior on real data in both quantitative and visual assessments. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
25. Compressive Bayesian K-SVD
- Author
-
Testa, Matteo and Magli, Enrico
- Published
- 2018
- Full Text
- View/download PDF
26. MAP harmonic retrieval in Gaussian colored noise with prior information
- Author
-
Magli, Enrico and Olmo, Gabriella
- Published
- 2003
- Full Text
- View/download PDF
27. Wavelet Kernels on a DSP: A Comparison between Lifting and Filter Banks for Image Coding
- Author
-
Gnavi, Stefano, Penna, Barbara, Grangetto, Marco, Magli, Enrico, and Olmo, Gabriella
- Published
- 2002
- Full Text
- View/download PDF
28. Learning Robust Graph-Convolutional Representations for Point Cloud Denoising.
- Author
-
Pistilli, Francesca, Fracastoro, Giulia, Valsesia, Diego, and Magli, Enrico
- Abstract
Point clouds are an increasingly relevant geometric data type but they are often corrupted by noise and affected by the presence of outliers. We propose a deep learning method that can simultaneously denoise a point cloud and remove outliers in a single model. The core of the proposed method is a graph-convolutional neural network able to efficiently deal with the irregular domain and the permutation invariance problem typical of point clouds. The network is fully-convolutional and can build complex hierarchies of features by dynamically constructing neighborhood graphs from similarity among the high-dimensional feature representations of the points. The proposed approach outperforms state-of-the-art denoising methods showing robust performance in the challenging setup of high noise levels and in presence of structured noise. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
29. Distributed Source Coding Techniques for Lossless Compression of Hyperspectral Images
- Author
-
Barni Mauro, Abrardo Andrea, Magli Enrico, and Grangetto Marco
- Subjects
Telecommunication ,TK5101-6720 ,Electronics ,TK7800-8360 - Abstract
This paper deals with the application of distributed source coding (DSC) theory to remote sensing image compression. Although DSC exhibits a significant potential in many application fields, up till now the results obtained on real signals fall short of the theoretical bounds, and often impose additional system-level constraints. The objective of this paper is to assess the potential of DSC for lossless image compression carried out onboard a remote platform. We first provide a brief overview of DSC of correlated information sources. We then focus on onboard lossless image compression, and apply DSC techniques in order to reduce the complexity of the onboard encoder, at the expense of the decoder's, by exploiting the correlation of different bands of a hyperspectral dataset. Specifically, we propose two different compression schemes, one based on powerful binary error-correcting codes employed as source codes, and one based on simpler multilevel coset codes. The performance of both schemes is evaluated on a few AVIRIS scenes, and is compared with other state-of-the-art 2D and 3D coders. Both schemes turn out to achieve competitive compression performance, and one of them also has reduced complexity. Based on these results, we highlight the main issues that are still to be solved to further improve the performance of DSC-based remote sensing systems.
- Published
- 2007
30. Efficient common-core lossless and lossy image coder based on integer wavelets
- Author
-
Grangetto, Marco, Magli, Enrico, and Olmo, Gabriella
- Published
- 2001
- Full Text
- View/download PDF
31. Metis: the Solar Orbiter visible light and ultraviolet coronal imager.
- Author
-
Antonucci, Ester, Romoli, Marco, Andretta, Vincenzo, Fineschi, Silvano, Heinzel, Petr, Moses, J. Daniel, Naletto, Giampiero, Nicolini, Gianalfredo, Spadaro, Daniele, Teriaca, Luca, Berlicki, Arkadiusz, Capobianco, Gerardo, Crescenzio, Giuseppe, Da Deppo, Vania, Focardi, Mauro, Frassetto, Fabio, Heerlein, Klaus, Landini, Federico, Magli, Enrico, and Marco Malvezzi, Andrea
- Subjects
SOLAR wind ,SOLAR corona ,ULTRAVIOLET radiation ,VISIBLE spectra ,SOLAR energetic particles ,CORONAL mass ejections ,SOLAR atmosphere ,ROTATION of the Sun - Abstract
Aims. Metis is the first solar coronagraph designed for a space mission and is capable of performing simultaneous imaging of the off-limb solar corona in both visible and UV light. The observations obtained with Metis aboard the Solar Orbiter ESA-NASA observatory will enable us to diagnose, with unprecedented temporal coverage and spatial resolution, the structures and dynamics of the full corona in a square field of view (FoV) of ±2.9° in width, with an inner circular FoV at 1.6°, thus spanning the solar atmosphere from 1.7 R
⊙ to about 9 R⊙ , owing to the eccentricity of the spacecraft orbit. Due to the uniqueness of the Solar Orbiter mission profile, Metis will be able to observe the solar corona from a close (0.28 AU, at the closest perihelion) vantage point, achieving increasing out-of-ecliptic views with the increase of the orbit inclination over time. Moreover, observations near perihelion, during the phase of lower rotational velocity of the solar surface relative to the spacecraft, allow longer-term studies of the off-limb coronal features, thus finally disentangling their intrinsic evolution from effects due to solar rotation. Methods. Thanks to a novel occultation design and a combination of a UV interference coating of the mirrors and a spectral bandpass filter, Metis images the solar corona simultaneously in the visible light band, between 580 and 640 nm, and in the UV H I Lyman-α line at 121.6 nm. The visible light channel also includes a broadband polarimeter able to observe the linearly polarised component of the K corona. The coronal images in both the UV H I Lyman-α and polarised visible light are obtained at high spatial resolution with a spatial scale down to about 2000 km and 15 000 km at perihelion, in the cases of the visible and UV light, respectively. A temporal resolution down to 1 s can be achieved when observing coronal fluctuations in visible light. Results. The Metis measurements, obtained from different latitudes, will allow for complete characterisation of the main physical parameters and dynamics of the electron and neutral hydrogen/proton plasma components of the corona in the region where the solar wind undergoes the acceleration process and where the onset and initial propagation of coronal mass ejections (CMEs) take place. The near-Sun multi-wavelength coronal imaging performed with Metis, combined with the unique opportunities offered by the Solar Orbiter mission, can effectively address crucial issues of solar physics such as: the origin and heating/acceleration of the fast and slow solar wind streams; the origin, acceleration, and transport of the solar energetic particles; and the transient ejection of coronal mass and its evolution in the inner heliosphere, thus significantly improving our understanding of the region connecting the Sun to the heliosphere and of the processes generating and driving the solar wind and coronal mass ejections. Conclusions. This paper presents the scientific objectives and requirements, the overall optical design of the Metis instrument, the thermo-mechanical design, and the processing and power unit; reports on the results of the campaigns dedicated to integration, alignment, and tests, and to the characterisation of the instrument performance; describes the operation concept, data handling, and software tools; and, finally, the diagnostic techniques to be applied to the data, as well as a brief description of the expected scientific products. The performance of the instrument measured during calibrations ensures that the scientific objectives of Metis can be pursued with success. [ABSTRACT FROM AUTHOR]- Published
- 2020
- Full Text
- View/download PDF
32. The Interplay between Compression and Security for Image and Video Communication and Adaptation over Networks
- Author
-
Magli, Enrico and Sun, Qibin
- Published
- 2008
- Full Text
- View/download PDF
33. Deep Graph-Convolutional Image Denoising.
- Author
-
Valsesia, Diego, Fracastoro, Giulia, and Magli, Enrico
- Subjects
IMAGE denoising ,CONVOLUTIONAL neural networks ,RANDOM noise theory - Abstract
Non-local self-similarity is well-known to be an effective prior for the image denoising problem. However, little work has been done to incorporate it in convolutional neural networks, which surpass non-local model-based methods despite only exploiting local information. In this paper, we propose a novel end-to-end trainable neural network architecture employing layers based on graph convolution operations, thereby creating neurons with non-local receptive fields. The graph convolution operation generalizes the classic convolution to arbitrary graphs. In this work, the graph is dynamically computed from similarities among the hidden features of the network, so that the powerful representation learning capabilities of the network are exploited to uncover self-similar patterns. We introduce a lightweight Edge-Conditioned Convolution which addresses vanishing gradient and over-parameterization issues of this particular graph convolution. Extensive experiments show state-of-the-art performance with improved qualitative and quantitative results on both synthetic Gaussian noise and real noise. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
34. DeepSUM: Deep Neural Network for Super-Resolution of Unregistered Multitemporal Images.
- Author
-
Bordone Molini, Andrea, Valsesia, Diego, Fracastoro, Giulia, and Magli, Enrico
- Subjects
CONVOLUTIONAL neural networks ,DEEP learning ,REMOTE sensing - Abstract
Recently, convolutional neural networks (CNNs) have been successfully applied to many remote sensing problems. However, deep learning techniques for multi-image super-resolution (SR) from multitemporal unregistered imagery have received little attention so far. This article proposes a novel CNN-based technique that exploits both spatial and temporal correlations to combine multiple images. This novel framework integrates the spatial registration task directly inside the CNN, and allows one to exploit the representation learning capabilities of the network to enhance registration accuracy. The entire SR process relies on a single CNN with three main stages: shared 2-D convolutions to extract high-dimensional features from the input images; a subnetwork proposing registration filters derived from the high-dimensional feature representations; 3-D convolutions for slow fusion of the features from multiple images. The whole network can be trained end-to-end to recover a single high-resolution image from multiple unregistered low-resolution images. The method presented in this article is the winner of the PROBA-V SR challenge issued by the European Space Agency (ESA). [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
35. Secrecy Analysis of Finite-Precision Compressive Cryptosystems.
- Author
-
Testa, Matteo, Bianchi, Tiziano, and Magli, Enrico
- Abstract
Compressed sensing (CS) has recently emerged as an effective and efficient way to encrypt data. Under certain conditions, it has been shown to provide some secrecy notions. In theory, it could be considered to be a perfect match for constrained devices needing to acquire and protect the data with computationally cheap operations. However, the theoretical results on the secrecy of compressive cryptosystems only hold under the assumption of infinite precision representation. With this work, we aim to close this gap and lay the theoretical foundations to support this practical framework. We provide theoretical upper bounds on the distinguishability of the measurements acquired through finite precision sensing matrices and experimentally validate them. Our main result is that the secrecy of a CS cryptosystem can be exponentially increased with a linear increase in the representation precision. This result confirms that the CS can be an effective secrecy layer and provides tools to use it in practical settings. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
36. High-Throughput Onboard Hyperspectral Image Compression With Ground-Based CNN Reconstruction.
- Author
-
Valsesia, Diego and Magli, Enrico
- Subjects
- *
VIDEO coding , *ARTIFICIAL neural networks , *IMAGE compression , *OPTICAL instruments , *OPTICAL resolution , *BIT rate , *CONVOLUTIONAL neural networks - Abstract
Compression of hyperspectral images onboard of spacecrafts is a tradeoff between the limited computational resources and the ever-growing spatial and spectral resolution of the optical instruments. As such, it requires low-complexity algorithms with good rate-distortion performance and high throughput. In recent years, the Consultative Committee for Space Data Systems (CCSDS) has focused on lossless and near-lossless compression approaches based on predictive coding, resulting in the recently published CCSDS 123.0-B-2 recommended standard. While the in-loop reconstruction of quantized prediction residuals provides excellent rate-distortion performance for the near-lossless operating mode, it significantly constrains the achievable throughput due to data dependencies. In this paper, we study the performance of a faster method based on the prequantization of the image followed by a lossless predictive compressor. While this is well known to be suboptimal, one can exploit powerful signal models to reconstruct the image at the ground segment, recovering part of the suboptimality. In particular, we show that convolutional neural networks can be used for this task and that they can recover the whole SNR drop incurred at a bit rate of 2 bits per pixel. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
37. Learning and Adapting Robust Features for Satellite Image Segmentation on Heterogeneous Data Sets.
- Author
-
Ghassemi, Sina, Fiandrotti, Attilio, Francini, Gianluca, and Magli, Enrico
- Subjects
REMOTE-sensing images ,IMAGE segmentation ,NETWORK performance ,VISUAL learning ,ARTIFICIAL neural networks - Abstract
This paper addresses the problem of training a deep neural network for satellite image segmentation so that it can be deployed over images whose statistics differ from those used for training. For example, in postdisaster damage assessment, the tight time constraints make it impractical to train a network from scratch for each image to be segmented. We propose a convolutional encoder–decoder network able to learn visual representations of increasing semantic level as its depth increases, allowing it to generalize over a wider range of satellite images. Then, we propose two additional methods to improve the network performance over each specific image to be segmented. First, we observe that updating the batch normalization layers’ statistics over the target image improves the network performance without human intervention. Second, we show that refining a trained network over a few samples of the image boosts the network performance with minimal human intervention. We evaluate our architecture over three data sets of satellite images, showing the state-of-the-art performance in binary segmentation of previously unseen images and competitive performance with respect to more complex techniques in a multiclass segmentation task. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
38. ToothPic: Camera-Based Image Retrieval on Large Scales.
- Author
-
Valsesia, Diego, Coluccia, Giulio, Bianchi, Tiziano, and Magli, Enrico
- Subjects
IMAGE retrieval ,LEGAL evidence - Abstract
Being able to reliably link a picture to the device that shot it is of paramount importance to give credit or assign responsibility to the author of the picture itself. However, this task needs to be performed at large scales due to the recent explosion in the number of photos taken and shared. Existing methods cannot satisfy those requirements. Methods based on the photo response nonuniformity (PRNU) of digital sensors are able to link a photo to the device that shot it and have already been used as proof in the Court of Law. Such methods are reliable but so far, they can be only used for small-scale forensic tasks involving few cameras and pictures. ToothPic, an acronym for "Who Took This Picture?," is a novel image retrieval engine that allows to find all the pictures in a large-scale database shot by a given query camera. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
39. Graph Spectral Image Processing.
- Author
-
Cheung, Gene, Magli, Enrico, Tanaka, Yuichi, and Ng, Michael K.
- Subjects
BRAIN mapping ,BRAIN imaging ,WIRELESS sensor networks ,BODY sensor networks ,IMAGE compression - Abstract
Recent advent of graph signal processing (GSP) has spurred intensive studies of signals that live naturally on irregular data kernels described by graphs (e.g., social networks, wireless sensor networks). Though a digital image contains pixels that reside on a regularly sampled 2-D grid, if one can design an appropriate underlying graph connecting pixels with weights that reflect the image structure, then one can interpret the image (or image patch) as a signal on a graph, and apply GSP tools for processing and analysis of the signal in graph spectral domain. In this paper, we overview recent graph spectral techniques in GSP specifically for image/video processing. The topics covered include image compression, image restoration, image filtering, and image segmentation. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
40. GPU-accelerated algorithms for compressed signals recovery with application to astronomical imagery deblurring.
- Author
-
Fiandrotti, Attilio, Fosson, Sophie M, Ravazzi, Chiara, and Magli, Enrico
- Subjects
GRAPHICS processing units ,COMPUTER algorithms ,ASTRONOMICAL image processing ,REMOTE sensing ,SIGNAL processing - Abstract
Compressive sensing promises to enable bandwidth-efficient on-board compression of astronomical data by lifting the encoding complexity from the source to the receiver. The signal is recovered off-line, exploiting graphical processing unit (GPU)’s parallel computation capabilities to speedup the reconstruction process. However, inherent GPU hardware constraints limit the size of the recoverable signal and the speedup practically achievable. In this work, we design parallel algorithms that exploit the properties of circulant matrices for efficient GPU-accelerated sparse signals recovery. Our approach reduces the memory requirements, allowing us to recover very large signals with limited memory. In addition, it achieves a 10-fold signal recovery speedup, thanks to ad-hoc parallelization of matrix–vector multiplications and matrix inversions. Finally, we practically demonstrate our algorithms in a typical application of circulant matrices: deblurring a sparse astronomical image in the compressed domain. [ABSTRACT FROM PUBLISHER]
- Published
- 2018
- Full Text
- View/download PDF
41. Curl-Constrained Gradient Estimation for Image Recovery From Highly Incomplete Spectral Data.
- Author
-
Ravazzi, Chiara, Coluccia, Giulio, and Magli, Enrico
- Subjects
MISSING data (Statistics) ,ESTIMATION theory ,FOURIER transforms ,IMAGE reconstruction ,COMPRESSED sensing - Abstract
In this paper, we introduce new gradient-based methods for image recovery from a small collection of spectral coefficients of the Fourier transform, which is of particular interest for several scanning technologies, such as magnetic resonance imaging. Since gradients of a medical image are much more sparse or compressible than the corresponding image, classical \ell 1 -minimization methods have been used to recover these relative differences. The image values can then be obtained by integration algorithms imposing boundary constraints. Compared with classical gradient recovery methods, we propose two new techniques that improve reconstruction. First, we cast the gradient recovery problem as a compressed sensing problem taking into account that the curl of the gradient field should be zero. Second, inspired by the emerging field of signal processing on graphs, we formulate the gradient recovery problem as an inverse problem on graphs. Iteratively reweighted \ell 1 recovery methods are proposed to recover these relative differences and the structure of the similarity graph. Once the gradient field is estimated, the image is recovered from the compressed Fourier measurements using least squares estimation. Numerical experiments show that the proposed approach outperforms the state-of-the-art image recovery methods. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
42. Fast and Lightweight Rate Control for Onboard Predictive Coding of Hyperspectral Images.
- Author
-
Valsesia, Diego and Magli, Enrico
- Abstract
Predictive coding is attractive for compression of hyperspectral images onboard of spacecrafts in light of the excellent rate-distortion performance and low complexity of recent schemes. In this letter, we propose a rate control algorithm and integrate it in a lossy extension to the CCSDS-123 lossless compression recommendation. The proposed rate algorithm overhauls our previous scheme by being orders of magnitude faster and simpler to implement, while still providing the same accuracy in terms of output rate and comparable or better image quality. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
43. Constant SNR, Rate Control, and Entropy Coding for Predictive Lossy Hyperspectral Image Compression.
- Author
-
Conoscenti, Marco, Coppola, Riccardo, and Magli, Enrico
- Subjects
HYPERSPECTRAL imaging systems ,LOSSY data compression ,LINEAR predictive coding ,MULTISPECTRAL imaging ,IMAGE compression - Abstract
Predictive lossy compression has been shown to represent a very flexible framework for lossless and lossy onboard compression of multispectral and hyperspectral images with quality and rate control. In this paper, we improve predictive lossy compression in several ways, using a standard issued by the Consultative Committee on Space Data Systems, namely CCSDS-123, as an example of application. First, exploiting the flexibility in the error control process, we propose a constant-signal-to-noise-ratio algorithm that bounds the maximum relative error between each pixel of the reconstructed image and the corresponding pixel of the original image. This is very useful to avoid low-energy areas of the image being affected by large errors. Second, we propose a new rate control algorithm that has very low complexity and provides performance equal to or better than existing work. Third, we investigate several entropy coding schemes that can speed up the hardware implementation of the algorithm and, at the same time, improve coding efficiency. These advances make predictive lossy compression an extremely appealing framework for onboard systems due to its simplicity, flexibility, and coding efficiency. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
44. Compressive Estimation and Imaging Based on Autoregressive Models.
- Author
-
Testa, Matteo and Magli, Enrico
- Subjects
- *
COMPRESSED sensing , *IMAGE compression , *AUTOREGRESSIVE models , *SIGNAL processing , *IMAGE reconstruction - Abstract
Compressed sensing (CS) is a fast and efficient way to obtain compact signal representations. Oftentimes, one wishes to extract some information from the available compressed signal. Since CS signal recovery is typically expensive from a computational point of view, it is inconvenient to first recover the signal and then extract the information. A much more effective approach consists in estimating the information directly from the signal’s linear measurements. In this paper, we propose a novel framework for compressive estimation of autoregressive (AR) process parameters based on $ad~hoc$ sensing matrix construction. More in detail, we introduce a compressive least square estimator for AR(p) parameters and a specific AR(1) compressive Bayesian estimator. We exploit the proposed techniques to address two important practical problems. The first is compressive covariance estimation for Toeplitz structured covariance matrices where we tackle the problem with a novel parametric approach based on the estimated AR parameters. The second is a block-based compressive imaging system, where we introduce an algorithm that adaptively calculates the number of measurements to be acquired for each block from a set of initial measurements based on its degree of compressibility. We show that the proposed techniques outperform the state-of-the-art methods for these two problems. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
45. Distributed Recovery of Jointly Sparse Signals Under Communication Constraints.
- Author
-
Fosson, Sophie M., Matamoros, Javier, Antoan-Haro, Carles, and Magli, Enrico
- Subjects
TELECOMMUNICATION systems ,SIGNALS & signaling ,GREEDY algorithms ,THRESHOLDING algorithms ,CONVERGENCE (Telecommunication) - Abstract
The problem of the distributed recovery of jointly sparse signals has attracted much attention recently. Let us assume that the nodes of a network observe different sparse signals with common support; starting from linear, compressed measurements, and exploiting network communication, each node aims at reconstructing the support and the non-zero values of its observed signal. In the literature, distributed greedy algorithms have been proposed to tackle this problem, among which the most reliable ones require a large amount of transmitted data, which barely adapts to realistic network communication constraints. In this paper, we address the problem through a reweighted \ell 1 soft thresholding technique, in which the threshold is iteratively tuned based on the current estimate of the support. The proposed method adapts to constrained networks, as it requires only local communication among neighbors, and the transmitted messages are indices from a finite set. We analytically prove the convergence of the proposed algorithm and we show that it outperforms the state-of-the-art greedy methods in terms of balance between recovery accuracy and communication load. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
46. Voyager 2 solar plasma and magnetic field spectral analysis for intermediate data sparsity.
- Author
-
Gallana, Luca, Fraternale, Federico, Iovieno, Michele, Fosson, Sophie M., Magli, Enrico, Opher, Merav, Richardson, John D., and Tordella, Daniela
- Published
- 2016
- Full Text
- View/download PDF
47. Randomized Algorithms for Distributed Nonlinear Optimization Under Sparsity Constraints.
- Author
-
Ravazzi, Chiara, Fosson, Sophie M., and Magli, Enrico
- Subjects
ALGORITHM research ,NONLINEAR analysis ,MATHEMATICAL optimization ,COMMUNICATIONS research ,DIFFERENTIAL signal detection - Abstract
Distributed optimization in multi-agent systems under sparsity constraints has recently received a lot of attention. In this paper, we consider the in-network minimization of a continuously differentiable nonlinear function which is a combination of local agent objective functions subject to sparsity constraints on the variables. A crucial issue of in-network optimization is the handling of the communications, which may be expensive. This calls for efficient algorithms, that are able to reduce the number of required communication links and transmitted messages. To this end, we focus on asynchronous and randomized distributed techniques. Based on consensus techniques and iterative hard thresholding methods, we propose three methods that attempt to minimize the given function, promoting sparsity of the solution: asynchronous hard thresholding (AHT), broadcast hard thresholding (BHT), and gossip hard thresholding (GHT). Although similar in many aspects, it is difficult to obtain a unified analysis for the proposed algorithms. Specifically, we theoretically prove the convergence and characterize the limit points of AHT in regular networks under some proper assumptions on the functions to be minimized. For BHT and GHT, instead, we characterize the fixed points of the maps that rule their dynamics in terms of stationary points of original problem. Finally, we illustrate the implementation of our techniques in compressed sensing and present several numerical results on performance and number of transmissions required for convergence. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
48. Analysis of One-Time Random Projections for Privacy Preserving Compressed Sensing.
- Author
-
Bianchi, Tiziano, Bioglio, Valerio, and Magli, Enrico
- Abstract
In this paper, the security of the compressed sensing (CS) framework as a form of data confidentiality is analyzed. Two important properties of one-time random linear measurements acquired using a Gaussian independent identically distributed matrix are outlined: 1) the measurements reveal only the energy of the sensed signal and 2) only the energy of the measurements leaks information about the signal. An important consequence of the above facts is that CS provides information theoretic secrecy in a particular setting. Namely, a simple strategy based on the normalization of the Gaussian measurements achieves, at least in theory, perfect secrecy, enabling the use of CS as an additional security layer in privacy preserving applications. In the generic setting in which CS does not provide information theoretic secrecy, two alternative security notions linked to the difficulty of estimating the energy of the signal and distinguishing equal-energy signals are introduced. Useful bounds on the mean square error of any possible estimator and the probability of error of any possible detector are provided and compared with the simulations. The results indicate that CS is in general not secure according to cryptographic standards, but may provide a useful built-in data obfuscation layer. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
49. Large-Scale Image Retrieval Based on Compressed Camera Identification.
- Author
-
Valsesia, Diego, Coluccia, Giulio, Bianchi, Tiziano, and Magli, Enrico
- Abstract
Retrieving pictures from large collections according to a specific criterion is an increasingly relevant task. An important , but so far overlooked, such criterion is the retrieval of pictures acquired by a specific camera. Instead of relying on metadata , which can be absent or easily manipulated, a forensic tool is exploited, namely the photo response non-uniformity (PRNU) of the camera sensor. Recent works showed that random projections can be used to significantly compress the PRNU, enabling operation on very large scales, previously impossible due to the size of the PRNU and to the complexity of the matching operations. In this paper, we propose efficient techniques for management and retrieval of images employing the PRNU, and test them on a database of 1174 cameras and half a million pictures downloaded from the Internet. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
50. Graded Quantization for Multiple Description Coding of Compressive Measurements.
- Author
-
Valsesia, Diego, Coluccia, Giulio, and Magli, Enrico
- Subjects
SIGNAL quantization ,DECODING algorithms ,COMPRESSED sensing ,SENSOR networks ,ANALOG multipliers ,DATA packeting - Abstract
Compressed sensing (CS) is an emerging paradigm for acquisition of compressed representations of a sparse signal. Its low complexity is appealing for resource-constrained scenarios like sensor networks. However, such scenarios are often coupled with unreliable communication channels and providing robust transmission of the acquired data to a receiver is an issue. Multiple description coding (MDC) effectively combats channel losses for systems without feedback, thus raising the interest in developing MDC methods explicitly designed for the CS framework, and exploiting its properties. We propose a method called Graded Quantization (CS-GQ) that leverages the democratic property of compressive measurements to effectively implement MDC, and we provide methods to optimize its performance. A novel decoding algorithm based on the alternating directions method of multipliers is derived to reconstruct signals from a limited number of received descriptions. Simulations are performed to assess the performance of CS-GQ against other methods in presence of packet losses. The proposed method is successful at providing robust coding of CS measurements and outperforms other schemes for the considered test metrics. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.