scholarly journals A Deep Hashing Technique for Remote Sensing Image-Sound Retrieval

2019 ◽  
Vol 12 (1) ◽  
pp. 84 ◽  
Author(s):  
Yaxiong Chen ◽  
Xiaoqiang Lu
Keyword(s):  
Remote Sensing ◽  
Semantic Similarity ◽  
Superior Performance ◽  
Selection Strategy ◽  
L1 Norm ◽  
Image Query ◽  
Similarity Relationships ◽  
Loss Term ◽  
Low Dimensional ◽  
Hash Codes

With the rapid progress of remote sensing (RS) observation technologies, cross-modal RS image-sound retrieval has attracted some attention in recent years. However, these methods perform cross-modal image-sound retrieval by leveraging high-dimensional real-valued features, which can require more storage than low-dimensional binary features (i.e., hash codes). Moreover, these methods cannot directly encode relative semantic similarity relationships. To tackle these issues, we propose a new, deep, cross-modal RS image-sound hashing approach, called deep triplet-based hashing (DTBH), to integrate hash code learning and relative semantic similarity relationship learning into an end-to-end network. Specially, the proposed DTBH method designs a triplet selection strategy to select effective triplets. Moreover, in order to encode relative semantic similarity relationships, we propose the objective function, which makes sure that that the anchor images are more similar to the positive sounds than the negative sounds. In addition, a triplet regularized loss term leverages approximate l1-norm of hash-like codes and hash codes and can effectively reduce the information loss between hash-like codes and hash codes. Extensive experimental results showed that the DTBH method could achieve a superior performance to other state-of-the-art cross-modal image-sound retrieval methods. For a sound query RS image task, the proposed approach achieved a mean average precision (mAP) of up to 60.13% on the UCM dataset, 87.49% on the Sydney dataset, and 22.72% on the RSICD dataset. For RS image query sound task, the proposed approach achieved a mAP of 64.27% on the UCM dataset, 92.45% on the Sydney dataset, and 23.46% on the RSICD dataset. Future work will focus on how to consider the balance property of hash codes to improve image-sound retrieval performance.

scholarly journals Toward a Yearly Country-Scale CORINE Land-Cover Map without Using Images: A Map Translation Approach

2021 ◽  
Vol 13 (6) ◽  
pp. 1060
Author(s):  
Luc Baudoux ◽  
Jordi Inglada ◽  
Clément Mallet
Keyword(s):  
Remote Sensing ◽  
Land Cover ◽  
Time Frame ◽  
Superior Performance ◽  
Land Cover Mapping ◽  
Visual Interpretation ◽  
Remote Sensing Images ◽  
Corine Land Cover ◽  
Land Cover Map ◽  
By Products

CORINE Land-Cover (CLC) and its by-products are considered as a reference baseline for land-cover mapping over Europe and subsequent applications. CLC is currently tediously produced each six years from both the visual interpretation and the automatic analysis of a large amount of remote sensing images. Observing that various European countries regularly produce in parallel their own land-cover country-scaled maps with their own specifications, we propose to directly infer CORINE Land-Cover from an existing map, therefore steadily decreasing the updating time-frame. No additional remote sensing image is required. In this paper, we focus more specifically on translating a country-scale remote sensed map, OSO (France), into CORINE Land Cover, in a supervised way. OSO and CLC not only differ in nomenclature but also in spatial resolution. We jointly harmonize both dimensions using a contextual and asymmetrical Convolution Neural Network with positional encoding. We show for various use cases that our method achieves a superior performance than the traditional semantic-based translation approach, achieving an 81% accuracy over all of France, close to the targeted 85% accuracy of CLC.

scholarly journals Unsupervised Deep Feature Learning for Remote Sensing Image Retrieval

2018 ◽  
Vol 10 (8) ◽  
pp. 1243 ◽  
Author(s):  
Xu Tang ◽  
Xiangrong Zhang ◽  
Fang Liu ◽  
Licheng Jiao
Keyword(s):  
Remote Sensing ◽  
Image Retrieval ◽  
Feature Learning ◽  
Remote Sensing Image ◽  
Code Word ◽  
Image Features ◽  
Learning Method ◽  
L1 Norm ◽  
Image Descriptor ◽  
Image Archives

