2021
DOI: 10.3934/ipi.2020076
|View full text |Cite
|
Sign up to set email alerts
|

Fast non-convex low-rank matrix decomposition for separation of potential field data using minimal memory

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 26 publications
0
2
0
Order By: Relevance
“…Within the separation of potential field data, low‐rank matrix decomposition methods based on the respective low‐rank and sparse trajectory matrices of magnetic anomalies generated by deep and shallow sources have been proposed (Zhu et al., 2020). High‐accuracy separation with strong robustness can be achieved by simultaneously minimizing the rank and ℓ 0 ‐norm of the regional and residual anomalies (Zhu et al., 2021). However, as in other separation methods, these low‐rank methods were designed to separate magnetic anomalies caused by sources at different depths; therefore, they cannot be applied to extract magnetic anomalies caused by sources that occur at similar depths.…”
Section: Introductionmentioning
confidence: 99%
“…Within the separation of potential field data, low‐rank matrix decomposition methods based on the respective low‐rank and sparse trajectory matrices of magnetic anomalies generated by deep and shallow sources have been proposed (Zhu et al., 2020). High‐accuracy separation with strong robustness can be achieved by simultaneously minimizing the rank and ℓ 0 ‐norm of the regional and residual anomalies (Zhu et al., 2021). However, as in other separation methods, these low‐rank methods were designed to separate magnetic anomalies caused by sources at different depths; therefore, they cannot be applied to extract magnetic anomalies caused by sources that occur at similar depths.…”
Section: Introductionmentioning
confidence: 99%
“…By combining CNN with MF, the ConvMF algorithm is obtained, which obtains predictive scores by inner product of the implicit factors of users' objects. In the ConvMF algorithm, CNN first converts the original information into a digital matrix, extracts its features, and finally obtains the final hidden factor representation through the fully connected layer [15,21,25]. The calculation formula for the final output vector is Equation (2).…”
mentioning
confidence: 99%