2018
DOI: 10.1109/jstars.2017.2787728
|View full text |Cite
|
Sign up to set email alerts
|

Multiple Mode SAR Raw Data Simulation and Parallel Acceleration for Gaofen-3 Mission

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
32
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
9

Relationship

2
7

Authors

Journals

citations
Cited by 69 publications
(41 citation statements)
references
References 38 publications
0
32
0
Order By: Relevance
“…In the Section 1, we know that PS 3 VM-D is also a semi-supervised method, which considers reliable incremental samples as semi-supervised samples by sample similarity. Therefore, PS 3 configuration is shown in Table 1. With the change of the number of the labeled samples, the OA trend chart of two methods is obtained, as shown in Figure 13.…”
Section: Verifying the Recognition Performance Ofmentioning
confidence: 99%
See 1 more Smart Citation
“…In the Section 1, we know that PS 3 VM-D is also a semi-supervised method, which considers reliable incremental samples as semi-supervised samples by sample similarity. Therefore, PS 3 configuration is shown in Table 1. With the change of the number of the labeled samples, the OA trend chart of two methods is obtained, as shown in Figure 13.…”
Section: Verifying the Recognition Performance Ofmentioning
confidence: 99%
“…Radar image recognition is a popular research area in the field of remote sensing [1][2][3]. With the development of imaging technologies and the expansion of radar image data, the requirement of real-time and accuracy of data processing becomes higher and higher.…”
Section: Introductionmentioning
confidence: 99%
“…In the heterogeneous soil model, OpenMP parallel optimization is used for multi-core parallelism implementation [27]. In our previous work, various parallel mechanisms have been introduced to accelerate the SAR raw data simulation, including clouding computing, GPU parallel, CPU parallel, and hybrid CPU/GPU parallel [28][29][30][31][32][33][34][35]. As far as the inversion algorithms are concerned, the time cost is only minute-level.…”
Section: Introductionmentioning
confidence: 99%
“…Graph belongs to non-Euclidean structures, and the number of the adjacent nodes of different nodes is not the same. Non-spatial methods aim at transforming graph-structure data into the Euclidean structure by redefining the neighbour regions of nodes [27], so that all the nodes have the same number of the adjacent nodes and the traditional CNN [28] can process the data. These types of approaches generally have two steps: (1) select the most representative nodes to form the sequence of the nodes to be segmented, and (2) define a fixed size neighbouring field for each selected node.…”
Section: Introductionmentioning
confidence: 99%