Multiscale Image Segmentation Using Joint Texture and Shape Analysis

Files in this item

Files Size Format View
Nee2000Aug1Multiscale.PDF 1.505Mb application/pdf Thumbnail
Nee2000Aug1Multiscale.PS 6.752Mb application/postscript View/Open

Show full item record

Item Metadata

Title: Multiscale Image Segmentation Using Joint Texture and Shape Analysis
Author: Neelamani, Ramesh; Romberg, Justin; Riedi, Rudolf H.; Choi, Hyeokho; Baraniuk, Richard G.
Type: Conference Paper
Keywords: Segmentation; texture; shape; minimum description length (MDL); wavelets; hidden Markov trees (HMT)
Citation: "Multiscale Image Segmentation Using Joint Texture and Shape Analysis," R. Neelamani, J. Romberg, R. H. Riedi, H. Choi and R. G. Baraniuk, Proc. SPIE, Wavelet Applications in Signal and Image Processign VIII, Jul. 2000. http://hdl.handle.net/1911/20138.
Center: Center for Multimedia Communications; Digital Signal Processing
Abstract: We develop a general framework to simultaneously exploit texture and shape characterization in multiscale image segmentation. By posing multiscale segmentation as a model selection problem, we invoke the powerful framework offered by minimum description length (MDL). This framework dictates that multiscale segmentation comprises multiscale texture characterization and multiscale shape coding. Analysis of current multiscale maximum a posteriori (MAP) segmentation algorithms reveals that these algorithms implicitly use a shape coder with the aim to estimate the optimal MDL solution, but find only an approximate solution. Towards achieving better segmentation estimates, we first propose a shape coding algorithm based on zero-trees which is well-suited to represent images with large homogeneous regions. For this coder, we design an efficient tree-based algorithm using dynamic programming that attains the optimal MDL segmentation estimate. To incorporate arbitrary shape coding techniques into segmentation, we design an iterative algorithm that uses dynamic programming for each iteration. Though the iterative algorithm is not guaranteed to attain exactly optimal estimates, it more effectively captures the prior set by the shape coder. Experiments demonstrate that the proposed algorithms yield excellent segmentation results on both synthetic and real world data examples.
Date Published: 2000-07-01

This item appears in the following Collection(s)

  • ECE Publications [816 items]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students
  • DSP Publications [512 items]
    Publications by Rice Faculty and graduate students in digital signal processing.