Convex set reconstruction using prior shape information

Jerry Ladd Prince, Alan S. Willsky

Research output: Contribution to journalArticle

Abstract

In this paper we present several algorithms for reconstructing 2D convex sets given support line measurements for which the angles are known precisely but the lateral displacements are noisy. We extend the algorithms given in a previous paper by explicitly incorporating prior information about the shape of the objects to be reconstructed. We develop the Scale-Invariant algorithms, which incorporate prior shape information by defining prior probabilities on support vectors, where a support vector is a vector formed from the lateral displacements of a particular set of support lines of an object. We also develop the Ellipse-Based algorithms, which either assume or jointly estimate the parameters of an ellipse, given prior distributions that favor ellipses. In order to relate the support vector prior probability to the expected shape of an object we develop a vector decomposition called the Size/Shape/Shift decomposition, which helps to provide insight into the detailed geometric relationship between support vectors and 2D convex objects. We then use the maximum a posteriori criterion to determine the specific form of the support vector estimator. The computations involve a quadratic programming optimization stage, which is used to determine one component of the decomposition, and either a line search or a conjugate gradient stage, which is used to determine the remaining components. The performance of the algorithms is demonstrated using simulated support line measurements of an ellipse.

Original languageEnglish (US)
Pages (from-to)413-427
Number of pages15
JournalCVGIP: Graphical Models and Image Processing
Volume53
Issue number5
DOIs
StatePublished - 1991

Fingerprint

ellipse
decomposition
Decomposition
Quadratic programming

ASJC Scopus subject areas

  • Engineering(all)
  • Earth and Planetary Sciences(all)
  • Environmental Science(all)

Cite this

Convex set reconstruction using prior shape information. / Prince, Jerry Ladd; Willsky, Alan S.

In: CVGIP: Graphical Models and Image Processing, Vol. 53, No. 5, 1991, p. 413-427.

Research output: Contribution to journalArticle

@article{8c39d3da47c04d5db51a0d479ba5988e,
title = "Convex set reconstruction using prior shape information",
abstract = "In this paper we present several algorithms for reconstructing 2D convex sets given support line measurements for which the angles are known precisely but the lateral displacements are noisy. We extend the algorithms given in a previous paper by explicitly incorporating prior information about the shape of the objects to be reconstructed. We develop the Scale-Invariant algorithms, which incorporate prior shape information by defining prior probabilities on support vectors, where a support vector is a vector formed from the lateral displacements of a particular set of support lines of an object. We also develop the Ellipse-Based algorithms, which either assume or jointly estimate the parameters of an ellipse, given prior distributions that favor ellipses. In order to relate the support vector prior probability to the expected shape of an object we develop a vector decomposition called the Size/Shape/Shift decomposition, which helps to provide insight into the detailed geometric relationship between support vectors and 2D convex objects. We then use the maximum a posteriori criterion to determine the specific form of the support vector estimator. The computations involve a quadratic programming optimization stage, which is used to determine one component of the decomposition, and either a line search or a conjugate gradient stage, which is used to determine the remaining components. The performance of the algorithms is demonstrated using simulated support line measurements of an ellipse.",
author = "Prince, {Jerry Ladd} and Willsky, {Alan S.}",
year = "1991",
doi = "10.1016/1049-9652(91)90026-G",
language = "English (US)",
volume = "53",
pages = "413--427",
journal = "CVGIP: Graphical Models and Image Processing",
issn = "1049-9652",
publisher = "Academic Press Inc.",
number = "5",

}

TY - JOUR

T1 - Convex set reconstruction using prior shape information

AU - Prince, Jerry Ladd

AU - Willsky, Alan S.

PY - 1991

Y1 - 1991

N2 - In this paper we present several algorithms for reconstructing 2D convex sets given support line measurements for which the angles are known precisely but the lateral displacements are noisy. We extend the algorithms given in a previous paper by explicitly incorporating prior information about the shape of the objects to be reconstructed. We develop the Scale-Invariant algorithms, which incorporate prior shape information by defining prior probabilities on support vectors, where a support vector is a vector formed from the lateral displacements of a particular set of support lines of an object. We also develop the Ellipse-Based algorithms, which either assume or jointly estimate the parameters of an ellipse, given prior distributions that favor ellipses. In order to relate the support vector prior probability to the expected shape of an object we develop a vector decomposition called the Size/Shape/Shift decomposition, which helps to provide insight into the detailed geometric relationship between support vectors and 2D convex objects. We then use the maximum a posteriori criterion to determine the specific form of the support vector estimator. The computations involve a quadratic programming optimization stage, which is used to determine one component of the decomposition, and either a line search or a conjugate gradient stage, which is used to determine the remaining components. The performance of the algorithms is demonstrated using simulated support line measurements of an ellipse.

AB - In this paper we present several algorithms for reconstructing 2D convex sets given support line measurements for which the angles are known precisely but the lateral displacements are noisy. We extend the algorithms given in a previous paper by explicitly incorporating prior information about the shape of the objects to be reconstructed. We develop the Scale-Invariant algorithms, which incorporate prior shape information by defining prior probabilities on support vectors, where a support vector is a vector formed from the lateral displacements of a particular set of support lines of an object. We also develop the Ellipse-Based algorithms, which either assume or jointly estimate the parameters of an ellipse, given prior distributions that favor ellipses. In order to relate the support vector prior probability to the expected shape of an object we develop a vector decomposition called the Size/Shape/Shift decomposition, which helps to provide insight into the detailed geometric relationship between support vectors and 2D convex objects. We then use the maximum a posteriori criterion to determine the specific form of the support vector estimator. The computations involve a quadratic programming optimization stage, which is used to determine one component of the decomposition, and either a line search or a conjugate gradient stage, which is used to determine the remaining components. The performance of the algorithms is demonstrated using simulated support line measurements of an ellipse.

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

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

U2 - 10.1016/1049-9652(91)90026-G

DO - 10.1016/1049-9652(91)90026-G

M3 - Article

AN - SCOPUS:0026359275

VL - 53

SP - 413

EP - 427

JO - CVGIP: Graphical Models and Image Processing

JF - CVGIP: Graphical Models and Image Processing

SN - 1049-9652

IS - 5

ER -