Due to the specific characteristics and complicated contents of remote sensing (RS) images, remote sensing image retrieval (RSIR) is always an open and tough research topic in the RS community. There are two basic blocks in RSIR, including feature learning and similarity matching. In this paper, we focus on developing an effective feature learning method for RSIR. With the help of the deep learning technique, the proposed feature learning method is designed under the bag-of-words (BOW) paradigm. Thus, we name the obtained feature deep BOW (DBOW). The learning process consists of two parts, including image descriptor learning and feature construction. First, to explore the complex contents within the RS image, we extract the image descriptor in the image patch level rather than the whole image. In addition, instead of using the handcrafted feature to describe the patches, we propose the deep convolutional auto-encoder (DCAE) model to deeply learn the discriminative descriptor for the RS image. Second, the k-means algorithm is selected to generate the codebook using the obtained deep descriptors. Then, the final histogrammic DBOW features are acquired by counting the frequency of the single code word. When we get the DBOW features from the RS images, the similarities between RS images are measured using L1-norm distance. Then, the retrieval results can be acquired according to the similarity order. The encouraging experimental results counted on four public RS image archives demonstrate that our DBOW feature is effective for the RSIR task. Compared with the existing RS image features, our DBOW can achieve improved behavior on RSIR.

Transitivity in similarity judgments on German verbs

2016 ◽  
Vol 11 (1) ◽  
pp. 76-93
Author(s):  
Michael Richter ◽  
Roeland van Hout
Keyword(s):  
Semantic Similarity ◽  
Verb Classes ◽  
Similarity Relations ◽  
Similarity Judgments ◽  
Similarity Relationships

This paper investigates set-theoretical transitive and intransitive similarity relationships in triplets of verbs that can be deduced from raters’ similarity judgments on the pairs of verbs involved. We collected similarity judgments on pairs made up of 35 German verbs and found that the concept of transitivity adds to the information obtained from collecting pair-wise semantic similarity judgments. The concept of transitive similarity enables more complex relations to be revealed in triplets of verbs. To evaluate the outcomes that we obtained by analyzing transitive similarities we used two previously developed verb classifications of the same set of 35 verbs based on the analysis of large corpora (Richter & van Hout, 2016). We applied a modified form of weak stochastic transitivity (Block & Marschak, 1960; Luce & Suppes, 1965; Tversky, 1969) and found that (1), in contrast to Rips’ claim (2011), similarity relations in raters’ judgments systematically turn out to be transitive, and (2) transitivity discloses lexical and aspectual properties of verbs relevant in distinguishing verb classes.

scholarly journals Hybrid Collaborative Representation for Remote-Sensing Image Scene Classification

2018 ◽  
Vol 10 (12) ◽  
pp. 1934 ◽  
Author(s):  
Bao-Di Liu ◽  
Wen-Yang Xie ◽  
Jie Meng ◽  
Ye Li ◽  
Yanjiang Wang
Keyword(s):  
Remote Sensing ◽  
Test Sample ◽  
Remote Sensing Image ◽  
Image Features ◽  
Superior Performance ◽  
Collaborative Representation ◽  
Great Success ◽  
Specific Class ◽  
Remote Sensing Images ◽  
Training Samples

In recent years, the collaborative representation-based classification (CRC) method has achieved great success in visual recognition by directly utilizing training images as dictionary bases. However, it describes a test sample with all training samples to extract shared attributes and does not consider the representation of the test sample with the training samples in a specific class to extract the class-specific attributes. For remote-sensing images, both the shared attributes and class-specific attributes are important for classification. In this paper, we propose a hybrid collaborative representation-based classification approach. The proposed method is capable of improving the performance of classifying remote-sensing images by embedding the class-specific collaborative representation to conventional collaborative representation-based classification. Moreover, we extend the proposed method to arbitrary kernel space to explore the nonlinear characteristics hidden in remote-sensing image features to further enhance classification performance. Extensive experiments on several benchmark remote-sensing image datasets were conducted and clearly demonstrate the superior performance of our proposed algorithm to state-of-the-art approaches.

scholarly journals Mapping Seasonal High-Resolution PM2.5 Concentrations with Spatiotemporal Bagged-Tree Model across China

2021 ◽  
Vol 10 (10) ◽  
pp. 676
Author(s):  
Junchen He ◽  
Zhili Jin ◽  
Wei Wang ◽  
Yixiao Zhang
Keyword(s):  
Remote Sensing ◽  
Mean Squared Error ◽  
Fine Particulate Matter ◽  
Absolute Error ◽  
Superior Performance ◽  
Tree Model ◽  
Mixed Effect ◽  
Proposed Model ◽  
High Concentrations ◽  
Pm2.5 Concentration

