Computation of Level-Set Components From Level Lines

Yuqing Song, Xilin Chen, Zhiguo MaIEEE TIP 2011 · OpenReview

Abstract

We present an algorithm to compute the connected components of upper or lower level sets from level lines. The running time is <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex Notation="TeX">$O (n + \vert \tau \vert)$</tex></formula> , where <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$n$</tex></formula> is the size of the image and <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$\vert \tau \vert$</tex></formula> is the number of level lines.
BibTeX
@article{song2011computation,
  author = {Yuqing Song and Xilin Chen and Zhiguo Ma},
  title = {{Computation of Level-Set Components From Level Lines}},
  journal = {IEEE Trans. Image Process.},
  year = {2011},
  url = {https://openreview.net/forum?id=Wp-eIKlXztf},
}

Loading related content...

Figure