CONTOUR EXTRACTION PROBLEM WITH BIOMEDICAL APPLICATIONS.

G. P. Ashkar; J. W. Modestino

CONTOUR EXTRACTION PROBLEM WITH BIOMEDICAL APPLICATIONS.

G. P. Ashkar, J. W. Modestino

Electrical & Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Chapter

3 Scopus citations

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)

Access to Document

Fingerprint Dive into the research topics of 'CONTOUR EXTRACTION PROBLEM WITH BIOMEDICAL APPLICATIONS.'. Together they form a unique fingerprint.

Cite this

@inbook{bc847bdc701749708ba4bc3a02177a3b,

title = "CONTOUR EXTRACTION PROBLEM WITH BIOMEDICAL APPLICATIONS.",

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.",

author = "Ashkar, {G. P.} and Modestino, {J. W.}",

year = "1977",

month = jan,

day = "1",

language = "English",

pages = "216--224",

booktitle = "Unknown Host Publication Title",

publisher = "IEEE (77CH1208-9C)",

note = "null ; Conference date: 06-06-1977 Through 08-06-1977",

}

TY - CHAP

T1 - CONTOUR EXTRACTION PROBLEM WITH BIOMEDICAL APPLICATIONS.

AU - Ashkar, G. P.

AU - Modestino, J. W.

PY - 1977/1/1

Y1 - 1977/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0017427736&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0017427736&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:0017427736

SP - 216

EP - 224

BT - Unknown Host Publication Title

PB - IEEE (77CH1208-9C)

CY - New York, NY

Y2 - 6 June 1977 through 8 June 1977

ER -