High concentrations of fine particulate matter (PM2.5) are well known to reduce environmental quality, visibility, atmospheric radiation, and damage the human respiratory system. Satellite-based aerosol retrievals are widely used to estimate surface PM2.5 levels because satellite remote sensing can break through the spatial limitations caused by sparse observation stations. In this work, a spatiotemporal weighted bagged-tree remote sensing (STBT) model that simultaneously considers the effects of aerosol optical depth, meteorological parameters, and topographic factors was proposed to map PM2.5 concentrations across China that occurred in 2018. The proposed model shows superior performance with the determination coefficient (R2) of 0.84, mean-absolute error (MAE) of 8.77 μg/m3 and root-mean-squared error (RMSE) of 15.14 μg/m3 when compared with the traditional multiple linear regression (R2 = 0.38, MAE = 18.15 μg/m3, RMSE = 29.06 μg/m3) and linear mixed-effect (R2 = 0.52, MAE = 15.43 μg/m3, RMSE = 25.41 μg/m3) models by the 10-fold cross-validation method. The results collectively demonstrate the superiority of the STBT model to other models for PM2.5 concentration monitoring. Thus, this method may provide important data support for atmospheric environmental monitoring and epidemiological research.

scholarly journals Deep Learning Triplet Ordinal Relation Preserving Binary Code for Remote Sensing Image Retrieval Task

2021 ◽  
Vol 13 (23) ◽  
pp. 4786
Author(s):  
Zhen Wang ◽  
Nannan Wu ◽  
Xiaohan Yang ◽  
Bingqi Yan ◽  
Pingping Liu
Keyword(s):  
Remote Sensing ◽  
Image Retrieval ◽  
Large Scale ◽  
Nearest Neighbor ◽  
Binary Code ◽  
Satellite Observation ◽  
Cross Entropy ◽  
Retrieval Task ◽  
Search Tasks ◽  
Low Dimensional

As satellite observation technology rapidly develops, the number of remote sensing (RS) images dramatically increases, and this leads RS image retrieval tasks to be more challenging in terms of speed and accuracy. Recently, an increasing number of researchers have turned their attention to this issue, as well as hashing algorithms, which map real-valued data onto a low-dimensional Hamming space and have been widely utilized to respond quickly to large-scale RS image search tasks. However, most existing hashing algorithms only emphasize preserving point-wise or pair-wise similarity, which may lead to an inferior approximate nearest neighbor (ANN) search result. To fix this problem, we propose a novel triplet ordinal cross entropy hashing (TOCEH). In TOCEH, to enhance the ability of preserving the ranking orders in different spaces, we establish a tensor graph representing the Euclidean triplet ordinal relationship among RS images and minimize the cross entropy between the probability distribution of the established Euclidean similarity graph and that of the Hamming triplet ordinal relation with the given binary code. During the training process, to avoid the non-deterministic polynomial (NP) hard problem, we utilize a continuous function instead of the discrete encoding process. Furthermore, we design a quantization objective function based on the principle of preserving triplet ordinal relation to minimize the loss caused by the continuous relaxation procedure. The comparative RS image retrieval experiments are conducted on three publicly available datasets, including UC Merced Land Use Dataset (UCMD), SAT-4 and SAT-6. The experimental results show that the proposed TOCEH algorithm outperforms many existing hashing algorithms in RS image retrieval tasks.

scholarly journals A Novel Unit-Based Personalized Fingerprint Feature Selection Strategy for Dynamic Functional Connectivity Networks

2021 ◽  
Vol 15 ◽  
Author(s):  
Feng Zhao ◽  
Zhiyuan Chen ◽  
Islem Rekik ◽  
Peiqiang Liu ◽  
Ning Mao ◽  
...  
Keyword(s):  
Feature Selection ◽  
Functional Connectivity ◽  
Evaluation Method ◽  
Brain Regions ◽  
Autism Spectrum ◽  
Superior Performance ◽  
Selection Strategy ◽  
Dynamic Functional Connectivity ◽  
Discriminative Feature ◽  
Fingerprint Feature

The sliding-window-based dynamic functional connectivity networks (SW-D-FCN) derive from resting-state functional Magnetic Resonance Imaging has become an increasingly useful tool in the diagnosis of various neurodegenerative diseases. However, it is still challenging to learn how to extract and select the most discriminative features from SW-D-FCN. Conventionally, existing methods opt to select a single discriminative feature set or concatenate a few more from the SW-D-FCN. However, such reductionist strategies may fail to fully capture the personalized discriminative characteristics contained in each functional connectivity (FC) sequence of the SW-D-FCN. To address this issue, we propose a unit-based personalized fingerprint feature selection (UPFFS) strategy to better capture the most discriminative feature associated with a target disease for each unit. Specifically, we regard the FC sequence between any pair of brain regions of interest (ROIs) is regarded as a unit. For each unit, the most discriminative feature is identified by a specific feature evaluation method and all the most discriminative features are then concatenated together as a feature set for the subsequent classification task. In such a way, the personalized fingerprint feature derived from each FC sequence can be fully mined and utilized in classification decision. To illustrate the effectiveness of the proposed strategy, we conduct experiments to distinguish subjects diagnosed with autism spectrum disorder from normal controls. Experimental results show that the proposed strategy can select relevant discriminative features and achieve superior performance to benchmark methods.

