Abstract
In this paper, we present a probabilistic approach to segmentation which maintains a set of competing, plausible segmentation hypotheses. This is in contrast to previous approaches, in which probabilistic methods are used to converge to a single segmentation. The benefit of our approach is that belief values associated with segmentation hypotheses can be used to guide the recognition process, and, the recognition process can, in turn, exert influence on the belief values associated with segmentation hypotheses in the network. In this way, segmentation and recognition can be coupled together to achieve a combination of expectation driven segmentation and data-driven recognition. Our algorithms are based on the formalism of Bayesian belief networks. By storing segmentation hypotheses in a tree structured network, we are able to limit the storage demands associated with maintaining the competing hypotheses. We have also introduced an implicit representation for segmentation hypotheses (without this implicit representation, we would be forced to enumerate the power set of region groupings). Likelihood measures are used both to control the expansion of the hypothesis tree and to evaluate belief in hypotheses. Local likelihood measures are used during an expansion phase, in which leaf nodes are refined into more specific hypotheses. Global likelihood measures are applied during an evaluation phase. The global likelihood measures are derived by fitting quadric surfaces to the range data. By using this expand and evaluate approach guided by a measure of entropy defined on the leaves of the tree, we are able to limit the application of costly numerical fitting algorithms to a small number of nodes in the tree.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 2-15 |
| Number of pages | 14 |
| Journal | Proceedings of SPIE - The International Society for Optical Engineering |
| Volume | 1569 |
| DOIs | |
| State | Published - Oct 1 1991 |
| Event | Stochastic and Neural Methods in Signal Processing, Image Processing, and Computer Vision 1991 - San Diego, United States Duration: Jul 21 1991 → … |
Fingerprint
ASJC Scopus subject areas
- Electronic, Optical and Magnetic Materials
- Condensed Matter Physics
- Computer Science Applications
- Applied Mathematics
- Electrical and Electronic Engineering
Cite this
Considering multiple surface hypotheses in a Bayesian hierarchy. / Lavalle, Steven M.; Hutchinson, Seth A.
In: Proceedings of SPIE - The International Society for Optical Engineering, Vol. 1569, 01.10.1991, p. 2-15.Research output: Contribution to journal › Conference article
}
TY - JOUR
T1 - Considering multiple surface hypotheses in a Bayesian hierarchy
AU - Lavalle, Steven M.
AU - Hutchinson, Seth A.
PY - 1991/10/1
Y1 - 1991/10/1
N2 - In this paper, we present a probabilistic approach to segmentation which maintains a set of competing, plausible segmentation hypotheses. This is in contrast to previous approaches, in which probabilistic methods are used to converge to a single segmentation. The benefit of our approach is that belief values associated with segmentation hypotheses can be used to guide the recognition process, and, the recognition process can, in turn, exert influence on the belief values associated with segmentation hypotheses in the network. In this way, segmentation and recognition can be coupled together to achieve a combination of expectation driven segmentation and data-driven recognition. Our algorithms are based on the formalism of Bayesian belief networks. By storing segmentation hypotheses in a tree structured network, we are able to limit the storage demands associated with maintaining the competing hypotheses. We have also introduced an implicit representation for segmentation hypotheses (without this implicit representation, we would be forced to enumerate the power set of region groupings). Likelihood measures are used both to control the expansion of the hypothesis tree and to evaluate belief in hypotheses. Local likelihood measures are used during an expansion phase, in which leaf nodes are refined into more specific hypotheses. Global likelihood measures are applied during an evaluation phase. The global likelihood measures are derived by fitting quadric surfaces to the range data. By using this expand and evaluate approach guided by a measure of entropy defined on the leaves of the tree, we are able to limit the application of costly numerical fitting algorithms to a small number of nodes in the tree.
AB - In this paper, we present a probabilistic approach to segmentation which maintains a set of competing, plausible segmentation hypotheses. This is in contrast to previous approaches, in which probabilistic methods are used to converge to a single segmentation. The benefit of our approach is that belief values associated with segmentation hypotheses can be used to guide the recognition process, and, the recognition process can, in turn, exert influence on the belief values associated with segmentation hypotheses in the network. In this way, segmentation and recognition can be coupled together to achieve a combination of expectation driven segmentation and data-driven recognition. Our algorithms are based on the formalism of Bayesian belief networks. By storing segmentation hypotheses in a tree structured network, we are able to limit the storage demands associated with maintaining the competing hypotheses. We have also introduced an implicit representation for segmentation hypotheses (without this implicit representation, we would be forced to enumerate the power set of region groupings). Likelihood measures are used both to control the expansion of the hypothesis tree and to evaluate belief in hypotheses. Local likelihood measures are used during an expansion phase, in which leaf nodes are refined into more specific hypotheses. Global likelihood measures are applied during an evaluation phase. The global likelihood measures are derived by fitting quadric surfaces to the range data. By using this expand and evaluate approach guided by a measure of entropy defined on the leaves of the tree, we are able to limit the application of costly numerical fitting algorithms to a small number of nodes in the tree.
UR - http://www.scopus.com/inward/record.url?scp=84975671888&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84975671888&partnerID=8YFLogxK
U2 - 10.1117/12.48362
DO - 10.1117/12.48362
M3 - Conference article
AN - SCOPUS:84975671888
VL - 1569
SP - 2
EP - 15
JO - Proceedings of SPIE - The International Society for Optical Engineering
JF - Proceedings of SPIE - The International Society for Optical Engineering
SN - 0277-786X
ER -