Feature Extraction in Remote Sensing High-Dimensional Image Data

2007 ◽  
Vol 4 (1) ◽  
pp. 107-111 ◽  
Author(s):  
Maciel Zortea ◽  
Victor Haertel ◽  
Robin Clarke
2019 ◽  
Vol 8 (3) ◽  
pp. 8881-8884

These are the days where we are very rich in information and poor in data. This is very true in case of image data. Whether it is the case of normal images or satellite images, the image collection is very huge but utilizing those images is of least concern. Extracting features from big images is a very challenging and compute intensive task but if we realize it, it will be very fruitful. CBIR (Content Based Image Retrieval) when used with HRRS (High Resolution Remote Sensing) images will yield with effective data.


Author(s):  
Jae Soo Yoo ◽  
Myung Keun Shin ◽  
Seok Hee Lee ◽  
Kil Seong Choi ◽  
Ki Hyung Cho ◽  
...  

2015 ◽  
Vol 09 (02) ◽  
pp. 239-259
Author(s):  
Abir Gallas ◽  
Walid Barhoumi ◽  
Ezzeddine Zagrouba

The user's interaction with the retrieval engines, while seeking a particular image (or set of images) in large-scale databases, defines better his request. This interaction is essentially provided by a relevance feedback step. In fact, the semantic gap is increasing in a remarkable way due to the application of approximate nearest neighbor (ANN) algorithms aiming at resolving the curse of dimensionality. Therefore, an additional step of relevance feedback is necessary in order to get closer to the user's expectations in the next few retrieval iterations. In this context, this paper details a classification of the different relevance feedback techniques related to region-based image retrieval applications. Moreover, a technique of relevance feedback based on re-weighting regions of the query-image by selecting a set of negative examples is elaborated. Furthermore, the general context to carry out this technique which is the large-scale heterogeneous image collections indexing and retrieval is presented. In fact, the main contribution of the proposed work is affording efficient results with the minimum number of relevance feedback iterations for high dimensional image databases. Experiments and assessments are carried out within an RBIR system for "Wang" data set in order to prove the effectiveness of the proposed approaches.


2008 ◽  
Vol 15 (2) ◽  
pp. 27-42
Author(s):  
Denis Altieri De Oliveira Moraes ◽  
Victor Haertel

This paper deals with the problem of classifying high-dimensional image data image data using a multiple stage classifier structured as a binary tree. The aim here consists in finding the optimal structure for the binary tree in the sense of achieving a stable accuracy. The advantage presented by a multiple stage classifier lies on the fact that only a sub-set of classes is considered at each stage, allowing a better selection of the features to be used at each node.  The binary tree is a particular case of a tree structured classifier, on which only two classes are considered at each node. This peculiarity makes possible the direct use of statistical distances for feature reduction (selection or extraction). In this study the criterion used for feature reduction at each node consists in optimizing the Bhattacharyya distance separating both classes in the node. The optimization of Bhattacharyya distance was based on the covariance matrices. Once the final set of features is obtained at each particular node, the classification is performed using the Gaussian Maximum Likelihood decision rule. Tests were performed using high-dimensional image data collected by the sensor system AVIRIS covering a test area. The criteria to evaluate the performance of the classifiers are: the final accuracy yielded by the classifier, its stability, and the required computer time.


Sign in / Sign up

Export Citation Format

Share Document