2012
DOI: 10.3390/e14122397
|View full text |Cite
|
Sign up to set email alerts
|

Entropy-Based Block Processing for Satellite Image Registration

Abstract: Image registration is an important task in many computer vision applications such as fusion systems, 3D shape recovery and earth observation. Particularly, registering satellite images is challenging and time-consuming due to limited resources and large image size. In such scenario, state-of-the-art image registration methods such as scale-invariant feature transform (SIFT) may not be suitable due to high processing time. In this paper, we propose an algorithm based on block processing via entropy to register … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(9 citation statements)
references
References 14 publications
(13 reference statements)
0
9
0
Order By: Relevance
“…Table 1 shows the number of initial CPs, corresponding CPs and refined CPs for different feature-based and area-based methods. The refined CPs were obtained using random sample consensus (RANSAC) [2]. In the table, it is clear that feature-based methods (SIFT and SURF) extracted more features than area-based methods (SSD, NCC, and FZNCC).…”
Section: Cpr =mentioning
confidence: 99%
See 1 more Smart Citation
“…Table 1 shows the number of initial CPs, corresponding CPs and refined CPs for different feature-based and area-based methods. The refined CPs were obtained using random sample consensus (RANSAC) [2]. In the table, it is clear that feature-based methods (SIFT and SURF) extracted more features than area-based methods (SSD, NCC, and FZNCC).…”
Section: Cpr =mentioning
confidence: 99%
“…High-resolution images may occupy over a hundred megabytes with several spectral bands or gigapixels with hyper-spectral bands. Therefore, processing these images with large sizes is difficult due to the limited resources and memory [1][2][3].…”
Section: Introductionmentioning
confidence: 99%
“…However, the current spatial objects stem from different domains, and it is difficult to determine the weight by experts in a specific domain. Therefore, under the condition of a lack of existing knowledge, we adopt an objective probability method to quantify the related weight by using axiomatic characterizations of information entropy, according to Shanonn [11,[23][24][25]. b .…”
Section: The Entropy-based Weighted Concept Latticementioning
confidence: 99%
“…In Section 4, we assign the weight to each property of the decision table ( [10,[20][21][22], to the foundation of the importance of the inclusion degree we introduce information entropy to characterize the combined weights of various attributes that belong to the same property in the decision table.…”
Section: Construction Of a Combined Weighted Concept Lattice With Incmentioning
confidence: 99%
“…How to identify the importance weight of each attribute has become an important and valuable task. Information entropy is introduced to assign a weight to attributes in some cases [20][21][22], the basis of which was used by Li et al [10] to design a workflow to build an entropy-based, weighted concept lattice. Weight based on information entropy considers the diversity of the attributes, but ignores their relativity.…”
Section: An Attribute Importance Definition Based On the Inclusion Dementioning
confidence: 99%