a regularized constrast statistic for object boundary ... - Semantic Scholar

0 downloads 0 Views 1MB Size Report
Jun 30, 1992 - the National Institutes of Health under CA-42593 and. CA-61046. We are gra.tefuI to. Costa a.nd John McDonald for us to several illumiJilating.
A REGULARIZED CONSTRAST STATISTIC FOR OBJECT BOUNDARY ESTIMATION: IMPLEMENTATION AND STATISTICAL EVALUATION

by

Finbarr O'Sullivan Maijian Qian

TECHNICAL REPORT No. 233 June 1992

Department ofStatistics, GN-22 University of Washington Seattle, Washington 98195 USA

A Regularized Contrast Statistic for Object Boundary Estimation: Implementation and Statistical Evaluation. * Finbarr 0 'Sullivan and Maijian Qian Department of Statistics and Mathematics University of Washington Seattle, WA 98195. USA. June 30, 1992

Abstract We propose an optimization approach

~o

the estimation a simple closed curve de-

scribing the boundary of an object represented in an image. This problem arises in a variety of applications, such as template matching schemes for medical image registration. A regularized optimization formulation with an objective function that measures the normalized image contrast between the inside and outside of a boundary, is considered. Efficient numerical methods are developed to implement the approach and a set of simulation studies are carried out to quantify statistical performance characteristics in the context of boundary determination in emission computed tomography (ECT) These results are quite promising. The approach is highly automated which offers some practical advantages over currently used technologies in the medical imaging

l.tel~eClho:I£, non-linear opi'imizatiol1£, Slrml'LlatzO:I£.

"This research was SuplpOlted in part CA-61046. We are gra.tefuI to references.

the National Institutes of Health under CA-42593 and

Costa a.nd John McDonald for

us to several illumiJilating

Introduction

1

pro,blem of

det~ermjnirlg

ima.g~~s from

of

an

nn· ''''~T

X-ray computerized tomography (CT), ma,gn.E~tlC resonance

emission computed djfjfer~ent

the

and

derived from

imaging

isa speCIal sut>sta,ntiai l1jter'1.tu:re on

case

incon:>Or;itte COIltillluit,YC()nstra.:ints are less wen developed [2, 6, 10, 11, 16,22, 25}.

for

COlltillU()US boundary determinatiou is the degree of human intervention necessary to guide the software towards meaningful results, see [2] for some discussion. While there COllsil1erab:Le advances in in

development of

been

to facilitate this process,

areas, such as the medical image registration mentioned above, a more automated

estimation which imrol1{es miniIlaal m()d€!l1ng

the

is

apl')ro"Lch, we

con.sid~er

are se'li'er,u applical~iorls

l:>otmdary is deSicribes an

on a set

to

are

some

po1;en'~ial

ext;eniilOllS

x is in

rj>

if

[x - 8(S)]1]8(Sx)' > 0 . Note that the sets r~ and

2.1

rj>

form a partition of Q.

Contrast Statistic

The target boundary will be defined in terms of an ideal perfectly sampled noise-free image. ideal image f is a function f :

n

differentiable, i.e. the partial derivatives point x = (x}, X2) E

n.

---+

JR. We will assume that f is continuously

oxr! and ox2 f

exist and are continuous for each

Since often it is not reasonable to assume that the underlying

image is continuously differentiable but only say £2 integrable, we will take our function

f

to be the underlying image convolved with a spherically symmetric Gaussian kernel whose fun-width half maximum (FWHM) is set to be on the order of the resolution of the sampled image data. Note that the Gaussian convolution ensures that the ideal image

f is analytic.

Our choice of objective function is based on the notion that one is interested in identifying boundaries corresponding to sharp contrast in the image. We measure the contrast of a boundary

r e by the difference between the average value of f

per unit area on the inside

and outside of the boundary, i.e.

C(8) = II(J) -

1(1)

~(J)l

(1)

1(1)

where

I(J)

= Jrf

f

f(x)dx,

e

1(1) = f dx Jrfe

and

true bO'llnJCvu

guarantees that the sampling of initial curve is more intensive in areas where

rUlrv;:l.bl1·p

is greatest, see also Hastie and Stuetzle[13}.

speed pararneiter.ization is

,(s) = Oa(t(S»

(8)

where, for s € [0, I},

t(s) =

i IB s

.

1

duo

o a ( u)l integrations involved here are computed numerically, thus. the resulting curve, " is actually only approximately of unit speed.

3.4

Two Empirical Refinements

Experimentation with the basic Newton algorithm lead to two modifications to improve convergence and accuracy of the estimated boundary curves. 1. Re-focusing Q: In general, it is easy to appreciate that the objection IUIlctJlOn

ad 1 arise in.anumber of applications.

eX

Suggest Documents