Generalized Laplacian Pyramid Pan-Sharpening Gain Injection Prediction Based on CNN

2020 ◽  
Vol 17 (4) ◽  
pp. 651-655 ◽  
Author(s):  
Tayeb Benzenati ◽  
Yousri Kessentini ◽  
Abdelaziz Kallel ◽  
Hind Hallabia
2021 ◽  
Vol 13 (17) ◽  
pp. 3386
Author(s):  
Paolo Addesso ◽  
Rocco Restaino ◽  
Gemine Vivone

The spatial resolution of multispectral data can be synthetically improved by exploiting the spatial content of a companion panchromatic image. This process, named pansharpening, is widely employed by data providers to augment the quality of images made available for many applications. The huge demand requires the utilization of efficient fusion algorithms that do not require specific training phases, but rather exploit physical considerations to combine the available data. For this reason, classical model-based approaches are still widely used in practice. We created and assessed a method for improving a widespread approach, based on the generalized Laplacian pyramid decomposition, by combining two different cost-effective upgrades: the estimation of the detail-extraction filter from data and the utilization of an improved injection scheme based on multilinear regression. The proposed method was compared with several existing efficient pansharpening algorithms, employing the most credited performance evaluation protocols. The capability of achieving optimal results in very different scenarios was demonstrated by employing data acquired by the IKONOS and WorldView-3 satellites.


1992 ◽  
Vol 139 (5) ◽  
pp. 495 ◽  
Author(s):  
Q. Mongatti ◽  
L. Alparone ◽  
G. Benelli ◽  
S. Baronti ◽  
F. Lotti ◽  
...  

2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Nhat-Duc Hoang

To improve the efficiency of the periodic surveys of the asphalt pavement condition, this study puts forward an intelligent method for automating the classification of pavement crack patterns. The new approach relies on image processing techniques and computational intelligence algorithms. The image processing techniques of Laplacian pyramid and projection integral are employed to extract numerical features from digital images. Least squares support vector machine (LSSVM) and Differential Flower Pollination (DFP) are the two computational intelligence algorithms that are employed to construct the crack classification model based on the extracted features. LSSVM is employed for data classification. In addition, the model construction phase of LSSVM requires a proper setting of the regularization and kernel function parameters. This study relies on DFP to fine-tune these two parameters of LSSVM. A dataset consisting of 500 image samples and five class labels of alligator crack, diagonal crack, longitudinal crack, no crack, and transverse crack has been collected to train and verify the established approach. The experimental results show that the Laplacian pyramid is really helpful to enhance the pavement images and reveal the crack patterns. Moreover, the hybridization of LSSVM and DFP, named as DFP-LSSVM, used with the Laplacian pyramid at the level 4 can help us to achieve the highest classification accuracy rate of 93.04%. Thus, the new hybrid approach of DFP-LSSVM is a promising tool to assist transportation agencies in the task of pavement condition surveying.


2019 ◽  
Vol 3 (5) ◽  
pp. 557-564 ◽  
Author(s):  
Xiaoman Duan ◽  
Yuan Xu ◽  
Yingjie Mei ◽  
Shuyu Wu ◽  
Qingqing Ling ◽  
...  

Author(s):  
Vesa Mustonen ◽  
Matti Tienari

Let m: [ 0, ∞) → [ 0, ∞) be an increasing continuous function with m(t) = 0 if and only if t = 0, m(t) → ∞ as t → ∞ and Ω C ℝN a bounded domain. In this note we show that for every r > 0 there exists a function ur solving the minimization problemwhere Moreover, the function ur is a weak solution to the corresponding Euler–Lagrange equationfor some λ > 0. We emphasize that no Δ2-condition is needed for M or M; so the associated functionals are not continuously differentiable, in general.


Sign in / Sign up

Export Citation Format

Share Document