Multiscale texture segmentation of dip‐cube slices using wavelet‐domain hidden Markov trees

Ivan Magrin‐Chagnolleau, Hyeokho Choi, R. van Spaendonck, Philippe Steeghs, Richard G. Baraniuk1999 · DOI

TL;DR

This paper introduces a novel multiscale texture segmentation algorithm for geological data (dip-cube slices) by leveraging wavelet-domain hidden Markov trees (HMTs). By combining texture information across different scales, the method achieves more robust and accurate segmentation, particularly for identifying geological structures.

What Problem Does This Paper Address?

Accurately segmenting geological data, like seismic "dip-cube" slices, is crucial for interpreting subsurface structures. Traditional image segmentation methods often struggle to capture both large-scale geological formations and fine-grained boundary details simultaneously. This paper addresses the challenge of creating a segmentation technique that effectively utilizes information from multiple scales to improve the accuracy and robustness of texture classification in these complex geological datasets.

Methods

The core of the proposed method lies in the wavelet-domain hidden Markov trees (HMTs). Here's a breakdown:

  • Wavelet Transform: The input image (dip-cube slice) is first transformed using a Discrete Wavelet Transform (DWT). This decomposes the image into different frequency subbands, effectively capturing information at various scales.
  • Hidden Markov Models (HMMs): For each wavelet coefficient, an HMM is used to model its statistical properties. These HMMs are trained to represent the characteristics of different textures. The paper notes that wavelet coefficients tend to be sparse, with a few large values and many small ones, which can be well-modeled by Gaussian mixtures.
  • Hidden Markov Trees (HMTs): To capture dependencies across different scales, the HMMs are organized into a tree structure. Specifically, for 2D images, a quadtree structure is used for each subband. This HMT model allows for the modeling of how texture characteristics evolve from coarser to finer scales.
  • Multiscale Classification: The algorithm first generates "raw" segmentations at each scale by comparing the likelihoods of different HMT models for each image subblock.
  • Interscale Fusion: This is the key innovation. To combine the raw segmentations from different scales, a context-based approach is employed. This method uses segmentation results from coarser scales to inform and refine segmentation at finer scales. It models the dependencies between segmentation results across scales using a "labeling tree" and a context vector, making the process more flexible and easier to implement than previous methods. The brightness of individual pixels is then used in a final stage to achieve pixel-level segmentation.

Datasets

The paper uses two 64x64 blocks from dip-cube time slices for training and evaluation. These blocks were extracted from a 3D dataset of the Ameland survey. The training was performed with "intra-scale tying" to prevent overfitting.

Key Insights and Ideas

  • Wavelet-domain modeling is powerful: By modeling the statistics of wavelet coefficients rather than raw pixels, the algorithm can efficiently capture texture properties across scales.
  • HMTs provide a natural multiscale framework: The tree structure of HMTs inherently aligns with the multiresolution nature of wavelet transforms, making it ideal for multiscale analysis.
  • Interscale fusion is critical for accuracy: Combining "raw" segmentations from different scales, where coarse scales provide reliable overall structure and fine scales capture boundary details, leads to significantly improved results.
  • Contextual information enhances segmentation: Using segmentation results from coarser scales as "context" for finer scales helps to resolve ambiguities and produce more coherent segmentations.

Key Results

The paper demonstrates excellent results in segmenting two distinct textures within the dip-cube time slices. The figures show a clear improvement in segmentation quality after applying the interscale fusion algorithm compared to raw segmentation. Specifically, the authors highlight that the algorithm can more clearly delineate geological features like "channels" and "salt structures."

Limitations and Future Work

  • Limited number of textures: The current application focuses on segmenting only two textures. The authors suggest that a future step would be to extend the method to segmenting 3D dip-cubes with more than two classes.
  • Pixel-level modeling: While the paper mentions that pixel-level modeling is necessary for the final stage and refers to prior work (Choi and Baraniuk, 1999), the specifics of this pixel-level modeling are not detailed within this particular paper.
  • Training data selection: The authors note that a better choice of training images might further improve results, particularly for the first image presented.

Summary updated

Abstract

PreviousNext No AccessSEG Technical Program Expanded Abstracts 1999Multiscale texture segmentation of dip‐cube slices using wavelet‐domain hidden Markov treesAuthors: Ivan Magrin‐ChagnolleauHyeokho ChoiRutger van SpaendonckPhilippe SteeghsRichard G. BaraniukIvan Magrin‐ChagnolleauRice University, Houston, Texas, Hyeokho ChoiRice University, Houston, Texas, Rutger van SpaendonckRice University, Houston, Texas, Philippe SteeghsRice University, Houston, Texas, and Richard G. BaraniukRice University, Houston, Texashttps://doi.org/10.1190/1.1820808 SectionsAboutPDF/ePub ToolsAdd to favoritesDownload CitationsTrack CitationsPermissions ShareFacebookTwitterLinked InRedditEmail Permalink: https://doi.org/10.1190/1.1820808FiguresReferencesRelatedDetails SEG Technical Program Expanded Abstracts 1999ISSN (print):1052-3812 ISSN (online):1949-4645Copyright: 1999 Pages: 2061 publication data© 1999 Copyright © 1999 Society of Exploration GeophysicistsPublisher:Society of Exploration Geophysicists HistoryPublished: 04 Jan 2005 CITATION INFORMATION Ivan Magrin‐Chagnolleau, Hyeokho Choi, Rutger van Spaendonck, Philippe Steeghs, and Richard G. Baraniuk, (1999), "Multiscale texture segmentation of dip‐cube slices using wavelet‐domain hidden Markov trees," SEG Technical Program Expanded Abstracts : 1512-1515. https://doi.org/10.1190/1.1820808 Plain-Language Summary PDF DownloadLoading ...
BibTeX
@misc{magrinchagnolleau1999multiscale,
  author = {Ivan Magrin‐Chagnolleau and Hyeokho Choi and R. van Spaendonck and Philippe Steeghs and Richard G. Baraniuk},
  title = {{Multiscale texture segmentation of dip‐cube slices using wavelet‐domain hidden Markov trees}},
  year = {1999},
  doi = {10.1190/1.1820808},
}
Figure