Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Engineering
Arithfusion: An Arithmetic Deep Model For Temporal Remote Sensing Image Fusion, Md Reshad Ul Hoque, Jian Wu, Chiman Kwan, Krzysztof Koperski, Jiang Li
Arithfusion: An Arithmetic Deep Model For Temporal Remote Sensing Image Fusion, Md Reshad Ul Hoque, Jian Wu, Chiman Kwan, Krzysztof Koperski, Jiang Li
Electrical & Computer Engineering Faculty Publications
Different satellite images may consist of variable numbers of channels which have different resolutions, and each satellite has a unique revisit period. For example, the Landsat-8 satellite images have 30 m resolution in their multispectral channels, the Sentinel-2 satellite images have 10 m resolution in the pan-sharp channel, and the National Agriculture Imagery Program (NAIP) aerial images have 1 m resolution. In this study, we propose a simple yet effective arithmetic deep model for multimodal temporal remote sensing image fusion. The proposed model takes both low- and high-resolution remote sensing images at t1 together with low-resolution images at a …
Sparse Coding Based Dense Feature Representation Model For Hyperspectral Image Classification, Ender Oguslu, Guoqing Zhou, Zezhong Zheng, Khan Iftekharuddin, Jiang Li
Sparse Coding Based Dense Feature Representation Model For Hyperspectral Image Classification, Ender Oguslu, Guoqing Zhou, Zezhong Zheng, Khan Iftekharuddin, Jiang Li
Electrical & Computer Engineering Faculty Publications
We present a sparse coding based dense feature representation model (a preliminary version of the paper was presented at the SPIE Remote Sensing Conference, Dresden, Germany, 2013) for hyperspectral image (HSI) classification. The proposed method learns a new representation for each pixel in HSI through the following four steps: sub-band construction, dictionary learning, encoding, and feature selection. The new representation usually has a very high dimensionality requiring a large amount of computational resources. We applied the l1/lq regularized multiclass logistic regression technique to reduce the size of the new representation. We integrated the method with a linear …
Seasonal Adaptation Of Vegetation Color In Satellite Images, Srinivas Jakkula, Vamsi K.R. Mantena, Ramu Pedada, Yuzhong Shen, Jiang Li, Hamid R. Arabnia (Ed.)
Seasonal Adaptation Of Vegetation Color In Satellite Images, Srinivas Jakkula, Vamsi K.R. Mantena, Ramu Pedada, Yuzhong Shen, Jiang Li, Hamid R. Arabnia (Ed.)
Electrical & Computer Engineering Faculty Publications
Remote sensing techniques like NDVI (Normal Difference vegetative Index) when applied to phenological variations in aerial images, ascertained the seasonal rise and decline of photosynthetic activity in different seasons, resulting in different color tones of vegetation. The rise and fall of NDVI values decide the biological response, either the green up or brown down [1]. Vegetation in green up period appears with more vegetative vigor and during brown down period it has a dry appearance. This paper proposes a novel method that identifies vegetative patterns in satellite images and then alters vegetation color to simulate seasonal changes based on training …
Vegetation Identification Based On Satellite Imagery, Vamsi K.R. Mantena, Ramu Pedada, Srinivas Jakkula, Yuzhong Shen, Jiang Li, Hamid R. Arabnia (Ed.)
Vegetation Identification Based On Satellite Imagery, Vamsi K.R. Mantena, Ramu Pedada, Srinivas Jakkula, Yuzhong Shen, Jiang Li, Hamid R. Arabnia (Ed.)
Electrical & Computer Engineering Faculty Publications
Automatic vegetation identification plays an important role in many applications including remote sensing and high performance flight simulations. This paper presents a method to automatically identify vegetation based upon satellite imagery. First, we utilize the ISODATA algorithm to cluster pixels in the images where the number of clusters is determined by the algorithm. We then apply morphological operations to the clustered images to smooth the boundaries between clusters and to fill holes inside clusters. After that, we compute six features for each cluster. These six features then go through a feature selection algorithm and three of them are determined to …