Descripteur
Documents disponibles dans cette catégorie (61)
Ajouter le résultat dans votre panier
Visionner les documents numériques
Affiner la recherche Interroger des sources externes
Etendre la recherche sur niveau(x) vers le bas
Detection of abrupt changes in spatial relationships in video sequences / Abdalbassir Abou-Elailah (2015)
Titre : Detection of abrupt changes in spatial relationships in video sequences Type de document : Article/Communication Auteurs : Abdalbassir Abou-Elailah , Auteur ; Valérie Gouet-Brunet , Auteur ; Isabelle Bloch, Auteur Editeur : Berlin, Heidelberg, Vienne, New York, ... : Springer Année de publication : 2015 Collection : Lecture notes in Computer Science, ISSN 0302-9743 num. 9493 Projets : DESCRiBE / Dubuisson, Séverine Conférence : ICPRAM 2015, 4th International Conference on Pattern Recognition Applications and Methods 10/01/2015 12/01/2015 Lisbonne Portugal Proceedings Springer Importance : pp 89 - 106 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image
[Termes IGN] détection de changement
[Termes IGN] distance euclidienne
[Termes IGN] histogramme
[Termes IGN] image vidéo
[Termes IGN] objet flou
[Termes IGN] relation spatiale
[Termes IGN] séquence d'imagesRésumé : (auteur) The purpose of this work is to detect strong changes in spatial relationships between objects in video sequences, with a limited knowledge on the objects. First, a fuzzy representation of the objects is proposed based on low-level generic primitives. Furthermore, angle and distance histograms are used as examples to model the spatial relationships between two objects. Then, we estimate the distances between different angle or distance histograms during time. By analyzing the evolution of the spatial relationships during time, ruptures are detected in this evolution. Experimental results show that the proposed method can efficiently detect the ruptures in the spatial relationships, exploiting only low-level primitives. This constitutes a promising step towards event detection in videos, with few a priori models on the objects. Numéro de notice : C2015-015 Affiliation des auteurs : LASTIG MATIS (2012-2019) Thématique : IMAGERIE Nature : Communication nature-HAL : ComAvecCL&ActesPubliésIntl DOI : 10.1007/978-3-319-27677-9_6 Date de publication en ligne : 09/01/2016 En ligne : https://doi.org/10.1007/978-3-319-27677-9_6 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=83206 Documents numériques
peut être téléchargé
Detection of ruptures ... - pdf auteurAdobe Acrobat PDF Spectral-angle-based Laplacian Eigenmaps for non linear dimensionality reduction of hyperspectral imagery / L. Yan in Photogrammetric Engineering & Remote Sensing, PERS, vol 80 n° 9 (September 2014)
[article]
Titre : Spectral-angle-based Laplacian Eigenmaps for non linear dimensionality reduction of hyperspectral imagery Type de document : Article/Communication Auteurs : L. Yan, Auteur ; X. Niu, Auteur Année de publication : 2014 Article en page(s) : pp 849 - 861 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique
[Termes IGN] angle d'incidence
[Termes IGN] classification Spectral angle mapper
[Termes IGN] détection de cible
[Termes IGN] distance euclidienne
[Termes IGN] image hyperspectrale
[Termes IGN] réduction
[Termes IGN] réflectance spectrale
[Termes IGN] végétationRésumé : In traditional manifold learning of hyperspectral imagery, distances among pixels are defined in terms of Euclidean distance, which is not necessarilly the best choice because of its sensitivity to variations in spectrum magnitudes. Selecting Laplacian Eignemaps (LE) as the test method, this paper studies the effects of distance metric selection in LE and proposes a spectral-angle-based LE method (LE-SA)to be compared against the traditional LE-based on Euclidean distance (LE-ED). Le-SA and LA-ED were applied to two airborne hyperspectral data sets and the dimensionlity-reduced data were quantitatively evalueted. Experimental results demonstrated that LE-SA is able to suppress the variations within the same type of features, such as variations in vegetation and those in illuminations due to shade orientations, and maintain a higher level of overall separability among different features than LE-ED. Further, the potential usage of a single LA-SA or LE-ED band for target detection is discussed. Numéro de notice : A2014-598 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article DOI : 10.14358/PERS.80.9.849 En ligne : https://doi.org/10.14358/PERS.80.9.849 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=74888
in Photogrammetric Engineering & Remote Sensing, PERS > vol 80 n° 9 (September 2014) . - pp 849 - 861[article]A fully constrained linear spectral unmixing algorithm based on distance geometry / Hanye Pu in IEEE Transactions on geoscience and remote sensing, vol 52 n° 2 (February 2014)
[article]
Titre : A fully constrained linear spectral unmixing algorithm based on distance geometry Type de document : Article/Communication Auteurs : Hanye Pu, Auteur ; Wei Xia, Auteur ; Bin Wang, Auteur ; Geng-Ming Jiang, Auteur Année de publication : 2014 Article en page(s) : pp 1157 - 176 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique
[Termes IGN] analyse des mélanges spectraux
[Termes IGN] contrainte géométrique
[Termes IGN] distance euclidienne
[Termes IGN] estimation statistique
[Termes IGN] méthode de Monte-CarloRésumé : (Auteur) Under the linear spectral mixture model, hyperspectral unmixing can be considered as a convex geometry problem, in which the endmembers are located in the vertices of simplex enclosing the hyperspectral data set and the barycentric coordinates of observation pixels with respect to the simplex correspond to the abundances of endmembers. Based on distance geometry theory, in this paper we propose a new approach for abundance estimation of mixed pixels in hyperspectral images. With the endmember signatures, which is known a priori or can be obtained from the endmember extraction algorithms, the proposed method automatically estimates the abundances of endmembers at each pixel using convex geometry concepts and distance geometry constraints. In the algorithm, denoting the pairwise distances with Cayley-Menger matrix makes it easy to calculate the barycentric coordinates of the observation pixels. Another characteristic of this algorithm is that the optimal estimated points of observation pixels as well as the least distortion in geometric structure of original data set can be obtained with the distance geometry constraint. Simultaneously, the use of barycenter of simplex builds an accurate and efficient method to estimate endmembers with zero abundance and, as a result, the subsimplex containing the estimated points is obtained. A comparative study and analysis based on Monte Carlo simulations and real data experiments is conducted among the proposed algorithm and three state-of-the-art algorithms: fully constrained least squares (FCLS), FCLS computed using constrained sparse unmixing by variable splitting and augmented Lagrangian, and simplex-projection unmixing (SPU). The experimental results show that the proposed algorithm always provides the best unmixing accuracy and when the number of endmembers is not very large the algorithm has a lower computational complexity. Numéro de notice : A2014-074 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1109/TGRS.2013.2248013 En ligne : https://doi.org/10.1109/TGRS.2013.2248013 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32979
in IEEE Transactions on geoscience and remote sensing > vol 52 n° 2 (February 2014) . - pp 1157 - 176[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 065-2014021 RAB Revue Centre de documentation En réserve L003 Disponible Urban network analysis: Centrality, sinuosity and shortcut detection / Theophile Emmanouilidis in Revue internationale de géomatique, vol 23 n° 3 - 4 (septembre 2013 - février 2014)
[article]
Titre : Urban network analysis: Centrality, sinuosity and shortcut detection Type de document : Article/Communication Auteurs : Theophile Emmanouilidis, Auteur Année de publication : 2013 Article en page(s) : pp 431 - 444 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] distance euclidienne
[Termes IGN] itinéraire
[Termes IGN] Lausanne
[Termes IGN] milieu urbain
[Termes IGN] navigation pédestre
[Termes IGN] piéton
[Termes IGN] réseau routier
[Termes IGN] sinuositéRésumé : (Auteur) This paper analyses the structure of roads (directed) and the pedestrian (undirected) networks in Lausanne (Switzerland). Centrality and sinuosity indexes are computed to perform spatial analysis at various scales. The study shows that the sinuosity index varies a lot at local (pedestrian) scale. The link between these variations and the underlying street patterns is investigated. The method also suggests that the comparison between Euclidean and shortest path distances can be used to improve pedestrian network by creating promising shortcuts, or alternatively to detect major network topological errors. Numéro de notice : A2013-719 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/URBANISME Nature : Article DOI : 10.3166/rig.23.431-443 En ligne : https://doi.org/10.3166/rig.23.431-443 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32855
in Revue internationale de géomatique > vol 23 n° 3 - 4 (septembre 2013 - février 2014) . - pp 431 - 444[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 047-2013031 SL Revue Centre de documentation Revues en salle Exclu du prêt Development of a network-based method for unmixing of hyperspectral data / V. Karathanassi in IEEE Transactions on geoscience and remote sensing, vol 50 n° 3 (March 2012)
[article]
Titre : Development of a network-based method for unmixing of hyperspectral data Type de document : Article/Communication Auteurs : V. Karathanassi, Auteur ; D. Sykas, Auteur ; Konstantinos Topouzelis, Auteur Année de publication : 2012 Article en page(s) : pp 839 - 849 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique
[Termes IGN] analyse des mélanges spectraux
[Termes IGN] distance euclidienne
[Termes IGN] image hyperspectraleRésumé : (Auteur) This paper presents a new nonlinear unmixing method. Based on relative distances which imply nonlinearity, the method introduces the “fractional distance” as a key variable that quantifies interactions between pixels and endmembers. Relationships between fractional distances and abundance fractions are built through networks. Because an equal spectral mixture of ground spectral classes present on the surface sensed is likely impossible, the proposed method, due to its mathematical concept, reveals unknown endmembers. Three versions of the method have been developed: the nonconstrained, the sum-to-one, and the fully constrained versions. Evaluation of the method using synthetic and real data showed that the method is robust with clear and interpretable results and provides reliable abundance fractions, particularly the sum-to-one and the fully constrained versions of the method. The new unmixing method has also been compared with the fully constrained least squares method. Numéro de notice : A2012-099 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1109/TGRS.2011.2163412 Date de publication en ligne : 15/09/2011 En ligne : https://doi.org/10.1109/TGRS.2011.2163412 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=31547
in IEEE Transactions on geoscience and remote sensing > vol 50 n° 3 (March 2012) . - pp 839 - 849[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 065-2012031 RAB Revue Centre de documentation En réserve L003 Disponible Computational method for the point cluster analysis on networks / K. Sugihara in Geoinformatica, vol 15 n° 1 (January 2011)PermalinkQuality assessment of 3D building data / Devrim Akca in Photogrammetric record, vol 25 n° 132 (December 2010 - February 2011)PermalinkUsing clustering methods in geospatial information systems / X. Wang in Geomatica, vol 64 n° 3 (September 2010)PermalinkUsing landscape characteristics to define an adjusted distance metric for improving kriging interpolations / S. Lyon in International journal of geographical information science IJGIS, vol 24 n° 5-6 (may 2010)PermalinkEfficient evaluation of continuous spatio-temporal queries on moving objects whith uncertain velocity / Y. Huang in Geoinformatica, vol 14 n° 2 (April 2010)PermalinkA new algorithm for distance cartogram construction / E. Shimizu in International journal of geographical information science IJGIS, vol 23 n°11-12 (november 2009)PermalinkThe determination of potential difference by the joint application of measured and synthetical gravity data: a case study in Hungary / G. Papp in Journal of geodesy, vol 83 n° 6 (June 2009)PermalinkMatching networks with different levels of detail / Sébastien Mustière in Geoinformatica, vol 12 n° 4 (December 2008)PermalinkGeneralized network Voronoi diagrams: concepts, computational methods, and applications / Atsuyuki Okabe in International journal of geographical information science IJGIS, vol 22 n° 8-9 (august 2008)PermalinkThe effect of instructions on distance and similarity judgements in information spatializations / Sara Irina Fabrikant in International journal of geographical information science IJGIS, vol 22 n° 4-5 (april 2008)Permalink