Share Email Print

Proceedings Paper

Optimal nonlinear filter in the random Boolean model
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A one-dimensional discrete Boolean model is a random process on the discrete line where random-length line segments are positioned according to the outcomes of a Bernoulli process. Points on the discrete line are either covered or left uncovered by a realization of the process. An observation of the process consists of runs of covered and not-covered points, called black and white runlengths, respectively. The black and white runlengths form an alternating sequence of independent random variables. We show how the Boolean model is completely determined by probability distributions of these random variables by giving explicit formulas linking the marking probability of the Bernoulli process and segment length distribution with the runlength distributions. The black runlength density is expressed recursively in terms of the marking probability and segment length distribution and white runlengths are shown to have a geometric probability law. Filtering for the Boolean model can also be done via runlengths. The optimal minimum mean absolute error filter for union noise is computed as the binary conditional expectation for windowed observations, expressible as a function observed black runlengths.

Paper Details

Date Published: 28 March 1995
PDF: 9 pages
Proc. SPIE 2424, Nonlinear Image Processing VI, (28 March 1995); doi: 10.1117/12.205230
Show Author Affiliations
John C. Handley, Rochester Institute of Technology (United States)
Edward R. Dougherty, Rochester Institute of Technology (United States)

Published in SPIE Proceedings Vol. 2424:
Nonlinear Image Processing VI
Edward R. Dougherty; Jaakko T. Astola; Harold G. Longbotham; Nasser M. Nasrabadi; Aggelos K. Katsaggelos, Editor(s)

© SPIE. Terms of Use
Back to Top