@InProceedings{	  koethe:2006:pce,
  author	= {Ullrich K{\"o}the and Peer Stelldinger and Hans Meine},
  title		= {Provably Correct Edgel Linking and Subpixel Boundary
		  Reconstruction},
  booktitle	= {Pattern Recognition, 28th {DAGM} Symposium},
  year		= {2006},
  editor	= {Katrin Franke and Klaus-Robert M{\"u}ller and Bertram
		  Nickolay and Ralf Sch{\"a}fer},
  organization	= {DAGM},
  series	= {Lecture Notes in Computer Science},
  volume	= {4174},
  pages		= {81--90},
  month		= sep,
  publisher	= {Springer},
  url		= {http://kogs-www.informatik.uni-hamburg.de/~koethe/papers/alphashapesegmentation_dagm.pdf}
		  ,
  abstract-url	= {http://kogs-www.informatik.uni-hamburg.de/~koethe/papers/abstracts/alphashapesegmentation_dagm.html}
		  ,
  html		= {\htmladdnormallink{Abstract}{http://kogs-www.informatik.uni-hamburg.de/~koethe/papers/abstracts/alphashapesegmentation_dagm.html},
		  \htmladdnormallink{PDF,
		  327kb}{http://kogs-www.informatik.uni-hamburg.de/~koethe/papers/alphashapesegmentation_dagm.pdf},
		  \htmladdnormallink{ps.gz,
		  438kb}{http://kogs-www.informatik.uni-hamburg.de/~koethe/papers/alphashapesegmentation_dagm.ps.gz}}
		  ,
  location	= {Berlin, Germany},
  abstract	= {\input{../BIB/koethe:2006:pce}},
  abstracttext	= {{Existing methods for segmentation by edgel linking are
		  based on heuristics and give no guarantee for a
		  topologically correct result. In this paper, we propose an
		  edgel linking algorithm based on a new sampling theorem for
		  shape digitization, which guarantees a topologically
		  correct reconstruction of regions and boundaries if the
		  edgels approximate true object edges with a known maximal
		  error. Experiments on real and generated images demonstrate
		  the good performance of the new method and confirm the
		  predictions of our theory.}},
  isbn		= {3-540-44412-2}
}