• Aucun résultat trouvé

Application de l’Algorithme K-S et de l’Ondelettediscrète au traitement d’images satellitaires

N/A
N/A
Info
Télécharger
Protected

Academic year: 2021

Partager "Application de l’Algorithme K-S et de l’Ondelettediscrète au traitement d’images satellitaires"

Copied!
1
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

Rachid AMRAOUI, 2015, «Application de l’Algorithme K-S et de l’Ondelette discrète au traitement d’images satellitaires», Mémoire de magister, Université Abdelhamid Ibn Badis de Mostaganem

Application de l’Algorithme K-S et de l’Ondelette discrète au traitement d’images satellitaires

Rachid AMRAOUI

Soutenue en: 2015

Abstract : This memory approaches the satellite image processing which become a discipline with share today. Its importance is particularly distinguished in case of the forest fires detection, however without doubt; one often faces serious difficulties mainly due to the size of the image, especially when its matrix is treatedin hole. To overcome these constraints, anhybrid line by line treatment method is suggested. The latteris based on the algorithm of Kolmogorov-Smirnov as well as the discrete wavelet, which allows obtaining a lossycompression relative to each line of the matrix.In contrast, the algorithm of Kolmogorov-Smirnov permits to detect the stationary segments for each line. The study aims to combine these two methods in order to get a better representation as optimal as possible of the real image.

Keywords : each line processing, Discrete-wavelet, KS-algorithm, lossy compression, stationary fragments

Centre de Recherche en Technologies Industrielles - CRTI - www.crti.dz

Powered by TCPDF (www.tcpdf.org)

Références

Télécharger maintenant ( PDF - 1 Page - 8.03 KB )

Documents relatifs

Line Segments and MeasureUse a ruler to measure the length of each line segment. Measure each segment in inches. Round yourmeasurements to the nearest 11118888 of an inch.

Measure each segment in inches.. ©X k2v0G1615 AK7uHtpa6 tS7offStPw9aJr4e4 ULpLaCc.5 H dAylWlN yrtilgMh4tcs7 UrqersaezrrvHe9dK.L i jMqacdreJ ywJiZtYhg

Line Segments and MeasureUse a ruler to measure the length of each line segment. Measure each segment in centimeters. Roundyour measurements to the nearest millimeter.

Measure each segment in centimeters.. ©c i2Q0y1N1P nK8urtPal kS3oIfLtRwEa0rmeH 6LxLMCm.o m fAAlQla WrqiNgEhxtts4 drUeOsEeir6vje1dV.J U 0MzavdEeD ewDiRtehI

The 3D Line Motion Matrix and the Alignment of Line Reconstructions

We derive a perspective projection matrix for 3D lines expressed in Pl¨ucker coordinates and a joint projection ma- trix mapping a 3D line to a set of image lines in the second set

Comparing Numerical Comparison Tasks: A Meta-Analysis of the Variability of the Weber Fraction Relative to the Generation Algorithm

Guillaume M and Van Rinsveld A (2018) Comparing Numerical Comparison Tasks: A Meta-Analysis of the Variability of the Weber Fraction Relative to the Generation

Quantile Estimation Based on the Principles of the Search on the Line

In this paper, we have designed a novel incremental discretized quantile esti- mator based on the theory of stochastic search on the line.. We emphasize that the estimator can be

The algorithm of noisy k-means

If we use a basic clustering algorithm based on the minimization of the empirical distortion (such as the k-means algorithm) when we deal with noisy data, the expected criterion

Computationally efficient algorithms for the two-dimensional Kolmogorov-Smirnov test

Even the range-counting tree based algorithm would demand days to perform the test on such a sample, as shown by Table 1 which gives the results and running times, in seconds,

The illusion of a Kolmogorov cascade

Moreover, the K´ arm´ an–Howarth–Kolmogorov equation for turbulent motion in the presence of coherent structures appears to be the most ap- propriate framework to quantify the