scholarly journals A Robust False Matching Points Detection Method for Remote Sensing Image Registration

2015 ◽  
Vol XL-7/W3 ◽  
pp. 699-702
Author(s):  
X. J. Shan ◽  
P. Tang
Keyword(s):  
Remote Sensing ◽  
Image Registration ◽  
Detection Method ◽  
Graph Transformation ◽  
Remote Sensing Image ◽  
Transformation Model ◽  
Superior Performance ◽  
Geometric Distortion ◽  
Remote Sensing Images ◽  
Accuracy Result

Given the influences of illumination, imaging angle, and geometric distortion, among others, false matching points still occur in all image registration algorithms. Therefore, false matching points detection is an important step in remote sensing image registration. Random Sample Consensus (RANSAC) is typically used to detect false matching points. However, RANSAC method cannot detect all false matching points in some remote sensing images. Therefore, a robust false matching points detection method based on Knearest- neighbour (K-NN) graph (KGD) is proposed in this method to obtain robust and high accuracy result. The KGD method starts with the construction of the K-NN graph in one image. K-NN graph can be first generated for each matching points and its K nearest matching points. Local transformation model for each matching point is then obtained by using its K nearest matching points. The error of each matching point is computed by using its transformation model. Last, L matching points with largest error are identified false matching points and removed. This process is iterative until all errors are smaller than the given threshold. In addition, KGD method can be used in combination with other methods, such as RANSAC. Several remote sensing images with different resolutions and terrains are used in the experiment. We evaluate the performance of KGD method, RANSAC + KGD method, RANSAC, and Graph Transformation Matching (GTM). The experimental results demonstrate the superior performance of the KGD and RANSAC + KGD methods.

Community detection in complex network by network embedding and density clustering

2021 ◽  
pp. 1-12
Author(s):  
JinFang Sheng ◽  
Huaiyu Zuo ◽  
Bin Wang ◽  
Qiong Li
Keyword(s):  
Complex Network ◽  
Community Detection ◽  
Dimensional Space ◽  
Detection Algorithm ◽  
Superior Performance ◽  
Network Embedding ◽  
Detection Algorithms ◽  
Density Clustering ◽  
Community Detection Algorithm ◽  
Low Dimensional

 In a complex network system, the structure of the network is an extremely important element for the analysis of the system, and the study of community detection algorithms is key to exploring the structure of the complex network. Traditional community detection algorithms would represent the network using an adjacency matrix based on observations, which may contain redundant information or noise that interferes with the detection results. In this paper, we propose a community detection algorithm based on density clustering. In order to improve the performance of density clustering, we consider an algorithmic framework for learning the continuous representation of network nodes in a low-dimensional space. The network structure is effectively preserved through network embedding, and density clustering is applied in the embedded low-dimensional space to compute the similarity of nodes in the network, which in turn reveals the implied structure in a given network. Experiments show that the algorithm has superior performance compared to other advanced community detection algorithms for real-world networks in multiple domains as well as synthetic networks, especially when the network data chaos is high.

scholarly journals Weighted Spatial Pyramid Matching Collaborative Representation for Remote-Sensing-Image Scene Classification

2019 ◽  
Vol 11 (5) ◽  
pp. 518 ◽  
Author(s):  
Bao-Di Liu ◽  
Jie Meng ◽  
Wen-Yang Xie ◽  
Shuai Shao ◽  
Ye Li ◽  
...  
Keyword(s):  
Remote Sensing ◽  
Spatial Information ◽  
Remote Sensing Image ◽  
Superior Performance ◽  
Collaborative Representation ◽  
Scene Classification ◽  
Spatial Pyramid Matching ◽  
Classification Tasks ◽  
Pyramid Matching ◽  
Spatial Pyramid

At present, nonparametric subspace classifiers, such as collaborative representation-based classification (CRC) and sparse representation-based classification (SRC), are widely used in many pattern-classification and -recognition tasks. Meanwhile, the spatial pyramid matching (SPM) scheme, which considers spatial information in representing the image, is efficient for image classification. However, for SPM, the weights to evaluate the representation of different subregions are fixed. In this paper, we first introduce the spatial pyramid matching scheme to remote-sensing (RS)-image scene-classification tasks to improve performance. Then, we propose a weighted spatial pyramid matching collaborative-representation-based classification method, combining the CRC method with the weighted spatial pyramid matching scheme. The proposed method is capable of learning the weights of different subregions in representing an image. Finally, extensive experiments on several benchmark remote-sensing-image datasets were conducted and clearly demonstrate the superior performance of our proposed algorithm when compared with state-of-the-art approaches.

Sign in / Sign up

Export Citation Format

Share Document