Seismic Wavelet Estimation: A Fast Learning Algorithm Using Cumulant Matching and Natural-Gradient
Notice bibliographique
Résumé
Abstract In this paper, a simple, fast and local learning algorithm for estimating mixed-phase seismic wavelets is developed. This learning algorithm minimizes the nonlinear cumulant matching criterion using the natural gradient. It is shown that the nonlinear cumulant matching criterion has a Riemannianstructure. Therefore its steepest-descent is given by its natural gradient descent. The Riemannian metric tensor of the pth-order cumulant matching criterion, p?3, is determined. Then thenatural-gradient learning algorithm minimizing the pth-order cumulant matching criterion is derived for recovery of mixedphase seismic wavelets. Computer simulations, for the extraction of a broadband mixed-phase seismic wavelet from synthetic noisy seismic data, illustrate the powerfulness of the developed natural-gradient learning algorithm with respect to the standard-gradient learning algorithm. Introduction Seismic wavelet estimation is required for solving many seismic signal processing problems. Such problems may includetime-lapse seismic inversion, linearized seismic AVO amplitude-varying-with-offset) inversion, mono-/multi-channelseismic deconvolution, phase correction of stacked seismic sections, seismic forward modeling, etc. To estimate mixedphase seismic wavelets, the cumulant matching criterion iscommonly used(2)(3)(5). In this paper, a simple, fast and local learning algorithm for recovery of mixed-phase seismic wavelets is developed. This learning algorithm minimizes the nonlinear cumulant matching criterion using the natural gradient. It is shown that the nonlinear cumulant matching criterion has a Riemannian structure. Therefore the steepest-descent of the nonlinear cumulant matching criterion isnot defined by its standard-gradient descent, as suggested in Lazear (1993) (2), but rather by its natural-gradient descent. The Riemannian metric tensor of the pth-order cumulant matching criterion, p?3, which is a positive-definite matrix, is determined. Then the natural-gradient learning algorithmminimizing the pth-order cumulant matching criterion is derived for the extraction of mixed-phase seismic wavelets. The standard-gradient learning algorithm is derived as a special case of the natural-gradient learning algorithm by substituting the Riemannian metric tensor by the identity matrix. This paper is organized as follows. In section 2, a general deterministic cost function is proposed, and then its natural-gradient descent isdetermined and analysed. In section 3, the nonlinear cumulant matching criterion for the extraction of mixed-phase seismic wavelets is treated as a special case of the deterministic cost function proposed in section 2. Then, the natural-gradient descent of this nonlinear cumulant matching criterion is derived from the natural-gradient descent of the deterministic costfunction proposed in section 2. In section 4, a couple of computer simulations for estimating a broadband mixed-phase seismic wavelet from synthetic noisy seismic data are carried out. In the first computer simulation, the seismic wavelet is recovered by minimizing the fourth-order cumulant matching criterion using both natural- and standard-gradients. In the second computer simulation, the seismic wavelet is extracted by minimizing the joint third- and fourth-order cumulant matching criterion using both natural- and standard-gradients. Both computer simulations illustrate that the natural-gradient learning algorithm requires much less iterations to converge than thestandard-gradient learning algorithm. Section 5 concludes the paper.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,001 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».