Abstract
The approach to contour extraction described here formulates the contour extraction problem as one of minimum cost tree searching. Branch costs or metrics are defined which are indicative of the likelihood that a particular branch lies on the true contour. The branch metrics incorporate both local and global or contextual information. The most likely path or contour is then extracted by application of a heuristic tree searching algorithm. The approach has been successfully applied to a number of biomedical image processing problems.
| Original language | English |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Place of Publication | New York, NY |
| Publisher | IEEE (77CH1208-9C) |
| Pages | 216-224 |
| Number of pages | 9 |
| State | Published - Jan 1 1977 |
| Event | IEEE Comput Soc Conf on Pattern Recognition and Image Process, Proc - Troy, NY, USA Duration: Jun 6 1977 → Jun 8 1977 |
Other
| Other | IEEE Comput Soc Conf on Pattern Recognition and Image Process, Proc |
|---|---|
| City | Troy, NY, USA |
| Period | 6/6/77 → 6/8/77 |
ASJC Scopus subject areas
- Engineering(all)