ISPRS Journal of photogrammetry and remote sensing / International society for photogrammetry and remote sensing (1980 -) . vol 59 n° 3Paru le : 01/05/2005 ISBN/ISSN/EAN : 0924-2716 |
[n° ou bulletin]
est un bulletin de ISPRS Journal of photogrammetry and remote sensing / International society for photogrammetry and remote sensing (1980 -) (1990 -)
[n° ou bulletin]
|
Réservation
Réserver ce documentExemplaires(1)
Code-barres | Cote | Support | Localisation | Section | Disponibilité |
---|---|---|---|---|---|
081-05011 | SL | Revue | Centre de documentation | Revues en salle | Disponible |
Dépouillements
Ajouter le résultat dans votre panierCalculating NDVI for NOAA/AVHRR data after atmospheric correction for extensive images using 6S code: a case study in the Marsabit district Kenya / K. Tachiiri in ISPRS Journal of photogrammetry and remote sensing, vol 59 n° 3 (May 2005)
[article]
Titre : Calculating NDVI for NOAA/AVHRR data after atmospheric correction for extensive images using 6S code: a case study in the Marsabit district Kenya Type de document : Article/Communication Auteurs : K. Tachiiri, Auteur Année de publication : 2005 Article en page(s) : pp 103 - 114 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image
[Termes IGN] correction atmosphérique
[Termes IGN] image NOAA-AVHRR
[Termes IGN] Kenya
[Termes IGN] Normalized Difference Vegetation Index
[Termes IGN] régression linéaire
[Termes IGN] Total ozone mapping spectrometerRésumé : (Auteur) A detailed atmospheric correction method for NOAA/AVHRR images using 6S code, easily accessible data sets, and the images themselves is proposed. The parameters that 6S requires (aerosol optical depth, precipitable water, ozone content, and elevation) were obtained using data from the images, the Total Ozone Mapping Spectrometer, and the GTOP030 elevation data set, with reference to existing studies. The proposed methodology is validated through a case study of the Marsabit District, northern Kenya, which includes a broad range of precipitation, elevation, and vegetation types. The Normalized Difference Vegetation Index (NDVI) of desert, grassland, and forested areas from August 1987 to August 1988 was calculated after making the atmospheric correction. The intercept of the regression line, between the reflectance of before and after correction, is almost the same for each land cover type., while the slope is around 1.7 to 1.8 for grassland/bushland, it is smaller in the desert, where the range of the NDVI is limited. The NDVI in dense vegetation is more sensitive to the atmospheric correction, which is a result of the effect of path radiance. After the atmospheric correction, the range of NDVI increased, with the characteristic that the greater the NDVI, the larger was the atmospheric effect. In the case study, as well, the NDVI increased after the atmospheric correction, especially in pixels with initially high NDVI. A more detailed, entirely pixel-by-pixel, atmospheric correction requires individual pixel information for aerosol optical depth and precipitable water. This will be possible using data collected by the recent sensors such as MODIS. Copyright ISPRS Numéro de notice : A2005-227 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2004.09.001 En ligne : https://doi.org/10.1016/j.isprsjprs.2004.09.001 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=27364
in ISPRS Journal of photogrammetry and remote sensing > vol 59 n° 3 (May 2005) . - pp 103 - 114[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 081-05011 SL Revue Centre de documentation Revues en salle Disponible A subdivision algorithm for smooth 3D terrain models / Norbert Pfeifer in ISPRS Journal of photogrammetry and remote sensing, vol 59 n° 3 (May 2005)
[article]
Titre : A subdivision algorithm for smooth 3D terrain models Type de document : Article/Communication Auteurs : Norbert Pfeifer, Auteur Année de publication : 2005 Article en page(s) : pp 115 - 127 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Photogrammétrie numérique
[Termes IGN] lever souterrain
[Termes IGN] lissage de données
[Termes IGN] modèle numérique de terrain
[Termes IGN] noeud
[Termes IGN] ouvrage d'art
[Termes IGN] reconstruction 3D
[Termes IGN] tessellationRésumé : (Auteur) Current terrain modelling algorithms are not capable of reconstructing 3D surfaces, but are restricted to so-called 2.5D surfaces: for one planimetric position only one height may exist. The objective of this paper is to extend terrain relief modelling to 3D. In a 3D terrain model overhangs and caves, cliffs and tunnels will be presented correctly. Random measurement errors, limitations in data sampling and the requirement for a smooth surface rule out a triangulation of the original measurements as the final terrain model. A new algorithm, starting from a triangular mesh in 3D and following the subdivision paradigm will be presented. It is a stepwise refinement of a polygonal mesh, in which the location of the vertices on the next level is computed from the vertices on the current level. This yields a series of triangulated terrain surfaces with increasing point density and smaller angles between adjacent triangles, converging to a smooth surface. With the proposed algorithm, the special requirements in terrain modelling, e.g. breaklines can be considered. The refinement process can be stopped as soon as a resolution suitable for a specific application is obtained. Examples of an overhang, a bridge which is modelled as part of the terrain surface and for a 2.5D terrain surface are presented. The implications of extending modelling to 3D are discussed for typical terrain model applications. Numéro de notice : A2005-228 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2004.09.002 Date de publication en ligne : 23/03/2005 En ligne : https://doi.org/10.1016/j.isprsjprs.2004.09.002 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=27365
in ISPRS Journal of photogrammetry and remote sensing > vol 59 n° 3 (May 2005) . - pp 115 - 127[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 081-05011 SL Revue Centre de documentation Revues en salle Disponible A layered stereo matching algorithm using segmentation and global visibility constraints / M. Bleyer in ISPRS Journal of photogrammetry and remote sensing, vol 59 n° 3 (May 2005)
[article]
Titre : A layered stereo matching algorithm using segmentation and global visibility constraints Type de document : Article/Communication Auteurs : M. Bleyer, Auteur ; M. Gelautz, Auteur Année de publication : 2005 Article en page(s) : pp 128 - 150 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Photogrammétrie numérique
[Termes IGN] algorithme de décalage moyen
[Termes IGN] algorithme glouton
[Termes IGN] appariement de données localisées
[Termes IGN] compensation par moindres carrés
[Termes IGN] couche thématique
[Termes IGN] détection de partie cachée
[Termes IGN] extraction de couche
[Termes IGN] fenêtre (informatique)
[Termes IGN] graphe planaire
[Termes IGN] programmation par contraintes
[Termes IGN] segmentation d'image
[Termes IGN] visibilité
[Termes IGN] visualisation 3D
[Termes IGN] zone tamponRésumé : (Auteur) This work describes a stereo algorithm that takes advantage of image segmentation, assuming that disparity varies smoothly inside a segment of homogeneous colour and depth discontinuities coincide with segment borders. Image segmentation allows our method to generate correct disparity estimates in large untextured regions and precisely localize depth boundaries. The disparity inside a segment is represented by a planar equation. To derive the plane model, an initial disparity map is generated. We use a window-based approach that exploits the results of segmentation. The size of the match window is chosen adaptively. A segment's planar model is then derived by robust least squared error fitting using the initial disparity map. In a layer extraction step, disparity segments that are found to be similar according to a plane dissimilarity measurement are combined to form a single robust layer. We apply a modified mean-shift algorithm to extract clusters of similar disparity segments. Segments of the same cluster build a layer, the plane parameters of which are computed from its spatial extent using the initial disparity map. We then optimize the assignment of segments to layers using a global cost function. The quality of the disparity map is measured by warping the reference image to the second view and comparing it with the real image. Z-buffering enforces visibility and allows the explicit detection of occlusions. The cost function measures the colour dissimilarity between the warped and real views, and penalizes occlusions and neighbouring segments that are assigned to different layers. Since the problem of finding the assignment of segments to layers that minimizes this cost function is NP-complete, an efficient greedy algorithm is applied to find a local minimum. Layer extraction and assignment are alternately applied. Qualitative and quantitative results obtained for benchmark image pairs show that the proposed algorithm outperforms most state-of-the-art matching algorithms currently listed on the Middlebury stereo evaluation website. The technique achieves particularly good results in areas with depth discontinuities and related occlusions, where missing stereo information is substituted from surrounding regions. Furthermore, we apply the algorithm to a self-recorded image set and show 3D visualizations of the derived results. Numéro de notice : A2005-229 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2005.02.008 En ligne : https://doi.org/10.1016/j.isprsjprs.2005.02.008 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=27366
in ISPRS Journal of photogrammetry and remote sensing > vol 59 n° 3 (May 2005) . - pp 128 - 150[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 081-05011 SL Revue Centre de documentation Revues en salle Disponible Least squares 3D surface and curve matching / Armin W. Gruen in ISPRS Journal of photogrammetry and remote sensing, vol 59 n° 3 (May 2005)
[article]
Titre : Least squares 3D surface and curve matching Type de document : Article/Communication Auteurs : Armin W. Gruen, Auteur ; Devrim Akca, Auteur Année de publication : 2005 Article en page(s) : pp 151 - 174 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Photogrammétrie numérique
[Termes IGN] appariement de formes
[Termes IGN] balayage laser
[Termes IGN] courbe
[Termes IGN] données localisées 3D
[Termes IGN] méthode des moindres carrés
[Termes IGN] modèle de Gauss-Markov
[Termes IGN] modélisation 3D
[Termes IGN] semis de points
[Termes IGN] surface (géométrie)Résumé : (Auteur) The automatic co-registration of point clouds, representing 3D surfaces, is a relevant problem in 3D modeling. This multiple registration problem can be defined as a surface matching task. We treat it as least squares matching of overlapping surfaces. The surface may have been digitized/sampled point by point using a laser scanner device, a photogrammetric method or other surface measurement techniques. Our proposed method estimates the transformation parameters of one or more 3D search surfaces with respect to a 3D template surface, using the Generalized Gauss–Markoff model, minimizing the sum of squares of the Euclidean distances between the surfaces. This formulation gives the opportunity of matching arbitrarily oriented 3D surface patches. It fully considers 3D geometry. Besides the mathematical model and execution aspects we address the further extensions of the basic model. We also show how this method can be used for curve matching in 3D space and matching of curves to surfaces. Some practical examples based on the registration of close-range laser scanner and photogrammetric point clouds are presented for the demonstration of the method. This surface matching technique is a generalization of the least squares image matching concept and offers high flexibility for any kind of 3D surface correspondence problem, as well as statistical tools for the analysis of the quality of final matching results. Copyright ISPRS Numéro de notice : A2005-230 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2005.02.006 En ligne : https://doi.org/10.1016/j.isprsjprs.2005.02.006 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=27367
in ISPRS Journal of photogrammetry and remote sensing > vol 59 n° 3 (May 2005) . - pp 151 - 174[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 081-05011 SL Revue Centre de documentation Revues en salle Disponible