Back to the Gradient Vector Flow Page
List of Citations from Science Citation Index for
M. Kass, A. Witkin, and D. Terzopoulos, ``Snakes - Active Contour Models'' International Journal of Computer Vision, 1(4): 321-331, 1987.
1988: 2 1989: 1 1990: 1 1993: 11 1994: 25 1995: 37 1996: 74 1997: 99 1998: 88 1999: 115 2000: 129 2001: 129 2002: 134 2003: 172 2004: 194 2005: 27
Total citations: 1238
As of 11 Mar 2005
By Year - By Citation Rank - By Year with Abstract
|
|
1988 |
1. | TERZOPOULOS, D, WITKIN, A, and KASS, M, "CONSTRAINTS ON DEFORMABLE MODELS - RECOVERING 3D SHAPE AND NONRIGID MOTION," ARTIFICIAL INTELLIGENCE, vol. 36, pp. 91-123, 1988.
Abstract:
We present a new approach to the analysis of dynamic facial
images for the purposes of estimating and resynthesizing
dynamic facial expressions. The approach exploits a
sophisticated generative model of the human face originally
developed for realistic facial animation. The face model, which
may be simulated and rendered at interactive rates on a
graphics workstation, incorporates a physics-based synthetic
facial tissue and a set of anatomically motivated facial muscle
actuators. We consider the estimation of dynamic facial muscle
contractions from video sequences of expressive human faces. We
develop an estimation technique that uses deformable contour
models (snakes) to track the nonrigid motions of facial
features in video images. The technique estimates muscle
actuator controls with sufficient accuracy to permit the face
model to resynthesize transient expressions.
|
2. | TERZOPOULOS, D, and WITKIN, A, "PHYSICALLY BASED MODELS WITH RIGID AND DEFORMABLE COMPONENTS," IEEE COMPUTER GRAPHICS AND APPLICATIONS, vol. 8, pp. 41-51, 1988.
Abstract:
We present a new approach to the analysis of dynamic facial
images for the purposes of estimating and resynthesizing
dynamic facial expressions. The approach exploits a
sophisticated generative model of the human face originally
developed for realistic facial animation. The face model, which
may be simulated and rendered at interactive rates on a
graphics workstation, incorporates a physics-based synthetic
facial tissue and a set of anatomically motivated facial muscle
actuators. We consider the estimation of dynamic facial muscle
contractions from video sequences of expressive human faces. We
develop an estimation technique that uses deformable contour
models (snakes) to track the nonrigid motions of facial
features in video images. The technique estimates muscle
actuator controls with sufficient accuracy to permit the face
model to resynthesize transient expressions.
|
|
|
1989 |
3. | BOOKSTEIN, FL, "PRINCIPAL WARPS - THIN-PLATE SPLINES AND THE DECOMPOSITION OF DEFORMATIONS," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 11, pp. 567-585, 1989.
Abstract:
We present a new approach to the analysis of dynamic facial
images for the purposes of estimating and resynthesizing
dynamic facial expressions. The approach exploits a
sophisticated generative model of the human face originally
developed for realistic facial animation. The face model, which
may be simulated and rendered at interactive rates on a
graphics workstation, incorporates a physics-based synthetic
facial tissue and a set of anatomically motivated facial muscle
actuators. We consider the estimation of dynamic facial muscle
contractions from video sequences of expressive human faces. We
develop an estimation technique that uses deformable contour
models (snakes) to track the nonrigid motions of facial
features in video images. The technique estimates muscle
actuator controls with sufficient accuracy to permit the face
model to resynthesize transient expressions.
|
|
|
1990 |
4. | VANCLEYNENBREUGEL, J, FIERENS, F, SUETENS, P, and OOSTERLINCK, A, "DELINEATING ROAD STRUCTURES ON SATELLITE IMAGERY BY A GIS- GUIDED TECHNIQUE," PHOTOGRAMMETRIC ENGINEERING AND REMOTE SENSING, vol. 56, pp. 893-898, 1990.
Abstract:
We present a new approach to the analysis of dynamic facial
images for the purposes of estimating and resynthesizing
dynamic facial expressions. The approach exploits a
sophisticated generative model of the human face originally
developed for realistic facial animation. The face model, which
may be simulated and rendered at interactive rates on a
graphics workstation, incorporates a physics-based synthetic
facial tissue and a set of anatomically motivated facial muscle
actuators. We consider the estimation of dynamic facial muscle
contractions from video sequences of expressive human faces. We
develop an estimation technique that uses deformable contour
models (snakes) to track the nonrigid motions of facial
features in video images. The technique estimates muscle
actuator controls with sufficient accuracy to permit the face
model to resynthesize transient expressions.
|
|
|
1993 |
5. | SHUFELT, JA, and MCKEOWN, DM, "FUSION OF MONOCULAR CUES TO DETECT MAN-MADE STRUCTURES IN AERIAL IMAGERY," CVGIP-IMAGE UNDERSTANDING, vol. 57, pp. 307-330, 1993.
Abstract:
We present a new approach to the analysis of dynamic facial
images for the purposes of estimating and resynthesizing
dynamic facial expressions. The approach exploits a
sophisticated generative model of the human face originally
developed for realistic facial animation. The face model, which
may be simulated and rendered at interactive rates on a
graphics workstation, incorporates a physics-based synthetic
facial tissue and a set of anatomically motivated facial muscle
actuators. We consider the estimation of dynamic facial muscle
contractions from video sequences of expressive human faces. We
develop an estimation technique that uses deformable contour
models (snakes) to track the nonrigid motions of facial
features in video images. The technique estimates muscle
actuator controls with sufficient accuracy to permit the face
model to resynthesize transient expressions.
|
6. | TERZOPOULOS, D, and WATERS, K, "ANALYSIS AND SYNTHESIS OF FACIAL IMAGE SEQUENCES USING PHYSICAL AND ANATOMICAL MODELS," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 15, pp. 569-579, 1993.
Abstract:
We present a new approach to the analysis of dynamic facial
images for the purposes of estimating and resynthesizing
dynamic facial expressions. The approach exploits a
sophisticated generative model of the human face originally
developed for realistic facial animation. The face model, which
may be simulated and rendered at interactive rates on a
graphics workstation, incorporates a physics-based synthetic
facial tissue and a set of anatomically motivated facial muscle
actuators. We consider the estimation of dynamic facial muscle
contractions from video sequences of expressive human faces. We
develop an estimation technique that uses deformable contour
models (snakes) to track the nonrigid motions of facial
features in video images. The technique estimates muscle
actuator controls with sufficient accuracy to permit the face
model to resynthesize transient expressions.
|
7. | FUKUHARA, T, and MURAKAMI, T, "3-D MOTION ESTIMATION OF HUMAN HEAD FOR MODEL-BASED IMAGE- CODING," IEE PROCEEDINGS-I COMMUNICATIONS SPEECH AND VISION, vol. 140, pp. 26-35, 1993.
Abstract:
Model-based image coding applied to interpersonal communication
achieves very low bit-rate image transmission. To accomplish
it, accurate three-dimensional (3-D) motion estimation of a
speaker is necessary. A new method of 3-D motion estimation is
presented, consisting of two steps. In the first, facial
contours and feature points of a speaker are extracted using
filtering and Snake algorithms. Five feature points on a
speaker's facial image are tracked between consecutive picture
frames, which gives 2-D motion vectors of the feature points.
Then, in the second step, the 3-D motion of a speaker's head is
estimated using a three-layered neural network model, after
training with many possible motion patterns of the human head
using an existing 3-D general shape model. Experimental results
show that our method not only achieves good results but is also
more robust than existing methods, even when the motion of an
object is rather large or complicated. Accurately estimated 3-D
motion parameters can realise image transmission at a very low
bit rate.
|
8. | WHITTEN, G, "SCALE-SPACE TRACKING AND DEFORMABLE SHEET MODELS FOR COMPUTATIONAL VISION," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 15, pp. 697-706, 1993.
Abstract:
Many problems in computational vision (including stereo
correspondence, motion analysis and surface reconstruction) can
be solved effectively using a constrained optimization
approach, where smoothness is the common constraint. Moreover,
these problems can be cast in a variational form that minimizes
an energy functional. Unfortunately, standard optimization
techniques tend to find only local energy minima. Coarse to
fine scale space tracking (where energy minima at reduced
resolution are found and successively tracked to higher
resolution) has been demonstrated to find solutions of
practical value. For smoothness-constrained optimization
problems, we show that scale space tracking can be implicitly
implemented by appropriately adjusting the smoothness
constraint. A useful physical model for controlled smoothness
(deformable sheets) provides a natural framework for scale
space tracking and addressing many vision problems that can be
solved by appealing to a smoothness constraint. Deformable
sheets are characterized by a global energy functional, and the
smoothness constraint is represented by a linear internal
energy term. In analogy to physical sheets, the model sheets
are deformed by problem specific external forces and, in turn,
impose smoothness on the applied forces. We have related
deformable sheet smoothness properties to Gaussian blurring
(the common expression of scale) and used this relationship to
unify the concepts of scale and smoothness. In our formulation,
the smoothness/scale state is controlled by a single parameter
in the deformable sheet model. This single parameter control of
scale makes it possible to perform scale space tracking by
solving the differential equation that describes the trajectory
of energy minima through scale space. Further, it permits
adaptive scale step size selection based on the local
properties of scale space, which allows for much larger steps
than would be possible with the conservative step size required
by nonadaptive techniques. We show that this process is
characterized by a sparse linear system and prove that the
associated matrix is positive definite and, consequently,
nonsingular. Our analysis also provides for the determination
of scale-dependent parameters, which is useful for efficient
multiresolution processing. We have applied the deformable
sheet model described to different problems in computational
vision using real imagery with encouraging results, which are
presented here.
|
9. | HOGG, DC, "SHAPE IN MACHINE VISION," IMAGE AND VISION COMPUTING, vol. 11, pp. 309-316, 1993.
Abstract:
The representation of shape in machine vision is reviewed with
emphasis on the most common types of representation and recent
developments. Both planar shape and solid shape are examined
with connections and generalizations drawn wherever possible.
Particular emphasis is placed on the importance of invariant
descriptions and on the representation of shape classes.
|
10. | GAUCH, JM, and PIZER, SM, "THE INTENSITY AXIS OF SYMMETRY AND ITS APPLICATION TO IMAGE SEGMENTATION," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 15, pp. 753-770, 1993.
Abstract:
In this paper, we present a new method for describing the shape
of structures in grey-scale images, which is known as the
intensity axis of symmetry (IAS). We describe the spatial and
intensity variations of the image simultaneously rather than by
the usual two-step process of 1) using intensity properties of
the image to segment an image into regions and 2) describing
the spatial shape of these regions. The result is an image
shape description that is useful for a number of computer
vision applications. Our method for computing this image shape
description relies on minimizing an active surface functional
that provides coherence in both the spatial and intensity
dimensions while deforming into an axis of symmetry. Shape-
based image segmentation is possible by identifying image
regions associated with individual components of the IAS. The
resulting image regions have geometric coherence and correspond
well to visually meaningful objects in medical images.
|
11. | TSAI, CT, SUN, YN, CHUNG, PC, and LEE, JS, "ENDOCARDIAL BOUNDARY DETECTION USING A NEURAL-NETWORK," PATTERN RECOGNITION, vol. 26, pp. 1057-1068, 1993.
Abstract:
Echocardiography has been widely used as a real-time non-
invasive clinical tool to diagnose cardiac functions. Due to
the poor quality and inherent ambiguity in echocardiograms, it
is difficult to detect the myocardial boundaries of the left
ventricle. Many existing methods are semi-automatic and detect
cardial boundaries by serial computation which is too slow to
be practical in real applications. In this paper, a new method
for detecting the endocardial boundary by using a Hopfield
neural network is proposed. Taking advantage of parallel
computation and energy convergence capability in the Hopfield
network, this method is faster and more stable for the
detection of the endocardial border. Moreover, neither manual
operations nor a priori assumptions are needed in this method.
Experiments on several LV echocardiograms and clinical
validation have shown the effectiveness of our method in these
patient studies.
|
12. | LINDEBERG, T, "DETECTING SALIENT BLOB-LIKE IMAGE STRUCTURES AND THEIR SCALES WITH A SCALE-SPACE PRIMAL SKETCH - A METHOD FOR FOCUS-OF- ATTENTION," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 11, pp. 283-318, 1993.
Abstract:
This article presents: (i) a multiscale representation of grey-
level shape called the scale-space primal sketch, which makes
explicit both features in scale-space and the relations between
structures at different scales, (ii) a methodology for
extracting significant blob-like image structures from this
representation, and (iii) applications to edge detection,
histogram analysis, and junction classification demonstrating
how the proposed method can be used for guiding later-stage
visual processes. The representation gives a qualitative
description of image structure, which allows for detection of
stable scales and associated regions of interest in a solely
bottom-up data-driven way. In other words, it generates coarse
segmentation cues, and can hence be seen as preceding further
processing, which can then be properly tuned. It is argued that
once such information is available, many other processing tasks
can become much simpler. Experiments on real imagery
demonstrate that the proposed theory gives intuitive results.
|
13. | COHEN, LD, and COHEN, I, "FINITE-ELEMENT METHODS FOR ACTIVE CONTOUR MODELS AND BALLOONS FOR 2-D AND 3-D IMAGES," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 15, pp. 1131-1147, 1993.
Abstract:
The use of energy-minimizing curves, known as ''snakes'' to
extract features of interest in images has been introduced by
Kass, Witkin and Terzopoulos [23]. A balloon model was
introduced in [12] as a way to generalize and solve some of the
problems encountered with the original method. A 3-D
generalization of the balloon model as a 3-D deformable
surface, which evolves in 3-D images, is presented. It is
deformed under the action of internal and external forces
attracting the surface toward detected edgels by means of an
attraction potential. We also show properties of energy-
minimizing surfaces concerning their relationship with 3-D edge
points. To solve the minimization problem for a surface, two
simplified approaches are shown first, defining a 3-D surface
as a series of 2-D planar curves. Then, after comparing finite-
element method and finite-difference method in the 2-D problem,
we solve the 3-D model using the finite-element method yielding
greater stability and faster convergence. This model is applied
for segmenting magnetic resonance images.
|
14. | TSAI, CT, SUN, YN, and CHUNG, PC, "MINIMIZING THE ENERGY OF ACTIVE CONTOUR MODEL USING A HOPFIELD NETWORK," IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, vol. 140, pp. 297-303, 1993.
Abstract:
Active contour models (snakes) are commonly used for locating the
boundary of an object in computer vision applications. The minimisation
procedure is the key problem to solve in the technique of active
contour models. In this paper, a minimisation method for an active
contour model using Hopfield networks is proposed. Due to its network
structure, it lends itself admirably to parallel implementation and is
potentially faster than conventional methods. In addition, it retains
the stability of the snake model and the possibility for inclusion of
hard constraints. Experimental results are given to demonstrate the
feasibility of the proposed method in applications of industrial
pattern recognition and medical image processing.
|
15. | WOLBERG, WH, STREET, WN, and MANGASARIAN, OL, "BREAST CYTOLOGY DIAGNOSIS WITH DIGITAL IMAGE-ANALYSIS," ANALYTICAL AND QUANTITATIVE CYTOLOGY AND HISTOLOGY, vol. 15, pp. 396-404, 1993.
Abstract:
An interactive computer system has been developed for evaluating
cytologic features derived directly from a digital scan of breast fine
needle aspirate slides. The system uses computer vision techniques to
analyze cell nuclei and classifies them using an inductive method based
on linear programming. A digital scan of selected areas of the aspirate
slide is done by a trained observer, while the analysis of the
digitized image is done by an untrained observer. When trained and
tested on 119 breast fine needle aspirates (68 benign and 51 malignant)
using leave-one-out testing, 90% correctness was achieved. These
results indicate that the method is accurate (good intraobserver and
interobserver reproducibility) and that an untrained operator can
obtain diagnostic results comparable to those achieved visually by
experienced observers.
|
|
|
1994 |
16. | CANNING, J, "A MINIMUM DESCRIPTION LENGTH MODEL FOR RECOGNIZING OBJECTS WITH VARIABLE APPEARANCES (THE VAPOR MODEL)," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 16, pp. 1032-1036, 1994.
Abstract:
Most object recognition systems can only model objects composed of
rigid pieces whose appearance depends only on lighting and viewpoint.
Many real world objects, however, have variable appearances because
they are flexible and/or have a variable number of parts. These
objects cannot be easily modeled using current techniques. We propose
the use of a knowledge representation called the VAPOR (Variable
APpearance Object Representation) model to represent objects with these
kinds of variable appearances. The VAPOR model is an idealization of
the object; all instances of the model in an image are variations from
the ideal appearance. The variations are evaluated by the description
length of the data given the model, i.e., the number of
information-theoretic bits needed to represent the model and the
deviations of the data from the ideal appearance. The shortest length
model is chosen as the best description. We demonstrate how the VAPOR
model performs in a simple domain of circles and polygons and in the
complex domain of finding cloverleaf interchanges in aerial images of
roads.
|
17. | STORVIK, G, "A BAYESIAN-APPROACH TO DYNAMIC CONTOURS THROUGH STOCHASTIC SAMPLING AND SIMULATED ANNEALING," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 16, pp. 976-986, 1994.
Abstract:
In many applications of image analysis, simply connected objects are to
be located in noisy images. During the last 5-6 years active contour
models have become popular for finding the contours of such objects.
Connected to these models are iterative algorithms for finding the
minimizing energy curves making the curves behave dynamically through
the iterations. These approaches do however have several
disadvantages. The numerical algorithms that are in use constraint the
models that can be used. Furthermore, in many cases only local minima
can be achieved.
In this paper, we discuss a method for curve detection based on a fully
Bayesian approach. A model for image contours which allows the number
of nodes on the contours to vary is introduced. Iterative algorithms
based on stochastic sampling is constructed, which make it possible to
simulate samples from the posterior distribution, making estimates and
uncertainty measures of specific quantities available. Further,
simulated annealing schemes making the curve move dynamically towards
the global minimum energy configuration are presented. In theory, no
restrictions on the models are made. In practice, however,
computational aspects must be taken into consideration when choosing
the models. Much more general models than the one used for active
contours may however be applied.
The approach is applied to ultrasound images of the left ventricle and
to Magnetic Resonance images of the human brain, and show promising
results.
|
18. | MOSHFEGHI, M, RANGANATH, S, and NAWYN, K, "3-DIMENSIONAL ELASTIC MATCHING OF VOLUMES," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 3, pp. 128-138, 1994.
Abstract:
Registering volumes that have been deformed with respect to each other
involves recovery of the deformation. A 3-D elastic matching algorithm
has been developed to use surface information for registering volumes.
Surface extraction is performed in two steps: extraction of contours in
2-D image planes using active contours, and forming triangular patch
surface models from the stack of 2-D contours. One volume is modeled as
being deformed with respect to another goal volume. Correspondences
between surfaces in the two image volumes are used to warp the deformed
volume towards its goal. This process of contour extraction, surface
formation and matching, and warping is repeated a number of times, with
decreasing image volume stiffness. As the iterations continue the
stretched volume is refined towards its goal volume. Registration
examples of deformed volumes are presented.
|
19. | WANG, Y, and LEE, O, "ACTIVE MESH - A FEATURE SEEKING AND TRACKING IMAGE SEQUENCE REPRESENTATION SCHEME," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 3, pp. 610-624, 1994.
Abstract:
This paper introduces a representation scheme for image sequences using
nonuniform samples embedded in a deformable mesh structure. It
describes a sequence by nodal positions and colors in a starting frame,
followed by nodal displacements in the following frames. The nodal
points in the mesh are more densely distributed in regions containing
interesting features such as edges and corners; and are dynamically
updated to follow the same features in successive frames. They are
determined automatically by maximizing feature (e.g, gradient)
magnitudes at nodal points, while minimizing interpolation errors
within individual elements, and matching errors between corresponding
elements. In order to avoid the mesh elements becoming overly deformed,
a penalty term is also incorporated, which measures the irregularity of
the mesh structure. The notions of shape functions and master elements
commonly used in the finite element method have been applied to
simplify the numerical calculation of the energy functions and their
gradients. The proposed representation is motivated by the active
contour or snake model proposed by Kass, Witkin, and Terzopoulos. The
current representation retains the salient merit of the original model
as a feature tracker based on local and collective information, while
facilitating more accurate image interpolation and prediction. Our
computer simulations have shown that the proposed scheme can
successfully track facial feature movements in head-and-shoulder type
of sequences, and more generally, interframe changes that can be
modeled as elastic deformation. The treatment for the starting frame
also constitutes an efficient representation of arbitrary still images.
|
20. | RUAN, S, BRUNO, A, and COATRIEUX, JL, "3-DIMENSIONAL MOTION AND RECONSTRUCTION OF CORONARY-ARTERIES FROM BIPLANE CINEANGIOGRAPHY," IMAGE AND VISION COMPUTING, vol. 12, pp. 683-689, 1994.
Abstract:
A new approach is described for reconstructing coronary arteries from
two sequences of projection images. The estimation of motion is
performed on three-dimensional line segments (or centrelines), and is
based on a 'prediction-projection-optimization' loop. The method copes
with time varying properties, deformations and superpositions of
vessels. Experiments using simulated and real data have been carried
out, and the results found to be robust over a full cycle of a human
heart. Local and global kinetic features can then be derived to obtain
a greater insight on the cardiac functional state
|
21. | DING, K, and GUNASEKARAN, S, "SHAPE FEATURE-EXTRACTION AND CLASSIFICATION OF FOOD MATERIAL USING COMPUTER VISION," TRANSACTIONS OF THE ASAE, vol. 37, pp. 1537-1545, 1994.
Abstract:
Food material shape is often closely related to its qualify. Due to the
demands of high quality, automated food shape inspection has become an
important need for the food industry. Currently, accuracy and speed are
two major problems for food shape inspection with computer vision.
Therefore, in this study, a fast and accurate computer-vision based
feature extraction and classification system was developed. In the
feature extraction stage, a statistical model based feature extractor
(SMB) and a multi-index active model-based (MAM) feature extractor were
developed to improve the accuracy of classifications. In the
classification stage, first the back-propagation neural network was
applied as a multi-index classifier. Then, to speed up training, some
minimum indeterminate zone (MIZ) classifiers were developed. Corn
kernels, almonds, and animal-shaped crackers were used to rest the
above techniques. The results showed that accuracy and speed were
greatly improved when the MAM feature extractor was used in conjunction
with the MIZ classifier.
|
22. | XU, G, SEGAWA, E, and TSUJI, S, "ROBUST ACTIVE CONTOURS WITH INSENSITIVE PARAMETERS," PATTERN RECOGNITION, vol. 27, pp. 879-884, 1994.
Abstract:
Active contours, known as snakes, have found wide applications since
their first introduction in 1987 by Kass et al. (Int. J. Comput. Vision
1, 321-331). However, one problem with the current models is that the
performance depends on proper internal parameters and initial contour
position, which, unfortunately, cannot be determined a priori. It is
usually a hard job to tune internal parameters and initial contour
position. The problem comes from the fact that the internal normal
force at each point of contour is also a function of contour shape. To
solve this problem, we propose to compensate for this internal normal
force so as to make it independent of shape. As a result, the new model
works robustly with no necessity to fine-tune internal parameters, and
can converge to high curvature points like corners.
|
23. | CARLBOM, I, TERZOPOULOS, D, and HARRIS, KM, "COMPUTER-ASSISTED REGISTRATION, SEGMENTATION, AND 3D RECONSTRUCTION FROM IMAGES OF NEURONAL TISSUE-SECTIONS," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 13, pp. 351-362, 1994.
Abstract:
Neuroscientists have studied the relationship between nerve cell
morphology and function for over a century. To pursue these studies,
they need accurate three-dimensional models of nerve cells that
facilitate detailed anatomical measurement and the identification of
internal structures. Although serial transmission electron microscopy
has been a source of such models since the mid 1960s, model
reconstruction and analysis remain very time consuming. We have
developed a new approach to reconstructing and visualizing 3D nerve
cell models from serial microscopy. An interactive system exploits
recent computer graphics and computer vision techniques to
significantly reduce the time required to build such models. The key
ingredients of the system are a digital ''blink comparator'' for
section registration, ''snakes,'' or active deformable contours, for
semiautomated cell segmentation, and voxel-based techniques for 3D
reconstruction and visualization of complex cell volumes with internal
structures.
|
24. | THIRION, JP, "DIRECT EXTRACTION OF BOUNDARIES FROM COMPUTED-TOMOGRAPHY SCANS," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 13, pp. 322-328, 1994.
Abstract:
This paper presents a method, based on the Filtered Backprojection
technique (FBP), to extract directly the boundaries of X-ray images,
without previous image reconstruction. We preprocess the raw data in
order to compute directly the reconstructed values of the gradient or
of the Laplacian at any location in the plane (defined with real
coordinates). The reconstructed value of the gradient and of the
Laplacian correspond to the exact mathematical definition of the
differentials of the image. For noisy data, we propose also to use an
extension of existing FBP techniques, adapted to the computation of the
gradient and of the Laplacian. Finally, we show how to use the
corresponding operators to perform the segmentation of a slice, without
image reconstruction. Images of the reconstructed gradient, Laplacian,
and segmented objects are presented.
|
25. | DAYANAND, S, UTTAL, WR, SHEPHERD, T, and LUNSKIS, C, "A PARTICLE SYSTEM MODEL FOR COMBINING EDGE INFORMATION FROM MULTIPLE SEGMENTATION MODULES," CVGIP-GRAPHICAL MODELS AND IMAGE PROCESSING, vol. 56, pp. 219-230, 1994.
Abstract:
A model for fusing the output of multiple segmentation modules is
presented. The model is based on the particle system approach to
modeling dynamic objects from computer graphics. The model also has
built-in capabilities to extract regions, thin the edge image, remove
''twigs,'' and close gaps in the contours. The model functions both as
an effective data fusion technique and as a model of an important human
visual process. (C) 1994 Academic Press, Inc.
|
26. | MANHAEGHE, C, LEMAHIEU, I, VOGELAERS, D, and COLARDYN, F, "AUTOMATIC INITIAL ESTIMATION OF THE LEFT-VENTRICULAR MYOCARDIAL MIDWALL IN EMISSION TOMOGRAMS USING KOHONEN MAPS," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 16, pp. 259-266, 1994.
Abstract:
A new method to make an automatic initial estimation of the position of
the middle of the left ventricular (LV) myocardial wall (LV myocardial
midwall) in emission tomograms is presented. This method eliminates the
manual interaction still required by other, more accurate LV
delineation algorithms, and which consists of indicating the LV long
axis and/or the LV extremities. A well-known algorithm from the world
of neural networks, Kohonen's self-organizing maps, was adapted to use
general shapes and to behave well for data with large background noise.
|
27. | RONFARD, R, "REGION-BASED STRATEGIES FOR ACTIVE CONTOUR MODELS," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 13, pp. 229-251, 1994.
Abstract:
The variational method has been introduced by Kass et al. (1987) in the
field of object contour modeling, as an alternative to the more
traditional edge detection-edge thinning-edge sorting sequence. Since
the method is based on a pre-processing of the image to yield an edge
map, it shares the limitations of the edge detectors it uses. In this
paper, we propose a modified variational scheme for contour modeling,
which uses no edge detection step, but local computations instead-only
around contour neighborhoods-as well as an ''anticipating'' strategy
that enhances the modeling activity of deformable contour curves. Many
of the concepts used were originally introduced to study the local
structure of discontinuity, in a theoretical and formal statement by
Leclerc & Zucker (1987), but never in a practical situation such as
this one. The first part of the paper introduces a region-based energy
criterion for active contours, and gives an examination of its
implications, as compared to the gradient edge map energy of snakes.
Then, a simplified optimization scheme is presented, accounting for
internal and external energy in separate steps. This leads to a
complete treatment, which is described in the last sections of the
paper (4 and 5). The optimization technique used here is mostly
heuristic, and is thus presented without a formal proof, but is
believed to fill a gap between snakes and other useful image
representations, such as split-and-merge regions or mixed line-labels
image fields.
|
28. | CHEN, LH, LIN, WC, and LIAO, HYM, "RECOVERY OF SUPERQUADRIC PRIMITIVE FROM STEREO IMAGES," IMAGE AND VISION COMPUTING, vol. 12, pp. 285-295, 1994.
Abstract:
This paper presents an integrated approach to recovering the
superquadric primitive from stereo images. While the depth data
obtained from stereo matching algorithms are always sparse and noisy,
to extract an object from the scene and obtain a smoothed depth map of
the object, occluding contour detection and surface reconstruction are
incorporated into the recovery process of superquadrics. The algorithm
combines the recovery processes of occluding contour, surface and
volumetric models in a cooperative and synergetic manner. The
performance of the algorithm is demonstrated with two examples using
real images.
|
29. | YOUNG, AA, IMAI, H, CHANG, CN, and AXEL, L, "2-DIMENSIONAL LEFT-VENTRICULAR DEFORMATION DURING SYSTOLE USING MAGNETIC-RESONANCE-IMAGING WITH SPATIAL MODULATION OF MAGNETIZATION," CIRCULATION, vol. 89, pp. 740-752, 1994.
Abstract:
Background Myocardial tissue tagging with the use of magnetic resonance
imaging allows noninvasive regional analysis of heart wall motion and
deformation. However, any evaluation of the effect of disease or
treatment requires a baseline reference of normal values and variation.
We studied the two-dimensional motion of material points imaged within
the left ventricular wall using spatial modulation of magnetization
(SPAMM) in 12 normal human volunteers. Methods and Results Five
parallel short-axis and five parallel long-axis slices were acquired at
five times during systole. SPAMM tags were generated at end diastole
using a 7-mm grid. Intersection point data were analyzed for
displacement, rotation, and torsion, and triangles of points were
analyzed for local rotation and principal strains. Short-axis
displacement was the least in the septum for all longitudinal levels
(P<.001). Torsion about the long axis was uniform circumferentially
because of the motion of the centroids used to reference the rotation.
In the long-axis images, the base displaced longitudinally toward the
apex, with the posterior wall moving farther than the anterior wall
(13.4+/-2.2 versus 9.7+/-1.8 mm, P<.001) in this direction. The largest
principal strain (maximum lengthening) was approximately radially
oriented in both views. In the short-axis images, the minimum principal
strain (maximum shortening) increased in magnitude toward the apex
(P<.001) with little circumferential variation, except at midventricle,
where the anterior wall showed greater contraction than the posterior
wall (-0.21+/-0.03 versus -0.19+/-0.02, P<.02). Conclusions Consistent
regional variations in deformation are seen in the normal human heart,
Displacement and maximum shortening strains are well characterized with
two-dimensional magnetic resonance tagging; however, higher-resolution
images will be required to study transmural variations.
|
30. | KOEPFLER, G, LOPEZ, C, and MOREL, JM, "A MULTISCALE ALGORITHM FOR IMAGE SEGMENTATION BY VARIATIONAL METHOD," SIAM JOURNAL ON NUMERICAL ANALYSIS, vol. 31, pp. 282-299, 1994.
Abstract:
Most segmentation algorithms are composed of several procedures: split
and merge, small region elimination, boundary smoothing,..., each
depending on several parameters. The introduction of an energy to
minimize leads to a drastic reduction of these parameters. The authors
prove that the most simple segmentation tool, the ''region merging''
algorithm, made according to the simplest energy, is enough to compute
a local energy minimum belonging to a compact class and to achieve the
job of most of the tools mentioned above. The authors explain why
''merging'' in a variational framework leads to a fast multiscale,
multichannel algorithm, with a pyramidal structure. The obtained
algorithm is O(n ln n), where n is the number of pixels of the picture.
This fast algorithm is applied to make grey level and texture
segmentation and experimental results are shown.
|
31. | CALWAY, AD, and WILSON, R, "CURVE EXTRACTION IN IMAGES USING A MULTIRESOLUTION FRAMEWORK," CVGIP-IMAGE UNDERSTANDING, vol. 59, pp. 359-366, 1994.
Abstract:
A multiresolution approach to curve extraction in images is described.
Based on a piecewise linear representation of curves, the scheme
combines an efficient method of extracting line segments with a
grouping process to identify curve traces. The line segments correspond
to linear features defined at appropriate spatial resolutions within a
quadtree structure and are extracted using a hierarchical decision
process based on frequency domain properties. Implementation is
achieved through the use of the multiresolution Fourier transform, a
linear transform providing spatially localized estimates of the
frequency spectrum over multiple scales. The scheme is simple to
implement and computationally inexpensive, and results of experiments
performed on natural images demonstrate that its performance compares
favorably with that of existing methods. (C) 1994 Academic Press, Inc.
|
32. | NELSON, RC, "FINDING LINE SEGMENTS BY STICK GROWING," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 16, pp. 519-523, 1994.
Abstract:
A method is described for extracting lineal features from an image
using extended local information to provide robustness and sensitivity.
The method utilizes both gradient magnitude and direction information,
and incorporates explicit lineal and end-stop terms. These terms are
combined nonlinearly to produce an energy landscape in which local
minima correspond to lineal features called sticks that can be
represented as line segments. A hill climbing (stick-growing) process
is used to find these minima. The method is compared to two others, and
found to have improved gap-crossing characteristics.
|
33. | OSULLIVAN, F, and QIAN, MJ, "A REGULARIZED CONTRAST STATISTIC FOR OBJECT BOUNDARY ESTIMATION - IMPLEMENTATION AND STATISTICAL EVALUATION," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 16, pp. 561-570, 1994.
Abstract:
We propose an optimization approach to the estimation of a simple
closed curve describing the boundary of an object represented in an
image. The 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 proposed. Numerical methods are developed to implement the approach,
and a set of simulation studies are carried out to quantify statistical
performance characteristics. One set of simulations models emission
computed tomography (ECT) images; a second set considers images with a
locally coherent noise pattern. In both cases, the error
characteristics are found to be quite encouraging. The approach is
highly automated, which offers some practical advantages over currently
used technologies in the medical imaging field.
|
34. | KUMAR, S, and GOLDGOF, D, "AUTOMATIC TRACKING OF SPAMM GRID AND THE ESTIMATION OF DEFORMATION PARAMETERS FROM CARDIAC MR-IMAGES," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 13, pp. 122-132, 1994.
Abstract:
In this paper, we present a new approach for the automatic tracking of
SPAMM (Spatial Modulation of Magnetization) grid in cardiac MR images
and consequent estimation of deformation parameters. The tracking is
utilized to extract grid points from MR images and to establish
correspondences between grid points in images taken at consecutive
frames. These correspondences are used with a thin plate spline model
to establish a mapping from one image to the next. This mapping is then
used for motion and deformation estimation. Spatio-temporal tracking of
SPAMM grid is achieved by using snakes-active contour models with an
associated energy functional. We present a minimizing strategy which is
suitable for tracking the SPAMM grid. By continuously minimizing their
energy functionals, the snakes lock on to and follow the in-slice
motion and deformation of the SPAMM grid. The proposed algorithm was
tested with excellent results on 123 images (three data sets each a
multiple slice 2D, 16 phase Cine study, three data sets each a multiple
slice 2D, 13 phase Cine study and three data sets each a multiple slice
2D, 12 phase Cine study).
|
35. | RAPPOPORT, A, HELOR, Y, and WERMAN, M, "INTERACTIVE DESIGN OF SMOOTH OBJECTS WITH PROBABILISTIC POINT CONSTRAINTS," ACM TRANSACTIONS ON GRAPHICS, vol. 13, pp. 156-176, 1994.
Abstract:
Point displacement constraints constitute an attractive technique for
interactive design of smooth curves, surfaces, and volumes. The user
defines an arbitrary number of ''control points'' on the object and
specifies their desired spatial location, while the system computes the
object's degrees of freedom so that the constraints are satisfied. A
constraint-based interface gives a feeling of direct manipulation of
the object. In this article we introduce soft constraints, constraints
which do not have to be met exactly. The softness of each constraint
serves as a nonisotropic, local shape parameter enabling the user to
explore the space of objects conforming to the constraints.
Additionally, there is a global shape parameter which determines the
amount of similarity of the designed object to a rest shape, or
equivalently, the rigidity of the rest shape.
We present an algorithm termed probabilistic point constraints (PPC)
for implementing soft constraints. The PPC algorithm views constraints
as stochastic measurements of the state of a static system. The
softness of a constraint is derived from the covariance of the
''measurement.'' The resulting system of probabilistic equations is
solved using the Kalman filter, a powerful estimation tool in the
theory of stochastic systems. We also describe a user interface using
direct-manipulation devices for specifying and visualizing covariances
in 2D and 3D.
The algorithm is suitable for any object represented as a parametric
blend of control points, including most spline representations. The
covariance of a constraint provides a continuous transition from exact
interpolation to controlled approximation of the constraint. The
algorithm involves only linear operations and allows real-time
interactive direct manipulation of curves and surfaces on current
workstations.
|
36. | GUNASEKARAN, S, and DING, KX, "USING COMPUTER VISION FOR FOOD QUALITY EVALUATION," FOOD TECHNOLOGY, vol. 48, pp. 151-154, 1994.
Abstract:
Image warping, often referred to as ''rubber sheeting,'' represents the
deformation of a domain image space into a range image space. In this
paper, a technique which extends the definition of a rubber-sheet
transformation to allow a polygonal region to be warped into one or
more subsets of itself, where the subsets may be multiply connected, is
described. To do this, it constructs a set of ''slits'' in the domain
image, which correspond to discontinuities and concavities in the range
image, using a technique based on generalized Voronoi diagrams. The
concept of medial axis is extended to describe inner and outer medial
contours of a polygon. Polygonal regions are decomposed into annular
subregions, and path homotopies are introduced to describe the annular
subregions. These constructions motivate the definition of a ladder,
which guides the construction of grid point pairs necessary to effect
the warp itself. (C) 1994 Academic Press, Inc.
|
37. | LANDAU, P, and SCHWARTZ, E, "SUBSET WARPING - RUBBER SHEETING WITH CUTS," CVGIP-GRAPHICAL MODELS AND IMAGE PROCESSING, vol. 56, pp. 247-266, 1994.
Abstract:
Image warping, often referred to as ''rubber sheeting,'' represents the
deformation of a domain image space into a range image space. In this
paper, a technique which extends the definition of a rubber-sheet
transformation to allow a polygonal region to be warped into one or
more subsets of itself, where the subsets may be multiply connected, is
described. To do this, it constructs a set of ''slits'' in the domain
image, which correspond to discontinuities and concavities in the range
image, using a technique based on generalized Voronoi diagrams. The
concept of medial axis is extended to describe inner and outer medial
contours of a polygon. Polygonal regions are decomposed into annular
subregions, and path homotopies are introduced to describe the annular
subregions. These constructions motivate the definition of a ladder,
which guides the construction of grid point pairs necessary to effect
the warp itself. (C) 1994 Academic Press, Inc.
|
38. | WEISS, I, "HIGH-ORDER DIFFERENTIATION FILTERS THAT WORK," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 16, pp. 734-739, 1994.
Abstract:
Reliable derivatives or digital images have always been hard to obtain,
especially (but not only) at high orders. We analyze the sources of
errors in traditional filters, such as derivatives or the Gaussian,
that are used for differentiation. We then study a class of filters
which is much more suitable for our purpose, namely filters that
preserve polynomials up to a given order. We show that the errors in
differentiation can be corrected using these filters. We derive a
condition for the validity domain of these filters, involving some
characteristics of the filter and of the shape. Our experiments show a
very good performance for smooth functions.
|
39. | YOUNG, AA, KRAMER, CM, FERRARI, VA, AXEL, L, and REICHEK, N, "3-DIMENSIONAL LEFT-VENTRICULAR DEFORMATION IN HYPERTROPHIC CARDIOMYOPATHY," CIRCULATION, vol. 90, pp. 854-867, 1994.
Abstract:
Background In hypertrophic cardiomyopathy, ejection fraction is normal
or increased, and force-length relations are reduced. However,
three-dimensional (3D) motion and deformation in vivo have not been
assessed in this condition. We have reconstructed the 3D motion of the
left ventricle (LV) during systole in 7 patients with hypertrophic
cardiomyopathy (HCM) and 12 normal volunteers by use of magnetic
resonance tagging.
Methods and Results Transmural tagging stripes were automatically
tracked to subpixel resolution with an active contour model. A 3D
finite-element model was used to interpolate displacement information
between short- and long-axis slices and register data on a regional
basis. Displacement and strain data were averaged into septal,
posterior, lateral, and anterior regions at basal, midventricular, and
apical levels. Radial motion (toward the central long axis) decreased
slightly in patients with HCM, whereas longitudinal displacement
(parallel to the long axis) of the base toward the apex was markedly
reduced: 7.5 +/- 2.5 mm (SD) versus 12.5 +/- 2.0 mm, P<.001.
Circumferential and longitudinal shortening were both reduced in the
septum (P<.01 at all levels). The principal strain associated with 3D
maximal contraction was slightly depressed in many regions,
significantly in the basal septum (-0.18 +/- 0.05 versus -0.22 +/-
0.02, P<.05) walls. In contrast, LV torsion (twist of the apex about
the long axis relative to the base) was greater in HCM patients (19.9
+/- 2.4 degrees versus 14.6 +/- 2.7 degrees, P<.01).
Conclusions HCM patients had reduced 3D myocardial shortening on a
regional basis; however, LV torsion was increased.
|
40. | FUJIMURA, K, YOKOYA, N, and YAMAMOTO, K, "MOTION ANALYSIS OF NONRIGID OBJECTS BY ACTIVE CONTOUR MODELS USING MULTISCALE IMAGES," SYSTEMS AND COMPUTERS IN JAPAN, vol. 25, pp. 81-91, 1994.
Abstract:
This paper considers the approach to dynamic image processing, which is
one of the important problems in the future medical image processing.
The tracking of the object and the analysis of the motion are discussed
for the dynamic images of a nonrigid object with smooth shape, motion
and deformation, which is the case in most medical images. This
approach is based on an active contour model defined by an energy
function in terms of both intra- and interframe constraints for the
contour of the object. The contour of the target object is extracted
and tracked by minimizing the energy function using multiscale dynamic
programming and the motion is analyzed.
The dynamic programming in multiscale proposed in this paper is to
adjust the search neighborhood of the dynamic programming according to
the scale. The coarse or fine neighborhood is defined for the coarse
and fine scales, respectively, and the energy is minimized starting
from the coarse scale and shifting to the fine scale. By this scheme, a
large motion an deformation of the object can be handled.
The proposed motion tracking method has been applied successfully to
the dynamic image in the ''behavioral analysis of a slug aiming at the
analysis of the neural mechanism of learning and memory formation in
slugs,'' as well as to dynamic echocardiographic images.
In the first application, the positive maximum of the curvature along
the contour is extracted in the motion analysis as a characteristic
point invariant to the deformation of the object. Then the shift of
that point is traced. By this approach, the rough motion of the object
can be estimated.
|
|
|
1995 |
41. | UEDA, N, and MASE, K, "TRACKING MOVING CONTOURS USING ENERGY-MINIMIZING ELASTIC CONTOUR MODELS," INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, vol. 9, pp. 465-484, 1995.
Abstract:
This paper proposes a robust method for tracking an object contour in a
sequence of images. In this method, both object extraction and tracking
problems can be solved simultaneously. Furthermore, it is applicable to
the tracking of arbitrary shapes since it does not need a priori
knowledge about the object shapes. In the contour tracking,
energy-minimizing elastic contour models are utilized, which is newly
presented in this paper. The contour tracking is formulated as an
optimization problem to find the position that minimizes both the
elastic energy of its model and the potential energy derived from the
edge potential image that includes a target object contour. We also
present an algorithm which efficiently solves energy minimization
problems within a dynamic programming framework. The algorithm enables
us to obtain optimal solution even when the variables to be optimized
are not ordered. We show the validity and usefulness of the proposed
method with some experimental results.
|
42. | FUA, P, and LECLERC, YG, "OBJECT-CENTERED SURFACE RECONSTRUCTION - COMBINING MULTIIMAGE STEREO AND SHADING," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 16, pp. 35-56, 1995.
Abstract:
Our goal is to reconstruct both the shape and reflectance properties of
surfaces from multiple images. We argue that an object-centered
representation is most appropriate for this purpose because it
naturally accommodates multiple sources of data, multiple images
(including motion sequences of a rigid object), and self-occlusions. We
then present a specific object-centered reconstruction method and its
implementation. The method begins with an initial estimate of surface
shape provided, for example, by triangulating the result of
conventional stereo. The surface shape and reflectance properties are
then iteratively adjusted to minimize an objective function that
combines information from multiple input images. The objective function
is a weighted sum of stereo, shading, and smoothness components, where
the weight varies over the surface. For example, the stereo component
is weighted more strongly where the surface projects onto highly
textured areas in the images, and less strongly otherwise. Thus, each
component has its greatest influence where its accuracy is likely to be
greatest. Experimental results on both synthetic and real images are
presented.
|
43. | BITTAR, E, TSINGOS, N, and GASCUEL, MP, "AUTOMATIC RECONSTRUCTION OF UNSTRUCTURED 3D DATA - COMBINING A MEDIAL AXIS AND IMPLICIT SURFACES," COMPUTER GRAPHICS FORUM, vol. 14, pp. C457-C468, 1995.
Abstract:
This paper presents a new method that combines a medial axis and
implicit surfaces in order to reconstruct a 3D solid from on
unstructured set of points scattered on the object's surface. The
representation produced is based on iso-surfaces generated by
skeletons, and is a particularly compact way of defining a smooth
free-form solid. The method is based on the minimisation of an energy
representing a ''distance'' between the set of data points and the
iso-surface, resembling previous reserach(19). Initialisation, however,
is more robust and efficient since there is computation of the medial
axis of the set of points. Instead of subdividing existing skeletons in
order to refine the object's surface, a new reconstruction algorithm
progressively selects skeleton-points from the precomputed medial axis
using an heuristic principle based on a ''local energy'' criterion.
This drastically speeds up the reconstruction process. Moreover, using
the medial axis allows reconstruction of objects with complex topology
and geometry, like objects that have holes and branches or that are
composed of several connected components. This process is fully
automatic. The method has been successfully applied to both synthetic
and real data.
|
44. | VELTKAMP, RC, and WESSELINK, W, "MODELING 3D CURVES OF MINIMAL ENERGY," COMPUTER GRAPHICS FORUM, vol. 14, pp. C97-C110, 1995.
Abstract:
Modeling a curve through minimizing its energy yields an overall smooth
curve. A common way to model shape features is to perform the
minimization subject to a number of interpolation constraints. This way
of modeling is attractive because the designer is not bothered with the
precise representation of the curve (e.g, control points). However,
local shape specification by means of interpolation constraints is very
limited. On the other hand, local deformation by repositioning control
points is powerful but very laborious, and destroys the minimal energy
property. In this paper, deform operators are introduced for 3D curve
modeling that have built-in energy terms that have an intuitive effect.
These operators allow local shape modification and do justice to the
energy minimization way of modeling.
|
45. | BUCK, TD, EHRICKE, HH, STRASSER, W, and THURFJELL, L, "3-D SEGMENTATION OF MEDICAL STRUCTURES BY INTEGRATION OF RAYCASTING WITH ANATOMIC KNOWLEDGE," COMPUTERS & GRAPHICS, vol. 19, pp. 441-449, 1995.
Abstract:
We present a graphically interactive procedure which is used to
register a digital anatomic brain atlas with the tomographic patient
volume. Patient structures to be segmented are outlined by local
elastic deformation of corresponding objects from the anatomy model.
This is performed in voxel space using a cost minimization procedure.
The anatomic knowledge acquired in this manner is stored in a patient
specific volume dataset and guides a raycaster with respect to the
localization of object surfaces in order to control the result of the
deformation process. Thus objects, which so far could not have been
segmented appropriately or only after tedious manual editing efforts,
become accessible by physicians. We present several results
demonstrating the high quality and practicality of the method.
|
46. | KISWORO, M, VENKATESH, S, and WEST, GAW, "DETECTION OF CURVED EDGES AT SUBPIXEL ACCURACY USING DEFORMABLE MODELS," IEE PROCEEDINGS-VISION IMAGE AND SIGNAL PROCESSING, vol. 142, pp. 304-312, 1995.
Abstract:
One approach to the detection of curves at subpixel accuracy involves
the reconstruction of such features from subpixel edge data points. A
new technique is presented for reconstructing and segmenting curves
with subpixel accuracy using deformable models. A curve is represented
as a set of interconnected Hermite splines forming a snake generated
from the subpixel edge information that minimises the global energy
functional integral over the set. While previous work on the
minimisation was mostly based on the Euler-Lagrange transformation, the
authors use the finite element method to solve the energy minimisation
equation. The advantages of this approach over the Euler-Lagrange
transformation approach are that the method is straightforward, leads
to positive m-diagonal symmetric matrices, and has the ability to cope
with irregular geometries such as junctions and corners. The energy
functional integral solved using this method can also be used to
segment the features by searching for the location of the maxima of the
first derivative of the energy over the elementary curve set.
|
47. | Kuszyk, BS, Ney, DR, and Fishman, EK, "The current state of the art in three dimensional oncologic imaging: An overview," INTERNATIONAL JOURNAL OF RADIATION ONCOLOGY BIOLOGY PHYSICS, vol. 33, pp. 1029-1039, 1995.
Abstract:
To provide an overview of the methods and clinical applications of
three dimensional (3D) medical imaging in the oncologic patient.
Methods and Materials: We briefly outline the techniques currently used
to create 3D medical images with an emphasis on their strengths and
shortcomings as they relate to oncologic imaging and radiation therapy
planning, We then discuss some of the most important and promising
oncologic applications of 3D imaging and suggest likely future
directions in this rapidly developing field.
Results: Since the first application of 3D techniques to medical data
over a decade ago, 3D medical images have evolved from relatively crude
representations of musculoskeletal abnormalities to detailed and
accurate representations of a variety of soft tissue, vascular, and
oncologic pathology. The rapid development of both computer hardware
and software coupled with the application of 3D techniques to a variety
of imaging modalities have expanded the clinical applications of this
technology dramatically.
Conclusions: 3D medical images are clinically practical tools for
oncologic evaluation and effective radiation therapy planning.
|
48. | Broggi, A, and Berte, S, "Vision-based road detection in automotive systems: A real-time expectation-driven approach," JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, vol. 3, pp. 325-348, 1995.
Abstract:
The main aim of this work is the development of a vision-based road
detection system fast enough to cope with the difficult real-time
constraints imposed by moving vehicle applications. The hardware
platform, a special-purpose massively parallel system, has been chosen
to minimize system production and operational costs.
This paper presents a novel approach to expectation-driven low-level
image segmentation, which can be mapped naturally onto mesh-connected
massively parallel SIMD architectures capable of handling hierarchical
data structures. The input image is assumed to contain a distorted
version of a given template; a multiresolution stretching process is
used to reshape the original template in accordance with the acquired
image content, minimizing a potential function. The distorted template
is the process output.
|
49. | KRAITCHMAN, DL, YOUNG, AA, CHANG, CN, and AXEL, L, "SEMIAUTOMATIC TRACKING OF MYOCARDIAL MOTION IN MR TAGGED IMAGES," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 14, pp. 422-433, 1995.
Abstract:
Tissue tagging using magnetic resonance (MR) imaging has enabled
quantitative noninvasive analysis of motion and deformation in vivo.
One method for MR tissue tagging is Spatial Modulation of Magnetization
(SPAMM), Manual detection and tracking of tissue tags by visual
inspection remains a time-consuming and tedious process. We have
developed an interactively guided semi-automated method of detecting
and tracking tag intersections in cardiac MR images, A template
matching approach combined with a novel adaptation of active contour
modeling permits rapid analysis of MR images. We have validated our
technique using MR SPAMM images of a silicone gel phantom with
controlled deformations. Average discrepancy between theoretically
predicted and semi-automatically selected tag intersections was 0.30 mm
+/- 0.17 [mean +/- SD, NS (P < 0.05)]. Cardiac SPAMM images of normal
volunteers and diseased patients also have been evaluated using our
technique.
|
50. | MARCHANT, JA, and ONYANGO, CM, "FITTING GREY LEVEL POINT DISTRIBUTION MODELS TO ANIMALS IN SCENES," IMAGE AND VISION COMPUTING, vol. 13, pp. 3-12, 1995.
Abstract:
Point distribution models allow a compact description of an object's
shape to be found from a set of example images. In previous work by
the first author, a method of incorporating grey level information into
a PDM was developed. This paper investigates fitting such a composite
model to image data consisting of a set of images of a pig viewed from
above. Model fitting is achieved by optimizing an objective function
consisting of two components, one that measures the degree of grey
level correspondence between the model and the data, and the other that
measures how well the boundary of the model fits the data. The shape
of the objective function as the model parameters are varied is
investigated, and an optimization strategy developed. The strategy is
used to find a pig in a number of images with backgrounds of increasing
complexity. The strategy performs well with both an uncluttered and a
realistic background. The performance with a simulated noisy
background is not so good when the boundary component is included in
the objective function. This is a result of the boundary component
being more sensitive to noise in the image. In this case, it is better
to optimize with the grey level component alone. A problem is
identified when the grey level distribution changes significantly as
the pig moves under the light source. It is suggested that this could
be overcome by including variations in grey level distribution as modes
in the model.
|
51. | DELANGES, P, BENOIS, J, and BARBA, D, "ACTIVE CONTOURS APPROACH TO OBJECT TRACKING IN IMAGE SEQUENCES WITH COMPLEX BACKGROUND," PATTERN RECOGNITION LETTERS, vol. 16, pp. 171-178, 1995.
Abstract:
Active contour models (''snakes'') are a powerful tool for deformable
object tracking in moving images. But the existing snake models are
not well-adapted for tracking corners and objects on a complex
background. In this paper, we present a novel active contour model,
the ''Adjustable Polygons'', which is a set of active segments that can
fit any object shape (including corners). A new energy based on
textural characteristics of objects is also proposed, in order to
resolve conflict situations while tracking objects on multiple contour
background.
|
52. | DAVATZIKOS, CA, and PRINCE, JL, "AN ACTIVE CONTOUR MODEL FOR MAPPING THE CORTEX," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 14, pp. 65-80, 1995.
Abstract:
A new active contour model for finding and mapping the outer cortex in
brain images is developed, A cross-section of the brain cortex is
modeled as a ribbon, and a constant speed mapping of its spine is
sought. A variational formulation, an associated force balance
condition, and a numerical approach are proposed to achieve this goal,
The primary difference between this formulation and that of snakes is
in the specification of the external force acting on the active
contour. A study of the uniqueness and fidelity of solutions is made
through convexity and frequency domain analyses, and a criterion for
selection of the regularization coefficient is developed. Examples
demonstrating the performance of this method on simulated and real data
are provided.
|
53. | ASHTON, EA, BERG, MJ, PARKER, KJ, WEISBERG, J, CHEN, CW, and KETONEN, L, "SEGMENTATION AND FEATURE-EXTRACTION TECHNIQUES, WITH APPLICATIONS TO MRI HEAD STUDIES," MAGNETIC RESONANCE IN MEDICINE, vol. 33, pp. 670-677, 1995.
Abstract:
To obtain a three-dimensional reconstruction of the hippocampus from a
volumetric MRI head study, it is necessary to separate that structure
not only from the surrounding white matter, but also from contiguous
areas of gray matter-the amygdala and cerebral cortex. At present it is
necessary for a physician to manually segment the hippocampus on each
slice of the volume to obtain such a reconstruction. This process is
time consuming, and is subject to inter- and intra-operator variation
as well as large discontinuities between slices. We propose a novel
technique, making use of a combination of gray scale and edge-detection
algorithms and some a priori knowledge, by which a computer may make an
unsupervised identification of a given structure through a series of
contiguous images. This technique is applicable even if the structure
includes so-called false contours or missing contours. Applications
include three-dimensional reconstruction of difficult-to-segment
regions of the brain, and volumetric measurements of structures from
series of two-dimensional images.
|
54. | WOLBERG, WH, STREET, WN, and MANGASARIAN, OL, "IMAGE-ANALYSIS AND MACHINE LEARNING APPLIED TO BREAST-CANCER DIAGNOSIS AND PROGNOSIS," ANALYTICAL AND QUANTITATIVE CYTOLOGY AND HISTOLOGY, vol. 17, pp. 77-87, 1995.
Abstract:
Fine needle aspiration (FNA) accuracy is limited by, among other
factors, the subjective interpretation of the aspirate. We have
increased breast FNA accuracy by coupling digital image analysis
methods with machine learning techniques. Additionally, our
mathematical approach captures nuclear features (''grade'') that are
prognostically more accurate than are estimates based on tumor size and
lymph node status. An interactive computer system evaluates, diagnoses
and determines prognosis based on nuclear features derived directly
from a digital scan of FNA slides. A consecutive series of 569 patients
provided the data for the diagnostic study. A 166-patient subset
provided the data for the prognostic study. An additional 75
consecutive, new patients provided samples to test the diagnostic
system. The projected prospective accuracy of the diagnostic system was
estimated to be 97% by 10-fold cross-validation, and the actual
accuracy on 75 new samples runs 100%. The projected prospective
accuracy of the prognostic system was estimated to be 86% by
leave-one-out testing.
|
55. | NOBLE, JA, "FROM INSPECTION TO PROCESS UNDERSTANDING AND MONITORING - A VIEW ON COMPUTER VISION IN MANUFACTURING," IMAGE AND VISION COMPUTING, vol. 13, pp. 197-214, 1995.
Abstract:
We describe some of the current challenges in developing and validating
computer vision algorithms for manufacturing applications. We focus on
the general theme of template-based processing, where geometric
templates provide a basis for local feature analysis, registration and
recognition (via constraint-based modelling) and model adaptation using
statistical methods. We describe recent successful applications of
template-based techniques in the areas of manufacturing part inspection
and process understanding and monitoring. We also examine the question
'Why are there so few computer vision applications in manufacturing?'
We suggest that two of the major bottlenecks remain speed of algorithm
development and how to validate algorithm performance with a limited
data set. Finally, we identify some of what we see as emerging and
future potential application areas of computer vision methods in
manufacturing, where the current trend is to provide tools for
continuous product improvement rather than (final) product inspection,
and 3D measurement capabilities.
|
56. | Bothe, HH, and vonBotticher, N, "Key-picture selection for the analysis of visual speech with fuzzy methods," ADVANCES IN INTELLIGENT COMPUTING - IPMU '94, LECTURE NOTES IN COMPUTER SCIENCE, vol. 945, pp. 577-583, 1995.
Abstract:
The goal of the described work is to model visual articulation
movements of prototypic speakers with respect to custom-made text A
language-wide extension of the motion model leads to a visible speech
synthesis and further more to an artificial computer trainer for
speechreading. The developed model is based on a set of specific video
key-pictures and the interpolation of interim pictures. The key-picture
selection is realized by a fuzzy-c-means classification algorithm.
|
57. | AYACHE, N, "MEDICAL COMPUTER VISION, VIRTUAL-REALITY AND ROBOTICS," IMAGE AND VISION COMPUTING, vol. 13, pp. 295-313, 1995.
Abstract:
The automated analysis of 3D medical images can improve both diagnosis
and therapy significantly. This automation raises a number of new
fascinating research problems in the fields of computer vision,
graphics and robotics. In this paper, I propose a list of such problems
after a review of the current major 3D imaging modalities, and a
description of the related medical needs. I then present some of the
past and current work done in our research group EPIDAURE* at INRIA, on
the following topics: segmentation of 3D images; 3D shape modelling; 3D
rigid and nonrigid registration; 3D motion analysis; and 3D simulation
of therapy. Most topics are discussed in a synthetic manner, and
illustrated by results. Rigid matching is treated more thoroughly as an
illustration of a transfer from computer vision towards 3D image
processing. The later topics are illustrated by preliminary results,
and a number of promising research tracks are suggested.
|
58. | SCHWARZINGER, M, NOLL, D, and VONSEELEN, W, "OBJECT RECOGNITION WITH CONSTRAINED ELASTIC MODELS," MATHEMATICAL AND COMPUTER MODELLING, vol. 22, pp. 163-184, 1995.
Abstract:
We present a model-based method for object identification in images of
natural scenes. It has successfully been implemented for the
classification of cars based on their rear view. In a first step,
characteristic features such as lines and corners are detected within
the image. Generic models of object-classes, described by the same set
of features, are stored in a database. Each model represents a whole
class of objects (e.g., passenger cars, vans, big trucks). In a
preprocessing stage, the most probable object is selected by means of a
corner-feature based Hough transform. This transformation also suggests
the position and scale of the object in the image. Guided by similarity
measures, the model is then aligned with image features using a
matching algorithm based on the elastic net technique [1]. During this
iterative process, the model is allowed to undergo changes in scale,
position and certain deformations. Deformations are kept within limits
such that one model can fit to all objects belonging to the same class,
but not to objects of other classes. In each iteration step, quantities
to assess the matching process are obtained.
|
59. | GOSHTASBY, A, and TURNER, DA, "SEGMENTATION OF CARDIAC CINE MR-IMAGES FOR EXTRACTION OF RIGHT AND LEFT-VENTRICULAR CHAMBERS," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 14, pp. 56-64, 1995.
Abstract:
A two-stage algorithm for extraction of the ventricular chambers
(endocardial surfaces) in flow-enhanced magnetic resonance images is
described, In the first stage, the approximate locations and sizes of
the endocardial surfaces are determined by intensity thresholding. In
the second stage, points on each approximated surface are repositioned
to nearest locally maximum gradient magnitude points and a generalized
cylinder is fitted to them, Examples of ventricular chambers in cine MR
images determined by this algorithm are presented.
|
60. | HOWARTH, R, "INTERPRETING A DYNAMIC AND UNCERTAIN WORLD - HIGH-LEVEL VISION," ARTIFICIAL INTELLIGENCE REVIEW, vol. 9, pp. 37-63, 1995.
Abstract:
When interpreting a dynamic and uncertain world it is important to have
a high-level vision component that can guide the reasoning of the whole
vision system. This guidance is provided by an attentional mechanism
that exploits knowledge of the specific problem being solved. Here we
survey work relevant to the development of such an attentional
mechanism, using surveillance as an application domain to tie together
issues of spatial representation, events, behaviour, control and
planning. The paper culminates in a brief description of HIVIS-WATCHER
a program that makes use of all these areas.
|
61. | SCLAROFF, S, and PENTLAND, AP, "MODAL MATCHING FOR CORRESPONDENCE AND RECOGNITION," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 17, pp. 545-561, 1995.
Abstract:
Modal matching is a new method for establishing correspondences and
computing canonical descriptions, The method is based on the idea of
describing objects in terms of generalized symmetries, as defined by
each object's eigenmodes. The resulting modal description is used for
object recognition and categorization, where shape similarities are
expressed as the amounts of modal deformation energy needed to align
the two objects, In general, modes provide a global-to-local ordering
of shape deformation and thus allow for selecting which types of
deformations are used in object alignment and comparison, In contrast
to previous techniques, which required correspondence to be computed
with an initial or prototype shape, modal matching utilizes a new type
of finite element formulation that allows for an object's eigenmodes to
be computed directly from available image information, This improved
formulation provides greater generality and accuracy, and is applicable
to data of any dimensionality, Correspondence results with 2D contour
and point feature data are shown, and recognition experiments with 2D
images of hand tools and airplanes are described.
|
62. | GOSHTASBY, A, and SHYU, HL, "EDGE-DETECTION BY CURVE-FITTING," IMAGE AND VISION COMPUTING, vol. 13, pp. 169-177, 1995.
Abstract:
Edge detection is formulated as a curve fitting problem. First,
high-gradient pixels are grouped into elongated regions and then a
curve is fitted to each. The curve fitting method used in this work
does not require solving a system of equations, and therefore is fast.
Examples of edge detection by curve fitting on synthetic and real
images are presented, and results obtained are compared with those
determined by the Laplacian of Gaussian operator.
|
63. | WOLBERG, WH, STREET, WN, HEISEY, DM, and MANGASARIAN, OL, "COMPUTERIZED BREAST-CANCER DIAGNOSIS AND PROGNOSIS FROM FINE-NEEDLE ASPIRATES," ARCHIVES OF SURGERY, vol. 130, pp. 511-516, 1995.
Abstract:
Objective: To use digital image analysis and machine learning to (1)
improve breast mass diagnosis based on fine-needle aspirates and (2)
improve breast cancer prognostic estimations.
Design: An interactive computer system evaluates, diagnoses, and
determines prognosis based on cytologic features derived from a digital
scan of fine-needle aspirate slides.
Setting: The University of Wisconsin (Madison) Departments of Computer
Science and Surgery and the University of Wisconsin Hospital and
Clinics.
Patients: Five hundred sixty-nine consecutive patients (212 with cancer
and 357 with benign masses) provided the data for the diagnostic
algorithm, and an additional 118 (31 with malignant masses and 87 with
benign masses) consecutive, new patients tested the algorithm. One
hundred ninety of these patients with invasive cancer and without
distant metastases were used for prognosis.
Interventions: Surgical biopsy specimens were taken from all cancers
and some benign masses. The remaining cytologically benign masses were
followed up for a year and surgical biopsy specimens were taken if they
changed in size or character. Patients with cancer received standard
treatment.
Outcome Measures: Cross validation was used to project the accuracy of
the diagnostic algorithm and to determine the importance of prognostic
features. In addition, the mean errors were calculated between the
actual times of distant disease occurrence and the times predicted
using various prognostic features. Statistical analyses were also done.
Results The predicted diagnostic accuracy was 97% and the actual
diagnostic accuracy on 118 new samples was 100%. Tumor size and lymph
node status were weak prognosticators compared with nuclear features,
in particular those measuring nuclear size. Compared with the actual
time for recurrence, the mean error of predicted times for recurrence
with the nuclear features was 17.9 months and was 20.1 months with
tumor size and lymph node status (P=.11).
Conclusion: Computer technology will improve breast fine-needle
aspirate accuracy and prognostic estimations.
|
64. | LUNDERVOLD, A, and STORVIK, G, "SEGMENTATION OF BRAIN PARENCHYMA AND CEREBROSPINAL-FLUID IN MULTISPECTRAL MAGNETIC-RESONANCE IMAGES," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 14, pp. 339-349, 1995.
Abstract:
This paper presents a new method to segment brain parenchyma and
cerebrospinal fluid spaces automatically in routine axial spin echo
multispectral MR images. The algorithm simultaneously incorporates
information about anatomical boundaries (shape) and tissue signature
(grey scale) using a priori knowledge. The head and brain are divided
into four regions and seven different tissue types. Each tissue type c
is modeled by a multivariate Gaussian distribution N(mu(c), Sigma(c)).
Each region is associated with a finite mixture density corresponding
to its constituent tissue types, Initial estimates of tissue parameters
{mu(c), Sigma(c)}(c=1,...,7) are obtained from L-means clustering of a
single slice used for training. The first algorithmic step uses the
EM-algorithm for adjusting the initial tissue parameter estimates to
the MR data of new patients, The second step uses a recently developed
model of dynamic contours to detect three simply closed nonintersecting
curves in the plane, constituting the arachnoid/dura mater boundary of
the brain, the border between the subarachnoid space and brain
parenchyma, and the inner border of the parenchyma toward the lateral
ventricles, The model, which is formulated by energy functions in a
Bayesian framework, incorporates a priori knowledge, smoothness
constraints, and updated tissue type parameters, Satisfactory maximum a
posteriori probability estimates of the closed contour curves defined
by the model were found using simulated annealing.
|
65. | ONYANGO, CM, MARCHANT, JA, and RUFF, BP, "MODEL-BASED LOCATION OF PIGS IN SCENES," COMPUTERS AND ELECTRONICS IN AGRICULTURE, vol. 12, pp. 261-273, 1995.
Abstract:
Point distribution models (PDMs) allow a compact description of an
object's shape to be found from a set of example images. In previous
work by the second author a method of incorporating grey level
information into a PDM was developed. Further work investigated fitting
such a composite model to image data consisting of a set of images of a
pig viewed from above. This paper describes work on images containing
more than one pig.
A technique for initialising the model is used which searches the image
for ridges in the grey level landscape. These generally lie along the
backbone of the animal and provide a good starting point for automatic
fitting. By minimising an objective function which measures the
difference in grey level and the error in boundary correspondence, an
accurate fit of model to data is obtained.
Ridge detection initialises the model to within +/-12 pixels of the
object. Strict limits on the boundaries of the search space constrain
the minimisation process allowing convergence to the true minimum. The
resulting fit is good even for objects which are partially obscured.
Poor final values of the objective function allow the detection of
erroneous results.
|
66. | HERAULT, L, and HORAUD, R, "SMOOTH CURVE EXTRACTION BY MEAN-FIELD ANNEALING," ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, vol. 13, pp. 281-300, 1995.
Abstract:
In this paper, we attack the figure-ground discrimination problem from
a combinatorial optimization perspective. In general, the solutions
proposed in the past solved this problem only partially: either the
mathematical model encoding the figure-ground problem was too simple or
the optimization methods that were used were not efficient enough or
they could not guarantee to find the global minimum of the cost
function describing the figure-ground model. The method that we devised
and which is described in this paper is tailored around the following
contributions. First, we suggest a mathematical model encoding the
figure-ground discrimination problem that makes explicit a definition
of shape (or figure) based on cocircularity, smoothness, proximity, and
contrast. This model consists of building a cost function on the basis
of image element interactions. Moreover, this cost function fits the
constraints of an interacting spin system, which in turn is a well
suited physical model to solve hard combinatorial optimization
problems. Second, we suggest a combinatorial optimization method for
solving the figure-ground problem, namely mean field annealing which
combines the mean field approximation and annealing. Mean field
annealing may well be viewed as a deterministic approximation of
stochastic methods such as simulated annealing. We describe in detail
the theoretical bases of this method, derive a computational model, and
provide a practical algorithm. Finally, some experimental results are
shown for both synthetic and real images.
|
67. | YAMAMOTO, K, "OPTIMIZATION APPROACHES TO CONSTRAINT SATISFACTION PROBLEMS IN COMPUTER VISION," IMAGE AND VISION COMPUTING, vol. 13, pp. 335-340, 1995.
Abstract:
This paper describes several new image understanding methods based on
parallel operation. There are several constraint satisfaction
approaches using an energy minimization. We show how we reconstruct
three-dimensional surfaces from contours without elevation data and
sparse points of known elevation data using this approach. We also
introduce Active Net using this approach, and apply this model to
segmentation and binocular stereo matching. We experimented with these
energy minimization approaches to solve the problems of early and
intermediate levels of computer vision, and show some of the results of
our recent research.
|
68. | VIEREN, C, CABESTAING, F, and POSTAIRE, JG, "CATCHING MOVING-OBJECTS WITH SNAKES FOR MOTION TRACKING," PATTERN RECOGNITION LETTERS, vol. 16, pp. 679-685, 1995.
Abstract:
We propose an efficient method for tracking several objects moving
through a sequence of monocular images against a non-uniform
background. Each object entering the scene is intercepted by an active
contour model which locks on it as long as it moves in the scene. The
procedure does not necessitate an interactive initialization. Some
results are presented in case of real traffic scenes.
|
69. | PARVIN, BA, PENG, C, JOHNSTON, W, and MAESTRE, FM, "TRACKING OF TUBULAR MOLECULES FOR SCIENTIFIC APPLICATIONS," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 17, pp. 800-805, 1995.
Abstract:
In this paper, we present a system for detection and tracking of
tubular molecules in images. The automatic detection and
characterization of the shape, location, and motion of these molecules
can enable new laboratory protocols in several scientific disciplines.
The uniqueness of the proposed system is twofold: At the macro level,
the novelty of the system lies in the integration of object
localization and tracking using geometric properties; at the micro
level, in the use of high and low level constraints to model the
detection and tracking subsystem. The underlying philosophy for object
detection is to extract perceptually significant features from the
pixel level image, and then use these high level cues to refine the
precise boundaries. In the case of tubular molecules, the perceptually
significant features are antiparallel line segments or, equivalently,
their axis of symmetries. The axis of symmetry infers a coarse
description of the object in terms of a bounding polygon. The polygon
then provides the necessary boundary condition for the refine ment
process, which is based on dynamic programming. For tracking the object
in a time sequence of images, the refined contour is then projected
onto each consecutive frame.
|
70. | WESSELINK, W, and VELTKAMP, RC, "INTERACTIVE DESIGN OF CONSTRAINED VARIATIONAL CURVES," COMPUTER AIDED GEOMETRIC DESIGN, vol. 12, pp. 533-546, 1995.
Abstract:
A constrained variational curve is a curve that minimizes some energy
functional under certain interpolation constraints. Modeling curves
using constrained variational principles is attractive, because the
designer is not bothered with the precise representation of the curve
(e.g. control points). Until now, the modeling of variational curves is
mainly done by means of constraints. If such a curve of least energy is
deformed locally (e.g, by moving its control points) the concept of
energy minimization is lost. In this paper we introduce deform
operators with built-in energy terms. We have tested our ideas in a
prototype system for modeling uniform B-spline curves. Through the use
of widgets, the user can interactively modify the range of influence
and other properties of the operators. Experiments show that these
operators offer a very intuitive way of modeling.
|
71. | PEARSON, DE, "DEVELOPMENTS IN MODEL-BASED VIDEO CODING," PROCEEDINGS OF THE IEEE, vol. 83, pp. 892-906, 1995.
Abstract:
This paper reports on current developments in the area of model-based
video coding, a technique which shows promise of achieving very, large
bit-rate reductions for moving images. After an introduction and
historical review, advances are summarized in several areas, among them
improved 3D tracking of the human head and of facial expressions, the
use of muscle-driven model animation with skin synthesis, techniques
for luminance compensation, and switched coders. Bit rates ranging from
64 kb/s down to about 1 kb/s have been obtained using head-and-shoulder
video sequences. Problems with model-based methods are identified and
future developments in both CBR and VER transmission discussed.
|
72. | SNELL, JW, MERICKEL, MB, ORTEGA, JM, GOBLE, JC, BROOKEMAN, JR, and KASSELL, NF, "MODEL-BASED BOUNDARY ESTIMATION OF COMPLEX OBJECTS USING HIERARCHICAL ACTIVE SURFACE TEMPLATES," PATTERN RECOGNITION, vol. 28, pp. 1599-1609, 1995.
Abstract:
A method for the segmentation of complex, three-dimensional objects
using hierarchical active surface templates is presented. The templates
consist of one or more active surface models which are specified
according to a priori knowledge about the expected shape and location
of the desired object. This allows complex objects to be naturally
modeled as collections of simple subparts which are geometrically
constrained. The template is adaptively deformed by the
three-dimensional image data in which it is initialized such that the
template boundaries are brought into correspondence with the assumed
image object. An external energy field is developed based on a vector
distance transform such that the surfaces are deformed according to
object shape. The method is demonstrated by the segmentation of the
human brain from three-dimensional magnetic resonance images of the
head given an a priori model of a normal brain.
|
73. | Wong, WH, and Ip, HHS, "Force-driven optimization for correspondence establishment," IMAGE ANALYSIS APPLICATIONS AND COMPUTER GRAPHICS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1024, pp. 43-50, 1995.
Abstract:
Correspondence establishment has been a difficult problem in machine
vision. In this paper, we present an optimization technique for the
task. The geometric constraints to the solution are formulated as
forces, which are combined to provide clue for mapping between two sets
of points such that the geometric constraints are best satisfied. The
strong point of this method is that it is easy to integrate several
sources of information to obtain a solution while keeping the decision
simple, and does not suffer from the uncontrollable flexibility as in
active contour models. We illustrate the method with the problem of
establishing correspondence between parallel curves.
|
74. | KIMIA, BB, TANNENBAUM, AR, and ZUCKER, SW, "SHAPES, SHOCKS, AND DEFORMATIONS .1. THE COMPONENTS OF 2-DIMENSIONAL SHAPE AND THE REACTION-DIFFUSION SPACE," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 15, pp. 189-224, 1995.
Abstract:
We undertake to develop a general theory of two-dimensional shape by
elucidating several principles which any such theory should meet. The
principles are organized around two basic intuitions: first, if a
boundary were changed only slightly, then, in general, its shape would
change only slightly. This leads us to propose an operational theory of
shape based on incremental contour deformations. The second intuition
is that not all contours are shapes, but rather only those that can
enclose ''physical'' material. A theory of contour deformation is
derived from these principles, based on abstract conservation
principles and Hamilton-Jacobi theory. These principles are based on
the work of Sethian (1985a, c), the Osher-Sethian (1988), level set
formulation the classical shock theory of Lax (1971; 1973), as well as
curve evolution theory for a curve evolving as a function of the
curvature and the relation to geometric smoothing of
Gage-Hamilton-Grayson (1986; 1989). The result is a characterization of
the computational elements of shape: deformations, parts, bends, and
seeds, which show where to place the components of a shape. The theory
unifies many of the diverse aspects of shapes, and leads to a space of
shapes (the reaction/diffusion space), which places shapes within a
neighborhood of ''similar'' ones. Such similarity relationships
underlie descriptions suitable for recognition.
|
75. | WOLBERG, WH, STREET, WN, HEISEY, DM, and MANGASARIAN, OL, "COMPUTER-DERIVED NUCLEAR GRADE AND BREAST-CANCER PROGNOSIS," ANALYTICAL AND QUANTITATIVE CYTOLOGY AND HISTOLOGY, vol. 17, pp. 257-264, 1995.
Abstract:
Visual assessments of nuclear grade are subjective yet still
prognostically important. Now, computer-based analytical techniques can
objectively and accurately measure size, shape and texture features,
which constitute nuclear grade. The cell samples used in this study
were obtained by fine needle aspiration (FNA) during the diagnosis of
187 consecutive patients with invasive breast cancer. Regions of FNA
preparations to be analyzed were digitized and displayed on a computer
monitor. Nuclei to be analyzed were roughly outlined by an operator
using a mouse. Next, the computer generated a ''snake'' that precisely
enclosed each designated nucleus. Ten nuclear features were then
calculated for each nucleus based on these snakes. These results were
analyzed statistically and by an inductive machine learning technique
that we developed and call ''recurrence surface approximation'' (RSA).
Both the statistical and RSA machine learning analyses demonstrated
that computer-derived nuclear features are prognostically move
important than are the classic prognostic features, tumor size and
lymph node status.
|
76. | PANKANTI, S, and JAIN, AK, "INTEGRATING VISION MODULES - STEREO, SHADING, GROUPING, AND LINE LABELING," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 17, pp. 831-842, 1995.
Abstract:
It is generally agreed that individual visual cues are fallible and
often ambiguous. This has generated a lot of interest in design of
integrated vision systems which are expected to give a reliable
performance in practical situations. The design of such systems is
challenging since each vision module works under a different and
possibly conflicting set of assumptions. We have proposed and
implemented a multiresolution system which integrates perceptual
organization (grouping), segmentation, stereo, shape from shading, and
line labeling modules. We demonstrate the efficacy of our approach
using images of several different realistic scenes. The output of the
integrated system is shown to be insensitive to the constraints imposed
by the individual modules. The numerical accuracy of the recovered
depth is assessed in case of synthetically generated data. Finally, we
have qualitatively evaluated our approach by reconstructing geons from
the depth data obtained from the integrated system. These results
indicate that integrated vision systems are likely to produce better
reconstruction of the input scene than the individual modules.
|
77. | YOUNG, AA, KRAITCHMAN, DL, DOUGHERTY, L, and AXEL, L, "TRACKING AND FINITE-ELEMENT ANALYSIS OF STRIPE DEFORMATION IN MAGNETIC-RESONANCE TAGGING," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 14, pp. 413-421, 1995.
Abstract:
Magnetic resonance tissue tagging allows noninvasive in vivo
measurement of soft tissue deformation, Planes of magnetic saturation
are created, orthogonal to the imaging plane, which form dark lines
(stripes) in the image, We describe a method for tracking stripe motion
in the image plane, and show how this information can be incorporated
into a finite element model of the underlying deformation, Human heart
data were acquired from several imaging planes in different
orientations and were combined using a deformable model of the left
ventricle wall, Each tracked stripe point provided information on
displacement orthogonal to the original tagging plane, i.e., a
one-dimensional (1-D) constraint on the motion, Three-dimensional (3-D)
motion and deformation was then reconstructed by fitting the model to
the data constraints by linear least squares, The average root mean
squared (rms) error between tracked stripe points and predicted model
locations was 0.47 mm (n = 3100 points). In order to validate this
method and quantify the errors involved, we applied it to images of a
silicone gel phantom subjected to a known, well-controlled, 3-D
deformation. The finite element strains obtained were compared to an
analytic model of the deformation known to be accurate in the central
axial plane of the phantom, The average rms errors were 6% in both the
reconstructed shear strains and 16% in the reconstructed radial normal
strain.
|
|
|
1996 |
78. | Nakajima, C, and Yazawa, T, "A recognition method of facility drawings and street maps utilizing the facility management database," IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, vol. E79D, pp. 555-560, 1996.
Abstract:
This paper proposes a new approach for inputting handwritten
Distribution Facility Drawings (DFD) and their maps into a computer
automatically by using the Facility Management Database (FMD). Our
recognition method makes use of external information for drawing/map
recognition. It identifies each electric-pole symbol and support cable
symbol on drawings simply by consulting the FMD. Other symbols such as
transformers and electric wires can be placed on drawings
automatically. In this positioning of graphic symbols, we present an
automatic adjustment method of a symbol's position on the latest
digital maps. When a contradiction is unsolved due to an inconsistency
between the content of the DFD and the FMD, the system requests a
manual feedback from the operator. Furthermore, it uses the
distribution network of the DFD to recognize the street lines on the
maps which aren't computerized. This can drastically reduce the cost
for computerizing drawings and maps.
|
79. | Cohen, I, and Cohen, LD, "A hybrid hyperquadric model for 2-D and 3-D data fitting," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 63, pp. 527-541, 1996.
Abstract:
We present in this paper a new curve and surface implicit model. This
implicit model is based on hyperquadrics and allows a local and global
control of the shape and a wide variety of allowable shapes. We define
a hybrid hyperquadric model by introducing implicitly some local
properties on a global shape model. The advantage of our model is that
it describes global and local properties through a unique implicit
equation, yielding a representation of the shape by means of its
parameters, independently of the chosen numerical resolution. The data
fitting is obtained through the minimization of energy, modeling the
attraction to data independently of the implicit description of the
shape, After studying the geometry of hyperquadrics and how the shape
deforms when we modify slightly its implicit equation, we are able to
define an algorithm for automatic refining of the fit by adding an
adequate term to the implicit representation, This geometric approach
malt:es possible an efficient description of the data points and an
automatic tuning of the fit according to the desired accuracy. (C) 1996
Academic Press, Inc.
|
80. | Qian, RJ, and Huang, TS, "Optimal edge detection in two-dimensional images," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 5, pp. 1215-1220, 1996.
Abstract:
This paper presents a new edge detection scheme that detects
two-dimensional (2-D) edges by a curve-segment-based detection
functional guided by the zero-crossing contours of the
Laplacian-of-Gaussian (LOG) to approach the true edge locations. The
detection functional is shown to be optimal in terms of signal-to-noise
ratio (SNR) and edge localization accuracy; it also preserves the nice
scaling property held uniquely by the LOG in scale space.
|
81. | Fua, P, and Leclerc, YG, "Taking advantage of image-based and geometry-based constraints to recover 3-D surfaces," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 64, pp. 111-127, 1996.
Abstract:
A unified framework for 3-D shape reconstruction allows us to combine
image-based and geometry-based information sources. The image
information is akin to stereo and shape-from-shading, while the
geometric information may be provided in the form of 3-D points, 3-D
features, or 2-D silhouettes. A formal integration framework is
critical in recovering complicated surfaces because the information
from a single source is often insufficient to provide a unique answer.
Our approach to shape recovery is to deform a generic object-centered
3-D representation of the surface so as to minimize an objective
function, This objective function is a weighted sum of the
contributions of the various information sources. We describe these
various terms individually, our weighting scheme, and our optimization
method, Finally, we present results on a number of difficult images of
real scenes for which a single source of information would have proved
insufficient. (C) 1996 Academic Press, Inc.
|
82. | Mitiche, A, and Bouthemy, P, "Computation and analysis of image motion: A synopsis of current problems and methods," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 19, pp. 29-55, 1996.
Abstract:
The goal of this paper is to offer a structured synopsis of the
problems in image motion computation and analysis, and of the methods
proposed, exposing the underlying models and supporting assumptions. A
sufficient number of pointers to the literature will be given,
concentrating mostly on recent contributions. Emphasis will be on the
detection, measurement and segmentation of image motion. Tracking, and
deformable motion isssues will be also addressed. Finally, a number of
related questions which could require more investigations will be
presented.
|
83. | Ge, YR, Fitzpatrick, JM, Dawant, BM, Bao, J, Kessler, RM, and Margolin, RA, "Accurate localization of cortical convolutions in MR brain images," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 15, pp. 418-428, 1996.
Abstract:
Analysis of brain images often requires accurate localization of
cortical convolutions. Although magnetic resonance (MR) brain images
offer sufficient resolution for identifying convolutions in theory, the
nature of tomographic imaging prevents clear definition of convolutions
in individual slices, Existing methods for solving this problem rely on
heuristic adaptation of brain atlases created from a small number of
individuals, These methods do not usually provide high accuracy because
of large biological variations among individuals. We propose to
localize convolutions by linking realistic visualizations of the
cortical surface with the original image volume. We have developed a
system so that a user can quickly localize key convolutions in several
visualizations of an entire brain surface, Because of the links between
the visualizations and the original volume, these convolutions are
simultaneously localized in the original image slices, In the process
of our development, we have implemented a fast and easy method for
visualizing cortical surfaces in MR images, thereby making our scheme
usable in practical applications.
|
84. | Thompson, P, and Toga, AW, "A surface-based technique for warping three-dimensional images of the brain," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 15, pp. 402-417, 1996.
Abstract:
We have devised, implemented, and tested a fast, spatially accurate
technique for calculating the high-dimensional deformation held
relating the brain anatomies of an arbitrary pair of subjects, The
resulting three-dimensional (3-D) deformation map can be used to
quantify anatomic differences between subjects or within the same
subject over time and to transfer functional information between
subjects or integrate that information on a single anatomic template.
The new procedure is based on developmental processes responsible for
variations in normal human anatomy and is applicable to 3-D brain
images in general, regardless of modality, Hybrid surface models known
as Chen surfaces (based on superquadrics and spherical harmonics) are
used to efficiently initialize 3-D active surfaces, and these then
extract from both scans the developmentally fundamental surfaces of the
ventricles and cortex. The construction of extremely complex surface
deformation maps on the internal cortex is made easier by budding a
generic surface structure to model it, Connected systems of parametric
meshes model several deep sulci whose trajectories represent critical
functional boundaries, These sulci are sufficiently extended inside the
brain to reflect subtle and distributed variations in neuroanatomy
between subjects. The algorithm then calculates the high-dimensional
volumetric warp (typically with 384(2) x 256 x 3 approximate to 0.1
billion degrees of freedom) deforming one 3-D scan into structural
correspondence with the other. Integral distortion functions are used
to extend the deformation held required to elastically transform nested
surfaces to their counterparts in the target scan. The algorithm's
accuracy is tested, by warping 3-D magnetic resonance imaging (MRI)
volumes from normal subjects and Alzheimer's patients, and by warping
full-color 1024(3) digital cryosection volumes of the human head onto
MRI volumes, Applications are discussed, including the transfer of
multisubject 3-D functional, vascular, and histologic maps onto a
single anatomic template; the mapping of 3-D brain atlases onto the
scans of new subjects; and the rapid detection, quantification, and
mapping of local shape changes in 3-D medical images in disease and
during normal or abnormal growth and development.
|
85. | Cohen, LD, "Auxiliary variables and two-step iterative algorithms in computer vision problems," JOURNAL OF MATHEMATICAL IMAGING AND VISION, vol. 6, pp. 59-83, 1996.
Abstract:
We present a new mathematical formulation of some curve and surface
reconstruction algorithms by the introduction of auxiliary variables.
For deformable models and templates, the extraction of a shape is
obtained through the minimization of an energy composed of an internal
regularization term (not necessary in the case of parametric models)
and an external attraction potential. Two-step iterative algorithms
have been often used where, at each iteration, the model is first
locally deformed according to the potential data attraction and then
globally smoothed (or fitted in the parametric case).
We show how these approaches can be interpreted as the introduction of
auxiliary variables and the minimization of a two-variables energy. The
first variable corresponds to the original model we are looking for,
while the second variable represents an auxiliary shape close to the
first one. This permits to transform an implicit data constraint
defined by a non convex potential into an explicit convex
reconstruction problem. This approach is much simpler since each
iteration is composed of two simple to solve steps. Our formulation
permits a more precise setting of parameters in the iterative scheme to
ensure convergence to a minimum.
We show some mathematical properties and results on this new auxiliary
problem, in particular when the potential is a function of the distance
to the closest feature point. We then illustrate our approach for some
deformable models and templates.
|
86. | Malladi, R, Sethian, JA, and Vemuri, BC, "A fast level set based algorithm for topology-independent shape modeling," JOURNAL OF MATHEMATICAL IMAGING AND VISION, vol. 6, pp. 269-289, 1996.
Abstract:
Shape modeling is an important constituent of computer vision as well
as computer graphics research. Shape models aid the tasks of object
representation and recognition. This paper presents a new approach to
shape modeling which retains some of the attractive features of
existing methods, and overcomes some of their limitations. Our
technique can be applied to model arbitrarily complex shapes, which
include shapes with significant protrusions, and to situations where no
a priori assumption about the object's topology is made. A single
instance of our model, when presented with an image having more than
one object of interest, has the ability to split freely to represent
each object. This method is based on the ideas developed by Osher and
Sethian to model propagating solid/liquid interfaces with
curvature-dependent speeds. The interface (front) is a closed,
nonintersecting, hypersurface flowing along its gradient field with
constant speed or a speed that depends on the curvature. It is moved by
solving a ''Hamilton-Jacobi'' type equation written for a function in
which the interface is a particular level set. A speed term synthesized
from the image is used to stop the interface in the vicinity of object
boundaries. The resulting equation of motion is solved by employing
entropy-satisfying upwind finite difference schemes. We also introduce
a new algorithm for rapid advancement of the front using what we call a
narrow-band update scheme. The efficacy of the scheme is demonstrated
with numerical experiments on low contrast medical images.
|
87. | Zhang, SQ, Douglas, MA, Yaroslavsky, L, Summers, RM, Dilsizian, V, Fananapazir, L, and Bacharach, SL, "A Fourier based algorithm for tracking SPAMM tags in gated magnetic resonance cardiac images," MEDICAL PHYSICS, vol. 23, pp. 1359-1369, 1996.
Abstract:
A method is described for automatically tracking spatial modulation of
magnetization tag lines on gated cardiac images. The method differs
from previously reported methods in that it uses Fourier based spatial
frequency and phase information to separately track horizontal and
vertical tag lines. Use of global information from the frequency
spectrum of an entire set of tag lines was hypothesized to result in a
robust algorithm with decreased sensitivity to noise. The method was
validated in several ways: first, actual tagged cardiac images at end
diastole were deformed known amounts, and the algorithm's predictions
compared to the known deformations. Second, tagged, gated images of the
thigh muscle (assumed to have similar signal to noise characteristics
as cardiac images, but to not deform with time) were created. Again the
algorithmic predictions could be compared to the known (zero magnitude)
deformations and to thigh images which had been artificially deformed.
Finally, actual cardiac tagged images were acquired, and comparisons
made between manual, visual, determinations of tag line locations, and
those predicted by the algorithm. At 0.5 T, the mean bias of the method
was <0.34 mm even at large deformations and at late (noisy) times. The
standard deviation of the method, estimated from the tagged thigh
images, was <0.7 mm even at late times. The method may be expected to
have even lower error at higher field strengths.
|
88. | Eviatar, H, and Somorjai, RL, "A fast, simple active contour algorithm for biomedical images," PATTERN RECOGNITION LETTERS, vol. 17, pp. 969-974, 1996.
Abstract:
A new method for the application of active contours to biomedical
images is described. The new approach, which involves extensive
modification of the internal energy function acid a different method of
minimising the energy functional, yields rapid, excellent fits to MR
images.
|
89. | Chalana, V, Winter, TC, Cyr, DR, Haynor, DR, and Kim, YM, "Automatic fetal head measurements from sonographic images," ACADEMIC RADIOLOGY, vol. 3, pp. 628-635, 1996.
Abstract:
Rationale and Objectives. We designed an image processing technique to
automatically measure the biparietal diameter (BPD) and head
circumference (HC) from prenatal sonograms, We evaluated the
performance of the algorithm by comparing the resulting measurements
with those made by experienced sonographers.
Methods. Thirty-five digitized sonograms of the fetal head were
obtained during routine imaging, The BPD and HC were automatically
computed by detecting the inner and outer boundaries of the fetal skull
using the computer vision technique known as the ''active contour
model.'' Six experienced sonographers also measured the BPD and HC on
these images.
Results. The algorithm failed to locate the boundaries in two of the 35
cases. For the remaining cases, the mean absolute difference betnieen
the automated measurements and the average of the six observers was
1.4% for BPD and 2.9% for HC. The correlations were .999 for the BPD
and .994 for the HC. The computer's measurements were no different from
the six observers' measurements than the observers' measurements were
from one another.
Conclusion. The tested algorithm effectively and accurately measures
BPD and HC automatically. We are currently in the process of
integrating this algorithm into an ultrasound machine.
|
90. | Yang, ZY, "Nonlinear superposition of receptive fields and phase transitions," PHYSICS LETTERS A, vol. 219, pp. 277-281, 1996.
Abstract:
We present a principle of nonlinear superposition of receptive fields.
Changes of connection weight, applied field or the distances between
the input centers can lead to a new phase with all neurons encoding
certain shapes excited. This process is a kind of phase transition and
can be used for information processing.
|
91. | Dow, AI, Shafer, SA, Kirkwood, JM, Mascari, RA, and Waggoner, AS, "Automatic multiparameter fluorescence imaging for determining lymphocyte phenotype and activation status in melanoma tissue sections," CYTOMETRY, vol. 25, pp. 71-81, 1996.
Abstract:
A system has been developed that combines multiparameter fluorescence
imaging and computer vision techniques to provide automatic phenotyping
of multiple cell types in a single tissue section. This system
identifies both the nuclear and cytoplasmic boundary of each cell. A
routine based on the watershed algorithm has been developed to segment
an image of Hoechst-stained nuclei with an accuracy of greater than
85%. Deformable splines initially positioned at the nuclear boundaries
are applied to images of fluorescently labelled cell-surface antigens.
The splines lock onto the peak fluorescence signal surrounding the
cell, providing an estimate of the cell boundary. From measurements
acquired at this boundary, each cell is classified according to antigen
expression.
The system has been piloted in biopsies from melanoma patients
participating in a clinical trial of the antibody R(24). Thin tissue
sections have been stained with Hoechst and three different fluorescent
antibodies to antigens that permit the typing and evaluation of
activity of T-cells. Changes in the infiltrates evaluated by
multiparameter imaging were consistent with results obtained by
immunoperoxidase analysis. The multiparameter fluorescent technique
enables simultaneous determination of multiple cell subsets and can
provide the spatial relationships of each cell type within the tissue.
(C) 1996 Wiley-Liss, Inc.
|
92. | Bulpitt, AJ, and Efford, ND, "An efficient 3D deformable model with a self-optimising mesh," IMAGE AND VISION COMPUTING, vol. 14, pp. 573-580, 1996.
Abstract:
Deformable models are a powerful and popular tool for image
segmentation, but in 3D imaging applications the high computational
cost of fitting such models can be a problem. A further drawback is the
need to select the initial size and position of a model in such a way
that it is close to the desired solution. This task may require
particular expertise on the part of the operator, and, furthermore, may
be difficult to accomplish in three dimensions without the use of
sophisticated visualisation techniques. This article describes a 3D
deformable model that uses an adaptive mesh to increase computational
efficiency and accuracy. The model employs a distance transform in
order to overcome some of the problems caused by inaccurate
initialisation. The performance of the model is illustrated by its
application to the task of segmentation of 3D MR images of the human
head and hand. A quantitative analysis of the performance is also
provided using a synthetic test image.
|
93. | Ip, HHS, and Yu, RPK, "Recursive splitting of active contours in multiple clump segmentation," ELECTRONICS LETTERS, vol. 32, pp. 1564-1566, 1996.
Abstract:
A new technique is presented for clump decomposition based on the
recursive splitting of active contours. The approach does not require
prior knowledge of tlx number of objects and the sizes of the objects
to be segmented.
|
94. | Nesi, P, and Magnolfi, R, "Tracking and synthesizing facial motions with dynamic contours," REAL-TIME IMAGING, vol. 2, pp. 67-79, 1996.
Abstract:
Many researchers have studied techniques related to the analysis and
synthesis of human heads under motion with face deformations. These
techniques can be used for defining low-rate Image compression
algorithms (model-based image coding), cinema technologies,
videophones, as well as for applications of virtual reality, etc. Such
techniques need a real-time performance and a strong integration
between the mechanisms of motion estimation and those of rendering and
animation of the 3D synthetic head/face. In this paper, a complete and
integrated system for tracking and synthesizing facial motions in
real-time with low-cost architectures is presented. Facial deformations
curves represented as spatiotemporal B-splines are used for tracking in
order to model the main facial features. In addition, the system
proposed is capable of adapting a generic 3D wire-frame model of a
head/face to the face that must be tracked; therefore: the simulations
of the face deformations are produced by using a realistic patterned
face. (C) 1996 Academic Press Limited
|
95. | Beylot, P, Gingins, P, Kalra, P, Thalmann, NM, Maurel, W, Thalmann, D, and Fasel, J, "3D interactive topological modeling using visible human dataset," COMPUTER GRAPHICS FORUM, vol. 15, pp. C33-&, 1996.
Abstract:
Availability of Visible Human Dataset (VHD) has provided numerous
possibilities for its exploitation bl both medical applications and 3D
animation. In this paper, we present our interactive tools which enable
extraction of surfaces for different organs, including bones, muscles,
fascia, and skin, from the VHD. The reconstructed surfaces then are
used for defining the inter-relationship of organs, a process bye refer
to as topological modeling. A data base is constructed, which
encapsulates structural, topological, mechanical and other relevant
information about organs. A 3D interactive tool enables the building
and editing of this data base. Such a data base can later be used for
different applications in fields such as medicine, sports, education,
and entertainment.
|
96. | Berger, MO, Chevrier, C, and Simon, G, "Compositing computer and video image sequences: Robust algorithms for the reconstruction of the camera parameters," COMPUTER GRAPHICS FORUM, vol. 15, pp. C23-&, 1996.
Abstract:
Augmented reality shows great promises in fields where a simulation in
situ would be impossible or too expensive. When mixing synthetic and
real objects in the same animated sequence, we must be sure that the
geometrical coherence as well as the photometrical coherence is
ensured. One major challenge is to compute the camera viewpoint with
sufficient accuracy to ensure a satisfactory composition. We especially
address this point in this paper using computer vision techniques and
robust statistical methods. We prove that such techniques make it
possible to compute almost automatically the viewpoint for long video
sequences even for bad quality images in outdoor environments.
Significant results on the lighting simulation of the bridges of Paris
are shown.
|
97. | Mason, DC, and Davenport, IJ, "Accurate and efficient determination of the shoreline in ERS-1 SAR images," IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, vol. 34, pp. 1243-1253, 1996.
Abstract:
Extraction of the shoreline in SAR images is a difficult task to
perform using simple image processing operations such as grey-value
thresholding, due to the presence of speckle and because the signal
returned from the sea surface may be similar to that from the land. A
semiautomatic method for detecting the shoreline accurately and
efficiently in ERS-1 SAR images is presented. This is aimed primarily
at a particular application; namely the construction of a digital
elevation model of an intertidal zone using SAR images and hydrodynamic
model output, but could be carried over to other applications. A
coarse-fine resolution processing approach is employed, in which sea
regions are first detected as regions of low edge density in a low
resolution image, then image areas near the shoreline are subjected to
more elaborate processing at high resolution using an active contour
model. Over 90% of the shoreline detected by the automatic delineation
process appear visually correct.
|
98. | Lejeune, A, and Ferrie, FP, "Finding the parts of objects in range images," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 64, pp. 230-247, 1996.
Abstract:
A key problem in the interpretation of visual form is the partitioning
of a shape into components that correspond to the parts of an object.
This paper presents a method for partitioning a set of surface
estimates obtained with a laser range finding system into subsets
corresponding to such parts. Parts are defined implicitly by means of a
feature set that identifies putative part boundaries that have been
computed by external means. The strategy employed makes use of two
complementary representations for surfaces: one that describes local
structures in terms of differential properties (e.g., edges, lines,
contours) and the other that represents the surface as a collection of
smooth patches at different scales. It is shown that by enforcing a
consistent interpretation between these two representations, it is
possible to derive a partitioning algorithm that is both efficient and
robust. Examples of its performance on a set of range images are
presented. (C) 1996 Academic Press, Inc.
|
99. | Cramer, C, Gelenbe, E, and Bakircioglu, H, "Low bit-rate video compression with neural networks and temporal subsampling," PROCEEDINGS OF THE IEEE, vol. 84, pp. 1529-1543, 1996.
Abstract:
Image and video compression is becoming an increasingly important area
of investigation, with numerous applications to video conferencing,
interactive education, home entertainment, and potential applications
to earth observation, medical imaging, digital libraries, and many
other areas. In this paper we describe a novel neural network technique
for video compression, using a ''point-process'' type neural network
model we have developed [1]-[4] which is closer to biophysical reality
and is mathematically much more tractable than standard models. Our
algorithm uses an adaptive approach based upon the users' desired video
quality Q, and achieves compression ratios of up to 500:1 for moving
gray-scale images, based on a combination of motion detection,
compression ratio of over 1000:1 for full-color video sequences with
the addition of the standard 4:1:1 spatial subsampling ratios in the
chrominance images. The signal-to-noise ratio (SNR) obtained varies
with the compression level and ranges from 29 dB to over 34 dB. Our
method is computationally fast so that compression and decompression
could possibly be preformed in real-time software. Compression is
preformed using a combination of motion detection, neural networks, and
temporal subsampling of frames. A set of neural networks is used to
adaptively select the desired compression of each picture block as a
function of the reconstruction quality. The motion detection process
separates out regions of the frame which need to be retransmitted.
Temporal subsampling of frames, along with reconstruction technique,
lead to the high compression ratios reported in this paper.
|
100. | Tannenbaum, A, "Three snippets of curve evolution theory in computer vision," MATHEMATICAL AND COMPUTER MODELLING, vol. 24, pp. 103-119, 1996.
Abstract:
In this paper, we discuss some uses of curve evolution theory for
problems in computer vision. We concentrate on three problem areas:
shape theory, active contours, and geometric invariant scale spaces.
The solutions to these key problems will all be based on flows which
are obtained in a completely natural manner from geometric and physical
principles.
|
101. | Olstad, B, and Torp, AH, "Encoding of a priori information in active contour models," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 18, pp. 863-872, 1996.
Abstract:
The theory of active contours models the problem of contour recovery as
an energy minimization process. The computational solutions based on
dynamic programming require that the energy associated with a contour
candidate can be decomposed into an integral of local energy
contributions. In this paper we propose a grammatical framework that
can model different local energy models and a set of allowable
transitions between these models. The grammatical encodings are
utilized to represent a priori knowledge about the shape of the object
and the associated signatures in the underlying images. The variability
encountered in numerical experiments is addressed with the energy
minimization procedure which is embedded in the grammatical framework.
We propose an algorithmic solution that combines a nondeterministic
version of the Knuth-Morris-Pratt algorithm for string matching with a
time-delayed discrete dynamic programming algorithm for energy
minimization. The numerical experiments address practical problems
encountered in contour recovery such as noise robustness and occlusion.
|
102. | Staib, LH, and Duncan, JS, "Model-based deformable surface finding for medical images," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 15, pp. 720-731, 1996.
Abstract:
This paper describes a new global shape parameterization for smoothly
deformable three-dimensional (3-D) objects, such as those found in
biomedical images, whose diversity and irregularity make them difficult
to represent in terms of fixed features or parts. This representation
is used for geometric surface matching to 3-D medical image data, such
as from magnetic resonance imaging (MRI). The parameterization
decomposes the surface into sinusoidal basis functions. Four types of
surfaces are modeled: tori, open surfaces, closed surfaces and tubes.
This parameterization allows a wide variety of smooth surfaces to be
described with a small number of parameters. Extrinsic model-based
information is incorporated by introducing prior probabilities on the
parameters. Surface finding is formulated as an optimization problem,
Results of the method applied to synthetic images and 3-D medical
images of the heart and brain are presented.
|
103. | Wang, G, Snyder, DL, OSullivan, JA, and Vannier, MW, "Iterative deblurring for CT metal artifact reduction," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 15, pp. 657-664, 1996.
Abstract:
Iterative deblurring methods using the expectation maximization (EM)
formulation and the algebraic reconstruction technique (ART),
respectively, are adapted for metal artifact reduction in medical
computed tomography (CT). In experiments with synthetic noise-free and
additive noisy projection data of dental phantoms, it is found that
both simultaneous iterative algorithms produce superior image quality
as compared to filtered backprojection after linearly fitting
projection gaps. Furthermore, the EM-type algorithm converges faster
than the ART-type algorithm in terms of either the I-divergence or
Euclidean distance between ideal and reprojected data in our
simulation. Also, for a given iteration number, the EM-type deblurring
method produces better image clarity but stronger noise than the
ART-type reconstruction. The computational complexity of EM- and
ART-based iterative deblurring is essentially the same, dominated by
reprojection and backprojection. Relevant practical and theoretical
issues are discussed.
|
104. | Hutchinson, S, Hager, GD, and Corke, PI, "A tutorial on visual servo control," IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, vol. 12, pp. 651-670, 1996.
Abstract:
This article provides a tutorial introduction to visual servo control
of robotic manipulators, Since the topic spans many disciplines our
goal is limited to providing a basic conceptual framework, We begin by
reviewing the prerequisite topics from robotics and computer vision,
including a brief review of coordinate transformations, velocity
representation, and a description of the geometric aspects of the image
formation process, We then present a taxonomy of visual servo control
systems, The two major classes of systems, position-based and
image-based systems, are then discussed in detail, Since any visual
servo system must be capable of tracking image features in a sequence
of images, we also include an overview of feature-based and
correlation-based methods for tracking, We conclude the tutorial with a
number of observations on the current directions of the research field
of visual servo control.
|
105. | Kichenassamy, S, Kumar, A, Olver, P, Tannenbaum, A, and Yezzi, A, "Conformal curvature flows: From phase transitions to active vision," ARCHIVE FOR RATIONAL MECHANICS AND ANALYSIS, vol. 134, pp. 275-301, 1996.
Abstract:
In this paper, we analyze geometric active contour models from a curve
evolution point of view and propose some modifications based on
gradient flows relative to certain new feature-based Riemannian
metrics. This leads to a novel edge-detection paradigm in which the
feature of interest may be considered to lie at the bottom of a
potential well. Thus an edge-seeking curve is attracted very naturally
and efficiently to the desired feature. Comparison with the Allen-Cahn
model clarifies some of the choices made in these models, and suggests
inhomogeneous models which may in return be useful in phase
transitions. We also consider some 3-dimensional active surface models
based on these ideas. The justification of this model rests on the
careful study of the viscosity solutions of evolution equations derived
from a level-set approach.
|
106. | Denzler, J, and Niemann, H, "3D data driven prediction for active contour models based on geometric bounding volumes," PATTERN RECOGNITION LETTERS, vol. 17, pp. 1171-1178, 1996.
Abstract:
Active contour models have proven to be a promising approach for data
driven object tracking without knowledge about the problem domain and
the object. Problems arise in case of fast moving objects and in
natural scenes with heterogeneous background. In these cases, a
prediction step is an essential part of the tracking mechanism.
In this paper we describe a new approach for modelling the contour of
moving objects in the 3D world. The key point is the description of
moving objects by a simplified geometric model, the sc-called bounding
volume. The contour of moving objects is predicted by estimating the
movement and the shape of the bounding volume in the 3D world and by
projecting its contour to the image plane. Stochastic optimization
algorithms are used to estimate shape parameters of the bounding
volume. The 2D contour of the bounding volume is used to initialize the
active contour, which then extracts the contour of the moving object.
Thus, an update of the motion and model parameters of the bounding
volume is possible. No task specific knowledge and no a priori
knowledge about the object is necessary. We will show that in the case
of convex polyhedral bounding volumes, this method can be applied to
real-time closed-loop object tracking on standard Unix workstations.
Furthermore, we present experiments which prove that the robustness for
tracking moving objects in front of a heterogeneous background can be
improved.
|
107. | Couvignou, PA, Papanikolopoulos, NP, Sullivan, M, and Khosla, PK, "The use of active deformable models in model-based robotic visual servoing," JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS, vol. 17, pp. 195-221, 1996.
Abstract:
This paper presents a new approach for visual tracking and servoing in
robotics. We introduce deformable active models as a powerful means for
tracking a rigid or semi-rigid (possibly partially occluded) object in
movement within the manipulator's workspace. Deformable models imitate,
in real-time, the dynamic behavior of elastic structures. These
computer-generated models are designed to capture the silhouette of
objects with well-defined boundaries, in terms of image gradient. By
means of an eye-in-hand robot arm configuration, the desired motion of
the end-effector is computed with the objective of keeping the target's
position and shape invariant with respect to the camera frame. Optimal
estimation and control techniques (LQG regulator) have been
successfully implemented in order to deal with noisy measurements
provided by our vision sensor. Experimental results are presented for
the tracking of a rigid or semi-rigid object. The experiments performed
in a real-time environment show the effectiveness and robustness of the
proposed method for servoing tasks based on visual feedback.
|
108. | Yan, RH, Tokuda, N, and Miyamichi, J, "A model-based active landmarks tracking method," IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, vol. E79D, pp. 1477-1482, 1996.
Abstract:
Unlike The time-consuming contour tracking method of snakes [5] which
requires a considerable number of iterated computations before contours
are successfully tracked down, we present a faster and accurate
model-based ''landmarks'' tracking method where a single iteration of
the dynamic programming is sufficient to obtain a local minimum to an
integral measure of the elastic and the image energy functionals. The
key lies in choosing a relatively small number of salient
''landmarks'', or features of objects, rather than their contours as a
target of tracking within the image structure. The landmarks comprising
singular points along the model contours are tracked down within the
image structure all inside restricted search areas of 41 x 41 pixels
whose respective locations in image structure are dictated by their
locations in the model. A Manhattan distance and a template corner
detection function of Singh and Shneier [7] are used as elastic energy
and image energy respectively in the algorithm. A first approximation
to the image contour is obtained in our method by applying the
thin-plate spline transformation of Bookstein [2] using these landmarks
as fixed points of the transformation which is capable of preserving a
global shape information of the model including the relative
configuration of landmarks and consequently surrounding contours of the
model in the image structure. The actual image contours are further
tracked down by applying an active edge tracker using now simplified
line search segments so that individual differences persisting between
the mapped model contour are substantially eliminated. We have applied
our method tentatively to portraits of a class album to demonstrate the
effectiveness of the method. Our experiments convincingly show that
using only about 11 feature points our method provides not only a much
improved computational complexity requiring only 0.94 sec. in CPU time
by SGI's indigo2 but also more accurate shape representations than
those obtained by the snakes methods. The method is powerful in a
problem domain where the model-based approach is applicable, possibly
allowing real time processing because a most time consuming algorithm
of corner template evaluation can be easily implemented by parallel
processing firmware.
|
109. | Huang, TS, Stroming, JW, Kang, Y, and Lopez, R, "Advances in very low bit rate video coding in North America," IEICE TRANSACTIONS ON COMMUNICATIONS, vol. E79B, pp. 1425-1433, 1996.
Abstract:
Research in very low-bit rate coding has made significant advancements
in the past few years. Most recently, the introduction of the MPEG-4
proposal has motivated a wide variety of approaches aimed al achieving
a new level of video compression. In this paper we review progress in
VLBV categorized into 3 main areas: (1) Waveform coding, (2) 2D
Content-based coding, and (3) Model-based coding. Where appropriate we
also described proposals to the MPEG-4 committee in each of these areas.
|
110. | Germain, O, and Refregier, P, "Optimal snake-based segmentation of a random luminance target on a spatially disjoint background," OPTICS LETTERS, vol. 21, pp. 1845-1847, 1996.
Abstract:
We describe a segmentation processor that is optimal for tracking the
shape of a target with random white Gaussian intensity appearing on a
random white Gaussian spatially disjoint background. This algorithm,
based on an active contours model (snakes), consists of correlations of
binary reference's with preprocessed versions of the scene image. This
result can provide a practical method to adapt the reference image to
correlation techniques. (C) 1996 Optical Society of America
|
111. | Wang, M, Evans, J, Hassebrook, L, and Knapp, C, "A multistage, optimal active contour model," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 5, pp. 1586-1591, 1996.
Abstract:
Energy-minimizing active contour models or snakes can be used in many
applications such as edge detection, motion tracking, image matching,
computer vision, and three-dimensional (3-D) reconstruction. We present
a novel snake that is superior both in accuracy and convergence speed
over previous snake algorithms. High performance is achieved by using
spline representation and dividing the energy-minimization process into
multiple stages. The first stage is designed to optimize the
convergence speed in order to allow the snake to quickly approach the
minimum-energy state. The second stage is devoted to snake refinement
and to local minimization of energy, thereby driving the snake to a
quasiminimum-energy state. The third stage uses the Bellman optimality
principle to fine-tune the snake to the global minimum-energy state.
This three-stage scheme is optimized for both accuracy and speed.
|
112. | Malladi, R, and Sethian, JA, "A unified approach to noise removal, image enhancement, and shape recovery," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 5, pp. 1554-1568, 1996.
Abstract:
We present a unified approach to noise removal, image enhancement, and
shape recovery in images. The underlying approach relies on the level
set formulation of curve and surface motion, which leads to a class of
PDE-based algorithms. Beginning with an image, the first stage of this
approach removes noise and enhances the image by evolving the image
under flow controlled by min/max curvature and by the mean curvature.
This stage is applicable to both salt-and-pepper grey-scale noise and
full-image continuous noise present in black and white images,
grey-scale images, texture images, and color images. The noise
removal/enhancement schemes applied in this stage contain only one
enhancement parameter, which in most cases is automatically chosen. The
other key advantage of our approach is that a stopping criteria is
automatically picked from the image; continued application of the
scheme produces no further change. The second stage of our approach is
the shape recovery of a desired object; we again exploit the level set
approach to evolve an initial curve/surface toward the desired
boundary, driven by an image-dependent speed function that
automatically stops at the desired boundary.
|
113. | Smith, CE, Richards, CA, Brandt, SA, and Papanikolopoulos, NP, "Visual tracking for intelligent vehicle-highway systems," IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, vol. 45, pp. 744-759, 1996.
Abstract:
The complexity and congestion of current transportation systems often
produce traffic situations that jeopardize the safety of the people
involved, These situations vary from maintaining a safe distance behind
a leading vehicle to safely allowing a pedestrian to cross a busy
street. Environmental sensing plays a critical role in virtually all of
these situations, Of the sensors available, vision sensors protide
information that Is richer and more complete than other sensors, making
them a logical choice for a multisensor transportation system, In this
paper we propose robust detection and tracking techniques for
intelligent vehicle-highway applications where computer vision plays a
crucial role, In particular, se demonstrate that the Controlled Active
Vision framework [15] can be utilized to provide a visual tracking
modality to a traffic advisory system in order to increase the overall
safety margin in a variety bf common traffic situations, We have
selected two application examples. vehicle tracking and pedestrian
tracking, to demonstrate that the framework fan provide precisely the
type of information required to effectively manage the given traffic
situation.
|
114. | Nastar, C, and Ayache, N, "Frequency-based nonrigid motion analysis: Application to four dimensional medical images," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 18, pp. 1067-1079, 1996.
Abstract:
We present a method for nonrigid motion analysis in time sequences of
volume images (4D data). In this method, nonrigid motion of the
deforming object contour is dynamically approximated by a
physically-based deformable surface. In order to reduce the number of
parameters describing the deformation, we make use of a modal analysis
which provides a spatial smoothing of the surface. The deformation
spectrum, which outlines the main excited modes, can be efficiently
used for deformation comparison. Fourier analysis on time signals of
the main deformation spectrum components provides a temporal smoothing
of the data. Thus a complex nonrigid deformation is described by only a
few parameters: the main excited modes and the main Fourier harmonics.
Therefore, 4D data can be analyzed in a very concise manner. The power
and robustness of the approach is illustrated by various results on
medical data. We believe that our method has important applications in
automatic diagnosis of heart diseases and in motion compression.
|
115. | Lee, JD, "Genetic approach to select wavelet features for contour extraction in medical ultrasonic imaging," ELECTRONICS LETTERS, vol. 32, pp. 2137-2138, 1996.
Abstract:
An efficient and robust approach, which is based on wavelet transform
(WT), is proposed to contour extraction for medical ultrasonic images
having low signal-to-noise ratio. Furthermore, the best wavelet
features for profile analysis is estimated by GAs without manual
operation. No image preprocessing is needed, so computation time is
fast. Experimental results to confirm the proposed algorithm are also
included.
|
116. | Laprie, Y, and Berger, MO, "Cooperation of regularization and speech heuristics to control automatic formant tracking," SPEECH COMMUNICATION, vol. 19, pp. 255-269, 1996.
Abstract:
This paper describes an automatic formant tracking algorithm
incorporating speech knowledge. It operates in two phases. The first
detects and interprets spectrogram peak lines in terms of formants. The
second uses an image contour extraction method to regularise the peak
lines thus detected. Speech knowledge served as acoustic constraints to
guide the interpretation of peak lines. The proposed algorithm has the
advantage of providing formant trajectories which, in addition to being
sufficiently close to the spectral peaks of the respective formants,
are sufficiently smooth to allow an accurate evaluation of formant
transitions. The results obtained highlight the interest of the
proposed approach.
|
117. | Maurer, CR, Aboutanos, GB, Dawant, BM, Maciunas, RJ, and Fitzpatrick, JM, "Registration of 3-D images using weighted geometrical features," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 15, pp. 836-849, 1996.
Abstract:
In this paper, we present a weighted geometrical feature (WGF)
registration algorithm. Its efficacy is demonstrated by combining
points and a surface. The technique is an extension of Besl and McKay's
iterative closest point (ICP) algorithm. We use the WGF algorithm to
register X-ray computed tomography (CT) and T2-weighted magnetic
resonance (MR) volume head images acquired from eleven patients that
underwent craniotomies in a neurosurgical clinical trial. Each patient
had five external markers attached to transcutaneous posts screwed into
the outer table of the skull. We define registration error as the
distance between positions of corresponding markers that are not used
for registration. The CT and MR images are registered using fiducial
points (marker positions) only, a surface only, and various weighted
combinations of points and a surface. The CT surface is derived from
contours corresponding to the inner surface of the skull. The MR
surface is derived front contours corresponding to the cerebrospinal
fluid (CSF)-dura interface. Registration using points and a surface is
found to be significantly more accurate than registration using only
points or a surface.
|
118. | Davatzikos, C, and Bryan, RN, "Using a deformable surface model to obtain a shape representation of the cortex," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 15, pp. 785-795, 1996.
Abstract:
This paper examines the problem of obtaining a mathematical
representation of the outer cortex of the human brain, which is a key
problem in several applications, including morphological analysis of
the brain, and spatial normalization and registration of brain images.
A parameterization of the outer cortex is first obtained using a
deformable surface algorithm which, motivated by the structure of the
cortex, is constructed to find the central layer of thick surfaces.
Based on this parameterization, a hierarchical representation of the
outer cortical structure is proposed through its depth map and its
curvature maps at various scales. Various experiments on magnetic
resonance data are presented.
|
119. | Toklu, C, Erdem, AT, Sezan, MI, and Tekalp, AM, "Tracking motion and intensity variations using hierarchical 2-D mesh modeling for synthetic object transfiguration," GRAPHICAL MODELS AND IMAGE PROCESSING, vol. 58, pp. 553-573, 1996.
Abstract:
We propose a method for tracking the motion and intensity variations of
a 2-D mildly deformable image object using a hierarchical 2-D mesh
model. The proposed method is applied to synthetic object
transfiguration, namely, replacing an object in a real video clip with
another synthetic or natural object via digital postprocessing.
Successful transfiguration requires accurate tracking of both motion
and intensity (contrast and brightness) variations of the
object-to-be-replaced so that the replacement object can be rendered in
exactly the same way from a single still picture. The proposed method
is capable of tracking image regions corresponding to scene objects
with nonplanar and/or mildly deforming surfaces, accounting for
intensity variations, and is shown to be effective with real image
sequences. (C) 1996 Academic Press, Inc.
|
120. | Demongeot, J, and Leitner, F, "Compact set valued flows .1. Applications in medical imaging," COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE II FASCICULE B-MECANIQUE PHYSIQUE CHIMIE ASTRONOMIE, vol. 323, pp. 747-754, 1996.
Abstract:
Compact set valued dynamical systems have a large field of applications
in image processing and morphogenesis modelling. In section 2 of this
paper, we will define the notion of compact set valued Row. In section
3, we will propose some examples of potential Rows used in 3D-image
contouring. In section 4, we will introduce the notion of mixed
potential-hamiltonian flows, which could be used in 4D-image
contouring, which generalizes the 2D potential-hamiltonian contouring
method. Finally, in section 5 we will give a simple example of compact
set valued iterations, and in section 6 an example of distribution tube
iterations.
|
121. | Kita, Y, "Elastic-model driven analysis of several views of a deformable cylindrical object," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 18, pp. 1150-1162, 1996.
Abstract:
This paper proposes a method to extract regions of a deformable object
from several views of it while finding the correspondence of the object
among the views. The method has been developed to analyze X-ray images
of a stomach. Owing to the physical (not physiological) deformation oi
the stomach and changes of the camera angle, the shape oi the stomach
regions are fairly different among the Images. In order to collectively
analyze these images, we use an elastic stomach model. Firstly, our
method builds an elastic stomach model based on the stomach shape in
one image. Considering each photographing condition, the deformation of
the stomach in each image is simulated with the elastic model.
Referring to the predicted contour which is obtained by projecting the
deformed model from the camera angle of each image, the contour is
robustly extracted from noisy images in a model-driven way. Since the
predicted contour registered in each image corresponds with the elastic
model, the position of each stomach part in the image is simultaneously
obtained; corresponding parts can be found among the images through the
model. Experimental results of analyzing several types of stomach X-ray
images are shown and discussed.
|
122. | Lee, S, Wolberg, G, Chwa, KY, and Shin, SY, "Image metamorphosis with scattered feature constraints," IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, vol. 2, pp. 337-354, 1996.
Abstract:
This paper describes an image metamorphosis technique to handle
scattered feature constraints specified with points, polylines, and
splines. Solutions to the following three problems are presented:
feature specification, warp generation, and transition control. We
demonstrate the use of snakes to reduce the burden of feature
specification. Next, we propose the use of multilevel free-form
deformations (MFFD) to compute C-2-continuous and one-to-one mapping
functions among the specified features. The resulting technique, based
on B-spline approximation, is simpler and faster than previous warp
generation methods. Furthermore, it produces smooth image
transformations without undesirable ripples and foldovers. Finally, we
simplify the MFFD algorithm to derive transition functions to control
geometry and color blending. Implementation details are furnished and
comparisons among Various metamorphosis techniques are presented.
|
123. | Irrgang, R, and Irrgang, H, "An intelligent snake growing algorithm for fuzzy shape detection," EXPERT SYSTEMS WITH APPLICATIONS, vol. 11, pp. 531-536, 1996.
Abstract:
A novel, robust algorithm for connectivity detection in the shape
recognition process has been developed. The algorithm is a simplified
version of the snake or active contour technique for object boundary
detection. Access to a case base and constraint system is available at
all stages of the process which increases the probability that
semantically meaningful objects will be detected. The technique has
proved valuable for a number of applications from the aerospace
industry including shape recognition and fatigue crack detection. The
algorithm has also been used to generate an improved version of the
STIRS technique for shape recognition. Copyright (C) 1996 Elsevier
Science Ltd
|
124. | Sato, K, Sugawara, K, Narita, Y, and Namura, I, "Consideration of the method of image diagnosis with respect to frontal lobe atrophy," IEEE TRANSACTIONS ON NUCLEAR SCIENCE, vol. 43, pp. 3230-3239, 1996.
Abstract:
This paper proposes a segmentation method for a quantitative image
diagnosis as a means of realizing an objective diagnosis of the frontal
lobe atrophy, From the data obtained on the grade of membership, the
fractal dimensions of the cerebral tissue [cerebral spinal fluid (CSF),
gray matter, and white matter] and the contours are estimated, The
mutual relationship between the degree of atrophy and the fractal
dimension has been analyzed based on the estimated fractal dimensions,
Using a sample of 42 male and Female cases, ranging in age from 50's to
70's, it has been concluded that the frontal lobe atrophy can be
quantified by regarding it as an expansion of CSF region on the
magnetic resonance imaging (MRI) of the brain, Furthermore, when the
process of frontal lobe atrophy is separated into early and advanced
stages, the volumetric change of CSF and white matter in frontal lobe
displays meaningful differences between the two stages, demonstrating
that the fractal dimension of CSF rises with the progress of atrophy,
Moreover, an interpolation method for three-dimensional (3-D) shape
reconstruction of the region of diagnostic interest is proposed and 3-D
shape visualization, with respect to the degree and form of atrophy, is
performed on the basis of the estimated fractal dimension of the
segmented cerebral tissue.
|
125. | Atkins, MS, and Mackiewich, BT, "Automatic segmentation of the brain in MRI," VISUALIZATION IN BIOMEDICAL COMPUTING, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1131, pp. 241-246, 1996.
Abstract:
This paper describes a robust fully automatic method for segmenting the
brain from head MR images, which works even in the presence of RF
inhomogeneities. It has been successful in segmenting the brain in
every slice from head images acquired from three different MRI
scanners, using different resolution images and different echo
sequences. The three-stage integrated method employs image processing
techniques based on anisotropic filters, ''snakes'' contouring
techniques, and a-priori knowledge. First the background noise is
removed leaving a head mask, then a rough outline of the brain is
found, and finally the rough brain outline is refined to a final mask.
|
126. | Kelemen, A, Szekely, G, Reist, HW, and Gerig, G, "Automatic segmentation of cell nuclei from confocal laser scanning microscopy images," VISUALIZATION IN BIOMEDICAL COMPUTING, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1131, pp. 193-202, 1996.
Abstract:
In this paper we present a method for the fully automatic segmentation
of cell nuclei from 3D confocal laser microscopy images. The method is
based on the combination of previously proposed techniques which have
been refined for the requirements of this task. A 3D extension of a
wave propagation technique applied to gradient magnitude images allows
us a precise initialization of elastically deformable Fourier models
and therefore a fully automatic image analysis. The shape parameters
are transformed into invariant descriptors and provide the basis of a
statistical analysis of cell nucleus shapes. This analysis will be
carried out in order to determine average intersection lengths between
cell nuclei and single particle tracks of ionizing radiation. This
allows a quantification of absorbed energy on living cells leading to a
better understanding of the biological significance of exposure to
radiation in low doses.
|
127. | McAuliffe, MJ, Eberly, D, Fritsch, DS, Chaney, EL, and Pizer, SM, "Scale-space boundary evolution initialized by cores," VISUALIZATION IN BIOMEDICAL COMPUTING, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1131, pp. 173-182, 1996.
Abstract:
A novel interactive segmentation method has been developed which uses
estimated boundaries, generated from cores, to initialize a scale-space
boundary evolution process in greyscale medical images. Presented is an
important addition to core extraction methodology that improves core
generation for objects that are in the presence of interfering objects.
The boundary at the scale of the core (BASOC) and its associated width
information, both derived from the core, are used to initialize the
second stage of the segmentation process. In this automatic refinement
stage, the BASOC is allowed to evolve in a spline-snake-like manner
that makes use of object-relevant width information to make robust
measurements of local edge positions.
|
128. | Masutani, Y, Masamune, K, and Dohi, T, "Region-growing based feature extraction algorithm for tree-like objects," VISUALIZATION IN BIOMEDICAL COMPUTING, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1131, pp. 161-171, 1996.
Abstract:
To overcome limitations of the conventional 'toward-axis' voxel-removal
way of thinning operations, a new 'along-axis' style of algorithm was
developed for topological information acquisition of tree-like objects
like vascular shapes based on region-growing technique. The theory of
mathematical morphology is extended for closed space inside binary
shapes, and the 'closed space dilation' operation is introduced as
generalized form of region growing. Using synthetic and clinical 3D
images, its superior features, such as parametric controllability were
shown.
|
129. | Rogowska, J, Batchelder, K, Gazelle, GS, Halpern, EF, Connor, W, and Wolf, GL, "Evaluation of selected two-dimensional segmentation techniques for computed tomography quantitation of lymph nodes," INVESTIGATIVE RADIOLOGY, vol. 31, pp. 138-145, 1996.
Abstract:
RATIONALE AND OBJECTIVES. AS contrast agents that selectively target
normal lymph nodes are undergoing development and evaluation, it has
become important to accurately and reproducibly determine nodal
boundaries to study. the agents and determine such values as lymph node
area or mean nodal contrast concentration. This study was performed to
evaluate the accuracy of different two-dimensional computer
segmentation methods, tested on acrylic phantoms constructed to imitate
the appearance of lymph nodes surrounded bg fat.
METHODS. Five segmentation techniques (manual tracing, semiautomatic
local criteria threshold selection, Sobel/watershed technique,
interactive deformable contour algorithm and thresholding) were
evaluated using phantoms, Subsequently, the first three methods were
applied to the images of enhanced lymph nodes in rabbits.
RESULTS. Minimum errors in phantom area measurement (<5%) and
interoperator variation (<5%) were seen with the Sobel/watershed
technique and the interactive deformable contour algorithm, These two
techniques were significantly better than thresholding and
semiautomated thresholding based on local properties.
CONCLUSION. Methods based on Sobel edge detection offer more objective
tools than thresholding methods for segmenting objects similar to lymph
nodes in computed tomography images, Both methods, Sobel/watershed and
interactive deformable contour algorithm, are fast and have simple user
interfaces.
|
130. | Carlsson, S, "Projectively invariant decomposition and recognition of planar shapes," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 17, pp. 193-209, 1996.
Abstract:
An algorithm is presented for computing a decomposition of planar
shapes into convex subparts represented by ellipses, The method is
invariant to projective transformations of the shape, and thus the
conic primitives can be used for matching and definition of invariants
in the same way as points and lines. The method works for arbitrary
planar shapes admitting at least four distinct tangents and it is based
on finding ellipses with four points of contact to the given shape. The
cross ratio computed from the four points on the ellipse can then be
used as a projectively invariant index. It is demonstrated that a given
shape has a unique parameter-free decomposition into a finite set of
ellipses with unit cross ratio. For a given shape, each pair of
ellipses can be used to compute two independent projective invariants.
The set of invariants computed for each ellipse pair can be used as
indexes to a hash table from which model hypothesis can be generated
Examples of shape decomposition and recognition are given for synthetic
shapes and shapes extracted from grey level images of real objects
using edge detection.
|
131. | Worring, M, Smeulders, AWM, Staib, LH, and Duncan, JS, "Parameterized feasible boundaries in gradient vector fields," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 63, pp. 135-144, 1996.
Abstract:
Segmentation of(noisy) images containing a complex ensemble of objects
is difficult to achieve on the basis of local image information only.
It is advantageous to attack the problem of object boundary extraction
by a model-based segmentation procedure, Segmentation is achieved by
tuning the parameters of the geometrical model in such a way that the
boundary template locates and describes the object in the image in an
optimal way, The optimality of the solution is based on an objective
function taking into account image information as well as the shape of
the template. Objective functions in literature are mainly based on the
gradient magnitude and a measure describing the smoothness of the
template. In this contribution, we propose a new image objective
function based on directional gradient information derived from
Gaussian smoothed derivatives of the image data, The proposed method is
designed to accurately locate an object boundary even in the case of a
conflicting object positioned close to the object of interest, We
further introduce a new smoothness objective to ensure the physical
feasibility of the contour. The method is evaluated on artificial data,
Results on real medical images show that the method is very effective
in accurately locating object boundaries in very complex images. (C)
1996 Academic Press, Inc.
|
132. | Alpert, NM, Berdichevsky, D, Levin, Z, Morris, ED, and Fischman, AJ, "Improved methods for image registration," NEUROIMAGE, vol. 3, pp. 10-18, 1996.
Abstract:
We report a system for PET-MRI registration that is improved or
optimized in several areas: (1) Automatic scalp/brain segmentation
replaces manual drawing operations, (2) a new fast and accurate method
of image registration, (3) visual assessment of registration quality is
enhanced by composite imaging methods (i.e., fusion) and (4) the entire
procedure is embedded in a commercially available scientific
visualization package, thereby providing a consistent graphical user
interface. The segmentation algorithm was tested on 17 MRI data sets
and was successful in all cases. Accuracy of image registration was
equal to that of the Woods algorithm, but 10 times faster for PET-PET
and 4 times faster for PET-MRI. The image fusion method allows
detection of misalignments on the order of 2-3 mm. These results
demonstrate an integrated system for intermodality image registration,
which is important because the procedure can be performed by
technicians with no anatomic knowledge and reduces the required time
from hours to about 15 min on a modern computer workstation. (C) 1996
Academic Press, Inc.
|
133. | Tai, YC, Lin, KP, Dahlbom, M, and Hoffman, EJ, "A hybrid attenuation correction technique to compensate for lung density in 3-D total body PET," IEEE TRANSACTIONS ON NUCLEAR SCIENCE, vol. 43, pp. 323-330, 1996.
Abstract:
A hybrid attenuation correction technique (ACT) is under development
for F-18-FDG total body positron emission tomography (PET). With a
short transmission scan of the thorax, any time within a few days of
the imaging session, this technique can correct for attenuation in the
entire body, Segmentation, registration, and active contour finding
techniques are applied to both emission and short transmission images
to locate and map the major attenuating structures in the body. This
technique eliminates the need for the patient to remain still from the
start of the transmission scan to the end of the emission scan without
the added noise of simultaneous or post emission transmission scan
measurements, The results of volunteer studies are comparable to
standard measured ACT, both visually and quantitatively, The efficient
use of scanner time and improved patient comfort make this technique
particularly suitable for clinical imaging.
|
134. | Chuang, GCH, and Kuo, CCJ, "Wavelet descriptor of planar curves: Theory and applications," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 5, pp. 56-70, 1996.
Abstract:
By using the wavelet transform, we develop a hierarchical planar curve
descriptor that decomposes a curve into components of different scales
so that the coarsest scale components carry the global approximation
information while the finer scale components contain the local detailed
information, We show that the wavelet descriptor has many desirable
properties such as multiresolution representation, invariance,
uniqueness, stability, and spatial localization, A deformable wavelet
descriptor is also proposed by interpreting the wavelet coefficients as
random variables, The applications of the wavelet descriptor to
character recognition and model-based contour extraction from low SNR
images are examined, Numerical experiments are performed to illustrate
the performance of the wavelet descriptor.
|
135. | Krishnamachari, S, and Chellappa, R, "Delineating buildings by grouping lines with MRFs," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 5, pp. 164-168, 1996.
Abstract:
Traditionally, Markov random field (MRF) models have been used in
low-level image analysis. This correspondence presents an MRF-based
scheme to perform object delineation. The proposed edge-based approach
involves extracting straight lines from the edge map of an image. Then,
an MRF model is used to group these lines to delineate buildings in
aerial images.
|
136. | Davatzikos, C, Vaillant, M, Resnick, SM, Prince, JL, Letovsky, S, and Bryan, RN, "A computerized approach for morphological analysis of the corpus callosum," JOURNAL OF COMPUTER ASSISTED TOMOGRAPHY, vol. 20, pp. 88-97, 1996.
Abstract:
Objective: A new technique for analyzing the morphology of the corpus
callosum is presented, and it is applied to a group of elderly subjects.
Materials and Methods: The proposed approach normalizes subject data
into the Talairach space using an elastic deformation transformation.
The properties of this transformation are used as a quantitative
description of the callosal shape with respect to the Talairach atlas,
which is treated as a standard. In particular, a deformation function
measures the enlargement/shrinkage associated with this elastic
deformation. Intersubject comparisons are made by comparing deformation
functions.
Results: This technique was applied to eight male and eight female
subjects. Based on the average deformation functions of each group, the
posterior region of the female corpus callosum was found to be larger
than its corresponding region in the males. The average callosal shape
of each group was also found, demonstrating visually the callosal shape
differences between the two groups in this sample.
Conclusion: The proposed methodology utilizes the full resolution of
the data, rather than relying on global descriptions such as area
measurements. The application of this methodology to an elderly group
indicated sex-related differences in the callosal shape and size.
|
137. | Yang, QS, and Marchant, JA, "Accurate blemish detection with active contour models," COMPUTERS AND ELECTRONICS IN AGRICULTURE, vol. 14, pp. 77-89, 1996.
Abstract:
This paper presents a novel image analysis scheme for accurate
detection of fruit blemishes. The detection procedure consists of two
steps: initial segmentation and refinement. In the first step,
blemishes are coarsely segmented out with a flooding algorithm and in
the second step an active contour model, i.e. a snake algorithm, is
applied to refine the segmentation so that the localization and size
accuracy of detected blemishes is improved. The concept and the
formulation of the snake algorithm are briefly introduced and then the
refinement procedure is described. The initial tests for sample apple
images have shown very promising results.
|
138. | Fishman, EK, Kuszyk, BS, Heath, DG, Gao, LM, and Cabral, B, "Surgical planning for liver resection," COMPUTER, vol. 29, pp. 64-&, 1996.
Abstract:
Effective surgical planning requires 3D images that show tumor location
relative to key blood vessels. This research uses volume rendering of
CT data to meet these requirements.
|
139. | Kent, JT, Mardia, KV, and Walder, AN, "Conditional cyclic Markov random fields," ADVANCES IN APPLIED PROBABILITY, vol. 28, pp. 1-12, 1996.
Abstract:
Grenander et al. (1991) proposed a conditional cyclic Gaussian Markov
random field model for the edges of a closed outline in the plane. In
this paper the model is recast as an improper cyclic Gaussian Markov
random field for the vertices. The limiting behaviour of this model
when the vertices become closely spaced is also described and in
particular its relationship with the theory of 'snakes' (Kass et al.
1987) is established. Applications are given in Grenander et al.
(1991), Mardia el al. (1991) and Kent et al. (1992).
|
140. | Taubin, G, and Ronfard, R, "Implicit simplicial models for adaptive curve reconstruction," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 18, pp. 321-325, 1996.
Abstract:
Parametric deformable models have been extensively and very
successfully used for reconstructing free-form curves and surfaces, and
for tracking nonrigid deformations, but they require previous knowledge
of the topological type of the data, and good initial curve or surface
estimates. With deformable models, it is also computationally expensive
to check for and to prevent self-intersections while tracking
deformations. The Implicit Simplicial Models that we introduce in this
paper are implicit curves and surfaces defined by piece-wise linear
functions. This representation allows for local deformations, control
of the topological type, and prevention of self-intersections during
deformations. As a first application, we also describe in this paper an
algorithm for two-dimensional curve reconstruction from unorganized
sets of data points. The topology, the number of connected components,
and the geometry of the data are all estimated using an adaptive space
subdivision approach. The main four components of the algorithm are
topology estimation, curve fitting, adaptive space subdivision, and
mesh relaxation.
|
141. | Jolly, MPD, Lakshmanan, S, and Jain, AK, "Vehicle segmentation and classification using deformable templates," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 18, pp. 293-308, 1996.
Abstract:
This paper proposes a segmentation algorithm using deformable template
models to segment a vehicle of interest both from the stationary
complex background and other moving vehicles in an image sequence. We
define a polygonal template to characterize a general model of a
vehicle and derive a prior probability density function to constrain
the template to be deformed within a set of allowed shapes. We propose
a likelihood probability density function which combines motion
information and edge directionality to ensure that the deformable
template is contained within the moving areas in the image and its
boundary coincides with strong edges with the same orientation in the
image. The segmentation problem is reduced to a minimization problem
and solved by the Metropolis algorithm. The system was successfully
tested on 405 image sequences containing multiple moving vehicles on a
highway.
|
142. | Jain, AK, Zhong, Y, and Lakshmanan, S, "Object matching using deformable templates," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 18, pp. 267-278, 1996.
Abstract:
We propose a general object localization and retrieval scheme based on
object shape using deformable templates. Prior knowledge of an object
shape is described by a prototype template which consists of the
representative contour/edges, and a set of probabilistic deformation
transformations on the template. A Bayesian scheme, which is based on
this prior knowledge and the edge information in the input image, is
employed to find a match between the deformed template and objects in
the image. Computational efficiency is achieved via a coarse-to-fine
implementation of the matching algorithm. Our method has been applied
to retrieve objects with a variety of shapes from images with complex
background. The proposed scheme is invariant to location, rotation, and
moderate scale changes of the template.
|
143. | Carstensen, JM, "An active lattice model in a Bayesian framework," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 63, pp. 380-387, 1996.
Abstract:
A Markov Random Field is used as a structural model of a deformable
rectangular lattice. When used as a template prior in a Bayesian
framework this model is powerful for making inferences about lattice
structures in images, The model assigns maximum probability to the
perfect regular lattice by penalizing deviations in alignment and
lattice node distance, The Markov random field represents prior
knowledge about the lattice structure, and through an observation model
that incorporates the visual appearance of the nodes, we can simulate
realizations from the posterior distribution. A maximum a posteriori
(MAP) estimate, found by simulated annealing, is used as the
reconstructed lattice. The model was developed as a central part of an
algorithm for automatic analysis of genetic experiments, positioned in
a lattice structure by a robot. The algorithm has been successfully
applied to many images, and it seems to be a fast, accurate, and robust
solution to the problem. Several possible extensions of the model are
described. (C) 1996 Academic Press, Inc.
|
144. | Robert, L, "Camera calibration without feature extraction," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 63, pp. 314-325, 1996.
Abstract:
This paper presents an original approach to the problem of camera
calibration using a calibration pattern, It consists of directly
searching for the camera parameters that best project three-dimensional
points of a calibration pattern onto intensity edges in an image of
this pattern, without explicitly extracting the edges. Based on a
characterization of image edges as maxima of the intensity gradient or
zero-crossings of the Laplacian, we express the whole calibration
process as a one-stage optimization problem. A classical iterative
optimization technique is used in order to solve it. Our approach is
different from the classical calibration techniques which involve two
consecutive stages: extraction of image features and computation of the
camera parameters. Thus, our approach is easier to implement and to
use, less dependent on the type of calibration pattern that is used,
and more robust. First, we describe the details of the approach, Then,
we show some experiments in which two implementations of our approach
and two classical two-stage approaches are compared, Tests on real and
synthetic data allow us to characterize our approach in terms of
convergence, sensitivity to the initial conditions, reliability, and
accuracy. (C) 1996 Academic Press, Inc.
|
145. | Trier, OD, Jain, AK, and Taxt, T, "Feature extraction methods for character recognition - A survey," PATTERN RECOGNITION, vol. 29, pp. 641-662, 1996.
Abstract:
This paper presents an overview of feature extraction methods for
off-line recognition of segmented (isolated) characters. Selection of a
feature extraction method is probably the single most important factor
in achieving high recognition performance in character recognition
systems. Different feature extraction methods are designed for
different representations df the characters, such as solid binary
characters, character contours, skeletons (thinned characters) or
gray-level subimages of each individual character. The feature
extraction methods are discussed in terms of invariance properties,
reconstructability and expected distortions and variability of the
characters. The problem of choosing the appropriate feature extraction
method for a given application is also discussed. When a few promising
feature extraction methods have been identified, they need to be
evaluated experimentally to find the best method for the given
application.
|
146. | Lam, KM, and Yan, H, "Locating and extracting the eye in human face images," PATTERN RECOGNITION, vol. 29, pp. 771-779, 1996.
Abstract:
Facial feature extraction is an important step in automated visual
interpretation and human face recognition. Among the facial features,
the eye plays the most important part in the recognition process. The
deformable template can be used in extracting the eye boundaries.
However, the weaknesses of the deformable template are that the
processing time is lengthy and that its success relies on the initial
position of the template. in this paper, the head boundary is first
located in a head-and-shoulders image. The approximate positions of the
eyes are estimated by means of average anthropometric measures.
Corners, the salient features of the eyes, are detected and used to set
the initial parameters of the eye templates. The corner detection
scheme introduced in this paper can provide accurate information about
the corners. Based on the corner positions, we can accurately locate
the templates in relation to the eye images and greatly reduce the
processing time for the templates. The performance of the deformable
template is assessed with and without using the information on corner
positions. Experiments show that a saving in execution time of about
40% on average and a better eye boundary representation can be achieved
by using the corner information.
|
147. | Kraitchman, DL, Wilke, N, Hexeberg, E, JeroschHerold, M, Wang, Y, Parrish, TB, Chang, CN, Zhang, Y, Bache, RJ, and Axel, L, "Myocardial perfusion and function in dogs with moderate coronary stenosis," MAGNETIC RESONANCE IN MEDICINE, vol. 35, pp. 771-780, 1996.
Abstract:
MRI studies of first-pass contrast enhancement with polylysine-Gd-DTPA
and myocardial tagging using spatial modulation of magnetization
(SPAMM) were performed to assess the feasibility of a combined regional
myocardial blood flow and 2D deformation exam, Instrumented
closed-chest dogs were imaged at a baseline control state (Cntl)
followed by two interventions: moderate coronary stenosis (St) achieved
by partial occlusion of the left anterior descending (LAD) and moderate
coronary stenosis with dobutamine loading (StD), Hypoperfusion of the
anterior region (ANT) of the myocardium (LAD distribution) relative to
the posterior wall (POS) based on the upslope of the signal intensity
time curve from the contrast-enhanced MR images was demonstrated only
with dobutamine loading (ANT:POS Cntl = 1.077 +/- 0.15 versus ANT:POS
StD = 0.477 +/- 0.11, P < 0.03) and was confirmed with radiolabeled
microspheres measurements (ANT:POS Cntl = 1.18 +/- 0.2 ml/min/g versus
ANT:POS StD = 0.44 +/- 0.1 ml/min/g; P < 0.002). Significant changes in
regional myocardial shortening were only seen in the StD state (P <
0.02); the anterior region showed impaired myocardial shortening with
dobutamine loading (P = NS), whereas the nonaffected POS region showed
a marked increase in shortening when compared with Cntl (Cntl = 0.964
+/- 0.02 versus StD = 0.884 +/- 0.03; P < 0.001). These results
demonstrate that an integrated quantitative assessment of regional
myocardial function and semiquantitative assessment of myocardial blood
flow can be performed noninvasively with ultrafast MRI.
|
148. | Helterbrand, JD, "One-pixel-wide closed boundary identification," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 5, pp. 780-783, 1996.
Abstract:
An appropriate space of one-pixel-wide closed (OPWC) boundary
configurations is explicitly defined and an automatic algorithm to
obtain OPWC contour estimates from a segmented image is presented. The
motivation is to obtain a reasonable starting estimate for a Markov
chain Monte Carlo-based (McMC-based) boundary optimization algorithm.
|
149. | Yuen, PC, Wong, YY, and Tong, CS, "Contour detection using enhanced snakes algorithm," ELECTRONICS LETTERS, vol. 32, pp. 202-204, 1996.
Abstract:
An enhanced snakes algorithm (ESA) for detecting object contours is
designed and developed. In the ESA, a novel split and merge technique
is added to the original snakes model to enhance the model to support
the detection of concave object contours. A set of handtools is
selected to evaluate the proposed algorithm, and the results are
encouraging.
|
150. | Chalana, V, Linker, DT, Haynor, DR, and Kim, YM, "A multiple active contour model for cardiac boundary detection on echocardiographic sequences," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 15, pp. 290-298, 1996.
Abstract:
Tracing of left-ventricular epicardial and endocardial borders on
echocardiographic sequences is essential for quantification of cardiac
function. We designed a method based on an extension of active contour
models to detect both epicardial and endocardial borders on short-axis
cardiac sequences spanning the entire cardiac cycle, We validated the
results by comparing the computer-generated boundaries to the
boundaries manually outlined by four expert observers on 44 clinical
data sets, The mean boundary distance between the computer-generated
boundaries and the manually outlined boundaries was 2.80 mm (sigma =
1.28 mm) for the epicardium and 3.61 (sigma = 1.68 mm) for the
endocardium, These distances were comparable to interobserver
distances, which had a mean of 3.79 mm (sigma = 1.53 mm) for epicardial
borders and 2.67 mm (sigma = 0.88 mm) for endocardial borders, The
correlation coefficient between the areas enclosed by the
computer-generated boundaries and the average manually outlined
boundaries was 0.95 for epicardium and 0.91 for endocardium, The
algorithm is fairly insensitive to the choice of the initial curve,
Thus, we have developed an effective and robust algorithm to extract
left-ventricular boundaries from echocardiographic sequences.
|
151. | Hoch, M, and Litwinowicz, PC, "A semi-automatic system for edge tracking with snakes," VISUAL COMPUTER, vol. 12, pp. 75-83, 1996.
Abstract:
Active contour models, or ''snakes,'' developed in (Kass et al. 1988),
use a simple physical model to track edges in image sequences. Snakes
as originally defined however, tend to shrink, stretch and slide back
and forth in unwanted ways along a tracked edge and are also confused
by multiple edges, always grabbing the nearest one. In this paper a
semi-automatic system is presented that combines motion estimation
techniques with snakes to overcome these problems. An algorithm is
presented that uses a block matching technique to guide the endpoints
of the snake, optical flow to push the snake in the direction of the
underlying motion, followed by the traditional snake edge-fitting
minimization process. We use this technique for tracking facial
features of an actor for driving computer animated characters.
|
|
|
1997 |
152. | Zhou, P, and Pycock, D, "Robust statistical models for cell image interpretation," IMAGE AND VISION COMPUTING, vol. 15, pp. 307-316, 1997.
Abstract:
A robust and adaptable model-based scheme for cell image interpretation
is presented that can accommodate the wide natural variation in the
appearance of cells. This is achieved using multiple models and an
interpretation process that permits a smooth transition between models.
Boundaries are represented using trainable statistical models that are
invariant to transformations of scaling, shift, rotation and contrast;
a Gaussian and a circular autoregressive (CAR) model are investigated.
The interpretation process optimises the match between models and data
using a Bayesian distance measure. We demonstrate how objects that vary
in both shape and grey-level pattern can reliably be segmented. The
results presented show that overall performance is comparable with that
for manual segmentation; the area within the automatically and manually
selected cell boundaries that is not common to both is less than 5% in
96% of the cases tested. The results also show that the computationally
simpler Gaussian boundary model is at least as effective as the CAR
model.
|
153. | Androutsos, D, Trahanias, PE, and Venetsanopoulos, AN, "Application of active contours for photochromic tracer flow extraction," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 16, pp. 284-293, 1997.
Abstract:
This paper addresses the implementation of image processing and
computer vision techniques to automate tracer flow extraction in images
obtained by the photochromic dye technique. This task is important in
modeled arterial blood flow studies. Currently, it is performed via
manual application of B-spline curve fitting. However, this is a
tedious and error-prone procedure and its results are nonreproducible,
In the proposed approach, active contours, snakes, are employed in a
new curve-fitting method for tracer flow extraction in photochromic
images. An algorithm implementing snakes is introduced to automate
extraction, Utilizing correlation matching, the algorithm quickly
locates and localizes all flow traces in the images. The feasibility of
the method for tracer flow extraction is demonstrated. Moreover,
results regarding the automation algorithm are presented showing its
accuracy and effectiveness. The proposed approach for tracer flow
extraction has potential for real-system application.
|
154. | Boyer, E, and Berger, MO, "3D surface reconstruction using occluding contours," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 22, pp. 219-233, 1997.
Abstract:
This paper addresses the problem of 3D surface reconstruction using
image sequences. It has been shown that shape recovery from three or
more occluding contours of the surface is possible given a known camera
motion. Several algorithms, which have been recently proposed, allow
such a reconstruction under the assumption of a linear camera motion. A
new approach is presented which deals with the reconstruction problem
directly from a discrete point of view. First, a theoretical study of
the epipolar correspondence between occluding contours is achieved. A
correct depth formulation is then derived from a local approximation of
the surface up to order two. This allows the local shape to be
estimated, given three consecutive contours, without any constraints on
the camera motion. Experimental results are presented for both
synthetic and real data.
|
155. | Szeliski, R, and Coughlan, J, "Spline-based image registration," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 22, pp. 199-218, 1997.
Abstract:
The problem of image registration subsumes a number of problems and
techniques in multiframe image analysis, including the computation of
optic flow (general pixel-based motion), stereo correspondence,
structure from motion, and feature tracking. We present a new
registration algorithm based on spline representations of the
displacement field which can be specialized to solve all of the above
mentioned problems. In particular, we show how to compute local flow,
global (parametric) flow, rigid flow resulting from camera egomotion,
and multiframe versions of the above problems. Using a spline-based
description of the flow removes the need for overlapping correlation
windows, and produces an explicit measure of the correlation between
adjacent flow estimates. We demonstrate our algorithm on multiframe
image registration and the recovery of 3D projective scene geometry.
mie also provide results on a number of standard motion sequences.
|
156. | Lai, SH, and Vemuri, BC, "Physically based adaptive preconditioning for early vision," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 19, pp. 594-607, 1997.
Abstract:
Several problems in early vision have been formulated in the past in a
regularization framework. These problems, when discretized, lead to
large sparse linear systems. In this paper, we present a novel
physically based adaptive preconditioning technique which can be used
in conjunction with a conjugate gradient algorithm to dramatically
improve the speed of convergence for solving the aforementioned linear
systems. A preconditioner, based on the membrane spline, or the thin
plate spline, or a convex combination of the two, is termed a
physically based preconditioner for obvious reasons. The adaptation of
the preconditioner to an early vision problem is achieved via the
explicit use of the spectral characteristics of the regularization
filter in conjunction with the data. This spectral function is used to
modulate the frequency characteristics of a chosen wavelet basis, and
these modulated values are then used in the construction of our
preconditioner. We present the preconditioner construction for three
different early vision problems namely, the surface reconstruction, the
shape from shading, and the optical flow computation problems.
Performance of the preconditioning scheme is demonstrated via
experiments on synthetic and real data sets. We note that our
preconditioner outperforms other methods of preconditioning for these
early vision problems, described in computer Vision literature.
|
157. | Richards, CA, and Papanikolopoulos, NP, "Detection and tracking for robotic visual servoing systems," ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, vol. 13, pp. 101-120, 1997.
Abstract:
Robot manipulators require knowledge about their environment in order
to perform their desired actions. In several robotic tasks, vision
sensors play a critical role by providing the necessary quantity and
quality of information regarding the robot's environment. For example,
''visual servoing'' algorithms may control a robot manipulator in order
to track moving objects that are being imaged by a camera. Current
visual servoing systems often lack the ability to detect automatically
objects that appear within the camera's field of view. In this
research, we present a robust ''figure/ground'' framework for visually
detecting objects of interest. An important contribution of this
research is a collection of optimization schemes that allow tbe
detection framework to operate within the real-time Limits of visual
servoing systems. The most significant of these schemes involves the
use of ''spontaneous'' and ''continuous'' domains. The number and
location of continuous domains are,allowed to change over time,
adjusting to the dynamic conditions of the detection process. We have
developed actual servoing systems in order to test the framework's
feasibility and to demonstrate its usefulness for visually controlling
a robot manipulator. (C) 1997 Elsevier Science Ltd.
|
158. | Hamza, R, Zhang, XDD, Macosko, CW, Steve, R, and Listemann, M, "Imaging open-cell polyurethane foam via confocal microscopy," POLYMERIC FOAMS, ACS SYMPOSIUM SERIES, vol. 669, pp. 165-177, 1997.
Abstract:
Flexible polyurethane foam is based on a 3-dimensional cellular
network. The mechanical properties of foam material depend upon cell
structure and cell size distribution. In this work, we use laser
confocal microscopy to image the foam cells and recover its
3-dimensional cellular network. Based on this technique we provide a
statistical analysis and compare several foam samples. Confocal
microscopic images are also used to visualize foam compression. Images
for foam network structure under different mechanical compressions are
also obtained. Limitations of confocal microscope are discussed and a
new method - nuclear magnetic resonance imaging is proposed.
|
159. | Smyth, PP, Taylor, CJ, and Adams, JE, "Automatic measurement of vertebral shape using active shape models," IMAGE AND VISION COMPUTING, vol. 15, pp. 575-581, 1997.
Abstract:
In this paper, we describe how Active Shape Models (ASMs) have been
used to accurately and robustly locate vertebrae in lateral Dual Energy
X-ray Absorptiometry (DXA) images of the spine. DXA images are of low
spatial resolution, and contain significant random and structural
noise, providing a difficult challenge for object location methods. All
vertebrae in the image were searched for simultaneously, improving
robustness in location of individual vertebrae by making use of
constraints on shape provided by the position of other vertebrae. We
show that the use of ASMs with minimal user interaction allows accuracy
to be obtained which is as good as that achievable by human operators,
as well as high precision. Having located each vertebra, it is
desirable to evaluate whether it has been located sufficiently
accurately for shape measurements to be useful. We determined this on
the basis of grey-level model fit, which was shown to usefully detect
poorly located vertebrae, which should enable accuracy to be improved
by rejecting proposed search solutions whose grey-level fit was poorer
than a threshold. (C) 1997 Elsevier Science B.V.
|
160. | Pathak, SD, Chalana, V, and Kim, YM, "Interactive automatic fetal head measurements from ultrasound images using multimedia computer technology," ULTRASOUND IN MEDICINE AND BIOLOGY, vol. 23, pp. 665-673, 1997.
Abstract:
We have developed a tool to automatically detect inner and outer skull
boundaries of a fetal head in ultrasound images, These boundaries are
used to measure biparietal diameter (BPD) and head circumference (HC).
The algorithm is based on active contour models and takes 32 s on a Sun
SparcStation 20/71, A high-performance desktop multimedia system called
MediaStation 5000 (MS5000) is used as a model for our future ultrasound
subsystem, On the MS5000, the optimized implementation of this
algorithm takes 248 ms, The difference (between the computer-measured
values on MS5000 and the gold standard) for BPD and HC was 1.43% (sigma
= 1,00%) and 1.96% (sigma = 1.96%), respectively. According to our data
analysis, no significant differences exist in the BPD and HC
measurements made on the MS5000 and those measurements made on the Sun
SparcStation 20/71, Reduction in the overall execution time from 32 s
to 248 ms will help making this algorithm a practical ultrasound tool
for sonographers, (C) 1997 World Federation for Ultrasound in Medicine
and Biology.
|
161. | Chiou, GI, and Hwang, JN, "Lipreading from color video," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 6, pp. 1192-1195, 1997.
Abstract:
We have designed and implemented a lipreading system that recognizes
isolated words using only color video of human lips (without acoustic
data). The system performs video recognition using ''snakes'' to
extract visual features of geometric space, Karhunen-Loeve transform
(KLT) to extract principal components in the color eigenspace, and
hidden Markov models (HMM's) to recognize the combined visual features
sequences. With the visual information alone, we were able to achieve
94% accuracy for ten isolated words.
|
162. | Moghaddam, B, and Pentland, A, "Probabilistic visual learning for object representation," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 19, pp. 696-710, 1997.
Abstract:
We present an unsupervised technique for visual learning, which is
based on density estimation in high-dimensional spaces using an
eigenspace decomposition. Two types of density estimates are derived
for modeling the training data: a multivariate Gaussian (for unimodal
distributions) and a Mixture-of-Gaussians model (for multimodal
distributions). These probability densities are then used to formulate
a maximum-likelihood estimation framework for visual search and target
detection for automatic object recognition and coding. Our learning
technique is applied to the probabilistic visual modeling, detection,
recognition, and coding of human faces and nonrigid objects, such as
hands.
|
163. | Gruen, A, and Li, HH, "Semi-automatic linear feature extraction by dynamic programming and LSB-Snakes," PHOTOGRAMMETRIC ENGINEERING AND REMOTE SENSING, vol. 63, pp. 985-995, 1997.
Abstract:
This paper deals with semi-automatic linear feature extraction from
digital images for GIS data capture, where the identification task is
performed manually on a single image, while a special automatic digital
module performs the high precision feature tracking in two-dimensional
(2-D) image space or even three-dimensional (3-D) object space. A human
operator identifies the object from an on-screen display of a digital
image, selects the particular class this object belongs to, and
provides a very few coarsely distributed seed points. Subsequently,
with these seed points as an approximation of the position and shape,
the linear feature will be extracted automatically by either a dynamic
programming approach or by LSB-Snakes (Least-Squares B-spline Snakes).
With dynamic programming, the optimization problem is set up as a
discrete multistage decision process and is solved by a time delayed''
algorithm. It ensures global optimality, is numerically stable, and
allows for hard constraints to be enforced on the solution. In the
least-squares approach, we combine three types of observation
equations, one radiometric, formulating the matching of a generic
object model with image data, and two that express the internal
geometric constraints of a curve and the location of operator-given
seed points. The solution is obtained by solving a pair of independent
normal equations to estimate the parameters of the spline curve. Both
techniques can be used in a monoplotting mode, which combines one image
with its underlying DTM. The LSB-Snakes approach is also implemented in
a multi-image mode, which uses multiple images simultaneously and
provides for a robust and mathematically sound full 3D approach. These
techniques are not restricted to aerial images. They can be applied to
satellite and close-range images as well. The issues related to the
mathematical modeling of the proposed methods are discussed and
experimental results are shown in this paper too.
|
164. | Kollnig, H, and Nagel, HM, "3D pose estimation by directly matching polyhedral models to gray value gradients," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 23, pp. 283-302, 1997.
Abstract:
This contribution addresses the problem of pose estimation and tracking
of vehicles in image sequences from traffic scenes recorded by a
stationary camera. In a new algorithm, the vehicle pose is estimated by
directly matching polyhedral vehicle models to image gradients without
an edge segment extraction process. The new approach is significantly
more robust than approaches that rely on feature extraction since the
new approach exploits more information from the image data. We
successfully tracked vehicles that were partially occluded by textured
objects, e.g., foliage, where a previous approach based on edge segment
extraction failed. Moreover, the new pose estimation approach is also
used to determine the orientation and position of the road relative to
the camera by matching an intersection model directly to image
gradients. Results from various experiments with real world traffic
scenes are presented.
|
165. | Ashton, EA, Parker, KJ, Berg, MJ, and Chen, CW, "A novel volumetric feature extraction technique with applications to MR images," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 16, pp. 365-371, 1997.
Abstract:
A semiautomated feature extraction algorithm is presented for the
extraction and measurement of the hippocampus from volumetric magnetic
resonance imaging (MRI) head scans. This algorithm makes use of
elements of both deformable model and region growing techniques and
allows incorporation of a priori operator knowledge of hippocampal
location and shape, Experimental results indicate that the algorithm is
able to estimate hippocampal volume and asymmetry with an accuracy
which approaches that of laborious manual outlining techniques.
|
166. | Wolberg, WH, Street, WN, and Mangasarian, OL, "Computer-derived nuclear features compared with axillary lymph node status for breast carcinoma prognosis," CANCER CYTOPATHOLOGY, vol. 81, pp. 172-179, 1997.
Abstract:
BACKGROUND. Both axillary lymph node involvement and tumor anaplasia,
as expressed by visually assessed grade, have been shown to be
prognostically important in breast carcinoma outcome. In this study,
axillary lymph node involvement was used as the standard against which
prognostic estimations based on computer-derived nuclear features were
gauged,
METHODS, The prognostic significance of nuclear morphometric features
determined by computer-based image analysis were analyzed in 198
consecutive preop preoperative samples obtained by fine-needle
aspiration (FNA) from patients with invasive breast carcinoma. A novel
multivariate prediction method was used to model the time of distant
recurrence as a function of the nuclear features. Prognostic
predictions based on the nuclear feature data were cross-validated to
avoid overly optimistic conclusions. The estimated accuracy of these
prognostic determinations was compared with determinations based on the
extent of axillary lymph node involvement.
RESULTS. The predicted outcomes based on nuclear features were divided
into three groups representing best, intermediate, and worst prognosis,
and compared with the traditional TNM lymph node stratification.
Nuclear feature stratification better separated the prognostically best
from the intermediate group whereas lymph node stratification better
separated the prognostically intermediate from the worst group.
Prognostic accuracy was not increased by adding lymph node status or
tumor size to the nuclear features.
CONCLUSIONS. Computer analysis of a preoperative FNA more accurately
identified prognostically favorable patients than did pathologic
examination of axillary lymph nodes and may obviate the need for
routine axillary lymph node dissection. (C) 1997 American Cancer
Society.
|
167. | March, R, and Dozio, M, "A variational method for the recovery of smooth boundaries," IMAGE AND VISION COMPUTING, vol. 15, pp. 705-712, 1997.
Abstract:
Variational methods for image segmentation try to recover a piecewise
smooth function together with a discontinuity set which represents the
boundaries of the segmentation. This paper deals with a variational
method that constrains the formation of discontinuities along smooth
contours. The functional to be minimized, which involves the
computation of the geometrical properties of the boundaries, is
approximated by a sequence of functionals which can be discretized in a
straightforward way. Computer examples of real images are presented to
illustrate the feasibility of the method. (C) 1997 Elsevier Science B.V.
|
168. | Whaite, P, and Ferrie, FP, "On the sequential determination of model misfit," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 19, pp. 899-905, 1997.
Abstract:
Many strategies in computer vision assume the existence of general
purpose models that can be used to characterize a scene or environment
at various levels of abstraction. The usual assumptions are that a
selected model is competent to describe a particular attribute and that
the parameters of this model can be estimated by interpreting the input
data in an appropriate manner (e.g., location of lines and edges,
segmentation into parts or regions, etc.). This paper considers the
problem of how to determine when those assumptions break down. The
traditional approach is to use statistical misfit measures based on an
assumed sensor noise model. The problem is that correct operation often
depends critically on the correctness of the noise model. Instead, we
show how this can be accomplished with a minimum of a priori knowledge
and within the framework of an active approach which builds a
description of environment structure and noise over several viewpoints.
|
169. | Taylor, CJ, Cootes, TF, Lanitis, A, Edwards, G, Smyth, P, and Kotcheff, ACW, "Model-based interpretation of complex and variable images," PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY OF LONDON SERIES B-BIOLOGICAL SCIENCES, vol. 352, pp. 1267-1274, 1997.
Abstract:
The ultimate goal of machine vision is image understanding-the ability
not only to recover image structure but also to know what it
represents. By definition, this involves the use of models which
describe and label the expected structure of the world. Over the past
decade, model-based vision has been applied successfully to images of
man-made objects. It has proved much more difficult to develop
model-based approaches to the interpretation of images of complex and
variable structures such as faces or the internal organs of the human
body (as visualized in medical images). In such cases it has been
problematic even to recover image structure reliably without a model to
organize the often noisy and incomplete image evidence. The key problem
is that of variability. To be useful, a model needs to be specific-that
is, to be capable of representing only 'legal' examples of the modelled
object(s). It has proved difficult to achieve this whilst allowing for
natural variability. Recent developments have overcome this problem; it
has been shown that specific patterns of variability in shape and
grey-level appearance can be captured by statistical models that can be
used directly in image interpretation. The details of the approach are
outlined and practical examples from medical image interpretation and
face recognition are used to illustrate how previously intractable
problems can now be tackled successfully. It is also interesting to ask
whether these results provide any possible insights into natural
vision; for example, we show that the apparent changes in shape which
result from viewing three-dimensional objects from different viewpoints
can be modelled quite well in two dimensions; this may lend some
support to the 'characteristic views' model of natural vision.
|
170. | Cohen, LD, and Kimmel, R, "Global minimum for active contour models: A minimal path approach," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 24, pp. 57-78, 1997.
Abstract:
A new boundary detection approach for shape modeling is presented. It
detects the global minimum of an active contour model's energy between
two end points. Initialization is made easier and the curve is not
trapped at a local minimum by spurious edges. We modify the ''snake''
energy by including the internal regularization term in the external
potential term. Our method is based on finding a path of minimal length
in a Riemannian metric. We then make use of a new efficient numerical
method to find this shortest path.
It is shown that the proposed energy, though based only on a potential
integrated along the curve, imposes a regularization effect like
snakes. We explore the relation between the maximum curvature along the
resulting contour and the potential generated from the image.
The method is capable to close contours, given only one point on the
objects' boundary by using a topology-based saddle search routine.
We show examples of our method applied to real aerial and medical
images.
|
171. | Poon, CS, and Braun, M, "Image segmentation by a deformable contour model incorporating region analysis," PHYSICS IN MEDICINE AND BIOLOGY, vol. 42, pp. 1833-1841, 1997.
Abstract:
Deformable contour models are useful tools for image segmentation.
However, many models depend mainly on local edge-based image features
to guide the convergence of the contour. This makes the models
sensitive to noise and the initial estimate. Our model incorporates
region-based image features to improve its convergence and to reduce
its dependence on initial estimation. Computational efficiency is
achieved by an optimization strategy, modified from the greedy
algorithm of Williams and Shah. The model allows a simultaneous
optimization of multiple contours, making it useful for a large variety
of segmentation problems.
|
172. | Shih, WSV, Lin, WC, and Chen, CT, "Morphologic field morphing: Contour model-guided image interpolation," INTERNATIONAL JOURNAL OF IMAGING SYSTEMS AND TECHNOLOGY, vol. 8, pp. 480-490, 1997.
Abstract:
An interpolation method using contours of organs as the control
parameters is proposed to recover the intensity information in the
physical gaps of serial cross-sectional images. In our method, contour
models are used to generate the control lines required for the warping
algorithm. Contour information derived from this contour model-based
segmentation process is processed and used as the control parameters to
warp the corresponding regions in both input images into compatible
shapes. In this way, the reliability of establishing the correspondence
among different segments of the same organs is improved and the
intensity information for the interpolated intermediate slices can be
derived more faithfully, To improve the efficiency for calculating the
image warp in the field morphing process, a hierarchic decomposition
process is proposed to localize the influence of each control line
segment, In comparison with the existing intensity interpolation
algorithms that only search for corresponding points in a small
physical neighborhood, this method provides more meaningful
correspondence relationships by warping regions in images into similar
shapes before resampling to account for significant shape differences.
Several sets of experimental result are presented to show that this
method generates more realistic and less blurred interpolated images,
especially when the shape difference of corresponding contours is
significant. (C) 1997 John Wiley & Sons, Inc.
|
173. | Dickinson, SJ, Christensen, HI, Tsotsos, JK, and Olofsson, G, "Active object recognition integrating attention and viewpoint control," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 67, pp. 239-260, 1997.
Abstract:
We present an active object recognition strategy which combines the use
of an attention mechanism for focusing the search for a 3D object in a
2D image, with a viewpoint control strategy for disambiguating
recovered object features. The attention mechanism consists of a
probabilistic search through a hierarchy of predicted feature
observations, taking objects into a set of regions classified according
to the shapes of their bounding contours. We motivate the use of image
regions as a focus-feature and compare their uncertainty in inferring
objects with the uncertainty of more commonly used features such as
lines or corners. If the features recovered during the attention phase
do not provide a unique mapping to the 3D object being searched, the
probabilistic feature hierarchy can be used to guide the camera to a
new viewpoint from where the object can be disambiguated. The power of
the underlying representation is its ability to unify these object
recognition behaviors within a single framework. We present the
approach in detail and evaluate its performance in the context of a
project providing robotic aids for the disabled. (C) 1997 Academic
Press.
|
174. | Juhan, V, Nazarian, B, Malkani, K, Bulot, R, Bartoli, JM, and Sequeira, J, "Geometrical modelling of abdominal aortic aneurysms," CVRMED-MRCAS'97, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1205, pp. 243-252, 1997.
Abstract:
Stent graft combination devices have been developed as a new
alternative for treating abdominal aortic aneurysms. The major risk
using this new technique with standard devices is the perigraft leak.
In order to choose a suitable graft for each patient, and thus avoid
such a risk, we have developed a program which provides
three-dimensional representations of such aneurysms.
Images of abdominal regions are obtained by spiral C.T.. These images
are then transferred to a graphics workstation and processed to provide
sets of contours which represent the shape of the aorta and other
vessels. Then, a surface joining all these contours is computed; we
obtain a tree-like structure represented as a set of generalized
cylinders which are joined by means of flee-form surfaces. Such
geometrical models provide an efficient mathematical support for
further developments involving diagnosis, surgery and endoprostheses
design.
|
175. | Delingette, H, "Decimation of isosurfaces with deformable models," CVRMED-MRCAS'97, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1205, pp. 83-92, 1997.
Abstract:
For many medical applications including computer-assisted surgery, it
is necessary to perform scientific computations, such as mechanical
deformation, on anatomical structure models. Such patient-based
anatomical models are often extracted from volumetric medical images as
isosurfaces. In this paper, we introduce a new algorithm for the
decimation of isosurfaces based on deformable models. The method
emphasizes the creation of mesh of high geometric and topological
properties well suited for performing scientific computation. rt allows
a close control of the distance of the mesh to the isosurface as well a
the overall smoothness of the mesh. The isosurface is stored in a
data-structure that enables the fast computation of the distance to the
isosurface. Finally, our method can handle very large datasets by
merging pieces of isosurfaces.
|
176. | Jones, TN, and Metaxas, DN, "Segmentation using deformable models with affinity-based localization," CVRMED-MRCAS'97, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1205, pp. 53-62, 1997.
Abstract:
We have developed an algorithm for segmenting objects with simple
closed curves, such as the heart and the lungs, that is independent of
the imaging modality used (e.g., MRI, CT, echocardiography). Our method
is automatic and requires as initialization a single pixel within the
boundaries of the object. Existing segmentation techniques either
require much more information during initialization, such as an
approximation to the object's boundary, or are not robust to the types
of noisy data encountered in the medical domain. By integrating
region-based and physics-based modeling techniques we have devised a
hybrid design that overcomes these limitations. In our experiments we
demonstrate that this integration automates and significantly improves
the object boundary detection results, independent of the imaging
modality used.
|
177. | McInerney, T, and Terzopoulos, D, "Medical image segmentation using topologically adaptable surfaces," CVRMED-MRCAS'97, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1205, pp. 23-32, 1997.
Abstract:
Efficient and powerful topologically adaptable deformable surfaces can
be created by embedding and defining discrete deformable surface models
in terms of an Affine Cell Decomposition (ACD) framework. The ACD
framework, combined with a novel and original reparameterization
algorithm, creates a simple but elegant mechanism for multiresolution
deformable curve, surface, and solid models to ''flow'' or ''grow''
into objects with complex geometries and topologies, and adapt their
shape to recover the object boundaries. ACD-based models maintain the
traditional parametric physics-based formulation of deformable models,
allowing them to incorporate a priori knowledge in the form of energy
and force-based constraints, and provide intuitive interactive
capabilities. This paper describes ACD-based deformable surfaces and
demonstrates their potential for extracting and reconstructing some of
the most complex biological structures from medical image volumes.
|
178. | Montagnat, J, and Delingette, H, "Volumetric medical images segmentation using shape constrained deformable models," CVRMED-MRCAS'97, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1205, pp. 13-22, 1997.
Abstract:
In this paper we address the problem of extracting geometric models
from lour contrast volumetric images, given a template or reference
shape of that model. We proceed by deforming a reference model in a
volumetric image. This reference deformable model is represented as a
simplex mesh submitted to regularizing shape constraint. Furthermore,
we introduce an original approach that combines the deformable model
framework with the elastic registration (based on iterative closest
point algorithm) method. This new method increases the robustness of
segmentation while allowing very complex deformation, of the original
template. Examples of segmentation of the liver and brain ventricles
are provided.
|
179. | Carmona, RA, Hwang, WL, and Torresani, B, "Characterization of signals by the ridges of their wavelet transforms," IEEE TRANSACTIONS ON SIGNAL PROCESSING, vol. 45, pp. 2586-2590, 1997.
Abstract:
We present a couple of new algorithmic procedures for the detection of
ridges in the modulus of the (continuous) wavelet transform of
one-dimensional (1-D) signals, These detection procedures are shown to
be robust to additive white noise, We also derive and test a new
reconstruction procedure, The latter uses only information from the
restriction of the wavelet transform to a sample of points from the
ridge. This provides a very efficient way to code the information
contained in the signal.
|
180. | Caselles, V, Kimmel, R, Sapiro, G, and Sbert, C, "Minimal surfaces: a geometric three dimensional segmentation approach," NUMERISCHE MATHEMATIK, vol. 77, pp. 423-451, 1997.
Abstract:
A novel geometric approach for three dimensional object segmentation is
presented. The scheme is based on geometric deformable surfaces moving
towards the objects to be detected, We show that this model is related
to the computation of surfaces of minimal area (local minimal
surfaces). The space where these surfaces are computed is induced from
the three dimensional image in which the objects are to be detected.
The general approach also shows the relation between classical
deformable surfaces obtained via energy minimization and geometric ones
derived from curvature flows in the surface evolution framework. The
scheme is stable, robust, and automatically handles changes in the
surface topology during the deformation. Results related to existence,
uniqueness, stability, and correctness of the solution to this
geometric deformable model are presented as well. Based on an efficient
numerical algorithm for surface evolution, we present a number of
examples of object detection in real and synthetic images.
|
181. | Axel, L, "Noninvasive measurement of cardiac strain with MRI," ANALYTICAL AND QUANTITATIVE CARDIOLOGY, ADVANCES IN EXPERIMENTAL MEDICINE AND BIOLOGY, vol. 430, pp. 249-256, 1997.
Abstract:
The motion sensitivity of cardiac magnetic resonance imaging (MRI) can
be exploited to measure the motion patterns within the heart wall and
thus to noninvasively calculate the intramyocardial strain. The
resulting large data sets pose a challenge for visualization, but offer
the potential of a greatly improved picture of cardiac dynamics. This
may have both basic research and clinical applications.
|
182. | Grzeszczuk, RP, and Levin, DN, "''Brownian strings'': Segmenting images with stochastically deformable contours," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 19, pp. 1100-1114, 1997.
Abstract:
This paper describes an image segmentation technique in which an
arbitrarily shaped contour was deformed stochastically until it fitted
around an object of interest. The evolution of the contour was
controlled by a simulated annealing process which caused the contour to
settle into the global minimum of an image-derived ''energy'' function.
The nonparametric energy function was derived from the statistical
properties of previously segmented images, thereby incorporating prior
experience. Since the method was based on a state space search for the
contour with the best global properties, it was stable in the presence
of image errors which confound segmentation techniques based on local
criteria, such as connectivity. Unlike ''snakes'' and other active
contour approaches, the new method could handle arbitrarily irregular
contours in which each interpixel crack represented an independent
degree of freedom. Furthermore, since the contour evolved toward the
global minimum of the energy, the method was more suitable for fully
automatic applications than the snake algorithm, which frequently has
to be reinitialized when the contour becomes trapped in local energy
minima. High computational complexity was avoided by efficiently
introducing a random local perturbation in a time independent of
contour length, providing control over the size of the perturbation,
and assuring that resulting shape changes were unbiased. The method was
illustrated by using it to find the brain surface in magnetic resonance
head images and to track blood vessels in angiograms.
|
183. | Park, JS, and Han, JH, "Estimating optical flow by tracking contours," PATTERN RECOGNITION LETTERS, vol. 18, pp. 641-648, 1997.
Abstract:
We present a novel method of velocity field estimation for the points
on moving contours in a 2-D image sequence. The method determines the
corresponding point in a next image frame by minimizing the curvature
change of a given contour point. As a first step, snakes are used to
locate smooth curves in 2-D imagery. Thereafter, the extracted curves
are tracked continuously computing the corresponding point for each
contour point. (C) 1997 Published by Elsevier Science B.V.
|
184. | Hozumi, T, Yoshida, K, Yoshioka, H, Yagi, T, Akasaka, T, Takagi, T, Nishiura, M, Watanabe, M, and Yoshikawa, J, "Echocardiographic estimation of left ventricular cavity area with a newly developed automated contour tracking method," JOURNAL OF THE AMERICAN SOCIETY OF ECHOCARDIOGRAPHY, vol. 10, pp. 822-829, 1997.
Abstract:
Development of an automated contour tracking method provides detection
and tracking of the endocardial boundary using the energy minimization
method without tracing a region of interest. The purpose of this study
was to compare the automated contour tracking method and manually drawn
methods for the measurement of left ventricular cavity areas and
fractional area change. Apical four-chamber view was visualized and
recorded for off-line analysis in 11 patients by means of
two-dimensional echocardiography. The automated contour tracking method
automatically traces the endocardial border from the recorded images
and calculates left ventricular cavity areas (end-diastole and
end-systole) and fractional area change. In the same images selected as
end-diastole and end-systole in the automated contour tracking method,
left ventricular endocardial border was manually traced to calculate
left ventricular cavity areas and fractional area change. Both methods
were compared by Linear regression analysis for the measurement of
cavity areas and fractional area change. Left ventricular areas
measured by the automated contour tracking method showed an excellent
correlation with those by the manual method (end-diastole: r = 0.99, y
= 0.83x + 2.6, standard error of the estimate = 1.5 cm(2); end-systole:
r = 0.99, y = 0.96x - 0.8, standard error of the estimate = 1.2 cm(2)).
The mean differences between the automated contour tracking and manual
methods were -3.1 +/- 5.1 cm(2) and -1.6 +/- 2.4 cm(2) at end-diastole
and end-systole, respectively. Fractional area change determined by the
automated contour tracking method correlated well with that by the
manual method (r = 0.95, y = 1.17x - 6.5, standard error of the
estimate = 3.4%). The mean difference between the automated contour
tracking and manual methods was -0.8% +/- 7.1%. In conclusion, a newly
developed automated contour tracking method correlates highly with the
manual method for the estimation of left ventricular cavity areas and
fractional area change in high-quality images. This suggests that this
new technique may be useful in the automated quantitation of left
ventricular function in patients with high-quality images with no
dropout and no intercavity artifact or structure.
|
185. | Fasel, JHD, Gingins, P, Kalra, P, MagnenatThalmann, N, Baur, C, Cuttat, JF, Muster, M, and Gailloud, P, "Liver of the ''visible man''," CLINICAL ANATOMY, vol. 10, pp. 389-393, 1997.
Abstract:
Endoscopic surgery, also called minimally invasive surgery, is presumed
drastically to reduce postoperative morbidity and thus to offer both
human and economic benefits. For the surgeon, however, this approach
leads to a number of gestural challenges that require extensive
training to be mastered. In order to replace experimentation on animals
and patients, we developed a simulator for endoscopic surgery. To
achieve this goal, a first step was to develop a working prototype, a
''standard patient,'' on which the informatic and microengineering
tools could be validated. We used the visible man dataset for this
purpose. The external shape of the Visible man's liver, his biliary
passages, and his extrahepatic portal system turned out to be fully
within the standard pattern of normal anatomy. Anatomic Variations were
observed in the intrahepatic right portal vein, the hepatic veins, and
the arterial blood supply to the liver. Thus, the visible man dataset
reveals itself to be well suited for the simulation of minimally
invasive surgical operation such as endoscopic cholecystectomy. (C)
1997 Wiley-Liss, Inc.
|
186. | Breen, DE, "Cost minimization for animated geometric models in computer graphics," JOURNAL OF VISUALIZATION AND COMPUTER ANIMATION, vol. 8, pp. 201-220, 1997.
Abstract:
This paper describes how the concept of imposing geometric constraints
by minimizing cost functions may be used and extended to accomplish a
variety of animated modelling tasks for computer graphics. In this
approach a complex 3-D geometric problem is mapped into a scalar
minimization formulation. The mapping provides a straightforward method
for converting abstract geometric concepts into a construct that is
easily computed, The minimization approach is demonstrated in three
application areas: computer animation, visualization, and
physically-based modelling. In the computer animation application, cost
minimization may be used to generate motion paths and joint parameters
for animated actors. The approach may also be used to generate
deformable models that extract closed 3-D geometric models from volume
data for visualization, In the final application, the approach provides
the fundamental structure to a physically-based model of woven cloth.
(C) 1997 John Wiley & Sons, Ltd.
|
187. | Hanson, KM, Cunningham, GS, and McKee, RJ, "Uncertainty assessment for reconstructions based on deformable geometry," INTERNATIONAL JOURNAL OF IMAGING SYSTEMS AND TECHNOLOGY, vol. 8, pp. 506-512, 1997.
Abstract:
Deformable geometric models can be used in the context of Bayesian
analysis to solve ill-posed tomographic reconstruction problems. The
uncertainties associated with a Bayesian analysis may be assessed by
generating a set of random samples from the posterior, which may be
accomplished using a Markov Chain Monte Carlo (MCMC) technique. We
demonstrate the combination of these techniques for a reconstruction of
a two-dimensional object from two orthogonal noisy projections. The
reconstructed object is modeled in terms of a deformable geometrically
defined boundary with a uniform interior density yielding a nonlinear
reconstruction problem. We show how an MCMC sequence can be used to
estimate uncertainties in the location of the edge of the reconstructed
object. (C) 1997 John Wiley & Sons, Inc.
|
188. | Guy, G, and Medioni, G, "Inference of surfaces, 3D curves, and junctions from sparse, noisy, 3D data," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 19, pp. 1265-1277, 1997.
Abstract:
We address the problem of obtaining dense surface information from a
sparse set of 3D data in the presence of spurious noise samples. The
input can be in the form of points, or points with an associated
tangent or normal, allowing both position and direction to be corrupted
by noise. Most approaches treat the problem as an interpolation
problem, which is solved by fitting a surface such as a membrane or
thin plate to minimize some function. We argue that these physical
constraints are not sufficient, and propose to impose additional
perceptual constraints such as good continuity and ''cosurfacity.''
These constraints allow us to not only infer surfaces, but also to
detect surface orientation discontinuities, as well as junctions, all
at the same time. The approach Imposes no restriction on genus, number
of discontinuities, number of objects, and is noniterative. The result
is in the form of three dense saliency maps for surfaces, intersections
between surfaces (i.e., 3D curves), and 3D junctions, respectively.
These saliency maps are then used to guide a ''marching'' process to
generate a description (e.g., a triangulated mesh) making information
about surfaces, space curves, and 3D junctions explicit. The
traditional marching process needs to be refined as the polarity of the
surface orientation is not necessarily locally consistent. These three
maps are currently not integrated, and this is the topic of our ongoing
research. We present results on a variety of computer-generated and
real data, having varying curvature, of different genus, and multiple
objects.
|
189. | Sapiro, G, "Color snakes," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 68, pp. 247-253, 1997.
Abstract:
A framework for object segmentation in vector-valued images is
presented in this paper. The first scheme proposed is based on
geometric active contours moving toward the objects to be detected in
the vector-valued image. Object boundaries are obtained as geodesics or
minimal weighted-distance curves, where the metric is given by a
definition of edges in vector-valued data. The curve flow corresponding
to the proposed active contours holds formal existence, uniqueness,
stability, and correctness results. The scheme automatically handles
changes in the deforming curve topology. The technique is applicable,
for example, to color and texture images as well as multiscale
representations. We then present an extension of these vector active
contours, proposing a possible image flow for vector-valued image
segmentation. The algorithm is based on moving each one of the image
level sets according to the proposed vector active contours. This
extension also shows the relation between active contours and a number
of partial-differential-equations-based image processing algorithms as
anisotropic diffusion and shock filters. (C) 1997 Academic Press.
|
190. | Ip, HHS, and Wong, WH, "Detecting perceptually parallel curves: Criteria and force-driven optimization," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 68, pp. 190-208, 1997.
Abstract:
We have developed several theorems for the detection of parallel curves
in the continuous space. In this paper, we studied issues in carrying
the continuous algorithm to the discrete case and also the perceptual
characteristics leading to human recognition of parallelism. By
formulating these properties in terms of several distinctive forces, we
developed a force-driven model as a new optimization strategy to
perform correspondence establishment between points in the matching
curves. This force-driven mechanism provides a good coupling (or
correspondence matching) result, which is the prerequisite for the
correct detection of parallelism between curves. Convergence of the
algorithm and implementation efficiency are also investigated and
discussed. Experimental results on the relative weightings of these
forces also shed light on the perceptual priority imposed by the human
vision system. (C) 1997 Academic Press.
|
191. | Siddiqi, K, Kimia, BB, and Shu, CW, "Geometric shock-capturing ENO schemes for subpixel interpolation, computation and curve evolution," GRAPHICAL MODELS AND IMAGE PROCESSING, vol. 59, pp. 278-301, 1997.
Abstract:
Subpixel methods that locate curves and their singularities, and that
accurately measure geometric quantities, such as orientation and
curvature, are of significant importance in computer vision and
graphics. Such methods often use local surface fits or structural
models for a local neighborhood of the curve to obtain the interpolated
curve. Whereas their performance is good in smooth regions of the
curve, it is typically poor in the vicinity of singularities.
Similarly, the computation of geometric quantities is often regularized
to deal with noise present in discrete data. However, in the process,
discontinuities are blurred over, leading to poor estimates at them and
in their vicinity. In this paper we propose a geometric interpolation
technique to overcome these limitations by locating curves and
obtaining geometric estimates while (1) not blurring across
discontinuities and (2) explicitly and accurately placing them, The
essential idea is to avoid the propagation of information across
singularities. This is accomplished by a one-sided smoothing technique,
where information is propagated from the direction of the side with the
''smoother'' neighborhood. When both sides are nonsmooth, the two
existing discontinuities are relieved by placing a single
discontinuity, or shock. The placement of shacks is guided by geometric
continuity constraints, resulting in subpixel interpolation with
accurate geometric estimates. Since the technique was originally
motivated by curve evolution applications, we demonstrate its
usefulness in capturing not only smooth evolving curves, but also ones
with orientation discontinuities. In particular, the technique is shown
to be far better than traditional methods when multiple or entire
curves are present in a very small neighborhood. (C) 1997 Academic
Press.
|
192. | Goudail, F, and Refregier, P, "Optimal target tracking on image sequences with a deterministic background," JOURNAL OF THE OPTICAL SOCIETY OF AMERICA A-OPTICS IMAGE SCIENCE AND VISION, vol. 14, pp. 3197-3207, 1997.
Abstract:
Until now, most optical pattern recognition filters have been designed
to process one image at a time. However, in image sequences, successive
frames are highly correlated, so that it is useful to take this
correlation into account while designing the filter. We develop a
target tracking processor following this method. The images are assumed
to consist of a moving object appearing against a moving background. A
model that takes into account two successive frames is designed. From
this model we determine the maximum-likelihood processor for tracking
the object from one frame to the next. Since this processor is based on
correlation operations, it could be implemented on a hybrid
optoelectronic system that makes use of the rapidity of optical
correlation. (C) 1997 Optical Society of America.
|
193. | Noll, D, and vonSeelen, W, "Object recognition by deterministic annealing," IMAGE AND VISION COMPUTING, vol. 15, pp. 855-860, 1997.
Abstract:
In this paper we describe a feature-based approach to object
recognition. The correspondence problem is solved by optimization of an
energy function. While similar approaches suffer from local minima, we
derive an energy function suitable for minimizing by deterministic
annealing. Hereby global optimization can be achieved. Algorithms
matching model features to image features in a coarse-to-fine manner
are described. (C) 1997 Elsevier Science B.V.
|
194. | Seitz, SM, and Dyer, CR, "View-invariant analysis of cyclic motion," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 25, pp. 231-251, 1997.
Abstract:
This paper presents a general framework for image-based analysis of 3D
repeating motions that addresses two limitations in the state of the
art. First, the assumption that a motion be perfectly even from one
cycle to the next is relaxed. Real repeating motions tend not to be
perfectly even, i.e., the length of a cycle varies through time because
of physically important changes in the scene. A generalization of
period is defined for repeating motions that makes this temporal
variation explicit. This representation, called the period trace, is
compact and purely temporal, describing the evolution of an object or
scene without reference to spatial quantities such as position or
velocity. Second, the requirement that the observer be stationary is
removed. Observer motion complicates image analysis because an object
that undergoes a 3D repeating motion will generally not produce a
repeating sequence of images. Using principles of affine invariance, we
derive necessary and sufficient conditions for an image sequence to be
the projection of a 3D repeating motion, accounting for changes in
viewpoint and other camera parameters. Unlike previous work in visual
invariance, however, our approach is applicable to objects and scenes
whose motion is highly non-rigid. Experiments on real image sequences
demonstrate how the approach may be used to detect several types of
purely temporal motion features, relating to motion trends and
irregularities. Applications to athletic and medical motion analysis
are discussed.
|
195. | Neuenschwander, WM, Fua, P, Iverson, L, Szekely, G, and Kubler, O, "Ziplock snakes," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 25, pp. 191-201, 1997.
Abstract:
We propose a snake-based approach that allows a user to specify only
the distant end points of the curve he wishes to delineate without
having to supply an almost complete polygonal approximation. This
greatly simplifies the initialization process and yields excellent
convergence properties. This is achieved by using the image information
around the end points to provide boundary conditions and by introducing
an optimization schedule that allows a snake to take image information
into account first only near its extremities and then, progressively,
toward its center. In effect, the snakes are clamped onto the image
contour in a manner reminiscent of a ziplock being closed.
These snakes can be used to alleviate the often repetitive task
practitioners face when segmenting images by eliminating the need to
sketch a feature of interest in its entirety, that is, to perform a
painstaking, almost complete, manual segmentation.
|
196. | Dryden, IL, Mardia, KV, and Walder, AN, "Review of the use of context in statistical image analysis," JOURNAL OF APPLIED STATISTICS, vol. 24, pp. 513-538, 1997.
Abstract:
This paper is a review of the use of contextual information in
statistical image analysis. After defining what we mean by 'context',
we describe the Bayesian approach to high-level image analysis using
deformable templates. We describe important aspects of work on
character recognition and syntactic pattern recognition; in particular,
aspects of the work which are relevant to scene understanding. We
conclude with a review of some work on knowledge-based systems which
use context to aid object recognition.
|
197. | Kervrann, C, Davoine, F, Perez, P, Forchheimer, R, and Labit, C, "Generalized likelihood ratio-based face detection and extraction of mouth features," PATTERN RECOGNITION LETTERS, vol. 18, pp. 899-912, 1997.
Abstract:
We describe a system to detect the speaker's face and mouth in
videophone sequences. A statistical scheme based on a subspace method
is described for detecting and tracking faces under varying poses. A
matching criterion based on a Generalized Likelihood Ratio is optimized
efficiently with respect to a perspective transformation using a
coarse-to-fine search strategy combined with a simulated annealing
algorithm. Moreover, we analyze the amplitude projections around the
speaker's mouth to describe the shape of the lips. All computations are
performed on lossy H263-coded images, The proposed algorithms are
well-suited to a further real-time implementation. (C) 1997 Elsevier
Science B.V.
|
198. | Proesmans, M, and Van Gool, L, "One-shot 3D-shape and texture acquisition of facial data," AUDIO- AND VIDEO-BASED BIOMETRIC PERSON AUTHENTICATION, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1206, pp. 411-418, 1997.
Abstract:
In this paper we present new methods to simultaneously extract and
exploit the three-dimensional shape of a face and its surface texture.
It is based on an active technique, i.e. special illumination, but in
contrast to traditional active sensing does not require scanning or
sequential projection of multiple patterns. This one-shot nature of the
devise allows to capture moving objects, e.g. for making a 3D
reconstruction of a face even when the person is talking. The use of
the system is illustrated using simple methods to extract both textural
and geometrical features from faces, that can be used for
authentication purposes. The advantage of using 3D data is that both
types of features can be made more invariant under changes in head pose
or illumination conditions.
|
199. | Guttman, MA, Zerhouni, EA, and McVeigh, ER, "Analysis of cardiac function from MR images," IEEE COMPUTER GRAPHICS AND APPLICATIONS, vol. 17, pp. 30-38, 1997.
Abstract:
This paper describes an image metamorphosis technique to handle
scattered feature constraints specified with points, polylines, and
splines. Solutions to the following three problems are presented:
feature specification, warp generation, and transition control. We
demonstrate the use of snakes to reduce the burden of feature
specification. Next, we propose the use of multilevel free-form
deformations (MFFD) to compute C-2-continuous and one-to-one mapping
functions among the specified features. The resulting technique, based
on B-spline approximation, is simpler and faster than previous warp
generation methods. Furthermore, it produces smooth image
transformations without undesirable ripples and foldovers. Finally, we
simplify the MFFD algorithm to derive transition functions to control
geometry and color blending. Implementation details are furnished and
comparisons among Various metamorphosis techniques are presented.
|
200. | Zhao, WY, Nandhakumar, N, and Smith, PW, "Model-based interpretation of stereo imagery of textured surfaces," MACHINE VISION AND APPLICATIONS, vol. 10, pp. 201-213, 1997.
Abstract:
We present a scheme for reliable and accurate surface reconstruction
from stereoscopic images containing only fine texture and no stable
high-level features. Partial shape information is used to improve
surface computation: first by fitting an approximate, global,
parametric model, and then by refining this model via local
correspondence processes. This scheme eliminates the window size
selection problem in existing area-based stereo correspondence schemes,
These ideas are integrated in a practical vision system that is being
used by environmental scientists to study wind erosion of bulk material
such as coal ore being transported in open rail cars.
|
201. | Hinshaw, KP, and Brinkley, JF, "Using 3-D shape models to guide segmentation of MR brain images," JOURNAL OF THE AMERICAN MEDICAL INFORMATICS ASSOCIATION, vol. 10, pp. 469-473, 1997.
Abstract:
Accurate segmentation of medical images poses one of the major
challenges in computer vision. Approaches that rely solely on intensity
information frequently fail because similar intensity values appear in
multiple structures. This paper presents a method for using shape
knowledge to guide the segmentation process, applying it to the task of
finding the surface of the brain. A 3-D model that includes local shape
constraints is fitted to an MR volume dataset. The resulting
low-resolution surface is used to mask out regions far from the
cortical surface, enabling an isosurface extraction algorithm to
isolate a more detailed surface boundary. The surfaces generated by
this technique are comparable to those achieved by other methods,
without requiring user adjustment of a large number of ad hoc
parameters.
|
202. | Le Goualher, G, Barillot, C, and Bizais, Y, "Modeling cortical sulci with active ribbons," INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, vol. 11, pp. 1295-1315, 1997.
Abstract:
We propose a method for the 3D segmentation and representation of
cortical folds with a special emphasis on the cortical sulci. These
cortical structures are represented using "active ribbons". Active
ribbons are built from active surfaces, which represent the median
surface of a particular sulcus filled by CSF. Sulci modeling is
obtained from MRI acquisitions (usually T1 images). The segmentation is
performed using an automatic labeling procedure to separate gyri from
sulci based on curvature analysis of the different iso-intensity
surfaces of the original MRI volume. The outer parts of the sulci are
used to initialize the convergence of the active ribbon from the outer
parts of the brain to the interior. This procedure has two advantages:
first, it permits the labeling of voxels belonging to sulci on the
external part of the brain as well as on the inside (which is often the
hardest point) and secondly, this segmentation allows 3D visualization
of the sulci in the MRI volumetric environment as well as showing the
sophisticated shapes of the cortical structures by means of isolated
surfaces. Active ribbons can be used to study the complicated shape of
the cortical anatomy, to model the variability of these structures in
shape and position, to assist nonlinear registrations of human brains
by locally controlling the warping procedure, to map brain
neurophysiological functions into morphology or even to select the
trajectory of an intra-sulci (virtual) endoscope.
|
203. | Marescaux, J, Clement, JM, Nord, M, Russier, Y, Tassetti, V, Mutter, D, Cotin, S, and Ayache, N, "A new concept in digestive surgery: the computer assisted surgical procedure, from virtual reality to telemanipulation," BULLETIN DE L ACADEMIE NATIONALE DE MEDECINE, vol. 181, pp. 1609-1623, 1997.
Abstract:
Surgical simulation increasingly appears to be an essential aspect of
tomorrow's surgery The development of a hepatic surgery simulator is an
advanced concept calling for a new writing system which will transform
the medical world. virtual reality: Virtual reality extends the
perception of our five senses by representing more than rite real state
of things by the means of computer sciences and robotics. It consists
of three concepts : immersion, navigation and interaction. Three
reasons have led tts to develop this simulator: the first:rt is to
provide the surgeon with a comprehensive visualisation of the organ.
The second reason is to allow for planning and surgical simulation that
could be compared with the detailed flight-plan for a commercial jet
pilot. The third lies in the fact that virtual reality is an integrated
part of the concept of computer assisted surgical procedure. The
project consists of a sophisticated simulator which has to include five
requirements, : visual fidelity: interactivity: physical properties,
physiological properties, sensory input and output. In this report we
will describe how to get a realistic 3D model of the liver from
bi-dimensional 2D medical images for anatomical and surgical training.
The introduction of a tumor and the consequent planning and virtual
resection is also described as are force feedback and real-time
interaction.
|
204. | Held, K, Kops, ER, Krause, BJ, Wells, WM, Kikinis, R, and Muller-Gartner, HW, "Markov random field segmentation of brain MR images," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 16, pp. 878-886, 1997.
Abstract:
We describe a fully automatic three-dimensional (3-D)-segmentation
technique for brain magnetic resonance (MR) images, By means of Markov
random fields (MRF's) the segmentation algorithm captures three
features that are of special importance for MR images, i.e.,
nonparametric distributions of tissue intensities, neighborhood
correlations, and signal inhomogeneities, Detailed simulations and real
MR images demonstrate the performance of the segmentation algorithm, In
particular, the impact of noise, inhomogeneity, smoothing, and
structure thickness are analyzed quantitatively, Even single-echo MR
images are well classified into gray matter, white matter,
cerebrospinal fluid, scalp-bone, and background, A simulated annealing
and an iterated conditional modes implementation are presented.
|
205. | Gilson, SJ, and Damper, RI, "An empirical comparison of neural techniques for edge linking of images," NEURAL COMPUTING & APPLICATIONS, vol. 6, pp. 64-78, 1997.
Abstract:
Edge linking is a fundamental computer vision task, yet presents
difficulties arising from the lack of information in the image. Viewed
ns a constrained optimisation problem, it is NP hard - being isomorphic
to the classical travelling salesman problem. Self-learning neural
techniques boast the ability to solve hard, ill-defined problems, and
hence offer promise for such an application, This paper examines the
suitability of four well-known unsupervised techniques for rite task of
edge linking, by applying them to a test bed of edge point images and
then evaluating their performance both quantitatively and
qualitatively. Techniques studied are the elastic net, active contours,
Kohonen map and Burr's modified elastic net. Of these, only the elastic
ner and the Kohonen map are realistic contenders for general
edge-linking tasks. However, the other two exhibit behaviour which may
make them particularly suited to some specific image-processing and
computer vision applications.
|
206. | Delibasis, K, Undrill, PE, and Cameron, GG, "Designing texture filters with genetic algorithms: An application to medical images," SIGNAL PROCESSING, vol. 57, pp. 19-33, 1997.
Abstract:
The problem of texture recognition is addressed by studying appropriate
descriptors in the spatial frequency domain. During a training phase a
filter is configured to determine different classes of texture by the
response of its correlation with the Fourier spectrum of training-image
templates. This is achieved by genetic algorithm-based optimisation.
The technique is tested on standard texture patterns and then applied
to magnetic resonance images of the brain to segment the cerebellum
from the surrounding white and grey matter. Comparisons with
established texture recognition techniques are presented, which show
that the proposed method performs as well as, or better than,
traditional techniques for the chosen instances of standard and
anatomical texture and has the advantage of not having to decide which
texture measure to use for a specific image structure. (C) 1997
Elsevier Science B.V.
|
207. | Matsuyama, T, and Wada, T, "Cooperative spatial reasoning for image understanding," INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, vol. 11, pp. 205-227, 1997.
Abstract:
Spatial Reasoning, reasoning about spatial information (i.e. shape end
spatial relations), is a crucial function of image understanding and
computer vision systems. This paper proposes a novel spatial reasoning
scheme for image understanding and demonstrates its utility and
effectiveness in two different systems: region segmentation and aerial
image understanding systems. The scheme is designed based on a
so-called Multi-Agent/Cooperative Distributed Problem Solving Paradigm,
where a group of intelligent agents cooperate with each other to
fulfill a complicated task. The first part of the paper describes a
cooperative distributed region segmentation system, where each region
in an image is regarded as an agent. Starting from seed regions given
at the initial stage, region agents deform their shapes dynamically so
that the image is partitioned into mutually disjoint regions. The
deformation of each individual region agent is realized by the snake
algorithm(14) and neighboring region agents cooperate with each other
to find common region boundaries between them. In the latter part of
the paper, we first give a brief description of the cooperative spatial
reasoning method used in our aerial image understanding system SIGMA.
In SIGMA, each recognized object such as a house and a road is regarded
as an agent. Each agent generates hypotheses about its neighboring
objects to establish spatial relations and to detect missing objects.
Then, we compare its reasoning method with that used in the region
segmentation system. We conclude the paper by showing further utilities
of the Multi-Agent/Cooperative Distributed Problem Solving Paradigm for
image understanding.
|
208. | Dickinson, SJ, and Metaxas, D, "Using aspect graphs to control the recovery and tracking of deformable models," INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, vol. 11, pp. 115-141, 1997.
Abstract:
Active or deformable models have emerged as a popular modelling
paradigm in computer vision. These models have the flexibility to adapt
themselves to the image data, offering the potential for both generic
object recognition and non-rigid object tracking. Because these active
models are underconstrained, however, deformable shape recovery often
requires manual segmentation or good model initialization, while active
contour trackers have been able to track only an object's translation
in the image. In this paper, we report our current progress in using a
part-based aspect graph representation of an object(14) to provide the
missing constraints on data-driven deformable model recovery and
tracking processes.
|
209. | Delibasis, K, Undrill, PE, and Cameron, GG, "Designing Fourier descriptor-based geometric models for object interpretation in medical images using genetic algorithms," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 66, pp. 286-300, 1997.
Abstract:
In previous work we have modeled simple 3D anatomical objects using
deformed superquadrics and established their optimal position with the
aid of genetic algorithms (GAs). Here we extend the complexity of the
search object using 3D Fourier descriptor (FD) representations and
allow GAs once again to optimize the object's shape and position. Using
magnetic resonance image data, we perform an approximate segmentation
on one lateral ventricle in the brain and use the FDs from this as
seeding values for the GAs to search for the left and right lateral
ventricles in seven 3D data sets. We show that the method is capable of
coping with normal biological variation. Finally, we compare
FD/GA-guided segmentation with a manually guided interactive region
growing method and find an agreement of 78 +/- 10% in voxel
classification with a corresponding average edge placement error of 2.2
+/- 0.4 mm. (C) 1997 Academic Press.
|
210. | Zhong, Y, and Jain, AK, "Object localization using color, texture and shape," ENERGY MINIMIZATION METHODS IN COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1223, pp. 279-294, 1997.
Abstract:
We address the problem of localizing objects using color, texture and
shape. Given a handrawn sketch for querying an object shape, and its
color and texture, the algorithm automatically searches the database
images for objects which meet the query attributes. The database images
do not need to be presegmented or annotated. The proposed algorithm
operates in two stages. In the first stage, we use local texture and
color features to find a small number of candidate images, and identify
regions in the candidate images which share similar texture and color
as the query example. To speed up the processing, the texture and color
features are directly extracted from the Discrete Cosine Transform
(DCT) compressed domain. In the second stage, we use a deformable
template matching method to match the query shape to the image edges at
the locations which possess the desired texture and color attributes.
This algorithm is different from the other content-based image
retrieval algorithms in that: (i) no presegmentation of the database
images is needed, and (ii) the color and texture features are directly
extracted from the compressed images. Experimental results show that
substantial computational savings can be achieved utilizing multiple
image cues.
|
211. | Fua, P, "Consistent modeling of terrain and drainage using deformable models," ENERGY MINIMIZATION METHODS IN COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1223, pp. 459-474, 1997.
Abstract:
We propose an automated approach to modeling drainage channels-and,
more generally, linear features that lie on the terrain-from multiple
images, which results not only in high-resolution, accurate and
consistent models of the features, but also of the surrounding terrain.
In our specific case, we have chosen to exploit the fact that rivers
flow downhill and lie at the bottom of local depressions in the
terrain, valley floors tend to be "U" shaped, and the drainage pattern
appears as a network of linear features that can be visually detected
in single gray-level images.
Different approaches have explored individual facets of this problem.
Ours unifies these elements in a common framework. We accurately model
terrain and features as 3-dimensional objects from several information
sources that may be in error and inconsistent with one another. This
approach allows us to generate models that are faithful to sensor data,
internally consistent and consistent with physical constraints. We have
proposed generic models that have been applied to the specific task at
hand-river delineation and data elevation model (DEM) refinement-and
show that the constraints can be expressed in a computationally
effective way and, therefore, enforced while initializing the models
and then fitting them to the data. We will also argue that the same
techniques are robust enough to work on other features that are
constrained by predictable forces.
|
212. | Glasbey, CA, "SAR image registration and segmentation using an estimated DEM," ENERGY MINIMIZATION METHODS IN COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1223, pp. 507-520, 1997.
Abstract:
Synthetic aperture radar (SAR) images are notoriously difficult to
interpret. Segmentation is simplified if a digital map is available, to
which the image can be registered. Also, registration is simplified if
a digital elevation model (DEM) is available. In this paper it is shown
that, if a DEM is unavailable, it can be estimated by minimising an
energy functional consisting of a measure of agreement between the SAR
image and a digital map together with a thin-plate bending-energy term.
A computationally-efficient, finite-element algorithm is proposed to
solve the optimisation problem. The method is applied to automatically
align an airborne SAR image with a digital map of field boundaries,
producing an image which is simultaneously registered and segmented.
|
213. | Luettin, J, and Thacker, NA, "Speechreading using probabilistic models," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 65, pp. 163-178, 1997.
Abstract:
We describe a robust method for locating and tracking lips in
gray-level image sequences. Our approach learns patterns of shape
variability from a training set which constrains the model during image
search to only deform in ways similar to the training examples, Image
search is guided by a learned gray-level model which is used to
describe the large appearance variability of lips, Such variability
might be due to different individuals, illumination, mouth opening,
specularity, or visibility of teeth and tongue, Visual speech features
are recovered from the tracking results and represent both shape and
intensity information, We describe a speechreading (lip-reading)
system, where the extracted features are modeled by Gaussian
distributions and their temporal dependencies by hidden Markov models.
Experimental results are presented for locating lips, tracking lips,
and speechreading. The database used consists of a broad variety of
speakers and was recorded in a natural environment with no special
lighting or lip markers used, For a speaker independent digit
recognition task using visual information only, the system achieved an
accuracy about equivalent to that of untrained humans. (C) 1997
Academic Press.
|
214. | Fua, P, and Brechbuhler, C, "Imposing hard constraints on deformable models through optimization in orthogonal subspaces," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 65, pp. 148-162, 1997.
Abstract:
An approach is presented for imposing generic hard constraints an
deformable models at a low computational cost, while preserving the
good convergence properties of snake-like models. We believe this
capability to be essential not only for the accurate modeling of
individual objects that obey known geometric and semantic constraints
but also for the consistent modeling of sets of objects. Many of the
approaches to this problem that have appeared in the vision literature
rely on adding penalty terms to the objective functions. They rapidly
become intractable when the number of constraints increases, Applied
mathematicians have developed powerful constrainted optimization
algorithms that, in theory, can address this problem. However, these
algorithms typically do not take advantage of the specific properties
of snakes, We have therefore designed a new algorithm that is closely
related to Lagrangian methods but is tailored to accommodate the
particular brand of deformable models used in the image understanding
community, We demonstrate the validity of our approach first in two
dimensions using synthetic images and then in three dimensions using
real aerial images to simultaneously model terrain, roads, and
ridgelines under consistency constraints. (C) 1997 Academic Press.
|
215. | Undrill, PE, Delibasis, K, and Cameron, GG, "An application of genetic algorithms to geometric model-guided interpretation of brain anatomy," PATTERN RECOGNITION, vol. 30, pp. 217-227, 1997.
Abstract:
This work applies 3D Fourier Descriptors (FDs) and Genetic Algorithms
(GAs) to the optimisation of the shape and position of models of
anatomical objects within the human brain. Using magnetic resonance
image data, we perform an approximate segmentation on one lateral
ventricle and use the FDs from this as seeding values for the GAs to
search for the left and right lateral ventricles in subsequent 3D image
data sets, showing that the method is capable of coping with normal
biological variation within and between individuals. Finally, we
compare the GA-guided segmentation with a manual region growing method
and find an agreement of 79.9+/-5.8% in voxel classification with a
corresponding mean edge placement error of 2.1+/-0.4 mm. Copyright (C)
1997 Pattern Recognition Society.
|
216. | Jain, AK, and Dorai, C, "Practicing vision: Integration, evaluation and applications," PATTERN RECOGNITION, vol. 30, pp. 183-196, 1997.
Abstract:
Computer vision has emerged as a challenging and important area of
research, both as an engineering and a scientific discipline. The
growing importance of computer vision is evident from the fact that it
was identified as one of the ''Grand Challenges'' and also from its
prominent role in the National Information Infrastructure. While the
design of a general purpose vision system continues to be elusive,
machine vision systems are being used successfully in specific
application domains. Building a practical vision system requires a
careful selection of appropriate sensors, extraction and integration of
information from available cues in the sensed data, and evaluation of
system robustness and performance. We discuss and demonstrate
advantages of (i) multi-sensor fusion, (ii) combination of features and
classifiers, (iii) integration of visual modules, and (iv)
admissibility and goal-directed evaluation of vision algorithms. The
requirements of several prominent real world applications such as
biometry, document image analysis, image and video database retrieval,
and automatic object model construction offer exciting problems and new
opportunities to design and evaluate vision algorithms. Copyright (C)
1997 Pattern Recognition Society.
|
217. | Yezzi, A, Kichenassamy, S, Kumar, A, Olver, P, and Tannenbaum, A, "A geometric snake model for segmentation of medical imagery," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 16, pp. 199-209, 1997.
Abstract:
In this note, we employ the new geometric active contour models
formulated in [25] and [26] for edge detection and segmentation of
magnetic resonance imaging (MRI), computed tomography (CT), and
ultrasound medical imagery, Our method is based on defining
feature-based metrics on a given image which in turn leads to a novel
snake paradigm in which the feature of interest mag be considered to
lie at the bottom of a potential well, Thus, the snake is attracted
very quickly and efficiently to the desired feature.
|
218. | Caselles, V, Kimmel, R, and Sapiro, G, "Geodesic active contours," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 22, pp. 61-79, 1997.
Abstract:
A novel scheme for the detection of object boundaries is presented. The
technique is based on active contours evolving in time according to
intrinsic geometric measures of the image. The evolving contours
naturally split and merge, allowing the simultaneous detection of
several objects and both interior and exterior boundaries. The proposed
approach is based on the relation between active contours and the
computation of geodesics or minimal distance curves. The minimal
distance curve lays in a Riemannian space whose metric is defined by
the image content. This geodesic approach for object segmentation
allows to connect classical ''snakes'' based on energy minimization and
geometric active contours based on the theory of curve evolution.
Previous models of geometric active contours are improved, allowing
stable boundary detection when their gradients suffer from large
variations, including gaps. Formal results concerning existence,
uniqueness, stability, and correctness of the evolution are presented
as well. The scheme was implemented using an efficient algorithm for
curve evolution. Experimental results of applying the scheme to real
images including objects with holes and medical data imagery
demonstrate its power. The results may be extended to 3D object
segmentation as well.
|
219. | Dachman, AH, Lieberman, J, Osnis, RB, Chen, SYJ, Hoffmann, KR, Chen, CT, Newmark, GM, and McGill, J, "Small simulated polyps in pig colon: Sensitivity of CT virtual colography," RADIOLOGY, vol. 203, pp. 427-430, 1997.
Abstract:
PURPOSE: The authors evaluated computed tomographic (CT) virtual
colography for the detection of simulated polyps under ideal
conditions, as well as the effects on lesion conspicuity of (a)
collimation, (b) table pitch, and (c) orientation of the colon lumen
with respect to the gantry.
MATERIALS AND METHODS: Pig colon was resected and cleansed, and polyps
with diameters of 3, 7, and 10 mm were created. Each specimen was
scanned with collimation of 5 and 7 mm and table pitch of 1.0, 1.6, and
2.0 at angles of 0 degrees, 45 degrees, and 90 degrees to the gantry.
The initial two-dimensional (2D) images were reconstructed at 1-mm
intervals (2D reconstructions), from which three-dimensional (3D)
virtual colography images were generated. Polyp conspicuity on the
initial and reconstructed 2D images and the 3D reconstructions was
evaluated on a three-point scale: 0 = polyp not depicted, 1 = polyp
faintly depicted, and 2 = polyp clearly depicted.
RESULTS: The 10-mm-diameter polyp was clearly depicted (grade 2
conspicuity) on every initial and reconstructed 2D image and 3D
reconstruction without regard to collimation, table pitch, or angle to
the gantry. The 7-mm-diameter polyp was clearly depicted (grade 2
conspicuity) on every initial and reconstructed 2D image, but
conspicuity on 3D reconstructions varied as the imaging parameters
varied. The 3-mm-diameter polyp was faintly depicted (grade 1
conspicuity) on the initial and reconstructed 2D images and 3D
reconstructions, but conspicuity varied on the 3D reconstructions as
the imaging parameters varied.
CONCLUSION: CT virtual colography helped detection of small mucosal
polyps regardless of the angle of the colon lumen to the gantry at
which they were obtained.
|
220. | Friedland, NS, and Rosenfeld, A, "An integrated approach to 2D object recognition," PATTERN RECOGNITION, vol. 30, pp. 525-535, 1997.
Abstract:
A multilevel Markov Random Field (MRF) energy environment has been
developed that simultaneously performs delineation, representation and
classification of two-dimensional objects by using a global
optimization technique. This environment supports a multipolar shape
representation which establishes a dynamic MRF structure. This
structure is initialized as a single-center polar representation, and
uses minimum description length tests to determine whether to establish
new polar centers. The polar representations at these centers are
compared with a database of such representations in order to identify
pieces of objects, and the results of these comparisons are used to
compile evidence for global object identifications. This method is
potentially more robust than conventional multistaged approaches to
object recognition because it incorporates all the information about
the objects into a single adaptive decision process, and its use of a
multipolar representation allows it to handle partially occluded
objects.
|
221. | Deng, JY, and Lai, FP, "Region-based template deformation and masking for eye-feature extraction and description," PATTERN RECOGNITION, vol. 30, pp. 403-419, 1997.
Abstract:
We propose an improved method for eye-feature extraction, descriptions,
and tracking using deformable templates. Some existing algorithms are
exploited to locate the initial position of eye features and then
deformable templates are used for extracting and describing the eye
features. Rather than using original energy minimization for matching
the templates, the region-based approach is proposed for template
deformation. Based on the region properties, the new strategy avoids
problems such as template shrinking, adjusting the weights of energy
terms, failure of orientation adjustment due to some exceptional cases.
Our strategies are also coupled with Canny edge operator to give a new
back-end processing. By integrating the local edge information from the
edge detection and the global collector from our region-based template
deformation, this processing stage can generate accurate eye-feature
descriptions. Finally, the template deformation process is applied to
tracking eye features. (C) 1997 Pattern Recognition Society.
|
222. | Katkere, A, Moezzi, S, Kuramura, DY, Kelly, P, and Jain, R, "Towards video-based immersive environments," MULTIMEDIA SYSTEMS, vol. 5, pp. 69-85, 1997.
Abstract:
Video provides a comprehensive visual record of environment activity
over time. Thus, video data is an attractive source of information for
the creation of virtual worlds which require some real-world fidelity.
This paper describes the use of multiple streams of video data for the
creation of immersive virtual environments. We outline our multiple
perspective interactive video (MPI-Video) architecture which provides
the infrastructure for the processing and analysis of multiple streams
of video data. Our MPI-Video system performs automated analysis of the
raw video and constructs a model of the environment and object activity
within this environment. This model provides a comprehensive
representation of the world monitored by the cameras which, in turn,
can be used in the construction of a virtual world. In addition, using
the information produced and maintained by the MPI-Video system; our
immersive video system generates virtual video sequences. These are
sequences of the dynamic environment from an arbitrary view point
generated using the real camera data. Such sequences allow a user to
navigate through the environment and provide a sense of immersion in
the scene. We discuss results from our MPI-Video prototype, outline
algorithms for the construction of virtual views and provide examples
of a variety of such immersive video sequences.
|
223. | Bloomgarden, DC, Fayad, ZA, Ferrari, VA, Chin, B, Sutton, MGSJ, and Axel, L, "Global cardiac function using fast breath-hold MRI: Validation of new acquisition and analysis techniques," MAGNETIC RESONANCE IN MEDICINE, vol. 37, pp. 683-692, 1997.
Abstract:
Calculation of global cardiac function parameters has been validated
using fast, segmented k-space, breath-hold, gradient-echo, magnetic
resonance images. Images of phantoms, experimental animals, normal
volunteers, and patients were acquired with a 1.5 T clinical scanner,
Humans were imaged using two phased-array surface coils in multicoil
mode, Myocardial contours were extracted using a new interactive,
semi-automated method based on the active contour model method, Images
were acquired in the short-axis orientation, and, using a new imaging
and analysis strategy, in rotating plane long-axis orientations, to
provide better definition of the valve planes and the apex, and also to
reduce the number of slices (compared with the short-axis method)
required to sample the whole heart, Validation was accomplished through
calculation of the volumes of phantoms and left and right ventricular
masses of animal hearts. Functional parameters from MRI were compared
with those from echocardiograms and radionuclide angiograms in normal
volunteers and patients, respectively.
|
224. | Refregier, P, Germain, O, and Gaidon, T, "Optimal snake segmentation of target and background with independent Gamma density probabilities, application to speckled and preprocessed images," OPTICS COMMUNICATIONS, vol. 137, pp. 382-388, 1997.
Abstract:
We propose in this paper a snake-based segmentation processor to track
the shape of a target with random white intensity appearing on a random
white spatially disjoint background. We study the optimal solution for
Gamma laws and we discuss the relevance of such statistics for
realistic situations. This algorithm, based on an active contour model
(snakes), consists in correlations of a binary reference with the scene
image or with pre-processed version of the scene image. This method is
a generalization of correlation techniques and thus opens new
applications for digital and optical correlators.
|
225. | Caselles, V, Kimmel, R, and Sapiro, G, "Minimal surfaces based object segmentation," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 19, pp. 394-398, 1997.
Abstract:
A geometric approach for 3D object segmentation and representation is
presented. The segmentation is obtained by deformable surfaces moving
towards the objects to be detected in the 3D image. The model is based
on curvature motion and the computation of surfaces with minimal areas,
better known as minimal surfaces. The space where the surfaces are
computed is induced from the 3D image (volumetric data) in which the
objects are to be detected. The model links between classical
deformable surfaces obtained via energy minimization, and intrinsic
ones derived from curvature based flows. The new approach is stable,
robust, and automatically handles changes in the surface topology
during the deformation.
|
226. | Delp, SL, Loan, P, Basdogan, C, and Rosen, JM, "Surgical simulation: An emerging technology for training in emergency medicine," PRESENCE-TELEOPERATORS AND VIRTUAL ENVIRONMENTS, vol. 6, pp. 147-159, 1997.
Abstract:
The current methods of training medical personnel to provide emergency
medical care have several important shortcomings. For example, in the
training of wound debridement techniques, animal models are used to
gain experience treating traumatic injuries. We propose an alternative
approach by creating a three-dimensional, interactive computer model of
the human body that can be used within a virtual environment to learn
and practice wound debridement techniques and Advanced Trauma Life
Support (ATLS) procedures. As a first step, we have developed a
computer model that represents the anatomy and physiology of a normal
and injured lower limb. When visualized and manipulated in a virtual
environment, this computer model will reduce the need for animals in
the training oi-trauma management and potentially provide a superior
training experience. This article describes the development choices
that were made in implementing the preliminary system and the
challenges that must be met to create an effective medical training
environment.
|
227. | Sclaroff, S, "Deformable prototypes for encoding shape categories in image databases," PATTERN RECOGNITION, vol. 30, pp. 627-641, 1997.
Abstract:
An image database search method is described that uses strain energy
from prototypes to represent shape categories. Rather than directly
comparing a candidate shape with all entries in a database, shapes are
ordered in terms of non-rigid deformations that relate them to a small
subset of representative prototypes. Shape correspondences are obtained
via modal matching, a decomposition for matching, describing, and
comparing shapes despite sensor variations and non-rigid deformations.
Deformation is decomposed into an ordered basis of orthogonal principal
components. This allows selective invariance to in-plane rotation,
translation, and scaling, and quasi-invariance to affine deformations.
Retrieval accuracy and stability are evaluated in experiments with 2-D
image databases. (C) 1997 Pattern Recognition Society.
|
228. | Fejes, S, and Rosenfeld, A, "Discrete active models and applications," PATTERN RECOGNITION, vol. 30, pp. 817-835, 1997.
Abstract:
Optimization processes based on ''active models'' play central roles in
many areas of computational vision as well as computational geometry.
Unfortunately, current models usually require highly complex and
sophisticated mathematical machinery and at the same time they suffer
from a number of limitations which impose restrictions on their
applicability. In this paper a simple class of discrete active models,
called migration processes (MPs), is presented. The processes are based
on iterated averaging over neighborhoods defined by constant geodesic
distance. It is demonstrated that the MP model-a system of
self-organizing active particles-has a number of advantages over
previous models, both parametric active models (''snakes'') and
implicit (contour evolution) models. Due to the generality of the MP
model, the process can be applied to derive natural solutions to a
variety of optimization problems,including defining (minimal) surface
patches given their boundary curves; finding shortest paths joining
sets of points; and decomposing objects into ''primitive'' parts. (C)
1997 Pattern Recognition Society.
|
229. | Liang, KH, Tjahjadi, T, and Yang, YH, "Roof edge detection using regularized cubic B-spline fitting," PATTERN RECOGNITION, vol. 30, pp. 719-728, 1997.
Abstract:
A scheme employing one-dimensional (1-D) Regularized Cubic B-Spline
(RCBS) fitting [G. Chen and Y. H. Yang, IEEE Trans. Systems Man
Cybernet. 25, 636-693 (1995)] has been used successfully in the task of
step edge detection. The regularized fitting is transformed into a
quadratic energy equation to simplify the computation. This scheme,
however, has three major limitations: it is non-linear, has a limited
accuracy and is computationally expensive. This paper presents a
modified scheme which overcomes these limitations. The modified scheme
employs the I-D RCBS fitting on the horizontal and Vertical
orientations of a window of an image to generate two I-D signals, which
provide sufficient information about the local property of the
sub-image for roof edge detection. Experimental results show that the
scheme of roof edge detection is very sensitive to small signals. (C)
1997 Pattern Recognition Society.
|
230. | Chin, TM, and Mariano, AJ, "Space-time interpolation of oceanic fronts," IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, vol. 35, pp. 734-746, 1997.
Abstract:
Oceanic temperature fronts observed through composite infrared images
from the AVHRR satellite data are fragmented due mostly to cloud
occlusion. The sampling frequency of such frontal position observations
tends to be insufficiently high to resolve dynamics of the meandering
features associated with the frontal contour, so that contour
reconstruction using a standard space-time smoothing often leads to
introduction of spurious features. Augmenting space-time smoothing with
a simple point-feature detection/matching scheme, however, can
dramatically improve the reconstruction product, This paper presents
such a motion-compensated interpolation algorithm, for reconstruction
of open contours evolving in time given fragmented position data, The
reconstruction task is formulated as an optimization problem, and a
time-sequential solution which adaptively estimates feature motion is
provided. The resulting algorithm reliably interpolates position
measurements of the surface temperature fronts associated with the
highly convoluted portions of strong ocean currents such as the Gulf
Stream and Kuroshio.
|
231. | Sebbahi, A, Herment, A, deCesare, A, and Mousseaux, E, "Multimodality cardiovascular image segmentation using a deformable contour model," COMPUTERIZED MEDICAL IMAGING AND GRAPHICS, vol. 21, pp. 79-89, 1997.
Abstract:
An automatic segmentation method has been developed for cardiovascular
multimodality imaging. A ''snake'' model based on a curve shaping and
an energy-minimizing process is used to detect blood-wall interfaces on
Cine-CT, MRI and ultrasound images. Deformation of a reduced set of
contour points was made according to a discretized global, regional and
local minimum energy criterion. A continuous regional optimization
process was also integrated into the deformation model, it takes into
account a cubic spline interpolation and adaptive regularity
constraints. The constraints provided rapid convergence toward a final
contour position by successively stopping spline segments. (C) 1997
Elsevier Science Ltd.
|
232. | Olabarriaga, SD, and Smeulders, AWM, "Setting the mind for intelligent interactive segmentation: Overview, requirements, and framework," INFORMATION PROCESSING IN MEDICAL IMAGING, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1230, pp. 417-422, 1997.
Abstract:
It is widely recognized that automatic segmentation is hard, leading to
the state where user intervention cannot be avoided. In this paper we
review existing literature and propose a systematic approach for the
integration of automatic and interactive segmentation methods into one
unified process. A framework and requirements for intelligent
interactive segmentation are formulated, and an example is presented.
|
233. | Fritsch, D, Pizer, S, Yu, LY, Johnson, V, and Chaney, E, "Segmentation of medical image objects using deformable shape loci," INFORMATION PROCESSING IN MEDICAL IMAGING, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1230, pp. 127-140, 1997.
Abstract:
Robust segmentation of normal anatomical objects in medical images
requires (1) methods for creating object models that adequately capture
object shape and expected shape variation across a population, and (2)
methods for combining such shape models with unclassified image data to
extract modeled objects. Described in this paper is such an approach to
model-based image segmentation, called deformable shape loci (DSL),
that has been successfully applied to 2D MR slices of the brain
ventricle and CT slices of abdominal organs. The method combines a
model and image data by warping the model to optimize an objective
function measuring both the conformation of the warped model to the
image data and the preservation of local neighbor relationships in the
model. Methods for forming the model and for optimizing the objective
function are described.
|
234. | Todd-Pokropek, A, "How to find the surface when you are drowning in data: boundary conditions and constraints in medical image processing," PHYSICA MEDICA, vol. 13, pp. 197-202, 1997.
Abstract:
A major problem with many current techniques in medical imaging is the
sheer volume of data of the results; examples are in spiral CT, MRI
especially functional imaging, SPECT and PET. In general the data are
n-D, often 3-D plus time. Such data are hard to visualise without
compression, specifically some kind of multi-dimensional projection to
reduce dimensionality, for example reducing the n-D to a 2-D image.
Both linear and non-linear operations can be considered, and two
classes of method are important: data driven and hypothesis driven.
Illustrative of data driven methods is principal component analysis
(and factor analysis) where from the statistical aim of reducing
correlation, axes in the multi-dimensional space can be defined for the
projection operation. Unfortunately, in practice, a pure statistical
method does not generally map well on to expected physiological
functions (or models), and some kind of oblique rotation is required,
based on the choice of appropriate constraints such as that of
positivity. Hypothesis driven methods are all implicitly or explicitly
based on models. Thus associating data driven and hypothesis driven ap
preaches leads to constrained statistical data (image) processing.
Examples are shown as used in nuclear medicine and MRI. Another
important problem considered is that of multi-modality image
registration and fusion. Although many methods exist, all based on the
minimization of an appropriate distance functions between two image
data sets, additional constraints are required when the images are not
too similar. This leads to the idea of using mutual information as a
distance measure, and imposing constraints by means of cluster analysis
of the n-dimensional feature space. Finally, in the analysis of such
data, tests against reference data sets (atlases) are required,
normally requiring warping the data sets in space, for example by the
use of optic flow, or some kind of diffusion equation. Again, the
boundary values for the method need to be defined with respect to
medical knowledge, a further good example of data driven algorithms
supervised using clinical constraints or models.
|
235. | Gunn, SR, and Nixon, MS, "Robust snake implementation; A dual active contour," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 19, pp. 63-68, 1997.
Abstract:
A conventional active contour formulation suffers difficulty in
appropriate choice of an initial contour and values of parameters.
Recent approaches have aimed to resolve these problems but can
compromise other performance aspects. To relieve the problem in
initialization, we use a dual active contour, which is combined with a
local shape model to improve the parameterization. One contour expands
from inside the target feature, the other contracts from the outside.
The two contours are interlinked to provide a balanced technique with
an ability to reject ''weak'' local energy minima.
|
236. | Tagare, HD, "Deformable 2-D template matching using orthogonal curves," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 16, pp. 108-117, 1997.
Abstract:
In this paper a new formulation of the two-dimensional (2-D) deformable
template matching problem is proposed. It uses a lower-dimensional
search space than conventional methods by precomputing extensions of
the deformable template along orthogonal curves. The reduction in
search space allows the use of dynamic programming to obtain globally
optimal solutions and reduces the sensitivity of the algorithm to
initial placement of the template, Further, the technique guarantees
that the result is a curve which does not collapse to a point in the
absence of strong image gradients and is always nonself intersecting.
Examples of the use of the technique on real-world images and in
simulations at low signal-to-noise ratios (SNR's) are also provided.
|
237. | Zhu, Y, and Yan, H, "Computerized tumor boundary detection using a Hopfield neural network," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 16, pp. 55-67, 1997.
Abstract:
In this paper, we present a new approach for detection of brain tumor
boundaries in medical images using a Hopfield neural network. The
boundary detection problem is formulated as an optimization process
that seeks the boundary points to minimize an energy functional based
on an active contour model, A modified Hopfield network is constructed
to solve the optimization problem, Taking advantage of the collective
computational ability and energy convergence capability of the Hopfield
network, our method produces the results comparable to those of
standard ''snakes''-based algorithms, but it requires less computing
time, With the parallel processing potential of the Hopfield network,
the proposed boundary detection can be implemented for real time
processing, Experiments on different magnetic resonance imaging (MRI)
data sets show the effectiveness of our approach.
|
238. | Sandor, S, and Leahy, R, "Surface-based labeling of cortical anatomy using a deformable atlas," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 16, pp. 41-54, 1997.
Abstract:
We describe a computerized method to automatically find and label the
cortical surface in three-dimensional (3-D) magnetic resonance (MR)
brain images, The approach we take is to model a prelabeled brain atlas
as a physical object and give it elastic properties, allowing it to
warp itself onto regions in a preprocessed image. Preprocessing
consists of boundary-finding and a morphological procedure which
automatically extracts the brain and sulci from an MR image and
provides a smoothed representation of the brain surface to which the
deformable model can rapidly converge, Our deformable models are
energy-minimizing elastic surfaces that can accurately locate image
features, The models are parameterized with 3-D bicubic B-spline
surfaces, We design the energy function such that cortical fissure
(sulci) points on the model are attracted to fissure points on the
image and the remaining model points are attracted to the brain
surface, A conjugate gradient method minimizes the energy function,
allowing the model to automatically converge to the smoothed brain
surface, Finally, labels are propagated from the deformed atlas onto
the high-resolution brain surface.
|
239. | Sato, Y, Chen, J, Zoroofi, RA, Harada, N, Tamura, S, and Shiga, T, "Automatic extraction and measurement of leukocyte motion in microvessels using spatiotemporal image analysis," IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, vol. 44, pp. 225-236, 1997.
Abstract:
This paper describes a computer vision system for the automatic
extraction and velocity measurement of moving leukocytes that adhere to
microvessel walls from a sequence of images, The motion of these
leukocytes can be visualized as motion along the wall contours, We use
the constraint that the leukocytes move along the vessel wall contours
to generate a spatiotemporal image, and the leukocyte motion is then
extracted using the methods of spatiotemporal image analysis, The
generated spatiotemporal image is processed by a special-purpose
orientation-selective filter and a subsequent grouping process newly
developed for this application. The orientation-selective filter is
designed by considering the particular properties of the spatiotemporal
image in this application in order to enhance only the traces of
leukocytes. In the subsequent grouping process, leukocyte trace
segments are selected and grouped among all the segments obtained by
simple thresholding and skeletonizing operations, We show
experimentally that the proposed method can stably extract leukocyte
motion.
|
240. | Matsumoto, S, Asato, R, Okada, T, and Konishi, J, "Intracranial contour extraction with active contour models," JMRI-JOURNAL OF MAGNETIC RESONANCE IMAGING, vol. 7, pp. 353-360, 1997.
Abstract:
A novel image processing scheme for extracting the intracranial
contours in axial magnetic resonance data sets is proposed. The scheme
incorporates the method of active contour models, a recently introduced
paradigm for contour extraction. Its performance is nearly ideal for
T2-weighted images. Although the performances for
proton-density-weighted images and T1-weighted images drop slightly,
qualitatively satisfactory extraction still can be obtained for
T1-weighted images. Due to high degree of automation, the scheme should
help speed up some image processing applications that require the
presegmentation of the intracranial cavity.
|
241. | Tek, H, and Kimia, BB, "Volumetric segmentation of medical images by three-dimensional bubbles," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 65, pp. 246-258, 1997.
Abstract:
The segmentation of structure from images is an inherently difficult
problem in computer vision and a bottleneck to its widespread
application, e.g., in medical imaging, This paper presents an approach
for integrating local evidence such as regional homogeneity and edge
response to form global structure for figure-ground segmentation. This
approach is motivated by a shock-based morphogenetic language, where
the growth of four types of shocks results in a complete description of
shape, Specifically, objects are randomly hypothesized in the form of
fourth-order shocks (seeds) which then grow, merge, split, shrink, and,
in general, deform under physically motivated ''forces,'' but slow down
and come to a halt near differential structures. Two major issues arise
in the segmentation of 3D images using this approach. First, it is
shown that the segmentation of 3D images by 3D bubbles is superior to a
slice-by-slice segmentation by 2D bubbles or by ''21/2D bubbles'' which
are inherently 2D but use 3D information for their deformation.
Specifically, the advantages lie in an intrinsic treatment of the
underlying geometry and accuracy of reconstruction. Second, gaps and
weak edges, which frequently present a significant problem for 2D and
3D segmentation, are regularized by curvature-dependent curve and
surface deformations which constitute diffusion processes, The 3D
bubbles evolving in the 3D reaction-diffusion space are a powerful tool
in the segmentation of medical and other images, as illustrated for
several realistic examples. (C) 1997 Academic Press.
|
242. | Neuenschwander, W, Fua, P, Szekely, G, and Kubler, O, "Velcro surfaces: Fast initialization of deformable models," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 65, pp. 237-245, 1997.
Abstract:
Even though methods based on the use of deformable models have become
prevalent, the quality of their output depends critically on the
model's initial state, The issue of initializing such models, however,
has not received much attention even though it is often key to the
implementation of a truly useful system.
We therefore present a new approach to segmentation of
three-dimensional (3-D) shapes that initializes and then optimizes a
3-D surface model given only the data and a very small number of 3-D
seed points and corresponding surface normals. This is a valuable
capability for medical, robotic, and cartographic applications where
such seed points can be naturally supplied, In effect, the surface
model is clamped onto the object boundary in a manner reminiscent of
Velcro being closed. Applications of the developed method to stereo
imagery and to volumetric medical data are demonstrated. (C) 1997
Academic Press.
|
243. | Brand, M, "Physics-based visual understanding," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 65, pp. 192-205, 1997.
Abstract:
An understanding of a scene's causal physics-how scene elements
interact and respond to forces-is a precondition to reasoning about how
the scene came to be, how it may evolve in time, and how it will
respond to manipulation. We propose a computationally inexpensive
method for recovering causal structure from images, in which a scene
model is built incrementally through interleaved sensing and analysis.
Reasoning uses generic qualitative knowledge about rigid-body
interactions, reusable between domains and similar to concepts thought
to be acquired or activated during child development. Causal constraint
propagation reveals anomalous degrees of freedom in the scene model;
prediction yields sensory plans to resolve them, Sensing operations are
highly directed and local in scope, e.g., visual routines and
proprioception. Inference depth and the number of pixels ''touched''
are bounded by the complexity of the scene. We present algorithms and
semantics that have been successfully reused in several domains of
highly structured scenes; in particular we detail a vision system that
reverse-engineers machines. (C) 1997 Academic Press.
|
244. | Nastar, C, Moghaddam, B, and Pentland, A, "Flexible images: Matching and recognition using learned deformations," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 65, pp. 179-191, 1997.
Abstract:
We describe a novel technique for matching and recognition based on
deformable intensity surfaces which incorporates both the shape (x, y)
and the texture (I(x, y)) components of a 2D image. Specifically, the
intensity surface is modeled as a deformable 3D mesh in (x, y, I(x, y))
space which obeys Lagrangian dynamics. Using an efficient technique for
matching two surfaces (in terms of the analytic modes of vibration), we
can obtain a dense correspondence field (or 3D warp) between two
images, Furthermore, we use explicit statistical learning of the class
of valid deformations in order to provide a priori knowledge about
object-specific deformations, The resulting formulation leads to a
compact representation based on the physically-based modes of
deformation as well as the statistical modes of variation observed in
actual training data. We demonstrate the power of this approach with
experiments utilizing image matching, interpolation of missing data,
and image retrieval in a large face database. (C) 1997 Academic Press.
|
245. | Faugeras, O, and Keriven, R, "Level set methods and the stereo problem," SCALE-SPACE THEORY IN COMPUTER VISION, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1252, pp. 272-283, 1997.
Abstract:
We present a novel geometric approach for solving the stereo problem
for an arbitrary number of images (greater than or equal to 2). It is
based upon the definition of a variational principle that must be
satisfied by the surfaces of the objects in the scene and their images.
The Euler-Lagrange equations which are deduced from the variational
principle provide a set of PDE's which are used to deform an initial
set of surfaces which then move towards the objects to be detected. The
level set implementation of these PDE's potentially provides an
efficient and robust way of achieving the surface evolution and to deal
automatically with changes in the surface topology during the
deformation, i.e. to deal with multiple objects. Results of a two
dimensional implementation of our theory are presented on synthetic and
real images.
|
246. | Pardo, JM, Cabello, D, and Heras, J, "A snake for model-based segmentation of biomedical images," PATTERN RECOGNITION LETTERS, vol. 18, pp. 1529-1538, 1997.
Abstract:
In this work we present a snake based approach for the segmentation of
images of computerized tomography (CT) scans, We introduce a new term
for the internal energy and another one for external energy which solve
common problems associated with classical snakes in this type of
images. A simplified minimizing method is also presented. (C) 1997
Elsevier Science B.V.
|
247. | Jones, TN, and Metaxas, DN, "Automated 3D segmentation using deformable models and fuzzy affinity," INFORMATION PROCESSING IN MEDICAL IMAGING, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1230, pp. 113-126, 1997.
Abstract:
We have developed an algorithm for segmenting objects with closed,
non-intersecting boundaries, such as the heart and the lungs, that is
independent of the imaging modality used (e.g., MRI, CT,
echocardiography). Our method is automatic and requires as
initialization a single pixel/voxel within the boundaries of the
object. Existing segmentation techniques either require much more
information during initialization, such as an approximation to the
object's boundary, or are not robust to the types of noisy data
encountered in the medical domain. By integrating region-based and
physics-based modeling techniques we have devised a hybrid design that
overcomes these limitations. In our experiments we demonstrate across
imaging modalities, that this integration automates and significantly
improves the object boundary detection results. This paper focuses on
the application of our method to 3D datasets.
|
248. | Vaillant, M, and Davatzikos, C, "Mapping the cerebral sulci: Application to morphological analysis of the cortex and to non-rigid registration," INFORMATION PROCESSING IN MEDICAL IMAGING, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1230, pp. 141-154, 1997.
Abstract:
We propose a methodology for extracting parametric representations of
the cerebral sulci from magnetic resonance images, and we consider its
application to two medical imaging problems: quantitative morphological
analysis and spatial normalization and registration of brain images.
Our methodology is based on deformable models utilizing characteristics
of the cortical shape. Specifically, a parametric representation of a
sulcus is determined by the motion of an active contour along the
medial surface of the corresponding cortical fold. The active contour
is initialized along the outer boundary of the brain, and deforms
toward the deep edge of a sulcus under the influence of an external
force field restricting it to lie along the medial surface of the
particular cortical fold. A parametric representation of the surface is
obtained as the active contour traverses the sulcus. In this paper we
present results of this methodology and its applications.
|
249. | Sjogreen, K, Ljungberg, M, Erlandsson, K, Floreby, L, and Strand, SE, "Registration of abdominal CT and SPECT images using Compton scatter data," INFORMATION PROCESSING IN MEDICAL IMAGING, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1230, pp. 232-244, 1997.
Abstract:
The present study investigates the possibility to utilize Compton
scatter data for registration of abdominal SPECT images. A method for
registration to CT is presented, based on principal component analysis
and cross-correlation of binary images representing the interior of the
patient. Segmentation of scatter images is performed with two methods,
thresholding and a deformable contour method. To achieve similarity of
organ positions between scans, a positioning device is applied to the
patient. Evaluation of the registration accuracy is performed with a) a
I-131 phantom study, b) a Monte Carlo simulation study of an
anthropomorphic phantom, and c) a I-123 patient trial. For a) r.m.s.
distances between positions that should be equal in CT and SPECT are
obtained to 1.0+/-0.7 mm, which thus for a rigid object is at sub pixel
level. From b) results show that r.m.s. distances depend on the slice
activity distribution. With a symmetrical distribution deviations are
in the order of 5 mm. In c) distances between markers on the patient
boundary an at the maximum 16 mm and on an average 10 mm. It is
concluded that by utilizing the available Compton scatter data,
valuable positioning information is achieved. that can be used for
registration of SPECT images.
|
250. | Vilarino, DL, Cabello, D, Mosquera, A, and Pardo, JM, "Application of a multilayer discrete-time CNN to deformable models," BIOLOGICAL AND ARTIFICIAL COMPUTATION: FROM NEUROSCIENCE TO TECHNOLOGY, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1240, pp. 1193-1202, 1997.
Abstract:
In this work Cellular Neural Networks are applied to image analysis
techniques as a deformable models. To this end the problem is
considered based on a discrete-time CNN with cyclic templates and
time-variant external inputs. The appropriateness for a VLSI
implementation and massively parallel computing of CNNs will permit a
considerable improvement in processing speed with respect to the
clasical active contours approaches.
|
|
|
1998 |
251. | Finet, G, Maurincomme, E, Reiber, JHC, Savalle, L, Magnin, I, and Beaune, J, "Evaluation of an automatic intraluminal edge detection technique for intravascular ultrasound images," JAPANESE CIRCULATION JOURNAL-ENGLISH EDITION, vol. 62, pp. 115-121, 1998.
Abstract:
Intravascular ultrasound (IVUS) imaging enables detailed analysis and
precise measurements of vascular cross-sections. However, to achieve a
reduction in the existing level of observer variability requires the
development of quantitative IVUS. We have developed a fully automatic
intraluminal edge detection technique, based on adaptive active contour
models and called ADDER (adaptive damping dependent on echographic
regions) that allows the quantitation of the intraluminal
cross-sectional area (ICSA). Using a 30-MHz mechanically rotated
transducer mounted at the tip of a 3.5-F catheter, 58 normal and
pathologic arterial segments (from coronary, renal, splenic, iliac, and
carotid arteries) were imaged in vitro. These images were analyzed by 2
experts, E1 and E2, who manually traced the intraluminal contour twice
for each image, as well as with ADDER. Intra-observer variabilities for
ICSAs were found to be excellent (-1.454+/-3.51% for E1, 0.96+/-5.4%
for E2). The inter-observer variability was 2.1+/-4.3%. The success
factor for ADDER was 89%. Its intra-observer variability was null, as
the method always finds a unique contour. The correlation between the
automatically detected ICSA and the manual ICSA was: r=0.99
(y=1.03x+0.89 mm(2)). Morphometric variations between manually and
automatically traced contours, analyzed by the centerline method, were
100+/-140 mm on average. In conclusion, the ADDER automatic contour
detection applied to IVUS images is robust and characterized by small
systematic and random errors; therefore, quantitative IVUS is a useful
tool in clinical research trials.
|
252. | Faugeras, O, and Keriven, R, "Variational principles, surface evolution, PDE's, level set methods, and the stereo problem," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 7, pp. 336-344, 1998.
Abstract:
We present a novel geometric approach for solving the stereo problem
for an arbitrary number of images (greater than or equal to 2). It is
based upon the definition of a variational principle that must be
satisfied by the surfaces of the objects in the scene and their images,
The Euler-Lagrange equations that are deduced from the variational
principle provide a set of partial differential equations (PDE's) that
are used to deform an initial set of surfaces which then move toward
the objects to he detected, The level set implementation of these PDE's
potentially provides an efficient and robust way of achieving the
surface evolution and to deal automatically with changes in the surface
topology during the deformations, i.e., to deal with multiple objects,
Results of an implementation of our theory also dealing with occlusion
and vilility are presented on sydnthetic and real images.+
|
253. | Caselles, V, Morel, JM, Sapiro, G, and Tannenbaum, A, "Introduction to the special issue on partial differential equations and geometry-driven diffusion in image processing and analysis," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 7, pp. 269-273, 1998.
Abstract:
We propose a method for the 3D segmentation and representation of
cortical folds with a special emphasis on the cortical sulci. These
cortical structures are represented using "active ribbons". Active
ribbons are built from active surfaces, which represent the median
surface of a particular sulcus filled by CSF. Sulci modeling is
obtained from MRI acquisitions (usually T1 images). The segmentation is
performed using an automatic labeling procedure to separate gyri from
sulci based on curvature analysis of the different iso-intensity
surfaces of the original MRI volume. The outer parts of the sulci are
used to initialize the convergence of the active ribbon from the outer
parts of the brain to the interior. This procedure has two advantages:
first, it permits the labeling of voxels belonging to sulci on the
external part of the brain as well as on the inside (which is often the
hardest point) and secondly, this segmentation allows 3D visualization
of the sulci in the MRI volumetric environment as well as showing the
sophisticated shapes of the cortical structures by means of isolated
surfaces. Active ribbons can be used to study the complicated shape of
the cortical anatomy, to model the variability of these structures in
shape and position, to assist nonlinear registrations of human brains
by locally controlling the warping procedure, to map brain
neurophysiological functions into morphology or even to select the
trajectory of an intra-sulci (virtual) endoscope.
|
254. | Trinder, JC, and Wang, YD, "Automatic road extraction from aerial images," DIGITAL SIGNAL PROCESSING, vol. 8, pp. 215-224, 1998.
Abstract:
The paper presents a knowledge-based method for automatic road
extraction from aerial photography and high-resolution remotely sensed
images. The method is based on Marr's theory of vision, which consists
of low-level image processing for edge detection and linking, mid-level
processing for the formation of road structure, and high-level
processing for the recognition of roads. It uses a combined control
strategy in which hypotheses are generated in a bottom-up mode and a
top-down process is applied to predict the missing road segments. To
describe road structures a generalized antiparallel pair is proposed.
The hypotheses of road segments are generated based on the knowledge of
their geometric and radiometric properties, which are expressed as
rules in Prolog. They are verified using part-whole relationships
between roads in high-resolution images and roads in low-resolution
images and spatial relationships between verified road segments. Some
results are presented in this paper. (C) 1998 Academic Press.
|
255. | Xu, CY, Pham, DL, Prince, JL, Etemad, ME, and Yu, DN, "Reconstruction of the central layer of the human cerebral cortex from MR images," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI'98, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1496, pp. 481-488, 1998.
Abstract:
Reconstruction of the human cerebral cortex from MR images is a
fundamental step in human brain mapping and in applications such as
surgical path planning. In a previous paper, we described a method for
obtaining a surface representation of the central layer of the human
cerebral cortex using fuzzy segmentation and a deformable surface
model. This method, however, suffers from several problems. In this
paper, we significantly improve upon the previous method by using a
fuzzy segmentation algorithm robust to intensity inhomogeneities, and
using a deformable surface model specifically designed for capturing
convoluted sulci or gyri. We demonstrate the improvement over the
previous method both qualitatively and quantitatively, and show the
result of its application to six subjects. We also experimentally
validate the convergence of the deformable surface initialization
algorithm.
|
256. | Garrido, A, and De la Blanca, NP, "Physically-based active shape models: Initialization and optimization," PATTERN RECOGNITION, vol. 31, pp. 1003-1017, 1998.
Abstract:
In this paper we describe a new approach for 2-D object segmentation
using an automatic method applied on images with problems as partial
information, overlapping objects, many objects in a single scene,
severe noise conditions and locating objects with a very high degree of
deformation. We use a physically-based shape model to obtain a
deformable template, which is defined on a canonical orthogonal
coordinate system. The proposed methodology works starting from the
output of an edge detector, which is processed to automatically obtain
an approximation of the shape. The final estimation of the shapes is
obtained fitting a deformable template model, which is defined on a
learned surface of deformation. Results from biological images are
presented. (C) 1998 Pattern Recognition Society. Published by Elsevier
Science Ltd. All rights reserved.
|
257. | Falcao, AX, Udupa, JK, Samarasekera, S, Sharma, S, Hirsch, BE, and Lotufo, RDA, "User-steered image segmentation paradigms: Live wire and live lane," GRAPHICAL MODELS AND IMAGE PROCESSING, vol. 60, pp. 233-260, 1998.
Abstract:
In multidimensional image analysis, there are, and will continue to be,
situations wherein automatic image segmentation methods fail, calling
for considerable user assistance in the process. The main goals of
segmentation research for such situations ought to be (i) to provide
effective control to the user on the segmentation process while it is
being executed, and (ii) to minimize the total user's time required in
the process. With these goals in mind, we present in this paper two
paradigms, referred to as live wire and live lane, for practical image
segmentation in large applications. For both approaches, we think of
the pixel vertices and oriented edges as forming a graph, assign a set
of features to each oriented edge to characterize its "boundariness,"
and transform feature values to costs. We provide training facilities
and automatic optimal feature and transform selection methods so that
these assignments can be made with consistent effectiveness in any
application. In live wire, the user first selects an initial point on
the boundary. For any subsequent point indicated by the cursor, an
optimal path from the initial point to the current point is found and
displayed in real time. The user thus has a live wire on hand which is
moved by moving the cursor, If the cursor goes close to the boundary,
the live wire snaps onto the boundary. At this point, if the live wire
describes the boundary appropriately, the user deposits the cursor
which now becomes the new starting point and the process continues. A
few points (live-wire segments) are usually adequate to segment the
whole 2D boundary. in live lane, the user selects only the initial
point. Subsequent points are selected automatically as the cursor is
moved within a lane surrounding the boundary whose width changes as a
function of the speed and acceleration of cursor motion. Live-wire
segments are generated and displayed in real time between successive
points. The users get the feeling that the curve snaps onto the
boundary as and while they roughly mark in the vicinity of the boundary.
We describe formal evaluation studies to compare the utility of the new
methods with that of manual tracing based on speed and repeatability of
tracing and on data taken from a large ongoing application. The studies
indicate that the new methods are statistically significantly more
repeatable and 1.5-2.5 times faster than manual tracing. (C) 1998
Academic Press.
|
258. | Bardinet, E, Cohen, LD, and Ayache, N, "A parametric deformable model to fit unstructured 3D data," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 71, pp. 39-54, 1998.
Abstract:
In many computer vision and image understanding problems, it is
important to find a smooth surface that fits a set of given
unstructured 3D data. Although approaches based on general deformable
models give satisfactory results, in particular a local description of
the surface, they involve large linear systems to solve when dealing
with high resolution 3D images. The advantage of parametric deformable
templates like superquadrics is their small number of parameters to
describe a shape. However, the set of shapes described by superquadrics
is too limited to approximate precisely complex surfaces. This is why
hybrid models have been introduced to refine the initial approximation.
This article introduces a deformable superquadric model based on a
superquadric fit followed by a free-form deformation (FFD) to fit
unstructured 3D points. At the expense of a reasonable number of
additional parameters, free-form deformations provide a much closer fit
and a volumetric deformation field. We first present the mathematical
and algorithmic details of the method. Then, since we are mainly
concerned with applications for medical images, we present a medical
application consisting in the reconstruction of the left ventricle of
the heart from a number of various 3D cardiac images. The extension of
the method to track anatomical structures in spatio-temporal images (4D
data) is presented in a companion article [9]. (C) 1998 Academic Press.
|
259. | Snel, JG, Venema, HW, and Grimbergen, CA, "Detection of the carpal bone contours from 3-D MR images of the wrist using a planar radial scale-space snake," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 17, pp. 1063-1072, 1998.
Abstract:
In this paper we consider the problems encountered when applying snake
models to detect the contours of the carpal bones in 3-D MR images of
the wrist, In order to improve the performance of the original snake
model introduced by Kass [1], we propose a new image force based on
one-dimensional (1-D) second-order Gaussian filtering and contrast
equalization,
The improved snake is less sensitive to model initialization and has no
tendency to cut off contour sections of high curvature, because 1-D
radial scale-space relaxation is used, Contour orientation is used to
minimize the influence of neighboring image structures. Due to 1-D
contrast equalization an intensity insensitive measure of external
energy is obtained. As a consequence a good balance between internal
and external energetic contributions of the snake is established, which
also improves convergence.
By incorporating this new image force into the snake model, we succeed
in accurate contour detection, even when relatively high noise levels
are present and when the contrast varies along the contours of the
bones.
|
260. | Lam, KM, and Yan, H, "An analytic-to-holistic approach for face recognition based on a single frontal view," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 20, pp. 673-686, 1998.
Abstract:
In this paper, we propose an analytic-to-holistic approach which can
identify faces at different perspective variations. The database for
the test consists of 40 frontal-view faces. The first step is to locate
15 feature points on a face. A head model is proposed, and the rotation
of the face can be estimated using geometrical measurements. The
positions of the feature points are adjusted so that their
corresponding positions for the frontal view are approximated. These
feature points are then compared with the feature points of the faces
in a database using a similarity transform. In the second step, we set
up windows for the eyes, nose, and mouth. These feature windows are
compared with those in the database by correlation. Results show that
this approach can achieve a similar level of performance from different
viewing directions of a face. Under different perspective variations,
the overall recognition rates are over 84 percent and 96 percent for
the first and the first three likely matched faces, respectively.
|
261. | Cheng, D, Mercer, RE, Barron, JL, and Joe, P, "Tracking severe weather storms in Doppler radar images," INTERNATIONAL JOURNAL OF IMAGING SYSTEMS AND TECHNOLOGY, vol. 9, pp. 201-213, 1998.
Abstract:
We describe an automatic storm-tracking system to help with the
forecasting of severe storms. in this article, we present the concepts
of fuzzy point, fuzzy vector, fuzzy length of a fuzzy vector, and fuzzy
angle between two nonzero fuzzy vectors, that are used in our tracking
algorithm. These concepts are used to overcome some of the limitations
of our previous work, where fixed center-of-mass storm centers did not
provide smooth tracks over time, while at the same time, their
detection was very threshold sensitive. Our algorithm uses region
splitting with dynamic thresholding to determine storm masses in
Doppler radar intensity images. We represent the center of a
hypothesized storm using a fuzzy point. These fuzzy storm centers are
then tracked over time using an incremental relaxation algorithm. We
have developed a visualization program using the X11 Athena toolkit for
our storm visualization tool. The algorithm was tested on seven real
radar image sequences obtained from the Atmospheric Environment Service
radar station at King City, Ontario, Canada. We can obtain storm tracks
that are long and smooth and which closely match an expert
meteorologist's perception. (C) 1998 John Wiley & Sons, Inc. Int J
Imaging Syst Technol, 9, 201-213, 1998.
|
262. | Grenander, U, and Miller, MI, "Computational anatomy: An emerging discipline," QUARTERLY OF APPLIED MATHEMATICS, vol. 56, pp. 617-694, 1998.
Abstract:
This paper studies mathematical methods in the emerging new discipline
of Computational Anatomy. Herein we formalize the Brown/Washington
University model of anatomy following the global pattern theory
introduced in [1, 2], in which anatomies are represented as deformable
templates, collections of 0, 1, 2, 3-dimensional manifolds. Typical
structure is carried by the template with the variabilities
accommodated via the application of random transformations to the
background manifolds. The anatomical model is a quadruple (Omega, H, I,
P), the background space Omega = boolean ORalpha M-alpha of 0, 1, 2,
3-dimensional manifolds, the set of diffeomorphic transformations on
the background space H : Omega <-> Omega, the space of idealized
medical imagery I, and P the family of probability measures on H. The
group of diffeomorphic transformations H is chosen to be rich enough so
that a large family of shapes may be generated with the topologies of
the template maintained. For normal anatomy one deformable template is
studied, with (Omega, H, I) corresponding to a homogeneous space [3],
in that it can be completely generated from one of its elements, I =
HItemp,I-temp is an element of I. For disease, a family of templates
boolean ORalphaItempalpha are introduced of perhaps varying dimensional
transformation classes. The complete anatomy is a collection of
homogeneous spaces I-total = boolean ORalpha(I-alpha,H-alpha).
There are three principal components to computational anatomy studied
herein.
(1) Computation of large deformation maps: Given any two elements I, I'
is an element of I in the same homogeneous anatomy (Omega, H, I),
compute diffeomorphisms h from one anatomy to the other I
(h-1)reversible arrow(h) I'. This is the principal method by which
anatomical structures are understood, transferring the emphasis from
the images I is an element of I to the structural transformations h is
an element of H that generate them.
(2) Computation of empirical probability laws: Given populations of
anatomical imagery and diffeomorphisms between them I h(n-1)reversible
arrow(hn) I-n, n = 1, . . . , N, generate probability laws P is an
element of P on H that represent the anatomical variation reflected by
the observed population of diffeomorphisms h(n), n = 1,..., N.
(3) Inference and disease testing: Within the anatomy (Omega, H, I, P),
perform Bayesian classification and testing for disease and anomaly.
|
263. | Long, Q, Xu, XY, Collins, MW, Bourne, M, and Griffith, TM, "Magnetic resonance image processing and structured grid generation of a human abdominal bifurcation," COMPUTER METHODS AND PROGRAMS IN BIOMEDICINE, vol. 56, pp. 249-259, 1998.
Abstract:
Magnetic resonance angiography (MRA) offers a non-invasive approach to
the acquisition of anatomically accurate human arterial structure.
Combining the latest computational fluid dynamics (CFD) techniques with
clinical data from MRA, the detailed haemodynamics information in the
human circulation system can be obtained. In this paper, a novel
computer method is presented, which generates automatically a
computational grid for a human abdominal bifurcation from a set of
conventional MRA images. The method covers the complete sequence from
MR image segmentation, 3-D model construction, grid generation, to grid
quality evaluation. Results demonstrate that the computer program
developed is capable of generating a good quality grid for human
arterial bifurcations from MRA images with minimum user. input. The
resultant grid can be used directly for further computer simulation of
the flow. (C) 1998 Elsevier Science Ireland Ltd. All rights reserved.
|
264. | Morrow-Tesch, J, Dailey, JW, and Jiang, H, "A video data base system for studying animal behavior," JOURNAL OF ANIMAL SCIENCE, vol. 76, pp. 2605-2608, 1998.
Abstract:
Classification of farm animal behavior is based on oral or written
descriptions of the activity in which the animal is engaged. The
quantification of animal behavior for research requires that
individuals recognize and code the behavior of the animal under study.
The classification of these behaviors can be subjective and may differ
among observers. Illustrated guides to animal behavior do not convey
the motion associated with most behaviors. Video-based guides offer a
method of quantifying behaviors with real-time demonstrations of the
components that make up a behavior. An animal behavior encyclopedia has
been developed to allow searching and viewing of defined
(video-recorded) behaviors on the Internet. This video data base is
being developed to initiate a system that automatically extracts animal
motion information from an input animal activity video clip using a
multiobject tracking and reasoning system. Eventually, the extracted
information will be analyzed and described using standard animal
behavior definitions (the behavior encyclopedia). The intended
applications of the behavior encyclopedia and video tracking system are
1) an accessible data base for defining and illustrating behaviors for
both research and teaching and 2) to further automate the collection of
animal behavior data.
|
265. | Hu, YL, Rogers, WJ, Coast, DA, Kramer, CM, and Reichek, N, "Vessel boundary extraction based on a global and local deformable physical model with variable stiffness," MAGNETIC RESONANCE IMAGING, vol. 16, pp. 943-951, 1998.
Abstract:
Reliable and efficient vessel cross-sectional boundary extraction is
very important for many medical magnetic resonance (MR) image studies.
General purpose edge detection algorithms often fail for medical MR
images processing due to fuzzy boundaries, inconsistent image contrast,
missing edge features, and the complicated background of MR images. In
this regard, we present a vessel cross-sectional boundary extraction
algorithm based on a global and local deformable model with variable
stiffness. With the global model, the algorithm can handle relatively
large vessel position shifts and size changes. The local deformation
with variable stiffness parameters enable the model to stay right on
edge points at the location where edge features are strong and at the
same time, fit a smooth contour at the location where edge features are
missing, Directional gradient information is used to help the model to
pick correct edge segments. The algorithm was used to process MR cine
phase-contrast images of the aorta from 20 volunteers (over 500 images)
with excellent results. (C) 1998 Elsevier Science Inc.
|
266. | Wolberg, G, "Image morphing: a survey," VISUAL COMPUTER, vol. 14, pp. 360-372, 1998.
Abstract:
Image morphing has received much attention in recent years. It has
proven to be a powerful tool for visual effects in film and television,
enabling the fluid transformation of one digital image into another.
This paper surveys the growth of this field and describes recent
advances in image morphing in terms of feature specification, warp
generation methods, and transition control. These areas relate to the
ease of use and quality of results. We describe the role of radial
basis functions, thin plate splines, energy minimization, and
multilevel free-form deformations in advancing the state-of-the-art in
image morphing. Recent work on a generalized framework for morphing
among multiple images is described.
|
267. | Gao, PS, and Sederberg, TW, "A work minimization approach to image morphing," VISUAL COMPUTER, vol. 14, pp. 390-400, 1998.
Abstract:
We present an algorithm for morphing two images, often with little or
no user interaction. For two similar images (such as different faces
against a neutral background), the algorithm generally can create a
pleasing morph completely automatically. The algorithm seeks to
minimize the work needed to deform one image into the other. Work is
defined as a function of the amount of warping and recoloration. We
invoke a hierarchical method for finding a minimal work solution.
Anchor point constraints are satisfied by penalties imposed on
deformations that disobey these constraints. Good results can be
obtained in less than 10 s for 256x256 images.
|
268. | Tang, CK, Medioni, G, and Duret, F, "Automatic, accurate surface model inference for dental CAD/CAM," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI'98, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1496, pp. 732-742, 1998.
Abstract:
Dental CAD/CAM offers the prospects of drastically reducing the time to
provide service to patients, with no compromise on quality. Given the
state-of-the-art in sensing, design, and machining, an attractive
approach is to have a technician generate a restorative design in wax,
which can then be milled by a machine in porcelain or titanium. The
difficulty stems from the inherent outlier noise in the measurement
phase. Traditional techniques remove noise at the cost of smoothing,
degrading discontinuities such as anatomical lines which require
accuracy up to 5 to 10 mu m to avoid artifacts. This paper presents an
efficient method for the automatic and accurate data validation and 3-D
shape inference from noisy digital dental measurements. The input
consists of 3-D points with spurious samples, as obtained from a
variety of sources such as a laser scanner or a stylus probe. The
system produces faithful smooth surface approximations while preserving
critical curve features such as grooves and preparation lines. To this
end, we introduce the Tensor Voting technique, which efficiently
ignores noise, infers smooth structures, and preserves underlying
discontinuities. This method is non-iterative, does not require initial
guess, and degrades gracefully with spurious noise, missing and
erroneous data. We show results on real and complex data.
|
269. | Jiang, HT, and Elmagarmid, AK, "Spatial and temporal content-based access to hypervideo databases," VLDB JOURNAL, vol. 7, pp. 226-238, 1998.
Abstract:
Providing content-based video query, retrieval and browsing is the most
important goal of a video database management system (VDBRIS). Video
data is unique not only in terms of its spatial and temporal
characteristics, but also in the semantic associations manifested by
the entities present in the video. This paper introduces a novel video
data model called Logical Hypervideo Data,Model. In addition to
multilevel video abstractions, the model is capable of representing
video entities that users are interested in (defined as hot objects)
and their semantic associations with other logical video abstractions,
including hot objects themselves. The semantic associations are modeled
as video hyperlinks and video data with such property are called
hypervideo. Video hyperlinks provide a flexible and effective way of
browsing video data. Based on the proposed model, video queries can be
specified with both temporal and spatial constraints, as well as with
semantic descriptions of the video data. The characteristics of hot
objects' spatial and temporal relations and efficient evaluation of
them are also discussed. Some query examples are given to demonstrate
the expressiveness of the video data model and query language. Finally,
we describe a modular video database system architecture that our
web-based prototype is based on.
|
270. | MacDonald, D, Avis, D, and Evans, AC, "Proximity constraints in deformable models for cortical surface identification," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI'98, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1496, pp. 650-659, 1998.
Abstract:
Automatic computer processing of large multi-dimensional images such as
those produced by magnetic resonance imaging (MRI) is greatly aided by
deformable models. A general method of deforming polyhedra is presented
here, with two novel features. Firstly, explicit prevention of
non-simple (self-intersecting) surface geometries is provided, unlike
conventional deformable models which merely discourage such behaviour.
Secondly, simultaneous deformation of multiple surfaces with
inter-surface proximity constraints provides a greater facility for
incorporating model-based constraints into the process of image
recognition. These two features are used advantageously to
automatically identify the total surface of the cerebral cortical gray
matter from normal human MR images, accurately locating the depths of
the sulci even where under-sampling in the image obscures the
visibility of sulci. A large number of individual surfaces (N=151) are
created and a spatial map of the mean and standard deviation of the
cerebral cortex and the thickness of cortical gray matter are
generated. Ideas for further work are outlined.
|
271. | Wink, O, Niessen, WJ, and Viergever, MA, "Fast quantification of abdominal aortic aneurysms from CTA volumes," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI'98, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1496, pp. 138-145, 1998.
Abstract:
A method is presented which aids the clinician in obtaining
quantitative measurements of an abdominal aortic aneurysm from a CTA
volume. These measurements are needed in the preoperative evaluation of
candidates for minimally invasive aneurysmal repair. The user
initializes starting points in the iliac artery, Subsequently, an
iterative tracking procedure outlines the central lumen line in the
aorta and the iliac arteries. Quantitative measurements on vessel
morphology are performed in the planes perpendicular to the vessel
axis. The entire process is performed in less than one minute on a
standard workstation. In addition to the presentation of the calculated
measures, a 3D view of the vessels is generated. This allows for
interactive inspection of the vasculature and the tortuosity of the
vessels.
|
272. | Positano, V, Santarelli, MF, Landini, L, and Benassi, A, "Fast and quantitative analysis of 4D cardiac images using a SMP architecture," APPLIED PARALLEL COMPUTING, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1541, pp. 447-451, 1998.
Abstract:
In the present research a parallel algorithm for medical image
processing has been proposed, which allows 3D quantitative analysis of
left ventricular cardiac wall motion in real time. It is a fundamental
task in evaluating a lot of indexes useful to perform diagnosis of
important diseases. However, such analysis involves expensive tasks in
terms of computational time: tridimensional segmentation and an
accurate cavity contour detection during the entire cardiac cycle. In
this paper an implementation of a dynamic quantitative analysis
algorithm on low-cost Shared Memory Processor machine is described. In
order to test the developed system in actual environment, a dynamic
sequence of 3D data volume, derived from Magnetic Resonance (MR)
cardiac images, has been processed.
|
273. | Lotjonen, J, Magnin, IE, Reissman, PJ, Nenonen, J, and Katila, T, "Segmentation of magnetic resonance images using 3D deformable models," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI'98, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1496, pp. 1213-1221, 1998.
Abstract:
A new method to segment MR volumes has been developed. The method
matches elastically a 3D deformable prior model, describing the
structures of interest, to the MR volume of a patient. The deformation
is done using a deformation grid. Oriented distance maps are utilized
to guide the deformation process. Two alternative restrictions are used
to preserve the geometrical prior knowledge of the model. The method is
applied to extract the body, the lungs and the heart. The segmentation
is needed to build individualized boundary element models for
bioelectromagnetic inverse problem. The method is fast, automatic and
accurate. Good results have been achieved for four MR volumes tested so
far.
|
274. | Lorigo, LM, Faugeras, O, Grimson, WEL, Keriven, R, and Kikinis, R, "Segmentation of bone in clinical knee MRI using texture-based geodesic active contours," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI'98, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1496, pp. 1195-1204, 1998.
Abstract:
This paper presents a method for automatic segmentation of the tibia
and femur in clinical magnetic resonance images of knees. Texture
information is incorporated into an active contours framework through
the use of vector-valued geodesic snakes with local variance as a
second value at each pixel, in addition to intensity. This additional
information enables the system to better handle noise and the
non-uniform intensities found within the structures to be segmented. It
currently operates independently on 2D images (slices of a volumetric
image) where the initial contour must be within the structure but not
necessarily near the boundary. These separate segmentations are stacked
to display the performance on the entire 3D structure.
|
275. | Sebastian, TB, Tek, H, Crisco, JJ, Wolfe, SW, and Kimia, BB, "Segmentation of carpal bones from 3D CT images using skeletally coupled deformable models," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI'98, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1496, pp. 1184-1194, 1998.
Abstract:
The in vivo investigation of joint kinematics in normal and injured
wrist requires the segmentation of carpal bones from 3D (CT) images and
their registration over time. The non-uniformity of bone tissue,
ranging from dense cortical bone to textured spongy bone, the
irregular, small shape of closely packed carpel bones which move with
respect to one another, and with respect to CT resolution, augmented
with the presence of blood vessels, and the inherent blurring of CT
imaging renders the segmentation of carpal bones a challenging task.
Specifically, four characteristic difficulties are prominent: (i) gaps
or weak edges in the carpal bone surfaces. (ii) diffused edges, (iii)
textured regions, and, (iv) extremely narrow inter-bone regions. We
review the performance of statistical classification! deformable
models, region growing, and morphological operations for this
application. We then propose a model which. combines several of these
approaches in a single framework. Specifically, initialized seeds grow
in a curve evolution implementation of active contours, but where
growth is modulated by a skeletally-mediated competition between
neighboring regions, thus combining the advantages of local and global
region growing methods, region competition and active contours. This
approach effectively deals with many of the difficulties presented
above as illustrated by numerous examples.
|
276. | Poupon, F, Mangin, JF, Hasboun, D, Poupon, C, Magnin, I, and Frouin, V, "Multi-object deformable templates dedicated to the segmentation of brain deep structures," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI'98, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1496, pp. 1134-1143, 1998.
Abstract:
We propose a new way of embedding shape distributions in a topological
deformable template. These distributions rely on global shape
descriptors corresponding to the 3D moment invariants. In opposition to
usual Fourier-like descriptors, they can be updated during deformations
at a relatively low cost. The moment-based distributions are included
in a framework allowing the management of several simultaneously
deforming objects. This framework is dedicated to the segmentation of
brain deep nuclei in 3D MR images. The paper focuses on the learning of
the shape distributions, on the initialization of the topological model
and on the multi-resolution energy minimization process. Results are
presented showing the segmentation of twelve brain deep structures.
|
277. | Xu, CY, and Prince, JL, "Generalized gradient vector flow external forces for active contours," SIGNAL PROCESSING, vol. 71, pp. 131-139, 1998.
Abstract:
Active contours, or snakes, are used extensively in computer vision and
image processing applications, particularly to locate object
boundaries. A new type of external force for active contours, called gi
adient vector flow (GVF) was introduced recently to address problems
associated with initialization and poor convergence to boundary
concavities. GVF is computed as a diffusion of the gradient vectors of
a gray-level or binary edge map derived from the image. In this paper,
we generalize the GVF formulation to include two spatially varying
weighting functions. This improves active contour convergence to long,
thin boundary indentations, while maintaining other desirable
properties of GVF, such as an extended capture range. The original GVF
is a special case of this new generalized GVF (GGVF) model. An error
analysis for active contour results on simulated test images is also
presented. (C) 1998 Elsevier Science B.V. All rights reserved.
|
278. | Montagnat, J, and Delingette, H, "Globally constrained deformable models for 3D object reconstruction," SIGNAL PROCESSING, vol. 71, pp. 173-186, 1998.
Abstract:
To achieve geometric reconstruction from 3D datasets two complementary
approaches have been widely used. On one hand, the deformable model
framework locally applies forces to fit the data. On the other hand,
the non-rigid registration framework computes a global transformation
minimizing the distance between a template and the data. We first show
that applying a global transformation on a surface template, is
equivalent to applying certain global forces on a deformable model.
Second, we propose a scheme which combines the registration and
free-form deformation. This globally constrained deformation scheme
allows us to control the amount of deformation from the reference shape
with a single parameter. Finally, we propose a general algorithm for
performing model-based reconstruction in a robust and accurate manner.
Examples on both range data and medical images are used to illustrate
and validate the globally constrained deformation framework. (C) 1998
Elsevier Science B.V. All rights reserved.
|
279. | Pavlidis, I, Papanikolopoulos, N, and Mavuduru, R, "Signature identification through the use of deformable structures," SIGNAL PROCESSING, vol. 71, pp. 187-201, 1998.
Abstract:
Automatic signature verification is a well-established and active
research area with numerous applications. In contrast, automatic
signature identification has been given little attention, although
there is a vast array of potential applications that could use the
signature as an identification tool. This paper presents a novel
approach to the problem of signature identification. We introduce the
use of the revolving active deformable model as a powerful way of
capturing the unique characteristics of the overall structure of a
signature. Experimental evidence as well as intuition support the idea
that the overall structure of a signature uniquely determines the
signature in the majority of cases. Our revolving active deformable
model originates from the snakes introduced in computer vision by Kass
et al., but its implementation has been tailored to the task at hand.
This computer-generated model interacts with the virtual gravity field
created by the image gradient. Ideally, the uniqueness of this
interaction mirrors the uniqueness of the signature's overall
structure. The proposed method obviates the use of a computationally
expensive segmentation approach and is parallelizable. The experiments
performed with a signature database show that the proposed method is
promising. (C) 1998 Elsevier Science B.V. All rights reserved.
|
280. | Hinshaw, KP, and Brinkley, JF, "Incorporating constraint-based shape models into an interactive system for functional brain mapping," JOURNAL OF THE AMERICAN MEDICAL INFORMATICS ASSOCIATION, vol. 71, pp. 921-925, 1998.
Abstract:
Through intraoperative electrical stimulation mapping, it is possible
to identify sites on the surface of the brain that are essential for
language function. Interesting correlations have been found between the
distribution of these sites and behavioral traits such as verbal IQ. In
previous work, tools were developed for building a reconstruction of a
patient's cortical surface and using it to recover coordinates of
essential language sites. However, considerable expertise was required
to produce good reconstructions. This paper describes an improved
version of the mapping procedure, in which segmentation is driven by a
3-D shape model. The model-based approach provides more intuitive
control over the system, allowing a trained user to complete a surface
reconstruction and mapping in about two hours. This level of
performance makes it feasible to gather language maps for a large
number of patients, which hopefully will lead to significant new
findings about language organization in the brain.
|
281. | Gupta, K, "Motion planning for flexible shapes (systems with many degrees of freedom): a survey," VISUAL COMPUTER, vol. 14, pp. 288-302, 1998.
Abstract:
This article provides a brief tutorial-cum-overview of motion planning
for "flexible" shapes. The article takes the point of view that motion
planning for flexible shapes, in a broad sense, essentially amounts to
motion planning for systems with many degrees of freedom (dofs), a
well-studied problem in robotics. We start with the basics of motion
planning including an introduction to some key concepts, survey a
number of recent approaches to solve the motion planning for systems
with many dofs, discuss the application of some of these approaches to
motion planning for flexible shapes, and report, on some recent work in
this area.
|
282. | Brandtberg, T, and Walter, F, "Automated delineation of individual tree crowns in high spatial resolution aerial images by multiple-scale analysis," MACHINE VISION AND APPLICATIONS, vol. 11, pp. 64-73, 1998.
Abstract:
This paper presents an automatic multiple-scale algorithm for
delineation of individual tree crowns in high spatial resolution
infrared colour aerial images. The tree crown contours were identified
as zero-crossings, with convex grey-level curvature, which were
computed on the intensity image for each image scale. A modified centre
of curvature was estimated for every edge segment pixel. For each
segment, these centre points formed a swarm which was modelled as a
primal sketch using an ellipse extended with the mean circle of
curvature. The model described the region of the derived tree crown
based on the edge segment at the current scale. The sketch was rescaled
with a significance value and accumulated for a scale interval. In the
accumulated sketch, a tree crown segment was grown, starting at local
peaks, under the condition that it was inside the area of healthy
vegetation in the aerial image and did not trespass into a neighbouring
crown segment. The method was evaluated by comparison with manual
delineation and with ground truth on 43 randomly selected sample plots.
It was concluded that the performance of the method is almost
equivalent to visual interpretation. On the average, seven out of ten
tree crowns were the same. Furthermore, ground truth indicated a large
number of hidden trees. The proposed technique could be used as a basic
tool in forest surveys.
|
283. | Ip, HHS, and Shen, DG, "An affine-invariant active contour model (AI-snake) for model-based segmentation," IMAGE AND VISION COMPUTING, vol. 16, pp. 135-146, 1998.
Abstract:
In this paper, we show that existing shaped-based active contour models
are not affine-invariant and we addressed the problem by presenting an
affine-invariant snake model (AI-snake) such that its energy function
are defined in terms local and global affine-invariant features. The
main characteristic of the AI-snake is that, during the process of
object extraction, the pose of the model contour is dynamically
adjusted such that it is in alignment with the current snake contour by
solving the snake-prototype correspondence problem and determining the
required affine transformation. In addition, we formulate the
correspondence matching between the snake and the object prototype as
an error minimization process between two feature vectors which capture
both local and global deformation information. We show that the
technique is robust against object deformations and complex scenes. (C)
1998 Elsevier Science B.V.
|
284. | Tupin, F, Maitre, H, Mangin, JF, Nicolas, JM, and Pechersky, E, "Detection of linear features in SAR images: Application to road network extraction," IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, vol. 36, pp. 434-453, 1998.
Abstract:
We propose a two-step algorithm for almost unsupervised detection of
linear structures, in particular, main axes in road networks, as seen
in synthetic aperture radar (SAR) images. The first step is local and
is used to extract linear features from the speckle radar image, which
are treated as road-segment candidates. We present two local line
detectors as well as a method for fusing information from these
detectors, In the second global step, we identify the real roads among
the segment candidates by defining a Markov random field (MRF) on a set
of segments, which introduces contextual knowledge about the shape of
road objects, The influence of the parameters on the road detection is
studied and results are presented for various real radar images.
|
285. | Calabi, E, Olver, PJ, Shakiban, C, Tannenbaum, A, and Haker, S, "Differential and numerically invariant signature curves applied to object recognition," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 26, pp. 107-135, 1998.
Abstract:
We introduce a new paradigm, the differential invariant signature curve
or manifold, for the invariant recognition of visual objects. A general
theorem of E. Cartan implies that two curves are related by a group
transformation if and only if their signature curves are identical. The
important examples of the Euclidean and equi-affine groups are
discussed in detail. Secondly, we show how a new approach to the
numerical approximation of differential invariants, based on suitable
combination of joint invariants of the underlying group action, allows
one to numerically compute differential invariant signatures in a fully
group-invariant manner. Applications to a variety of fundamental issues
in vision, including detection of symmetries, visual tracking, and
reconstruction of occlusions, are discussed.
|
286. | Younes, L, "Computable elastic distances between shapes," SIAM JOURNAL ON APPLIED MATHEMATICS, vol. 58, pp. 565-586, 1998.
Abstract:
We define distances between geometric curves by the square root of the
minimal energy required to transform one curve into the other. The
energy is formally defined from a left invariant Riemannian distance on
an infinite dimensional group acting on the curves, which can be
explicitly computed. The obtained distance boils down to a variational
problem for which an optimal matching between the curves has to be
computed. An analysis of the distance when the curves are polygonal
leads to a numerical procedure for the solution of the variational
problem, which can efficiently be implemented, as illustrated by
experiments.
|
287. | Fua, P, "Fast, accurate and consistent modeling of drainage and surrounding terrain," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 26, pp. 215-234, 1998.
Abstract:
We propose an automated approach to modeling drainage channels-and,
more generally, linear features that lie on the terrain-from multiple
images. It produces models of the features and of the surrounding
terrain that are accurate and consistent and requires only minimal
human intervention.
We take advantage of geometric constraints and photommetric knowledge.
First, rivers flow downhill and lie at the bottom of valleys whose
floors tend to be either V- or U-shaped. Second, the drainage pattern
appears in gray-level images as a network of linear features that can
be visually detected.
Many approaches have explored individual facets of this problem. Ours
unifies these elements in a common framework. We accurately model
terrain and features as 3-dimensional objects from several information
sources that may be in error and inconsistent with one another. This
approach allows us to generate models that are faithful to sensor data,
internally consistent and consistent with physical constraints. We have
proposed generic models that have been applied to the specific task at
hand. We show that the constraints can be expressed in a
computationally effective way and, therefore, enforced while
initializing the models and then fitting them to the data. Furthermore,
these techniques are general enough to work on other features that are
constrained by predictable forces.
|
288. | Noble, JA, Gupta, R, Mundy, J, Schmitz, A, and Hartley, RI, "High precision X-ray stereo for automated 3-D CAD-based inspection," IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, vol. 14, pp. 292-302, 1998.
Abstract:
An important challenge in industrial metrology is to provide rapid
measurement of critical three-dimensional (3-D) internal object
geometry for either inspecting high volume parts or controlling a
machining process, Existing metrological techniques are typically too
slow to meet this need or can not measure small features with high
precision.
In this paper, we present a new method that achieves fast, accurate,
internal 3-D geometry measurement based on 3-D reconstruction from a
few X-ray views of a part, Our approach utilizes an accurate camera
model for the X-ray sensor, calibration using in situ ground truth and
geometry-guided X-ray feature extraction to achieve this goal and has
been fully implemented in a prototype 3-D measurement system, We
describe a novel application of the system to CAD-based verification of
drilled hole positioning. Experimental results are given to illustrate
the precision of the system and 3-D measurement on real industrial
parts.
|
289. | Chesnaud, C, Page, V, and Refregier, P, "Improvement in robustness of the statistically independent region snake-based segmentation method of target-shape tracking," OPTICS LETTERS, vol. 23, pp. 488-490, 1998.
Abstract:
We propose a technique to increase the robustness of a snake-based
segmentation method originally introduced to track the shape of a
target with random white Gaussian intensity upon a random white
Gaussian background. Because these statistical conditions are not
always fulfilled with optronic images, we describe two improvements
that increase the field of application of this approach. We first show
that regularized whitening preprocessing allows one to apply the
original method successfully for a target with a correlated texture
upon a correlated background. We then introduce a simple multiscale
approach that increases the robustness of the segmentation against the
initialization of the snake (i.e., the initial shape used for the
segmentation). These results provide a robust and practical method for
determination of the reference image for correlation techniques. (C)
1998 Optical Society of America.
|
290. | Casadei, S, and Mitter, S, "Hierarchical image segmentation - Part I: Detection of regular curves in a vector graph," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 27, pp. 71-100, 1998.
Abstract:
The problem of edge detection is viewed as a hierarchy of detection
problems where the geometric objects to be detected (e.g., edge points,
curves, regions) have increasing complexity and spatial extent. An
early stage of the proposed hierarchy consists in detecting the regular
portions of the visible edges. The input to this stage is given by a
graph whose vertices are tangent vectors representing local and
uncertain information about the edges. A model relating the input
vector graph to the curves to be detected is proposed. An algorithm
with linear time complexity is described which solves the corresponding
detection problem in a worst-case scenario. The stability of curve
reconstruction in the presence of uncertain information and multiple
responses to the same edge is analyzed and addressed explicitly by the
proposed algorithm.
|
291. | Malassiotis, S, and Strintzis, MG, "Tracking textured deformable objects using a finite-element mesh," IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, vol. 8, pp. 756-774, 1998.
Abstract:
This paper presents an algorithm for the estimation of the motion of
textured objects undergoing nonrigid deformations over a sequence of
images. An active mesh model, which is a finite-element deformable
membrane, is introduced in order to achieve efficient representation of
global and local deformations, The mesh is constructed using an
adaptive triangulation procedure that places more triangles over high
detail areas. Through robust least squares techniques and modal
analysis, efficient estimation of global object deformations is
achieved, based on a set of sparse displacement measurements. A local
warping procedure is then applied to minimize the intensity matching
error between subsequent images, and thus estimate local deformations,
Among the major contributions of this paper are novel techniques
developed to acquire knowledge of the object dynamics and structure
directly from the image sequence, even in the absence of prior
intelligence regarding the scene, Specifically, a coarse-to-fine
estimation scheme is first developed, which adapts the model to locally
deforming features. Subsequently, principal components modal analysis
is used to accumulate knowledge of the object dynamics. This knowledge
is finally exploited to constrain the object deformation. The problem
of tracking the model over time is addressed, and a novel
motion-compensated prediction approach is proposed to facilitate this.
A novel method for the determination of the dynamical principal axes of
deformation is developed, The experimental results demonstrate the
efficiency and robustness of the proposed scheme, which has many
potential applications in the areas of image coding, image analysis,
and computer graphics.
|
292. | Luan, JA, Stander, J, and Wright, D, "On shape detection in noisy images with particular reference to ultrasonography," STATISTICS AND COMPUTING, vol. 8, pp. 377-389, 1998.
Abstract:
We discuss the detection of a connected shape in a noisy image. Two
types of image are considered: in the first a degraded outline of the
shape is visible, while in the second the data are a corrupted version
of the shape itself. In the first type the shape is defined by a thin
outline of pixels with records that are different from those at pixels
inside and outside the shape, while in the second type the shape is
defined by its edge and pixels inside and outside the shape have
different records. Our motivation is the identification of
cross-sectional head shapes in ultrasound images of human fetuses. We
describe and discuss a new approach to detecting shapes in images of
the first type that uses a specially designed filter function that
iteratively identifies the outline pixels of the head. We then suggest
a way based on the cascade algorithm introduced by Jubb and Jennison
(1991) of improving and considerably increasing the speed of a method
proposed by Storvik (1994) for detecting edges in images of the second
type.
|
293. | Park, JS, and Han, JH, "Contour motion estimation from image sequences using curvature information," PATTERN RECOGNITION, vol. 31, pp. 31-39, 1998.
Abstract:
This paper presents a novel method of velocity field estimation for the
points on moving contours in a 2-D image sequence. The method
determines the corresponding point in a next image frame by considering
the curvature change of a given point on the contour. In traditional
methods, there are errors in optical flow estimation for the points
which have low curvature variations since those methods compute
solutions by approximating normal optical flow. The proposed method
computes optical flow vectors of contour points minimizing the
curvature changes. As a first step, snakes are used to locate smooth
curves in 2-D imagery. Thereafter, the extracted curves are tracked
continuously. Each point on a contour has a unique corresponding point
on the contour in the next frame whenever the curvature distribution of
the contour varies smoothly. The experimental results showed that the
proposed method computes accurate optical flow vectors for various
moving contours. (C) 1997 Pattern Recognition Society. Published by
Elsevier Science Ltd.
|
294. | Gunn, SR, and Nixon, MS, "Global and local active contours for head boundary extraction," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 30, pp. 43-54, 1998.
Abstract:
Active contours are an attractive choice to extract the head boundary,
for deployment within a face recognition or model-based coding
scenario. However, conventional snake approaches can suffer difficulty
in initialisation and parameterisation. A dual active contour
configuration using dynamic programming has been developed to resolve
these difficulties by using a global energy minimisation technique and
a simplified parameterisation, to enable a global solution to be
obtained. The merits of conventional gradient descent based snake
(local) approaches, and search-based (global) approaches are discussed.
In application to find head and face boundaries in front-view face
images, the new technique employing dynamic programming is deployed to
extract the inner face boundary, along with a conventional
normal-driven contour to extract the outer (head) boundary. The
extracted contours appear to offer sufficient discriminatory capability
for inclusion within an automatic face recognition system.
|
295. | Jain, AK, Zhong, Y, and Dubuisson-Jolly, MP, "Deformable template models: A review," SIGNAL PROCESSING, vol. 71, pp. 109-129, 1998.
Abstract:
In this paper, we review the recently published work on deformable
models. We have chosen to concentrate on 2D deformable models and
relate the energy minimization approaches to the Bayesian formulations.
We categorize the various active contour systems according to the
definition of the deformable model. We also present in detail one
particular formulation for deformable templates which combines edge,
texture, color and region information for the external energy and model
deformations using wavelets, splines or Fourier descriptors. We explain
how these models can be used for segmentation, image retrieval in a
large database and object tracking in a video sequence. (C) 1998
Elsevier Science B.V. All rights reserved.
|
296. | Schultz, N, and Conradsen, K, "2D vector-cycle deformable templates," SIGNAL PROCESSING, vol. 71, pp. 141-153, 1998.
Abstract:
In this paper the theory of deformable templates as a vector cycle in
2D is described. The deformable template model originated in
(Grenander, 1983) and was further investigated in (Grenander st al.,
1991). A template vector distribution is induced by parameter
distributions from transformation matrices applied to the vector cycle.
An approximation in the parameter distribution is introduced. The main
advantage by using the deformable template model is the ability to
simulate a wide range of objects constrained by e.g. their biological
variations, and thereby improve restoration, segmentation and
classification tasks. For the segmentation the Metropolis algorithm and
simulated annealing are used in a Bayesian scheme to obtain a maximum a
posteriori estimator. Different energy functions are introduced and
applied to different tasks in a case study. The energy functions are
local mean, local gradient and probability measurement. The case study
concerns estimation of meat percent in pork carcasses. Given two
cross-sectional images - one at the front and one near the ham of the
carcass - the areas of lean and fat and a muscle in the lean area are
measured automatically by the deformable templates. (C) 1998 Elsevier
Science B.V. All rights reserved.
|
297. | Elmoataz, A, Schupp, S, Clouard, R, Herlin, P, and Bloyet, D, "Using active contours and mathematical morphology tools for quantification of immunohistochemical images," SIGNAL PROCESSING, vol. 71, pp. 215-226, 1998.
Abstract:
An image segmentation method is proposed, which combines mathematical
morphology tools and active contours in two stages. First, contours are
coarsely approximated by means of morphological operators. Second,
these initial contours evolve under the influence of geometric and
grey-level information, owing to the model of active contours. The
performance of the method is evaluated according to the noise and is
compared to the watershed algorithm. Then an application is finally
presented for biomedical images of tumour tissue. (C) 1998 Elsevier
Science B.V. All rights reserved.
|
298. | Basu, S, Oliver, N, and Pentland, A, "3D lip shapes from video: A combined physical-statistical model," SPEECH COMMUNICATION, vol. 26, pp. 131-148, 1998.
Abstract:
Tracking human lips in video is an important but notoriously difficult
task. To accurately recover their motions in 3D from any head pose is
an even more challenging task, though still necessary for natural
interactions. Our approach is to build and train 3D models of lip
motion to make up for the information we cannot always observe when
tracking. We use physical models as a prior and combine them with
statistical models, showing how the two can be smoothly and naturally
integrated into a synthesis method and a MAP estimation framework for
tracking. We have found that this approach allows us to accurately and
robustly track and synthesize the 3D shape of the lips from arbitrary
head poses in a 2D video stream. We demonstrate this with numerical
results on reconstruction accuracy, examples of static fits, and
audio-visual sequences. (C) 1998 Elsevier Science B.V. All rights
reserved.
|
299. | Aboul-Ella, H, Karam, H, and Nakajima, M, "Image metamorphosis transformation of facial images based on elastic body splines," SIGNAL PROCESSING, vol. 70, pp. 129-137, 1998.
Abstract:
In this paper, we propose a new image metamorphosis algorithm which
uses elastic body splines to generate warp functions for interpolating
scattered data points. The spline is based on a partial differential
equation proposed by Navier that describes the equilibrium displacement
of an elastic body subjected to forces. The spline maps can be
expressed as the linear combination of an affine transformation and a
Navier spline. The proposed algorithm generates a smooth warp that
reflects feature point correspondences. It is efficient in time
complexity and smoothly interpolated morphed images with only a
remarkably small number of specified feature points. The algorithm
allows each feature point in the source image to be mapped to the
corresponding feature point in the destination image. Once the images
are warped to align the positions of features and their shapes, the
in-between facial animation from two given facial images can be defined
by cross dissolving the positions of correspondence features and their
shapes and colors. We describe an efficient cross-dissolve algorithm
for generating the in-between images. (C) 1998 Published by Elsevier
Science B.V. All rights reserved.
|
300. | Chen, CW, Luo, JB, and Parker, KJ, "Image segmentation via adaptive K-mean clustering and knowledge-based morphological operations with biomedical applications," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 7, pp. 1673-1683, 1998.
Abstract:
Image segmentation remains one of the major challenges in image
analysis, since image analysis tasks are often constrained by how web
previous segmentation is accomplished. In particular, many existing
image segmentation algorithms fail to provide satisfactory results when
the boundaries of the desired objects are not clearly defined by the
image-intensity information. In medical applications, skilled operators
are usually employed to extract the desired regions that may be
anatomically separate but statistically indistinguishable. Such manual
processing is subject to operator errors and biases, is extremely time
consuming, and has poor reproducibility. We propose a robust algorithm
for the segmentation of three-dimensional (3-D) image data based on a
novel combination of adaptive K-mean clustering and knowledge-based
morphological operations. The proposed adaptive K-mean clustering
algorithm is capable of segmenting the regions of smoothly varying
intensity distributions. Spatial constraints are incorporated in the
clustering algorithm through the modeling of the regions by Gibbs
random fields, Knowledge-based morphological operations are then
applied to the segmented regions to identify the desired regions
according to the a priori anatomical knowledge of the
region-of-interest. This proposed technique has been successfully
applied to a sequence of cardiac CT volumetric images to generate the
volumes of left ventricle chambers at 16 consecutive temporal frames.
Our final segmentation results compare favorably with the results
obtained using manual outlining. Extensions of this approach to other
applications can be readily made when a priori knowledge of a given
object is available.
|
301. | Tsap, LV, Goldgof, DB, Sarkar, S, and Powers, PS, "A vision-based technique for objective assessment of burn scars," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 17, pp. 620-633, 1998.
Abstract:
In this paper a method for the objective assessment of burn scars is
proposed. The quantitative measures developed in this research provide
an objective way to calculate elastic properties of burn scars relative
to the surrounding areas, The approach combines range data and the
mechanics and motion dynamics of human tissues. Active contours are
employed to locate regions of interest and to find displacements of
feature points using automatically established correspondences, Changes
in strain distribution over time are evaluated, Given images at two
time instances and their corresponding features, the finite element
method Is used to synthesize strain distributions of the underlying
tissues, This results in a physically based framework for motion and
strain analysis. Relative elasticity of the burn scar is then recovered
using iterative descent search for the best nonlinear finite element
model that approximates stretching behavior of the region containing
the burn scar, The results from the skin elasticity experiments
illustrate the ability to objectively detect differences in elasticity
between normal and abnormal tissue, These estimated differences in
elasticity are correlated against the subjective judgments of
physicians that are presently the practice.
|
302. | Niessen, WJ, Romeny, BMT, and Viergever, MA, "Geodesic deformable models for medical image analysis," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 17, pp. 634-641, 1998.
Abstract:
In this paper implicit representations of deformable models for medical
image enhancement and segmentation are considered. The advantage of
implicit models over classical explicit models is that their topology
can he naturally adapted to objects in the scene, A geodesic
formulation of implicit deformable models is especially attractive
since it has the energy minimizing properties of classical models, The
aim of this pager is twofold, First, a modification to the customary
geodesic deformable model approach is introduced by considering all the
level sets in the image as energy minimizing contours. This approach is
used to segment multiple objects simultaneously and for enhancing and
segmenting cardiac computed tomography (CT) and magnetic resonance
images. Second, the approach is used to effectively compare implicit
and explicit models for specific tasks. This shows the complementary
character of implicit models since in case of poor contrast boundaries
or gaps in boundaries e.g. due to partial volume effects, noise, or
motion artifacts, they do not perform well, since the approach is
completely data-driven.
|
303. | Marescaux, J, Clement, JM, Tassetti, V, Koehl, C, Cotin, S, Russier, Y, Mutter, D, Delingette, H, and Ayache, N, "Virtual reality applied to hepatic surgery simulation: The next revolution," ANNALS OF SURGERY, vol. 228, pp. 627-634, 1998.
Abstract:
Objective
This article describes a preliminary work on virtual reality applied to
liver surgery and discusses the repercussions of assisted surgical
strategy and surgical simulation on tomorrow's surgery.
Summary Background Data
Liver surgery is considered difficult because of the complexity and
variability of the organ. Common generic tools for presurgical medical
image visualization do not fulfill the requirements for the liver,
restricting comprehension of a patient's specific liver anatomy.
Methods
Using data from the National Library of Medicine, a realistic
three-dimensional image was created, including the envelope and the
four internal arborescences. A computer interface was developed to
manipulate the organ and to define surgical resection planes according
to internal anatomy. The first step of surgical simulation was
implemented, providing the organ with real-time deformation computation.
Results
The three-dimensional anatomy of the liver could be clearly visualized.
The virtual organ could be manipulated and a resection defined
depending on the anatomic relations between the arborescences, the
tumor, and the external envelope. The resulting parts could also be
visualized and manipulated. The simulation allowed the deformation of a
liver model in real time by means of a realistic laparoscopic tool.
Conclusions
Three-dimensional visualization of the organ in relation to the
pathology is of great help to appreciate the complex anatomy of the
liver. Using virtual reality concepts (navigation, interaction, and
immersion), surgical planning, training, and teaching for this complex
surgical procedure may be possible. The ability to practice a given
gesture repeatedly will revolutionize surgical training, and the
combination of surgical planning and simulation will improve the
efficiency of intervention, leading to optimal care delivery.
|
304. | Tang, CK, and Medioni, G, "Inference of integrated surface, curve, and junction descriptions from sparse 3D data," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 20, pp. 1206-1223, 1998.
Abstract:
We are interested in descriptions of 3D data sets, as obtained from
stereo or a 3D digitizer. We therefore consider as input a sparse set
of points, possibly associated with certain orientation information. In
this paper, we address the problem of inferring integrated high-level
descriptions such as surfaces, So curves, and junctions from a sparse
point set. While the method proposed by Guy and Medioni provides
excellent results for smooth structures, it only detects surface
orientation discontinuities but does not localize them. For precise
localization, we propose a noniterative cooperative algorithm in which
surfaces, curves, and junctions work together: Initial estimates are
computed based on the work by Guy and Medioni, where each point in the
given sparse and possibly noisy point set is convolved with a
predefined vector mask to produce dense saliency maps. These maps serve
as input to our novel extremal surface and curve algorithms for initial
surface and curve extraction. These initial features are refined and
integrated by using excitatory and inhibitory fields. Consequently,
intersecting surfaces (resp. curves) are fused precisely at their
intersection curves (resp. junctions). Results on several synthetic as
well as real data sets are presented.
|
305. | Whitaker, RT, "A level-set approach to 3D reconstruction from range data," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 29, pp. 203-231, 1998.
Abstract:
This paper presents a method that uses the level sets of volumes to
reconstruct the shapes of 3D objects from range data. The strategy is
to formulate 3D reconstruction as a statistical problem: find that
surface which is mostly likely, given the data and some prior knowledge
about the application domain. The resulting optimization problem is
solved by an incremental process of deformation. We represent a
deformable surface as the level set of a discretely sampled scalar
function of three dimensions, i.e., a volume. Such level-set models
have been shown to mimic conventional deformable surface models by
encoding surface movements as changes in the greyscale values of the
volume. The result is a voxel-based modeling technology that offers
several advantages over conventional parametric models, including
flexible topology, no need for reparameterization, concise descriptions
of differential structure, and a natural scale space for hierarchical
representations. This paper builds on previous work in both 3D
reconstruction and level-set modeling. It presents a fundamental result
in surface estimation from range data: an analytical characterization
of the surface that maximizes the posterior probability. It also
presents a novel computational technique for level-set modeling, called
the sparse-field algorithm, which combines the advantages of a
level-set approach with the computational efficiency and accuracy of a
parametric representation. The sparse-field algorithm is more efficient
than other approaches, and because it assigns the level set to a
specific set of grid points, it positions the level-set model more
accurately than the grid itself. These properties, computational
efficiency and subcell accuracy, are essential when trying to
reconstruct the shapes of 3D objects. Results are shown for the
reconstruction objects from sets of noisy and overlapping range maps.
|
306. | Ong, KC, Teh, HC, and Tan, TS, "Resolving occlusion in image sequence made easy," VISUAL COMPUTER, vol. 14, pp. 153-165, 1998.
Abstract:
While the task of seamlessly merging computer-generated 3D objects into
an image sequence can be done manually, such effort often lacks
consistency across the images. It is also time consuming and prone to
error. This paper proposes a framework that solves the occlusion
problem without assuming a priori computer models from the input scene.
It includes a new algorithm to derive approximate 3D models about the
real scene based on recovered geometry information and user-supplied
segmentation results. The framework has been implemented, and it works
for amateur home videos. The result is an easy-to-use system for
applications like the visualization of new architectures in a real
environment.
|
307. | Ivins, J, and Porrill, J, "Constrained active region models for fast tracking in color image sequences," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 72, pp. 54-71, 1998.
Abstract:
Image segmentation is a fundamental problem in computer vision, for
which deformable models offer a partial solution. Most deformable
models work by performing some kind of edge detection; complementary
region growing methods have not often been used. As a result,
deformable models that track regions rather than edges have yet to be
developed to a great extent. Active region models are a relatively new
type of deformable model driven by a region energy that is a function
of the statistical characteristics of an image. This paper describes
the use of constrained active region models for frame-rate tracking in
color video images on widely available computer hardware. Two of the
many color representations now in use are reviewed for this purpose:
the intensity-based RGB space and the more intuitive HSV space.
Normalized RGB, which is essentially a measure of hue and saturation,
emerges as the preferred representation because it is invariant to
illumination changes and can be obtained from many frame-grabbers via a
simple fast software transformation. Three types of motion are examined
for constraining deformable models: rigid models can only translate and
rotate to fit image features; conformal models can also change size;
affine models exhibit two kinds of shearing in addition to the other
components. Two methods are described for producing affine motion,
given the desired unconstrained motion calculated by searching for
local energy minima lying perpendicular to the model boundary. An
existing method, based on iterative gradient descent, computes
translating, rotating, scaling, and shearing forces which can be
combined to produce affine and other types of motion. A faster, more
accurate method uses least-squares minimization to approximate the
desired motion; with this method it is also possible to derive specific
equations for rigid and conformal motion and to correct for the
aperture problem associated with the perpendicular search method. The
advantages of the new least-squares method are illustrated by using it
to drive an active region model via an affine transformation which
tracks the movements of a robot arm at frame rate in color video
images, (C) 1998 Academic Press.
|
308. | Marescaux, J, Clementi, JM, Russier, Y, Tassetti, V, Mutter, D, Cotin, S, and Ayache, N, "A new concept in digestive surgery: the computer assisted surgical procedure, from virtual reality to telemanipulation.," ANNALES DE GASTROENTEROLOGIE ET D HEPATOLOGIE, vol. 34, pp. 126-131, 1998.
Abstract:
Surgical simulation increasingly appears to be an essential aspect of
tomorrow's surgery. The development of a hepatic surgery simulator is
an advanced concept calling for a new writing system which will
transform the medical world:virtual reality. Virtual reality extends
the perception of ourfive senses by representing more than the real
state of things by the means of computer sciences and robotics. it
consists of three concepts. immersion, navigation and interaction,
Three reasons have led us to develop this simulator: the first is to
provide the surgeon with a comprehensive visualisation of the organ.
The second reason is to allow for planning and surgical simulation that
could be compared with the detailed flight-plan for a commercial let
pilot. The third lies in the fact that virtual reality is an integrated
part of the concept of computer assisted surgical procedure. The
project consists bi a sophisticated simulator which has to includefive
requirements, visual fidelity, interactivity, physical properties,
physiological properties, sensory input and output. In this report we
will describe how to get a realistic 3D model of the liver from
bi-dimensional 2D medical images for anatomical and surgical training.
The introduction of a tumor and the consequent planning and virtual
resection is also described, as are force feedback and real-time
interaction.
|
309. | Bonciu, C, Leger, C, and Thiel, J, "A Fourier-Shannon approach to closed contours modelling," BIOIMAGING, vol. 6, pp. 111-125, 1998.
Abstract:
This paper describes a modelling method for continuous closed contours.
The initial input data set consists of two-dimensional (2-D) points,
which may be represented as a discrete function in a polar coordinate
system. The method uses the Shannon interpolation between these data
points to obtain the global continuous contour model. A minimal
description of the contour is obtained using the link between the
Shannon interpolation kernel and the Fourier series of polar
development (FSPD) for periodic functions. The Shannon interpolation
kernel allows the direct interpretation of the contour smoothness in
terms of both samples and Fourier frequency domains.
In order to deal with deformation point sources, often encountered in
active modelling techniques, a method of local deformation is proposed.
Each local deformation is performed in an angular sector centred on the
deformation point source. All the neighbouring characteristic samples
are displaced in order to minimize the oscillations of the newly
created model outside the deformation sector. This deformation
technique preserves the frequency characteristics of the contour,
regardless of the number and the intensity of deformation sources. In
this way, the technique induces a frequency modelling constraint, which
may be subsequently used in an active detection and modelling
environment.
Experiments on synthetic and real data prove the efficiency of the
proposed technique. The method is currently used to model contours of
the left ventricle of the heart obtained from ultrasound apical images.
This work is part of a larger project, the aim of which is to analyse
the space and time deformations of the left ventricle. The 2-D
Fourier-Shannon model is used as a basis for more complex
three-dimensional and four-dimensional Fourier models, able to recover
automatically the movement and deformation of the left ventricle of the
heart during a cardiac cycle.
|
310. | Wong, YY, Yuen, PC, and Tong, CS, "Segmented snake for contour detection," PATTERN RECOGNITION, vol. 31, pp. 1669-1679, 1998.
Abstract:
The active contour model, called snake, has been proved to be an
effective method in contour detection. This method has been
successfully employed in the areas of object recognition, computer
vision, computer graphics and biomedical images. However, this model
suffers from a great limitation, that is, it is difficult to locate
concave parts of an object. In view of such a limitation, a segmented
snake is designed and proposed in this paper. The basic idea of the
proposed method is to convert the global optimization of a closed snake
curve into local optimization on a number of open snake curves. The
segmented snake algorithm consists of two steps. In the first step, the
original snake model is adopted to locate the initial contour near the
object boundary. In the second step, a recursive split-and-merge
procedure is developed to determine the final object contour. The
proposed method is able to locate all convex, concave and high
curvature parts of an object accurately. A number of images are
selected to evaluate the capability of the proposed algorithm and the
results are encouraging. (C) 1998 Pattern Recognition Society.
Published by Elsevier Science Ltd. All rights reserved.
|
311. | Cunningham, GS, Hanson, KM, and Battle, XL, "Three-dimensional reconstructions from low-count SPECT data using deformable models," OPTICS EXPRESS, vol. 2, pp. 227-236, 1998.
Abstract:
We demonstrate the reconstruction of a 3D, time-varying bolus of
radiotracer from first-pass data obtained by the dynamic SPECT imager,
FASTSPECT, built by the University of Arizona. The object imaged is a
CardioWest Total Artificial Heart. The bolus is entirely contained in
one ventricle and its associated inlet and outlet tubes. The model for
the radiotracer distribution is a time-varying closed surface
parameterized by 162 vertices that are connected to make 960 triangles,
with uniform intensity of radiotracer inside. The total curvature of
the surface is minimized through the use of a weighted prior in the
Bayesian framework. MAP estimates for the vertices, interior intensity
and background count level are produced for diastolic and systolic
frames, the only two frames analyzed. The strength of the prior is
determined by finding the corner of the L-curve. The results indicate
that qualitatively pleasing results are possible even with as few as
1780 counts per time frame (total after summing over all 24 detectors).
Quantitative estimates of ejection fraction and wall motion should be
possible if certain restrictions in the model are removed, e.g., the
spatial homogeneity of the radiotracer intensity within the volume
defined by the triangulated surface, and smoothness of the surface at
the tube/ventricle join. (C) 1998 Optical Society of America.
|
312. | Ghanei, A, Soltanian-Zadeh, H, and Windham, JP, "A 3D deformable surface model for segmentation of objects from volumetric data in medical images," COMPUTERS IN BIOLOGY AND MEDICINE, vol. 28, pp. 239-253, 1998.
Abstract:
In this paper we present a new 3D discrete dynamic surface model. The
model consists of vertices and edges, which connect adjacent vertices.
Basic geometry of the model surface is generated by triangle patches.
The model deforms by internal and external forces. Internal forces are
obtained from local geometry of the model and are related to the local
curvature of the surface.;External forces, on the other hand, are based
on the image data and are calculated from desired image features. We
also present a method for generating an initial volume for the model
from a stack of initial contours, drawn by the user on cross sections
of the volumetric data. (C) 1998 Elsevier Science Ltd. All rights
reserved.
|
313. | Ghanei, A, Soltanian-Zadeh, H, and Windham, JP, "Segmentation of the hippocampus from brain MRI using deformable contours," COMPUTERIZED MEDICAL IMAGING AND GRAPHICS, vol. 22, pp. 203-216, 1998.
Abstract:
The application of a discrete dynamic contour model for segmentation of
the hippocampus from brain MRT has been investigated. Solutions to
several common problems of dynamic contours in this case and similar
cases have been developed. A new method for extracting the
discontinuous boundary of a structure with multiple edges near the
structure has been developed. The method is based on detecting and
following edges by external forces. The reliability of the final
contour and the model stability have been improved by using a
continuous mapping of the external energy and limiting movements of the
contour. The problem of optimizing the internal force weight has been
overcome by making it dependent on the amount of the external force.
Finally, the results of applying the proposed algorithm, which
implements the above modifications, to multiple applications have been
evaluated. (C) 1998 Elsevier Science Ltd. All rights reserved.
|
314. | Mortensen, EN, and Barrett, WA, "Interactive segmentation with intelligent scissors," GRAPHICAL MODELS AND IMAGE PROCESSING, vol. 60, pp. 349-384, 1998.
Abstract:
We present a new, interactive tool called Intelligent Scissors which we
use for image segmentation. Fully automated segmentation is an unsolved
problem, while manual tracing is inaccurate and laboriously
unacceptable. However, Intelligent Scissors allow objects within
digital images to be extracted quickly and accurately using simple
gesture motions with a mouse. When the gestured mouse position comes in
proximity to an object edge, a live-wire boundary "snaps" to, and wraps
around the object of interest. Live-wire boundary detection formulates
boundary detection as an optimal path search in a weighted graph.
Optimal graph searching provides mathematically piece-wise optimal
boundaries while greatly reducing sensitivity to local noise or other
intervening structures. Robustness is further enhanced with on-the-fly
training which causes the boundary to adhere to the specific type of
edge currently being followed, rather than simply the strongest edge in
the neighborhood. Boundary cooling automatically freezes unchanging
segments and automates input of additional seed points. Cooling also
allows the user to be much more free with the gesture path, thereby
increasing the efficiency and finesse with which boundaries can be
extracted. (C) 1998 Academic Press.
|
315. | Siddiqi, K, Lauziere, YB, Tannenbaum, A, and Zucker, SW, "Area and length minimizing flows for shape segmentation," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 7, pp. 433-443, 1998.
Abstract:
A number of active contour models have been proposed that unify the
curve evolution framework with classical energy minimization techniques
for segmentation, such as snakes, The essential idea is to evolve a
curve (in two dimensions) or a surface (in three dimensions) under
constraints from image forces so that it clings to features of interest
in an intensity image, Recently, the evolution equation has been
derived from first principles as the gradient dow that minimizes a
modified length functional, tailored to features such as edges,
However, because the how may be slow to converge in practice, a
constant (hyperbolic) term is added to keep the curve/surface moving in
the desired direction, In this paper, we derive a modification of this
term based on the gradient how derived from a weighted area functional,
with image dependent weighting factor, When combined with the earlier
modified Length gradient dow, we obtain a partial differential equation
(PDE) that offers a number of advantages, as illustrated by several
examples of shape segmentation on medical images. In many cases the
weighted area how may be used on its own, with significant
computational savings.
|
316. | Vilarino, DL, Brea, VM, Cabello, D, and Pardo, JM, "Discrete-time CNN for image segmentation by active contours," PATTERN RECOGNITION LETTERS, vol. 19, pp. 721-734, 1998.
Abstract:
In this work we present a new image segmentation strategy which
operates by means of active contours implemented on a multilayer
cellular neural network. The approach consists of an expanding and
thinning process, guided by external information from a contour which
evolves until it reaches the final desired position in the image
processed. (C) 1998 Elsevier Science B.V. All rights reserved.
|
317. | Klemencic, A, Kovacic, S, and Pernus, F, "Automated segmentation of muscle fiber images using active contour models," CYTOMETRY, vol. 32, pp. 317-326, 1998.
Abstract:
The cross-sectional area of different fiber types is an important
anatomic feature in studying the structure and function of healthy and
diseased human skeletal muscles. However, such studies are hampered by
the thousands of fibers involved when manual segmentation has to be
used. We have developed a semiautomatic segmentation method that uses
computational geometry and recent computer vision techniques to
significantly reduce the time required to accurately segment the fibers
in a sample. The segmentation is achieved by simply pointing to the
approximate centroid of each fiber. The set of centroids is then used
to automatically construct the Voronoi polygons, which correspond to
individual fibers. Each Voronoi polygon represents the initial shape of
one active contour model, called a snake. In the energy minimization
process, which is executed in several stages, different external forces
and problem-specific knowledge are used to guide the snakes to converge
to fiber boundaries. Our results indicate that this approach for
segmenting muscle fiber images is fast, accurate, and reproducible
compared with manual segmentation performed by experts. Cytometry
32:317-326, 1998. (C) 1998 Wiley-Liss, Inc.
|
318. | Basri, R, Costa, L, Geiger, D, and Jacobs, D, "Determining the similarity of deformable shapes," VISION RESEARCH, vol. 38, pp. 2365-2385, 1998.
Abstract:
Determining the similarity of two shapes is a significant task in both
machine and human vision systems that must recognize or classify
objects. The exact properties of human shape similarity judgements are
not well understood yet, and this task is particularly difficult in
domains where the shapes are not related by rigid transformations. In
this paper we identify a number of possibly desirable properties of a
shape similarity method, and determine the extent to which these
properties can be captured by approaches that compare local properties
of the contours of the shapes, through elastic matching. Special
attention is devoted to objects that possess articulations, i.e.
articulated parts. Elastic matching evaluates the similarity of two
shapes as the sum of local deformations needed to change one shape into
another. We show that similarities of part structure can be captured by
such an approach, without the explicit computation of part structure.
This may be of importance, since although parts appear to play a
significant role in visual recognition, it is difficult to stably
determine part structure. We also show novel results about how one can
evaluate smooth and polyhedral shapes with the same method. Finally, we
describe shape similarity effects that cannot be handled by current
approaches. (C) 1998 Elsevier Science Ltd. All rights reserved.
|
319. | Tao, C, Li, RX, and Chapman, MA, "Automatic reconstruction of road centerlines from mobile mapping image sequences," PHOTOGRAMMETRIC ENGINEERING AND REMOTE SENSING, vol. 64, pp. 709-716, 1998.
Abstract:
An automatic approach to road centerline reconstruction from stereo
image sequences acquired by a mobile mapping system is introduced. The
road centerline reconstruction is treated as an inverse problem and
solved by global optimization techniques. The centerlines are described
by a physical curve model, which is composed of an abstract material
and deforms according to external and internal forces applied. The
external forces, generated from the centerline information extracted
from the image sequences, controls the local characteristics of the
model. The internal forces, arising from a priori knowledge of the road
shape, contribute to the global shape of the model. Unique constraints
that exist only in mobile mapping image sequences are utilized. The
developed system has been used for processing a large number of mobile
mapping image sequences. Road centerlines of the images under different
conditions have been reconstructed successfully. The research results
also make a contribution to the general field of structure from motion
and stereo.
|
320. | Rougon, N, and Preteux, F, "Directional adaptive deformable models for segmentation," JOURNAL OF ELECTRONIC IMAGING, vol. 7, pp. 231-256, 1998.
Abstract:
We address the problem of adapting the functions controlling the
material properties of 2-D snakes, and show how introducing oriented
smoothness constraints results in a novel class of active contour
models for segmentation, which extends standard isotropic inhomogeneous
membrane/thin-plate stabilizers. These constraints, expressed as
adaptive L-2 matrix norms, are defined by two second-order symmetric
and positive definite tensors that are invariant with respect to rigid
motions in the image plane. These tensors, equivalent to directional
adaptive stretching and bending densities, are quadratic with respect
to first- and second-order derivatives of the image luminance,
respectively. A representation theorem specifying their canonical form
is established and a geometrical interpretation of their effects is
developed. Within this framework, it is shown that by achieving a
directional control of regularization such nonisotropic constraints
consistently relate the differential properties (metric and curvature)
of the deformable model with those of the underlying luminance surface,
yielding a satisfying preservation of image contour characteristics. In
particular, this model adapts to nonstationary curvature variations
along image contours to be segmented, thus providing a consistent
solution to curvature underestimation problems encountered near high
curvature contour points by classical snakes evolving with constant
material parameters. Optimization of the model within continuous and
discrete frameworks is discussed in detail. Finally, accuracy and
robustness of the model are established on synthetic images. Its
efficacy is further demonstrated on 2-D MRI sequences for which
comparisons with segmentations obtained using classical snakes are
provided. (C) 1998 SPIE and IS&T. [S1017-9909(98)02101-1].
|
321. | Gold, S, Rangarajan, A, Lu, CP, Pappu, S, and Mjolsness, E, "New algorithms for 2D and 3D point matching: Pose estimation and correspondence," PATTERN RECOGNITION, vol. 31, pp. 1019-1031, 1998.
Abstract:
A fundamental open problem in computer vision-determining pose and
correspondence between two sets of points in space-is solved with a
novel, fast, robust and easily implementable algorithm. The technique
works on noisy 2D or 3D point sets that may be of unequal sizes and may
differ by non-rigid transformations. Using a combination of
optimization techniques such as deterministic annealing and the
softassign, which have recently emerged out of the recurrent neural
network/statistical physics framework, analog objective functions
describing the problems are minimized. Over thirty thousand
experiments, on randomly generated points sets with varying amounts of
noise and missing and spurious points, and on hand-written character
sets demonstrate the robustness of the algorithm. (C) 1998 Pattern
Recognition Society. Published by Elsevier Science Ltd. All rights
reserved.
|
322. | Li, ZP, "A neural model of contour integration in the primary visual cortex," NEURAL COMPUTATION, vol. 10, pp. 903-940, 1998.
Abstract:
Experimental observations suggest that contour integration may take
place in V1. However, there has yet to be a model of contour
integration that uses only known V1 elements, operations, and
connection patterns. This article introduces such a model, using
orientation selective cells, local cortical circuits, and horizontal
intracortical connections. The model is composed of recurrently
connected excitatory neurons and inhibitory interneurons, receiving
visual input via oriented receptive fields resembling those found in
primary visual cortex. Intracortical interactions modify initial
activity patterns from input, selectively amplifying the activities of
edges that form smooth contours in the image. The neural activities
produced by such interactions are oscillatory and edge segments within
a contour oscillate in synchrony. It is shown analytically and
empirically that the extent of contour enhancement and neural synchrony
increases with the smoothness, length, and closure of contours, as
observed in experiments on some of these phenomena. In addition, the
model incorporates a feedback mechanism that allows higher visual
centers selectively to enhance or suppress sensitivities to given
contours, effectively segmenting one from another. The model makes the
testable prediction that the horizontal cortical connections are more
likely to target excitatory (or inhibitory) cells when the two linked
cells have their preferred orientation aligned with (or orthogonal to)
their relative receptive field center displacements.
|
323. | Glasbey, CA, and Mardia, KV, "A review of image-warping methods," JOURNAL OF APPLIED STATISTICS, vol. 25, pp. 155-171, 1998.
Abstract:
Image warping is a transformation which maps all positions in one image
plane to positions in a second plane. It arises in many image analysis
problems, whether in order to remove optical distortions introduced by
a camera or a particular viewing perspective, to register art image
with a map or template, or to align two or more images. The choice of
warp is a compromise between a smooth distortion and one which achieves
a good match. Smoothness can be ensured by assuming a parametric form
for the warp or by constraining it using differential equations.
Matching can be specified by points to be brought into alignment, by
local measures of correlation between images, or by the coincidence of
edges. Parametric and non-parametric approaches to warping, and
matching criteria, are reviewed.
|
324. | Gao, LM, Heath, DG, and Fishman, EK, "Abdominal image segmentation using three-dimensional deformable models," INVESTIGATIVE RADIOLOGY, vol. 33, pp. 348-355, 1998.
Abstract:
RATIONALE AND OBJECTIVES. The authors develop a three-dimensional (3-D)
deformable surface model-based segmentation scheme for abdominal
computed tomography (CT) image segmentation.
METHODS. A parameterized 3-D surface model was developed to represent
the human abdominal organs. An energy function defined on the direction
of the image gradient and the surface normal of the deformable model
was introduced to measure the match between the model and image data. A
conjugate gradient algorithm was adapted to the minimization of the
energy function.
RESULTS. Test results for synthetic images showed that the
incorporation of surface directional information improved the results
over those using only the magnitude of the image gradient. The
algorithm was tested on 21 CT datasets. Of the 21 cases tested, 11 were
evaluated visually by a radiologist and the results were judged to be
without noticeable error. The other 10 were evaluated over a distance
function. The average distance was less than 1 voxel.
CONCLUSIONS. The deformable model-based segmentation scheme produces
robust and acceptable outputs on abdominal CT images.
|
325. | Xu, CY, and Prince, JL, "Snakes, shapes, and gradient vector flow," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 7, pp. 359-369, 1998.
Abstract:
Snakes, or active contours, are used extensively in computer vision and
image processing applications, particularly to locate object
boundaries, problems associated with initialization and poor
convergence to boundary concavities, however, have limited their
utility, This paper presents a new external force for active contours,
largely solving both problems. This external forte, which we call
gradient vector flow (GVF), is computed as a diffusion of the gradient
vectors of a gray-level or binary edge map derived from the image. It
differs fundamentally from traditional snake external forces in that it
cannot be written as the negative gradient of a potential function, and
the corresponding snake is formulated directly from a force balance
condition rather than a variational formulation. Using several
two-dimensional (2-D) examples and one three-dimensional (3-D) example,
we show that GVF has a large capture range and is able to move snakes
into boundary concavities.
|
326. | Hager, GD, and Toyama, K, "X vision: A portable substrate for real-time vision applications," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 69, pp. 23-37, 1998.
Abstract:
In the past several years, the speed of standard processors has reached
the point where interesting problems requiring visual tracking can be
carried out on standard workstations. However, relatively little
attention has been devoted to developing visual tracking technology in
its own right. In this article, we describe X Vision, a modular,
portable framework for visual tracking. X Vision is designed to be a
programming environment for real-time vision which provides high
performance on standard workstations outfitted with a simple digitizer.
X Vision consists of a small set of image-level tracking primitives,
and a framework for combining tracking primitives to form complex
tracking systems. Efficiency and robustness are achieved by propagating
geometric and temporal constraints to the feature detection level,
where image warping and specialized image processing are combined to
perform feature detection quickly and robustly. Over the past several
years, we have used X Vision to construct several vision-based systems.
We present some of these applications as an illustration of how useful,
robust tracking systems can be constructed by simple combinations of a
few basic primitives combined with the appropriate task-specific
constraints. (C) 1998 Academic Press.
|
327. | Piccioni, M, Scarlatti, S, and Trouve, A, "A variational problem arising from speech recognition," SIAM JOURNAL ON APPLIED MATHEMATICS, vol. 58, pp. 753-771, 1998.
Abstract:
By following the general approach of deformable templates, the problem
of recognizing a single word, independently of the speaker, is shown to
lead to the computation of the minimum value of some particular
functional. More precisely, this allows us to recover, for each
possible word in a prespecified set, the best matching with the
recorded signal; by selecting the minimum value, the recognition
problem can be solved. In this paper we are concerned with the detailed
study of the variational problem associated with this sort of
functional, namely, the existence of a minimum point and the features
of such a minimum. Finally, we discuss the convergence of a discretized
finite-dimensional approximation, suggested by the engineering
literature on this subject.
|
328. | Park, JS, and Han, JH, "Contour matching: a curvature-based approach," IMAGE AND VISION COMPUTING, vol. 16, pp. 181-189, 1998.
Abstract:
The lack of information about tangential velocity makes velocity
estimation erroneous in contour matching. Classical methods use the
normal velocity, together with some smoothness constraints, since the
tangential velocity cannot be recovered. This paper presents a contour
matching method that computes displacements with a criteria of minimum
curvature differences. The first derivative of tangential velocity is
available from the image intensities and is related to the contour
curvature. We compute the velocities using the curvature as well as the
normal component. Consequently, the estimation error due to the
tangential component is reduced substantially. A contour having
occluding parts leads to mismatching. Our method determines occluding
parts before the contour matching by analyzing the change of curvature
distribution. Experimental results showed that the proposed method
computes accurate velocity vectors for various moving contours. (C)
1998 Elsevier Science B.V.
|
329. | Chandran, S, and Potty, AK, "Energy minimization of contours using boundary conditions," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 20, pp. 546-549, 1998.
Abstract:
Reconstruction of objects from a scene may be viewed as a data fitting
problem using energy minimizing splines as the basic shape. The process
of obtaining the minimum to construct the "best" shape can sometimes be
important. Some of the potential problems in the Euler-Lagrangian
variational solution proposed in the original formulation [1], were
brought to light in [2], and a dynamic programming (DP) method was also
suggested. In this paper we further develop the DP solution. We show
that in certain cases, the discrete form of the solution in [2], and
adopted subsequently [3], [4], [5], [6] may also produce local minima,
and develop a strategy to avoid this. We provide a stronger form of the
conditions necessary to derive a solution when the energy depends on
the second derivative, as in the case of "active contours.".
|
330. | Sakalli, M, and Yan, H, "Feature-based compression of human face images," OPTICAL ENGINEERING, vol. 37, pp. 1520-1529, 1998.
Abstract:
A method is developed for feature-based coding of human face images.
Deformable templates, wavelet decomposition, and residual vector
quantization (RVQ) form three consecutive stages of the proposed
method, which aims for recognition-based very low bit rate coding.
Deformable templates are employed in localization of facial features
and biorthogonal spline filters are used for the decomposition of
segmented and normalized face images. Wavelet coefficients are zonal
truncated before being vector quantized to generate multiresolution
codebooks. Classified multiresolution codebooks are also generated for
residual eye and mouth images to improve subjective quality of salient
face features. (C) 1998 Society of Photo-Optical Instrumentation
Engineers. [S0091-3286(98)02105-9].
|
331. | Lefebvre, F, Berger, G, and Laugier, P, "Automatic detection of the boundary of the calcaneus from ultrasound parametric images using an active contour model; Clinical assessment," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 17, pp. 45-52, 1998.
Abstract:
This paper presents a computerized method for automated detection of
the boundary of the os calcis on in vivo ultrasound parametric images,
using an active dynamic contour model. The initial contour, defined
without user interaction, is an iso-contour extracted from the textural
feature space. The contour is deformed through the action of internal
and external forces, until stability is reached. The external forces,
which characterize image features, are a combination of gray-level
information and second-order textural features arising from local
cooccurrence matrices. The broadband ultrasound attenuation (BUA) value
is then averaged within the contour obtained.
The method was applied to 381 clinical images. The contour was
correctly detected in the great majority of the cases, For the
short-term reproducibility study, the mean coefficient of variation was
equal to 1.81% for BUA values and 4.95% for areas in the detected
region. Women with osteoporosis had a lower BUA than age-matched
controls (p = 0.0005). In healthy women, the age-related decline was
-0.45 dB/MHz/yr. In the group of healthy post-menopausal women, years
since menopause, weight and age were significant predictors of BUA,
These results are comparable to those obtained when averaging BUA
values in a small region of interest.
|
332. | Atkins, MS, and Mackiewich, BT, "Fully automatic segmentation of the brain in MRI," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 17, pp. 98-107, 1998.
Abstract:
A robust fully automatic method for segmenting the brain from head
magnetic resonance (MR) images has been developed, which works even in
the presence of radio frequency (RF) inhomogeneities. It has been
successful in segmenting the brain in every slice from head images
acquired from several different MRI scanners, using
different-resolution images and different echo sequences.
The method uses an integrated approach which employs image processing
techniques based on anisotropic filters and "snakes" contouring
techniques, and a priori knowledge, which is used to remove the eyes,
which are tricky to remove based on image intensity alone, It is a
multistage process, involving first removal of the background noise
leaving a head mask, then finding a rough outline of the brain, then
refinement of the rough brain outline to a final mask.
The paper describes the main features of the method, and gives results
for some brain studies.
|
333. | Tong, AWK, Qureshi, R, Li, X, and Sather, AP, "A system for ultrasound image segmentation for loin eye measurements in swine," CANADIAN AGRICULTURAL ENGINEERING, vol. 40, pp. 47-53, 1998.
Abstract:
An image segmentation system was developed for detecting the muscle
longissimus thoraces (LT) in ultrasonic images of live pigs. The images
have a low contrast, a high level of noise, and a high degree of
variance in terms of texture and shape. The segmentation algorithm
starts with a region growing process, which provides a rough
approximation of the LT. Morphological operations and curve fitting
eliminate unwanted noise. Finally, an active contour process refines
the shape of the resulting region. This system takes several
segmentation techniques and builds a flow of information between them
but does not rely on specific a priori information of the texture or
the contrast. This is a first step towards automating the loin
detection in ultrasonic images of live pigs. initial experiments
provided encouraging results. It is a modular system so that different
region growing and refinement algorithms can be easily substituted into
the current design. This makes for a general system that can be adapted
to other segmentation tasks involving low contrast images. A series of
three ultrasound images was made along the dorsal surface of 30 live
pigs. Using the images to estimate loin volume, 64 and 70% of the
variation in commercial loin weight and lean yield of loin were
predicted. Augmenting the model with backfat measurements, the R-2
increased to 79 and 89%, respectively. These values compare to 76 and
79%, respectively, from measurements made on the carcass with the
Hennessey Grading Probe.
|
334. | Thalmann, NM, Kalra, P, and Escher, M, "Face to virtual face," PROCEEDINGS OF THE IEEE, vol. 86, pp. 870-883, 1998.
Abstract:
The first virtual humans appeared in the early 1980's in such films as
Dreamflight (1982) and The Juggler (1982). Pioneering work in the
ensuing period focused on realistic appearance in the simulation of
virtual humans. In the 1990's, the emphasis has shifted to real-time
animation and interaction in virtual worlds. Virtual humans halle begun
to inhabit virtual worlds and so have we. To prepare our place in the
virtual world, we first develop techniques for the automatic
representation of a human face capable of being animated in real time
using both video and audio input. The objective is for one's
representative to look, talk, and behave like oneself in the virtual
world. Furthermore, the virtual inhabitants of this world should be
able to see our avatars and to react to what we say and to the emotions
we convey.
This paper sketches an overview of the problems related to the analysis
and synthesis of face-to-virtual-face communication in a virtual world.
We describe different components of our system for real-time
interaction and communication between a cloned face representing a real
person and an autonomous virtual face. It provides an insight into the
various problems and gives particular solutions adopted in
reconstructing a virtual clone capable of reproducing the shape and
movements of the real person's face. It includes the analysis of the
facial expression and speech of the cloned face, which can be used to
elicit a response from the autonomous virtual human with both verbal
and nonverbal facial movements synchronized with the audio voice.
We believe that such a system can be exploited in many applications
such as natural and intelligent human-machine interfaces, virtual
collaboration work, virtual learning and teaching, and so on.
|
335. | Memin, E, and Perez, P, "Dense estimation and object-based segmentation of the optical flow with robust techniques," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 7, pp. 703-719, 1998.
Abstract:
In this paper, we address the issue of recovering and segmenting the
apparent velocity field in sequences of images. As for motion
estimation, we minimize an objective function involving two robust
terms. The first one cautiously captures the optical flow constraint,
while the second (a priori) term incorporates a
discontinuity-preserving smoothness constraint. To cope with the
nonconvex minimization problem thus defined, we design an efficient
deterministic multigrid procedure. It converges fast toward estimates
of good quality, while revealing the large discontinuity structures of
flow fields. We then propose an extension of the model by attaching to
it a flexible object-based segmentation device based on deformable
closed curves (different families of curve equipped with different
kinds of prior can be easily supported). Experimental results on
synthetic and natural sequences are presented, including an analysis of
sensitivity to parameter tuning.
|
336. | Steiner, A, Kimmel, R, and Bruckstein, AM, "Planar shape enhancement and exaggeration," GRAPHICAL MODELS AND IMAGE PROCESSING, vol. 60, pp. 112-124, 1998.
Abstract:
A local smoothing operator applied in the reverse direction is used to
obtain planar shape enhancement and exaggeration. Inversion of a
smoothing operator is an inherently unstable operation. Therefore, a
stable numerical scheme simulating the inverse smoothing effect is
introduced. Enhancement is obtained for short time spans of evolution.
Carrying the evolution further yields shape exaggeration or
caricaturization effect. Introducing attraction forces between the
evolving shape and the initial one yields an enhancement process that
converges to a steady state. These forces depend on the distance of the
evolving curve from the original one and on local properties. Results
of applying the unrestrained and restrained evolution on planar shapes,
based on a stabilized inverse geometric heat equation, are presented
showing enhancement and caricaturization effects. (C) 1998 Academic
Press.
|
337. | Tsap, LV, Goldgof, DB, Sarkar, S, and Huang, WC, "Efficient nonlinear finite element modeling of nonrigid objects via optimization of mesh models," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 69, pp. 330-350, 1998.
Abstract:
In this paper we propose a new general framework for the application of
the nonlinear finite element method (FEM) to nonrigid motion analysis,
We construct the models by integrating image data and prior knowledge,
using well-established techniques from computer vision, structural
mechanics, and computer-aided design (CAD). These techniques guide the
process of optimization of mesh models.
Linear FEM proved to be a successful physically based modeling tool in
solving limited types of nonrigid motion problems, However, linear FEM
cannot handle nonlinear materials or large deformations. Application of
nonlinear FEM to nonrigid motion analysis has been restricted by
difficulties with high computational complexity and noise sensitivity.
We tackle the problems associated with nonlinear FEM by changing the
parametric description of the object to allow easy automatic control of
the model, using physically motivated analysis of the possible
displacements to address the worst effects of the noise, applying mesh
control strategies, and utilizing multiscale methods. The combination
of these methods represents a new systematic approach to a class of
nonrigid motion applications for which sufficiently precise and
flexible FEM models can be built,
The results from the skin elasticity experiments demonstrate the
success of the proposed method. The model allows us to objectively
detect the differences in elasticity between normal and abnormal skin,
Our work, demonstrates the possibility of accurate computation of point
correspondences and force recovery from range image sequences
containing nonrigid objects and large motion. (C) 1998 Academic Press.
|
338. | Wong, YY, Yuen, PC, and Tong, CS, "Contour length terminating criterion for snake model," PATTERN RECOGNITION, vol. 31, pp. 597-606, 1998.
Abstract:
The snake model, that involves a recursive scheme for contour
searching, is widely employed in object contour detection. In a
recursive algorithm, a terminating criterion is essential to terminate
the process. However, existing terminating criteria for snake cannot
acquire good results for contour detection. Two commonly employed
terminating criteria for snake are addressed and their limitations on
stability and reliability are discussed. A novel terminating criterion,
named as contour length criterion (CL-criterion), is developed and
reported in this paper. This criterion measures the normalized total
length of the contour at each iteration. A number of images are
selected to evaluate the effect of applying the proposed terminating
criterion on the snake model and the results are encouraging. Compared
to existing criteria, the proposed method is more stable and reliable.
(C) 1998 Pattern Recognition Society. Published by Elsevier Science
Ltd. All rights reserved.
|
|
|
1999 |
339. | Hassanien, AE, and Nakajima, M, "Feature-specification algorithm based on snake model for facial image morphing," IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, vol. E82D, pp. 439-446, 1999.
Abstract:
In this paper a new snake model for image morphing with semiautomated
delineation which depends on Hermite's interpolation theory, is
presented. The snake model will be used to specify the correspondence
between features in two given images. It allows a user to extract a
contour that defines a facial feature such as the lips, mouth, and
profile, by only specifying the endpoints of the contour around the
feature which we wish to define. We assume that the user can specify
the endpoints of a curve around the features that serve as the
extremities of a contour. The proposed method automatically computes
the image information around these endpoints which provides the
boundary conditions. Then the contour is optimized by taking this
information into account near its extremities. During the iterative
optimization process, the image forces are turned on progressively from
the contour extremities toward the center to define the exact position
of the feature. The proposed algorithm helps the user to easily define
the exact position of a feature. It may also reduce the time required
to establish the features of an image.
|
340. | Peterfreund, N, "The velocity snake: Deformable contour for tracking in spatio-velocity space," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 73, pp. 346-356, 1999.
Abstract:
We present a new active contour model for boundary tracking and
position prediction of nonrigid objects, which results from applying a
velocity control to the class of elastodynamical contour models, known
as snakes, The proposed control term minimizes an energy dissipation
function which measures the difference between the contour velocity and
the apparent velocity of the image. Treating the image video-sequence
as continuous measurements along time, it is shown that the proposed
control results in robust tracking. This is in contrast to the original
snake model which is proven to have tracking errors relative to image
(object) velocity, thus resulting in high sensitivity to image clutter.
The motion estimation further allows for position prediction of
nonrigid boundaries. Based on the proposed central approach, we propose
a new class of real time tracking contours, varying from models with
batch-mode control estimation to models with real time adaptive
controllers. (C) 1999 Academic Press.
|
341. | Astrom, K, and Kahl, F, "Motion estimation in image sequences using the deformation of apparent contours," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 21, pp. 114-127, 1999.
Abstract:
The problem of determining the camera motion from apparent contours or
silhouettes of a priori unknown curved three-dimensional surfaces is
considered. In a sequence of images, it is shown how to use the
generalized epipolar constraint an apparent contours. One such
constraint is obtained for each epipolar tangency point in each image
pair. An accurate algorithm for computing the motion is presented based
on a maximum likelihood estimate. It is shown how to generate initial
estimates on the camera motion using only the tracked contours. It is
also shown that in theory the motion can be calculated from the
deformation of a single contour. The algorithm has been tested on
several real image sequences, for both Euclidean and protective
reconstruction. The resulting motion estimate is compared to motion
estimates calculated independently using standard feature-based
methods. The motion estimate is also used to classify the silhouettes
as curves or apparent contours. This is a strong indication that the
motion estimate is of good quality. The statistical evaluation shows
that the technique gives accurate and stable results.
|
342. | Gabrani, M, and Tretiak, OJ, "Surface-based matching using elastic transformations," PATTERN RECOGNITION, vol. 32, pp. 87-97, 1999.
Abstract:
We introduce a methodology for the alignment of multidimensional data,
such as brain scans. The proposed approach does not require
fiducial-point correspondence; correspondence of surfaces provides
sufficient data for registration. We extend multidimensional
interpolation theory by using a more general form of energy functional,
which leads to basis functions that have different orders at zero and
infinity. This allows flexibility in the design of the interpolation
solution. The problem is transformed into a linear algebra problem. Two
techniques for better conditioning of the system matrix are described.
Experimental results on two- and three-dimensional alignment of brain
data used in neurochemistry research are shown. (C) 1999 Pattern
Recognition Society. Published by Elsevier Science Ltd. All rights
reserved.
|
343. | Denney, TS, "Estimation and detection of myocardial tags in MR image without user-defined myocardial contours," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 18, pp. 330-344, 1999.
Abstract:
Magnetic resonance (MR) tagging has been Shown to, be a useful
technique for noninvasively measuring the deformation of an in vivo
heart. An important step in analyzing tagged images is the
identification of tag lines in each image of a cine sequence. Most
existing tag identification algorithms require user defined myocardial
contours. Contour identification, however, is time consuming and
requires a considerable amount of user intervention. In this paper, a
new method for identifying tag lines, which me call the ML/MAP method,
is presented that does not require user defined myocardial contours.
The ML/MAP method is composed of three stages. First, a set of
candidate tag line centers is estimated across the entire
region-of-interest (ROI) with a snake algorithm based on a
maximum-likelihood (ML) estimate of the tag center. Next, a maximum a
posteriori (MAP) hypothesis test is used to detect the candidate tag
centers that are actually part of a tag line. Finally, a pruning
algorithm is used to remove any detected tag line centers that do not
meet a spatio-temporal continuity criterion. The ML/MAP method is
demonstrated on data from ten in vivo human hearts.
|
344. | Gu, YH, and Tjahjadi, T, "Efficient planar object tracking and parameter estimation using compactly represented cubic B-Spline curves," IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, vol. 29, pp. 358-367, 1999.
Abstract:
In this paper, we consider the problem of matching tno-dimensional
(2-D) planar object curves from a database, and tracking moving object
curves through an image sequence, The first part of the paper describes
a curve data compression method using B-spline curve approximation. We
present a new constrained active B-spline curie model based on the
minimum mean square error (MMSE) criterion, and an iterative algorithm
for selecting the "best" segment border points for each B-spline curve,
The second part of the paper describes a method for simultaneous object
tracking and affine parameter estimation using the approximate curves
and profiles, We propose a novel B-spline point assignment algorithm
which incorporates the significant corners for interpolating
corresponding paints on the two curves to be compared. A gradient-based
algorithm is presented for simultaneously tracking object curl es, and
estimating the associated translation, rotation and scaling parameters.
The performance of each proposed method is evaluated using still images
and image sequences containing simple objects.
|
345. | Kang, DJ, "A fast and stable snake algorithm for medical images," PATTERN RECOGNITION LETTERS, vol. 20, pp. 507-512, 1999.
Abstract:
A discrete dynamic model for defining and tracking contours in 2-D
medical images is presented. An active contour in this objective is
optimized by a dynamic programming algorithm, for which a new
constraint that has fast and stable properties is introduced. The
internal energy of the model depends on local behavior of the contour,
while the external energy is derived from image features. The algorithm
is able to rapidly detect convex and concave objects even when the
image quality is poor. (C) 1999 Elsevier Science B.V. All rights
reserved.
|
346. | Zhu, Y, Chen, JX, Xiao, S, and Mac Mahon, EB, "3D knee modeling and biomechanical simulation," COMPUTING IN SCIENCE & ENGINEERING, vol. 1, pp. 82-87, 1999.
Abstract:
This paper considers the problem of generating various calligraphy from
some sample fonts. Our method is based on the deformable contour model
g-snake. By representing the outline of each stroke of a character with
a g-snake, we cast the generation problem into global and local
deformation of g-snake under different control parameters, where the
local deformation obeys the energy minimization principle of
regularization technique. The base values of the control parameters are
learned from given sample fonts. The experimental results on alphabet
and Japanese characters Hiragana show such processing as a reasonable
method for generating calligraphy.
|
347. | Wang, LS, He, LF, Nakamura, T, Mutoh, A, and Itoh, H, "Calligraphy generation using deformable contours," IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, vol. E82D, pp. 1066-1073, 1999.
Abstract:
This paper considers the problem of generating various calligraphy from
some sample fonts. Our method is based on the deformable contour model
g-snake. By representing the outline of each stroke of a character with
a g-snake, we cast the generation problem into global and local
deformation of g-snake under different control parameters, where the
local deformation obeys the energy minimization principle of
regularization technique. The base values of the control parameters are
learned from given sample fonts. The experimental results on alphabet
and Japanese characters Hiragana show such processing as a reasonable
method for generating calligraphy.
|
348. | Hu, JM, Yan, H, and Sakalli, M, "Locating head and face boundaries for head-shoulder images," PATTERN RECOGNITION, vol. 32, pp. 1317-1333, 1999.
Abstract:
This paper presents a model-based approach to locate head and face
boundaries in a head-shoulder image with plain background. Three models
are constructed for the images, where the head boundary is divided into
left/right sub-boundaries and the face boundary is divided into
left/right and top/bottom sub-boundaries. The left/right head
boundaries are located from two thresholded images and the final result
is the combination of them. After the head boundary is located, the
four face sub-boundaries are located from the grey edge image. The
algorithm is carried out iteratively by detecting low-level edges and
then organizing/verifying them using high-level knowledge of the
general shape of a head. The experimental results using a database of
300 images show that this approach is promising. (C) 1999 Pattern
Recognition Society. Published by Elsevier Science Ltd. All rights
reserved.
|
349. | Baumgartner, A, Steger, C, Mayer, H, Eckstein, W, and Ebner, H, "Automatic road extraction based on multi-scale, grouping, and context," PHOTOGRAMMETRIC ENGINEERING AND REMOTE SENSING, vol. 65, pp. 777-785, 1999.
Abstract:
An approach for the automatic extraction of roads from digital aerial
imagery is proposed. It makes use of several versions of the same
aerial image with different resolutions. Roads are modeled as a network
of intersections and links between these intersections, and are found
by a grouping process. The context of roads is hierarchically
structured into a global and a local level. The automatic segmentation
of the aerial image into different global contexts, i.e., rural,
forest, and urban area, is used to focus the extraction to the most
promising regions. For the actual extraction of the roads, edges are
extracted in the original high resolution image (0.2 to 0.5 m) and
lines are extracted in an image of reduced resolution. Using both
resolution levels and explicit knowledge about roads, hypotheses for
road segments are generated. They are grouped iteratively into larger
segments. in addition to the grouping algorithms, knowledge about the
local context, e.g., shadows cast by a tree onto a road segment, is
used to bridge gaps. To construct the road network, finally
intersections are extracted. Examples and results of an evaluation
based on manually plotted reference data are given, indicating the
potential of the approach.
|
350. | Kang, DJ, "Stable snake algorithm for convex tracking of MRI sequences," ELECTRONICS LETTERS, vol. 35, pp. 1070-1071, 1999.
Abstract:
A snake model for convex tracking contours in 2D medical images is
presented. By modelling the local behaviour of the contour, a new
constraint that has fast and stable properties is obtained with
optimisation by a dynamic programming algorithm.
|
351. | Mardia, KV, Walder, AN, Berry, E, Sharples, D, Millner, PA, and Dickson, RA, "Assessing spinal shape," JOURNAL OF APPLIED STATISTICS, vol. 26, pp. 735-745, 1999.
Abstract:
Idiopathic scoliosis is the most common spinal deformity, affecting
perhaps as many as 5% of children. Early recognition of the condition
is essential for optimal treatment. A widely used technique for
identification is based on a somewhat crude angle measurement from a
frontal spinal X-ray. Here, we provide a technique and new summary
statistical measures for classifying spinal shape, and present results
obtained from clinical X-rays.
|
352. | Sinthanayothin, C, Boyce, JF, Cook, HL, and Williamson, TH, "Automated localisation of the optic disc, fovea, and retinal blood vessels from digital colour fundus images," BRITISH JOURNAL OF OPHTHALMOLOGY, vol. 83, pp. 902-910, 1999.
Abstract:
Aim-To recognise automatically the main components of the fundus on
digital colour images.
Methods-The main features of a fundus retinal image were defined as the
optic disc, fovea, and blood vessels. Methods are described for their
automatic recognition and location. 112 retinal images were
preprocessed via adaptive, local, contrast enhancement. The optic discs
were located by identifying the area with the highest variation in
intensity of adjacent pixels. Blood vessels were identified by means of
a multilayer perceptron neural net, for which the inputs were derived
from a principal component analysis (PCA) of the image and edge
detection of the first component of PCA. The foveas were identified
using matching correlation together with characteristics typical of a
fovea-for example, darkest area in the neighbourhood of the optic disc.
The main components of the image were identified by an experienced
ophthalmologist for comparison with computerised methods.
Results-The sensitivity and specificity of the recognition of each
retinal main component was as follows: 99.1% and 99.1% for the optic
disc; 83.3% and 91.0% for blood vessels; 80.4% and 99.1% for the fovea.
Conclusions-In this study the optic disc, blood vessels, and fovea were
accurately detected. The identification of the normal components of the
retinal image will aid the future detection of diseases in these
regions. In diabetic retinopathy, for example, an image could be
analysed for retinopathy with reference to sight threatening
complications such as disc neovascularisation, vascular changes, or
foveal exudation.
|
353. | Zhao, BS, Reeves, AP, Yankelevitz, DF, and Henschke, CI, "Three-dimensional multicriterion automatic segmentation of pulmonary nodules of helical computed tomography images," OPTICAL ENGINEERING, vol. 38, pp. 1340-1347, 1999.
Abstract:
A 3-D multicriterion automatic segmentation algorithm is developed to
improve accuracy of delineation of pulmonary nodules on helical
computed tomography (CT) images by removing their adjacent structures.
The algorithm applies multiple gray-value thresholds to a nodule region
of interest (ROI). At each threshold level, the nodule candidate in the
ROI is automatically detected by labeling 3-D connected components,
followed by a 3-D morphologic opening operation. Once the nodule
candidate is found, its two specific parameters, gradient strength of
the nodule surface and a 3-D shape compactness factor, can be computed.
The optimal threshold can be determined by analyzing these parameters.
Our experiments with in vivo nodules demonstrate the feasibility of
employing this algorithm to improve the accuracy of nodule delineation,
especially for small nodules less than 1 cm in diameter. This discloses
the potential of the algorithm for accurate characterizations of
nodules (e.g., volume, change in volume over time) at an early stage,
which can help to provide valuable guidance for further clinical
management. (C) 1999 Society of Photo-Optical Instrumentation Engineers.
|
354. | Stammberger, T, Eckstein, F, Michaelis, M, Englmeier, KH, and Reiser, M, "Interobserver reproducibility of quantitative cartilage measurements: Comparison of B-spline snakes and manual segmentation," MAGNETIC RESONANCE IMAGING, vol. 17, pp. 1033-1042, 1999.
Abstract:
The objective of this work was to develop a segmentation technique for
thickness measurements of the articular cartilage in MR images and to
assess the interobserver reproducibility of the method in comparison
with manual segmentation. The algorithm is based on a B-spline snakes
approach and is able to delineate the cartilage boundaries in real time
and with minimal user interaction. The interobserver reproducibility of
the method, ranging from 3.3 to 13.6% for various section orientations
and joint surfaces, proved to be significantly superior to manual
segmentation. (C) 1999 Elsevier Science Inc.
|
355. | Shyu, CR, Brodley, CE, Kak, AC, Kosaka, A, Aisen, AM, and Broderick, LS, "ASSERT: A physician-in-the-loop content-based retrieval system for HRCT image databases," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 75, pp. 111-132, 1999.
Abstract:
It is now recognized in many domains that content-based image retrieval
from a database of images cannot be carried out by using completely
automated approaches. One such domain is medical radiology for which
the clinically useful information in an image typically consists of
gray level variations in highly localized regions of the image.
Currently, it is not possible to extract these regions by automatic
image segmentation techniques. To address this problem, we have
implemented a human-in-the-loop (a physician-in-the-loop, more
specifically) approach in which the human delineates the pathology
bearing regions (PBR) and a set of anatomical landmarks in the image
when the image is entered into the database. To the regions thus
marked, our approach applies low-level computer vision and image
processing algorithms to extract attributes related to the variations
in gray scale, texture, shape, etc. In addition, the system records
attributes that capture relational information such as the position of
a PER with respect to certain anatomical landmarks. An overall
multidimensional index is assigned to each image based on these
attribute values. (C) 1999 Academic Press.
|
356. | Koss, JE, Newman, FD, Johnson, TK, and Kirch, DL, "Abdominal organ segmentation using texture transforms and a Hopfield neural network," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 18, pp. 640-648, 1999.
Abstract:
Abdominal organ segmentation is highly desirable but difficult, due to
large differences between patients and to overlapping grey-scale values
of the various tissue types. The first step in automating this process
is to cluster together the pixels within each organ or tissue type. We
propose to Form images based on second-order statistical texture
transforms (Haralick transforms) of a CT or MRI scan. The original scan
plus the suite of texture transforms are then input into a Hopfield
neural network (HNN). The network is constructed to solve an
optimization problem, where the best solution is the minima of a
Lyapunov energy function. On a sample abdominal CT scan, this process
successfully clustered 79-100% of the pixels of seven abdominal organs.
It is envisioned that this Is the first step to automate segmentation.
Active contouring (e.g., SNAKE's) or a back-propagation neural network
can then be used to assign names to the clusters and fill in the
incorrectly clustered pixels.
|
357. | Chang, MW, Lin, E, and Hwang, JN, "Contour tracking using a knowledge-based snake algorithm to construct three-dimensional pharyngeal bolus movement," DYSPHAGIA, vol. 14, pp. 219-227, 1999.
Abstract:
Videofluorography (VFG) using a barium-mixed bolus is in wide clinical
use for assessing patients with swallowing disorders. VFG is usually
done with both lateral (LA) and anterior-posterior (AP) views, most
commonly in two separate sittings. A real-time, three-dimensional (3-D)
representation of the evolution of a pharyngeal bolus and its
volumetric information can potentially help clinicians analyze and
visualize the kinematics of swallowing, dysphagia, and compensatory
therapeutic strategies. Active contour models, also known as "Snakes,"
have been used to solve various image analysis and computer vision
problems. We applied a Snake algorithm to automate in part the contour
tracking and reconstruction of VFG images to visualize and
quantitatively analyze the 3-D evolution of a pharyngeal bolus. To
improve the accuracy of the Snake search, we provided the additional
"knowledge" of the pharyngeal image itself, which served as an extra
constraint to push the Snake curve toward the desired contour. VFG of
pharyngeal bolus transport in a normal subject was recorded by using
barium-mixed boluses (viscosity: 185 centipoise, density: 2.84 g/cc)
with volumes of 5, 10, and 20 ml, The resulting LA and AP video images
were digitally captured and matched frame by frame. The knowledge-based
Snake search algorithm was used to generate Snake points to satisfy
both internal (i.e., smoothness) and external (i.e., boundary fitting)
constraints. Using these Snake points, we traced the 3-D bolus movement
at each time instant, assuming elliptic geometry in the cross-section
of the pharyngeal bolus. By concatenating the 3-D images for each time
instant, we developed a 3-D movie representing pharyngeal bolus
movement. The efficiency, reproducibility, and accuracy of this
algorithm in tracing pharyngeal bolus boundaries and estimating
front/tail velocities were assessed and found satisfactory. We conclude
that 3-D pharyngeal bolus movement can be traced both accurately and
efficiently by using a knowledge-based Snake search algorithm.
|
358. | Kobbelt, LP, Vorsatz, J, Labsik, U, and Seidel, HP, "A shrink wrapping approach to remeshing polygonal surfaces," COMPUTER GRAPHICS FORUM, vol. 18, pp. C119-+, 1999.
Abstract:
Due to their simplicity and flexibility, polygonal meshes are about to
become the standard representation for surface geometry in computer
graphics applications. Some algorithms in the context of
multiresolution representation and modeling can be performed much more
efficiently and robustly if the underlying surface tesselations have
the special subdivision connectivity In this paper we propose a new
algorithm for converting a given unstructured triangle mesh into one
having subdivision connectivity. The basic idea is to simulate the
shrink wrapping process by adapting the deformable surface technique
known from image processing. The resulting algorithm generates
subdivision connectivity meshes whose base meshes only have a very
small number of triangles. The iterative optimization process that
distributes the mesh vertices over the given surface geometry
guarantees low local distortion of the triangular faces. We show
several examples and applications including the progressive
transmission of subdivision surfaces.
|
359. | Bhandarkar, SM, and Zeng, X, "Evolutionary approaches to figure-ground separation," APPLIED INTELLIGENCE, vol. 11, pp. 187-212, 1999.
Abstract:
The problem of figure-ground separation is tackled from the perspective
of combinatorial optimization. Previous attempts have used
deterministic optimization techniques based on relaxation and gradient
descent-based search, and stochastic optimization techniques based on
simulated annealing and microcanonical annealing. A mathematical model
encapsulating the figure-ground separation problem that makes explicit
the definition of shape in terms of attributes such as cocircularity,
smoothness, proximity and contrast is described. The model is based on
the formulation of an energy function that incorporates pairwise
interactions between local image features in the form of edgels and is
shown to be isomorphic to the interacting spin (Ising) system from
quantum physics. This paper explores a class of stochastic optimization
techniques based on evolutionary algorithms for the problem of
figure-ground separation. A class of hybrid evolutionary stochastic
optimization algorithms based on a combination of evolutionary
algorithms, simulated annealing and microcanonical annealing are shown
to exhibit superior performance when compared to their purely
evolutionary counterparts and to classical simulated annealing and
microcanonical annealing algorithms. Experimental results on synthetic
edgel maps and edgel maps derived from gray scale images are presented.
|
360. | Ngoi, KP, and Jia, JC, "An active contour model for colour region extraction in natural scenes," IMAGE AND VISION COMPUTING, vol. 17, pp. 955-966, 1999.
Abstract:
The performance of active contours depends on the proper selection of
model parameters and initial contours. In natural scenes, active
contours often fail to converge to the desired solution because of
unconstrained environmental conditions and complex object shapes. This
paper presents a new active contour model for contour extraction in
natural scenes. The proposed model is able to extract fairly complex
object boundaries without the need to retune model parameters and image
thresholds. Specific object features and a priori knowledge of the
objects' topology are not required. Four schemes are proposed. An
attraction/repulsion scheme deforms the active contour towards the
object's boundary and makes it less sensitive to initialisation. A
positive/negative contour scheme allows closed active contours to
change their connectivity by splitting, thereby undergoing topological
changes during the deformation process. An image scale scheme and an
automatic thresholding scheme dynamically adapt the active contour in
natural scenes. The proposed model is found to outperform the original
snake model and degrade gracefully in the presence of image blur and
Gaussian noise. Object boundaries are reliably extracted from a range
of natural images. (C) 1999 Elsevier Science B.V. All rights reserved.
|
361. | Huang, PS, Harris, CJ, and Nixon, MS, "Recognising humans by gait via parametric canonical space," ARTIFICIAL INTELLIGENCE IN ENGINEERING, vol. 13, pp. 359-366, 1999.
Abstract:
Based on principal component analysis (PCA), eigenspace transformation
(EST) was demonstrated to be a potent metric in automatic face
recognition and gait analysis by template matching, but without using
data analysis to increase classification capability. Gait is a new
biometric aimed to recognise subjects by the way they walk. In this
article, we propose a new approach which combines canonical space
transformation (CST) based on Canonical Analysis (CA), with EST for
feature extraction. This method can be used to reduce data
dimensionality and to optimise the class separability of different gait
classes simultaneously. Each image template is projected from the
high-dimensional image space to a low-dimensional canonical space.
Using template matching, recognition of human gait becomes much more
accurate and robust in this new space. Experimental results on a small
database show how subjects can be recognised with 100% accuracy by
their gait, using this method. (C) 1999 Elsevier Science Ltd. All
rights reserved.
|
362. | Lee, MS, and Medioni, G, "Grouping., -, ->, theta, into regions, curves, and junctions," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 76, pp. 54-69, 1999.
Abstract:
We address the problem of extracting segmented, structured information
from noisy data obtained through local processing of images. A unified
computational framework is developed for the inference of multiple
salient structures such as junctions, curves, regions, and surfaces
from any combinations of points, curve elements, and surface patch
elements inputs in 2D and 3D. The methodology is grounded in two
elements: tensor calculus for representation and nonlinear voting for
data communication. Each input site communicates its information (a
tensor) to its neighborhood through a predefined (tensor) field and,
therefore, casts a (tensor) vote. Each site collects all the votes cast
at its location and encodes them into a new tensor. A local, parallel
routine such as a modified marching cube/square process then
simultaneously detects junctions, curves, regions, and surfaces. The
proposed method is noniterative, requires no initial guess or
thresholding, can handle the presence of multiple curves, regions, and
surfaces in a large amount of noise while it still preserves
discontinuities, and the only free parameter is scale. We present
results of curve and region inference from a variety of inputs. (C)
1999 Academic Press.
|
363. | Tiddeman, B, Rabey, G, and Duffy, N, "Synthesis and transformation of three-dimensional facial images - Extending the principles of face-space transformations by using texture-mapped laser-scanned surface data," IEEE ENGINEERING IN MEDICINE AND BIOLOGY MAGAZINE, vol. 18, pp. 64-69, 1999.
Abstract:
External energies of active contours are often formulated as Euclidean
are length integrals. In this paper, we show that such formulations are
biased. By this we mean that the minimum of the external energy does
not occur at an image edge. In addition, we also show that for certain
forms of external energy the active contour is unstable-when
initialized at the true edge, the contour drifts away and becomes
jagged. Both of these phenomena are due to the use of Euclidean are
length integrals.
We propose a non-Euclidean are length which eliminates these problems.
This requires a reformulation of active contours where a single
external energy function is replaced by a sequence of energy functions
and the contour evolves as an integral curve of the gradient of these
energies. The resulting active contour not only has unbiased external
energy, but is also more controllable,
Experimental evidence is provided in support of the theoretical claims.
|
364. | Wang, KC, Dutton, RW, and Taylor, CA, "Improving geometric model construction for blood flow modeling - Geometric image segmentation and image-based model construction for computational hemodynamics," IEEE ENGINEERING IN MEDICINE AND BIOLOGY MAGAZINE, vol. 18, pp. 33-39, 1999.
Abstract:
External energies of active contours are often formulated as Euclidean
are length integrals. In this paper, we show that such formulations are
biased. By this we mean that the minimum of the external energy does
not occur at an image edge. In addition, we also show that for certain
forms of external energy the active contour is unstable-when
initialized at the true edge, the contour drifts away and becomes
jagged. Both of these phenomena are due to the use of Euclidean are
length integrals.
We propose a non-Euclidean are length which eliminates these problems.
This requires a reformulation of active contours where a single
external energy function is replaced by a sequence of energy functions
and the contour evolves as an integral curve of the gradient of these
energies. The resulting active contour not only has unbiased external
energy, but is also more controllable,
Experimental evidence is provided in support of the theoretical claims.
|
365. | Ma, TY, and Tagare, HD, "Consistency and stability of active contours with Euclidean and non-Euclidean arc lengths," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 8, pp. 1549-1559, 1999.
Abstract:
External energies of active contours are often formulated as Euclidean
are length integrals. In this paper, we show that such formulations are
biased. By this we mean that the minimum of the external energy does
not occur at an image edge. In addition, we also show that for certain
forms of external energy the active contour is unstable-when
initialized at the true edge, the contour drifts away and becomes
jagged. Both of these phenomena are due to the use of Euclidean are
length integrals.
We propose a non-Euclidean are length which eliminates these problems.
This requires a reformulation of active contours where a single
external energy function is replaced by a sequence of energy functions
and the contour evolves as an integral curve of the gradient of these
energies. The resulting active contour not only has unbiased external
energy, but is also more controllable,
Experimental evidence is provided in support of the theoretical claims.
|
366. | Trevelyan, J, "Redefining robotics for the new millennium," INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, vol. 18, pp. 1211-1223, 1999.
Abstract:
This paper argues that the term "robotics" needs to be redefined as
"the science of extending human motor capabilities with machines," and
uses the author's experience with robotics over the past 25 years to
support this argument. The current definition is tied by default to the
term "robot," which emerged from science fiction-this tie needs to be
broken if robotics research is to be based on reality. The paper
reviews the author's research on sheep shearing, vision, calibration,
telerobotics, and landmine clearance, and draws some conclusions that
point to the need for changing the contemporary view of robotics. A
brief survey of subjects addressed by robotics-research journal
articles and comments from other robotics researchers support this
view. Finally, at a time when many people regard technology, and
particularly automation, with considerable skepticism, the proposed
definition is easier for ordinary people to understand and support, and
it provides more freedom for researchers to find creative approaches.
|
367. | Sim, HC, and Damper, RI, "A neural network approach to planar-object recognition in 3D space," PATTERN ANALYSIS AND APPLICATIONS, vol. 2, pp. 143-163, 1999.
Abstract:
Most existing 2D object recognition algorithms are not perspective (or
projective) invariant, and hence are not suitable far many real-world
applications. By contrast, one of the primary goals of this research is
to develop a flat object matching system that can identify and localise
an object, even when seen from different viewpoints in 3D space. In
addition, we also strive to achieve good scale invariance and
robustness against partial occlusion as in any practical 2D object
recognition system. The proposed system uses multi-view model
representations and objects are recognised by self-organised dynamic
link matching. The merit of this approach is that: it offers a compact
framework for concurrent assessments of multiple match hypotheses by
promoting competitions and/or co-operations among several local
mappings of model and test image feature correspondences. Our
experiments show that the system is very successful in recognising
object to perspective distortion, even in rather cluttered scenes.
|
368. | Wolberg, WH, Street, WN, and Mangasarian, OL, "Importance of nuclear morphology in breast cancer prognosis," CLINICAL CANCER RESEARCH, vol. 5, pp. 3542-3548, 1999.
Abstract:
The purpose of this study is to define prognostic relationships between
computer-derived nuclear morphological features, lymph node status, and
tumor size in breast cancer. Computer-derived nuclear size, shape, and
texture features were determined in fine-needle aspirates obtained at
the time of diagnosis from 253 consecutive patients with invasive
breast cancer. Tumor size and lymph node status were determined at the
time of surgery, Median follow-up time was 61.5 months for patients
without distant recurrence, In univariate analysis, tumor size, nuclear
features, and the number of metastatic nodes were of decreasing
significance for distant disease-free survival. Nuclear features, tumor
size, and the number of metastatic nodes were of decreasing
significance for overall survival. In multivariate analysis, the
morphological size feature, largest perimeter, was more predictive of
disease-free and overall survival than were either tumor size or the
number of axillary lymph node metastases. This morphological feature,
when combined with tumor size, identified more patients at both the
good and poor ends of the prognostic spectrum than did the combination
of tumor size and axillary lymph node status, Our data indicate that
computer analysis of nuclear features has the potential to replace
axillary lymph node status for staging of breast cancer. If confirmed
by others, axillary dissection for breast cancer staging, estimating
prognosis, and selecting patients for adjunctive therapy could be
eliminated.
|
369. | Chesnaud, C, Refregier, P, and Boulet, V, "Statistical region snake-based segmentation adapted to different physical noise models," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 21, pp. 1145-1157, 1999.
Abstract:
Algorithms for object segmentation are crucial in many image processing
applications. During past years, active contour models (snakes) have
been widely used for finding the contours of objects. This segmentation
strategy is classically edge-based in the sense that the snake is
driven to fit the maximum of an edge map of the scene. In this paper,
we propose a region snake approach and we determine fast algorithms for
the segmentation of an object in an image. The algorithms developed in
a Maximum Likelihood approach are based on the calculation of the
statistics of the inner and the outer regions (defined by the snake).
It has thus been possible to develop optimal algorithms adapted to the
random fields which describe the gray levels in the input image if we
assume that their probability density function family are known. We
demonstrate that this approach is still efficient when no boundary's
edge exists in the image. We also show that one can obtain fast
algorithms by transforming the summations over a region, for the
calculation of the statistics, into summations along the boundary of
the region. Finally, we will provide numerical simulation results for
different physical situations in order to illustrate the efficiency of
this approach.
|
370. | Gotte, MJW, van Rossum, AC, Marcus, JT, Kuijer, JPA, Axel, L, and Visser, CA, "Recognition of infarct localization by specific changes in intramural myocardial mechanics," AMERICAN HEART JOURNAL, vol. 138, pp. 1038-1045, 1999.
Abstract:
Background After transmural myocardial infarction (MI), changes occur
in intramural myocardial function. This has been described in anterior
MI only. The aim of this study was to determine the relation between
variable infarct locations and intramural deformation in patients with
a first MI.
Methods Forty patients (33 men and 7 women aged 57 +/- 11 years) with
different infarct-related coronary arteries 125 left anterior
descending, 7 circumflex, and 8 right coronary) were studied 6 +/- 3
days after infarction with magnetic resonance tissue tagging and
2-dimensional finite element analysis of myocardial deformation.
Short-axis tagged images were acquired at base, mid, and apical level.
Intramural deformation was measured in 6 circumferential segments per
level. Results were compared with 9 age-matched healthy controls.
Results Each infarct area demonstrated a-significant reduction of
intramural deformation. At mid-ventricular level, segments with maximum
impaired intramural function were the anteroseptal segment for left
anterior descending-related MI (stretch: 16% vs 33% for controls, P <
.001), the posterolateral segment for related MI (stretch: 20% vs 34%,
P < .01); and the inferior segment for right coronary artery related MI
(stretch: 18% vs 25%, P = .082). In these infarct segments, the
intramural regional systolic stretch was more circumferentially
oriented compared with radilly oriented stretch in the same segments in
controls (P < .05).
Conclusion The infarct area can be recognized by a specific spatial
pattern of intramural deformation, In infarcted compared with
noninfarcted myocardium, deformation is significantly reduced and
systolic stretch deviates from the radial direction. Left anterior
descending related infarcts were found to have larger regional
differences in intramural deformation than circumflex or right coronary
artery related MI of enzymatically the same size.
|
371. | Zhong, D, and Chang, SF, "An integrated approach for content-based video object segmentation and retrieval," IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, vol. 9, pp. 1259-1268, 1999.
Abstract:
Object-based video data representations enable unprecedented
functionalities of content access and manipulation. In this paper, we
present an integrated approach using region-based analysis for semantic
video object segmentation and retrieval. We first present an active
system that combines low-level region segmentation with user inputs for
defining and tracking semantic video objects. The proposed technique is
novel in using an integrated feature fusion framework for tracking and
segmentation at both region and object levels. Experimental results and
extensive performance evaluation show excellent results compared to
existing systems. Building upon the segmentation framework, we then
present a unique region-based query system for semantic video object.
The model facilitates powerful object search, such as spatio-temporal
similarity searching at multiple levels.
|
372. | Shekhar, R, Cothren, RM, Vince, DG, Chandra, S, Thomas, JD, and Cornhill, JF, "Three-dimensional segmentation of luminal and adventitial borders in serial intravascular ultrasound images," COMPUTERIZED MEDICAL IMAGING AND GRAPHICS, vol. 23, pp. 299-309, 1999.
Abstract:
Intravascular ultrasound (IVUS) provides exact anatomy of arteries,
allowing accurate quantitative analysis. Automated segmentation of IVUS
images is a prerequisite for routine quantitative analyses. We present
a new three-dimensional (3D) segmentation technique, called active
surface segmentation, which detects luminal and adventitial borders in
IVUS pullback examinations of coronary arteries. The technique was
validated against expert tracings by computing correlation coefficients
(range 0.83-0.97) and William's index values (range 0.37-0.66), The
technique was statistically accurate, robust to image artifacts, and
capable of segmenting a large number of images rapidly. Active surface
segmentation enabled geometrically accurate 3D reconstruction and
visualization of coronary arteries and volumetric measurements. (C)
1999 Elsevier Science Ltd. All rights reserved.
|
373. | Akgul, YS, Kambhamettu, C, and Stone, M, "Automatic extraction and tracking of the tongue contours," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 18, pp. 1035-1045, 1999.
Abstract:
Computerized analysis of the tongue surface movement can provide
valuable information to speech and swallowing research. Ultrasound
technology is currently the most attractive modality for the tongue
imaging mainly because of its high video frame rate. However, problems
with ultrasound imaging, such as noise and echo artifacts, refractions,
and unrelated reflections pose significant challenges for computer
analysis of the tongue images and hence specific methods must be
developed.
This paper presents a system that is developed for automatic extraction
and tracking of the tongue surface movements from ultrasound image
sequences. The ultrasound images are supplied by the head and
transducer support system (HATS), which was developed in order to fix
the head and support the transducer under the chin in a known position
without disturbing speech, In this work, we propose a novel scheme for
the analysis of the tongue images using deformable contours. We
incorporate novel mechanisms to 1) impose speech related constraints on
the deformations; 2) perform spatiotemporal smoothing using a contour
postprocessing stage; 3) utilize optical flow techniques to speedup the
search process; and 4) propagate user supplied information to the
analysis of all image frames.
We tested the system's performance qualitatively and quantitatively in
consultation with speech scientists. Our system produced contours that
are within the range of manual measurement variations. The results of
our system are extremely encouraging and the system can be used in
practical speech and swallowing research in the field of otolaryngology.
|
374. | Hagemann, A, Rohr, K, Stiehl, HS, Spetzger, U, and Gilsbach, JM, "Biomechanical modeling of the human head for physically based, nonrigid image registration," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 18, pp. 875-884, 1999.
Abstract:
The accuracy of image-guided neurosurgery generally suffers from brain
deformations due to intraoperative changes. These deformations cause
significant changes of the anatomical geometry (organ shape and spatial
interorgan relations), thus making intraoperative navigation based on
preoperative images error prone. In order to improve the navigation
accuracy, we developed a biomechanical model of the human head based on
the finite element method, which can be employed for the correction of
preoperative images to cope with the deformations occurring during
surgical interventions. At the current stage of development, the
two-dimensional (2-D) implementation of the model comprises two
different materials, though the theory holds for the three-dimensional
(3-D) case and is capable of dealing with an arbitrary number of
different materials. For the correction of a preoperative image, a set
of homologous landmarks must be specified which determine
correspondences. These correspondences can be easily integrated into
the model and are maintained throughout the computation of the
deformation of the preoperative image. The necessary material parameter
values have been determined through a comprehensive literature study.
Our approach has been tested for the case of synthetic images and
yields physically plausible deformation results. Additionally, we
carried out registration experiments with a preoperative MR image of
the human head and a corresponding postoperative image simulating an
intraoperative image. We found that our approach yields good prediction
results, even in the case when correspondences are given in a
relatively small area of the image only.
|
375. | McInerney, T, and Terzopoulos, D, "Topology adaptive deformable surfaces for medical image volume segmentation," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 18, pp. 840-850, 1999.
Abstract:
Deformable models, which include deformable contours (the popular
snakes) and deformable Surfaces, are a powerful model-based medical
image analysis technique. We develop a new class of deformable models
by formulating deformable surfaces in terms of an affine cell image
decomposition (ACID). Our approach significantly extends standard
deformable surfaces, while retaining their interactivity and other
desirable properties. In particular, the ACID induces an efficient
reparameterization mechanism that enables parametric deformable
surfaces to evolve into complex geometries, even modifying their
topology as necessary. We demonstrate that our new ACID-based
deformable surfaces, dubbed T-surfaces, can effectively segment complex
anatomic structures from medical volume images.
|
376. | Kelemen, A, Szekely, G, and Gerig, G, "Elastic model-based segmentation of 3-D neuroradiological data sets," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 18, pp. 828-839, 1999.
Abstract:
This paper presents a new technique for the automatic model-based
segmentation of three-dimensional (3-D) objects from volumetric image
data. The development closely follows the seminal work of Taylor and
Cootes on active shape models, but is based on a hierarchical
parametric object description rather than a point distribution model,
The segmentation system includes both the building of statistical
models and the automatic segmentation of new image data sets via a
restricted elastic deformation of shape models, Geometric models are
derived from a sample set of image data which have been segmented by
experts, The surfaces of these binary objects are converted into
parametric surface representations, which are normalized to get an
invariant object-centered coordinate system, Surface representations
are expanded into series of spherical harmonics which provide
parametric descriptions of object shapes. It is shown that invariant
object surface parametrization provides a good approximation to
automatically determine object homology in terms of sets of
corresponding sets of surface points. Gray-level information near
object boundaries is represented by 1-D intensity profiles normal to
the surface. Considering automatic segmentation of brain structures as
our driving application, our choice of coordinates for object alignment
was the well-accepted stereotactic coordinate system. Major variation
of object shapes around the mean shape, also referred to as shape
eigenmodes, are calculated in shape parameter space rather than the
feature space of point coordinates, Segmentation makes use of the
object shape statistics by restricting possible elastic deformations
into the range of the training shapes, The mean shapes are initialized
in a new data set by specifying the landmarks of the stereotactic
coordinate system, The model elastically deforms, driven by the
displacement forces across the object's surface, which are generated by
matching local intensity profiles. Elastical deformations are limited
by setting bounds for the maximum variations in eigenmode space. The
technique has been applied to automatically segment left and right
hippocampus, thalamus, putamen, and globus pallidus from volumetric
magnetic resonance scans taken from schizophrenia studies. The results
have been validated by comparison of automatic segmentation with the
results obtained by interactive expert segmentation.
|
377. | Olver, PJ, Sapiro, G, and Tannenbaum, A, "Affine invariant detection: Edge maps, anisotropic diffusion, and active contours," ACTA APPLICANDAE MATHEMATICAE, vol. 59, pp. 45-77, 1999.
Abstract:
In this paper we undertake a systematic investigation of affine
invariant object detection and image denoising. Edge detection is first
presented from the point of view of the affine invariant scale-space
obtained by curvature based motion of the image level-sets. In this
case, affine invariant maps are derived as a weighted difference of
images at different scales. We then introduce the affine gradient as an
affine invariant differential function of lowest possible order with
qualitative behavior similar to the Euclidean gradient magnitude. These
edge detectors are the basis for the extension of the affine invariant
scale-space to a complete affine flow for image denoising and
simplification, and to define affine invariant active contours for
object detection and edge integration. The active contours are obtained
as a gradient flow in a conformally Euclidean space defined by the
image on which the object is to be detected. That is, we show that
objects can be segmented in an affine invariant manner by computing a
path of minimal weighted affine distance, the weight being given by
functions of the affine edge detectors. The gradient path is computed
via an algorithm which allows to simultaneously detect any number of
objects independently of the initial curve topology. Based on the same
theory of affine invariant gradient flows we show that the affine
geometric heat flow is minimizing, in an affine invariant form, the
area enclosed by the curve.
|
378. | Terzopoulos, D, "Visual modeling for multimedia content," ADVANCED MULTIMEDIA CONTENT PROCESSING, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1554, pp. 406-421, 1999.
Abstract:
This paper reviews research that addresses the challenging problem of
modeling living systems for multimedia content creation. First, I
discuss the modeling of animals in their natural habitats for use in
animated virtual worlds. The basic approach is to implement realistic
artificial animals (in particular, fish) and to give them the ability
to locomote, perceive, and in some sense understand the realistic
virtual worlds in which they are situated so that they may achieve both
individual and social functionality within these worlds. Second, I
discuss the modeling of human faces. The goal is to develop facial
models that are capable of synthesizing realistic expressions. At
different levels of abstraction, these hierarchical models capture
knowledge from psychology, facial anatomy and tissue histology, and
continuum biomechanics. The facial models can be "personalized", or
made to conform closely to individuals, once facial geometry and
photometry information has been captured by a range sensor.
|
379. | Mortensen, EN, "Vision-assisted image editing," COMPUTER GRAPHICS-US, vol. 33, pp. 55-57, 1999.
Abstract:
A CNN-based algorithm for image segmentation by active contours is
proposed here. The algorithm is based on an iterative process of
expansion of the contour and its subsequent thinning guided by external
and internal energy. The proposed strategy allows for a high level of
control over contour evolution making their topologic transformations
easier. Therefore processing of multiple contours for segmenting
several objects can be carried out simultaneously.
|
380. | Kozek, T, and Vilarino, DL, "An active contour algorithm for continuous-time cellular neural networks," JOURNAL OF VLSI SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, vol. 23, pp. 403-414, 1999.
Abstract:
A CNN-based algorithm for image segmentation by active contours is
proposed here. The algorithm is based on an iterative process of
expansion of the contour and its subsequent thinning guided by external
and internal energy. The proposed strategy allows for a high level of
control over contour evolution making their topologic transformations
easier. Therefore processing of multiple contours for segmenting
several objects can be carried out simultaneously.
|
381. | Rekeczky, C, and Chua, LO, "Computing with front propagation: Active contour and skeleton models in continuous-time CNN," JOURNAL OF VLSI SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, vol. 23, pp. 373-402, 1999.
Abstract:
In this paper, a linear CNN template class is studied with a symmetric
feedback matrix capable of generating trigger-waves, a special type of
binary traveling-wave. The qualitative properties of these waves are
examined and some simple control strategies are derived based on
modifying the bias and feedback terms in a CNN template. It is shown
that a properly controlled wave-front can be efficiently used in
segmentation, shape and structure detection/recovery tasks. Shape is
represented by the contour of an evolving front. An algorithmic
framework is discussed that incorporates bias controlled trigger-waves
in tracking the active contour of the objects during rigid and
non-rigid motion. The object skeleton (structure) is obtained as a
composition of stable annihilation lines formed during the collision of
trigger wave-fronts. The shortest path problem in a binary labyrinth is
also formulated as a special type of skeletonization task and solved by
combined trigger-wave based techniques.
|
382. | Velasco, HMG, Aligue, FJL, Orellana, CJG, Macias, MM, and Sotoca, MIA, "Application of ANN techniques to automated identification of bovine livestock," ENGINEERING APPLICATIONS OF BIO-INSPIRED ARTIFICIAL NEURAL NETWORKS, VOL II, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1607, pp. 422-431, 1999.
Abstract:
In this work a classification system is presented that, taking lateral
images of cattle as inputs, is able to identify the animals and
classify them by breed into previously learnt classes. The system
consists of two fundamental parts. In the first one, a
deformable-model-based preprocessing of the image is made, in which the
contour of the animal in the photograph is sought, extracted, and
normalized. Next, a neural classifier is presented that, supplemented
with a decision-maker at its output, makes the distribution into
classes. In the last part, the results obtained in a real application
of this methodology are presented.
|
383. | Chella, A, Di Gesu, V, Infantino, I, Intravaia, D, and Valenti, C, "A cooperating strategy for objects recognition," SHAPE, CONTOUR AND GROUPING IN COMPUTER VISION, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1681, pp. 264-274, 1999.
Abstract:
The paper describes an object recognition system, based on the
co-operation of several visual modules (early vision, object detector,
and object recognizer). The system is active because the behavior of
each module is tuned on the results given by other modules and by the
internal models. This solution allows to detect inconsistencies and to
generate a feedback process. The proposed strategy has shown good
performance especially in case of complex scene analysis, and it has
been included in the visual system of the DAISY robotics system.
Experimental results on real data are also reported.
|
384. | Doucette, P, Agouris, P, Musavi, M, and Stefanidis, A, "Automated extraction of linear features from aerial imagery using Kohonen learning and GIS data," INTEGRATED SPATIAL DATABASES: DIGITAL IMAGES AND GIS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1737, pp. 20-33, 1999.
Abstract:
An approach to semi-automated linear feature extraction from aerial
imagery is introduced in which Kohonen's self-organizing map (SOM)
algorithm is integrated with existing GIS data. The SOM belongs to a
distinct class of neural networks which is characterized by competitive
and unsupervised learning. Using radiometrically classified image
pixels as input, appropriate SOM network topologies are modeled to
extract underlying spatial structures contained in the input patterns.
Coarse-resolution GIS vector data is used for network weight and
topology initialization when extracting specific feature components.
The Kohonen learning rule updates the synaptic weight vectors of
winning neural units that represent 2-D vector shape vertices.
Experiments with high-resolution hyperspectral imagery demonstrate a
robust ability to extract centerline information when presented with
coarse input.
|
385. | Laading, JK, McCulloch, C, Johnson, VE, Gilland, DR, and Jaszczak, RJ, "A hierarchical feature based deformation model applied to 4D cardiac SPECT data," INFORMATION PROCESSING IN MEDICAL IMAGING, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1613, pp. 266-279, 1999.
Abstract:
In this paper we describe a statistical model for the observation of
labeled points in gated cardiac single photon emission computed
tomography (SPECT) images. The model has two major parts: one based on
shape correspondence between the image for evaluation and a reference
image, and a second based on the match in image features. While the
statistical deformation model is applicable to a broad range of image
objects, the addition of a contraction mechanism to the baseline model
provides particularly convincing results in gated cardiac SPECT. The
model is applied to clinical data and provides marked improvement in
the quality of summary images for the time series. Estimates of heart
deformation and contraction parameters are also obtained.
|
386. | Chung, DH, and Sapiro, G, "A windows-based user friendly system for image analysis with partial differential equations," SCALE-SPACE THEORIES IN COMPUTER VISION, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1682, pp. 453-458, 1999.
Abstract:
In this paper we present and briefly describe a Windows user-friendly
system designed to assist with the analysis of images in general, and
biomedical images in particular. The system, which is being made
publicly available to the research community, implements basic 2D image
analysis operations based on partial differential equations (PDE's).
The system is under continuous development, and already includes a
large number of image enhancement and segmentation routines that have
been tested for several applications.
|
387. | Sifakis, E, and Tziritas, G, "Fast marching to moving object location," SCALE-SPACE THEORIES IN COMPUTER VISION, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1682, pp. 447-452, 1999.
Abstract:
In this paper we address two important problems in motion analysis: the
detection of moving objects and their localization. Statistical and
level set approaches are adopted in order to formulate these problems.
For the change detection problem, the inter-frame difference is modeled
by a mixture of two zero-mean Laplacian distributions. At first,
statistical tests using criteria with negligible error probability axe
used for labeling as many as possible sites as changed or unchanged.
All the connected components of the labeled sites are seed regions,
which give the initial level sets, for which velocity fields for label
propagation are provided. We introduce a new multi-label fast marching
algorithm for expanding competitive regions. The solution of the
localization problem is based on the map of changed pixels previously
extracted. The boundary of the moving object is determined by a level
set algorithm, which is initialized by two curves evolving in
converging opposite directions. The sites of curve contact determine
the position of the object boundary. For illustrating the efficiency of
the proposed approach, experimental results are presented using real
video sequences.
|
388. | Chan, T, and Vese, L, "An active contour model without edges," SCALE-SPACE THEORIES IN COMPUTER VISION, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1682, pp. 141-151, 1999.
Abstract:
In this paper, we propose a new model for active contours to detect
objects in a given image, based on techniques of curve evolution,
Mumford-Shah functional for segmentation and level sets. Our model can
detect objects whose boundaries are not necessarily defined by
gradient. The model is a combination between more classical active
contour models using mean curvature motion techniques, and the
Mumford-Shah model for segmentation. We minimize an energy which can be
seen as a particular case of the so-called minimal partition problem.
In the level set formulation, the problem becomes a "mean-curvature
flow" -like evolving the active contour, which will stop on the desired
boundary. However, the stopping term does not depend on the gradient of
the image, as in the classical active contour models, but is instead
related to a particular segmentation of the image. Finally, we will
present various experimental results and in particular some examples
for which the classical snakes methods based on the gradient are not
applicable.
|
389. | Gomes, J, and Faugeras, O, "Reconciling distance functions and level sets," SCALE-SPACE THEORIES IN COMPUTER VISION, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1682, pp. 70-81, 1999.
Abstract:
This paper is concerned with the simulation of the Partial Differential
Equation (PDE) driven evolution of a closed surface by means of an
implicit representation. In most applications, the natural choice for
the implicit representation is the signed distance function to the
closed surface. Osher and Sethian propose to evolve the distance
function with a Hamilton-Jacobi equation. Unfortunately the solution to
this equation is not a distance function. As a consequence, the
practical application of the level set method is plagued with such
questions as when do we have to "reinitialize" the distance function?
How do we "reinitialize" the distance function? Etc... which reveal a
disagreement between the theory and its implementation. This paper
proposes an alternative to the use of Hamilton-Jacobi equations which
eliminates this contradiction: in our method the implicit
representation always remains a distance function by construction, and
the implementation does not differ from the theory anymore. This is
achieved through the introduction of a new equation. Besides its
theoretical advantages, the proposed method also has several practical
advantages which we demonstrate in two applications: (i) the
segmentation of the human cortex surfaces from MRI images using two
coupled surfaces [26], (ii) the construction of a hierarchy of
Euclidean skeletons of a 3D surface.
|
390. | Bertalmio, M, Sapiro, G, and Randall, G, "Morphing active contours," SCALE-SPACE THEORIES IN COMPUTER VISION, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1682, pp. 46-57, 1999.
Abstract:
A method for deforming curves in a given image to a desired position in
a second image is introduced in this paper. The algorithm is based on
deforming the first image toward the second one via a partial
differential equation, while tracking the deformation of the curves of
interest in the first image with an additional, coupled, partial
differential equation. The tracking is performed by projecting the
velocities of the first equation into the second one. In contrast with
previous PDE based approaches, both the images and the curves on the
frames/slices of interest axe used for tracking. The technique can be
applied to object tracking and sequential segmentation. The topology of
the deforming curve can change, without any special topology handling
procedures added to the scheme. This permits for example the automatic
tracking of scenes where, due to occlusions, the topology of the
objects of interest changes from frame to frame. In addition, this work
introduces the concept of projecting velocities to obtain systems of
coupled partial differential equations for image analysis applications.
We show examples for object tracking and segmentation of electronic
microscopy. We also briefly discuss possible uses of this framework for
three dimensional morphing.
|
391. | Goldenberg, R, Kimmel, R, Rivlin, E, and Rudzsky, M, "Fast geodesic active contours," SCALE-SPACE THEORIES IN COMPUTER VISION, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1682, pp. 34-45, 1999.
Abstract:
We use an unconditionally stable numerical scheme to implement a fast
version of the geodesic active contour model. The proposed scheme is
useful for object segmentation in images, like tracking moving objects
in a sequence of images. The method is based on the
Weickert-Romeney-Viergever [33] AOS scheme. It is applied at small
regions, motivated by Adalsteinsson-Sethian [1] level set narrow band
approach, and uses Sethian's fast marching method [26] for
re-initialization. Experimental results demonstrate the power of the
new method for tracking in color movies.
|
392. | Katahara, S, and Aoki, M, "Face parts extraction window based on bilateral symmetry of gradient direction," COMPUTER ANALYSIS OF IMAGES AND PATTERNS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1689, pp. 489-497, 1999.
Abstract:
We propose a simple algorithm to determine face parts extraction window
in face image. We utilize bilateral symmetries between and within face
parts. We also use knowledge about size and locationship of face parts.
First, we examine bilateral symmetries around vertical orientation
edge, then obtain symmetry measures. The symmetry measures are
projected onto y-axis to produce histogram of the measures. We estimate
height of face parts regions by frequency of the histogram. Face parts
region, which contains maximum frequency of the histogram, becomes a
candidate of face parts region that includes eyes and eyebrows.
Secondly, the measures that exist within the height of the face parts
region are projected onto x-axis to estimate width of face parts
region. We determine face parts extraction windows by the estimated
height and width. Finally. we detect irises in the candidate of face
parts region that includes eyes and eyebrows, using circular mask.
|
393. | Klemencic, A, Pernus, F, and Kovacic, S, "Modeling morphological changes during contraction of muscle fibres by active contours," COMPUTER ANALYSIS OF IMAGES AND PATTERNS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1689, pp. 134-141, 1999.
Abstract:
An active contour model with expansion "balloon" forces was used as a
tool to simulate the changes in shape and increase in cross-sectional
area, which occur during the contraction of isolated muscle fiber. A
polygon, imitating the boundaries of the relaxed muscle fiber
cross-section. represented the initial position of the active contour
model. This contour was then expanded in order to increase the
cross-sectional area and at the same time intrinsic elastic properties
smoothed the contour. The process of expansion was terminated, when the
area of the inflated contour surpassed the preset value. The equations
that we give, lead to a controlled expansion of the active contour
model.
|
394. | Berger, MO, Winterfeldt, G, and Lethor, JP, "Contour tracking in echo cardiographic sequences without learning stage: Application to the 3D reconstruction of the beating left ventricule," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION, MICCAI'99, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1679, pp. 508-515, 1999.
Abstract:
In this paper we present a contour tracker oil echographic image
sequences. To do this, we use a hierarchical approach: we first compute
a global estimation of the ventricular motion. Then we use a fine
tuning algorithm to adjust the detection of the ventricular wall. The
global estimation is based oil a parametric motion model with a small
number of parameters. This allows us to compute the motion in a robust
way from the velocity computed at each point of the contour.
Results are presented demonstrating tracking on various echographic
sequences. We conclude by discussing some of our current research
efforts.
|
395. | Montagnat, J, Delingette, H, and Malandain, G, "Cylindrical echocardiographic image segmentation based on 3D deformable models," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION, MICCAI'99, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1679, pp. 168-175, 1999.
Abstract:
This paper presents a 3D echocardiographic image segmentation procedure
based on deformable surfaces. We first propose to adapt filtering
techniques to the cylindrical geometry of several 3D ultrasound image
devices. Then we compare the effect of different external forces on a
surface template deformation inside volumetric echocardiographic
images. An original method involving region grey-level analysis along
the model normal directions is described. We rely on an a priori
knowledge of the cardiac left ventricle shape and on region grey-level
values to perform a robust segmentation. During the deformation process
the allowable surface deformation is modified. Finally, we show
experimental results on very challenging sparse and noisy images and
quantitative measurements of the left ventricle volume.
|
396. | Liang, JM, McInerney, T, and Terzopoulos, D, "Interactive medical image segmentation with United Snakes," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION, MICCAI'99, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1679, pp. 116-127, 1999.
Abstract:
Snakes have become a standard image analysis technique with several
variants now in common use. We have developed a software package called
"United Snakes". It unifies the most important snake variants,
including finite difference, B-spline, and Hermite polynomial snakes,
within the framework of a general finite element formulation with a
choice of shape functions. Furthermore, we have incorporated into
united snakes a recently proposed snake-like technique known as
"livewire", via a method for imposing hard constraints on snakes. Here,
we demonstrate that the combination of techniques in united snakes
yields generality, accuracy, ease of use, and robustness in several
medical image analysis applications, including the segmentation of
neuronal dendrites in EM images, dynamic chest image analysis, and the
quantification of growth plates.
|
397. | Hug, J, Brechbuhler, C, and Szekely, G, "Tamed Snake: A particle system for robust semi-automatic segmentation," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION, MICCAI'99, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1679, pp. 106-115, 1999.
Abstract:
Semi-automatic segmentation approaches tend to overlook the problems
caused by missing or incomplete image information. In such situations,
powerful control mechanisms and intuitive modelling metaphors should be
provided in order to make the methods practically applicable. Taking
this problem into account, the usage of subdivision curves in
combination with the simulation of edge attracted mass points is
proposed as a novel way towards a more robust interactive segmentation
methodology. Subdivision curves provide a hierarchical and smooth
representation of a shape which call be modified on coarse and on fine
scales as well. Furthermore, local adaptive subdivision gives the
required flexibility when dealing with a discrete curve representation.
III order to incorporate image information, the control vertices of a
curve are considered mass points, attracted by edges in the local
neighbourhood of the image. This so-called Tamed Snake framework is
illustrated by means of the segmentation of two medical data sets and
the results are compared with those achieved by traditional Snakes.
|
398. | Bajaj, CL, Chen, JD, Holt, RJ, and Netravali, AN, "Energy formulations of A-splines," COMPUTER AIDED GEOMETRIC DESIGN, vol. 16, pp. 39-59, 1999.
Abstract:
A-splines are implicit real algebraic curves in Bernstein-Bezier (BB)
form that are smooth. We develop A-spline curve models using various
energy formulations, incorporating bending and stretching energy, based
on the theory of elasticity. The attempt to find true energy minimizing
curves usually leads to complicated integrals which can only be solved
numerically, we introduce a simplified energy formulation which is much
faster to compute yet still provides reasonably accurate results.
Several examples for C-1-continuous quadratic A-splines using the true
and simplified energy models are then presented. (C) 1999 Elsevier
Science B.V. All rights reserved.
|
399. | Liao, CW, and Medioni, G, "Simultaneous surface approximation and segmentation of complex objects," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 73, pp. 43-63, 1999.
Abstract:
Deformable models represent a useful approach to approximate objects
from collected data points. We propose to augment the basic approaches
designed to handle mostly compact objects or objects of known topology.
Our approach can fit simultaneously more than one curve or surface to
approximate multiple topologically complex objects by using (1) the
residual data points, (2) the badly fitting parts of the approximating
surface, and (3) appropriate Boolean operations. In 2-D, B-snakes [3]
are used to approximate each object (pattern). In 3-D, an analytical
surface representation, based on the elements detected, is presented.
The global representation of a 3-D object, in terms of elements and
their connection, takes the form of B-spline and Bezier surfaces. A
Bezier surface is used to connect different elements, and the
connecting surface itself conforms to the data points nearby through
energy minimization. This way, a G(1) continuity surface is achieved
for the underlying 3-D object.
We present experiments on synthetic and real data in 2-D and 3-D. In
these experiments, multiple complex patterns and objects with through
holes are segmented. The system proceeds automatically without human
interaction or any prior knowledge of the topology of the underlying
object. (C) 1999 Academic Press.
|
400. | Yuan, C, Lin, E, Millard, J, and Hwang, JN, "Closed contour edge detection of blood vessel lumen and outer wall boundaries in black-blood MR images," MAGNETIC RESONANCE IMAGING, vol. 17, pp. 257-266, 1999.
Abstract:
Quantitative measurements of the blood vessel wall area may provide
useful information of atherosclerotic plaque burden, progression and/or
regression. Magnetic resonance imaging is a promising technique for
identifying both luminal and outer wall boundaries of the human blood
vessels. Currently these boundaries are primarily defined manually, a
process viewed as labor intensive and subject to significant operator
bias. Fully automated post-processing techniques used for identifying
the lumen and wall boundaries, on the other hand, are also problematic
due to the complexity of signal features in the vicinity of the blood
vessels. The goals of this study were to develop a robust, automated
closed contour edge detection algorithm, apply this algorithm to high
resolution human carotid artery images, and assess its accuracy, and
reproducibility, Our algorithm has proven to be sensitive to various
contrast situations and is reasonably accurate and highly reproducible.
(C) 1999 Elsevier Science Inc.
|
401. | Scott, CH, Sutton, MS, Gusani, N, Fayad, Z, Kraitchman, D, Keane, MG, Axel, L, and Ferrari, VA, "Effect of dobutamine on regional left ventricular function measured by tagged magnetic resonance imaging in normal subjects," AMERICAN JOURNAL OF CARDIOLOGY, vol. 83, pp. 412-417, 1999.
Abstract:
The effect of inotropic stimulation on the pattern and magnitude of
regional left ventricular contraction was studied using tagged magnetic
resonance imaging to assess whether dobutamine exacerbates variation in
regional contraction at rest. Dobutamine stress testing defines a
normal response as a homogeneous increase in regional wall motion. in 8
normal subjects, 4 equally spaced left ventricular short-axis levels
were imaged through systole using tagged magnetic resonance imaging.
The baseline imaging sequence was repeated with 5-, 10-, 15-, and 20-mu
g/kg/min dobutamine infusion. Regional myocardial displacement redial
thickening, and circumferential shortening were measured. The left
ventricle was analyzed by level (base to apex) and wall (septum,
inferior, lateral, anterior), Dobutamine did not alter baseline
regional functional heterogeneity. Dobutamine infusion resulted in a
uniform increase in displacement, radial thickening, and
circumferential shortening from baseline to 10-mu g/kg/min infusion
without additional increases at higher doses. (C) 1999 by Excerpta
Medica, Inc.
|
402. | Gee, JC, "On matching brain volumes," PATTERN RECOGNITION, vol. 32, pp. 99-111, 1999.
Abstract:
To characterize the complex morphological variations that occur
naturally in human neuroanatomy so that their confounding effect can be
minimized in the identification of brain structures in medical images,
a computational framework has evolved in which individual anatomies are
modeled as warped versions of a canonical representation of the
anatomy, known as an atlas. To realize this framework, the method of
elastic matching was invented for determining the spatial mapping
between a three-dimensional image pair in which one image volume is
modeled as an elastic continuum that is deformed to match the
appearance of the second volume. In this paper, we review the seminal
ideas underlying the elastic matching technique, consider the practical
implications of an integral formation of the approach, and explore a
more general Bayesian interpretation of the method in order to address
issues that are less naturally resolved within a continuum mechanical
setting, such as the examination of a solution's reliability or the
incorporation of empirical information that may be available about the
spatial mappings into the analysis. (C) 1999 Pattern Recognition
Society. Published by Elsevier Science Ltd. All rights reserved.
|
403. | Marchant, JA, Schofield, CP, and White, RP, "Pig growth and conformation monitoring using image analysis," ANIMAL SCIENCE, vol. 68, pp. 141-150, 1999.
Abstract:
Machine vision can be used to collect images of pigs and analyse them
to identify and measure specific areas and dimensions related to their
growth, shape and hence conformation. This information could improve
the stockman's ability to maximize production efficiency and also to
monitor health by defecting abnormalities in growth rates. This work
introduces fully automated algorithms which find the plan view outline
of animals in a normal housing situation, divide the outline into major
body components and measure specified dimensions and areas. Special
attention is paid to determining whether the results are sufficiently
repeatable to be useful in estimating these parameters. Problems in
compensating for changes in the optical geometry are outlined and
methods proposed to deal with them. The repeatability of the image
analysis process coupled with the subsequent signal processing for
outlier rejection gives s.e. values on areas of < 0.005 and on linear
dimensions of < 0.0025. For example the plan view area less head and
neck (A4) can be used to predict the weight of the group of pigs at 34
kg, 66 kg and 98 kg with standard errors of 0.25 kg, 0.17 kg and 0.39
kg respectively when using manual weighing results to calibrate the
system. If an individual pig is weighed once at 75 days (e.g. 34 kg) to
calibrate the A4-to-weight relationship, subsequent A4 measurements can
be used to predict its weight when 125 days old (approx. 80 kg) to
within l kg. This matches the accuracy of the manual weighing system
used in the trials. The effect of pig gender on the area to weight
relationships is not significant (P = 0.074), but there is a small yet
significant gender effect with the linear dimensions.
|
404. | Post, FH, de Leeuw, WC, Sadarjoen, IA, Reinders, F, and van Walsum, T, "Global, geometric, and feature-based techniques for vector field visualization," FUTURE GENERATION COMPUTER SYSTEMS, vol. 15, pp. 87-98, 1999.
Abstract:
Vector field visualization techniques are subdivided into three
categories: global, geometric, and feature-based techniques. We
describe each category, and we present some related work and an example
in each category from our own recent research. Spot noise is a texture
synthesis technique for global visualization of vector fields on 2D
surfaces. Deformable surfaces is a generic technique for extraction and
Visualization of geometric objects (surfaces or volumes) in 3D data
fields. Selective and iconic visualization is an approach that extracts
important regions or structures from large data sets, calculates
high-level attributes, and visualizes the features using parameterized
iconic objects. It is argued that for vector fields a range of
Visualization techniques are needed to fulfill the needs of the
application. (C) 1999 Published by Elsevier Science B.V. All rights
reserved.
|
405. | Davatzikos, C, and Prince, JL, "Convexity analysis of active contour problems," IMAGE AND VISION COMPUTING, vol. 17, pp. 27-36, 1999.
Abstract:
A general active contour formulation is considered and a convexity
analysis of its energy function is presented. Conditions under which
this formulation has a unique solution are derived; these conditions
involve both the active contour energy potential and the regularization
parameters. This analysis is then applied to four particular active
contour formulations, revealing important characteristics about their
convexity, and suggesting that external potentials involving
center-of-mass computations may be better behaved than the usual
potentials based on image gradients. Our analysis also provides an
explanation for the poor convergence behavior at concave boundaries and
suggests an alternate algorithm for approaching these types of
boundaries. (C) 1999 Elsevier Science B.V. All rights reserved.
|
406. | Lee, MK, Drangova, M, Holdsworth, DW, and Fenster, A, "Application of dynamic computed tomography for measurements of local aortic elastic modulus," MEDICAL & BIOLOGICAL ENGINEERING & COMPUTING, vol. 37, pp. 13-24, 1999.
Abstract:
A novel computed tomographic (CT) technique used for the instantaneous
measurement of the dynamic elastic modulus of intact excised porcine
aortic vessels subjected to physiological pressure waveforms is
described. This system was comprised of a high resolution X-ray image
intensifier based computed tomographic system with limiting spatial
resolution of 3.2 mm(-1) (for a 40 mm field of view) and a
computer-controlled flow simulator. Utilising cardiac gating and
computer control, a time-resolved sequence of I mm thick axial
tomographic slices was obtained for porcine aortic specimens during one
simulated cardiac cycle. With an image acquisition sampling interval of
16.5 ms, the time sequences of CT slices were able to quantify the
expansion and contraction of the aortic wall during each phase of the
cardiac cycle. Through superficial tagging of the adventitial surface
of the specimens with wire markers, measurement of wall strain in
specific circumferential sectors and subsequent calculations of
localised dynamic elastic modulus were possible. The precision of
circumferential measurements made from the CT images utilising a
cluster-growing segmentation technique was approximately +/- 0.25 mm
and allowed determination of the dynamic elastic modulus (E-dyn) with a
precision of +/- 8 kPa. Dynamic elastic modulus was resolved as a
function of the harmonics of the physiological pressure waveform and as
a function of the angular position around the vessel circumference.
Application of this dynamic CT (DCT) technique to seven porcine
thoracic aortic specimens produced a circumferential average (over all
frequency components) E-dyn of 373 +/- 29 kPa. This value was not
statistically different (p < 0.05) from the values of 430 +/- 77 and
390 +/- 47 kPa obtained by uniaxial tensile testing and volumetric
measurements respectively.
|
407. | Yuen, PC, Feng, GC, and Zhou, JP, "A contour detection method: Initialization and contour model," PATTERN RECOGNITION LETTERS, vol. 20, pp. 141-148, 1999.
Abstract:
In this paper, a new contour detection method based on the snake model
is developed and reported. The proposed method consists of two steps.
The first step is to locate the initial snake contour and a novel
initialization algorithm has been developed. In the second step, an
improved snake algorithm is developed to locate the final contour(s).
Images with single and multiple objects are selected to evaluate the
capability of the proposed method and the results are encouraging. (C)
1999 Elsevier Science B.V. All rights reserved.
|
408. | Shareef, N, Wang, DL, and Yagel, R, "Segmentation of medical images using LEGION," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 18, pp. 74-91, 1999.
Abstract:
Advances in visualization technology and specialized graphic
workstations allow clinicians to virtually interact with anatomical
structures contained within sampled medical-image datasets, A hindrance
to the effective use of this technology is the difficult problem of
image segmentation. In this paper, we utilize a recently proposed
oscillator network called the locally excitatory globally inhibitory
oscillator network (LEGION) whose ability tb achieve fast synchrony
with local excitation and desynchrony with global inhibition makes it
an effective computational framework for grouping similar features and
segregating dissimilar ones in an image, We extract an algorithm from
LEGION dynamics and propose an adaptive scheme for grouping. We show
results of the algorithm to two-dimensional (2-D) and three-dimensional
(3-D) (volume) computerized topography (CT) and magnetic resonance
imaging (MRI) medical-image datasets, In addition, we compare our
algorithm with other algorithms for medical-image segmentation, as well
as with manual segmentation. LEGION's computational and architectural
properties make it a promising approach for real-time medical-image
segmentation.
|
409. | Conforti, D, and De Luca, L, "Computer implementation of a medical diagnosis problem by pattern classification," FUTURE GENERATION COMPUTER SYSTEMS, vol. 15, pp. 287-292, 1999.
Abstract:
In this paper we present a software system which can aid the medical
diagnostician for the diagnosis of breast cancers. The system has been
developed on a "Windows 95" platform and provides a user friendly
interface, made up of windows and visualization tools. An interesting
and innovative feature is represented by the telemedicine configuration
of the software system, which can be run in a remote fashion,
exploiting, from some remote regions, the expertize and the clinical
database available in advanced medical centers.
A prototype version of the software system, named CAMD (computer aided
medical diagnosis) is currently being tested and validated with the
collaboration of the Cytopathology Department of the Cosenza General
Hospital (Calabria, Italy). (C) 1999 Elsevier Science B.V. All rights
reserved.
|
410. | Kervrann, C, and Heitz, F, "Statistical deformable model-based segmentation of image motion," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 8, pp. 583-588, 1999.
Abstract:
We present a statistical method for the motion-based segmentation of
deformable structures undergoing nonrigid movements. The proposed
approach relies on vivo models describing the shape of interest, its
variability, and its movement. The first model corresponds to a
statistical deformable template that constrains the shape and its
deformations. The second model is introduced to represent the optical
flow field inside the deformable template. These two models are
combined within a single probability distribution, which enables to
derive shape and motion estimates using a maximum likelihood approach.
The method requires no manual initialization and is demonstrated on
synthetic data and on a medical X-ray image sequence.
|
411. | Casadei, S, and Mitter, S, "An efficient and provably correct algorithm for the multiscale estimation of image contours by means of polygonal lines," IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 45, pp. 939-954, 1999.
Abstract:
A large portion of image contours is characterized by local properties
such as sharp variations of the image intensity across the contour, The
integration of local image descriptors estimated by using these local
properties into curvilinear descriptors is a difficult problem from a
theoretical viewpoint because of the combinatorially large number of
possible curvilinear descriptors. To deal with this difficulty, the
notion of compressible graphs is introduced and a contour data model is
defined leading to an efficient linear-time algorithm which provably
recovers contours with an upper bound on the approximation error.
|
412. | Yabuki, N, Matsuda, Y, Kimura, H, Fukui, Y, and Miki, S, "Region extraction using color feature and active net model in color image," IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, vol. E82A, pp. 466-472, 1999.
Abstract:
In this paper, we propose a method to detect a road sign from a road
scene image in the daytime. In order to utilize color feature of sign
efficiently, color distribution of sign is examined, and then color
similarity map is constructed. Additionally, color similarity shown on
the map is incorporated into image energy of an active net model. A
road sign is extracted as if it is wrapped up in an active net. Some
experimental results obtained by applying an active net to images are
presented.
|
413. | Sakaue, K, Amano, A, and Yokoya, N, "Optimisation approaches in computer vision and image processing," IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, vol. E82D, pp. 534-547, 1999.
Abstract:
In this paper, the authors present general views of computer vision and
image processing based on optimization. Relaxation and regularization
in both broad and narrow senses are used in various fields and problems
of computer vision and image processing, and they are currently being
combined with general-purpose optimization algorithms. The principle
and case examples of relaxation and regularization are discussed; the
application of optimization to shape description that is a particularly
important problem in the field is described; and the use of a genetic
algorithm (GA) as a method of optimization is introduced.
|
414. | Berger, MO, Wrobel-Dautcourt, B, Petitjean, S, and Simon, G, "Mixing synthetic and video images of an outdoor urban environment," MACHINE VISION AND APPLICATIONS, vol. 11, pp. 145-159, 1999.
Abstract:
Mixing video and computer-generated images is a new and promising area
of research for enhancing reality. It can be used in all the situations
when a complete simulation would not be easy to implement. Past work on
the subject has relied for a large part on human intervention at key
moments of the composition. In this paper, we show that if enough
geometric information about the environment is available, then
efficient tools developed in the computer vision literature can be used
to build a highly automated augmented reality loop. We focus on outdoor
urban environments and present an application for the visual assessment
of a new lighting project of the bridges of Paris. We present a fully
augmented 300-image sequence of a specific bridge, the Pont Neuf
Emphasis is put on the robust calculation of the camera position. We
also detail the techniques used for matching 2D and 3D primitives and
for tracking features over the sequence. Our system overcomes two major
difficulties. First, it is capable of handling poor-quality images,
resulting from the fact that images were shot at night since the goal
was to simulate a new lighting system. Second, it can deal with
important changes in viewpoint position and in appearance along the
sequence. Throughout the paper, many results are shown to illustrate
the different steps and difficulties encountered.
|
415. | Denzler, J, and Niemann, H, "Active rays: Polar-transformed active contours for real-time contour tracking," REAL-TIME IMAGING, vol. 5, pp. 203-213, 1999.
Abstract:
In this paper we describe a new approach to contour extraction and
tracking, which is based on the principles of active contour models and
overcomes its shortcomings. We formally introduce active rays, describe
the contour extraction as an energy minimization problem and discuss
what active contours and active rays have in common.
The main difference is that for active rays a unique ordering of the
contour elements in the 2D image plane is given,which cannot be found
for active contours. This is advantageous for predicting the contour
elements' position and prevents crossings in the contour. Furthermore,
another advantage is that instead of an energy minimization in the 2D
image plane the minimization is reduced to a 1D search problem. The
approach also shows any-time behavior, which is important with respect
to real-time applications. Finally, the method allows for the
management of multiple hypotheses of the object's boundary. This is an
important aspect if concave contours are to be tracked.
Results on real image sequences (tracking a toy train in a laboratory
scene, tracking pedestrians in an outdoor scene) show the suitability
of this approach for real-time object tracking in a closed loop between
image acquisition and camera movement. The contour tracking can be done
within the image frame rate (25 fps) on standard Unix workstations (HP
735) without any specialized hardware. (C) 1999 Academic Press.
|
416. | Cotin, S, Delingette, H, and Ayache, N, "Real-time elastic deformations of soft tissues for surgery simulation," IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, vol. 5, pp. 62-73, 1999.
Abstract:
In this paper, we describe a new method for surgery simulation
including a volumetric model built from medical images and an elastic
modeling of the deformations. The physical model is based on elasticity
theory which suitably links the shape of deformable bodies and the
forces associated with the deformation. A real-time computation of the
deformation is possible thanks to a preprocessing of elementary
deformations derived from a finite element method. This method has been
implemented in a system including a force feedback device and a
collision detection algorithm. The simulator works in real-time with a
high resolution liver model.
|
417. | Peckar, W, Schnorr, C, Rohr, K, and Stiehl, HS, "Parameter-free elastic deformation approach for 2D and 3D registration using prescribed displacements," JOURNAL OF MATHEMATICAL IMAGING AND VISION, vol. 10, pp. 143-162, 1999.
Abstract:
A parameter-free approach for non-rigid image registration based on
elasticity theory is presented. In contrast to traditional
physically-based numerical registration methods, no forces have to be
computed from image data to drive the elastic deformation. Instead,
displacements obtained with the help of mapping boundary structures in
the source and target image are incorporated as hard constraints into
elastic image deformation. As a consequence, our approach does not
contain any parameters of the deformation model such as elastic
constants. The approach guarantees the exact correspondence of boundary
structures in the images assuming that correct input data are
available. The implemented incremental method allows to cope with large
deformations. The theoretical background, the finite element
discretization of the elastic model, and experimental results for 2D
and 3D synthetic as well as real medical images are presented.
|
418. | Oztop, E, Mulayim, AY, Atalay, V, and Yarman-Vural, F, "Repulsive attractive network for baseline extraction on document images," SIGNAL PROCESSING, vol. 75, pp. 1-10, 1999.
Abstract:
This paper describes a new framework, called repulsive attractive (RA)
network for baseline extraction on document images. The RA network is
an energy minimizing dynamical system, which interacts with the
document text image through the attractive and repulsive forces defined
over the network components and the document image. Experimental
results indicate that the network can successfully extract the
baselines under heavy noise and overlaps between the ascending and
descending portions of the characters of adjacent lines. The proposed
framework is applicable to a wide range of image processing
applications, such as curve fitting, segmentation and thinning. (C)
1999 Elsevier Science B.V. All rights reserved.
|
419. | Le Goualher, G, Procyk, E, Collins, DL, Venugopal, R, Barillot, C, and Evans, AC, "Automated extraction and variability analysis of sulcal neuroanatomy," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 18, pp. 206-217, 1999.
Abstract:
Systematic mapping of the variability in cortical sulcal anatomy is an
area of increasing interest which presents numerous methodological
challenges, To address these issues, we have implemented sulcal
extraction and assisted labeling (SEAL) to automatically extract the
two-dimensional (2-D) surface ribbons that represent the median axis of
cerebral sulci and to neuroanatomically label these entities,
To encode the extracted three-dimensional (3-D) cortical sulcal
schematic topography (CSST) we define a relational graph structure
composed of two main features: vertices (representing sulci) and arcs
(representing the relationships between sulci), Vertices contain a
parametric representation of the surface ribbon buried within the
sulcus, Points on this surface are expressed in stereotaxic coordinates
(i.e., with respect to a standardized brain coordinate system). For
each of these vertices, we store length, depth, and orientation as well
as anatomical attributes (e.g., hemisphere, lobe, sulcus type, etc.).
Each are stores the 3-D location of the junction between sulci as well
as a list of its connecting sulci,
Sulcal labeling is performed semiautomatically by selecting a sulcal
entity in the CSST and selecting from a menu of candidate sulcus names.
In order to help the user in the labeling task, the menu is restricted
to the most likely candidates by using priors for the expected sulcal
spatial distribution, These priors, i.e., sulcal probabilistic maps,
were created from the spatial distribution of 34 sulci traced manually
on 36 different subjects, Given these spatial probability maps, the
user is provided with the likelihood that the selected entity belongs
to a particular sulcus,
The cortical structure representation obtained by SEAL is suitable to
extract statistical information about both the spatial and the
structural composition of the cerebral cortical topography, This
methodology allows for the iterative construction of a successively
more complete statistical models of the cerebral topography containing
spatial distributions of the most important structures, their
morphometrics, and their structural components.
|
420. | Gurcan, MN, Koyuturk, M, Yildiz, HS, Cetin-Atalay, R, and Cetin, AE, "Identification of relative protein bands in polyacrylamide gel electrophoresis (PAGE) using a multi-resolution snake algorithm," BIOTECHNIQUES, vol. 26, pp. 1162-+, 1999.
Abstract:
In polyacrylamide gel electrophoresis (PAGE) image analysis, it is
important to determine the percentage of the protein of interest of a
protein mixture. This study presents reliable computer software to
determine this percentage, The region of interest containing the
protein band is detected using the snake algorithm. The iterative snake
algorithm is implemented in a; multi-resolutional framework. The snake
is initialized on a low-resolution image. Then, the final position of
the snake at the low resolution is used as the initial position in the
higher-resolution image. Finally, the area of the protein is estimated
as the area enclosed by the final position of the snake.
|
421. | Izquierdo, ME, "Disparity Segmentation analysis: Matching with an adaptive window and depth-driven segmentation," IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, vol. 9, pp. 589-607, 1999.
Abstract:
Most of the emerging content-based multimedia technologies are based on
efficient methods to solve machine early vision tasks. Among others
tasks, object segmentation is perhaps the most important problem in
single image processing, whereas pixel-correspondence estimation is the
crucial task in multiview image analysis. The solution of these two
problems is the keg technology for the development of the majority of
leading-edge interactive video communication technologies and
telepresence systems. In this paper, we present a robust frame work
comprised of joined pixel-correspondence estimation and image
segmentation in video sequences taken simultaneously from different
perspectives. fin improved concept for stereo-image analysis based on
block matching with a local adaptive window is introduced. The size and
shape of the reference window is calculated adaptively according to the
degree of reliability of disparities estimated previously. Considerable
improvements are obtained just within object borders or image areas
that become occluded by applying the proposed block-matching model. An
initial object segmentation is obtained by merging neighboring sampling
positions with disparity vectors of similar size and direction.
Starting from this initial segmentation, true object borders are
detected using a contour-matching algorithm. In this process, the
contour of the initial segmentation is taken as a reference pattern,
and the edges extracted from the original images, by applying a
multiscale algorithm, are the candidates for the true object contour.
The performance of the introduced methods has been verified by computer
simulations using synthetic data and several natural stereo sequences.
|
422. | Dougherty, L, Asmuth, JC, Blom, AS, Axel, L, and Kumar, R, "Validation of an optical flow method for tag displacement estimation," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 18, pp. 359-363, 1999.
Abstract:
We present a validation study of an optical-flow method for the rapid
estimation of myocardial displacement in magnetic resonance tagged
cardiac images. This registration and change visualization (RCV)
software uses a hierarchical estimation technique to compute the flow
field that describes the warping of an image of one cardiac phase into
alignment with the next. This method overcomes the requirement of
constant pixel intensity in standard optical-how methods by
preprocessing the input images to reduce any intensity bias which
results from the reduction in stripe contrast throughout the cardiac
cycle. To validate the method, SPAMM-tagged images were acquired of a
silicon gel phantom with simulated rotational motion. The pixel
displacement was estimated with the RCV method and the error in pixel
tracking was <4% 1000 ms after application of the tags, and after 30
degrees of rotation. An additional study was performed using a
SPAMM-tagged multiphase slice of a canine left ventricle. The true
displacement was determined using a previously validated active contour
model (snakes). The error between methods was 6.7% at end systole. The
RCV method has the advantage of tracking all pixels in the image in a
substantially shorter period than the snakes method.
|
423. | Rettmann, ME, Xu, CY, Pham, DL, and Prince, JL, "Automated segmentation of sulcal regions," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION, MICCAI'99, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1679, pp. 158-167, 1999.
Abstract:
Automatic segmentation and identification of cortical sulci play an
important role in the study of brain structure and function. In this
work, a method is presented for the automatic segmentation of sulcal
regions of cortex. Unlike previous methods that extract the sulcal
spaces within the cortex, the proposed method extracts actual regions
of the cortical surface that surround sulci. Sulcal regions are.
segmented from the medial surface as well as the lateral and inferior
surfaces. The method first generates a depth map on the surface,
computed by measuring the distance between the cortex and ail outer
"shrink-wrap" surface. Sulcal regions are then extracted using a
hierarchical algorithm that alternates between thresholding and region
growing operations. To visualize the buried regions of the segmented
cortical surface, ail efficient technique for mapping the surface to a
sphere is proposed. Preliminary results are presented on the geometric
analysis of sulcal regions for automated identification.
|
424. | Frangi, AF, Niessen, WJ, Hoogeveen, RM, van Walsum, T, and Viergever, MA, "Quantitation of vessel morphology from 3D MRA," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION, MICCAI'99, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1679, pp. 358-367, 1999.
Abstract:
Three dimensional magnetic resonance angiographic images (3D MRA) are
routinely inspected using maximum intensity projections (MIP). However,
accuracy of stenosis estimates based on projections is limited.
Therefore, a method for quantitative 3D MRA is introduced. Linear
vessel segments are modeled with a central vessel axis curve coupled to
a vessel wall surface. First, the central vessel axis is determined.
Subsequently, the vessel wall is segmented using knowledge of the
acquisition process. The user interaction to initialize the model is
performed in a 3D setting. The method is validated on a carotid
bifurcation phantom and also illustrated on patient data.
|
425. | Guo, YL, and Vemuri, BC, "Hybrid geometric active models for shape recovery in medical images," INFORMATION PROCESSING IN MEDICAL IMAGING, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1613, pp. 112-125, 1999.
Abstract:
In this paper, we propose extensions to a powerful geometric shape
modeling scheme introduced in [14]. The extension allows the model to
automatically cope with topological changes and for the first time,
introduces the concept of a global shape into geometric/geodesic snake
models. The ability to characterize global shape of an object using
very few parameters facilitates shape learning and recognition. In this
new modeling scheme, object shapes are represented using a
parameterized function - called the generator - which accounts for the
global shape of an object and the pedal curve/surface of this global
shape with respect to a geometric snake to represent any local detail.
Traditionally, pedal curves/surfaces are defined as the loci of the
feet of perpendiculars to the tangents of the generator from a fixed
point called the pedal point. We introduce physics-based control for
shaping these geometric models by using distinct pedal points - lying
on a snake - for each point on the generator. The model dubbed as a
"snake pedal" allows for interactive manipulation via forces applied to
the snake. Automatic topological changes of the model may be achieved
by implementing the geometric active contour in a level-set framework.
We demonstrate the applicability of this modeling scheme via examples
of shape estimation from a variety of medical image data.
|
426. | Frangi, AF, Niessen, WJ, Hoogeveen, RM, van Walsum, T, and Viergever, MA, "Model-based quantitation of 3-D magnetic resonance angiographic images," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 18, pp. 946-956, 1999.
Abstract:
Quantification of the degree of stenosis or vessel dimensions are
important for diagnosis of vascular diseases and planning vascular
interventions, Although diagnosis from three-dimensional (3-D) magnetic
resonance angiograms (MRA's) is mainly performed on two-dimensional
(2-D) maximum intensity projections, automated quantification of
vascular segments directly from the 3-D dataset is desirable to provide
accurate and objective measurements of the 3-D anatomy.
A model-based method for quantitative 3-D MRA is proposed. Linear
vessel segments are modeled with a central vessel axis curve coupled to
a vessel wall surface. A novel image feature to guide the deformation
of the central vessel axis is introduced. Subsequently, concepts of
deformable models are combined with knowledge of the physics of the
acquisition technique to accurately segment the vessel wall and compute
the vessel diameter and other geometrical properties.
The method is illustrated and validated on a carotid bifurcation
phantom, with ground truth and medical experts as comparisons, Also,
results on 3-D time-of-flight (TOF) MRA images of the carotids are
shown, The approach is a promising technique to assess several
geometrical vascular parameters directly on the source 3-D images,
providing an objective mechanism for stenosis grading.
|
427. | Toyama, K, and Hager, GD, "Incremental focus of attention for robust vision-based tracking," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 35, pp. 45-63, 1999.
Abstract:
We present the Incremental Focus of Attention (IFA) architecture for
robust, adaptive, real-time motion tracking. IFA systems combine
several visual search and vision-based tracking algorithms into a
layered hierarchy. The architecture controls the transitions between
layers and executes algorithms appropriate to the visual environment at
hand: When conditions are good, tracking is accurate and precise; as
conditions deteriorate, more robust, yet less accurate algorithms take
over; when tracking is lost altogether, layers cooperate to perform a
rapid search for the target and continue tracking.
Implemented IFA systems are extremely robust to most common types of
temporary visual disturbances. They resist minor visual perturbances
and recover quickly after full occlusions, illumination changes, major
distractions, and target disappearances. Analysis of the algorithm's
recovery times are supported by simulation results and experiments on
real data. In particular, examples show that recovery times after lost
tracking depend primarily on the number of objects visually similar to
the target in the field of view.
|
428. | Ladret, P, Latombe, B, and Granada, F, "Active contour algorithm: An attractive tool for snow avalanche analysis," SIGNAL PROCESSING, vol. 79, pp. 197-204, 1999.
Abstract:
Image processing is increasingly used for the study of snow avalanches
in order to prevent them. The study of the dynamics of snow avalanches
has produced many numerical models. The difficulty of the measurement
of parameters provided by these models has prevented their validation
by comparison with those of real phenomena. Image processing is a first
approach for these validations. This study aims to determine and
analyse the velocity of the envelope in case of powder-snow avalanches.
This work is based on active snake methods. In this paper, we present a
new algorithm of active contours in order to analyse the front of
motion of snow avalanches. The algorithm uses an energy-minimising
curve. The model developed takes avalanche characteristics and the
nature of the images into account. The algorithm gives good results and
we obtain a sequence of avalanche contours. (C) 1999 Elsevier Science
B.V. All rights reserved.
|
429. | Unser, M, "Splines - A perfect fit for signal and image processing," IEEE SIGNAL PROCESSING MAGAZINE, vol. 16, pp. 22-38, 1999.
Abstract:
Image processing is increasingly used for the study of snow avalanches
in order to prevent them. The study of the dynamics of snow avalanches
has produced many numerical models. The difficulty of the measurement
of parameters provided by these models has prevented their validation
by comparison with those of real phenomena. Image processing is a first
approach for these validations. This study aims to determine and
analyse the velocity of the envelope in case of powder-snow avalanches.
This work is based on active snake methods. In this paper, we present a
new algorithm of active contours in order to analyse the front of
motion of snow avalanches. The algorithm uses an energy-minimising
curve. The model developed takes avalanche characteristics and the
nature of the images into account. The algorithm gives good results and
we obtain a sequence of avalanche contours. (C) 1999 Elsevier Science
B.V. All rights reserved.
|
430. | Xu, XY, Long, Q, Collins, MW, Bourne, M, and Griffith, TM, "Reconstruction of blood flow patterns in human arteries," PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART H-JOURNAL OF ENGINEERING IN MEDICINE, vol. 213, pp. 411-421, 1999.
Abstract:
Local haemodynamic factors in large arteries are associated with the
pathophysiology of cardiovascular diseases such as atherosclerosis and
strokes. In search of these factors and their correlation with atheroma
formation, quantitative haemodynamic data in realistic arterial
geometry become crucial. At present no in vivo non-invasive technique
is available that can provide accurate measurement of three-dimensional
blood velocities and shear stresses in curved and branching sites of
vessels where atherosclerotic plaques are found frequently. This paper
presents a computer modelling technique which combines state-of-the-art
computational fluid dynamics (CFD) with new noninvasive magnetic
resonance imaging techniques to provide the complete haemodynamic data
in 'real' arterial geometries. Using magnetic resonance angiographic
and velocity images acquired from the aortic bifurcation of a healthy
human subject, CFD simulations have been carried out and the predicted
flow patterns demonstrate the non-planar-type flow characteristics
found in experimental studies.
|
431. | Aubert, G, and Blanc-Feraud, L, "Some remarks on the equivalence between 2D and 3D classical snakes and geodesic active contours," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 34, pp. 19-28, 1999.
Abstract:
Recently, Caselles et al. have shown the equivalence between a
classical snake problem of Kass et al. and a geodesic active contour
model. The PDE derived from the geodesic problem gives an evolution
equation for active contours which is very powerfull for image
segmentation since changes of topology are allowed using the level set
implementation. However in Caselles' paper the equivalence with
classical snake is only shown for 2D images and 1D curves, by using
concepts of Hamiltonian theory which have no meanings for active
surfaces. This paper propose to examine the notion of equivalence and
to revisite Caselles et al. arguments. Then a notion equivalence is
introduced and shown for classical snakes and geodesic active contours
in the 2D (active contour) and 3D (active surface) case.
|
432. | Salden, AH, Romeny, BMT, and Viergever, MA, "Linearised euclidean shortening flow of curve geometry," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 34, pp. 29-67, 1999.
Abstract:
The geometry of a space curve is described in terms of a Euclidean
invariant frame field, metric, connection, torsion and curvature. Here
the torsion and curvature of the connection quantify the curve
geometry. In order to retain a stable and reproducible description of
that geometry, such that it is slightly affected by non-uniform
protrusions of the curve, a linearised Euclidean shortening flow is
proposed. (Semi)-discretised versions of the flow subsequently
physically realise a concise and exact (semi-)discrete curve geometry.
Imposing special ordering relations the torsion and curvature in the
curve geometry can be retrieved on a multi-scale basis not only for
simply closed planar curves but also for open, branching, intersecting
and space curves of non-trivial knot type. In the context of the
shortening flows we revisit the maximum principle, the semi-group
property and the comparison principle normally required in scale-space
theories. We show that our linearised flow satisfies an adapted maximum
principle, and that its Green's functions possess a semi-group
property. We argue that the comparison principle in the case of knots
can obstruct topological changes being in contradiction with the
required curve simplification principle. Our linearised flow paradigm
is not hampered by this drawback; all non-symmetric knots tend to
trivial ones being infinitely small circles in a plane. Finally, the
differential and integral geometry of the multi-scale representation of
the curve geometry under the flow is quantified by endowing the
scale-space of curves with an appropriate connection, and calculating
related torsion and curvature aspects. This multi-scale modern
geometric analysis forms therewith an alternative for curve description
methods based on entropy scale-space theories.
|
433. | Weerasinghe, C, Yan, H, and Ji, LL, "A fast method for estimation of object rotation function in MRI using a similarity criterion among k-space overlap data," SIGNAL PROCESSING, vol. 78, pp. 215-230, 1999.
Abstract:
A major obstacle to the success of post-processing artifact correction
techniques in magnetic resonance imaging (MRI) is the scarcity of
reliable motion estimation algorithms. Most on-line motion estimation
schemes demand patient preparation, modifications to standard spin-echo
pulse sequences and increased scanning times. Therefore, off-line
motion estimation algorithms have gained interest in the research
arena. However, the existing algorithms are plagued by high
computational and time demands that restrict the estimation capability
to only a few motion parameters. This paper presents an efficient
off-line motion estimation algorithm with applications to in-plane
rotational motion artifact correction in MRI. The algorithm is based on
maximizing the similarity among the k-space data subjected to angular
overlap. The initial guesses are derived from measuring projection
width of X-directional inverse Fourier transforms of the acquired
k-space views. Simulation studies involving stepwise and continuous
rotation show that the proposed method can accurately estimate rotation
angles corresponding to each view. This method has been incorporated in
a rotational motion artifact correction scheme, previously developed by
the authors, producing successful results. (C) 1999 Elsevier Science
B.V. All rights reserved.
|
434. | Aletras, AH, Balaban, RS, and Wen, H, "High-resolution strain analysis of the human heart with fast-DENSE," JOURNAL OF MAGNETIC RESONANCE, vol. 140, pp. 41-57, 1999.
Abstract:
Single breath-hold displacement data from the human heart were acquired
with fast-DENSE (fast displacement encoding with stimulated echoes)
during systolic contraction at 2.5 x 2.5 mm in-plane resolution.
Encoding strengths of 0.86-1.60 mm/pi were utilized in order to extend
the dynamic range of the phase measurements and minimize effects of
physiologic and instrument noise. The noise level in strain
measurements for both contraction and dilation corresponded to a strain
value of 2.8%. In the human heart, strain analysis has sufficient
resolution to reveal transmural variation across the left ventricular
wall. Data processing required minimal user intervention and provided a
rapid quantitative feedback. The intrinsic temporal integration of
fast-DENSE achieves high accuracy at the expense of temporal resolution.
|
435. | Cagnoni, S, Dobrzeniecki, AB, Poli, R, and Yanch, JC, "Genetic algorithm-based interactive segmentation of 3D medical images," IMAGE AND VISION COMPUTING, vol. 17, pp. 881-895, 1999.
Abstract:
This article describes a method for evolving adaptive procedures for
the contour-based segmentation of anatomical structures in 3D medical
data sets. With this method, the user first manually traces one or more
2D contours of an anatomical structure of interest on parallel planes
arbitrarily cutting the data set. Such contours are then used as
training tramples for a genetic algorithm to evolve a contour detector.
By applying the detector to the rest of the image sequence it is
possible to obtain a full segmentation of the structure. The same
detector can then be used to segment other image sequences of the same
sort. Segmentation is driven by a contour-tracking strategy that relies
on an elastic-contour model whose parameters are also optimized by the
genetic algorithm. We report results obtained on a software-generated
phantom and on real tomographic images of different sorts. (C) 1999
Elsevier Science B.V. All rights reserved.
|
436. | Sakalli, M, Yan, H, and Fu, A, "A region-based scheme using RKLT and predictive classified vector quantization," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 75, pp. 269-280, 1999.
Abstract:
This paper proposes a compression scheme for face profile images based
on three stages, modelling, transformation, and the partially
predictive classified vector quantization (CVQ) stage. The modelling
stage employs deformable templates in the localisation of salient
features of face images and in the normalization of the image content.
The second stage uses a dictionary of feature-bases trained for profile
face images to diagonalize the image blocks. At this stage, all
normalized training and test images are spatially clustered
(objectively) into four subregions according to their energy content,
and the residuals of the most important clusters are further clustered
(subjectively) in the spectral domain, to exploit spectral
redundancies. The feature-basis functions are established with the
region-based Karhunen-Loeve transform (RKLT) of clustered image blocks.
Each image block is matched with a representative of near-best basis
functions. A predictive approach is employed for mid-energy clusters,
in both stages of search for a basis and for a codeword from the range
of its cluster. The proposed scheme employs one stage of a cascaded
region-based KLT-SVD and CVQ complex, followed by residual VQ stages
for subjectively important regions. The first dictionary of
feature-bases is dedicated to the main content of the image and the
second is dedicated to the residuals. The proposed scheme is
experimented in a set of human face images. (C) 1999 Academic Press.
|
437. | Astrom, K, Cipolla, R, and Giblin, P, "Generalised epipolar constraints," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 33, pp. 51-72, 1999.
Abstract:
In this paper we will discuss structure and motion problems for curved
surfaces. These will be studied using the silhouettes or apparent
contours in the images. The problem of determining camera motion from
the apparent contours of curved three-dimensional surfaces, is studied.
It will be shown how special points, called epipolar tangency points or
frontier points, can be used to solve this problem. A generalised
epipolar constraint is introduced, which applies to points, curves, as
well as to apparent contours of surfaces. The theory is developed for
both continuous and discrete motion, known and unknown orientation,
calibrated and uncalibrated, perspective, weak perspective and
orthographic cameras. Results of an iterative scheme to recover the
epipolar line structure from real image sequences using only the
outlines of curved surfaces, is presented. A statistical evaluation is
performed to estimate the stability of the solution. It is also shown
how the motion of the camera from a sequence of images can be obtained
from the relative motion between image pairs.
|
438. | Xu, CY, Pham, DL, Rettmann, ME, Yu, DN, and Prince, JL, "Reconstruction of the human cerebral cortex from magnetic resonance images," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 18, pp. 467-480, 1999.
Abstract:
Reconstructing the geometry of the human cerebral cortex from MR images
is an important step in both brain mapping and surgical path planning
applications, Difficulties with imaging noise, partial volume
averaging, image intensity inhomogeneities, convoluted cortical
structures, and the requirement to preserve anatomical topology make
the development of accurate automated algorithms particularly
challenging. In this paper ne address each of these problems and
describe a systematic method for obtaining a surface representation of
the geometric central layer of the human cerebral cortex. Using fuzzy
segmentation, an isosurface algorithm, and a deformable surface model,
the method reconstructs the entire cortex with the correct topology,
including deep convoluted sulci and gyri. The method is largely
automated and its results are robust to imaging noise, partial volume
averaging, and image intensity inhomogeneities. The performance of this
method is demonstrated, both qualitatively and quantitatively and the
results of its application to sis subjects and one simulated MR brain
volume are presented.
|
439. | Lee, JD, "Wavelet transform for 3-D reconstruction from series sectional medical images," MATHEMATICAL AND COMPUTER MODELLING, vol. 30, pp. 1-13, 1999.
Abstract:
It is well known that the 3-D shape of an organ can be reconstructed
from a series of cross-sectional images of human body using ultrasound,
Computer Topography (CT), or Magnetic Resonance Imaging (MRI). From the
reconstructed images, qualitative evaluation, quantitative analysis,
and other further clinical research become possible. In this paper, a
novel interpolation technique that utilizes the whole object contour
information and with no need of feature matching for object
reconstruction is proposed. In the method, multiresolution analysis of
the object contour of each slices is carried out by using the Wavelet
Transformation (WT). The primary contour of the interslices is
reconstructed from the coarsest scale information of the slices, while
the refined contours are estimated by taking into account the lower
scale information of slices. To evaluate the performance of the
proposed method and the traditional method, a performance measure is
proposed and the experimental results are also included, (C) 1999
Elsevier Science Ltd. All rights reserved.
|
440. | Knoll, C, Alcaniz, M, Grau, V, Monserrat, C, and Juan, MC, "Outlining of the prostate using snakes with shape restrictions based on the wavelet transform (Doctoral Thesis: Dissertation)," PATTERN RECOGNITION, vol. 32, pp. 1767-1781, 1999.
Abstract:
This paper considers the problem of deformable contour initialization
and modeling for segmentation of the human prostate in medical images.
We propose a new technique for elastic deformation restriction to
particular object shapes of any closed planar curve using localized
multiscale contour parameterization based on the 1D dyadic wavelet
transform. For this purpose we define internal curve deformation forces
as a result of multiscale parametrical contour analysis. The form
restricted contour deformation and its initialization by template
matching are performed in a coarse to fine segmentation process based
on a multiscale image edge representation containing the important
edges of the image at various scales. The method is useful for 3D
conformal radiotherapy planning and automatic prostate volume
measurements in ultrasonographic diagnosis. (C) 1999 Pattern
Recognition Society. Published by Elsevier Science Ltd. All rights
reserved.
|
441. | Huang, WC, Hsu, CC, Lee, C, and Lai, PH, "Recurrent nasal tumor detection by dynamic MRI," IEEE ENGINEERING IN MEDICINE AND BIOLOGY MAGAZINE, vol. 18, pp. 100-105, 1999.
Abstract:
This paper considers the problem of deformable contour initialization
and modeling for segmentation of the human prostate in medical images.
We propose a new technique for elastic deformation restriction to
particular object shapes of any closed planar curve using localized
multiscale contour parameterization based on the 1D dyadic wavelet
transform. For this purpose we define internal curve deformation forces
as a result of multiscale parametrical contour analysis. The form
restricted contour deformation and its initialization by template
matching are performed in a coarse to fine segmentation process based
on a multiscale image edge representation containing the important
edges of the image at various scales. The method is useful for 3D
conformal radiotherapy planning and automatic prostate volume
measurements in ultrasonographic diagnosis. (C) 1999 Pattern
Recognition Society. Published by Elsevier Science Ltd. All rights
reserved.
|
442. | Kozerke, S, Botnar, R, Oyre, S, Scheidegger, MB, Pedersen, EM, and Boesiger, P, "Automatic vessel segmentation using active contours in cine phase contrast flow measurements," JMRI-JOURNAL OF MAGNETIC RESONANCE IMAGING, vol. 10, pp. 41-51, 1999.
Abstract:
The segmentation of images obtained by cine magnetic resonance (MR)
phase contrast velocity mapping using manual or semi-automated methods
is a time consuming and observer-dependent process that still hampers
the use of now quantification in a clinical setting. A fully automatic
segmentation method based on active contour model algorithms for
defining vessel boundaries has been developed, For segmentation, the
phase image, in addition to the magnitude image, is used to address
image distortions frequently seen in the magnitude image of disturbed
now fields. A modified definition for the active contour model is
introduced to reduce the influence of missing or spurious edge
information of the vessel wall. The method was evaluated on now phantom
data and on in vivo images acquired in the ascending aorta of humans.
Phantom experiments resulted in an error of 0.8% in assessing the
luminal area of a now phantom equipped with an artificial heart valve.
Blinded evaluation of the volume now rates from automatic vs. manual
segmentation of gradient echo (FFE) phase contrast images obtained in
vivo resulted in a mean difference of -0.9 +/- 3%. The mean difference
from automatic vs. manual segmentation of images acquired with a hybrid
phase contrast sequence (TFEPI) within a single breath-hold was -0.9
+/- 6%. J. Magn. Reson. Imaging 1999: 10:41-51. (C) 1999 Wiley-Liss,
Inc.
|
443. | Zhao, BS, Yankelevitz, D, Reeves, A, and Henschke, C, "Two-dimensional multi-criterion segmentation of pulmonary nodules on helical CT images," MEDICAL PHYSICS, vol. 26, pp. 889-895, 1999.
Abstract:
A multi-criterion algorithm for automatic delineation of small
pulmonary nodules on helical CT images has been developed. In a
slice-by-slice manner, the algorithm uses density, gradient strength,
and a shape constraint of the nodule to automatically control
segmentation process. The multiple criteria applied to separation of
the nodule from its surrounding structures in lung are based on the
fact that typical small pulmonary nodules on CT images have high
densities, show a distinct difference in density at the boundary, and
tend to be compact in shape. Prior to the segmentation, a
region-of-interest containing the nodule is manually selected on the CT
images. Then the segmentation process begins with a high density
threshold that is decreased stepwise, resulting in expansion of the
area of nodule candidates. This progressive region growing approach is
terminated when subsequent thresholds provide either a diminished
gradient strength of the nodule contour or significant changes of
nodule shape :from the compact form. The shape criterion added to the
algorithm can effectively prevent the high density surrounding
structures (e.g., blood vessels) from being falsely segmented as
nodule, which occurs frequently when only the gradient strength
criterion is applied. This has been demonstrated by examples given in
the Results section. The algorithm's accuracy has been compared with
that of radiologist's manual segmentation, and no statistically
significant difference has been found between the nodule areas
delineated by radiologist and those obtained by the multi-criterion
algorithm. The improved nodule boundary allows for more accurate
assessment of nodule size and hence nodule growth over a short time
period, and for better characterization of nodule edges. This
information is useful in determining malignancy status of a nodule at
an early stage and thus provides significant guidance for further
clinical management. (C) 1999 American Association of Physicists in
Medicine.
|
444. | Levienaise-Obadia, B, and Gee, A, "Adaptive segmentation of ultrasound images," IMAGE AND VISION COMPUTING, vol. 17, pp. 583-588, 1999.
Abstract:
This article describes a novel approach to the semi-automatic
segmentation of ultrasound images. Assisted segmentation is
particularly attractive when processing many slices through a 3D data
set, and even though fully automatic segmentation would be ideal, this
is currently not feasible given the quality of ultrasound images. The
algorithm developed in this article is based on the active contour
paradigm, with several important modifications. The contour is
attracted to boundaries described locally by statistical models: this
allows for the fact that the definition of what constitutes a boundary
may vary around the boundary's length. The statistical models are
trained on-the-fly by observing boundaries accepted by the operator. In
this way, operator intervention in a particular slice is sensibly
exploited to reduce the need for intervention in subsequent slices. The
resulting algorithm provides fast, reliable and verifiable segmentation
of in vivo ultrasound images. (C) 1999 Elsevier Science B.V. All rights
reserved.
|
445. | Peterfreund, N, "Robust tracking of position and velocity with Kalman snakes," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 21, pp. 564-569, 1999.
Abstract:
A new Kalman-filter based active contour model is proposed for tracking
of nonrigid objects in combined spatio-velocity space. The model
employs measurements of gradient-based image potential and of
optical-flow along the contour as system measurements. In order to
improve robustness to image clutter and to occlusions an optical-flow
based detection mechanism is proposed. The method detects and rejects
spurious measurements which are not consistent with previous estimation
of image motion.
|
446. | Mayer, H, "Automatic object extraction from aerial imagery - A survey focusing on buildings," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 74, pp. 138-149, 1999.
Abstract:
This paper surveys the state-of-the-art automatic object extraction
techniques from aerial imagery. It focuses on building extraction
approaches, which present the majority of the work in this area. After
proposing well-defined criteria for their assessment, characteristic
approaches are selected and assessed, based on their models and
strategies. The assessment gives rise to a combined model and strategy
covering the current knowledge in the field. The model comprises: the
derivation of characteristic properties from the function of objects;
three-dimensional geometry and material properties; scales and levels
of abstraction/aggregation; local and global context. The strategy
consists of grouping, focusing on different scales, context-based
control and generation of evidence from structures of parts, and fusion
of data and algorithms. Many ideas which have not been explored in
depth lead to promising directions for further research. (C) 1999
Academic Press.
|
447. | Malassiotis, S, and Strintzis, MG, "Tracking the left ventricle in echocardiographic images by learning heart dynamics," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 18, pp. 282-290, 1999.
Abstract:
In this paper a temporal learning-filtering procedure is applied to
refine the left ventricle (LV) boundary detected by an active-contour
model. Instead of making prior assumptions about the LV shape or its
motion, this information is incrementally gathered directly from the
images and is exploited to achieve more coherent segmentation, A Hough
transform technique is used to find an initial approximation of the
object boundary at the first frame of the sequence, Then, an
active-contour model is used in a coarse-to-fine framework, for the
estimation of a noisy LV boundary, The PCA transform is applied to form
a reduced ordered orthonormal basis of the LV deformations based on a
sequence of noisy boundary observations. Then this basis is used to
constrain the motion of the active contour in subsequent frames, and
thus provide more coherent identification. Results of epicardial
boundary identification in E-mode images are presented.
|
448. | Udupa, JK, "Three-dimensional visualization and analysis methodologies: A current perspective," RADIOGRAPHICS, vol. 19, pp. 783-806, 1999.
Abstract:
Three-dimensional (3D) imaging was developed to provide both
qualitative and quantitative information about an object or object
system from images obtained with multiple modalities including digital
radiography, computed tomography, magnetic resonance imaging, positron
emission tomography, single photon emission computed tomography, and
ultrasonography, Three-dimensional imaging operations may be classified
under four basic headings: preprocessing, visualization, manipulation,
and analysis. Preprocessing operations (volume of interest, filtering,
interpolation, registration, segmentation) are aimed at extracting or
improving the extraction of object information in given images.
Visualization operations facilitate seeing and comprehending objects in
their full dimensionality and may be either scene-based or
object-based. Manipulation may be either rigid or deformable acid
allows alteration of object structures and of relationships between
objects. Analysis operations, like visualization operations, may be
either scene-based or object-based and deal with methods of quantifying
object information. There are many challenges involving matters of
precision, accuracy, and efficiency in 3D imaging. Nevertheless, 3D
imaging is an exciting technology that promises to offer an expanding
number and variety of applications.
|
449. | Kuijer, JPA, Marcus, JT, Gotte, MJW, van Rossum, AC, and Heethaar, RM, "Simultaneous MRI tagging and through-plane velocity quantification: A three-dimensional myocardial motion tracking algorithm," JMRI-JOURNAL OF MAGNETIC RESONANCE IMAGING, vol. 9, pp. 409-419, 1999.
Abstract:
A tracking algorithm was developed for calculation of three-dimensional
point-specific myocardial motion. The algorithm was designed for images
acquired with simultaneous magnetic resonance imaging (MRI) grid
tagging and through-plane velocity quantification. The tagging grid
provided the in-plane motion while the velocity quantification measured
the through-plane motion, In four healthy volunteers, the in vivo
performance was evaluated by comparing the systolic through-plane
displacement with the displacement of tagging-grid intersections in
long-axis images, The correlation coefficient was 0.93 (P < 0.001, N =
183), A t-test for paired samples revealed a small underestimation of
the through-plane displacement by 0.04 +/- 0.09 cm (mean +/- SD, P <
0.001) on an average displacement of 0.77 +/- 0.23 cm toward the apex.
The authors conclude that three-dimensional point-specific motion
tracking based on simultaneous tagging and velocity quantification is
competitive with other methods such as tagging in mutually orthogonal
image planes or quantification of three orthogonal velocity components,
(C) 1999 Wiley-Liss, Inc.
|
450. | Shufelt, JA, "Performance evaluation and analysis of monocular building extraction from aerial imagery," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 21, pp. 311-326, 1999.
Abstract:
Research in monocular building extraction from aerial imagery has
neglected performance evaluation in three areas: unbiased metrics for
quantifying detection and delineation performance, an evaluation
methodology for applying these metrics to a representative body of test
imagery, and an approach for understanding the impact of image and
scene content on building extraction algorithms. This paper addresses
these areas with an end-to-end performance evaluation of four existing
monocular building extraction systems, using image space and object
space-based metrics on 83 test images of 18 sites. This analysis is
supplemented by an examination of the effects of image obliquity and
object complexity on system performance, as well as a case study on the
effects of edge fragmentation. This widely applicable performance
evaluation approach highlights the consequences of various traditional
assumptions about camera geometry, image content, and scene structure,
and demonstrates the utility of rigorous photogrammetric object space
modeling and primitive-based representations for building extraction.
|
451. | Schnabel, JA, and Arridge, SR, "Active shape focusing," IMAGE AND VISION COMPUTING, vol. 17, pp. 419-428, 1999.
Abstract:
This paper presents a framework for hierarchical shape description
which enables quantitative and qualitative shape studies at multiple
levels of image detail. It allows the capture of the global object
shape at higher image scales, and to focus it down to finer details at
decreasing levels of image scale. A multi-scale active contour model,
whose energy function is regularized with respect to underlying
geometric image structure in a natural scale setting, is developed for
the purpose of implicit shape extraction or regularization with respect
to scale. The resulting set of shapes is formulated and visualized as a
multi-scale shape stack for the investigation of shape changes across
scales. We demonstrate the functionality of this framework by applying
it to a set of true fractal structures, and to 3D brain MRI. The
framework is shown to be capable of recovering the fractal dimension of
the fractal shapes directly from their embedding image context. The
equivalent measure on the medical images and its potential for medical
shape analysis is discussed. (C) 1999 Elsevier Science B.V. All rights
reserved.
|
452. | Morris, DT, and Donnison, C, "Identifying the neuroretinal rim boundary using dynamic contours," IMAGE AND VISION COMPUTING, vol. 17, pp. 169-174, 1999.
Abstract:
The neuroretinal rim forms the outer boundary of the optic nerve head:
that region of the retina where blood vessels and nerve fibres pass out
of the eye. It is normally a circular structure, but is known to change
shape due to nerve damage in glaucoma. Its shape can therefore be used
in the diagnosis and assessment of the treatment of this disease.
Automatically finding the boundary would be useful as it would allow
reliable quantitative shape measurements to be made. However, it is a
difficult problem as the boundary is ill defined and partially obscured
by blood vessels. In this paper we present an algorithm that
successfully identifies the boundary using dynamic contours (snakes).
The success of the algorithm is very dependent on preprocessing the
image to enhance the contrast between the retina and the optic nerve
head. We therefore describe the preprocessing in some detail. The
algorithm has been tested on numerous images and found to be
successful, as judged by an optometrist, in every case. (C) 1999
Elsevier Science B.V. All rights reserved.
|
453. | Horritt, MS, "A statistical active contour model for SAR image segmentation," IMAGE AND VISION COMPUTING, vol. 17, pp. 213-224, 1999.
Abstract:
A statistical active contour model is developed for segmenting
synthetic aperture radar (SAR) images into regions of homogeneous
speckle statistics. The technique measures both the local tone and
texture along the contour so that no smoothing across segment
boundaries occurs. A smooth contour is favoured by the inclusion of a
curvature constraint, whose weight is determined analytically by
considering the model energy balance. The algorithm spawns smaller
snakes to represent multiply connected regions. The algorithm is
capable of segmenting noisy SAR imagery whilst accurately depicting (to
within 1 pixel) segment boundaries. (C) 1999 Elsevier Science B.V. All
rights reserved.
|
|
|
2000 |
454. | Araabi, BN, Kehtarnavaz, N, McKinney, T, Hillman, G, and Wursig, B, "A string matching computer-assisted system for dolphin photoidentification," ANNALS OF BIOMEDICAL ENGINEERING, vol. 28, pp. 1269-1279, 2000.
Abstract:
This paper presents a syntactic/semantic string representation scheme
as well as a string matching method as part of a computer-assisted
system to identify dolphins from photographs of their dorsal fins. A
low-level string representation is constructed from the curvature
function of a dolphin's fin trailing edge, consisting of positive and
negative curvature primitives. A high-level string representation is
then built over the low-level string via merging appropriate groupings
of primitives in order to have a less sensitive representation to
curvature fluctuations or noise. A family of syntactic/semantic
distance measures between two strings is introduced. A composite
distance measure is then defined and used as a dissimilarity measure
for database search, highlighting both the syntax (structure or
sequence) and semantic (attribute or feature) differences. The syntax
consists of an ordered sequence of significant protrusions and
intrusions on the edge, while the semantics consist of seven attributes
extracted from the edge and its curvature function-The matching results
are reported for a database of 624 images corresponding to 164
individual dolphins. The identification results indicate that the
developed string matching method performs better than the previous
matching methods including dorsal ratio, curvature, and curve matching.
The developed computer-assisted system can help marine mammalogists in
their identification of dolphins, since it allows them to examine only
a handful of candidate images instead of the currently used manual
searching of the entire database. (C) 2000 Biomedical Engineering
Society. [S0090-6964(00)00510-5].
|
455. | Froumentin, M, Labrosse, F, and Willis, P, "A vector-based representation for image warping," COMPUTER GRAPHICS FORUM, vol. 19, pp. C419-+, 2000.
Abstract:
A method for image analysis, representation and re-synthesis is
introduced. Unlike other schemes it is not pixel based but rather
represents a picture as vector data, from which an altered version of
the original image can be rendered. Representing an image as vector
data allows performing operations such as zooming, retouching or
colourising, avoiding common problems associated with pixel image
manipulation.
This paper brings together methods from the areas of computer vision,
image compositing and image based rendering to prove that this type of
image representation is a step towards accurate and efficient image
manipulation.
|
456. | Sarti, A, de Solorzano, CO, Lockett, S, and Malladi, R, "A geometric model for 3-D confocal image analysis," IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, vol. 47, pp. 1600-1609, 2000.
Abstract:
In this paper, we use partial-differential-equation-based filtering as
a preprocessing add post processing strategy for computer-aided
cytology, We wish to accurately extract and classify. the shapes of
nuclei from confocal microscopy images, which is a prerequisite to an
accurate quantitative intranuclear (genotypic and phenotypic) and
internuclear (tissue structure) analysis of tissue and cultured
specimens. First, we study the use of a geometry-driven edge-preserving
image smoothing mechanism before nuclear segmentation. We show how this
biter outperforms other widely-used filters in that it provides higher
edge fidelity. Then we apply the same filter,,vith a different initial
condition, to smooth nuclear surfaces and obtain sub-pixel accuracy.
Finally we use another instance of the geometrical filter to correct
for misinterpretations of the nuclear surface by the segmentation
algorithm. Our prefiltering and post filtering nicely complements our
initial segmentation strategy, in that it provides substantial and
measurable improvement in the definition of the nuclear surfaces.
|
457. | Fu, Y, Erdem, AT, and Tekalp, AM, "Tracking visible boundary of objects using occlusion adaptive motion snake," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 9, pp. 2051-2060, 2000.
Abstract:
We propose a novel technique for tracking the visible boundary of a
video object in the presence of occlusion, Starting with an initial
contour that is interactively specified by the user and may be
automatically refined by using intraenergy terms, the proposed
technique employs piecewise contour prediction using local motion and
color information on both sides of the contour segment, and contour
snapping using scale-invariant intraframe and interframe energy terms.
The piecewise (segmented) nature of the contour prediction scheme and
modeling of the motion on both sides of each contour segment enable
accurate determination of whether and where the tracked boundary is
occluded by another object. The proposed snake energy terms are
associated with contour segments (as opposed to node points) and they
are scale/resolution independent to allow multi-resolution contour
tracking without the need to retune the weights of the energy terms at
each resolution level. This facilitates contour prediction at coarse
resolution and snapping at fine resolution with high accuracy.
Experimental results are provided to illustrate the performance of the
proposed occlusion detection algorithm and the novel snake energy terms
that enable visible boundary tracking in the presence of occlusion.
|
458. | Vanegas, O, Tokuda, K, and Kitamura, T, "Lip location normalized training for visual speech recognition," IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, vol. E83D, pp. 1969-1977, 2000.
Abstract:
This paper describes a method to normalize the lip position for
improving the performance of a visual-information-based speech
recognition system. Basically, there are two types of information
useful in speech recognition processes; the first one is the speech
signal itself and the second one is the visual information from the
lips in motion. This paper tries to solve some problems caused by using
images from the lips in motion such as the effect produced by the
Variation of the lip location. The proposed lip location normalization
method is based on a search algorithm of the lip position in which the
location normalization is integrated into the model training.
Experiments of speaker-independent isolated word recognition were
carried out on the Tulips1 and M2VTS databases. Experiments showed a
recognition rate of 74.5% and an error reduction rate of 35.7% for the
ten digits word recognition M2VTS database.
|
459. | Furukawa, T, Gu, J, Lee, WS, and Magnenat-Thalmann, N, "3D clothes modeling from photo cloned human body," VIRTUAL WORLDS, LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, vol. 1834, pp. 159-170, 2000.
Abstract:
An important advantage of virtual reality technology is that real 3D
objects including humans can be edited in the virtual world. In this
paper, we present a technique for 3D clothes modeling based on a photo
cloned human body. Photo cloning is an efficient 3D human body modeling
method using a generic body model and photographs. A part segmentation
technique for 3D color objects is applied for the clothes modeling,
which uses multi-dimensional mixture Gaussians fitting. Firstly, we
construct a 6D point set representing both the geometric and color
information Next, the mixture Gaussians are fitted to the point set by
using the EM algorithm in order to determine the clusters. This
approximation gives probabilities for each point. Finally the
probabilities determine the segmented part models corresponding to the
clothes models. An advantage of this method is that the clustering is
unsupervised learning without any prior knowledge as well as
integrating geometric and color data in multi-dimensional space.
|
460. | Ding, ZH, and Friedman, MH, "Quantification of 3-D coronary arterial motion using clinical biplane cineangiograms," INTERNATIONAL JOURNAL OF CARDIAC IMAGING, vol. 16, pp. 331-346, 2000.
Abstract:
Speculation that the motion of the coronary arteries might be involved
in the pathogenesis of coronary atherosclerosis has generated growing
interest in the study of this motion. Accordingly, a system has been
developed to quantify 3-D coronary arterial motion using clinical
biplane cineangiograms. Exploiting the temporal continuity of
sequential angiographic images, a template matching technique is
designed to track the non-uniform frame-to-frame motion of coronary
arteries without assuming that the vessels experience uniform axial
strain. The implementation of the system is automated by a
coarse-to-fine matching process, thus improving the efficiency and
objectivity of motion analysis. The system has been validated and
employed to characterize the in vivo motion dynamics of human coronary
arteries; illustrative results show that this system is a promising
tool for routine clinical and laboratory analysis of coronary arterial
motion.
|
461. | Wu, RY, Ling, KV, and Ng, WS, "Automatic prostate boundary recognition in sonographic images using feature model and genetic algorithm," JOURNAL OF ULTRASOUND IN MEDICINE, vol. 19, pp. 771-782, 2000.
Abstract:
This paper describes the development of a model based boundary
recognition system for transrectal prostate ultrasonographic images. It
consists of two techniques: boundary modeling and boundary searching
with model constraints. To achieve higher specificity of the model, a
method called feature modeling is derived from the existing point
distribution modeling method. To improve the robustness of the
searching technique, the genetic algorithm is used. Incremental genetic
algorithm with crowding replacement and binary string chromosome type
was found experimentally to give good search results. It was shown that
the system could recognize the boundary with considerable accuracy and
consistency within a few minutes in transrectal ultrasonographic images
taken from approximate middle position of the prostate.
|
462. | Leavers, VF, "Use of the two-dimensional Radon Transform to generate a taxonomy of shape for the characterization of abrasive powder particles," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 22, pp. 1411-1423, 2000.
Abstract:
A novel image processing technique for the extraction of parameters
characteristic of the shape and angularity of abrasive powder particles
is proposed. The image data are not analyzed directly. Information
concerning angularity and shape is extracted from the parametric
transformation of the 2D binarized edge map. The transformation process
used, the Radon Transform, is one to many, that is, each image point
generates in transform space the parameters of all the possible curves
on which it may lie and the resulting distribution is an accumulation
of that evidence. Once the image data are segmented, the technique has
the potential to deliver a comprehensive numerical description of the
shape and angularity of the particles under investigation without the
need for further interaction by the operator. The parameters obtained
are arranged into a Taxonomy according to their usefulness in
categorizing the shapes under inspection. The technique is novel in
that it offers an analytical definition of a corner and its apex and it
automatically selects only those protrusions coincident with the convex
hull of the shape and, hence, those most likely to contribute to the
process of abrasion. The advantages and potential pitfalls of using the
technique are illustrated and discussed using real image data.
|
463. | Chen, CM, and Lu, HHS, "An adaptive snake model for ultrasound image segmentation: Modified trimmed mean filter, ramp integration and adaptive weighting parameters," ULTRASONIC IMAGING, vol. 22, pp. 214-236, 2000.
Abstract:
The snake model is a widely-used approach to finding the boundary of
the object of interest in an ultrasound image. However, due to the
speckles, the weak edges and the tissue-related textures in an
ultrasound image, conventional snake models usually cannot obtain the
desired boundary satisfactorily. In this paper, we propose a new
adaptive snake model for ultrasound image segmentation. The proposed
snake model is composed of three major techniques, namely, the modified
trimmed mean (MTM) filtering, ramp integration and adaptive weighting
parameters. With the advantages of the mean and median filters, the MIM
filter is employed to alleviate the speckle interference in the
segmentation process. The weak edge enhancement by ramp integration
attempts to capture the slowly varying edges, which are hard to capture
by conventional snake models. The adaptive weighting parameter allows
weighting of each energy term to change adaptively during the
deformation process. The proposed snake model has been verified on the
phantom and clinical ultrasound images. The experimental results showed
that the proposed snake model achieves a reasonable performance with an
initial contour placed 10 to 20 pixels away from the desired boundary.
The mean minimal distances from the derived boundary to the desired
boundary have been shown to be less than 3.5 (for CNR greater than or
equal to 0.5) and 2.5 pixels, respectively, for the phantom and
ultrasound images.
|
464. | Zaritsky, R, Peterfreund, N, and Shimkin, N, "Velocity-Guided tracking of deformable contours in three dimensional space," COMPUTER VISION - ECCV 2000, PT I, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1842, pp. 251-266, 2000.
Abstract:
This paper presents a 3D active contour model for boundary tracking,
motion analysis and position prediction of non-rigid objects, which
applies stereo vision and velocity control to the class of deformable
contour models, known as snakes. The proposed contour evolves in three
dimensional space in reaction to a 3D potential function, which is
derived by projecting the contour onto the 2D stereo images. The
potential function is augmented by a velocity term, which is related to
the three dimensional velocity field along the contour, and is used to
guide the contour displacement between subsequent images. This leads to
improved spatio-temporal tracking performance, which is demonstrated
through experimental results with real and synthetic images. Good
tracking performance is obtained with as little as one iteration per
frame, which provides a considerable advantage for real time operation.
|
465. | Harari, D, Furst, M, Kiryati, N, Caspi, A, and Davidson, M, "Computer-based assessment of body image distortion in anorexia nervosa patients," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2000, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1935, pp. 766-775, 2000.
Abstract:
A computer-based method for the assessment of body image distortions in
anorexia nervosa and other eating-disordered patients is presented. At
the core of the method is a realistic pictorial simulation of lifelike
weight-changes, applied to a real source image of the patient. The
patients, using a graphical user interface, adjust their body shapes
until they meet their self-perceived appearance. Measuring the extent
of virtual fattening or slimming of a body with respect to its real
shape and size, allows direct, quantitative evaluation of the cognitive
distortion in body image. In a preliminary experiment involving 20
anorexia-nervosa patients, 70% of the subjects chose an image with
simulated visual weight gain of about 20% as their "real" body image.
None of them recognized the original body image, thus demonstrating the
quality of the transformed images. The method presented can be applied
in the research, diagnosis, evaluation and treatment of eating
disorders.
|
466. | Baert, SAM, Niessen, WJ, Meijering, EHW, Frangi, AF, and Viergever, MA, "Guide wire tracking during endovascular interventions," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2000, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1935, pp. 727-734, 2000.
Abstract:
A method is presented to extract and track the position of a guide wire
during endovascular interventions under X-ray fluoroscopy. The method
can be used to improve guide wire visualization in the low quality
fluoroscopy images. A two-step procedure is utilized to track the guide
wire in subsequent frames. First a rough estimate of the displacement
is obtained using a template matching procedure. Subsequently, the
position of the guide wire is determined by fitting the guide wire to a
feature image in which line-like structures are enhanced. In this
optimization step the influence of the scale at which the feature is
calculated and the additional value of using directional information is
investigated. The method is applied both on the original and
subtraction images. Using the proper parameter settings, the guide wire
could successfully be tracked based on the original images, in 141 out
of 146 frames from 5 image sequences.
|
467. | Jang, DS, Jang, SW, and Choi, HI, "Structured Kalman filter for tracking partially occluded moving objects," BIOLOGICALLY MOTIVATED COMPUTER VISION, PROCEEDING, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1811, pp. 248-257, 2000.
Abstract:
Moving object tracking is one of the most important techniques in
motion analysis and understanding, and it has many difficult problems
to solve. Especially estimating and tracking moving objects, when the
background and moving objects vary dynamically, are very difficult. The
Kalman filter has been used to estimate motion information and use the
information in predicting the appearance of targets in succeeding
frames. It is possible under such a complex environment that targets
may disappear totally or partially due to occlusion by other objects.
In this paper, we propose another version of the Kalman filter, to be
called Structured Kalman filter, which can successfully work its role
of estimating motion information under such a deteriorating condition
as occlusion. Experimental results allow that the suggested approach is
very effective in estimating and tracking non-rigid moving objects
reliably.
|
468. | Gatzoulis, L, Anderson, T, Pye, SD, O'Donnell, R, McLean, CC, and McDicken, WN, "Scanning techniques for three-dimensional forward-viewing intravascular ultrasound imaging," ULTRASOUND IN MEDICINE AND BIOLOGY, vol. 26, pp. 1461-1474, 2000.
Abstract:
Intravascular ultrasound (US) imaging is a useful tool for assessing
arterial disease and aiding treatment procedures. Forward-viewing
intravascular US imaging could be of particular use in severely
stenosed or totally occluded arteries, where the current side-viewing
intravascular US systems are limited by their inability to access the
site of interest. In this study, five 3-D forward-viewing intravascular
scanning patterns were investigated. The work was carried out using
scaled-up vessel phantoms constructed from tissue-mimicking material
and a PC-controlled scanning and acquisition system. The scanning
patterns were examined and evaluated with regard to the image quality
of dense and sparse data sets, the accuracy of quantitative
measurements of lumen dimensions and the potential for clinical use.
The relative merits and drawbacks of the different patterns are
discussed and a preferred scanning pattern is recommended. (C) 2001
World Federation for Ultrasound in Medicine & Biology.
|
469. | Murino, V, and Trucco, A, "Three-dimensional image generation and processing in underwater acoustic vision," PROCEEDINGS OF THE IEEE, vol. 88, pp. 1903-1946, 2000.
Abstract:
Underwater exploration is becoming more and more important for many
applications involving physical, biological, geological,
archaeological, and industrial issues. Unfortunately, only a small
percentage of potential resources has been exploited under the sea. The
inherent structureless environment and the difficulties implied by the
nature of the propagating medium have placed limitations on the sensing
and the understanding of the underwater world. Typically, acoustic
imaging systems are widely utilized for both large- and small-scale
underwater investigations, as they can more easily achieve short and
large visibility ranges, though at the expense of a coarse resolution
and a poor visual quality.
This paper aims at surveying the up-to-date advances in acoustic
acquisition systems and data processing techniques, especially focusing
on three-dimensional (3-D) short-range imaging for scene reconstruction
and understanding. In fact, the advent of smarter and more efficient
imaging systems has allowed the generation of good-quality
high-resolution images and the related design of proper techniques for
underwater scene understanding. The term acoustic vision is introduced
to generally describe all data processing (especially image processing)
methods devoted to the interpretation of a scene. Since acoustics is
also used for medical applications, a short overview of the related
systems for biomedical acoustic image formation is provided.
The final goal of the paper is to establish the state of the art of the
techniques and algorithms for acoustic image generation and processing,
providing technical details and results for the most promising
techniques, and pointing out the potential capabilities of this
technology for underwater scene understanding.
|
470. | Zeng, ZH, and Ma, SD, "Real-time face tracking under partial occlusion and illumination change," ADVANCES IN MULTIMODAL INTERFACES - ICMI 2000, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1948, pp. 135-142, 2000.
Abstract:
In this paper, we present an approach which tracks human faces robustly
in real-time applications by taking advantage of both region matching
and active contour model. Region matching with motion prediction
robustly locates the approximate position of the target, then active
contour model detects the local variation of the target's boundary
which is insensitive to illumination changes, and results from active
contour model guides updating the template for successive tracking. In
this case, the system can tolerate changes in both pose and
illumination. To reduce the influence of local error due to partial
occlusion and weak edge strength, we use a priori knowledge of head
shape to re-initialize the curve of the object every a few frames. To
realize real-time tracking, we adopt region matching with adaptively
matching density and modify greedy algorithm to be more effective in
its implementation. The proposed technique is applied to track the head
of the person who is doing Taiji exercise in live video sequences. The
system demonstrates promising performance, and the tracking time per
frame is about 40ms on Pentium II 400MHZ PC.
|
471. | Wang, R, Gao, W, and Ma, JY, "An approach to robust and fast locating lip motion," ADVANCES IN MULTIMODAL INTERFACES - ICMI 2000, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1948, pp. 332-339, 2000.
Abstract:
In this paper,we present a novel approach to robust and fast locating
lip motion.Firstly, the fisher transform with constraints is presented
to enhance the lip region in a face image. Secondly, two distribution
characteristics of the lip in human face space are proposed to increase
the accuracy and and real-time implementation performance of lip
locating Experiments with 2000 images show that this approach can
satisfy requirements not only in real-time performance but also in
reliability and accuracy.
|
472. | Tabb, K, Davey, N, Adams, R, and George, S, "Analysis of human motion using snakes and neural networks," ARTICULATED MOTION AND DEFORMABLE OBJECTS, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1899, pp. 48-57, 2000.
Abstract:
A novel technique is described for analysing human movement in outdoor
scenes. Following initial detection of the humans using active contour
models, the contours are then re-represented as normalised axis
crossover vectors. These vectors are then fed into a neural network
which determines the typicality of a given human shape, allowing for a
given human's motion deformation to be analysed. Experiments are
described which investigate the success of the technique being
presented.
|
473. | Schenk, A, Prause, G, and Peitgen, HO, "Efficient semiautomatic segmentation of 3D objects in medical images," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2000, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1935, pp. 186-195, 2000.
Abstract:
We present a fast and accurate tool for semiautomatic segmentation of
volumetric medical images based on the live wire algorithm, shape-based
interpolation and a new optimization method.
While the user-steered live wire algorithm represents an efficient,
precise and reproducible method for interactive segmentation of
selected two-dimensional images, the shape-based interpolation allows
the automatic approximation of contours on slices between user-defined
boundaries. The combination of both methods leads to accurate
segmentations with significantly reduced user interaction time.
Moreover, the subsequent automated optimization of the interpolated
object contours results in a better segmentation quality or can be used
to extend the distances between user-segmented images and for a further
reduction of interaction time, Experiments were carried out on hepatic
computer tomographies from three different clinics. The results of the
segmentation of liver parenchyma have shown that the user interaction
time can be reduced more than 60% by the combination of shape-based
interpolation and our optimization method with volume deviations in the
magnitude of inter-user differences.
|
474. | Chen, T, and Metaxas, D, "Image segmentation based on the integration of Markov Random Fields and deformable models," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2000, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1935, pp. 256-265, 2000.
Abstract:
This paper proposes a new methodology for image segmentation based on
the integration of deformable and Markov Random Field models. Our
method makes use of Markov Random Field theory to build a Gibbs Prior
model of medical images with arbitrary initial parameters to estimate
the boundary of organs with low signal to noise ratio (SNR). Then we
use a deformable model to fit the estimated boundary, The result of the
deformable model fit is used to update the Gibbs prior model
parameters, such as the gradient threshold of a boundary. Based on the
updated parameters we restart the Gibbs prior models. By iteratively
integrating these processes we achieve an automated segmentation of the
initial images. By careful choice of the method used for the Gibbs
prior models, and based on the above method of integration with
deformable model our segmentation solution runs in close to real time.
Results of the method are presented for several examples, including
some MRI images with significant amount of noise.
|
475. | Moretti, B, Fadili, JM, Ruan, S, Bloyet, D, and Mazoyer, B, "Phantom-based performance evaluation: Application to brain segmentation from magnetic resonance images," MEDICAL IMAGE ANALYSIS, vol. 4, pp. 303-316, 2000.
Abstract:
This paper presents a new technique for assessing the accuracy of
segmentation algorithms, applied to the performance evaluation of brain
editing and brain tissue segmentation algorithms for magnetic resonance
images. We propose performance evaluation criteria derived from the use
of the realistic digital brain phantom Brainweb. This 'ground truth'
allows us to build distance-based discrepancy features between the
edited brain or the segmented brain tissues (such as cerebro-spinal
fluid, grey matter and white matter) and the phantom model, taken as a
reference. Furthermore, segmentation errors can be spatially
determined, and ranged in terms of their distance to the reference. The
brain editing method used is the combination of two segmentation
techniques. The first is based on binary mathematical morphology and a
region growing approach. It represents the initialization step, the
results of which are then refined with the second method, using an
active contour model. The brain tissue segmentation used is based on a
Markov random field model. Segmentation results are shown on the
phantom for each method, and on real magnetic resonance images for the
editing step; performance is evaluated by the new distance-based
technique and corroborates the effective refinement of the segmentation
using active contours. The criteria described here can supersede biased
Visual inspection in order to compare, evaluate and validate any
segmentation algorithm. Moreover, provided a 'ground truth' is given,
we are able to determine quantitatively to what extent a segmentation
algorithm is sensitive to internal parameters, noise, artefacts or
distortions. (C) 2000 Elsevier Science B.V. All rights reserved.
|
476. | Rifai, H, Bloch, I, Hutchinson, S, Wiart, J, and Garnero, L, "Segmentation of the skull in MRI volumes using and taking the partial volume effect into account deformable model," MEDICAL IMAGE ANALYSIS, vol. 4, pp. 219-233, 2000.
Abstract:
Segmentation of the skull in medical imagery is an important stage in
applications that require the construction of realistic models of the
head. Such models are used, for example, to simulate the behavior of
electro-magnetic fields in the head and to model the electrical
activity of the cortex in EEG and MEG data. in this paper, we present a
new approach for segmenting regions of bone in MRI volumes using
deformable models. Our method takes into account the partial volume
effects that occur with MRI data, thus permitting a precise
segmentation of these bone regions. At each iteration of the
propagation of the model, partial volume is estimated in a narrow band
around the deformable model, Our segmentation method begins with a
pre-segmentation stage, in which a preliminary segmentation of the
skull is constructed using a region-growing method. The surface that
bounds the pre-segmented skull region offers an automatic 3D
initialization of the deformable model. This surface is then propagated
(in 3D) in the direction of its normal. This propagation is achieved
using level set method, thus permitting changes to occur in the
topology of the surface as it evolves, an essential capability for our
problem. The speed at which the surface evolves is a function of the
estimated partial volume. This provides a sub-voxel accuracy in the
resulting segmentation. (C) 2000 Elsevier Science B.V. All rights
reserved.
|
477. | Westin, CF, Richolt, J, Moharir, V, and Kikinis, R, "Affine adaptive filtering of CT data," MEDICAL IMAGE ANALYSIS, vol. 4, pp. 161-177, 2000.
Abstract:
A novel method for resampling and enhancing image data using
multidimensional adaptive fillers is presented. The underlying issue
that this paper addresses is segmentation of image structures that are
close in size to the voxel geometry. Adaptive filtering is used to
reduce both the effects of partial volume averaging by resampling the
data to a lattice with higher sample density and to reduce the image
noise level. Resampling is achieved by constructing filter sets that
have subpixel offsets relative to the original sampling lattice. The
filters are also frequency corrected for ansisotropic voxel dimensions.
The shift and the voxel dimensions are described by an affine transform
and provides a model for tuning the filter frequency functions. The
method has been evaluated on CT data where the voxels are in general
non cubic. The in-plane resolution in CT image volumes is often higher
by a factor of 3-10 than the through-plane resolution. The method
clearly shows an improvement over conventional resampling techniques
such as cubic spline interpolation and sine interpolation. (C) 2000
Elsevier Science B.V. All rights reserved.
|
478. | Ozanian, TO, and Phillips, R, "Image analysis for computer-assisted internal fixation of hip fractures," MEDICAL IMAGE ANALYSIS, vol. 4, pp. 137-159, 2000.
Abstract:
This paper focuses on the task of automatic feature detection for
intra-operative drilling trajectory planning for computer-assisted
internal fixation of hip fractures. The features of interest are the
lateral cortex line of the femoral shaft, the femoral neck centre and
the femoral head centre, the latter being the most challenging of all.
Since the object is known, the detection process is regarded as a
localisation task rather than a recognition one. Simple anatomical
relationships between bone parts provide a naturally hierarchical
approach to searching, allowing refinement of image-derived information
based on a priori constraints. Use of knowledge and an unconventional
"divide-and-conquer" approach produce more reliable and faster results
than the standard global image processing routine. Analysis of summed
1D grey level profiles is used as a main segmentation tool to carry out
the above strategy. (C) 2000 Elsevier Science B.V. All rights reserved.
|
479. | McInerney, T, and Terzopoulos, D, "T-snakes: Topology adaptive snakes," MEDICAL IMAGE ANALYSIS, vol. 4, pp. 73-91, 2000.
Abstract:
We present a new class of deformable contours (snakes) and apply them
to the segmentation of medical images. Our snakes are defined in terms
of an affine cell image decomposition (ACID). The 'snakes in ACID'
framework significantly extends conventional snakes, enabling
topological flexibility among other features. The resulting topology
adaptive snakes, or 'T-snakes', can be used to segment some of the most
complex-shaped biological structures from medical images in an
efficient and highly automated manner. (C) 2000 Elsevier Science BN.
All rights reserved.
|
480. | Westin, CF, Lorigo, LM, Faugeras, O, Grimson, WEL, Dawson, S, Norbash, A, and Kikinis, R, "Segmentation by adaptive geodesic active contours," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2000, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1935, pp. 266-275, 2000.
Abstract:
This paper introduces the use of spatially adaptive components into the
geodesic active contour segmentation method for application to
volumetric medical images. These components are derived from local
structure descriptors and are used both in regularization of the
segmentation and in stabilization of the image-based vector field which
attracts the contours to anatomical structures in the images. They are
further used to incorporate prior knowledge about spatial location of
the structures of interest. These components can potentially decrease
the sensitivity to parameter settings inside the contour evolution
system while increasing robustness to image noise. We show segmentation
results on blood vessels in magnetic resonance angiography data and
bone in computed tomography data.
|
481. | Boykov, Y, and Jolly, MP, "Interactive organ segmentation using graph cuts," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2000, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1935, pp. 276-286, 2000.
Abstract:
An N-dimensional image is divided into "object" and "background"
segments using a graph cut approach, A graph is formed by connecting
all pairs of neighboring image pixels (voxels) by weighted edges.
Certain pixels (voxels) have to be a priori identified as object or
background seeds providing necessary clues about the image content. Our
objective is to find the cheapest way to cut the edges in the graph so
that the object seeds are completely separated from the background
seeds. If the edge cost is a decreasing function of the local intensity
gradient then the minimum cost cut should produce an object/background
segmentation with compact boundaries along the high intensity gradient
values in the image. An efficient, globally optimal solution is
possible via standard min-cut/max-flow algorithms for graphs with two
terminals. We applied this technique to interactively segment organs in
various 2D and 3D medical images.
|
482. | Yao, JH, and Taylor, R, "Tetrahedral mesh modeling of density data for anatomical atlases and intensity-based registration," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2000, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1935, pp. 531-540, 2000.
Abstract:
In this paper, we present the first phase of our effort to build a bone
density atlas. We adopted a tetrahedral mesh structure to represent
anatomical structures. We propose an efficient and automatic algorithm
to construct the tetrahedral mesh from contours in CT images
corresponding to the outer bone surfaces and boundaries between compact
bone, spongy bone, and medullary cavity. We approximate bone density
variations by means of continuous density functions in each tetrahedron
of the mesh. Currently, our density functions are second degree
polynomial functions expressed in terms of barycentric coordinates
associated with each tetrahedron. We apply our density model to
efficiently generate Digitally Reconstructed Radiographs. These results
are immediately applicable as means of speeding up 2D-3D and 3D-3D
intensity based registration and will be incorporated into our future
work on construction of atlases and deformable intensity-based
registration.
|
483. | Hernandez-Hoyos, M, Anwander, A, Orkisz, M, Roux, JP, Douek, P, and Magnin, IE, "A deformable vessel model with single point initialization for segmentation, quantification and visualization of blood vessels in 3D MRA," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2000, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1935, pp. 735-745, 2000.
Abstract:
We deal with image segmentation applied to three-dimensional (3D)
analysis of of vascular morphology in magnetic resonance angiography
(MRA) images. The main goal of our work is to develop a fast and
reliable method for stenosis quantification. The first step towards
this purpose is the extraction of the vessel axis by an expansible
skeleton method. Vessel boundaries are then detected in the planes
locally orthogonal to the centerline using an improved active contour.
Finally, area measurements based on the resulting contours allow the
calculation of stenosis parameters. The expansible nature of the
skeleton associated with a single point initialization of the active
contour allows overcoming some limitations of traditional deformable
models. As a result, the algorithm performs well even for severe
stenosis and significant vessel curvatures. Experimental results are
presented in 3D phantom images as well as in real images of patients.
|
484. | Gomes, J, and Faugeras, O, "Level sets and distance functions," COMPUTER VISION - ECCV 2000, PT I, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1842, pp. 588-602, 2000.
Abstract:
This paper is concerned with the simulation of the Partial Differential
Equation (PDE) driven evolution of a closed surface by means of an
implicit representation. In most applications, the natural choice for
the implicit representation is the signed distance function to the
closed surface. Osher and Sethian propose to evolve the distance
function with a Hamilton-Jacobi equation. Unfortunately the solution to
this equation is not a distance function. As a consequence, the
practical application of the level set method is plagued with such
questions as when do we have to "reinitialize" the distance function?
How do we "reinitialize" the distance function? Etc... which reveal a
disagreement between the theory and its implementation. This paper
proposes an alternative to the use of Hamilton-Jacobi equations which
eliminates this contradiction: in our method the implicit
representation always remains a distance function by construction, and
the implementation does not differ from the theory anymore. This is
achieved through the introduction of a new equation. Besides its
theoretical advantages, the proposed method also has several practical
advantages which we demonstrate in three applications: (i) the
segmentation of the human cortex surfaces from MRI images using two
coupled surfaces [27], (ii) the construction of a hierarchy of
Euclidean skeletons of a 3D surface, (iii) the reconstruction of the
surface of 3D objects through stereo [13].
|
485. | Weerasinghe, C, Ji, L, and Yan, H, "A new method for ROI extraction from motion affected MR images based on suppression of artifacts in the image background," SIGNAL PROCESSING, vol. 80, pp. 867-881, 2000.
Abstract:
Patient motion during a magnetic resonance imaging (MRI) examination
causes ghost artifacts and blurring in the image. Object boundary
extraction from such a degraded image is a challenging task, especially
if the motion function of the object is unknown. Although there are
many algorithms presently available for solving segmentation tasks,
they can be easily misled by the ghost artifacts and blurring in the
background of the image. Therefore, we propose a two-step background
clearing algorithm, in order to facilitate the object boundary
extraction. The first step involves selection of the least motion
affected views, using an entropy minimization criterion for suppression
of motion induced blur. The second step involves cancellation of the
remaining ghost artifacts, using a fuzzy model representing the image
background region. Both the steps involved in background clearing tend
to increase the number of dark pixels in the image. The contour
extraction is performed using an active contour model (snake), which
was previously developed by the authors. The proposed method has been
applied to phantom data affected by severe rotational motion and to
spin-echo MR images, producing encouraging results. (C) 2000 Elsevier
Science B.V. All rights reserved.
|
486. | Tsap, LV, Goldgof, DB, Sarkar, S, and Powers, PS, "A method for increasing precision and reliability of elasticity analysis in complicated burn scar cases," INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, vol. 14, pp. 189-210, 2000.
Abstract:
In this paper we propose a method for increasing precision and
reliability of elasticity analysis in complicated burn scar cases. The
need for a technique that would help physicians by objectively
assessing elastic properties of scars, motivated our original
algorithm. This algorithm successfully employed active contours for
tracking and finite element models for strain analysis. However, the
previous approach considered only one normal area and one abnormal area
within the region of interest, and scar shapes which were somewhat
simplified. Most burn scars have rather complicated shapes and may
include multiple regions with different elastic properties. Hence, we
need a method capable of adequately addressing these characteristics.
The new method can split the region into more than two localities with
different material properties, select and quantify abnormal areas, and
apply different forces if it is necessary for a better shape
description of the scar.
The method also demonstrates the application of scale and mesh
refinement techniques in this important domain. It is accomplished by
increasing the number of Finite Element Method (FEM) areas as well as
the number of elements within the area. The method is successfully
applied to elastic materials and real burn scar cases. We demonstrate
all of the proposed techniques and investigate the behavior of
elasticity function in a 3-D space. Recovered properties of elastic
materials are compared with those obtained by a conventional
mechanics-based approach. Scar ratings achieved with the method are
correlated against the judgments of physicians.
|
487. | Jang, DS, and Choi, HI, "Active models for tracking moving objects," PATTERN RECOGNITION, vol. 33, pp. 1135-1146, 2000.
Abstract:
In this paper, we propose a model-based tracking algorithm which can
extract trajectory information of a target object by detecting and
tracking a moving object from a sequence of images. The algorithm
constructs a model from the detected moving object and match the model
with successive image frames to track the target object. We use an
active model which characterizes regional and structural features of a
target object such as shape, texture, color, and edgeness. Our active
model can adapt itself dynamically to an image sequence so that it can
track a non-rigid moving object. Such an adaptation is made under the
framework of energy minimization. We design an energy function so that
the Function can embody structural attributes of a target as well as
its spectral attributes. We applied Kalman filter to predict motion
information, The predicted motion information by Kalman filter was used
very efficiently to reduce the search space in the matching process,
(C) 2000 Pattern Recognition Society. Published by Elsevier Science
Ltd. All rights reserved.
|
488. | Bronkorsta, PJH, Reinders, MJT, Hendriks, EA, Grimbergen, J, Heethaar, RM, and Brankenhoff, GJ, "On-line detection of red blood cell shape using deformable templates," PATTERN RECOGNITION LETTERS, vol. 21, pp. 413-424, 2000.
Abstract:
For the purpose of automating a clinical diagnostic apparatus to
quantify the deformability of human red blood cells, we present an
automated image analysis procedure for on-line detection of the cell
shape based upon the method of parametric deformable templates. (C)
2000 Elsevier Science B.V. All rights reserved.
|
489. | Lanterman, AD, Grenander, U, and Miller, MI, "Bayesian segmentation via asymptotic partition functions," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 22, pp. 337-347, 2000.
Abstract:
Asymptotic approximations to the partition function of Gaussian random
fields are derived. Textures are characterized via Gaussian random
fields induced by stochastic difference equations determined by
finitely supported, stationary, linear difference operators, adjusted
to be nonstationary at the boundaries. It is shown that as the scale of
the underlying shape increases, the log-normalizer converges to the
integral of the log-spectrum of the operator inducing the random field.
Fitting the covariance of the fields amounts to fitting the parameters
of the spectrum of the differential operator-induced random field
model. Matrix analysis techniques are proposed for handling textures
with variable orientation. Examples of texture parameters estimated
from training data via asymptotic maximum-likelihood are shown.
Isotropic models involving powers of the Laplacian and directional
models involving partial derivative mixtures are explored. Parameters
are estimated for mitochondria and actin-myocin complexes in electron
micrographs and clutter in forward-looking infrared images. Deformable
template models are used to infer the shape of mitochondria in electron
micrographs, with the asymptotic approximation allowing easy
recomputation of the partition function as inference proceeds.
|
490. | Gomes, J, and Faugeras, O, "Reconciling distance functions and level sets," JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, vol. 11, pp. 209-223, 2000.
Abstract:
This paper is concerned with the simulation of the partial differential
equation driven evolution of a closed surface by means of an implicit
representation. In most applications, the natural choice for the
implicit representation is the signed distance function to the closed
surface. Osher and Sethian have proposed to evolve the distance
function with a Hamilton-Jacobi equation. Unfortunately the solution to
this equation is not a distance function. As a consequence, the
practical application of the level set method is plagued with such
questions as When do we have to reinitialize the distance function? How
do we reinitialize the distance function?, which reveal a disagreement
between the theory and its implementation. This paper proposes an
alternative to the use of Hamilton-Jacobi equations which eliminates
this contradiction: in our method the implicit representation always
remains a distance function by construction, and the implementation
does not differ from the theory anymore. This is achieved through the
introduction of a new equation. Besides its theoretical advantages, the
proposed method also has several practical advantages which we
demonstrate in three applications: (i) the segmentation of the human
cortex surfaces from MRI images using two coupled surfaces (X. Zeng, et
al., in Proceedings of the International Conference on Computer Vision
and Pattern Recognition, June 1998), (ii) the construction of a
hierarchy of Euclidean skeletons of a 3D surface, (iii) the
reconstruction of the surface of 3D objects through stereo (O. Faugeras
and R. Keriven, Lecture Notes in Computer Science, Vol. 1252, pp.
272-283). (C) 2000 Academic Press.
|
491. | Shah, J, "Riemannian drums, anisotropic curve evolution, and segmentation," JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, vol. 11, pp. 142-153, 2000.
Abstract:
The method of curve evolution is a popular method for recovering shape
boundaries. However, isotropic metrics have always been used to induce
the how of the curve and potential steady states tend to be difficult
to determine numerically, especially in noisy or tow-contrast
situations. Initial curves shrink past the steady slate and soon
vanish. In this paper, anisotropic metrics are considered to remedy the
situation by taking the orientation of the feature gradient into
account. The problem of shape recovery or segmentation is formulated as
the problem of finding minimum cuts of a Riemannian manifold.
Approximate methods, namely anisotropic geodesic flows and the solution
of an eigenvalue problem, are discussed. (C) 2000 Academic Press.
|
492. | Chan, TE, Sandberg, BY, and Vese, LA, "Active contours without edges for vector-valued images," JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, vol. 11, pp. 130-141, 2000.
Abstract:
In this paper, we propose an active contour algorithm for object
detection in vector-valued images (such as RGB or multispectral). The
model is an extension of the scalar Chan-Vese algorithm to the
vector-valued case [1]. The model minimizes a Mumford-Shah functional
over the length of the contour, plus the sum of the fitting error over
each component of the vector-valued image. Like the Chan-Vese model,
our vector-valued model can detect edges both with or without gradient.
We show examples where our model detects vector-valued objects which
are undetectable in any scalar representation. For instance, objects
with different missing parts in different channels are completely
detected (such as occlusion). Also, in color images, objects which are
invisible in each channel or in intensity can be detected by our
algorithm. Finally, the model is robust with respect to noise,
requiring no a priori denoising step. (C) 2000 Academic Press.
|
493. | Lepage, R, Rouhana, RG, St-Onge, B, Noumeir, R, and Desjardins, R, "Cellular neural network for automated detection of geological lineaments on radarsat images," IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, vol. 38, pp. 1224-1233, 2000.
Abstract:
The analysis of natural linear structures, termed "lineaments in
satellite images, provides important information to the geologist, In
the satellite imaging process, important features of the observed
tridimensional scene, including geological lineaments, are mapped into
the resulting 2-D image as sharp radiation variations or ed,ne elements
(edgels), Edgels are detected by a first-order differentiation operator
and are linked together with those in the vicinity on a basis of
orientation continuity.
Lineaments are mapped into remotely sensed satellite images as long and
continuous quasilinear features and can be described as a connected
sequence of edgels whose direction may change gradually along the
sequence. Parts of the same lineament can be occluded by
geomorphological features and must be linked together, a major drawback
with local and small neighborhood detectors.
We propose a cellular neural network (CNN) architecture to offer a
large directional neighborhood to the lineament detection algorithm.
The CNN uses a large circular neighborhood coupled with a
directional-induced gradient field to link together edgels with similar
and continuous orientation. Missing edgels are restored if a
surrounding lineament is detected.
|
494. | Oliver, N, Pentland, A, and Berard, F, "LAFTER: a real-time face and lips tracker with facial expression recognition," PATTERN RECOGNITION, vol. 33, pp. 1369-1382, 2000.
Abstract:
This paper describes an active-camera real-time system for tracking,
shape description, and classification of the human face and mouth
expressions using only a PC or equivalent computer. The system is based
on use of 2-D blob features, which are spatially compact clusters of
pixels that are similar in terms of low-level image properties.
Patterns of behavior (e.g., facial expressions and head movements) can
be classified in real-time using hidden Markov models (HMMs). The
system has been tested on hundreds of users and has demonstrated
extremely reliable and accurate performance. Typical facial expression
classification accuracies are near 100%. (C) 2000 Pattern Recognition
Society. Published by Elsevier Science Ltd. All rights reserved.
|
495. | Toklu, C, Tekalp, AM, and Erdem, AT, "Semi-automatic video object segmentation in the presence of occlusion," IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, vol. 10, pp. 624-629, 2000.
Abstract:
We describe a semi-automatic approach for segmenting a video sequence
into spatio-temporal video objects in the presence of occlusion, Motion
and shape of each video object is represented by a 2-D mesh. Assuming
that the boundary of an object of interest is interactively marked on
some keyframes, the proposed method finds the boundary of the object in
all other frames automatically by tracking the 2-D mesh representation
of the object in both forward and backward directions. A key
contribution of the proposed method is automatic detection of covered
and uncovered regions at each frame, and assignment of pixels in the
uncovered regions to the object or background based on color and motion
similarity. Experimental results are presented on two MPEG-4 test
sequences and the resulting segmentations are evaluated both visually
and quantitatively.
|
496. | Sarti, A, Malladi, R, and Sethian, JA, "Subjective surfaces: A method for completing missing boundaries," PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, vol. 97, pp. 6258-6263, 2000.
Abstract:
We present a model and algorithm for segmentation of images with
missing boundaries. In many situations. the human visual system fills
in missing gaps in edges and boundaries, building and completing
information that is not present This presents a considerable challenge
in computer vision, since most algorithms attempt to exploit existing
data. Completion models, which postulate how to construct missing data,
are popular but are often trained and specific to particular images. In
this paper, we take the following perspective: We consider a reference
point within an image as given and then develop an algorithm that tries
to build missing information on the basis of the given point of view
and the available information as boundary data to the algorithm. We
test the algorithm on some standard images, including the classical
triangle of Kanizsa and low signal:noise ratio medical images.
|
497. | Imelinska, C, Downes, MS, and Yuan, W, "Semi-automated color segmentation of anatomical tissue," COMPUTERIZED MEDICAL IMAGING AND GRAPHICS, vol. 24, pp. 173-180, 2000.
Abstract:
We propose a semi-automated region-based color segmentation algorithm
to extract anatomical structures, including soft tissues, in the color
anatomy slices of the Visible Human data. Our approach is based on
repeatedly dividing an image into regions using Voronoi diagrams and
classifying the regions based on experimental classification
statistics. The user has the option of reclassifying regions in order
to improve the final boundary. Our results indicate that the algorithm
can find accurate outlines in a small number of iterations and that
manual interaction can markedly improve the outline. This approach can
be extended to 3D color segmentation. (C) 2000 Published by Elsevier
Science Ltd. All rights reserved.
|
498. | Kim, JS, Koh, KC, and Cho, HS, "An active contour model with shape regulation scheme," ADVANCED ROBOTICS, vol. 14, pp. 495-514, 2000.
Abstract:
This paper presents an active method for locating target objects in
images, which is aimed at improving the performance of detecting object
boundaries by enhancing the behavioral characteristics of an active
contour. The proposed active contour model simulates a mechanical
system consisting of two main parts: the first is a rigid fixture,
called the 'core' , specifying the expected shape of target boundaries,
while the second is an elastic rod attached to the rigid fixture. The
elastic rod deforms or moves relative to the rigid core according to
the classical laws of the mechanical system, When the initial contour
is applied to an image data, it is attracted near the dominant image
features, but tries to keep its home shape and simultaneously make the
deformation smooth if a deformation is more natural for force
equilibrium. This mechanism significantly improves the performance of
detecting object boundaries in the presence of some disturbing image
features. The active contour is scale invariant, thereby significantly
relieving the difficulty in selecting proper values for the model
parameters. The values for the model parameters can be selected to make
the contour have the desired behaviors around the equilibrium position
through the analysis of the vibration mode of the mechanical system.
The performance of the proposed method is validated through a series of
experiments, which include detection of heavily degraded objects,
tracking of objects under non-rigid motion and comparisons with the
original snake models.
|
499. | Egmont-Petersen, M, Schreiner, U, Tromp, SC, Lehmann, TM, Slaaf, DW, and Arts, T, "Detection of leukocytes in contact with the vessel wall from in vivo microscope recordings using a neural network," IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, vol. 47, pp. 941-951, 2000.
Abstract:
Leukocytes play an important role in the host defense as they may
travel from the blood stream into the tissue in reacting to
inflammatory stimuli. The leukocyte-vessel wall interactions are
studied in post capillary vessels by intraviral video microscopy during
in vivo animal experiments. Sequences of video images are obtained and
digitized with a frame grabber. A method for automatic detection and
characterization of leukocytes in the video images is developed.
Individual leukocytes are detected using a neural network that is
trained with synthetic leukocyte images generated using a novel
stochastic model. This model makes it feasible to generate images of
leukocytes with different shapes and sizes under various lighting
conditions. Experiments indicate that neural networks trained with the
synthetic leukocyte images perform better than networks trained with
images of manually detected leukocytes. The best performing neural
network trained with synthetic leukocyte images resulted in an 18%
larger area under the ROC curve than the best performing neural network
trained with manually detected leukocytes.
|
500. | Pardo, XM, and Cabello, D, "Biomedical active segmentation guided by edge saliency," PATTERN RECOGNITION LETTERS, vol. 21, pp. 559-572, 2000.
Abstract:
Deformable models are very popular approaches in biomedical image
segmentation. Classical snake models are edge-oriented and work well if
the target objects have distinct gradient values. This is not always
true in biomedical imagery, which makes the model very dependent on
initial conditions. In this work we propose an edge-based potential
aimed at the elimination of local minima due to undesired edges. The
new approach integrates knowledge about the features of the desired
boundaries apart from gradient strength and uses a new method to
eliminate local minima, which makes the segmentation less sensitive to
initial contours. (C) 2000 Elsevier Science B.V. All rights reserved.
|
501. | Chung, R, and Ho, CK, "3-D reconstruction from tomographic data using 2-D active contours," COMPUTERS AND BIOMEDICAL RESEARCH, vol. 33, pp. 186-210, 2000.
Abstract:
Reconstructing three-dimensional (3-D) shapes of structures like
internal organs from tomographic data is an important problem in
medical imaging. Various forms of the deformable surface model have
been proposed to tackle it, but they are either computationally
expensive or limited to tubular shapes. In this paper a 3-D
reconstruction mechanism that requires only 2-D deformations is
proposed. Advantages of the proposed model include that it is
conformable to any 3-D shape, efficient, and highly parallelizable.
Most importantly, it requires from the user an initial 2-D contour on
only one of the tomograph slices to start with. Experimental results
are shown to illustrate the performance of the model. (C) 2000 Academic
Press.
|
502. | Iannizzotto, G, and Vita, L, "Fast and accurate edge-based segmentation with no contour smoothing in 2-D real images," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 9, pp. 1232-1237, 2000.
Abstract:
In this paper we propose an edge-based segmentation algorithm built on
a new type of active contour which is fast, has a low computational
complexity and does not introduce unwanted smoothing on the retrieved
contours. The contours are always returned as closed chains of points,
resulting in a very useful base for subsequent shape representation
techniques.
|
503. | Wink, O, Niessen, WJ, and Viergever, MA, "Fast delineation and visualization of vessels in 3-D angiographic images," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 19, pp. 337-346, 2000.
Abstract:
A method is presented which aids the clinician in obtaining
quantitative measures and a three-dimensional (3-D) representation of
vessels from 3-D angiographic data with a minimum of user interaction.
Based on two user defined starting points, an iterative procedure
tracks the central vessel axis. During the tracking process, the
minimum diameter and a surface rendering of the vessels are computed,
allowing for interactive inspection of the vasculature. Applications of
the method to CTA, contrast enhanced (CE)-MRA and phase contrast
(PC)-MRA images of the abdomen are shown, In all applications, a long
stretch of vessels with varying width is tracked, delineated, and
visualized, in less than 10 s on a standard clinical workstation.
|
504. | Chen, SJ, and Carroll, JD, "3-D reconstruction of coronary arterial tree to optimize angiographic visualization," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 19, pp. 318-336, 2000.
Abstract:
Due to vessel overlap and foreshortening, multiple projections are
necessary to adequately evaluate the coronary tree with arteriography,
Catheter-based interventions can only be optimally performed when these
visualization problems are successfully solved. The traditional method
provides multiple selected views in which overlap and foreshortening
are subjectively minimized based on two dimensional (2-D) projections.
A pair of images acquired from routine angiographic study at arbitrary
orientation using a single-plane imaging system were chosen far
three-dimensional (3-D) reconstruction. After the arterial segment of
interest (e.g., a single coronary stenosis or bifurcation lesion) was
selected, a set of gantry angulations minimizing segment foreshortening
was calculated. Multiple computer-generated projection images with
minimized segment foreshortening were then used to choose views with
minimal overlapped vessels relative to the segment of interest. The
optimized views could then be utilized to guide subsequent angiographic
acquisition and interpretation. Over 800 cases of coronary arterial
trees have been reconstructed, in which more than 40 cases were
performed in room during cardiac catheterization. The accuracy of 3-D
length measurement was confirmed to be within an average
root-mean-square (rms) 3.5% error using eight different pairs of
angiograms of an intracoronary guidewire of 105-mm length with eight
radiopaque markers of 15-mm interdistance. The accuracy of similarity
between the additional computer-generated projections versus the actual
acquired views was demonstrated with the average rms errors of 3.09 mm
and 3.13 mm in 20 LCA and 20 RCA cases, respectively. The projections
of the reconstructed patient-specific 3-D coronary tree model can be
utilized for planning optimal clinical views: minimal overlap and
foreshortening, The assessment of lesion length and diameter narrowing
can be optimized in both interventional cases and studies of disease
progression and regression.
|
505. | Suter, D, and Chen, F, "Left ventricular motion reconstruction based on elastic vector splines," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 19, pp. 295-305, 2000.
Abstract:
In medical imaging it is common to reconstruct dense motion estimates,
from sparse measurements of that motion, using some form of elastic
spline (thin-plate spline, snakes and other deformable models, etc.).
Usually the elastic spline uses only bending energy (second-order
smoothness constraint) or stretching energy (first-order smoothness
constraint), or a combination of the two. These elastic splines belong
to a family of elastic vector splines called the Laplacian splines.
This spline family is derived from an energy minimization functional,
which is composed of multiple-order smoothness constraints. These
splines can be explicitly tuned to vary the smoothness of the solution
according to the deformation in the modeled material/tissue.
In this context, it is natural to question which members of the family
will reconstruct the motion more accurately, We compare different
members of this spline family to assess how well these splines
reconstruct human cardiac motion. We find that the commonly used
splines (containing first-order and/or second-order smoothness terms
only) are not the most accurate for modeling human cardiac motion.
|
506. | Szekely, G, Brechbuhler, C, Dual, J, Enzler, R, Hug, J, Hutter, R, Ironmonger, N, Kauer, M, Meier, V, Niederer, P, Rhomberg, A, Schmid, P, Schweitzer, G, Thaler, M, Vuskovic, V, Troster, G, Haller, U, and Bajka, M, "Virtual reality-based simulation of endoscopic surgery," PRESENCE-TELEOPERATORS AND VIRTUAL ENVIRONMENTS, vol. 9, pp. 310-333, 2000.
Abstract:
Virtual reality (VR)-based surgical simulator systems offer a very
elegant approach to enriching and enhancing traditional training in
endoscopic surgery. However, while a number of VR simulator systems
have been proposed and realized in the past Few years, most of these
systems are far from being able to provide a reasonably realistic
surgical environment We explore the current limits for realism and the
approaches to reaching and surpassing those limits by describing and
analyzing the mast important components of VR-based endoscopic
simulators. The feasibility of the proposed techniques is demonstrated
on a modular prototype system that implements the basic algorithms for
VR training in gynaecologic laparoscopy.
|
507. | Tillett, R, McFarlane, N, and Lines, J, "Estimating dimensions of free-swimming fish using 3D point distribution models," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 79, pp. 123-141, 2000.
Abstract:
Monitoring the growth of farmed fish is an important task which is
currently difficult to carry out. An underwater stereo image analysis
technique offers the potential for estimating key dimensions of
free-swimming fish, from which the fish mass can be estimated. This
paper describes the development of a three-dimensional point
distribution model to capture the typical shape and variability of
salmon viewed from the side. The model was fitted to stereo images of
test fish by minimizing an energy function, which was based on
probability distributions. The minimization was an iterated two-step
method in which edges were selected for magnitude, direction, and
proximity to the model, and the model was then fitted to the edges. A
search strategy for locating the edges in 3D was devised. The model is
tested on two image sets. In the first set 19 of the 26 fish are
located in spite of their variable appearance and the presence of
neighboring fish. In the second set the measurements made on 11 images
of fish are compared with manual measurements of the fish dimensions
and show an average error in length estimation of 5%. (C) 2000 Academic
Press.
|
508. | Erlandsson, K, Visvikis, D, Waddington, WA, and Jarritt, P, "Truncation reduction in fan-beam transmission scanning using the radon transform consistency conditions," IEEE TRANSACTIONS ON NUCLEAR SCIENCE, vol. 47, pp. 989-993, 2000.
Abstract:
Transmission scanning is needed for accurate attenuation correction in
cardiac Single Photon Emission Tomography (SPET). Simultaneous emission
and transmission imaging can be done using a scintillation camera with
a fan-beam collimator and a line source at the focal point. The
transmission data will be truncated, however, which may lead to
inaccuracy in the reconstructed emission values. We have developed two
different methods for augmentation of truncated transmission data,
based on the Radon transform consistency conditions. Our results show
that the uniformity in the myocardium can be improved with these
methods, as compared to using the truncated data directly in the
reconstruction.
|
509. | Zhong, Y, Jain, AK, and Dubuisson-Jolly, MP, "Object tracking using deformable templates," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 22, pp. 544-549, 2000.
Abstract:
We propose a novel method for object tracking using prototype-based
deformable template models. To track an object in an image sequence, we
use a criterion which combines two terms: the frame-to-frame deviations
of the object shape and the fidelity of the modeled shape to the Input
image. The deformable template model utilizes the prior shape
information which is extracted from the previous frames along with a
systematic shape deformation scheme to model the object shape in a new
frame. The following image information Is used in the tracking process:
1) edge and gradient information: the object boundary consists of
pixels with large image gradient, 2) region consistency: the same
object region possesses consistent color and texture throughout the
sequence, and 3) interframe motion: the boundary of a moving object is
characterized by large interframe motion. The tracking proceeds by
optimizing an objective function which combines both the shape
deformation and the fidelity of the modeled shape to the current image
(in terms of gradient, texture, and interframe motion). The inherent
structure in the deformable template. together with region, motion, and
image gradient cues. makes the proposed algorithm relatively
insensitive to the adverse effects of weak image features and moderate
amounts of occlusion.
|
510. | Ma, WY, and Manjunath, BS, "EdgeFlow: A technique for boundary detection and image segmentation," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 9, pp. 1375-1388, 2000.
Abstract:
A novel boundary detection scheme based on "edge flow" is proposed in
this paper. This scheme utilizes a predictive coding model to identify
the direction of change in color and texture at each image location at
a given scale, and constructs an edge flow vector. By propagating the
edge flow vectors, the boundaries can be detected at image Locations
which encounter two opposite directions of flow in the stable state. A
user defined image scale is the only significant control parameter that
is needed by the algorithm. The scheme facilitates integration of color
and texture into a single framework for boundary detection.
Segmentation results on a large and diverse collections of natural
images are provided, demonstrating the usefulness of this method to
content based image retrieval.
|
511. | Haque, H, Hassanien, AE, and Nakajima, M, "Generation of missing medical slices using morphing technology," IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, vol. E83D, pp. 1400-1407, 2000.
Abstract:
When the inter-slice resolution of tomographic image slices is large,
it is necessary to estimate the locations and intensities of pixels,
which would appear in the non-existed intermediate slices. This paper
presents a new method for generating the missing medical slices from
two given slices. It uses the contours of organs as the control
parameters to the intensity information in the physical gaps of
sequential medical slices. The Snake model is used for generating the
control points required for the elastic body spline (EBS) morphing
algorithm. Contour information derived from this segmentation
pre-process is then further processed and used as control parameters to
warp the corresponding regions in both input slices into compatible
shapes. In this way, the intensity information of the interpolated
intermediate slices can be derived more faithfully. In comparison with
the existing intensity interpolation methods, including linear
interpolation, which only considers corresponding points in a small
physical neighborhood, this method warps the data images into similar
shapes according to contour information to provide a more meaningful
correspondence relationship.
|
512. | Davison, NE, Eviatar, H, and Somarjai, RL, "Snakes simplified," PATTERN RECOGNITION, vol. 33, pp. 1651-1664, 2000.
Abstract:
The snake formulation of Eviatar and Somorjai has the advantages of
bring both conceptually simple and rapidly convergent. We extend this
formulation in two ways, by exploring additional energy terms whose
interpretation is transparent and by using a simple minimization
technique. The usefulness of the simplified model is illustrated using
artificial images as well as images obtained with MRI, optical
microscopy and ultrasound. (C) 2000 Published by Elsevier Science Ltd
on behalf of Pattern Recognition Society.
|
513. | Germond, L, Dojat, M, Taylor, C, and Garbay, C, "A cooperative framework for segmentation of MRI brain scans," ARTIFICIAL INTELLIGENCE IN MEDICINE, vol. 20, pp. 77-93, 2000.
Abstract:
Automatic segmentation of MRI brain scans is a complex task for two
main reasons: the large variability of the human brain anatomy, which
limits the use of general knowledge and, inherent to MRI acquisition,
the artifacts present in the images that are difficult to process. To
tackle these difficulties, we propose to mix, in a cooperative
framework, several types of information and knowledge provided and used
by complementary individual systems: presently, a multi-agent system, a
deformable model and an edge detector. The outcome is a cooperative
segmentation performed by a set of region and edge agents constrained
automatically and dynamically by both, the specific gray levels in the
considered image, statistical models of the brain structures and
general knowledge about MRI brain scans. Interactions between the
individual systems follow three modes of cooperation: integrative,
augmentative and confrontational cooperation, combined during the three
steps of the segmentation process namely, the specialization of the
seeded-region-growing agents, the fusion of heterogeneous information
and the retroaction over slices. The described cooperative framework
allows the dynamic adaptation of the segmentation process to the own
characteristics of each MRI brain scan. Its evaluation using realistic
brain phantoms is reported. (C) 2000 Elsevier Science B.V. All rights
reserved.
|
514. | Shelton, CR, "Morphable Surface Models," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 38, pp. 75-91, 2000.
Abstract:
We describe a novel automatic technique for finding a dense
correspondence between a pair of n-dimensional surfaces with arbitrary
topologies. This method employs a different formulation than previous
correspondence algorithms (such as optical flow) and includes images as
a special case. We use this correspondence algorithm to build Morphable
Surface Models (an extension of Morphable Models) from examples. We
present a method for matching the model to new surfaces and demonstrate
their use for analysis, synthesis, and clustering.
|
515. | Drummond, T, and Cipolla, R, "Application of Lie algebras to visual servoing," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 37, pp. 21-41, 2000.
Abstract:
A novel approach to visual servoing is presented, which takes advantage
of the structure of the Lie algebra of affine transformations. The aim
of this project is to use feedback from a visual sensor to guide a
robot arm to a target position. The target position is learned using
the principle of 'teaching by showing' in which the supervisor places
the robot in the correct target position and the system captures the
necessary information to be able to return to that position. The sensor
is placed in the end effector of the robot, the 'camera-in-hand'
approach, and thus provides direct feedback of the robot motion
relative to the target scene via observed transformations of the scene.
These scene transformations are obtained by measuring the affine
deformations of a target planar contour (under the weak perspective
assumption), captured by use of an active contour, or snake.
Deformations of the snake are constrained using the Lie groups of
affine and projective transformations. Properties of the Lie algebra of
affine transformations are exploited to provide a novel method for
integrating observed deformations of the target contour. These can be
compensated with appropriate robot motion using a non-linear control
structure. The local differential representation of contour
deformations is extended to allow accurate integration of an extended
series of small perturbations. This differs from existing approaches by
virtue of the properties of the Lie algebra representation which
implicitly embeds knowledge of the three-dimensional world within a
two-dimensional image-based system. These techniques have been
implemented using a video camera to control a 5 DoF robot arm.
Experiments with this implementation are presented, together with a
discussion of the results.
|
516. | Hobolth, A, and Jensen, EBV, "Modelling stochastic chances in curve shape, with an application to cancer diagnostics," ADVANCES IN APPLIED PROBABILITY, vol. 32, pp. 344-362, 2000.
Abstract:
Often, the statistical analysis of the shape of a random planar curve
is based on a model for a polygonal approximation to the curve. In the
present paper, we instead describe the curve as a continuous stochastic
deformation of a template curve. The advantage of this continuous
approach is that the parameters in the model do not relate to a
particular polygonal approximation. A somewhat similar approach has
been used by Kent et al. (1996), who describe the limiting behaviour of
a model with a first-order Markov property as the landmarks on the
curve become closely spaced; see also Grenander(1993). The model
studied in the present paper is an extension of this model. Our model
possesses a second-order Markov property. Its geometrical
characteristics are studied in some detail and an explicit expression
for the covariance function is derived. The model is applied to the
boundaries of profiles of cell nuclei from a benign tumour and a
malignant tumour. It turns out that the model with the second-order
Markov property is the most appropriate, and that it is indeed possible
to distinguish between the two samples.
|
517. | Tiddeman, B, Duffy, N, and Rabey, G, "Construction and visualisation of three-dimensional facial statistics," COMPUTER METHODS AND PROGRAMS IN BIOMEDICINE, vol. 63, pp. 9-20, 2000.
Abstract:
This paper presents a new method for the construction of
three-dimensional (3D) probabilistic Facial averages and demonstrates
the potential for applications in clinical craniofacial research and
patient assessment. Averages are constructed from a database of
registered laser-range scans and photographic images using feature
based image warping. Facial features are extracted using a template of
connected contours, adapted to each subject interactively using snakes.
Each subject's images are warped to the average template shape acid the
mean depth, colour and covariance matrix is found at each point.
Statistical comparison of individuals with an average or between two
averages is visualised by converting the probabilities to a coloured
texture map. (C) 2000 Elsevier Science Inland Ltd. All rights reserved.
|
518. | Toklu, C, Erdem, AT, and Tekalp, AM, "Two-dimensional mesh-based mosaic representation for manipulation of video objects with occlusion," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 9, pp. 1617-1630, 2000.
Abstract:
We present a two-dimensional (2-D) mesh-based mosaic representation,
consisting of an object mesh and a mosaic mesh for each frame and a
final mosaic image, for video objects with mildly deformable motion in
the presence of self and/or object-to-object (external) occlusion,
Unlike classical mosaic representations where successive frames are
registered using global motion models, we map the uncovered regions in
the successive frames onto the mosaic reference frame using local
affine models, i.e., those of the neighboring mesh patches. The
proposed method to compute this mosaic representation is tightly
coupled with an occlusion adaptive 2-D mesh tracking procedure, which
consist of propagating the object mesh frame to frame, and updating of
both object and mosaic meshes to optimize texture mapping from the
mosaic to each instance of the object. The proposed representation has
been applied to video object rendering and editing, including self
transfiguration, synthetic transfiguration, and 2-D augmented reality
in the presence of self and/or external occlusion, We also provide an
algorithm to determine the minimum number of still views needed to
reconstruct a replacement mosaic which is needed for synthetic
transfiguration. Experimental results are provided to demonstrate both
the 2-D mesh-based mosaic synthesis and two different video object
editing applications on real video sequences.
|
519. | Brigger, P, Hoeg, J, and Unser, M, "B-Spline snakes: A flexible tool for parametric contour detection," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 9, pp. 1484-1496, 2000.
Abstract:
We present a novel formulation for B-spline snakes that can be used as
a tool for fast and intuitive contour outlining. We start with a
theoretical argument in favor of splines in the traditional formulation
by showing that the optimal, curvature-constrained snake is a cubic
spline, irrespective of the form of the external energy held,
Unfortunately, such regularized snakes suffer from slow convergence
speed because of a large number of control points, as well as from
difficulties in determining the weight factors associated to the
internal energies of the curve. We therefore propose an alternative
formulation in which the intrinsic scale of the spline model is
adjusted a priori; this Leads to a reduction of the number of
parameters to be optimized and eliminates the need for internal
energies (i.e., the regularization term), In other words, we are now
controlling the elasticity of the spline implicitly and rather
intuitively by varying the spacing between the spline knots. The theory
is embedded into a multiresolution formulation demonstrating improved
stability in noisy image environments. Validation results are
presented, comparing the traditional snake using internal energies and
the proposed approach without internal energies, showing the similar
performance of the latter, Several biomedical examples of applications
are included to illustrate the versatility of the method.
|
520. | Bertalmio, M, Sapiro, G, and Randall, G, "Morphing active contours," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 22, pp. 733-737, 2000.
Abstract:
A method for deforming curves in a given image to a desired position in
the second image is introduced in this paper. The algorithm is based on
deforming the first image toward the second one via a Partial
Differential Equation (PDE), while tracking the deformation of the
curves of interest in the first image with an additional, coupled, PDE.
The tracking is performed by projecting the velocities of the first
equation into the second one. In contrast with previous PDE-based
approaches, both the images and the curves on the frames/slices of
interest are used for tracking. The technique can be applied to object
tracking and sequential segmentation. The topology of the deforming
curve can change without any special topology handling procedures added
to the scheme. This permits, for example, the automatic tracking of
scenes where, due to occlusions, the topology of the objects of
interest changes from frame to frame. In addition, this work introduces
the concept of projecting velocities to obtain systems of coupled PDEs
for image analysis applications We show examples for object tracking
and segmentation of electronic microscopy.
|
521. | Nikolaidis, A, and Pitas, I, "Facial feature extraction and pose determination," PATTERN RECOGNITION, vol. 33, pp. 1783-1791, 2000.
Abstract:
A combined approach for facial feature extraction and determination of
gaze direction is proposed that employs some improved variations of the
adaptive Hough transform for curve detection, minima analysis of
feature candidates, template matching for inner facial feature
localization, active contour models for inner face contour detection
and projective geometry properties for accurate pose determination. The
aim is to provide a sufficient set of features for further use in a
face recognition or face tracking system. (C) 2000 Pattern Recognition
Society. Published by Elsevier Science Ltd. All rights reserved.
|
522. | Chen, CM, Lu, HHS, and Lin, YC, "An early vision-based snake model for ultrasound image segmentation," ULTRASOUND IN MEDICINE AND BIOLOGY, vol. 26, pp. 273-285, 2000.
Abstract:
Due to the speckles and the ill-defined edges of the object of
interest, the classic image-segmentation techniques are usually
ineffective in segmenting ultrasound (US) images. In this paper, we
present a new algorithm for segmenting general US images that is
composed of two major techniques; namely, the early-vision model and
the discrete-snake model, By simulating human early vision, the
early-vision model can capture both grey-scale and textural edges while
the speckle noise is suppressed. By performing deformation only on the
peaks of the distance map, the discrete-snake model promises better
noise immunity and more accurate convergence. Moreover, the constraint
for most conventional snake models that the initial contour needs to be
located very close to the actual boundary has been relaxed
substantially. The performance of the proposed snake model has been
shown to be comparable to manual delineation and superior to that of
the gradient vector flow (GVF) snake model. (C) 2000 World Federation
for Ultrasound in Medicine & Biology.
|
523. | Garrido, A, and de la Blanca, NP, "Applying deformable templates for cell image segmentation," PATTERN RECOGNITION, vol. 33, pp. 821-832, 2000.
Abstract:
This paper presents an automatic method. based on the deformable
template approach, for cell image segmentation under severe noise
conditions. We define a new methodology, dividing the process into
three parts: (1) obtain evidence from the image about the location of
the cells, (2) use this evidence to calculate an elliptical
approximation of these locations; (3) refine cell boundaries using
locally deforming models. We have designed a new algorithm to locate
cells and propose an energy function to be used together with 3
stochastic deformable template model. Experimental results show that
this approach for segmenting cell images is both Fast and robust, and
that this methodology may be used for automatic classification as part
of a computer-aided medical decision making technique. (C) 2000 Pattern
Recognition Society. Published by Elsevier Science Ltd, All rights
reserved.
|
524. | Falcao, AX, Udupa, JK, and Miyazawa, FK, "An ultra-fast user-steered image segmentation paradigm: Live wire on the fly," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 19, pp. 55-62, 2000.
Abstract:
We have been developing general user steered image segmentation
strategies for routine use in applications involving a large number of
data sets. In the past, we have presented three segmentation paradigms:
live wire, live lane, and a three-dimensional (3-D) extension of the
live-wire method. In this paper, we introduce an ultra-fast live-wire
method, referred to as live wire on the fly, for further reducing
user's time compared to the basic live-wire method. In live wire,
3-D/four-dimensional (4-D) object boundaries are segmented in a
slice-by-slice fashion. To segment a two-dimensional (2-D) boundary,
the user initially picks a point on the boundary and all possible
minimum-cost paths from this point to all other points in the image are
computed via Dijkstra's algorithm. Subsequently a live wire is
displayed in real time From the initial point to any subsequent
position taken by the cursor. If the cursor is close to the desired
boundary, the live wire snaps on to the boundary. The cursor is then
deposited and a new live-wire segment is Found next, The entire 2-D
boundary is specified via a set of live-wire segments in this fashion.
A drawback of this method is that the speed of optimal path computation
depends on image size. On modestly powered computers, for images of
even modest size, some sluggishness appears in user interaction, which
reduces the overall segmentation efficiency. In this work, we solve
this problem by exploiting some known properties of graphs to avoid
unnecessary minimum-cost path computation during segmentation. In live
wire on the fly, when the user selects a point on the boundary the
live-wire segment is computed and displayed in real time from the
selected point to any subsequent position of the cursor in the image,
even for large images and even on low-powered computers. Based on 492
tracing experiments from an actual medical application, we demonstrate
that live wire on the fly is 1.3-31 times faster than live wire for
actual segmentation for varying image sizes, although the pure
computational part alone is found to be about 120 times faster.
|
525. | Chen, YM, Vemuri, BC, and Wang, L, "Image denoising and segmentation via nonlinear diffusion," COMPUTERS & MATHEMATICS WITH APPLICATIONS, vol. 39, pp. 131-149, 2000.
Abstract:
Image denoising and segmentation are fundamental problems in the field
of image processing and computer vision with numerous applications. In
this paper, we present a nonlinear PDE-based model for image denoising
and segmentation which unifies the popular model of Alvarez, Lions and
Morel (ALM) for image denoising and the Caselles, Kimmel and Sapiro
model of geodesic "snakes". Our model includes nonlinear diffusive as
well as reactive terms and leads to quality denoising and segmentation
results as depicted in the experiments presented here. We present a
proof for the existence, uniqueness, and stability of the viscosity
solution of this PDE-based model. The proof is in spirit similar to the
proof of the ALM model; how ever, there are several differences which
arise due to the presence of the reactive terms that require careful
treatment/consideration. A fast implementation of our model is realized
by embedding the model in a scale space and then achieving the solution
via a dynamic system governed by a coupled system of first-order
differential equations. The dynamic system finds the solution at a
coarse scale and tracks it continuously to a desired fine scale. We
demonstrate the smoothing and segmentation results on several real
images. (C) 2000 Elsevier Science Ltd. All rights reserved.
|
526. | Pollak, I, Willsky, AS, and Krim, H, "Image segmentation and edge enhancement with stabilized inverse diffusion equations," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 9, pp. 256-266, 2000.
Abstract:
We introduce a family of first-order multidimensional ordinary
differential equations (ODE's) with discontinuous right-hand sides and
demonstrate their applicability in image processing. An equation
belonging to this family is an inverse diffusion everywhere except at
local extrema, where some stabilization is introduced. For this reason,
we call these equations "stabilized inverse diffusion equations"
(SIDE's), Existence and uniqueness of solutions, as well as stability,
are proven for SIDE's, A SIDE in one spatial dimension may be
interpreted as a limiting case of a semi-discretized Perona-Malik
equation [14], [15], In an experimental section, SIDE's are shown to
suppress noise while sharpening edges present in the input signal,
Their application to image segmentation is also demonstrated.
|
527. | Lee, WS, and Magnenat-Thalmann, N, "Fast head modeling for animation," IMAGE AND VISION COMPUTING, vol. 18, pp. 355-364, 2000.
Abstract:
This paper describes an efficient method to make individual faces for
animation from several possible inputs. We present a method to
reconstruct a three-dimensional (3D) facial model for animation from
two orthogonal pictures taken from front and side views, or from range
data obtained from any available resources. It is based on extracting
features on a face in a semiautomatic way and modifying a generic model
with detected feature points. Then fine modifications follow if range
data is available. Automatic texture mapping is employed using an image
composed from the two images. The reconstructed 3D-face can be animated
immediately with given expression parameters. Several faces by obtained
one methodology applied to different input data to get a final
animatable face are illustrated. (C) 2000 Elsevier Science B.V. All
rights reserved.
|
528. | Lengagne, R, Fua, P, and Monga, O, "3D stereo reconstruction of human faces driven by differential constraints," IMAGE AND VISION COMPUTING, vol. 18, pp. 337-343, 2000.
Abstract:
Conventional stereo algorithms often fail in accurately reconstructing
a 3D object because the image data do not provide enough information
about the geometry of the object. We propose a way to incorporate a
priori information in a reconstruction process from a sequence of
calibrated face images. A 3D mesh modeling the face is iteratively
deformed in order to minimize an energy function. Differential
information extracted from the object shape is used to generate an
adaptive mesh. We also propose to explicitly incorporate a priori
constraints related to the differential properties of the surface where
the image information cannot yield an accurate shape recovery. (C) 2000
Elsevier Science B.V. All rights reserved.
|
529. | Blank, M, and Kalender, WA, "Medical volume exploration: gaining insights virtually," EUROPEAN JOURNAL OF RADIOLOGY, vol. 33, pp. 161-169, 2000.
Abstract:
Since modern imaging modalities deliver huge amounts of data, which
cannot be assessed easily, the visualization techniques are utilized to
emphasize the structures of interest. To compare them, the different
visualization techniques (maximum intensity projection, multiplanar
reformations, shaded surface display and volume rendering) are
regressed to a common ground whereby their strengths and weaknesses can
be revealed. Additionally, medical image analysis can detect anatomical
objects in volumetric data sets and provides their descriptions for
further use. Usually, segmentation plays a crucial roll in that
process. There are many segmentation methods which can be categorized
in boundary-based and content-based ones. The extraction of anatomical
objects also allows their quantification. Image analysis and
visualization do not squeeze more information out of a data volume, but
they provide different ways to look at it. As in real life, this alone
may enlarge the insight. (C) 2000 Elsevier Science Ireland Ltd. All
rights reserved.
|
530. | Lei, ZB, and Lin, YT, "3D shape inferencing and modeling for video retrieval," JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, vol. 11, pp. 41-57, 2000.
Abstract:
We present a geometry-based indexing approach for the retrieval of
video databases. It consists of two modules: 3D object shape
inferencing from video data and geometric modeling from the
reconstructed shape structure. A motion-based segmentation algorithm
employing feature block tracking and principal component split is used
for multi-moving-object motion classification and segmentation. After
segmentation, feature blocks from each individual object are used to
reconstruct its motion and structure through a factorization method.
The estimated shape structure and motion parameters are used to
generate the implicit polynomial model for the object. The video data
is retrieved using the geometric structure of objects and their spatial
relationship. We generalize the 2D string to 3D to compactly encode the
spatial relationship of objects. (C) 2000 Academic Press.
|
531. | Shishido, O, Yoshida, N, and Umino, O, "Image processing experiments for computer-based three-dimensional reconstruction of neurones from electron micrographs from serial ultrathin sections," JOURNAL OF MICROSCOPY-OXFORD, vol. 197, pp. 224-238, 2000.
Abstract:
This study examined an image processing technique that uses a computer
to reconstruct a three-dimensional image of neurones from electron
micrographs of serial ultrathin sections. The major problems involved
were: (a) a distortion of features in electron micrographs; (b) a
significant change of cross-section features of neurones in electron
micrographs of neighbouring sections; and (c) disagreement between the
electron microscopic section face and the coordinate plane desired for
the reconstruction. Electron micrographs of a retinal bipolar cell
stained with a biotinylated tracer were used. We corrected the
distortion of features by means of a warp, a widely used algorithm in
morphing image processing. The change of features between neighbouring
electron micrographs was minimized by filling the gaps with an
interpolated image produced by a dissolve, another algorithm in
morphing, as well as the warp. The distortion of the three-dimensional
reconstructed image made by piling up features was corrected by making
the image with a wire frame model. Furthermore, in order to estimate a
closed contour of features, an active contour model, Snakes, was
applied to the electron microscope features. Snakes successfully
detected the contour of the target feature, but in some electron
microscope images broke into the target feature.
|
532. | Rabben, SI, Torp, AH, Stoylen, A, Slordahl, S, Bjornstad, K, Haugen, BO, and Angelsen, B, "Semiautomatic contour detection in ultrasound M-mode images," ULTRASOUND IN MEDICINE AND BIOLOGY, vol. 26, pp. 287-296, 2000.
Abstract:
We have developed a method for semiautomatic contour detection in
M-mode images. The method combines tissue Doppler and grey-scale data,
It was used to detect: 1. the left endocardium of the septum, the
endocardium and epicardium of the posterior wall in 16 left ventricular
short-axis M-modes, and 2. the mitral ring in 38 anatomical M-modes
extracted pair-wise in 19 apical four-chamber cine-loops (healthy
subjects). We validated the results by comparing the computer-generated
contours with contours manually outlined by four echocardiographers.
For all boundaries, the average distance between the computer-generated
contours and the manual outlines was smaller than the average distance
between the manual outlines. We also calculated left ventricular wall
thickness and diameter at end-diastole and end-systole and lateral and
septal mitral ring excursions, and found, on average, clinically
negligible differences between the computer-generated indices and the
same indices based on manual outlines (0.8-1.8 mm), The results were
also within published normal values. In conclusion, this initial study
showed that it was feasible in a robust and efficient manner to detect
continuous wall boundaries in M-mode images so that tracings of left
ventricular wall thickness, diameter and long axis could be derived.
(C) 2000 World Federation for Ultrasound in Medicine & Biology.
|
533. | MacDonald, D, Kabani, N, Avis, D, and Evans, AC, "Automated 3-D extraction of inner and outer surfaces of cerebral cortex from MRI," NEUROIMAGE, vol. 12, pp. 340-356, 2000.
Abstract:
Automatic computer processing of large multidimensional images such as
those produced by magnetic resonance imaging (MRI) is greatly aided by
deformable models, which are used to extract, identify, and quantify
specific neuroanatomic structures. A general method of deforming
polyhedra is presented here, with two novel features, First, explicit
prevention of self-intersecting surface geometries is provided, unlike
conventional deformable models, which use regularization constraints to
discourage but not necessarily prevent such behavior. Second,
deformation of multiple surfaces with intersurface proximity
constraints allows each surface to help guide other surfaces into place
using model-based constraints such as expected thickness of an anatomic
surface. These two features are used advantageously to identify
automatically the total surface of the outer and inner boundaries of
cerebral cortical gray matter from normal human MR images, accurately
locating the depths of the sulci, even where noise and partial volume
artifacts in the image obscure the visibility of sulci. The extracted
surfaces are enforced to be simple two-dimensional manifolds (having
the topology of a sphere), even though the data may have topological
holes, This automatic 3-D cortex segmentation technique has been
applied to 150 normal subjects, simultaneously extracting both the
gray/white and gray/cerebrospinal fluid interface from each individual.
The collection of surfaces has been used to create a spatial map of the
mean and standard deviation for the location and the thickness of
cortical gray matter. Three alternative criteria for defining cortical
thickness at each cortical location were developed and compared. These
results are shown to corroborate published postmortem and in vivo
measurements of cortical thickness. (C) 2000 Academic Press.
|
534. | Zhong, Y, and Jain, AK, "Object localization using color, texture and shape," PATTERN RECOGNITION, vol. 33, pp. 671-684, 2000.
Abstract:
We address the problem of localizing objects using color, texture and
shape. Given a handrawn sketch for querying an object shape. and its
color and texture, the proposed algorithm automatically searches the
image database for objects which meet the query attributes. The
database images do not need to be presegmented or annotated. The
proposed algorithm operates in two stages. In the first stage, we use
local texture and color features to find a small number of candidate
images in the database, and identify regions in the candidate images
which share similar texture and color as the query. To speed up the
processing, the texture and color features are directly extracted from
the Discrete Cosine Transform (DCT) compressed domain. In the second
stage. we use a deformable template matching method to match the query
shape to the image edges at the locations which possess the desired
texture and color attributes. This algorithm is different from other
content-based image retrieval algorithms in that: (i) no
presegmentation of the database images is needed, and (ii) the color
and texture features are directly extracted from the compressed images.
Experimental results demonstrate performance of the algorithm and show
that substantial computational savings can be achieved by utilizing
multiple image cues. (C) 2000 Pattern Recognition Society. Published by
Elsevier Science Ltd. All rights reserved.
|
535. | Suri, JS, Haralick, RM, and Sheehan, FH, "Greedy algorithm for error correction in automatically produced boundaries from low contrast ventriculograms," PATTERN ANALYSIS AND APPLICATIONS, vol. 3, pp. 39-60, 2000.
Abstract:
Non-homogeneous mixing of the dye with the blood in the left ventricle
chamber of the heart causes poor contrast in the ventriculograms. The
pixel-based classifiers [1] operating on these ventriculograms yield
boundaries which are not close to ground truth boundaries as delineated
by the cardiologist. They have a mean boundary error of 6.4 mm and an
error of 12.5 mm in the apex zone. These errors have a systematic
positional and orientational bias, the boundary being under-estimated
in the apex zone. This paper discusses two calibration methods: the
identical coefficient and the independent coefficient to remove these
systematic biases. From these methods, we constitute a fused algorithm
which reduces the boundary error compared to either of the calibration
methods. The algorithm, in a greedy way, computes which and how many
vertices of the left ventricle boundary can be taken from the computed
boundary of each method in order to best improve the performance. The
corrected boundaries have a mean error of less than 3.5 mm with a
standard deviation of 3.4 mm over the approximately 6 x 10(4) vertices
in the data set of 291 studies. Our method reduces the mean boundary
error by 2.9 mm over the boundary produced by the classifier. We also
show that the calibration algorithm performs better in the apex zone
where the dye is unable to propagate. For end diastole, the: algorithm
reduces the error in the apex zone by 8.5 mm over the pixel-based
classifier boundaries.
|
536. | Blom, AS, Pilla, JJ, Pusca, SV, Patel, HJ, Dougherty, L, Yuan, Q, Ferrari, VA, Axel, L, and Acker, MA, "Dynamic cardiomyoplasty decreases myocardial workload as assessed by tissue tagged MRI," ASAIO JOURNAL, vol. 46, pp. 556-562, 2000.
Abstract:
The effects of dynamic cardiomyoplasty (CMP) on global and regional
left ventricular (LV) function in end-stage heart failure still remain
unclear. MRI with tissue-tagging is a novel tool for studying
intramyocardial motion and mechanics. To date, no studies have
attempted to use MRI to simultaneously study global and regional
cardiac function in a model of CMP. In this study, we used MRI with
tissue-tagging and a custom designed MR compatible muscle
stimulating/pressure monitoring system to assess long axis regional
strain and displacement variations, as well as changes in global LV
function in a model of dynamic cardiomyoplasty. Three dogs underwent
rapid ventricular pacing (RVP; 215 BPM) For 10 weeks; after 4 weeks of
RVP, a left posterior CMP was performed. After 1 year of dynamic muscle
stimulation, the dogs were imaged in a 1.5 T clinical MR scanner.
Unstimulated and muscle stimulated tagged long axis images were
acquired. Quantitative 2-D regional image analysis was performed by
dividing the hearts into three regions: apical, septal, and lateral.
Maximum and minimum principal strains (lambda(1) and lambda(2)) and
displacement (D) were determined and pooled for each region. MR LV
pressure-volume (PV) loops were also generated. Muscle stimulation
produced a leftward shift of the PV loops in two of the three dogs, and
an increase in the peak LV pressure, while stroke volume remained
unchanged. With stimulation, lambda(1) decreased significantly (p <
0.05) in the lateral region, whereas lambda(2) increased significantly
(p < 0.05) in both the lateral and apical regions, indicating a
decrease in strain resulting from stimulation. D only increased
significantly (p < 0.05) in the apical region. The decrease in strain
between unassisted and assisted states indicates the heart is
performing less work, while maintaining stroke volume and increasing
peak LV pressure. These findings demonstrate that the muscle wrap
functions as an active assist, decreasing the workload of the heart,
while preserving total pump performance.
|
537. | Shen, DG, and Davatzikos, C, "An adaptive-focus deformable model using statistical and geometric information," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 22, pp. 906-913, 2000.
Abstract:
An active contour (snake) model is presented, with emphasis on medical
imaging applications. There are three main novelties in the proposed
model. First. an attribute vector is used to characterize the geometric
structure around each point of the snake model: the deformable model
then deforms in a way that seeks regions with similar attribute
vectors. This is in contrast to most deformable models, which deform to
nearby edges without considering geometric structure. and it was
motivated by the need to establish point-correspondences that have
anatomical meaning. Second, an adaptive-focus statistical model has
been suggested which allows the deformation of the active contour in
each stage to be influenced primarily by the most reliable matches.
Third, a deformation mechanism that is robust to local minima is
proposed by evaluating the snake energy function on segments of the
snake at a time, instead of individual points. Various experimental
results show the effectiveness of the proposed model.
|
538. | Jeon, BK, Jang, JH, and Hong, KS, "Map-based road detection in spaceborne synthetic aperture radar images based on curvilinear structure extraction," OPTICAL ENGINEERING, vol. 39, pp. 2413-2421, 2000.
Abstract:
This paper presents an automatic map-based road detection algorithm for
spaceborne synthetic aperture radar (SAR) images. Our goal is to find
roads in a SAR image with subpixel accuracy with the help of a digital
map. There are location errors between the digital map and the geocoded
SAR image, which are about 20 to 30 pixels, and we adopt a
coarse-to-fine strategy to reduce it. In the coarse matching step, we
roughly find the locations of roads by a simple search using water
areas or a generalized Hough transform based on digital map
information. The fine matching step detects roads accurately by using
the active contour model (snake). The input of the snake operation is
the potential field constructed from the extracted ridges or ravines of
curvilinear structures in the SAR image. Experimental results show that
our algorithm detects roads with average error of less than one pixel,
(C) 2000 Society of Photo-Optical Instrumentation Engineers.
[S0091-3286(00)01309-X].
|
539. | Haacke, EM, and Liang, ZP, "Challenges of imaging structure and function with MRI," IEEE ENGINEERING IN MEDICINE AND BIOLOGY MAGAZINE, vol. 19, pp. 55-62, 2000.
Abstract:
A semi-automatic system for determining volumes of interest (VOI) from
positron emission tomography (PET) scans of brain is described. The
VOIs surface extraction is based on user selectable threshold and
three-dimensional target flood-fill. Contrast to anatomical volume
detection approaches, Volumes are determined from functional PET images
and the obtained objects are checked against anatomical images. The
developed VOI program was evaluated with brain FDOPA-PET studies where
the striatum was the object. The results were comparable to entirely
manual method and the target extraction time is reduced to about one
third of manual method. (C) 2000 Elsevier Science Ireland Ltd. All
rights reserved.
|
540. | Mykkanen, JM, Juhola, M, and Ruotsalainen, U, "Extracting VOIs from brain PET images," INTERNATIONAL JOURNAL OF MEDICAL INFORMATICS, vol. 58, pp. 51-57, 2000.
Abstract:
A semi-automatic system for determining volumes of interest (VOI) from
positron emission tomography (PET) scans of brain is described. The
VOIs surface extraction is based on user selectable threshold and
three-dimensional target flood-fill. Contrast to anatomical volume
detection approaches, Volumes are determined from functional PET images
and the obtained objects are checked against anatomical images. The
developed VOI program was evaluated with brain FDOPA-PET studies where
the striatum was the object. The results were comparable to entirely
manual method and the target extraction time is reduced to about one
third of manual method. (C) 2000 Elsevier Science Ireland Ltd. All
rights reserved.
|
541. | Maksimovic, R, Stankovic, S, and Milovanovic, D, "Computed tomography image analyzer: 3D reconstruction and segmentation applying active contour models - 'snakes'," INTERNATIONAL JOURNAL OF MEDICAL INFORMATICS, vol. 58, pp. 29-37, 2000.
Abstract:
Many diagnostic and therapeutic procedures depend on medical images. In
order to overcome imperfections of the obtained images, which are due
to the acquisition process, and to extract new information from the
available images, many techniques have been developed. In this study, a
new method of image segmentation and 3D reconstruction based on active
contour models ('snakes') was applied in analyzing computed tomography
(CT) images in patients with acute head trauma. Using this method,
lesion to brain (LBR) and ventricle to brain ratio (VBR) parameters, as
well as 3D reconstruction of traumatic lesion, was obtained accurately.
In our study group, 215 patients (mean age 42.4 +/- 23.5 years, 138/215
(64.2%) males) were included. Among them, 72 (33.5%) did not survive
during hospitalisation in the Emergency Department. LBR correlated with
the Glasgow Coma Score and the intrahospital outcome (r = -0.457 and r
= 0.515, respectively). Besides, non-survivors had greater LTB values
(0.042 +/- 0.034) than survivors (0.005 +/- 0.011). However, VER did
not correlate with these clinical parameters. In addition, LBR was
significantly higher in the patients with other pathologic CT findings.
The proposed methodology, based on extracting maximum information from
available CT scans, could be a basis for further medical decision
making in patients with acute head trauma. (C) 2000 Elsevier Science
Ireland Ltd. All rights reserved.
|
542. | Rodriguez-Sanchez, R, Garcia, JA, Fdez-Valdivia, J, and Fdez-Vidal, XR, "Origins of illusory percepts in digital images," PATTERN RECOGNITION, vol. 33, pp. 2007-2017, 2000.
Abstract:
Here we show the relation between illusory percepts and statistical
regularities across scales and orientations. To this aim, the
performance of a computational model for the partitioning of
statistical regularities is analyzed on several tasks such as
long-range boundary completion, phase-induced contour detection, as
well as shape and size illusions. The system for the automatically
learned partitioning of statistical regularities in 2D images, is based
on a sophisticated, band-pass, filtering operation, with fixed scale
and orientation sensitivity. Experimental results are provided to
illustrate this analysis on several examples: (i) Kanizsa-type
subjective figures; (ii) phase-induced subjective contours; (iii) the
Zollner illusion; and (iv) the Muller-Lyer illusion. (C) 2000 Pattern
Recognition Society. Published by Elsevier Science Ltd. All rights
reserved.
|
543. | Yang, WF, and Smith, MR, "Using an MRI distortion transfer function to characterize the ghosts in motion-corrupted images," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 19, pp. 577-584, 2000.
Abstract:
Motion artefact suppression remains an active topic in MRI. In this
paper, we suggest that certain nonrigid, or spatially variant,
characteristics of motion of an object can be represented by extending
the work of Mitsa et al, This empirical extension uses a ghost
distortion transfer function (GTDF) applied to the k-space (frequency
domain) data. We demonstrate the variety of ghost characteristics that
can be generated from various two-dimensional (2-D) GTDF's, The
distortion transfer function for periodic motion along the Z-axis can
be determined from the nonoverlapped portions of the ghost and central
image, It required a GDTF with the shape of a belt bandpass filter to
produce an image corresponding to the ghosts of a volunteer's abdomen
image corrupted by unknown respiratory motion artefacts, The
preliminary results of a composite method of motion artefact
suppression are presented. The artefact suppression was successful for
ghost images described by a GDTF have a low-pass nature, but less
successful with ghosts have a GDTF of a bandpass nature.
|
544. | Yoshida, H, and Keserci, B, "Bayesian wavelet snake for computer-aided diagnosis of lung nodules," INTEGRATED COMPUTER-AIDED ENGINEERING, vol. 7, pp. 253-269, 2000.
Abstract:
An edge-guided active contour based on the wavelet transform called the
Bayesian wavelet snake has been developed for identifying a
closed-contour object with a fuzzy and low-contrast boundary. The
wavelet snake is designed to deform its shape based on a maximum a
posteriori estimate calculated by the fast wavelet transform. Our new
method was applied to a computer-aided diagnosis scheme for detection
of pulmonary nodules in digital chest radiographs. In this scheme, a
filter based on the edge gradient was employed for enhancement of
nodules, followed by creation of multiscale edges by spline wavelets
for extraction of portions of the boundary of a candidate nodule. These
multiscale edges are then used to "guide" the wavelet snake for
estimation of the boundary of the nodule. The degree of overlap between
the resulting snake and the multiscale edges was used as a feature for
distinguishing nodules from false-positive detections that consist of
only normal anatomic structures. The wavelet snake was combined with
morphological features by means of an artificial neural network for
further reduction of false detections. The performance of our scheme
was evaluated by receiver operating characteristic analysis based on a
publicly available database of chest radiographs.
|
545. | Senasli, M, Garnero, L, Herment, A, and Mousseaux, E, "3D reconstruction of vessel lumen from very few angiograms by dynamic contours using a stochastic approach," GRAPHICAL MODELS, vol. 62, pp. 105-127, 2000.
Abstract:
3D luminal vessel geometry description and visualization are important
for the diagnosis and the prognosis of heart attack and stroke. A
general mathematical framework is proposed for 3D reconstruction of
vessel sections from a few angiograms, Regularization is introduced by
modeling the vessel boundary slices by smooth contours to get the
reconstruction problem well posed. A dynamic contour approach is
applied to optimize the shape of the contour according to the recorded
angiograms and the internal smoothness constraints. The solution is
achieved following the minimization of a nonconvex energy function
assigned to the contour with a simulated annealing algorithm.
Preliminary testing on noisy and truncated synthetic images produces
promising results, Evaluation and validation of the method on hardware
phantoms are also presented. (C) 2000 Academic Press.
|
546. | Lurig, C, Kobbelt, L, and Ertl, T, "Hierarchical solutions for the deformable surface problem in visualization," GRAPHICAL MODELS, vol. 62, pp. 2-18, 2000.
Abstract:
In this paper we present a hierarchical approach for the deformable
surface technique. This technique is a three dimensional extension of
the snake segmentation method. We use it in the context of visualizing
three dimensional scalar data sets. In contrast to classical indirect
volume visualization methods, this reconstruction is not based on
iso-values but on boundary information derived from discontinuities in
the data. We propose a multilevel adaptive finite difference solver,
which generates a target surface minimizing an energy functional based
on an internal energy of the surface and an outer energy induced by the
gradient of the volume. The method is attractive for preprocessing in
numerical simulation or texture mapping. Red-green triangulation allows
adaptive refinement of the mesh. Special considerations help to prevent
self interpenetration of the surfaces. We will also show some
techniques that introduce the hierarchical aspect into the
inhomogeneity of the partial differential equation. The approach proves
to be appropriate for data sets that contain a collection of objects
separated by distinct boundaries. These kind of data sets often occur
in medical and technical tomography, as we will demonstrate in a few
examples. (C) 2000 Academic Press.
|
547. | Paragios, N, and Deriche, R, "Geodesic active contours and level sets for the detection and tracking of moving objects," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 22, pp. 266-280, 2000.
Abstract:
This paper presents a new variational framework for detecting and
tracking multiple moving objects in image sequences. Motion detection
is performed using a statistical framework for which the observed
interframe difference density function is approximated using a mixture
model. This model is composed of two components, namely, the static
(background) and the mobile (moving objects) one. Both components are
zero-mean and obey Laplacian or Gaussian law. This statistical
framework is used to provide the motion detection boundaries.
Additionally, the original frame is used to provide the moving object
boundaries. Then, the detection and the tracking problem are addressed
in a common framework that employs a geodesic active contour objective
function. This function is minimized using a gradient descent method,
where a flow deforms the initial curve towards the minimum of the
objective function, under the influence of internal and external image
dependent forces. Using the level set formulation scheme, complex
curves can be detected and tracked white topological changes for the
evolving curves are naturally managed. To reduce the computational cost
required by a direct implementation of the level set formulation
scheme, a new approach named Hermes is proposed. Hermes exploits
aspects from the well-known front propagation algorithms (Narrow Band.
Fast Marching) and compares favorably to them. Very promising
experimental results are provided using real video sequences.
|
548. | Cremers, D, Schnorr, C, Weickert, J, and Schellewald, C, "Diffusion-snakes using statistical shape knowledge," ALGEBRAIC FRAMES FOR THE PERCEPTION-ACTION CYCLE, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1888, pp. 164-174, 2000.
Abstract:
We present a novel extension of the Mumford-Shah functional that allows
to incorporate statistical shape knowledge at the computational level
of image segmentation. Our approach exhibits various favorable
properties: non-local convergence, robustness against noise, and the
ability to take into consideration both shape evidence in given image
data and knowledge about learned shapes. In particular, the latter
property distinguishes our approach from previous work on
contour-evolution based image segmentation. Experimental results
confirm these properties.
|
549. | Ravi, D, "A new active contour model for shape extraction," MATHEMATICAL METHODS IN THE APPLIED SCIENCES, vol. 23, pp. 709-722, 2000.
Abstract:
We propose a new active contour model for shape extraction of objects
in grey-valued two-dimensional images based on an energy-minimization
formulation. The energy functional that we consider takes into account
the two requirements of object isolation and smoothness of the contour.
After deriving the Euler-Lagrange equations corresponding to the energy
functional, we bring out some important geometric properties of a
solution to these equations. The discussion on our solution method-with
the help of which we try to minimize the energy functional by evolving
an initial curve-also focuses on how to prescribe the initial curve
fully automatically. The effectiveness of our algorithms is
demonstrated with the help of experimental results. Copyright (C) 2000
John Wiley & Sons, Ltd.
|
550. | Chung, DH, and Sapiro, G, "Segmenting skin lesions with partial-differential-equations-based image processing algorithms," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 19, pp. 763-767, 2000.
Abstract:
In this paper, a partial-differential equations (PDE)-based system for
detecting the boundary of skin lesions in digital clinical skin images
is presented. The image is first preprocessed via contrast-enhancement
and anisotropic diffusion. If the lesion is covered by hairs, a
PDE-based continuous morphological filter that removes them is used as
an additional preprocessing step. Following these steps, the skin
lesion is segmented either by the geodesic active contours model or the
geodesic edge tracing approach. These techniques are based on
computing, again via PDEs, a geodesic curve in a space defined by the
image content. Examples showing the performance of the algorithm are
given.
|
551. | Xuan, JH, Adali, T, Wang, Y, and Siegel, E, "Automatic detection of foreign objects in computed radiography," JOURNAL OF BIOMEDICAL OPTICS, vol. 5, pp. 425-431, 2000.
Abstract:
This paper presents an effective two-step scheme for automatic object
detection in computed radiography (CR) images. First, various structure
elements of the morphological filters, designed by incorporating
available morphological features of the objects of interest including
their sizes and rough shape descriptions, are used to effectively
distinguish the foreign object candidates from the complex background
structures. Second, since the boundaries of the objects are the key
features in reflecting object characteristics, active contour models
are employed to accurately outline the morphological shapes of the
suspicious foreign objects to further reduce the rate of false alarms.
The actual detection scheme is accomplished by jointly using these two
steps. The proposed methods are tested with a database of 50 hand-wrist
computed radiographic images containing various types of foreign
objects. Our experimental results demonstrate that the combined use of
morphological filters and active contour models can provide an
effective automatic detection of foreign objects in CR images achieving
good sensitivity and specificity, and the accurate descriptions of the
object morphological characteristics. (C) 2000 Society of Photo-Optical
Instrumentation Engineers. [S1083-3668(00)00704-8].
|
552. | Ida, T, and Sambonsugi, Y, "Self-affine mapping system and its application to object contour extraction," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 9, pp. 1926-1936, 2000.
Abstract:
A self-affine mapping system which has conventionally been used to
produce fractal images is used to fit rough lines to contours. The
self-affine map's parameters are detected by analyzing the blockwise
self-similarity of a grayscale image using a simplified algorithm in
fractal encoding. The phenomenon that edges attract mapping points in
self-affine mapping is utilized in the proposed method. The boundary of
the foreground region of an alpha mask is fitted by mapping iterations
of the region. It is shown that the proposed method accurately produces
not only smooth curves but also sharp corners, and has the ability to
extract both distinct edges and blurred edges using the same parameter.
It is also shown that even large gaps between the hand-drawn line and
the contour can be fitted well by the recursive procedure of the
proposed algorithm, in which the block size is progressively decreased.
These features reduce the time required for drawing contours by hand.
|
553. | Suri, JS, "Computer vision, pattern recognition and image processing in left ventricle segmentation: The last 50 years," PATTERN ANALYSIS AND APPLICATIONS, vol. 3, pp. 209-242, 2000.
Abstract:
In the last decade, computer vision, pattern recognition, image
processing and cardiac researchers have given immense attention to
cardiac image analysis and modelling. This paper surveys
state-of-the-are computer vision and pattern recognition techniques for
Left Ventricle (LV) segmentation and modelling juring the second half
of the twentieth century The paper presents the key characteristics of
successful model-based segmentation techniques for LV modelling. This
sun ey paper concludes the following: (1) any one pattern recognition
or computer vision technique is nut sufficient for accurate 2D, 3D or
4D modelling of LV; (2) fitting mathematical models for LV modelling
have dominated in the last 15 years; (3) knowledge extracted from the
ground truth has lead to very successful attempts at LV modelling; (4)
spatial and temporal behaviour of LV through different imaging
modalities has yielded information which has led to accurate LV
modelling; and (5) not much attention has bern paid to LV modelling
validation.
|
554. | Wang, HY, and Ghosh, B, "Geometric active deformable models in shape modeling," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 9, pp. 302-308, 2000.
Abstract:
This paper analyzes the problem of shape modeling using the principle
of active geometric deformable models. While the basic modeling
technique already exists in the literature, we highlight many of its
drawbacks and discuss their source and steps to overcome them. We
propose a new stopping criterion to address the stopping problem. We
also propose to apply level set algorithm to implement the active
geometric deformable models, thereby handling topology changes
automatically. To alleviate the numerical problems associated with the
implementation of the level set algorithm, we propose a new adaptive
multigrid narrow band algorithm. All the proposed new changes have been
illustrated with experiments with synthetic images and medical images.
|
555. | Park, J, and Park, SI, "Strain analysis and visualization: left ventricle of a heart," COMPUTERS & GRAPHICS-UK, vol. 24, pp. 701-714, 2000.
Abstract:
Clinical utility of computational models is crucial in the applications
of medical data visualization. Previously we have developed a new class
of volumetric models whose parameters are functions in conjunction with
physically based deformable modeling framework, and have applied the
technique to estimate the left ventricular (LV) wall motion. We have
successfully showed that the model parameter functions characterize the
LV motion of normal and abnormal stares and that no further non-trivial
post-processing is required for anatomically meaningful interpretation.
In an effort to evaluate the LV model, this paper presents a method and
results from a strain analysis based on the nodal displacements of the
deformable LV model. Furthermore, in order to visualize the local
quantities on the volumetric model for an effective analysis, we also
developed a methodology to assist in assessing the cardiac function
utilizing principal strains, Von-Mises' yield criteria, and a smoothing
filter. Each strain tensor component,vas in the range of values
observed in other reported studies. The application of a smoothing
filter on the model improved in visualizing the overall trend of each
strain variation. With our platform for a comprehensive strain
analysis, we have augmented a clinical utility to the deformable models
with parameter functions, (C) 2000 Elsevier Science Ltd. All rights
reserved.
|
556. | Shin, H, Stamm, G, Hogemann, D, and Galanski, M, "Basic principles of data acquisition and data processing in the construction of high-quality virtual models," RADIOLOGE, vol. 40, pp. 304-312, 2000.
Abstract:
Creating models for virtual reality subdivides into several steps. The
aim of the data acquisition is the extraction of nearly isotropic (same
solution in all three axes) data sets with low noise content. An
approximate isotropy can be achieved by suitable choice of scan
parameters. For raw data reconstruction, the application of
high-resolution reconstruction algorithms is prohibited due to
increased noise. A missing isotropy can computationally be approximated
by interpolation. Further noise suppression is achieved by applying
filters. Additionally, the contrast of the object for segmentation can
be increased by image processing operators. The correct choice of the
segmentation method and the editing tools is essential for a precise
segmentation with minimal user interaction. Prior to
visualization,smoothing the shape of the segmented model (shape-based
or morphological interpolation, polygon reduction of wire frame model)
further improves the visual appearance of the 3D model.
|
557. | Loreti, P, and March, R, "Propagation of fronts in a nonlinear fourth order equation," EUROPEAN JOURNAL OF APPLIED MATHEMATICS, vol. 11, pp. 203-213, 2000.
Abstract:
We consider a geometric motion associated with the minimization of a
curvature dependent functional. which is related to the Willmore
functional. Such a functional arises in connection with the image
segmentation problem in computer vision theory. We show by using formal
asymptotics that the geometric motion can be approximated by the
evolution of the zero level set of the solution of a nonlinear
fourth-order equation related to the Cahn-Hilliard and Allen-Cahn
equations.
|
558. | Kovalski, G, Beyar, R, Shofti, R, and Azhari, H, "Three-dimensional automatic quantitative analysis of intravascular ultrasound images," ULTRASOUND IN MEDICINE AND BIOLOGY, vol. 26, pp. 527-537, 2000.
Abstract:
Intravascular ultrasound (IVUS) has established itself as a useful tool
for coronary assessment, The vast amount of data obtained by a single
IVUS study renders manual analysis impractical for clinical use, A
computerized method is needed to accelerate the process and eliminate
user-dependency. In this study, a new algorithm is used to identify the
lumen border and the media-adventitia border (the external elastic
membrane). Setting an initial surface on the IVUS catheter perimeter
and using active contour principles, the surface inflates until virtual
force equilibrium defined by the surface geometry and image features is
reached, The method extracts these features in three dimensions (3-D),
Eight IVUS procedures were performed using an automatic pullback
device. Using the ECG signal for synchronization, sets of images
covering the entire studied region and corresponding to the same
cardiac phase were sampled. Lumen and media-adventitia border contours
were traced manually and compared to the automatic results obtained by
the suggested method. Linear regression results for vessel area
enclosed by the lumen and media-adventitia border indicate high
correlation between manual vs, automatic tracings (y = 1.07 x -0.38; r
= 0.98; SD = 0.112 mm(2); n = 88), These results indicate that the
suggested algorithm may potentially provide a clinical tool for
accurate lumen and plaque assessment. (C) 2000 World Federation for
Ultrasound in Medicine & Biology.
|
559. | Magnenat-Thalmann, N, and Cordier, F, "Construction of a human topological model from medical data," IEEE TRANSACTIONS ON INFORMATION TECHNOLOGY IN BIOMEDICINE, vol. 4, pp. 137-143, 2000.
Abstract:
Medical imaging can provide data for useful views of the interior
details of human anatomy. In addition to visualization, which in
general has been the primary reason for obtaining these data, many
other uses are possible, These include modeling of different elements
and their inter-relationships-topological modeling, simulation of
physical processes, analysis of movements, and validation of models,
Here, we describe some of the modeling issues from medical imaging. The
issues are particularly related to topological modeling of different
anatomical elements: bones, muscles, articulations, etc. A
three-dimensional topological modeler is presented with which
anatomists and other users can build a topological database containing
structural, topological, and mechanical information of anatomical
elements.
|
560. | Viblis, MK, and Kyriakopoulos, KJ, "Gesture recognition: The gesture segmentation problem," JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS, vol. 28, pp. 151-158, 2000.
Abstract:
The gesture segmentation problem is introduced as the first step
towards visual gesture recognition i.e. with the detection, analysis
and recognition of gestures from sequences of real images. Our gesture
segmentation scheme is composed of two steps: accurate gesture contour
tracking in space domain, and continuous tracking in time domain.
Experimental results and implementations issues are presented.
|
561. | Urayama, S, Matsuda, T, Sugimoto, N, Mizuta, S, Yamada, N, and Uyama, C, "Detailed motion analysis of the left ventricular myocardium using an MR tagging method with a dense grid," MAGNETIC RESONANCE IN MEDICINE, vol. 44, pp. 73-82, 2000.
Abstract:
Detailed analysis of myocardial deformation through a whole cardiac
cycle was accomplished using a tagging method with a high-density grid.
Four sets of tagged images with a 4-mm-spacing grid were measured by
generating four tagging pulses arranged at regular intervals in the
cardiac cycle. Through each set of images, tag intersections were
tracked semi-automatically. The estimated motions of tag intersections
were concatenated so that sequential positions of myocardium were
connected through a whole cardiac cycle. In vitro evaluation of the
precision of this technique showed that the mean error of tracked 4-mm
tag intersections was less than 0.47 +/- 0.17 mm, even on the quite
low-contrast images, and the concatenation error caused by double
concatenation was comparable to the interpolation error in the
subendocardial area obtained with 8-mm tag intersection motion. The
small difference between the two mean distance curves of the in vivo
evaluation indicated that the method is useful for analyzing heart wall
abnormalities. (C) 2000 Wiley-Liss, Inc.
|
562. | Samson, C, Blanc-Feraud, L, Aubert, G, and Zerubia, J, "A variational model for image classification and restoration," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 22, pp. 460-472, 2000.
Abstract:
Herein, we present a variational model devoted to image classification
coupled with an edge-preserving regularization process. The discrete
nature of classification (i.e., to attribute a label to each pixel) has
led to the development of many probabilistic image classification
models, but rarely to variational ones. In the last decade, the
variational approach has proven its efficiency in the field of
edge-preserving restoration. In this paper, we add a classification
capability which contributes to provide images composed of homogeneous
regions with regularized boundaries, a region being defined as a set of
pixels belonging to the same class. The soundness of our model is based
on the works developed on the phase transition theory in mechanics. The
proposed algorithm is fast, easy to implement, and efficient. We
compare our results on both synthetic and satellite images with the
ones obtained by a stochastic model using a Potts regularization.
|
563. | Vemuri, BC, and Guo, YL, "Snake pedals: Compact and versatile geometric models with physics-based control," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 22, pp. 445-459, 2000.
Abstract:
In this paper, we introduce a novel geometric shape modeling scheme
which allows for representation of global and local shape
characteristics of an object. Geometric models are traditionally
well-suited for representing global shapes without local detail.
However, we propose a powerful geometric shape modeling scheme which
allows for the representation of global shapes with local detail and
permits model shaping as well as topological changes via physics-based
control. The proposed modeling scheme consists of representing shapes
by pedal curves and surfaces-pedal curves/surfaces are the loci of the
foot of perpendiculars to the tangents of a fixed curve/surface from a
fixed point called the pedal point. By varying the location of the
pedal point, one can synthesize a large class of shapes which exhibit
both local and global deformations. We introduce physics-based control
for shaping these geometric models by letting the pedal point vary and
use a snake to represent the position of this varying pedal point. The
model dubbed as a "snake pedal" allows for interactive manipulation via
forces applied to the snake. We develop a fast numerical iterative
algorithm for shape recovery from image data using this geometric shape
modeling scheme. The algorithm involves the Levenberg-Marquardt (LM)
method in the outer loop for solving the global parameters and the
Alternating Direction Implicit (ADI) method in the inner loop for
solving the local parameters of the model. The combination of the
global and local scheme leads to an efficient numerical solution to the
model fitting problem. We demonstrate the applicability of this
modeling scheme via examples of shape synthesis and shape estimation
from real image data.
|
564. | Shih, WSV, Lin, WC, and Chen, CT, "Volumetric morphologic deformation method for intersubject image registration," INTERNATIONAL JOURNAL OF IMAGING SYSTEMS AND TECHNOLOGY, vol. 11, pp. 117-124, 2000.
Abstract:
An automated image processing method is proposed for anatomic
standardization that can elastically map one subject's magnetic
resonance image (MRI) to a standard reference MRI to enable
intersubject and cross-group studies. In this method, linear
transformations based on bicommissural stereotaxy are first applied to
grossly align the input image to the reference image. Then. the
candidate corresponding regions in the input image are identified based
on the contour information from the presegmented reference image. Next,
an active contour model is employed to refine the contour description
of the input image. Based on the contour correspondence established in
these previous steps, a nonlinear transformation is determined using
the proposed weighted local reference coordinate systems to warp the
input Image. In this method, geometric correspondence established based
on contour matching is used to control the warping and the actual image
values corresponding to registered coordinates need not be similar. We
tested this algorithm on various synthetic and real images for
intersubject registration of MRIs. (C) 2000 John Wiley & Sons, Inc.
|
565. | Laptev, I, Mayer, H, Lindeberg, T, Eckstein, W, Steger, C, and Baumgartner, A, "Automatic extraction of roads from aerial images based on scale space and snakes," MACHINE VISION AND APPLICATIONS, vol. 12, pp. 23-31, 2000.
Abstract:
We propose a new approach for automatic road extraction from aerial
imagery with a model and a strategy mainly based on the multi-scale
detection of roads in combination with geometry-constrained edge
extraction using snakes. A main advantage of our approach is, that it
allows for the first time a bridging of shadows and partially occluded
areas using the heavily disturbed evidence in the image. Additionally,
it has only few parameters to be adjusted. The road network is
constructed after extracting crossings with varying shape and topology.
We show the feasibility of the approach not only by presenting
reasonable results but also by evaluating them quantitatively based on
ground truth.
|
566. | Grace, AE, Pycock, D, Tillotson, HT, and Snaith, MS, "Active shape from stereo for highway inspection," MACHINE VISION AND APPLICATIONS, vol. 12, pp. 7-15, 2000.
Abstract:
This paper describes an unsupervised algorithm for estimating the 3D
profile of potholes in the highway surface, using structured
illumination. Structured light is used to accelerate computation and to
simplify the estimation of range. A low-resolution edge map is
generated so that further processing may be focused on relevant regions
of interest. Edge points in each region of interest are used to
initialise open, active contour models, which are propagated and
refined, via a pyramid, to a higher resolution. At each resolution,
internal and external constraints are applied to a snake; the internal
constraint is a smoothness function and the external one is a
maximum-likelihood estimate of the grey-level response at the edge of
each light stripe. Results of a provisional evaluation study indicate
that this automated procedure provides estimates of pothole dimension
suitable for use in a first, screening, assessment of highway condition.
|
567. | Frost, AR, Tillett, RD, and Welch, SK, "The development and evaluation of image analysis procedures for guiding a livestock monitoring sensor placement robot," COMPUTERS AND ELECTRONICS IN AGRICULTURE, vol. 28, pp. 229-242, 2000.
Abstract:
The over all objective of the work described here is to develop a
robotic system capable of holding a sensor in contact with any one of a
set of pre-determined positions on the body of a loosely constrained
live animal. This paper is concerned with generating sets of
coordinates corresponding to the target points on the animal's body.
The problem was approached using image analysis. Models were
established to predict the positions of arbitrary points on the body of
a pig from the positions of features in the image of the periphery of
the pig, which could be measured automatically. From measurements of
the movements of pigs in a feeding stall it was shown that the
resultant error in the predicted position of an arbitrary point on the
pig's body was comparable to that which could be expected from a human
operator. The approach of using image analysis to guide a livestock
monitoring sensor placement robot shows considerable Promise. and is
worthy of further investigation. Future work should concentrate on
establishing the generality of target point prediction models. (C) 2000
Elsevier Science B.V. All rights reserved.
|
568. | Haber, I, Metaxas, DN, and Axel, L, "Using tagged MRI to reconstruct a 3D heartbeat," COMPUTING IN SCIENCE & ENGINEERING, vol. 2, pp. 18-30, 2000.
Abstract:
Magnetic resonance imaging tissue tagging is a decade-old method that
lets scientists follow the motion of a beating heart. The method
described here reconstructs 3D motion from multiple 2D MRI images to
find new information about the right ventricle.
|
569. | Tannenbaum, A, "On the eye tracking problem: a challenge for robust control," INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL, vol. 10, pp. 875-888, 2000.
Abstract:
Eye tracking is one of the key problems in controlled active vision.
Because of modelling uncertainty and noise in the signals, it becomes a
challenging problem for robust control. In this paper, we outline some
of the key issues involved as well as some possible solutions. We will
need to make contact with techniques from machine vision and
multi-scale image processing in carrying out this task. In particular,
we will sketch some of the necessary methods from computer vision and
image processing including optical flow, active contours ('snakes'),
and geometric driven flows. The paper will thus have a tutorial flavor
as well. Copyright (C) 2000 John Wiley & Sons, Ltd.
|
570. | Fan, LX, Santago, P, Jiang, H, and Herrington, DM, "Ultrasound measurement of brachial flow-mediated vasodilator response," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 19, pp. 621-631, 2000.
Abstract:
Brachial artery flow-mediated vasodilation is increasingly used as a
measure of endothelial function. High resolution ultrasound provides a
noninvasive method to observe this flow-mediated vasodilation by
monitoring the diameter of the artery over time following a transient
flow stimulus. Since hundreds of ultrasound images are required to
continuously monitor brachial diameter for the 2-3 min during which the
vasodilator response occurs, an automated diameter estimation is
desirable. However, vascular ultrasound images suffer from structural
noise caused by the constructive and destructive interference of the
backscattered signals, and the true boundaries of interest that define
the diameter are frequently obscured by the multiple-layer structure of
the vessel wall, These problems make automated diameter estimation
strategies based on the detection of the vessel wall boundary
difficult. We obtain a robust automated measurement of the vasodilator
response by automatically locating the artery using a variable window
method, which gives both the lumen center and width. The vessel wall
boundary is detected by a global constraint deformable model, which is
insensitive to the structural noise in the boundary area, The ambiguity
between the desired boundary and other undesired boundaries is resolved
by a spatiotemporal strategy. Our method provides excellent
reproducibility both for interreader and intrareader analyzes of
percent change in diameter, and has been successfully used in analyzing
over 4000 brachial flow-mediated vasodilation scans from several
medical centers in the United States.
|
571. | Chiueh, TC, Mitra, T, Neogi, A, and Yang, CK, "Zodiac: A history-based interactive video authoring system," MULTIMEDIA SYSTEMS, vol. 8, pp. 201-211, 2000.
Abstract:
Easy-to-use audio/video authoring tools play a crucial role in moving
multimedia software from research curiosity to mainstream applications.
However, research in multimedia authoring systems has rarely been
documented in the literature. This paper describes the design and
implementation of an interactive video authoring system called Zodiac,
which employs an innovative edit history abstraction to support several
unique editing features not found in existing commercial and research
video editing systems. Zodiac provides users a conceptually clean and
semantically powerful branching history model of edit operations to
organize the authoring process, and to navigate among versions of
authored documents. In addition, by analyzing the edit history, Zodiac
is able to reliably detect a composed video stream's shot and scene
boundaries, which facilitates interactive video browsing. Zodiac also
features a video object annotation capability that allows users to
associate annotations to moving objects in a video sequence. The
annotations themselves could be text, image, audio, or video. Zodiac is
built on top of MMFS, a file system specifically designed for
interactive multimedia development environments, and implements an
internal buffer manages that supports transparent lossless
compression/decompression. Shot/scene detection, video object
annotation, and buffer management all exploit the edit history
information for performance optimization.
|
572. | Brejl, M, and Sonka, M, "Object localization and border detection criteria design in edge-based image segmentation: Automated learning from examples," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 19, pp. 973-985, 2000.
Abstract:
This paper provides methodology for fully automated model-based image
segmentation. All information necessary to perform image segmentation
is automatically derived from a training set that is presented in a
form of segmentation examples, The training set is used to construct
two models representing the objects-shape model and border appearance
model.
A two-step approach to image segmentation is reported. In the first
step, an approximate location of the object of interest is determined.
In the second step, accurate border segmentation is performed. The
shape-variant Hough transform method was developed that provides robust
object localization automatically. It finds objects of arbitrary shape,
rotation, or scaling and can handle object variability, The border
appearance model was developed to automatically design cost functions
that can be used in the segmentation criteria of edge based
segmentation methods.
Our method was tested in five different segmentation tasks that
included 489 objects to be segmented. The final segmentation was
compared to manually defined borders with good results [rms errors in
pixels: 1.2 (cerebellum), 1.1 (corpus callosum), 1.5 (vertebrae), 1.4
(epicardial), and 1.6 (endocardial) borders],
Two major problems of the state-of-the-art edge based image
segmentation algorithms were addressed: strong dependency on a
close-to-target initialization, and necessity for manual redesign of
segmentation criteria whenever new segmentation problem is encountered.
|
573. | Davies, ER, "Low-level vision requirements," ELECTRONICS & COMMUNICATION ENGINEERING JOURNAL, vol. 12, pp. 197-210, 2000.
Abstract:
This paper aims to help those with some experience of vision to obtain
a more in-depth understanding of the problems of low-level vision. As
it is not possible to cover everything in a paper of this length, a
carefully chosen series of cases and case studies is presented.
Relevant principles are brought out and a set of important ground rules
is presented by way of summary.
|
574. | Treece, GM, Prager, RW, Gee, AH, and Berman, L, "Surface interpolation from sparse cross sections using region correspondence," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 19, pp. 1106-1114, 2000.
Abstract:
The ability to estimate a surface from a set of cross sections allows
calculation of the enclosed volume and the display of the surface in
three-dimensions. This process has increasingly been used to derive
useful information from medical data. However, extracting the cross
sections (segmenting) can be very difficult, and automatic segmentation
methods are not sufficiently robust to handle all situations. Hence, it
is an advantage if the surface reconstruction algorithm can work
effectively on a small number of cross sections. In addition, cross
sections of medical data are often quite complex. Shape-based
interpolation is a simple and elegant solution to this problem,
although it has known Limitations when handling complex shapes. In this
paper, the shape-based interpolation paradigm is extended to
interpolate a surface through sparse, complex cross sections, providing
a significant improvement over our previously published maximal
disc-guided interpolation, The performance of this algorithm is
demonstrated on various types of medical data (X-ray computed
tomography, magnetic resonance imaging and three-dimensional
ultrasound). Although the correspondence problem in general remains
unsolved, it is demonstrated that correct surfaces can be estimated
from a limited amount of real data, through the use of region rather
than object correspondence.
|
575. | Shiffman, S, Rubin, GD, and Napel, S, "Medical image segmentation using analysis of isolable-contour maps," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 19, pp. 1064-1074, 2000.
Abstract:
A common challenge for automated segmentation techniques is
differentiation between images of close objects that have similar
intensities, whose boundaries are often blurred due to partial-volume
effects. We propose a novel approach to segmentation of two-dimensional
images, which addresses this challenge. Our method, which we call
intrinsic shape for segmentation (ISeg), analyzes isolabel-contour maps
to identify coherent regions that correspond to major objects. ISeg
generates an isolabel-contour map for an image by multilevel
thresholding with a fine partition of the intensity range, ISeg detects
object boundaries by comparing the shape of neighboring isolabel
contours from the map. ISeg requires only little effort from users; it
does not require construction of shape models of target objects. In a
formal validation with computed-tomography angiography data, we showed
that ISeg was more robust than conventional thresholding, and that
ISeg's results were comparable to results of manual tracing.
|
576. | Sanchez, PJ, Zapata, J, and Ruiz, R, "An active contour model algorithm for tracking endocardiac boundaries in echocardiographic sequences," CRITICAL REVIEWS IN BIOMEDICAL ENGINEERING, vol. 28, pp. 487-492, 2000.
Abstract:
The use of active contour models to track the boundaries of anatomic
structures in medical images is a technique that has attracted a great
number of efforts during the last decade. Segmentation techniques based
in deformable active contours were proposed first by Kass et al.(1)
Because of the problems appearing using these models, some solutions
have been introduced, such as balloon force(2) or Gradient Vector Flow
force (GVF), derived from the Gradient Vector Flow vectorial field.(3)
Results obtained with these forces in the tracking endocardiac task in
echocardiographic sequences were not adequate. We have designed a new
external force called hybrid force, which, by combining both forces,
joins the main features of each one.
|
577. | Positano, V, Mammoliti, R, Santarelli, MF, Landini, L, and Benassi, A, "Nonlinear analysis of carotid artery echographic images," IEE PROCEEDINGS-SCIENCE MEASUREMENT AND TECHNOLOGY, vol. 147, pp. 327-332, 2000.
Abstract:
Nonlinear analysis is applied to identifying complex spatial patterns
in echographic images of normal and pathologic carotid arteries.
Complexity and entropy measures of normal and atherosclerotic plaques
are evaluated to characterise the space-temporal evolution of
biological patterns. They are: correlation dimension, Lyapunov exponent
and Kolmogorov entropy. The application of principal component analysis
to such measures clusters data according to different atherosclerosis
severity degrees, which are confirmed by histologic analysis.
|
578. | Samson, C, Blanc-Feraud, L, Aubert, G, and Zerubia, J, "A level set model for image classification," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 40, pp. 187-197, 2000.
Abstract:
We present a supervised classification model based on a variational
approach. This model is devoted to find an optimal partition composed
of homogeneous classes with regular interfaces. The originality of the
proposed approach concerns the definition of a partition by the use of
level sets. Each set of regions and boundaries associated to a class is
defined by a unique level set function. We use as many level sets as
different classes and all these level sets are moving together thanks
to forces which interact in order to get an optimal partition. We show
how these forces can be defined through the minimization of a unique
fonctional. The coupled Partial Differential Equations (PDE) related to
the minimization of the functional are considered through a dynamical
scheme. Given an initial interface set (zero level set), the different
terms of the PDE's are governing the motion of interfaces such that, at
convergence, we get an optimal partition as defined above. Each
interface is guided by internal forces (regularity of the interface),
and external ones (data term, no vacuum, no regions overlapping).
Several experiments were conducted on both synthetic and real images.
|
579. | Krucker, JF, Meyer, CR, LeCarpentier, GL, Fowlkes, JB, and Carson, PL, "3D spatial compounding of ultrasound images using image-based nonrigid registration," ULTRASOUND IN MEDICINE AND BIOLOGY, vol. 26, pp. 1475-1488, 2000.
Abstract:
Medical ultrasound images are often distorted enough to significantly
limit resolution during compounding (i.e., summation of images from
multiple views). A new, volumetric image registration technique has
been used successfully to enable high spatial resolution in
three-dimensional (3D) spatial compounding of ultrasound images.
Volumetric ultrasound data were acquired by scanning a linear matrix
array probe in the elevational direction in a focal lesion phantom and
in a breast in vitro. To obtain partly uncorrelated views, the volume
of interest was scanned at five different transducer tilt angles
separated by 4 degrees to 6 degrees. Pairs of separate views were
registered by an automatic procedure based on a mutual information
metric, using global full affine and thin-plate spline warping
transformations. Registration accuracy was analyzed automatically in
the phantom data, and manually in vivo, yielding average registration
errors of 0.31 mm and 0.65 mm, respectively. In the vicinity of the
warping control points, registrations obtained with warping
transformations were significantly more accurate than full affine
registrations. Compounded images displayed the expected reduction in
speckle noise and increase in contrast-to-noise ratio (CNR), as well as
better delineation of connective tissues and reduced shadowing.
Compounding also revealed some apparent low contrast lobulations that
were not visible in the single-sweep images. Given expected algorithmic
and hardware enhancements, nonrigid, image-based registration shows
great promise for reducing tissue motion and refraction artifacts in 3D
spatial compounding. (C) 2001 World Federation for Ultrasound in
Medicine & Biology.
|
580. | Lo Presti, L, D'Amato, G, and Sambuelli, L, "Two-dimensional random adaptive sampling for image scanning," IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, vol. 38, pp. 2608-2616, 2000.
Abstract:
In this paper, an efficient sampling algorithm for image scanning is
proposed, suitable to represent "interesting" objects, defined as a set
of spatially close measured values that springs out from a background
noise (as in applied geophysics in the process of anomaly detection).
This method generates a map of pixels randomly distributed in the plane
and able to cover all the image with a reduced number of points with
respect to a regular scanning, Simulation results show that a saving
factor of about 50% is obtained without information loss, This result
can be proved also by using a simplified model of the sampling
mechanism. The algorithm is able to detect the presence of an object
emerging from a low energy background and to adapt the sampling
interval to the shape of the detected object. In this way, all of the
interesting objects are well represented and can be adequately
reconstructed, while the roughly sampling in the background produces an
imperfect reconstruction.
Simulation results show that the method is feasible with good
performances and moderate complexity.
|
581. | Falcao, AX, and Udupa, JK, "A 3D generalization of user-steered live-wire segmentation," MEDICAL IMAGE ANALYSIS, vol. 4, pp. 389-402, 2000.
Abstract:
We have been developing user-steered image segmentation methods for
situations which require considerable human assistance in object
definition. In the past, we have presented two paradigms, referred to
as live-wire and live-lane, for segmenting 2D/3D/4D object boundaries
in a slice-by-slice fashion, and demonstrated that live-wire and
live-lane are more repeatable, with a statistical significance level of
P < 0.03, and are 1.5-2.5 times faster, with a statistical significance
level of P < 0.02, than manual tracing. In this paper, we introduce a
3D generalization of the live-wire approach for segmenting 3D/4D object
boundaries which further reduces the time spent by the user in
segmentation. In a 2D live-wire, given a slice, for two specified
points (pixel vertices) on the boundary of the object, the best
boundary segment is the minimum-cost path between the two points,
described as a set of oriented pixel edges. This segment is found via
Dijkstra's algorithm as the user anchors the first point and moves the
cursor to indicate the second point. A complete 2D boundary is
identified as a set of consecutive boundary segments forming a
"closed", "connected", "oriented" contour. The strategy of the 3D
extension is that, first, users specify contours via live-wiring on a
few slices that are orthogonal to the natural slices of the original
scene. If these slices are selected strategically, then we have a
sufficient number of points on the 3D boundary of the object to
subsequently trace optimum boundary segments automatically in all
natural slices of the 3D scene. A 3D object boundary may define
multiple 2D boundaries per slice. The points on each 2D boundary form
an ordered set such that when the best boundary segment is computed
between each pair of consecutive points, a closed, connected, oriented
boundary results. The ordered set of points on each 2D boundary is
found from the way the users select the orthogonal slices. Based on
several validation studies involving segmentation of the bones of the
foot in MR images, we found that the 3D extension of live-wire is more
repeatable, with a statistical significance level of P < 0.0001, and
2-6 times faster, with a statistical significance level of P < 0.01,
than the 2D live-wire method, and 3-15 times faster than manual
tracing. (C) 2000 Elsevier Science B.V. AU rights reserved.
|
582. | Audette, MA, Ferrie, FP, and Peters, TM, "An algorithmic overview of surface registration techniques for medical imaging," MEDICAL IMAGE ANALYSIS, vol. 4, pp. 201-217, 2000.
Abstract:
This paper presents a literature survey of automatic 3D surface
registration techniques emphasizing the mathematical and algorithmic
underpinnings of the subject. The relevance of surface registration to
medical imaging is that there is much useful anatomical information in
the form of collected surface points which originate from complimentary
modalities and which must be reconciled. Surface registration can be
roughly partitioned into three issues: choice of transformation,
elaboration of surface representation and similarity criterion, and
matching and global optimization. The first issue concerns the
assumptions made about the nature of relationships between the two
modalities, e.g. whether a rigid-body assumption applies, and if nor,
what type and how general a relation optimally maps one modality onto
the other. The second issue determines what type of information we
extract from the 3D surfaces, which typically characterizes their local
or global shape, and how we organize this information into a
representation of the surface which will lead to improved efficiency
and robustness in the last stage. The last issue pertains to how we
exploit this information to estimate the transformation which best
aligns local primitives in a globally consistent manner or which
maximizes a measure of the similarity in global shape of two surfaces.
Within this framework, this paper discusses in detail each surface
registration issue and reviews the state-of-the-art among existing
techniques. (C) 2000 Elsevier Science BN. All rights reserved.
|
|
|
2001 |
583. | Ferrant, M, Nabavi, A, Macq, B, Jolesz, FA, Kikinis, R, and Warfield, SK, "Registration of 3-D intraoperative MR images of the brain using a finite-element biomechanical model," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 20, pp. 1384-1397, 2001.
Abstract:
We present a new algorithm for the nonrigid registration of
three-dimensional magnetic resonance (MR) intraoperative image
sequences showing brain shift. The algorithm tracks key surfaces of
objects (cortical surface and the lateral ventricles) in the image
sequence using a deformable surface matching algorithm. The volumetric
deformation field of the objects is then inferred from the
displacements at the boundary surfaces using a linear elastic
biomechanical finite-element model. Two experiments on synthetic image
sequences are presented, as well as an initial experiment on
intraoperative MR images showing brain shift. The results of the
registration algorithm show a good correlation of the internal brain
structures after deformation, and a good capability of measuring
surface as well as subsurface shift. We measured distances between
landmarks in the deformed initial image and the corresponding landmarks
in the target scan. Cortical surface shifts of up to 10 min and
subsurface shifts of up to 6 mm were recovered with an accuracy of 1
nun or less and 3 min or less respectively.
|
584. | Choi, WP, Lam, KM, and Siu, WC, "An adaptive active contour model for highly irregular boundaries," PATTERN RECOGNITION, vol. 34, pp. 323-331, 2001.
Abstract:
Snake is an active contour model for representing image contours. In
this paper, we propose an efficient active contour model which can
represent highly irregular boundaries. The algorithm includes an
adaptive force along the contour, and adjusts the number of points for
the snake according to the desired boundary. A better stopping
criterion based on the area of a closed contour is devised.
Furthermore, in this method, a contour can break automatically to
represent the contours of multiple objects. Experiments show that this
method can extract object's boundaries accurately and efficiently. (C)
2000 Pattern Recognition Society. Published by Elsevier Science Ltd.
All rights reserved.
|
585. | Germain, O, and Refregier, P, "Edge location in SAR images: Performance of the likelihood ratio filter and accuracy improvement with an active contour approach," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 10, pp. 72-78, 2001.
Abstract:
The likelihood ratio edge detector is an efficient filter for the
segmentation of synthetic aperture radar (SAR) images. We show that
this filter provides biased location of the edge, when the window does
not have the same orientation as the edge. A phenomenological model is
proposed to characterize this bias. We then introduce an efficient
technique to refine edge location: the statistical active contour. The
combination of these two methods permits to achieve accurate and
regularized edge location.
|
586. | Ojala, T, Nappi, J, and Nevalainen, O, "Accurate segmentation of the breast region from digitized mammograms," COMPUTERIZED MEDICAL IMAGING AND GRAPHICS, vol. 25, pp. 47-59, 2001.
Abstract:
The segmentation of a digital mammogram into the breast region and the
background is a necessary prerequisite in computer-assisted diagnosis
of mammograms. By the exclusion of the background region, the accuracy
of the analysis is increased and the running-time is decreased. The
algorithm which segments the breast region from the background should
be fully automated and give correct results for all kinds of digitized
mammograms, including low-quality images. In this paper we present such
an algorithm based on histogram thresholding, morphological filtering
and contour modeling. Quantitative test results indicate that the
computed boundary follows the estimated boundary accurately. (C) 2000
Elsevier Science Ltd. All rights reserved.
|
587. | Fornefett, M, Rohr, K, and Stiehl, HS, "Radial basis functions with compact support for elastic registration of medical images," IMAGE AND VISION COMPUTING, vol. 19, pp. 87-96, 2001.
Abstract:
Common elastic registration schemes based on landmarks and radial basis
functions (RBFs) such as thin-plate splines or multiquadrics are
global. Here, we introduce radial basis functions with compact support
for elastic registration of medical images which have an improved
locality, i.e. which allow to constrain elastic deformations to image
parts where required. We give the theoretical background of these basis
functions and compare them with other basis functions w.r.t. locality,
solvability, and efficiency. A detailed comparison with the Gaussian as
well as conditions for preserving topology is given. An important
property of the used RBFs (Wendland's psi -functions) is that they are
positive definite. Therefore, in comparison to the use of the truncated
Gaussian, the solvability of the resulting system of equations is
always guaranteed. We demonstrate the applicability of our approach for
synthetic as well as for 2D and 3D tomographic images. (C) 2001
Elsevier Science B.V. All rights reserved.
|
588. | Chan, TF, and Vese, LA, "Active contours without edges," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 10, pp. 266-277, 2001.
Abstract:
In this paper, we propose a new model for active contours to detect
objects in a given image, based on techniques of curve evolution,
Mumford-Shah functional for segmentation and level sets. Our model can
detect objects whose boundaries are not necessarily defined by
gradient. We minimize an energy which can he seen as a particular case
of the minimal partition problem, In the level set formulation, the
problem becomes a "mean-curvature flow"-like evolving the active
contour, which will stop on the desired boundary. However, the stopping
term does not depend on the gradient of the. image, as in the classical
active contour models, hut is instead related to a particular
segmentation of the image. We will give a numerical algorithm using
finite differences. Finally, we will present various experimental
results and in particular some examples for which the classical snakes
methods based on the gradient are not applicable. Also, the initial
curve can be anywhere in the image, and interior contours are
automatically detected.
|
589. | Kim, W, Lee, CY, and Lee, JJ, "Tracking moving object using Snake's jump based on image flow," MECHATRONICS, vol. 11, pp. 199-226, 2001.
Abstract:
An active contour model, Snake, was developed as a useful segmenting
and tracking tool for rigid or non-rigid (i.e, deformable) objects by
Kass in 1987. Snake is designed on the basis of Snake energies.
Segmenting and tracking can be executed successfully by the process of
energy minimization. The ability to contract is an important process
for segmenting objects from images, but the contraction forces of Kass'
Snake are dependent on the object's form. In this research, new
contraction energy, independent of the object's form, is proposed for
the better segmentation of objects. Kass' Snake can be applied to the
case of small changes between images because its solutions can be
achieved on the basis of variational approach. If a somewhat fast
moving object exists in successive images, Kass' Snake will not operate
well because the moving object may have large differences in its
position or form, between successive images. Snake's nodes may fall
into the local minima in their motion to the new positions of the
target object in next image. When the motion is too large to apply
image flow energy to tracking, a jump mode is proposed for solving the
problem. The vector used to make Snake's nodes jump to the new location
can be obtained by processing the image flow. The effectiveness of the
proposed Snake is confirmed by some simulations. (C) 2000 Published by
Elsevier Science Ltd.
|
590. | Dubuisson-Jolly, MP, and Gupta, A, "Tracking deformable templates using a shortest path algorithm," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 81, pp. 26-45, 2001.
Abstract:
This paper proposes a new technique to track deformable templates. We
extend the typical graph algorithms that have been used for active
contour recovery to incorporate shape information. The advantage of
graph algorithms is that they are guaranteed to find the global minimum
of the energy function. The difficulty with their traditional use for
active contours is that they consider only two pixels at a time when
recovering the contour, making it impossible to enforce shape
constraints. We define the deformable template as a polygonal contour,
demonstrate the proper mapping between the image, the contour, and a
graph, and show how to apply Dijkstra's algorithm to track contours in
image sequences. Examples are shown for deforming contours, articulated
objects, and smooth contours being tracked in simple and complicated
backgrounds. We also provide an analysis of the computational
requirements. (C) 2001 Academic Press.
|
591. | Park, H, Schoepflin, T, and Kim, Y, "Active contour model with gradient directional information: Directional snake," IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, vol. 11, pp. 252-256, 2001.
Abstract:
Active contours or snakes are an effective edge-based method in
segmenting an object of interest, However, the segmented boundary of a
moving object in one video frame may lie far from the same moving
object in the next frame due to its rapid motion, causing the snake to
converge on the wrong edges. To guide the snake toward the appropriate
edges, we have added gradient-directional information to the external
image force to create a "directional snake." Thus, in minimizing the
snake energy, the new method considers both the gradient strength and
gradient direction of the image. Experimental results demonstrate that
the directional snake can provide a better segmentation than the
conventional method in certain situations, e.g., when there are
multiple edge candidates in the neighborhood with different directions.
The directional snake is significant because it provides a framework to
incorporate directional information in digital video segmentation.
|
592. | Gotte, MJW, van Rossum, AC, Twisk, JWR, Kuijer, JPA, Marcus, JT, and Visser, CA, "Quantification of regional contractile function after infarction: Strain analysis superior to wall thickening analysis in discriminating infarct from remote myocardium," JOURNAL OF THE AMERICAN COLLEGE OF CARDIOLOGY, vol. 37, pp. 808-817, 2001.
Abstract:
OBJECTIVES Using two-dimensional wall thickening (WT) (expressed as
percentage) and strain analysis, regional contractile myocardial
function was quantified and compared in 13 control subjects and 13
patients with a first myocardial infarction (MI). The finding in the
patient group were related to global ventricular function and infarct
size.
BACKGROUND In patients with coronary artery disease, regions with
dysfunctional myocardium cannot be differentiated easily from regions
with normal function by planar WT analysis. Physiologic factors, in
combination with limitations of conventional imaging techniques, affect
the calculation of WT. Quantitative assessment of contractile function
by magnetic resonance (MR) tissue tagging and strain analysis may be
less affected by these factors.
METHODS Two-dimensional regional WT and strain were calculated in three
short-axis MR cine and ragged images, respectively. Left ventricular
volumes and ejection fraction (EF) were obtained from a series of
contiguous short-axis cine images.
RESULTS In patients with infarct-related ventricles, WT and strain
analysis both revealed reduced myocardial function, as compared with
control subjects (p < 0.005 and p < 0.001, respectively). However, WT
analysis yielded no significant regional differences in function
between infarct-related and remote myocardium (p = 0.064), whereas
strain analysis did (p < 0.005). For detecting dysfunctional myocardium
of electrocardiographically and angiographically defined infarct areas,
WT analysis had a sensitivity of 69% and a specificity of 92%, whereas
strain analysis demonstrated a sensitivity of 92% and a specificity of
99%. The EF correlated with WT (r = 0.76, p < 0.005) and strain (r =
0.89, p < 0.001).
CONCLUISONS Two-dimensional strain analysis is more accurate than
planar WT analysis in discriminating dysfunctional from functional
myocardium, and it provides a strong correlation between regional
myocardial and global ventricular function. (J Am Coil Cardiol 2001;37:
808-17) (C) 2001 by the American College of Cardiology.
|
593. | Abu-Gharbieh, R, Hamarneh, G, Gustavsson, T, and Kaminski, CF, "Flame front tracking by laser induced fluorescence spectroscopy and advanced image analysis," OPTICS EXPRESS, vol. 8, pp. 278-287, 2001.
Abstract:
This paper presents advanced image analysis methods for extracting
information from high speed Planar Laser Induced Fluorescence (PLIF)
data obtained from turbulent ames. The application of non-linear
anisotropic diffusion filtering and of Active Contour Models ( Snakes)
is described to isolate flame boundaries. In a subsequent step, the
detected flame boundaries are tra ked in time using a frequency domain
contour interpolation scheme. The implementations of the methods are
described and possible applications of the techniques are discussed.
(C) 2001 Optical Society of America.
|
594. | Inglis, IM, and Gray, AJ, "An evaluation of semiautomatic approaches to contour segmentation applied to fungal hyphae," BIOMETRICS, vol. 57, pp. 232-239, 2001.
Abstract:
Semiautomatic image analysis techniques are particularly useful in
biological applications, which commonly generate very complex images,
and offer considerable flexibility. However, systematic study of such
methods is lacking; most research develops fully automatic algorithms.
This paper describes a study to evaluate several different
semiautomatic or computer-assisted approaches to contour segmentation
within the context of segmenting degraded images of fungal hyphae. Four
different types of contour segmentation method, with varying degrees
and types of user input, are outlined and applied to hyphal images. The
methods are evaluated both quantitatively and qualitatively by
comparing results obtained by several test subjects segmenting
simulated images qualitatively similar to the hyphal images of
interest. An active contour model approach, using control points,
emerges as the method to be preferred to three more traditional
approaches. Feedback from the image provider indicates that any of the
methods described have something useful to offer for segmentation of
hyphae.
|
595. | Mignotte, M, and Meunier, J, "A multiscale optimization approach for the dynamic contour-based boundary detection issue," COMPUTERIZED MEDICAL IMAGING AND GRAPHICS, vol. 25, pp. 265-275, 2001.
Abstract:
We present a new multiscale approach for deformable contour
optimization. The method relies on a multigrid minimization method and
a coarse-to-fine relaxation algorithm. This approach consists in
minimizing a cascade of optimization problems of reduced and increasing
complexity instead of considering the minimization problem on the full
and original configuration space. Contrary to classical multiresolution
algorithms, no reduction of image is applied. The family of defined
energy functions are derived from the original (full resolution)
objective function, ensuring that the same function is handled at each
scale and that the energy decreases at each step of the deformable
contour minimization process. The efficiency and the speed of this
multiscale optimization strategy is demonstrated in the difficult
context of the minimization of a region-based contour energy function
ensuring the boundary detection of anatomical structures in ultrasound
medical imagery. In this context, the proposed multiscale segmentation
method is compared to other classical region-based segmentation
approaches such as Maximum Likelihood or Markov Random Field-based
segmentation techniques. We also extend this multiscale segmentation
strategy to active contour models using a classical edge-based
likelihood approach. Finally, time and performance analysis of this
approach, compared to the (commonly used) dynamic programming-based
optimization procedure, is given and allows to attest the accuracy and
the speed of the proposed method. (C) 2001 Elsevier Science Ltd. All
rights reserved.
|
596. | Frangi, AF, Niessen, WJ, and Viergever, MA, "Three-dimensional modeling for functional analysis of cardiac images: A review," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 20, pp. 2-25, 2001.
Abstract:
Three-dimensional (3-D) imaging of the heart is a rapidly del eloping
area of research in medical imaging, Advances in hardware and methods
for fast spatio-temporal cardiac imaging are extending the frontiers of
clinical diagnosis and research on cardiovascular diseases.
In the last few Sears, many approaches hare been proposed to analyze
images and extract parameters of cardiac shape and function from a
variety of cardiac imaging modalities. In particular, techniques based
on spatio-temporal geometric models have received considerable
attention. This paper surveys the literature of tno decades of research
on cardiac modeling. The contribution of the paper is three-fold: 1) to
serve as a tutorial of the field for both clinicians and technologists,
2) to provide an extensive account of modeling techniques in a
comprehensive and systematic manner, and 3) to critically review these
approaches in terms of their performance and degree of clinical
evaluation with respect to the final goal of cardiac functional
analysis, From this review it is concluded that whereas 3-D model-based
approaches have the capability. to improve the diagnostic value of
cardiac images, issues as robustness, 3-D interaction, computational
complexity and clinical validation still require significant attention.
|
597. | Yabuki, N, Matsuda, Y, Ota, M, Sumi, Y, Fukui, Y, and Miki, S, "Improvement of active net model for region detection in an image," IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, vol. E84A, pp. 720-726, 2001.
Abstract:
Processes in image recognition include target detection and shape
extraction. Active Net has been proposed as one of the methods for such
processing. It treats the target detection in all image as an energy
optimization problem. In this paper. a problem of the conventional
Active Net is presented and the new Active Net is proposed. The new net
is improved the ability for detecting a target. Finally, the validity
of the proposed net is confirmed by experimental results.
|
598. | Heller, EN, Staib, LH, Dione, DP, Constable, RT, Shi, CQX, Duncan, JS, and Sinusas, AJ, "A new method for quantification of spatial and temporal parameters of endocardial motion: Evaluation of experimental infarction using magnetic resonance imaging," CANADIAN JOURNAL OF CARDIOLOGY, vol. 17, pp. 309-318, 2001.
Abstract:
BACKGROUND: With the development of high-resolution myocardial imaging
there has evolved a need for automated techniques that can accurately
quantify regional function.
OBJECTIVE: To develop a new method for quantification of spatial and
temporal parameters of endocardial motion.
DESIGN: Magnetic resonance images were analyzed using a unique,
shape-based approach that tracks endocardial surface motion at defined
points through the cardiac cycle by minimizing the bending energy.
SETTING: Animal instrumentation was performed in the Nuclear Cardiology
Experimental Research Laboratory at Yale University, New Haven,
Connecticut. Magnetic resonance imaging was performed at the Yale New
Haven Hospital Center.
ANIMALS: Eight mongrel canines were used.
INTERVENTIONS: Electrocardiograph gated, gradient-echo magnetic
resonance images were obtained before and after occlusion of the left
anterior descending coronary artery. Thirty-two points along
automatically defined endocardial contours were tracked. Average
displacements and cumulative path lengths were computed from
end-diastole for each point over the entire cardiac cycle. The average
cumulative path length was computed for each of four quarters of
systole for the normal, border and infarct zones. Shape-based
parameters of systolic motion were compared with the centreline
approach. Infarct zone was defined by postmortem histochemical staining.
MAIN RESULTS: Displacement and cumulative path length over the cardiac
cycle decreased significantly in the infarct and border zones (P<0.05),
but did not change in the normal zone (P was not significant). Temporal
changes in motion were observed in all zones. Displacement measured
using the shape based algorithm was more consistent than cumulative
path length when compared with systolic motion measured using the
centreline method.
CONCLUSIONS: An automated, shape-based approach permits quantitative
evaluation of both spatial and temporal parameters of regional
endocardial motion from high-resolution electrocardiograph gated
images. Analysis of endocardial motion and cumulative motion over the
entire cardiac cycle discriminated infarcted from normal and border
regions.
|
599. | De Solorzano, CO, Malladi, R, Lelievre, SA, and Lockett, SJ, "Segmentation of nuclei and cells using membrane related protein markers," JOURNAL OF MICROSCOPY-OXFORD, vol. 201, pp. 404-415, 2001.
Abstract:
Segmenting individual cell nuclei from microscope images normally
involves volume labelling of the nuclei with a DNA stain. However, this
method often fails when the nuclei are tightly clustered in the tissue,
because there is little evidence from the images on where the borders
of the nuclei are. In this paper we present a method which solves this
limitation and furthermore enables segmentation of whole cells. Instead
of using volume stains, we used stains that specifically label the
surface of nuclei or cells: lamins for the nuclear envelope and alpha-6
or beta-1 integrins for the cellular surface. The segmentation is
performed by identifying unique seeds for each nucleus/cell and
expanding the boundaries of the seeds until they reach the limits of
the nucleus/cell, as delimited by the lamin or integrin staining, using
gradient-curvature flow techniques. We tested the algorithm using
computer-generated objects to evaluate its robustness against noise and
applied it to cells in culture and to tissue specimens. In all the
cases that we present the algorithm gave accurate results.
|
600. | Little, JJ, and Shi, P, "Structural lines, TINs, and DEMs," ALGORITHMICA, vol. 30, pp. 243-263, 2001.
Abstract:
The standard method of building compact triangulated surface
approximations to terrain surfaces (TINs) from dense digital elevation
models (DEMs) adds points to an initial sparse triangulation or removes
points from a dense initial mesh. Instead, we find structural lines to
act as the initial skeleton of the triangulation. These lines are based
on local curvature of the surface, not on the Row of water. We build
TINs from DEMs with points and structural lines. These experiments show
that initializing the TIN with structural lines at the correct scale
creates a TIN with fewer points given a particular approximation error.
Structural lines are especially effective for small numbers of points
and correspondingly rougher approximations.
|
601. | Shearer, K, Wong, KD, and Venkatesh, S, "Combining multiple tracking algorithms for improved general performance," PATTERN RECOGNITION, vol. 34, pp. 1257-1269, 2001.
Abstract:
Automated tracking of objects through a sequence of images has remained
one of the difficult problems in computer vision. Numerous algorithms
and techniques have been proposed for this task. Some algorithms
perform well in restricted environments, such as tracking using
stationary camel as, but a general solution is not currently available.
A frequent problem is that when an algorithm is refined for one
application, it becomes unsuitable for other applications, This paper
proposes a general tracking system based on a different approach.
Rather than refine one algorithm for a specific tracking task, two
tracking algorithms are employed, and used to correct each other during
the tracking task. By choosing the two algorithms such that they have
complementary failure modes, a robust algorithm is created without
increased specialisation. (C) 2001 Pattern Recognition Society.
Published by Elsevier Science Ltd. All rights reserved.
|
602. | Zahalka, A, and Fenster, A, "An automated segmentation method for three-dimensional carotid ultrasound images," PHYSICS IN MEDICINE AND BIOLOGY, vol. 46, pp. 1321-1342, 2001.
Abstract:
We have developed an automated segmentation method for
three-dimensional vascular ultrasound images. The method consists of
two steps: an automated initial contour identification, followed by
application of a geometrically deformable model (GDM). The formation of
the initial contours requires the input of a single seed point by the
user, and was shown to be insensitive to the placement of the seed
within a structure. The GDM minimizes contour energy, providing a
smoothed final result. It requires only three simple parameters, all
with easily selectable values. The algorithm is fast, performing
segmentation on a 336 x 352 x 200 volume in 25 s when running on a 100
MHz 9500 Power Macintosh prototype. The segmentation algorithm was
tested on stenosed vessel phantoms with known geometry, and the
segmentation of the cross-sectional areas was found to be within 3% of
the true area. The algorithm was also applied to two sets of patient
carotid images, one acquired with a mechanical scanner and the other
with a freehand scanning system, with good results on both.
|
603. | Pardo, XM, Carreira, MJ, Mosquera, A, and Cabello, D, "A snake for CT image segmentation integrating region and edge information," IMAGE AND VISION COMPUTING, vol. 19, pp. 461-475, 2001.
Abstract:
The 3D representation and solid modeling of knee bone structures taken
from computed tomography (CT) scans are necessary processes in many
medical applications. The construction of the 3D model is generally
carried out by stacking the contours obtained from a 2D segmentation of
each CT slice, so the quality of the 3D model strongly depends on the
precision of this segmentation process. In this work we present a
deformable contour method for the problem of automatically delineating
the external bone (tibia and fibula) contours from a set of CT scan
images. We have introduced a new region potential term and an edge
focusing strategy that diminish the problems that the classical snake
method presents when it is applied to the segmentation of CT images. We
introduce knowledge about the location of the object of interest and
knowledge about the behavior of edges in scale space, in order to
enhance edge information. We also introduce a region information aimed
at complementing edge information. The novelty in that is that the new
region potential does not rely on prior knowledge about image
statistics; the desired features are derived from the segmentation in
the previous slice of the 3D sequence. Finally, we show examples of 3D
reconstruction demonstrating the validity of our model. The performance
of our method was visually and quantitatively validated by experts. (C)
2001 Elsevier Science B.V. All rights reserved.
|
604. | Francois, ARJ, and Medioni, GG, "Interactive 3D model extraction from a single image," IMAGE AND VISION COMPUTING, vol. 19, pp. 317-328, 2001.
Abstract:
We present a system at the junction between Computer Vision and
Computer Graphics, to produce a three-dimensional (3D) model of an
object as observed in a single image, with a minimum of high-level
interaction from a user.
The input to our system is a single image. First, the user points,
coarsely, at image features (edges) that are subsequently automatically
and reproducibly extracted in real-time. The user then performs a high
level labeling of the curves (e.g. limb edge, cross-section) and
specifies relations between edges (e.g. symmetry, surface or part).
NURBS are used as working representation of image edges. The objects
described by the user specified, qualitative relationships are then
reconstructed either as a set of connected parts modeled as Generalized
Cylinders, or as a set of 3D surfaces for 3D bilateral symmetric
objects. In both cases, the texture is also extracted from the image.
Our system runs in realtime on a PC. (C) 2001 Elsevier Science B.V. All
rights reserved.
|
605. | Doucette, P, Agouris, P, Stefanidis, A, and Musavi, M, "Self-organised clustering for road extraction in classified imagery," ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING, vol. 55, pp. 347-358, 2001.
Abstract:
The extraction of road networks from digital imagery is a fundamental
image analysis operation. Common problems encountered in automated road
extraction include high sensitivity to typical scene clutter in
high-resolution imagery, and inefficiency to meaningfully exploit
multispectral imagery (MSI). With a ground sample distance (GSD) of
less than 2 m per pixel, roads can be broadly described as elongated
regions. We propose an approach of elongated region-based analysis for
2D road extraction from high-resolution imagery, which is suitable for
MSI, and is insensitive to conventional edge definition. A
self-organising road map (SORM) algorithm is presented. inspired from a
specialised variation of Kohonens self-organising map (SOM) neural
network algorithm. A spectrally classified high-resolution image is
assumed to be the input for our analysis. Our approach proceeds by
performing spatial cluster analysis as a mid-level processing
technique. This allows us to improve tolerance to road clutter in
high-resolution images, and to minimise the effect on road extraction
of common classification errors. This approach is designed in
consideration of the emerging trend towards high-resolution
multispectral sensors. Preliminary results demonstrate robust road
extraction ability due to the non-local approach, when presented with
noisy input. (C) 2001 Elsevier Science B.V. All rights reserved.
|
606. | Ballerini, L, "Genetic snakes for color images segmentation," APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2037, pp. 268-277, 2001.
Abstract:
The world of meat faces a permanent need for new methods of meat
quality evaluation. Recent advances in the area of computer and video
processing have created new ways to monitor quality in the food
industry. In this paper we propose a segmentation method to separate
connective tissue from meat. We propose the use of Genetic Snakes, that
are active contour models, also known as snakes, with an energy
minimization procedure based on Genetic Algorithms (GA). Genetic Snakes
have been proposed to overcome some limits of the classical snakes, as
initialization, existence of multiple minima, and the selection of
elasticity parameters, and have both successfully applied to medical
and radar images. We extend the formulation of Genetic Snakes in two
ways, by exploring additional internal and external energy terms and by
applying them to color images. We employ a modified version of the
image energy which considers the gradient of the three color RGB (red,
green and blue) components. Experimental results on synthetic images as
well as on meat images are reported. Images used in this work are color
camera photographs of beef meat.
|
607. | Tao, CV, Chapman, MA, and Chaplin, BA, "Automated processing of mobile mapping image sequences," ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING, vol. 55, pp. 330-346, 2001.
Abstract:
Automated approaches to image sequence processing using mobile mapping
imagery have been under investigation in the Department of Geomatics
Engineering at The University of Calgary. This paper presents an
overview of several methods developed for the VISAT (TM) mobile mapping
system at The University of Calgary. Following a brief overview of
mobile mapping technology, an analysis of mobile mapping image
sequences from the viewpoint of visual motion theory is provided.
Particular attention is paid to image and object domain constraints
that can be exploited in the processing of mobile mapping image
sequences. Several key methods to automated processing of mobile
mapping image sequences are then described. These methods can be
grouped into two categories, namely, information extraction and
image-based trajectory determination (bridging). (C) 2001 Elsevier
Science B.V. All rights reserved.
|
608. | Chen, YM, and Bose, P, "On the incorporation of time-delay regularization into curvature-based diffusion," JOURNAL OF MATHEMATICAL IMAGING AND VISION, vol. 14, pp. 149-164, 2001.
Abstract:
A new anisotropic nonlinear diffusion model incorporating time-delay
regularization into curvature-based diffusion is proposed for image
restoration and edge detection. A detailed mathematical analysis of the
proposed model in the form of the proof of existence, uniqueness and
stability of the "viscosity" solution of the model is presented.
Furthermore, implementation issues and computational methods for the
proposed model are also discussed in detail. The results obtained from
testing our denoising and edge detection algorithm on several synthetic
and real images showed the effectiveness of the proposed model in
prserving sharp edges and fine structures while removing noise.
|
609. | Shen, DG, Herskovits, EH, and Davatzikos, C, "An adaptive-focus statistical shape model for segmentation and shape modeling of 3-D brain structures," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 20, pp. 257-270, 2001.
Abstract:
This paper presents a deformable model for automatically segmenting
brain structures from volumetric magnetic resonance (MR) images and
obtaining point correspondences, using geometric and statistical
information in a hierarchical scheme. Geometric information is embedded
into the model via a set of affine-invariant attribute vectors, each of
which characterizes the geometric structure around a point of the model
from a local to a global scale, The attribute vectors, in conjunction
with the deformation mechanism of the model, warranty that the model
not only deforms to nearby edges, as is customary in most deformable
surface models, but also that it determines point correspondences based
on geometric similarity at different scales. The proposed model is
adaptive in that it initially focuses on the most reliable structures
of interest, and gradually shifts focus to other structures as those
become closer to their respective targets and, therefore, more
reliable. The proposed techniques have been used to segment boundaries
of the ventricles, the caudate nucleus, and the lenticular nucleus from
volumetric MR images.
|
610. | Sclaroff, S, and Liu, LF, "Deformable shape detection and description via model-based region grouping," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 23, pp. 475-489, 2001.
Abstract:
A method for deformable shape detection and recognition is described.
Deformable shape templates are used to partition the image into a
globally consistent interpretation, determined in part by the minimum
description length principle. Statistical shape models enforce the
prior probabilities on global, parametric deformations for each object
class. Once trained, the system autonomously segments deformed shapes
from the background, while not merging them with adjacent objects or
shadows. The formulation can be used to group image regions obtained
via any region segmentation algorithm, e.g., texture. color, or motion.
The recovered shape models can be used directly in object recognition.
Experiments with color imagery are reported.
|
611. | Bajaj, CL, and Xu, GL, "Regular algebraic curve segments (III) - applications in interactive design and data fitting," COMPUTER AIDED GEOMETRIC DESIGN, vol. 18, pp. 149-173, 2001.
Abstract:
In this paper (part three of the trilogy) we use low degree G(1) and
G(2) continuous regular algebraic spline curves defined within
parallelograms, to interpolate an ordered set of data points in the
plane. We explicitly characterize curve families whose members have the
required interpolating properties and possess a minimal number of
inflection points. The regular algebraic spline curves considered here
have many attractive features: They are easy to construct. There exist
convenient geometric control handles to locally modify the shape of the
curve. The error of the approximation is controllable. Since the spline
curve is always inside the parallelogram, the error of the fit is
bounded by the size of the parallelogram. The spline curve can be
rapidly displayed, even though the algebraic curve segments are
implicitly defined. (C) 2001 Elsevier Science B.V. All rights reserved.
|
612. | Lehmann, TM, Bredno, J, Metzler, V, Brook, G, and Nacimiento, W, "Computer-assisted quantification of axo-somatic boutons at the cell membrane of motoneurons," IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, vol. 48, pp. 706-717, 2001.
Abstract:
This paper presents a system for computer-assisted quantification of
axe-somatic boutons at motoneuron cell-surface membranes, Different
immunohistochemical stains can be used to prepare tissue of the spinal
cord. Based on micrographs displaying single neurons, a finite element
balloon model has been applied to determine the exact location of the
cell membrane, A synaptic profile is extracted next to the cell
membrane and normalized with reference to the intracellular brightness.
Furthermore, a manually selected reference cell is used to normalize
settings of the microscope as well as variations in histochemical
processing for each stain. Thereafter, staining, homogeneity, and
allocation of boutons are determined automatically from the synaptic
profiles. The system is evaluated by applying the coefficient of
variation (C-v) to repeated measurements of a quantity. Based on 1856
motoneuronal images acquired from four animals with three stains, 93%
of the images are analyzed correctly. The others were rejected, based
on process protocols. Using only rabbit anti-synaptophysin as primary
antibody, the correctness increases above 96%, C-v values are below 3%,
5%, and 6% for all measures with respect to stochastic optimization,
cell positioning, and a large range of microscope settings,
respectively, A sample size of about 100 is required to validate a
significant reduction of staining in motoneurons below a hemi-section
(Wilcoxon rank-sum test, alpha = 0.05, beta = 0.9), Our system yields
statistically robust results from light micrographs. In future, it is
hoped that this system will substitute for the expensive and
time-consuming analysis of spinal cord injury at the ultra-structural
level, such as by manual interpretation of nonoverlapping electron
micrographs.
|
613. | Asano, T, Chen, DZ, Katoh, N, and Tokuyama, T, "Efficient algorithms for optimization-based image segmentation," INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, vol. 11, pp. 145-166, 2001.
Abstract:
Separating an object in an image from its background is a central
problem (called segmentation) in pattern recognition and computer
vision. In this paper, we study the computational complexity of the
segmentation problem, assuming that the sought object forms a connected
region in an intensity image. We show that the optimization problem of
separating a connected region in a grid of M x N pixels is NP-hard
under the interclass variance, a criterion that is often used in
discriminant analysis. More importantly, we consider the basic case in
which the object is bounded by two x-monotone curves (i.e., the object
itself is x-monotone), and present polynomial-time algorithms for
computing the optimal segmentation. Our main algorithm for exact
optimal segmentation by two x-monotone curves runs in O(N-4) time; this
algorithm is based on several techniques such as a parametric
optimization formulation, a hand-probing algorithm for the convex hull
of an unknown planar point set, and dynamic programming using fast
matrix searching. Our efficient approximation scheme obtains an epsilon
-approximate solution in O(epsilon N--1(2) log L) time, where epsilon
is any fixed constant with 1 > epsilon > 0, and L is the total sum of
the absolute values of the brightness levels of the image.
|
614. | Firbank, MJ, Harrison, RM, Williams, ED, and Coulthard, A, "Measuring extraocular muscle volume using dynamic contours," MAGNETIC RESONANCE IMAGING, vol. 19, pp. 257-265, 2001.
Abstract:
The effect of medical treatment on extraocular muscle enlargement in
thyroid associated ophthalmopathy (TAO) may be monitored by measuring
the change in volume of the extraocular muscles on serial orbital MRI
examinations. In theory. 3D image sets offer the opportunity to
minimise errors due to poor repositioning and partial volume effects.
This study describes an automated technique for estimating extraocular
muscle volumes from 3D datasets. Operator input is minimal and the
technique is robust. Verification of the technique on both simulated
and real datasets is described. For simulated image sets, both
automated segmentation and manual outlining produced estimates of
volume which were on average 4% less than 'true' volume. For real
patient data, extraocular muscle volumes measured by the automated
technique were 1.6% (SD 13%) less than volumes measured by manual
outlining. Coefficient of variation for repeat outlining of the same
image dataset for the automated technique was 1.0%, compared with 4%
for manual outlining. The manual technique took an experienced operator
approximately 20 min to perform. compared to 7 min fur the automated
technique. The automated method is therefore rapid, reproducible and at
least as accurate as other available methods. (C) 2001 Elsevier Science
Inc. All rights reserved.
|
615. | Lie, WN, and Chuang, CH, "Fast and accurate snake model for object contour detection," ELECTRONICS LETTERS, vol. 37, pp. 624-626, 2001.
Abstract:
A new scheme in which a snake model is used fnr object contour
detection is proposed. By developing a no-search movement scheme,
accepting the effective gradient vector flow field as the contracting
force, and adjusting the weighting parameters automatically, an
algorithm that is fast, less sensitive to initial contour conditions
and accurate in approaching concave parts of an object boundary is
obtained.
|
616. | Desolneux, A, Moisan, L, and Morel, JM, "Edge detection by Helmholtz principle," JOURNAL OF MATHEMATICAL IMAGING AND VISION, vol. 14, pp. 271-284, 2001.
Abstract:
We apply to edge detection a recently introduced method for computing
geometric structures in a digital image, without any a priori
information. According to a basic principle of perception due to
Helmholtz, an observed geometric structure is perceptually "meaningful"
if its number of occurences would be very small in a random situation:
in this context, geometric structures are characterized as large
deviations from randomness. This leads us to define and compute edges
and boundaries (closed edges) in an image by a parameter-free method.
Maximal detectable boundaries and edges are defined, computed, and the
results compared with the ones obtained by classical algorithms.
|
617. | Cohen, LD, "Multiple contour finding and perceptual grouping using minimal paths," JOURNAL OF MATHEMATICAL IMAGING AND VISION, vol. 14, pp. 225-236, 2001.
Abstract:
We address the problem of finding a set of contour curves in an image.
We consider the problem of perceptual grouping and contour completion,
where the data is a set of points in the image. A new method to find
complete curves from a set of contours or edge points is presented. Our
approach is based on a previous work on finding contours as minimal
paths between two end points using the fast marching algorithm (L. D
Cohen and R. Kimmel, International Journal of Computer Vision, Vol. 24,
No. 1, pp. 57-78, 1997). Given a set of key points, we find the pairs
of points that have to be linked and the paths that join them. We use
the saddle points of the minimal action map. The paths are obtained by
backpropagation from the saddle points to both points of each pair.
In a second part, we propose a scheme that does not need key points for
initialization. A set of key points is automatically selected from a
larger set of admissible points. At the same time, saddle points
between pairs of key points are extracted. Next, paths are drawn on the
image and give the minimal paths between selected pairs of points. The
set of minimal paths completes the initial set of contours and allows
to close them. We illustrate the capability of our approach to close
contours with examples on various images of sets of edge points of
shapes with missing contours.
|
618. | Coleman, TF, Li, YY, and Mariano, A, "Segmentation of pulmonary nodule images using 1-norm minimization," COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, vol. 19, pp. 243-272, 2001.
Abstract:
Total variation minimization (in the 1-norm) has edge preserving and
enhancing properties which make it suitable for image segmentation. We
present Image Simplification, a new formulation and algorithm for image
segmentation. We illustrate the edge enhancing properties of 1-norm
total variation minimization in a discrete setting by giving exact
solutions to the problem for piecewise constant functions in the
presence of noise. In this case, edges can be exactly recovered if the
noise is sufficiently small. After optimization, segmentation is
completed using edge detection. We find that our image segmentation
approach yields good results when applied to the segmentation of
pulmonary nodules.
|
619. | Park, JY, McInerney, T, Terzopoulos, D, and Kim, MH, "A non-self-intersecting adaptive deformable surface for complex boundary extraction from volumetric images," COMPUTERS & GRAPHICS-UK, vol. 25, pp. 421-440, 2001.
Abstract:
This paper proposes a non-self-intersecting multiscale deformable
surface model with an adaptive remeshing capability. The model is
specifically designed to extract the three-dimensional boundaries of
topologically simple but geometrically complex anatomical structures,
especially those with deep concavities such as the brain, from
volumetric medical images. The model successfully addresses three
significant problems of conventional deformable models when dealing
with such structures-sensitivity to model initialization, difficulties
in dealing with severe object concavities, and model self-intersection.
The first problem is addressed using a multiscale scheme, which
extracts the boundaries of objects in a coarse-to-fine fashion by
applying a multiscale deformable surface model to a multiresolution
volume image pyramid. The second problem is addressed with adaptive
remeshing, which progressively resamples the triangulated deformable
surface model both globally and locally, matching its resolution to the
levels of the volume image pyramid. Finally, the third problem is
solved by including a non-self-intersection force among the customary
internal and external forces in a physics-based model formulation. Our
deformable surface model is more efficient, much less sensitive to
initialization and spurious image features, more proficient in
extracting boundary concavities, and not susceptible to
self-intersections compared to most other models of its type. This
paper presents results of applying our new deformable surface model to
the extraction of a spherical surface with concavities from a
computer-generated volume image and a brain cortical surface from a
real MR volume image. (C) 2001 Elsevier Science Ltd. All rights
reserved.
|
620. | Lin, IJ, and Kung, SY, "Extraction of video objects via surface optimization and Voronoi order," JOURNAL OF VLSI SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, vol. 29, pp. 23-39, 2001.
Abstract:
We implement a video object segmentation system that integrates the
novel concept of Voronoi Order with existing surface optimization
techniques to support the MPEG-4 functionality of object-addressable
video content in the form of video objects. The major enabling
technology for the MPEG-4 standard are systems that compute video
object segmentation, i.e., the extraction of video objects from a given
video sequence. Our surface optimization formulation describes the
video object segmentation problem in the form of an energy function
that integrates many visual processing techniques. By optimizing this
surface, we balance visual information against predictions of models
with a priori information and extract video objects from a video
sequence. Since the global optimization of such an energy function is
still an open problem, we use Voronoi Order to decompose our
formulation into a tractable optimization via dynamic programming
within an iterative framework. In conclusion, we show the results of
the system on the MPEG-4 test sequences, introduce a novel objective
measure, and compare results against those that are hand-segmented by
the MPEG-4 committee.
|
621. | Ladak, HM, Thomas, JB, Mitchell, JR, Rutt, BK, and Steinman, DA, "A semi-automatic technique for measurement of arterial wall from black blood MRI," MEDICAL PHYSICS, vol. 28, pp. 1098-1107, 2001.
Abstract:
Black blood magnetic resonance imaging (MRI) has become a popular
technique fur imaging the artery wall in vivo. Its noninvasiveness and
high resolution make it ideal for studying the progression of early
atherosclerosis in normal volunteers or asymptomatic patients with mild
disease, However, the operator variability inherent in the manual
measurement of vessel wall area from MR images hinders the reliable
detection of relatively small changes in the artery wall over time. In
this paper we present a semi-automatic method for segmenting the inner
and outer boundary of the artery wall, and evaluate its operator
variability using analysis of variance (ANOVA). In our approach, a
discrete dynamic contour is approximately initialized by an operator,
deformed to the inner boundary, dilated, and then deformed to the outer
boundary. A group of four operators performed repeated measurements on
12 images from normal human subjects using both our semiautomatic
technique and a manual approach. Results from the ANOVA indicate that
the inter-operator standard error of measurement (SEM) of total wall
area decreased from 3.254 mm(2) (manual) to 1.293 mm(2) (semi
automatic), and the intra-operator SEM decreased from 3.005 mm(2) to
0.958 mm(2). Operator reliability coefficients increased fi om less
than 69% to more than 91% tinter-operator) and 95% (intra-operator).
The minimum detectable change in wall area improved from more than 8.32
mm(2) (intra-operator, manual) to less than 3.59 mm(2) tinter-operator,
semiautomatic), suggesting that it is better to have multiple operators
measure wall area with our semi-automatic technique than to have a
single operator make repeated measurements manually. Similar
improvements in wall thickness and lumen radius measurements were also
recorded. Since the semi-automatic technique has effectively ruled out
the effect. of the operator on these measurements, it may be possible
to use such techniques to expand prospective studies of atherogenesis
to multiple centers so as to increase access to real patient data
without sacrificing reliability. (C) 2001 American Association of
Physicists in Medicine.
|
622. | Ruch, O, and Refregier, P, "Minimal-complexity segmentation with a polygonal snake adapted to different optical noise models," OPTICS LETTERS, vol. 26, pp. 977-979, 2001.
Abstract:
Polygonal active contours (snakes) have been used with success for
target segmentation and tracking. We propose to adapt a technique based
on the minimum description length principle to estimate the complexity
(proportional to the number of nodes) of the polygon used for the
segmentation. We demonstrate that, provided that an up-and-down
multiresolution strategy is implemented, it is possible to estimate
efficiently this number of nodes without a priori knowledge and with a
fast algorithm, leading to a segmentation criterion without free
parameters. We also show that, for polygonal-shaped objects, this new
technique leads to better results than using a simple regularization
strategy based on the smoothness of the contour. (C) 2001 Optical
Society of America.
|
623. | Saha, PK, and Udupa, JK, "Optimum image thresholding via class uncertainty and region homogeneity," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 23, pp. 689-706, 2001.
Abstract:
Thresholding is a popular image segmentation method that converts a
gray-level image into a binary image. The selection of optimum
thresholds has remained a challenge over decades. Besides being a
segmentation tool on its own, often it is also a step in many advanced
image segmentation techniques in spaces other than the image space.
Most of the thresholding methods reported to date are based on
histogram analysis using information-theoretic approaches. These
methods have not harnessed the information captured in image
morphology. Here, we introduce a novel thresholding method that
accounts for both intensity-based class uncertainty-a histogram-based
property-and region homogeneity-an image morphology-based property. A
scale-based formulation is used for region homogeneity computation. At
any threshold, intensity-based class uncertainty is computed by fitting
a Gaussian to the intensity distribution of each of the two regions
segmented at that threshold. The theory of the optimum thresholding
method is based on the postulate that objects manifest themselves with
fuzzy boundaries in any digital image acquired by an imaging device.
The main idea here is to select that threshold at which pixels with
high class uncertainty accumulate mostly around object boundaries. To
achieve this, a new threshold energy criterion is formulated using
class-uncertainty and region homogeneity such that, at any image
location, a high energy is created when both class uncertainty and
region homogeneity are high or both are low. Finally, the method
selects that threshold which corresponds to the minimum overall energy.
The method has been compared to a recently published maximum segmented
image information (MSII) method. Superiority of the proposed method was
observed both qualitatively on clinical medical images as well as
quantitatively on 250 realistic phantom images generated by adding
different degrees of blurring, noise, and background variation to real
objects segmented from clinical images.
|
624. | Mahnken, AH, Kohnen, M, Steinberg, S, Wein, BB, and Gunther, RW, "Automated image analysis of lateral lumber X-rays by a form model.," ROFO-FORTSCHRITTE AUF DEM GEBIET DER RONTGENSTRAHLEN UND DER BILDGEBENDEN VERFAHREN, vol. 173, pp. 554-557, 2001.
Abstract:
Purpose: Development of a software for fully automated image analysis
of lateral lumbar spine X-rays. Material and method: Using the concept
of active shape models, we developed a software that produces a form
model of the lumbar spine from lateral lumbar spine radiographs and
runs an automated image segmentation. This model is able to detect
lumbar vertebrae automatically after the filtering of digitized X-ray
images. The model was trained with 20 lateral lumbar spine radiographs
with no pathological findings before we evaluated the software with 30
further X-ray images which were sorted by image quality ranging from
one (best) to three (worst). There were 10 images for each quality.
Results: image recognition strongly depended on image quality. In group
one 52 and in group two 51 out of 60 vertebral bodies including the
sacrum were recognized, but in group three only 18 vertebral bodies
were properly identified. Conclusion: Fully automated and reliable
recognition of vertebral bodies from lateral spine radiographs using
the concept of active shape models is possible. The precision of this
technique is limited by the superposition of different structures.
Further improvements are necessary. Therefore standardized image
quality and enlargement of the training data set are required.
|
625. | Varekamp, C, and Hoekman, DH, "Segmentation of high-resolution InSAR data of a tropical forest using Fourier parameterized deformable models," INTERNATIONAL JOURNAL OF REMOTE SENSING, vol. 22, pp. 2339-2350, 2001.
Abstract:
Currently, tree maps are produced from field measurements that are time
consuming and expensive. Application of existing techniques based on
aerial photography is often hindered by cloud cover. This has initiated
research into the segmentation of high resolution airborne
interferometric Synthetic Aperture Radar (SAR) data for deriving tree
maps. A robust algorithm is constructed to optimally position closed
boundaries. The boundary of a tree crown will be best approximated when
at all points on the boundary, the z-coordinate image gradient is
maximum, and directed inwards orthogonal to the boundary. This property
can be expressed as the result of a line integral along the boundary.
Boundaries with a large value for the line integral are likely to be
tree crowns. This paper focuses on the search procedure and on
illustrating how smoothing can be used to prevent the search from
becoming trapped in a local optimum. The final crown detection stage is
not described in this paper but could be based on the gradient and
implemented using the above described value for the line integral.
Results of this paper indicate that a Fourier parametrization with only
three harmonics (nine parameters) can describe the shape variation in
the 2D crown projection in sufficient detail. Current ground datasets
are not suitable for obtaining detection statistics such as the
percentage of tree crowns detected and the number of false alarms.
Better ground datasets will be needed to evaluate algorithm performance
for real tree mapping situations.
|
626. | Chang, IC, and Huang, CL, "Skeleton-based walking motion analysis using hidden Markov model and active shape models," JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, vol. 17, pp. 371-403, 2001.
Abstract:
This paper proposes a skeleton-based human walking motion analysis
system which consists of three major phases. In the first phase, it
extracts the human body skeleton from the background and then obtains
the body signatures. In the second phase, it analyzes the training
sequences to generate statistical models. In the third phase, it uses
the trained models to recognize the input human motion sequence and
calculate the motion parameters. The experimental results demonstrate
how our system can recognize the motion type and describe the motion
characteristics of the image sequence. Finally, the synthesized motion
sequences are illustrated. The major contributions of this paper are:
(1) development of a skeleton-based method and use of Hidden Markov
Models (HMM) to recognize the motion type; (2) incorporation of the
Active Shape Models (ASMs) and the body structure characteristics to
generate the motion parameter curves of the human motion.
|
627. | Kiyuna, T, Kamijo, K, Yamazaki, T, Moriyama, N, and Sekiguchi, R, "Automated reconstruction of a three-dimensional brain model from magnetic resonance images," NEUROIMAGE, vol. 13, pp. S173-S173, 2001.
Abstract:
In this paper, we address two problems crucial to motion analysis: the
detection of moving objects and their localisation. Statistical and
level set approaches are adopted in formulating these problems. For the
change detection problem, the inter-frame difference is modelled by a
mixture of two zero-mean Laplacian distributions. At first, statistical
tests using criteria with negligible error probability are used for
labelling as changed or unchanged as many sites as possible. All the
connected components of the labelled sites are used thereafter as
region seeds, which give the initial level sets for which velocity
fields for label propagation are provided, We introduce a new
multi-label fast marching algorithm for expanding competitive regions.
The solution of the localisation problem is based on the map of changed
pixels previously extracted. The boundary of the moving object is
determined by a level set algorithm, which is initialised by two curves
evolving in converging opposite directions. The sites of curve contact
determine the position of the object boundary. Experimental results
using real video sequences are presented, illustrating the efficiency
of the proposed approach. (C) 2001 Elsevier Science B.V. All rights
reserved.
|
628. | Sifakis, E, and Tziritas, G, "Moving object localisation using a multi-label fast marching algorithm," SIGNAL PROCESSING-IMAGE COMMUNICATION, vol. 16, pp. 963-976, 2001.
Abstract:
In this paper, we address two problems crucial to motion analysis: the
detection of moving objects and their localisation. Statistical and
level set approaches are adopted in formulating these problems. For the
change detection problem, the inter-frame difference is modelled by a
mixture of two zero-mean Laplacian distributions. At first, statistical
tests using criteria with negligible error probability are used for
labelling as changed or unchanged as many sites as possible. All the
connected components of the labelled sites are used thereafter as
region seeds, which give the initial level sets for which velocity
fields for label propagation are provided, We introduce a new
multi-label fast marching algorithm for expanding competitive regions.
The solution of the localisation problem is based on the map of changed
pixels previously extracted. The boundary of the moving object is
determined by a level set algorithm, which is initialised by two curves
evolving in converging opposite directions. The sites of curve contact
determine the position of the object boundary. Experimental results
using real video sequences are presented, illustrating the efficiency
of the proposed approach. (C) 2001 Elsevier Science B.V. All rights
reserved.
|
629. | Suri, JS, "Two-dimensional fast magnetic resonance brain segmentation," IEEE ENGINEERING IN MEDICINE AND BIOLOGY MAGAZINE, vol. 20, pp. 84-95, 2001.
Abstract:
This study quantifies variance components of two-dimensional strains in
the left-ventricular heart wall assessed by magnetic resonance (MR)
tagging in 18 healthy xxvolunteers. For a 7-mm tagging grid and
homogeneous strain analysis, the intersubject variability and
measurement error were estimated, as well as the intra- and
interobserver variability. The variance components were calculated for
the mean strain of a circumferential sector. The results show that the
measurement error was almost equal to the intra-observer variability.
With four circumferential sectors of 90 degrees each, approximately 65%
of the total variance in epsilon (r) and epsilon (c) was due to
intersubject variability, the remaining 35% was due to measurement
error. With 12 sectors of 30 degrees each, the intersubject variability
and measurement error both contributed 50% to the total variance. With
18 sectors of 20 degrees each, only 40% of the total variance was due
to intersubject variability. The total variability increased with the
number of sectors and therefore the number of sectors used in a study
will be a trade-off between segment size (defining spatial resolution)
and variability.
|
630. | Kuijer, JPA, Marcus, JT, Gotte, MJW, van Rossum, AC, Ader, HJ, and Heethaar, RM, "Variance components of two-dimensional strain parameters in the left-ventricular heart wall obtained by magnetic resonance tagging," INTERNATIONAL JOURNAL OF CARDIAC IMAGING, vol. 17, pp. 49-60, 2001.
Abstract:
This study quantifies variance components of two-dimensional strains in
the left-ventricular heart wall assessed by magnetic resonance (MR)
tagging in 18 healthy xxvolunteers. For a 7-mm tagging grid and
homogeneous strain analysis, the intersubject variability and
measurement error were estimated, as well as the intra- and
interobserver variability. The variance components were calculated for
the mean strain of a circumferential sector. The results show that the
measurement error was almost equal to the intra-observer variability.
With four circumferential sectors of 90 degrees each, approximately 65%
of the total variance in epsilon (r) and epsilon (c) was due to
intersubject variability, the remaining 35% was due to measurement
error. With 12 sectors of 30 degrees each, the intersubject variability
and measurement error both contributed 50% to the total variance. With
18 sectors of 20 degrees each, only 40% of the total variance was due
to intersubject variability. The total variability increased with the
number of sectors and therefore the number of sectors used in a study
will be a trade-off between segment size (defining spatial resolution)
and variability.
|
631. | Ravhon, R, Adam, D, and Zelmanovitch, L, "Validation of ultrasonic image boundary recognition in abdominal aortic aneurysm," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 20, pp. 751-763, 2001.
Abstract:
An aneurysm of the abdominal aorta (AAA) is characterized by modified
wall properties, and a balloon-like area usually filled by a thrombus.
A rupture of an aortic aneurysm can be fatal, yet there is no way to
accurately predict such an occurrence. The study of the wall and
thrombus cross-sectional distension, due to a pressure wave, is
important as a way of assessing the degradation of the mechanical
properties of the vessel wall and the risk of a rupture. Echo
ultrasound transverse cross-sectional imaging is used here to study the
thrombus and the aortic wall distension, requiring their segmentation
within the image. Polar coordinates are defined, and a search is
performed for minimizing a cost function, which includes a description
of the boundary (based on a limited series of sine and cosine
functions) and information from the image intensity gradients along the
radii. The method is based on filtering by a modified Canny-Deriche
edge detector and then on minimization of an energy function based on
five parts. Since echoes from blood in the lumen and the thrombus
produce similar patterns and speckle noise, a modified version for
identifying the lumen-thrombus border was developed. The method has
been validated by various ways, including parameter sensitivity testing
and comparison to the performance of an expert. It is robust enough to
track the lumen and total arterial cross-sectional area changes during
the cardiac cycle. In 34 patients where sequences of images were
acquired, the border between the thrombus and the arterial wall was
detected with errors less than 2%, while the lumen-thrombus border was
detected with a mean error of 4%. Thus, a noninvasive measurement of
the AAA cross-sectional area is presented, which has been validated and
found to be accurate.
|
632. | Gatzoulis, L, Watson, RJ, Jordan, LB, Pye, SD, Anderson, T, Uren, N, Salter, DM, Fox, KAA, and McDicken, WN, "Three-dimensional forward-viewing intravascular ultrasound imaging of human arteries in vitro," ULTRASOUND IN MEDICINE AND BIOLOGY, vol. 27, pp. 969-982, 2001.
Abstract:
The aim of this work was to investigate the suitability of a novel
forward-viewing intravascular ultrasound (IVUS) technique for
three-dimensional imaging of severely stenosed or totally occluded
vessels, where the conventional side-viewing IVUS systems are of
limited use. A stiff 3.8 mm diameter forward-viewing catheter was
manufactured to scan a 72 degrees sector ahead of its tip. Conical
volume data were acquired by rotating the catheter over 180 degrees by
means of a motorised mechanical system. Operating at 30 MHz, the
catheter was integrated with an IVUS scanner and a radiofrequency data
acquisition system. Postmortem carotid and femoral arteries were
scanned in vitro. Correlation of the reconstructed images with
histology demonstrated the ability of this forward-viewing IVUS system
to visualise healthy lumens, bifurcations, thickened atherosclerotic
walls and, most importantly, severe and complete vessel occlusions. A
rotating-sector forward-viewing IVUS system is suitable for anatomical
assessment of severely diseased vessels in three dimensions.
|
633. | Kerschner, M, "Seamline detection in colour orthoimage mosaicking by use of twin snakes," ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING, vol. 56, pp. 53-64, 2001.
Abstract:
In the last step of the mosaic production chain. neighbouring and
partly overlapping orthoimages of a scene are merged to one mosaic.
This should be done in a way that the transition from one to another
orthoimage cannot be seen. The production line of orthoimages consists
of several steps, each of which can introduce a different appearance
regarding geometry, radiometry and spectral properties to the resulting
orthoimage. For mosaicking adjacent orthoimages. a path of lowest
difference in a combination of criteria is searched in the overlap area
of these images. The seamline is chosen along this path of maximum
similarity. In this paper, criteria for such an optimal seamline in
colour orthoimages are elaborated. The main requirements are on one
hand high colour similarity of the images (mainly in hue and
intensity), and on the other hand high texture similarity (in
orientation and magnitude of image gradients). The specified criteria
are formulated in the energy function of snakes. A snake is an active
contour which moves through an image and changes its shape until a
minimum of its energy function is found. We use two snakes that attract
one another (twin snakes). In a hierarchical strategy, a proper
seamline is delineated fully automatically. The potential of the method
is shown with an example. (C) 2001 Elsevier Science B.V. Alt rights
reserved.
|
634. | Chen, JX, Wechsler, H, Pullen, JM, Zhu, Y, and MacMahon, EB, "Knee surgery assistance: Patient model construction, motion simulation, and biomechanical visualization," IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, vol. 48, pp. 1042-1052, 2001.
Abstract:
We present a new system that integrates computer graphics,
physics-based modeling, and interactive visualization to assist knee
study and surgical operation. First, we discuss generating
patient-specific three-dimensional (3-D) knee models from patient's
magnetic resonant images (MRIs). The 3-D model is obtained by deforming
a reference model to match the MRI dataset. Second, we present
simulating knee motion that visualizes patient-specific motion data on
the patient-specific knee model. Third, we introduce visualizing
biomechanical information on a patient-specific model. The focus is on
visualizing contact area, contact forces, and menisci deformation.
Traditional methods have difficulty in visualizing knee contact area
without using invasive methods. The approach presented here provides an
alternative of visualizing the knee contact area and forces without any
risk to the patient. Finally, a virtual surgery can be performed. The
constructed 3-D knee model is the basis of motion simulation,
biomechanical visualization, and virtual surgery. Knee motion
simulation determines the knee rotation angles as well as knee contact
points. These parameters are used to solve the biomechanical model. Our
results integrate 3-D construction, motion simulation, and
biomechanical visualization into one system. Overall, the methodologies
here are useful elements for future virtual medical systems where all
the components of visualization, automated model generation, and
surgery simulation come together.
|
635. | Eriksson, M, and Papanikolopoulos, NP, "Driver fatigue: a vision-based approach to automatic diagnosis," TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, vol. 9, pp. 399-413, 2001.
Abstract:
In this paper, we describe a system that locates and tracks the eyes of
a driver. The purpose of such a system is to perform detection of
driver fatigue. By mounting a small camera inside the car, we can
monitor the face of the driver and look for eye movements which
indicate that the driver is no longer in condition to drive. In such a
case, a warning signal should be issued. This paper describes how to
find and track the eyes. We also describe a method that can determine
if the eyes are open or closed. The primary criterion for this system
is that it must be highly non-intrusive. The system must also operate
regardless of the texture and the color of the face. It must also be
able to handle changing conditions such as changes in light, shadows,
reflections, etc. Initial experimental results are very promising even
when the driver moves his/her head in a way such that the camera does
not have a frontal view of the driver's face. (C) 2001 Elsevier Science
Ltd. All rights reserved.
|
636. | Kosmopoulos, D, and Varvarigou, T, "Automated inspection of gaps on the automobile production line through stereo vision and specular reflection," COMPUTERS IN INDUSTRY, vol. 46, pp. 49-63, 2001.
Abstract:
One of the most difficult tasks in the later stages of automobile
assembly is the dimensional inspection of the gaps between the car body
and the various panels fitted on it (doors, motor-hood, etc.). The
employment of an automatic gap-measuring system would reduce the costs
significantly and would offer high flexibility. However, this task is
still performed by humans and only a few - still experimental -
automatic systems have been reported. In this paper, we introduce a
system for automated gap inspection that employs computer vision. It is
capable of measuring the lateral and the range dimension of the gap
(width and flush, correspondingly). The measurement installation
consists of two calibrated stereo cameras and two infrared LED lamps,
used for highlighting the edges of the gap through specular reflection.
The gap is measured as the 3D distance between the highlighted edges.
This method has significant advantages against the laser-based,
gap-measuring systems, mainly due to its color independency. Our
approach has been analytically described in 2D and extensively
evaluated using synthetic as well as real gaps. The results obtained
verify its robustness and its applicability in an industrial
environment. (C) 2001 Published by Elsevier Science B.V.
|
637. | Delingette, H, and Montagnat, J, "Shape and topology constraints on parametric active contours," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 83, pp. 140-171, 2001.
Abstract:
In recent years, the field of active contour-based image segmentation
has seen the emergence of two competing approaches. The first and
oldest approach represents active contours in an explicit (or
parametric) manner corresponding to the Lagrangian formulation. The
second approach represents active contours in an implicit manner
corresponding to the Eulerian framework. After comparing these two
approaches, we describe several new topological and physical
constraints applied to parametric active contours in order to combine
the advantages of these two contour representations. More precisely, we
introduce three algorithms related to the control of the contour
topology, geometry, and deformation. The first algorithm controls both
vertex spacing and contour smoothness in an independent and intrinsic
manner. The second algorithm controls the contour resolution (number of
vertices) while the third algorithm automatically creates or fuses
connected components on closed or opened contours. The efficiency of
these algorithms is demonstrated on several images including medical
images and a comparison with the level-sets method is also provided.
(C) 2001 Academic Press.
|
638. | Lorigo, LM, Faugeras, OD, Grimson, WEL, Keriven, R, Kikinis, R, Nabavi, A, and Westin, CF, "CURVES: Curve evolution for vessel segmentation," MEDICAL IMAGE ANALYSIS, vol. 5, pp. 195-206, 2001.
Abstract:
The vasculature is of utmost importance in neurosurgery. Direct
visualization of images acquired with current imaging modalities,
however, cannot provide a spatial representation of small vessels.
These vessels, and their branches which show considerable variations,
are most important in planning and performing neurosurgical procedures.
In planning they provide information on where the lesion draws its
blood supply and where it drains. During surgery the vessels serve as
landmarks and guidelines to the lesion. The more minute the information
is, the more precise the navigation and localization of computer guided
procedures. Beyond neurosurgery and neurological study, vascular
information is also crucial in cardiovascular surgery, diagnosis, and
research. This paper addresses the problem of automatic segmentation of
complicated curvilinear structures in three-dimensional imagery, with
the primary application of segmenting vasculature in magnetic resonance
angiography (MRA) images. The method presented is based on recent curve
and surface evolution work in the computer vision community which
models the object boundary as a manifold that evolves iteratively to
minimize an energy criterion. This energy criterion is based both on
intensity values in the image and on local smoothness properties of the
object boundary, which is the vessel wall in this application. In
particular, the method handles curves evolving in 3D, in contrast with
previous work that has dealt with curves in 2D and surfaces in 3D.
Results are presented on cerebral and aortic MRA data as well as lung
computed tomography (CT) data. (C) 2001 Elsevier Science B.V. All
rights reserved.
|
639. | Goldenberg, R, Kimmel, R, Rivlin, E, and Rudzsky, M, "Fast geodesic active contours," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 10, pp. 1467-1475, 2001.
Abstract:
We use an unconditionally stable numerical scheme to implement a fast
version of the geodesic active contour model. The proposed scheme is
useful for object segmentation in images, like tracking moving objects
in a sequence of images. The method is based on the
Weickert-Romeney-Viergever (additive operator splitting) AOS scheme. It
is applied at small regions, motivated by Adalsteinsson-Sethian level
set narrow band approach, and uses Sethian's fast marching method for
re-initialization. Experimental results demonstrate the power of the
new method for tracking in color movies.
|
640. | Fernandez-Caballero, A, Mira, J, Fernandez, MA, and Lopez, MT, "Segmentation from motion of non-rigid objects by neuronal lateral interaction," PATTERN RECOGNITION LETTERS, vol. 22, pp. 1517-1524, 2001.
Abstract:
The problem we are stating is the discrimination of non-rigid objects
capable of holding our attention in a scene. Motion allows gradually
obtaining all moving objects shapes. We introduce an algorithm that
fuses spots obtained by means of neuronal lateral interaction in
accumulative computation. (C) 2001 Elsevier Science B.V. All rights
reserved.
|
641. | Pardas, M, and Sayrol, E, "Motion estimation based tracking of active contours," PATTERN RECOGNITION LETTERS, vol. 22, pp. 1447-1456, 2001.
Abstract:
This paper addresses the application of active contours or snakes for
tracking of contours in image sequences. We propose to use the dynamic
programming implementation of the snakes in order to restrict the
possible candidates for a given snaxel to those that have a high
correlation with the corresponding snaxel in the previous frame.
Besides, we claim that, in tracking applications, the motion
compensation error has to be introduced in the external energy of the
snake to be able to track generic contours. (C) 2001 Elsevier Science
B.V. All rights reserved.
|
642. | Ferrant, M, Macq, B, Nabavi, A, and Warfield, SK, "Deformable modeling for characterizing biomedical shape changes," DISCRETE GEOMETRY FOR COMPUTER IMAGERY, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1953, pp. 235-248, 2001.
Abstract:
We present a new algorithm for modeling and characterizing shape
changes in 3D image sequences of biomedical structures. Our algorithm
tracks the shape changes of the objects depicted in the image sequence
using an active surface algorithm. To characterize the deformations of
the surrounding and inner volume of the object's surfaces, we use a
physics-based model of the objects the image represents. In the
applications we are presenting, our physics-based model is linear
elasticity and we solve the corresponding equilibrium equations using
the Finite Element (FE) method. To generate a FE mesh from the initial
3D image, we have developed a new multiresolution tetrahedral mesh
generation algorithm specifically suited for labeled image volumes. The
shape changes of the surfaces of the objects are used as boundary
conditions to our physics-based FE model and allow us to infer a
volumetric deformation field from the surface deformations.
Physics-based measures such as stress tensor maps can then be derived
from our model for characterizing the shape changes of the objects in
the image sequence. Experiments on synthetic images as well as on
medical data show the performances of the algorithm.
|
643. | Koozekanani, D, Boyer, K, and Roberts, C, "Retinal thickness measurements from optical coherence tomography using a Markov boundary model," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 20, pp. 900-916, 2001.
Abstract:
We present a system for detecting retinal boundaries in optical
coherence tomography (OCT) B-scans. OCT is a relatively new imaging
modality giving cross-sectional images that are qualitatively similar
to ultrasound. However, the axial resolution with OCT is much higher.
on the order of 10 mum. Objective, quantitative measures of retinal
thickness may be made from OCT images. Knowledge of retinal thickness
is important in the evaluation and treatment of many ocular diseases.
The boundary-detection system presented here uses a one-dimensional
edge-detection kernel to yield edge primitives. These edge primitives
are rated, selected, and organized to form a coherent boundary
structure by use of a Markov model of retinal boundaries as detected by
OCT. Qualitatively, the boundaries detected by the automated system
generally agreed extremely well with the true retinal structure for the
vast majority of OCT images. Only one of the 1450 evaluation images
caused the algorithm to fail. A quantitative evaluation of the retinal
boundaries was performed as well, using the clinical application of
automatic retinal thickness determination. Retinal thickness
measurements derived from the algorithm's results were compared with
thickness measurements from manually corrected boundaries for 1450 test
images. The algorithm's thickness measurements over a 1-mm region near
the fovea differed from the corrected thickness measurements by less
than 10 mum for 74% of the images and by less than 25 mum (10% of
normal retinal thickness) for 98.4% of the images. These errors are
near the machine's resolution limit and still well below clinical
significance. Current, standard clinical practice involves a
qualitative, visual assessment of retinal thickness. A robust,
quantitatively accurate system such as ours can be expected to improve
patient care.
|
644. | Torheim, G, Amundsen, T, Rinck, PA, Haraldseth, O, and Sebastiani, G, "Analysis of contrast-enhanced dynamic MR images of the lung," JOURNAL OF MAGNETIC RESONANCE IMAGING, vol. 13, pp. 577-587, 2001.
Abstract:
Recent studies have demonstrated the potential of dynamic
contrast-enhanced magnetic resonance Imaging (MRI) describing pulmonary
perfusion. However, breathing motion, susceptibility artifacts, and a
low signal-to-noise ratio (SNR) make automatic pixel-by-pixel analysis
difficult. In the present work, we propose a novel method to compensate
for breathing motion. In order to test the feasibility of this method,
we enrolled 53 patients with pulmonary embolism (N = 24), chronic
obstructive pulmonary disease (COPD) (N = 14), and acute pneumonia (N =
15). A crucial part of the method, an automatic diaphragm detection
algorithm, was evaluated in all 53 patients by two Independent
observers. The accuracy of the method to detect the diaphragm showed a
success rate of 92%. Furthermore, a Bayesian noise reduction technique
was implemented and tested. This technique significantly reduced the
noise level without removing important clinical information. In
conclusion, the combination of a motion correction method and a
Bayesian noise reduction method offered a rapid, semiautomatic
pixel-by-pixel analysis of the lungs with great potential for research
and clinical use. (C) 2001 Wiley-Liss, Inc.
|
645. | Qatarneh, SM, Crafoord, J, Kramer, EL, Maguire, GQ, Brahme, A, Noz, ME, and Hyodynmaa, S, "A whole body atlas for segmentation and delineation of organs for radiation therapy planning," NUCLEAR INSTRUMENTS & METHODS IN PHYSICS RESEARCH SECTION A-ACCELERATORS SPECTROMETERS DETECTORS AND ASSOCIATED EQUIPMENT, vol. 471, pp. 160-164, 2001.
Abstract:
A semi-automatic procedure for delineation of organs, to be used as the
basis of a whole body atlas database for radiation therapy planning was
developed. The Visible Human Male Computed Tomography (CT)-data set was
used as a "standard man" reference. The organ of interest was outlined
manually and then transformed by a polynomial warping algorithm onto a
clinical patient CT. This provided an initial contour, which was then
adjusted and refined by the semi-automatic active contour model to find
the final organ outline. The liver was used as a test organ for
evaluating the performance of the procedure. Liver outlines obtained by
the segmentation algorithm on six patients were compared to those
manually drawn by, a radiologist. The combination of warping and
semi-automatic active contour model generally provided satisfactory
segmentation results, but the procedure has to be extended to three
dimensions. (C) 2001 Elsevier Science B.V. All rights reserved.
|
646. | Biscay, RJ, and Mora, CM, "Metric sample spaces of continuous geometric curves and estimation of their centroids," MATHEMATISCHE NACHRICHTEN, vol. 229, pp. 15-49, 2001.
Abstract:
The metric sample space of Frechet curves (FRECHET, 1934, 1951, 1961)
is based on a generalization of regular curves that covers continuous
curves in full generality. This makes it possible to deal with both
smooth and non-smooth, even non-rectifiable geometric curves in
statistical analysis. In the present paper this sample space is further
extended in two directions that are relevant in practice: to
incorporate information on landmark points in the curves and to impose
invariance with respect to an arbitrary group of isometric spatial
transformations. Properties of the introduced sample spaces of curves
are studied, specially those concerning to the generation and
representation of random curves by random functions. In order to
provide measures of central tendency and dispersion of random curves,
centroids and restricted centroids of random curves are defined in a
general metric framework, and methods for their consistent estimation
are derived.
|
647. | Aissaoui, R, Kauffmann, C, Dansereau, J, and de Guise, JA, "Analysis of pressure distribution at the body-seat interface in able-bodied and paraplegic subjects using a deformable active contour algorithm," MEDICAL ENGINEERING & PHYSICS, vol. 23, pp. 359-367, 2001.
Abstract:
In this paper, a semi-automatic method for segmenting pressure
distribution image-based data at the body-seat interface is presented.
The purpose of this work was to estimate the surface and the load
supported by the ischial tuberosity (IT) region. The proposed method
involves three steps: (1) detecting the IT region using a
pressure-distribution image gradient; (2) estimating the contour of the
IT region by an iterative active contour algorithm and finally (3)
estimating the percentage of the surface and the weight-bearing of the
IT region in a group of able-bodied (AB) and spinal-cord injury (SCI)
subjects. It was found in this study that the weight bearing on the IT
for the spinal-cord injured group is distributed on half the surface in
comparison with the AB group or the powered wheelchair users groups.
The findings of this study provide insights concerning pressure
distribution in sitting for the paraplegic and able-bodied. (C) 2001
IPEM. Published by Elsevier Science Ltd. All rights reserved.
|
648. | Jermyn, IH, and Ishikawa, H, "Globally optimal regions and boundaries as minimum ratio weight cycles," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 23, pp. 1075-1088, 2001.
Abstract:
We describe anew form of energy functional for the modeling and
identification of regions in images. The energy is defined on the space
of boundaries in the image domain and can incorporate very general
combinations of modeling information both from the boundary (intensity
gradients, etc.) and from the interior of the region (texture,
homogeneity, etc.). We describe two polynomial-time digraph algorithms
for finding the global minima of this energy. One of the algorithms is
completely general, minimizing the functional for any choice of
modeling information. It runs in a few seconds on a 256x256 image. The
other algorithm applies to a subclass of functionals, but has the
advantage of being extremely parallelizable. Neither algorithm requires
initialization.
|
649. | Yan, H, "Fuzzy curve-tracing algorithm," IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, vol. 31, pp. 768-780, 2001.
Abstract:
This paper presents a fuzzy clustering algorithm for the extraction of
a smooth curve from unordered noisy data. In this method, the input
data are first clustered into different regions using the fuzzy c-means
algorithm and each region is represented by its cluster center.
Neighboring cluster centers are linked to produce a graph according to
the average class membership values. Loops in the graph are removed to
form a curve according to spatial relations of the cluster centers. The
input samples are then reclustered using the fuzzy c-means (FCM)
algorithm, with the constraint that the curve must be smooth. The
method has been tested with both open and closed curves with good
results.
|
650. | Nikou, C, Bueno, G, Heitz, F, and Armspach, JP, "A joint physics-based statistical deformable model for multimodal brain image analysis," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 20, pp. 1026-1037, 2001.
Abstract:
A probabilistic deformable, model for the representation of multiple
brain structures is described. The statistically learned deformable
model! represents the relative location of different anatomical
surfaces in brain magnetic resonance images (MRIs) and accommodates
their significant variability across different individuals. The
surfaces of each anatomical structure are parameterized by the
amplitudes of the vibration modes of a deformable spherical mesh. For a
given MRI in the training set, a vector containing the largest
vibration modes describing the different deformable surfaces is
created. This random vector is statistically constrained by retaining
the most significant variation modes of its Karhunen-Loeve expansion on
the training population. By these means, the conjunction of surfaces
are deformed according to the anatomical variability observed in the
training set. Two applications of the joint probabilistic deformable
model are presented: isolation of the brain from MRI using the
probabilistic constraints embedded in the model; and deformable
model-based registration of three-dimensional multimodal (magnetic
resonance/single photon emission computed tomography) brain images
without removing nonbrain structures. The multiobject deformable model
may be considered as a first step toward the development of a general
purpose probabilistic anatomical atlas of the brain.
|
651. | Vincze, M, "Robust tracking of ellipses at frame rate," PATTERN RECOGNITION, vol. 34, pp. 487-498, 2001.
Abstract:
The critical issue in vision-based control of motion is robust tracking
at real time. A method is presented that tracks ellipses at field rate
using a Pentium PC. Robustness is obtained by integrating gradient
information and mode (intensity) values for the detection of edgels
along the contour of the ellipse and by using a probabilistic
(RANSAC-like, Fischler and Bolles, Commun. ACM 24(6) (1981) 381) method
to find the most likely ellipse-shaped object. Detailed experiments
document the capabilities and limitations of the approach and the
robustness achieved. (C) 2000 Pattern Recognition Society. Published by
Elsevier Science Ltd. All rights reserved.
|
652. | Son, JD, and Ko, HS, "Robust motion tracking of multiple objects with KL-IMMPDAF," IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, vol. E84D, pp. 179-187, 2001.
Abstract:
This paper describes how the image sequences taken by a stationary
video camera may be effectively processed to detect and track moving
objects against a stationary background in real-time. Our approach is
first to isolate the moving objects in image sequences via a modified
adaptive background estimation method and then perform token tracking
of multiple objects based oil features extracted from the processed
image sequences. In feature based multiple object tracking, the most
prominent, tracking issues are track initialization, data association,
occlusions tills to traffic congestion, and object maneuvering. While
there are limited past works addressing these problems, most relevant
tracking systems proposed in the past are independently focused to
either "occlusion" or "data association" only. In this paper, we
propose the KL-IMMPDA (Kanade Lucas-Interacting Multiple Model
Probabilistic Data Association) filtering approach for multiple-object
tracking to collectively address the key issues. The proposed method
essentially employs optical flow measurements for both detection and
track initialization while the KL-IMMPDA filter is used to accept or
reject measurements, which belong to other objects. The data
association performed by the proposed KL-IMMPDA results in an effective
tracking scheme, which is robust to partial occlusions and image
clutter of object maneuvering. The simulation results show a
significant performance improvement for tracking multi-objects in
occlusion and maneuvering, when compared to other conventional trackers
such as Kalman filter.
|
653. | Luo, YH, and Nelson, BJ, "Fusing force and vision feedback for manipulating deformable objects," JOURNAL OF ROBOTIC SYSTEMS, vol. 18, pp. 103-117, 2001.
Abstract:
This article describes a framework that fuses vision and force feedback
for the control of highly deformable objects. Deformable active
contours, or snakes, are used to visually observe changes in object
shape over time. Finite-element models of object deformations are used
with force feedback to predict expected visually observed deformations.
Our approach improves the performance of large, complex deformable
contour tracking over traditional computer vision tracking techniques.
This same approach of combining deformable active contours with
finite-element material models is modified so that a vision sensor,
i.e., a charge-coupled device (CCD) camera, can be used as a force
sensor. By visually tracking changes in contours on the object,
material deflections can be transformed into applied stress estimates
through finite element modeling. Therefore, internal object stresses
due to object manipulation can be visually observed and controlled,
thus creating a framework for deformable object manipulation. A pinhole
camera model is used to accomplish vision and force sensor feedback
assimilation from these two sensing modalities during manipulation, (C)
2001 John Wiley & Sons, Inc.
|
654. | Manh, AG, Rabatel, G, Assemat, L, and Aldon, MJ, "Weed leaf image segmentation by deformable templates," JOURNAL OF AGRICULTURAL ENGINEERING RESEARCH, vol. 80, pp. 139-146, 2001.
Abstract:
In order to improve weeding strategies in terms of pesticide reduction,
spatial distribution and characterization of in-field weed populations
are important. With recent improvements in image processing, many
studies have focused on weed detection by vision techniques. However,
weed identification still remains difficult because of outdoor scenic
complexity and morphological variability of plants.
A new method of weed leaf segmentation based on the use of deformable
templates is proposed. This approach has the advantage of applying a
priori knowledge to the object searched, improving the robustness of
the segmentation stage. The principle consists of fitting a parametric
model to the leaf outlines in the image, by minimizing an energy term
related to internal constraints of the model and salient features of
the image, such as the colour of the plant.
This method showed promising results for one weed species, green
foxtail (Setaria viridis). In particular, it was possible to
characterize partially occluded leaves. This constitutes a first step
towards a recognition system, based on leaf characteristics and their
relative spatial position. (C) 2001 Silsoe Research Institute.
|
655. | Fukuda, T, Morimoto, Y, Morishita, S, and Tokuyama, T, "Data mining with optimized two-dimensional association rules," ACM TRANSACTIONS ON DATABASE SYSTEMS, vol. 26, pp. 179-213, 2001.
Abstract:
We discuss data mining based on association rules for two numeric
attributes and one Boolean attribute. For example, in a database of
bank customers, "Age" and "Balance" are two numeric attributes, and
"CardLoan" is a Boolean attribute. Taking the pair (Age, Balance) as a
point in two-dimensional space, we consider an association rule of the
form
((Age, Balance) is an element of P) double right arrow (CardLoan = Yes),
which implies that bank customers whose ages and balances fall within a
planar region P tend to take out credit card loans with a high
probability. We consider two classes of regions, rectangles and
admissible (i.e., connected and x-monotone) regions. For each class, we
propose efficient algorithms for computing the regions that give
optimal association rules for gain, support, and confidence,
respectively. We have implemented the algorithms for admissible regions
as well as several advanced functions based on them in our data mining
system named SONAR (System for Optimized Numeric Association Rules),
where the rules are visualized by using a graphic user interface to
make it easy for users to gain an intuitive understanding of rules.
|
656. | Kaygin, S, and Bulut, MM, "A new one-pass algorithm to detect region boundaries," PATTERN RECOGNITION LETTERS, vol. 22, pp. 1169-1178, 2001.
Abstract:
In this paper, active chain is introduced as a chain coded contour
whose shape is changed during iterations while it stays closed,
clockwise and 4 connected. The iterations of the proposed algorithm
move the chain items toward the interior region. This behaviour is
similar to the active contours (snakes). If the initial contour is
counter-clockwise, the same algorithm causes the active chain to expand
like a balloon and detect the inner boundaries of the regions. The
chain coded contours of all the separate regions can be detected in one
pass in O(NM) where N and M are the image dimensions in pixels. (C)
2001 Elsevier Science B.V. All rights reserved.
|
657. | Tsai, A, Yezzi, A, and Willsky, AS, "Curve evolution implementation of the Mumford-Shah functional for image segmentation, denoising, interpolation, and magnification," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 10, pp. 1169-1186, 2001.
Abstract:
In this work, we first address the problem of simultaneous image
segmentation and smoothing by approaching the Mumford-Shah paradigm
from a curve evolution perspective. In particular, we let a set of
deformable contours define the boundaries between regions in an image
where we model the data via piecewise smooth functions and employ a
gradient flow to evolve these contours. Each gradient step involves
solving an optimal estimation problem for the data within each region,
connecting curve evolution and the Mumford-Shah functional with the
theory of boundary-value stochastic processes. The resulting active
contour model offers a tractable implementation of the original
Mumford-Shah model (i.e., without resorting to elliptic approximations
which have traditionally been favored for greater ease in
implementation) to simultaneously segment and smoothly reconstruct the
data within a given image in a coupled manner. Various implementations
of this algorithm are introduced to increase its speed of convergence.
We also outline a hierarchical implementation of this algorithm to
handle important image features such as triple points and other
multiple junctions. Next, by generalizing the data fidelity term of the
original Mumford-Shah functional to incorporate a spatially varying
penalty, we extend our method to problems in which data quality varies
across the image and to images in which sets of pixel measurements are
missing. This more general model leads us to a novel PDE-based approach
for simultaneous image magnification, segmentation, and smoothing,
thereby extending the traditional applications of the Mumford-Shah
functional which only considers simultaneous segmentation and smoothing.
|
658. | Hsu, CC, Lai, PH, Lee, C, and Huang, WC, "Automated nasopharyngeal carcinoma detection with dynamic gadolinium-enhanced MR imaging," METHODS OF INFORMATION IN MEDICINE, vol. 40, pp. 331-337, 2001.
Abstract:
Objectives. The purpose of this research is to develop an automatic
medical diagnosis for segmenting nasopharyngeal carcinoma (NPC) with
dynamic gadolinium-enhanced MR imaging.
Methods: This system is a multistage process, involving motion
correction, head mask generation, dynamic MR data quantitative
evaluation, rough segmentation, and rough segmentation refinement. Two
approaches, a relative signal increase method and a slope method, are
proposed for the quantitative evaluation of dynamic MR data.
Results. The NPC detection results obtained using the proposed methods
had a rating of 85% in match percent compared with these lesions
identified by an experienced radiologist. The match percent for the two
proposed methods did not have significant differences. However, the
computation cost for the slope method was about twelve times faster
than the relative signal increase method.
Conclusions. The proposed methods can identify the NPC regions quickly
and effectively. This system can enhance the performance of clinical
diagnosis.
|
659. | Pitermann, M, and Munhall, KG, "An inverse dynamics approach to face animation," JOURNAL OF THE ACOUSTICAL SOCIETY OF AMERICA, vol. 110, pp. 1570-1580, 2001.
Abstract:
Muscle-based models of the human face produce high quality animation
but rely on recorded muscle activity signals or synthetic muscle
signals that are often derived by trial and error. This paper presents
a dynamic inversion of a muscle-based model (Lucero and Munhall, 1999)
that permits the animation to be created from kinematic recordings of
facial movements. Using a nonlinear optimizer (Powell's algorithm), the
inversion produces a muscle activity set for seven muscles in the lower
face that minimize the root mean square error between kinematic data
recorded with OPTOTRAK and the corresponding nodes of the modeled
facial mesh. This inverted muscle activity is then used to animate the
facial model. In three tests of the inversion, strong correlations were
observed for kinematics produced from synthetic muscle activity, for
OPTOTRAK kinematics recorded from a talker for whom the facial model is
morphologically adapted and finally for another talker with the model
morphology adapted to a different individual. The correspondence
between the animation kinematics and the three-dimensional OPTOTRAK
data are very good and the animation is of high quality. Because the
kinematic to electromyography (EMG) inversion is ill posed, there is no
relation between the actual EMG and the inverted EMG. The overall
redundancy of the motor system means that many different EMG patterns
can produce the same kinematic output. (C) 2001 Acoustical Society of
America.
|
660. | Ohtake, Y, and Belyaev, AG, "Mesh optimization for polygonized isosurfaces," COMPUTER GRAPHICS FORUM, vol. 20, pp. C368-C376, 2001.
Abstract:
In this paper we propose a method for improvement of isosurface
polygonizations. Given an initial polygonization of an isosurface, we
introduce a mesh evolution process initialized by the polygonization.
The evolving mesh converges quickly to its limit mesh which provides
with a high quality approximation of the isosurface even if the
isosurface has sharp features, boundary, complex topology. To analyze
how close the evolving mesh approaches its destined isosurface, we
introduce error estimators measuring the deviations of the mesh
vertices from the isosurface and mesh normals from the isosurface
normals. A new technique for mesh editing with isosurfaces is also
proposed. In particular it can be used for creating carving effects.
|
661. | Latson, LA, Powell, KA, Sturm, B, Schvartzman, PR, and White, RD, "Clinical validation of an automated boundary tracking algorithm on cardiac MR images," INTERNATIONAL JOURNAL OF CARDIOVASCULAR IMAGING, vol. 17, pp. 279-286, 2001.
Abstract:
The goal of this research was to develop an automated algorithm for
tracking the borders of the left ventricle (LV) in a cine-MRI
gradient-echo temporal data set. The algorithm was validated on four
patient populations: healthy volunteers and patients with dilated
cardiomyopathy (DCM), left ventricular hypertrophy (LVH), or left
ventricular aneurysm (LVA). A full tomographic set (similar to 11
slices/case) of short-axis images through systole was obtained for each
patient. Initial endocardial and epicardial contours for the
end-diastolic (ED) and end-systolic (ES) frames were manually traced on
the computer by an experienced radiologist. The ED tracings were used
as the starting point for the algorithm. The borders were tracked
through each phase of the temporal data set, until the ES frame was
reached (similar to7 phases/slice). Peak gradients along equally spaced
chords calculated perpendicular to a centerline determined midway
between the endocardial and epicardial borders were used for border
detection. This approach was tested by comparing the LV epicardial and
endocardial volumes calculated at ES to those based on the manual
tracings. The results of the algorithm compared favorably with both the
endocardial (r(2) = 0.72 - 0.98) and epicardial (r(2) = 0.96 - 0.99)
volumes of the tracer.
|
662. | Schmidt-Trucksass, A, Cheng, DC, Sandrock, M, Schulte-Monting, J, Rauramaa, R, Huonker, M, and Burkhardt, H, "Computerized analysing system using the active contour in ultrasound measurement of carotid artery intima-media thickness," CLINICAL PHYSIOLOGY, vol. 21, pp. 561-569, 2001.
Abstract:
Background and purpose B-mode measurement of the carotid intima-media
(IM) thickness (T) based on manual tracing (MT) procedures are
dependent on the subjectivity of the reader and the existing automatic
tracing procedures often fail to detect the IM boundaries accurately.
The purpose of this study was to compare the tracing results of the IM
boundaries of the carotid wall with a new automatic identification (AI)
procedure, based on an active contour model, and computer-assisted
manual tracing (MT).
Methods The detection of the IM boundaries was performed with both
procedures in 126 ultrasound images [63 each of the common carotid
artery (CCA) and carotid bulb] along the far wall of the distal CCA and
the carotid bulb. Intra- and inter-reader variability for mean and
maximum IMT with AI and MT and accuracy of identification of both IM
boundaries were evaluated.
Results Using MT the intra- and inter-reader variability amounted to
0.01-0.03 and 0.03-0.07 mm, respectively. The variability was slightly
higher in the carotid bulb than in the CCA. Using AI the variability
was almost eliminated. Mean and maximum IMT were measured
systematically lower by AI compared with MT in all regions by 0.01 mm.
The accuracy of identification was similar for both IM boundaries, but
lower in the carotid bulb region than in the CCA.
Conclusions The new AI procedure identifies both IM boundaries in the
region of the far wall of the CCA and carotid bulb with high precision,
and eliminates most of the intra- and inter-reader variability of the
IMT measurement using MT.
|
663. | Park, J, and Keller, JM, "Snakes on the watershed," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 23, pp. 1201-1205, 2001.
Abstract:
In this paper, we present a new approach for object boundary
extraction, called the watersnake. It is a two-step snake algorithm
whose energy functional is minimized by the dynamic programming method.
It is more robust to local minima because it finds the solution by
searching the entire energy space. To reduce the complexity of the
minimization process, the watershed transformation and a coarse-to-fine
strategy are used. The new technique is compared to standard methods
for accuracy in synthetic data and is applied to segmentation of white
blood cells in bone marrow Images.
|
664. | Moghaddam, B, Nastar, C, and Pentland, A, "A Bayesian similarity measure for deformable image matching," IMAGE AND VISION COMPUTING, vol. 19, pp. 235-244, 2001.
Abstract:
We propose a probabilistic similarity measure for direct image matching
based on a Bayesian analysis of image deformations. We model two
classes of variation in object appearance: intra-object and
extra-object. The probability density functions for each class are then
estimated from training data and used to compute a similarity measure
based on the a posteriori probabilities. Furthermore, we use a novel
representation for characterizing image differences using a deformable
technique for obtaining pixel-wise correspondences. This
representation, which is based on a deformable 3D mesh in XYI-space, is
then experimentally compared with two simpler representations:
intensity differences and optical Row. The performance advantage of our
deformable matching technique is demonstrated using a typically hard
test set drawn from the US Army's FERET face database. (C) 2001
Elsevier Science B.V. All rights reserved.
|
665. | Bhalerao, A, and Wilson, R, "Unsupervised image segmentation combining region and boundary," IMAGE AND VISION COMPUTING, vol. 19, pp. 353-368, 2001.
Abstract:
An integrated approach to image segmentation is presented that combines
region and boundary information using maximum a posteriori estimation
and decision theory. The algorithm employs iterative, decision-directed
estimation performed on a novel multi-resolution representation. The
use of a multi-resolution technique ensures both robustness in noise
and efficiency of computation, while the model-based estimation and
decision process is flexible and spatially local, thus avoiding
assumptions about global homogeneity or size and number of regions. A
comparative evaluation of the method against region-only and
boundary-only methods is presented and is shown to produce accurate
segmentations at quite low signal-to-noise ratios. (C) 2001 Elsevier
Science B.V. All rights reserved.
|
666. | Gulick, VC, Morris, RL, Ruzon, MA, and Roush, TL, "Autonomous image analyses during the 1999 Marsokhod rover field test," JOURNAL OF GEOPHYSICAL RESEARCH-PLANETS, vol. 106, pp. 7745-7763, 2001.
Abstract:
A Martian rover capable of analyzing images autonomously could traverse
greater path lengths and return data with greater scientific content. A
more intelligent rover could, for example, automatically select targets
of interest (e.g., rocks, layers), return spectral or high-resolution
image data of these targets at the same time, remove less interesting
or redundant parts of images before transmitting them, and provide
compact information or representations of its environment. Three
prototype algorithms, a horizon detector, a rock detector, and a layer
detector have been developed and tested during the 1999 Marsokhod rover
field test in Silver Lake, California. The results are encouraging and
demonstrate the potential savings in time as well as the potential
increase in the amount of relevant science data returned in each
command cycle.
|
667. | Boykov, Y, Veksler, O, and Zabih, R, "Fast approximate energy minimization via graph cuts," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 23, pp. 1222-1239, 2001.
Abstract:
Many tasks in computer vision involve assigning a label (such as
disparity) to every pixel. A common constraint is that the labels
should vary smoothly almost everywhere while preserving sharp
discontinuities that may exist, e.g., at object boundaries. These tasks
are naturally stated in terms of energy minimization. In this paper, we
consider a wide class of energies with various smoothness constraints.
Global minimization of these energy functions is NP-hard even in the
simplest discontinuity-preserving case. Therefore, our focus is on
efficient approximation algorithms. We present two algorithms based on
graph cuts that efficiently find a local minimum with respect to two
types of large moves, namely expansion moves and swap moves. These
moves can simultaneously change the labels of arbitrarily large sets of
pixels. In contrast, many standard algorithms (including simulated
annealing) use small moves where only one pixel changes its label at a
time. Our expansion algorithm finds a labeling within a known factor of
the global minimum, while our swap algorithm handles more general
energy functions. Both of these algorithms allow important cases of
discontinuity preserving energies. We experimentally demonstrate the
effectiveness of our approach for image restoration, stereo and motion.
On real data with ground truth, we achieve 98 percent accuracy.
|
668. | Vemuri, BC, Guo, YL, and Wang, ZZ, "Deformable pedal curves and surfaces: Hybrid geometric active models for shape recovery," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 44, pp. 137-155, 2001.
Abstract:
In this paper, we propose significant extensions to the "snake pedal"
model, a powerful geometric shape modeling scheme introduced in (Vemuri
and Guo, 1998). The extension allows the model to automatically cope
with topological changes and for the first time, introduces the concept
of a compact global shape into geometric active models. The ability to
characterize global shape of an object using very few parameters
facilitates shape learning and recognition. In this new modeling
scheme, object shapes are represented using a parameterized
function-called the generator-which accounts for the global shape of an
object and the pedal curve (surface) of this global shape with respect
to a geometric snake to represent any local detail. Traditionally,
pedal curves (surfaces) are defined as the loci of the feet of
perpendiculars to the tangents of the generator from a fixed point
called the pedal point. Local shape control is achieved by introducing
a set of pedal points-lying on a snake-for each point on the generator.
The model dubbed as a "snake pedal" allows for interactive manipulation
via forces applied to the snake. In this work, we replace the snake by
a geometric snake and derive all the necessary mathematics for evolving
the geometric snake when the snake pedal is assumed to evolve as a
function of its curvature. Automatic topological changes of the model
may be achieved by implementing the geometric snake in a level-set
framework. We demonstrate the applicability of this modeling scheme via
examples of shape recovery from a variety of 2D and 3D image data.
|
669. | Harari, D, Furst, M, Kiryati, N, Caspi, A, and Davidson, M, "A computer-based method for the assessment of body-image distortions in anorexia-nervosa patients," IEEE TRANSACTIONS ON INFORMATION TECHNOLOGY IN BIOMEDICINE, vol. 5, pp. 311-319, 2001.
Abstract:
A computer-based method for the assessment of body-image distortions in
anorexia nervosa and other eating-disorder patients is presented in
this paper. At the core of the method is a realistic pictorial
simulation of lifelike weight changes, applied to a real source image
of the patient. The patients, using a graphical user interface, adjust
their body shapes until they meet their self-perceived appearance.
Measuring the extent of virtual fattening or slimming of a body with
respect to its real shape and size allows direct quantitative
evaluation of the cognitive distortion in body image. In a preliminary
experiment involving 33 anorexia-nervosa patients, 70% of the subjects
chose an image with simulated visual weight gain between 8%-16% as
their "real" body image, while only one of them recognized the original
body image. In a second experiment involving 30 healthy participants,
the quality of the weight modified images was evaluated by pairwise
selection trials. Over a weight change range from -16% to +28%, in
about 30% of the trials, artificially modified images were mistakenly
taken as "original" images, thus demonstrating the quality of the
artificial images. The method presented is currently in a clinical
validation phase, toward application in the research, diagnosis,
evaluation, and treatment of eating disorders.
|
670. | Zoroofi, RA, Nishii, T, Sato, Y, Sugano, N, Yoshikawa, H, and Tamura, S, "Segmentation of avascular necrosis of the femoral head using 3-D MR images," COMPUTERIZED MEDICAL IMAGING AND GRAPHICS, vol. 25, pp. 511-521, 2001.
Abstract:
Avascular necrosis of the femoral head (ANFH) is a common clinical
disorder in the orthopedic field. Traditional approaches to study the
extent of ANFH rely primarily on manual segmentation of clinical
magnetic resonance images (MRI). However, manual segmentation is
insufficient for quantitative evaluation and staging of ANFH. This
paper presents a new computerized approach for segmentation of necrotic
lesions of the femoral head. The segmentation method consists of
several steps including histogram based thresholding, 3-D morphological
operations, oblique data reconstruction, and 2-D ellipse fitting. The
proposed technique is rapid and efficient. In addition, it is available
as a Microsoft Windows free software package on the Internet.
Feasibility of the method is demonstrated on the data sets of 30
patients (1500 MR images). (C) 2001 Elsevier Science Ltd. All rights
reserved.
|
671. | Dumitras, A, and Venetsanopoulos, AN, "Angular map-driven snakes with application to object shape description in color images," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 10, pp. 1851-1859, 2001.
Abstract:
We propose a method for shape description of objects in color images.
Our method employs angular maps in order to identify significant
changes of color within the image, which are then used to drive snake
models. To obtain an angular map, the angle values of the vectors
corresponding to color image pixels are first computed with respect to
a reference vector, and organized in a two-dimensional matrix. To
identify significant color changes within the original image, the edges
of the angular map are next extracted. The resulting edge map is then
presented to a snake model. Distance and gradient vector flow snake
models have been employed in this work. Experimental results show, not
only that the resulting object shape descriptions are accurate and
quite similar, but also that our method is computationally efficient
and flexible.
|
672. | Barbosa, J, Tavares, J, and Padilha, AJ, "Parallel image processing system on a cluster of personal computers - Best student paper award: First prize," VECTOR AND PARALLEL PROCESSING - VECPAR 2000, LECTURE NOTES IN COMPUTER SCIENCE, vol. 1981, pp. 439-452, 2001.
Abstract:
The most demanding image processing applications require real time
processing, often using special purpose hardware. The work herein
presented refers to the application of cluster computing for off line
image processing, where the end user benefits from the operation of
otherwise idle processors in the local LAN. The virtual parallel
computer is composed by off-the-shelf personal computers connected by a
low cost network, such as a 10 Mbits/s Ethernet. The aim is to minimise
the processing time of a high level image processing package. The
system developed to manage the parallel execution is described and some
results obtained for the parallelisation of high level image processing
algorithms are discussed, namely for active contour and modal analysis
methods which require the computation of the eigenvectors of a
symmetric matrix.
|
673. | Berthilsson, R, Astrom, K, and Heyden, A, "Reconstruction of general curves, using factorization and bundle adjustment," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 41, pp. 171-182, 2001.
Abstract:
In this paper, we extend the notion of affine shape, introduced by
Sparr, from finite point sets to curves. The extension makes it
possible to reconstruct 3D-curves up to projective transformations,
from a number of their 2D-projections. We also extend the bundle
adjustment technique from point features to curves.
The first step of the curve reconstruction algorithm is based on affine
shape. It is independent of choice of coordinates, is robust, does not
rely on any preselected parameters and works for an arbitrary number of
images. In particular this means that, except for a small set of curves
(e.g. a moving line), a solution is given to the aperture problem of
finding point correspondences between curves. The second step takes
advantage of any knowledge of measurement errors in the images. This is
possible by extending the bundle adjustment technique to curves.
Finally, experiments are performed on both synthetic and real data to
show the performance and applicability of the algorithm.
|
674. | Sahiner, B, Petrick, N, Chan, HP, Hadjiiski, LM, Paramagul, C, Helvie, MA, and Gurcan, MN, "Computer-aided characterization of mammographic masses: Accuracy of mass segmentation and its effects on characterization," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 20, pp. 1275-1284, 2001.
Abstract:
Mass segmentation is used as the first step in many computer-aided
diagnosis (CAD) systems for classification of breast masses as
malignant or benign. The goal of this paper was to study the accuracy
of an automated mass segmentation method developed in our laboratory,
and to investigate the effect of the segmentation stage on the overall
classification accuracy. The automated segmentation method was
quantitatively compared with manual segmentation by two expert
radiologists (111 and 112) using three similarity or distance measures
on a data set of 100 masses. The area overlap measures between R1 and
R2, the computer and R1, and the computer and R2 were 0.76 +/- 0.13,
0.74 +/- 0.11, and 0.74 +/- 0.13, respectively. The interobserver
difference in these measures between the two radiologists was compared
with the corresponding differences between the computer and the
radiologists. Using three similarity measures and data from two
radiologists, a total of six statistical tests were performed. The
difference between the computer and the radiologist segmentation was
significantly larger than the interobserver variability in only one
test. Two sets of texture, morphological, and spiculation features, one
based on the computer segmentation, and the other based on radiologist
segmentation, were extracted from a data set of 249 films from 102
patients. A classifier based on stepwise feature selection and linear
discriminant analysis was trained and tested using the two feature
sets. The leave-one-case-out method was used for data sampling. For
case-based classification, the area A(x) under the receiver operating
characteristic (ROC) curve was 0.89 and 0.88 for the feature sets based
on the radiologist segmentation and computer segmentation,
respectively. The difference between the two ROC curves was not
statistically significant.
|
675. | Ben-Arie, J, and Wang, ZQ, "Hierarchical shape description and similarity-invariant recognition using gradient propagation," INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, vol. 15, pp. 1251-1261, 2001.
Abstract:
This paper presents a novel hierarchical shape description scheme based
on propagating the image gradient radially. This radial propagation is
equivalent to a vectorial convolution with sector elements. The
propagated gradient field collides at centers of convex/concave shape
components, which can be detected as points of high directional
disparity. A novel vectorial disparity measure called Cancellation
Energy is used to measure this collision of the gradient field, and
local maxima of this measure yield feature tokens. These feature tokens
form a compact description of shapes and their components and indicate
their central locations and sizes. In addition, a Gradient Signature is
formed by the gradient field that collides at each center, which is
itself a robust and size-independent description of the corresponding
shape component. Experimental results demonstrate that the shape
description is robust to distortion, noise and clutter. An important
advantage of this scheme is that the feature tokens are obtained
pre-attentively, without prior understanding of the image. The
hierarchical description is also successfully used for
similarity-invariant recognition of 2D shapes with a multidimensional
indexing scheme based on the Gradient Signature.
|
676. | Han, C, Hatsukami, TS, Hwang, JN, and Yuan, C, "A fast minimal path active contour model," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 10, pp. 865-873, 2001.
Abstract:
A new minimal path active contour model for boundary extraction is
presented. Implementing the new approach requires four steps
1) users place some initial end points on or near the desired boundary
through an interactive interface;
2) potential searching window is defined between two end points;
3) graph search method based on conic curves is used to search the
boundary;
4) "wriggling" procedure is used to calibrate the contour and reduce
sensitivity of the search results on the selected initial end points.
The last three steps are performed automatically. In the proposed
approach, the potential window systematically provides a new node
connection for the later graph search, which is different from the
row-by-row and column-by-column methods used in the classical graph
search. Furthermore, this graph search also suggests ways to design a
"wriggling" procedure to evolve the contour in the direction nearly
perpendicular to itself by creating a list of displacement vectors in
the potential window. The proposed minimal path active contour model
speeds up the search and reduces the "metrication error" frequently
encountered in the classical graph search methods e,g,, the dynamic
programming minimal path (DPMP) method.
|
677. | Cohen, LD, and Deschamps, T, "Multiple contour finding and perceptual grouping as a set of energy minimizing paths," ENERGY MINIMIZATION METHODS IN COMPUTER VISION AND PATTERN RECOGNITION, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2134, pp. 560-575, 2001.
Abstract:
We address the problem of finding a set of contour curves in an image.
We consider the problem of perceptual grouping and contour completion,
where the data is a set of points in the image. A new method to find
complete curves from a set of contours or edge points is presented. Our
approach is an extension of previous work on finding a set of contours
as minimal paths between end points using the fast marching algorithm.
Given a set of key points, we find the pairs of points that have to be
linked and the paths that join them. We use the saddle points of the
minimal action map. The paths are obtained by backpropagation from the
saddle points to both points of each pair.
We also propose an extension of this method for contour completion
where the data is a set of connected components. We find the minimal
paths between each of these components, until the complete set of these
"regions" is connected. The paths are obtained using the same
backpropagation from the saddle points to both components.
|
678. | Yanai, K, and Deguchi, K, "A multi-resolution image understanding system based on multi-agent architecture for high-resolution images," IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, vol. E84D, pp. 1642-1650, 2001.
Abstract:
Recently a high-resolution image that has more than one million pixels
is available easily. However, such an image requires much processing
time and memory for an image understanding system. In this paper, we
propose an integrated image understanding system of multi-resolution
analysis and multiagent-based architecture for high-resolution images.
The system we propose in this paper has capability to treat with a
high-resolution image effectively without much extra cost. We
implemented an experimental system for images of indoor scenes.
|
679. | Yoo, SK, Wang, G, Rubinstein, JT, and Vannier, MW, "Semiautomatic segmentation of the cochlea using real-time volume rendering and regional adaptive snake modeling," JOURNAL OF DIGITAL IMAGING, vol. 14, pp. 173-181, 2001.
Abstract:
The human cochlea in the inner ear is the organ of hearing.
Segmentation is a prerequisite step for 3-dimensional modeling and
analysis of the cochlea. It may have uses in the clinical practice of
otolaryngology and neuroradiology, as well as for cochlear implant
research. In this report, an interactive, semiautomatic, coarse-to-fine
segmentation approach is developed on a personal computer with a
real-time volume rendering board. In the coarse segmentation,
parameters, including the intensity range and the volume of interest,
are defined to roughly segment the cochlea through user interaction. In
the fine segmentation, a regional adaptive snake model designed as a
refining operator separates the cochlea from other anatomic structures.
The combination of the image information and expert knowledge enables
the deformation of the regional adaptive snake effectively to the
cochlear boundary, whereas the real-time volume rendering provides
users with direct 3-dimensional visual feedback to modify intermediate
parameters and finalize the segmentation. The performance is tested
using spiral computed tomography (CT) images of the temporal bone and
compared with the seed point region growing with manual modification of
the commercial Analyze software. Our method represents an optimal
balance between the efficiency of automatic algorithm and the accuracy
of manual work. Copyright (C) 2001 by WB. Saunders Company.
|
680. | Montagnat, J, Delingette, H, and Ayache, N, "A review of deformable surfaces: topology, geometry and deformation," IMAGE AND VISION COMPUTING, vol. 19, pp. 1023-1040, 2001.
Abstract:
Deformable models have raised much interest and found various
applications in the fields of computer vision and medical imaging. They
provide an extensible framework to reconstruct shapes. Deformable
surfaces, in particular, are used to represent 3D objects. They have
been used for pattern recognition [Computer Vision and Image
Understanding 69(2) (1998) 201; IEEE Transactions on Pattern Analysis
and Machine Intelligence 19(10) (1997) 1115], computer animation [ACM
Computer Graphics (SIGGRAPH'87) 21(4) (1987) 205], geometric modelling
[Computer Aided Design (CAD) 24(4) (1992) 178], simulation [Visual
Computer 16(8) (2000) 437], boundary tracking [ACM Computer Graphics
(SIGGRAPH'94) (1994) 185], image segmentation [Computer Integrated
Surgery, Technology and Clinical Applications (1996) 59; IEEE
Transactions on Medical Imaging 14 (1995) 442; Joint Conference on
Computer Vision, Virtual Reality and Robotics in Medicine
(CVRMed-MRCAS'97) 1205 (1997) 13; Medical Image Computing and
Computer-Assisted Intervention (MICCAI'99) 1679 (1999) 176; Medical
Image Analysis 1(1) (1996) 19], etc. In this paper we propose a survey
on deformable surfaces. Many surface representations have been proposed
to meet different 3D reconstruction problem requirements. We classify
the main representations proposed in the literature and we study the
influence of the representation on the model evolution behavior,
revealing some similarities between different approaches. (C) 2001
Elsevier Science B.V. All rights reserved.
|
681. | Chen, CM, Lu, HHS, and Hsiao, AT, "A dual-snake model of high penetrability for ultrasound image boundary extraction," ULTRASOUND IN MEDICINE AND BIOLOGY, vol. 27, pp. 1651-1665, 2001.
Abstract:
Most deformable models require the initial contour to be placed close
to the boundary of the object of interest for boundary extraction of
ultrasound (US) images, which is impractical in many clinical
applications. To allow a distant initial contour, a new dual-snake
model promising high penetrability through the interference of the
noises is proposed in this paper. The proposed dual-snake model
features a new far-reaching external force, called the discrete
gradient flow, a connected component-weighted image force, and an
effective stability evaluation of two underlying snakes. The
experimental results show that, with a distant initial contour, the
mean distance from the derived boundary to the desired boundary is less
than 1.4 pixels, and most snake elements are within 2.7 pixels of the
desired boundaries for the synthetic images with CNR greater than or
equal to 1. For the clinical US images, the mean distance is less than
1.9 pixels, and most snake elements are within 3 pixels of the desired
boundaries. (E-mail: chung@lotus.mc.ntu.edu.tw) (C) 2002 World
Federation for Ultrasound in Medicine Biology.
|
682. | Kamijo, S, Ikeuchi, K, and Sakauchi, M, "Segmentations of spatio-temporal images by spatio-temporal Markov random field model," ENERGY MINIMIZATION METHODS IN COMPUTER VISION AND PATTERN RECOGNITION, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2134, pp. 298-313, 2001.
Abstract:
There have been many successful researches on image segmentations that
employ Markov Random Field model. However, most of them were interested
in two-dimensional MRF, or spatial MRF, and very few researches are
interested in three-dimensional MRF model. Generally,
'three-dimensional' have two meaning, that are spatially
three-dimensional and spatio-temporal. In this paper, we especially are
interested in segmentations of spatio-temporal images which appears to
be equivalent to tracking problem of moving objects such as vehicles
etc. For that purpose, by extending usual two-dimensional MRF, we
defined a dedicated three-dimensional MRF which we defined as
Spatio-Temporal MRF model(S-T MRF). This S-T MRF models a tracking
problem by determining labels of groups of pixels by referring to their
texture and labeling correlations along the temporal axis as well as
the x-y image axes. Although vehicles severely occlude each other in
general traffic images, segmentation boundaries of vehicle regions will
be determined precisely by this S-T MRF optimizing such boundaries
through spatio-temporal images. Consequently, it was proved that the
algorithm has performed 95% success of tracking in middle-angle image
at an intersection and 91% success in low-angle and front-view images
at a highway junction.
|
683. | Golosio, B, Brunetti, A, and Amendolia, SR, "A novel morphological approach to volume extraction in 3D tomography," COMPUTER PHYSICS COMMUNICATIONS, vol. 141, pp. 217-224, 2001.
Abstract:
Extracting a region of interest from volumetric data represents an
important task in the field of digital image analysis. Several
approaches to this problem are proposed in literature. The present
paper affords volume extraction for regions of interest whose
characteristics are not known a-priori. This is the case, for instance,
of cancerous tissues in medical tomography or defects in industrial
tomography. The technique here described allows extraction of
completely arbitrary shapes with a minimum interaction with the user.
The volume of interest is defined through the semi-automatic selection
of a small set of rail contours at different planes. Such contours are
then blended through a morphing technique in order to interpolate the
cutting surface. The overall technique demonstrates to be intuitive,
efficient and robust. Some results are reported where the method has
been applied to micro-tomographic measurements. (C) 2001 Elsevier
Science B.V. All rights reserved.
|
684. | Fortier, MFA, Ziou, D, Armenakis, C, and Wang, S, "Automated correction and updating of road databases from high-resolution imagery," CANADIAN JOURNAL OF REMOTE SENSING, vol. 27, pp. 78-91, 2001.
Abstract:
Our work addresses the correction and update of road map data from
georeferenced aerial images. This task requires the solution of two
underlying problems: the weak positional accuracy of the existing road
location, and the detection Of new roads. To correct the position of
the existing road network location from the imagery, we use an active
contour ('snakes") optimization approach, with a line enhancement
function. The initialization of the snakes is based on a priori
knowledge derived from the existing vector road data coming from the
National Topographic Database of Geomatics Canada, and from line
junctions computed from the image by a new detector developed for this
application. To generate hypotheses for new roads, a road following
algorithm is applied in the image, starting from the line
intersections, which are already in the existing road network.
Experimental results on a georeferenced image of the Edmonton area,
provided by Geomatics Canada, are presented to validate the approach
and to demonstrate the interest of using line junctions in this kind of
application.
|
685. | Baxter, WW, and McCulloch, AD, "In vivo finite element model-based image analysis of pacemaker lead mechanics," MEDICAL IMAGE ANALYSIS, vol. 5, pp. 255-270, 2001.
Abstract:
Background: Fractures of implanted pacemaker leads are currently
identified by inspecting radiographic images without making full use of
a priori known material and structural information. Moreover, lead
designers are unable to incorporate clinical image data into analyses
of lead mechanics. Methods: A novel finite element/active contour
method was developed to quantify the in vivo mechanics of implanted
leads by estimating the distributions of stress, strain, and traction
using biplane videoradiographic images. The nonlinear equilibrium
equations governing a thin elastic beam undergoing 3-D large rotation
were solved using one-dimensional isoparametric finite elements.
External forces based on local image greyscale values were computed
from each pair of images using a perspective transformation governing
the relationship between the image planes. Results: Cantilever beam
forward solution results were within 0.2% of the analytic solution for
a wide range of applied loads. The finite element/active contour model
was able to reproduce the principal curvatures of a synthetic helix
within 3% of the analytic solution and estimates of the helix's
geometric torsion were within 20% of the analytic solution. Applying
the method to biplane videoradiographic images of a lead acutely
implanted in an anesthetized dog resulted in expected variations in
curvature and bending stress between compliant and rigid segments of
the lead. Conclusions: By incorporating knowledge about lead geometric
and material properties, the 3-D finite element/active contour method
regularizes the image reconstruction problem and allows for more
quantitative and automatic assessment of implanted lead mechanics. (C)
2001 Elsevier Science B.V. All rights reserved.
|
686. | Deschamps, T, and Cohen, LD, "Fast extraction of minimal paths in 3D images and applications to virtual endoscopy," MEDICAL IMAGE ANALYSIS, vol. 5, pp. 281-299, 2001.
Abstract:
The aim of this article is to build trajectories for virtual endoscopy
inside 3D medical images, using the most automatic way. Usually the
construction of this trajectory is left to the clinician who must
define some points on the path manually using three orthogonal views.
But for a complex structure such as the colon, those views give little
information on the shape of the object of interest. The path
construction in 3D images becomes a very tedious task and precise a
priori knowledge of the structure is needed to determine a suitable
trajectory. We propose a more automatic path tracking method to
overcome those drawbacks: we are able to build a path, given only one
or two end points and the 3D image as inputs. This work is based on
previous work by Cohen and Kimmel [Int. J. Comp. Vis. 24 (1) (1997) 57]
for extracting paths in 2D images using Fast Marching algorithm.
Our original contribution is twofold. On the first hand, we present a
general technical contribution which extends minimal paths to 3D images
and gives new improvements of the approach that are relevant in 2D as
well as in 3D to extract linear structures in images. It includes
techniques to make the path extraction scheme faster and easier, by
reducing the user interaction.
We also develop a new method to extract a centered path in tubular
structures. Synthetic and real medical images are used to illustrate
each contribution.
On the other hand, we show that our method can be efficiently applied
to the problem of finding a centered path in tubular anatomical
structures with minimum interactivity, and that this path can be used
for virtual endoscopy. Results are shown in various anatomical regions
(colon, brain vessels, arteries) with different 3D imaging protocols
(CT, MR). (C) 2001 Elsevier Science B.V. All rights reserved.
|
687. | Yu, SX, Lee, TS, and Kanade, T, "A hierarchical Markov random field model for figure-ground segregation," ENERGY MINIMIZATION METHODS IN COMPUTER VISION AND PATTERN RECOGNITION, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2134, pp. 118-133, 2001.
Abstract:
To segregate overlapping objects into depth layers requires the
integration of local occlusion cues distributed over the entire image
into a global percept. We propose to model this process using
hierarchical Markov random field (HMRF), and suggest a broader view
that clique potentials in MRF models can be used to encode any local
decision rules. A topology-dependent multiscale hierarchy is used to
introduce long range interaction. The operations within each level are
identical across the hierarchy. The clique parameters that encode the
relative importance of these decision rules are estimated using an
optimization technique called learning from rehearsals based on
2-object training samples. We find that this model generalizes
successfully to 5-object test images, and that depth segregation can be
completed within two traversals across the hierarchy. This
computational framework therefore provides an interesting platform for
us to investigate the interaction of local decision rules and global
representations, as well as to reason about the rationales underlying
some of recent psychological and neurophysiological findings related to
figure-ground segregation.
|
688. | Ray, N, Chanda, B, and Das, J, "A fast and flexible multiresolution snake with a definite termination criterion," PATTERN RECOGNITION, vol. 34, pp. 1483-1490, 2001.
Abstract:
This paper. describes a fast process of parametric snake evolution with
a multiresolution strategy. Conventional parametric evolution method
relies on matrix inversion throughout the iteration intermittently, in
contrast the proposed method relaxes the matrix inversion which is:
costly and time consuming in cases where the resulting snake is
flexible. The proposed method also eliminates the input of snake
rigidity parameters when the snake is flexible. Also, a robust and
definite termination criterion for both conventional and proposed
methods is demonstrated ill this paper. (C) 2001 pattern Recognition
Society. Published by Elsevier Science Ltd. All rights reserved.
|
689. | Gomes, J, and Faugeras, O, "Using the vector distance functions to evolve manifolds of arbitrary codimension," SCALE-SPACE AND MORPHOLOGY IN COMPUTER VISION, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2106, pp. 1-13, 2001.
Abstract:
We present a novel method for representing and evolving objects of
arbitrary dimension. The method, called the Vector Distance Function
(VDF) method, uses the vector that connects any point in space to its
closest point on the object. It can deal with smooth manifolds with and
without boundaries and with shapes of different dimensions. It can be
used to evolve such objects according to a variety of motions,
including mean curvature. If discontinuous velocity fields are allowed
the dimension of the objects can change. The evolution method that we
propose guarantees that we stay in the class of VDF's and therefore
that the intrinsic properties of the underlying shapes such as their
dimension, curvatures can be read off easily from the VDF and its
spatial derivatives at each time instant. The main disadvantage of the
method is its redundancy: the size of the representation is always that
of the ambient space even though the object we are representing may be
of a much lower dimension. This disadvantage is also one of its
strengths since it buys us flexibility.
|
690. | Liu, ZC, Zhang, ZY, Jacobs, C, and Cohen, M, "Rapid modeling of animated faces from video," JOURNAL OF VISUALIZATION AND COMPUTER ANIMATION, vol. 12, pp. 227-240, 2001.
Abstract:
Generating realistic 3D human face models and facial animations has
been a persistent challenge in computer graphics. We have developed a
system that constructs textured 3D face models from videos with minimal
user interaction. Our system takes images and video sequences of a face
with an ordinary video camera. After five manual clicks on two images
to tell the system where the eye corners, nose top and mouth corners
are, the system automatically generates a realistic looking 3D human
head model and the constructed model can be animated immediately. A
user with a PC and an ordinary camera can use our system to generate
his/her face model in a few minutes. Copyright (C) 2001 John Wiley
Sons, Ltd.
|
691. | Elmoataz, A, Schupp, S, and Bloyet, D, "Fast and simple discrete approach for active contours for biomedical applications," INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, vol. 15, pp. 1201-1212, 2001.
Abstract:
In this paper, we present a fast and simple discrete approach for
active contours. It is based on discrete contour evolution, which
operates on the boundary of digital shape, by iterative growth
processes on the boundary of the shape. We consider a curve to be the
boundary of a discrete shape, We attach at each point of the boundary a
cost function and deform this shape according to that cost function.
The method presents some advantages. It is a discrete method, which
takes an implicit representation and uses discrete algorithm with a
simple data structure.
|
692. | Tang, M, and Ma, SD, "General scheme of region competition based on scale space," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 23, pp. 1366-1378, 2001.
Abstract:
In this paper, we propose a general scheme of region competition (GSRC)
for image segmentation based on scale space. First, we present a novel
classification algorithm to cluster the image feature data according to
the generally defined peaks under a certain scale and a scale
space-based classification scheme to classify the pixels by grouping
the resultant feature data clusters into several classes with a
standard classification algorithm. Second, to reduce the resultant
segmentation error, we develop a nonparametric probability model from
which the functional for GSRC is derived. Third, we design a general
and formal approach to automatically determine the initial regions.
Finally, we propose the kernel procedure of GSRC which segments an
image by minimizing the functional. The strategy adopted by GSRC is
first to label pixels whose corresponding regions can be determined in
large likelihood, and then to fine-tune the final regions with the help
of the nonparametric probability model, boundary smoothing, and region
competition. GSRC quantitatively controls the segmentation extent with
the scale space-based classification scheme. Although the description
of the scheme is nonparametric in this paper, GSRC can also work
parametrically if all nonparametric procedures in this paper are
substituted with the parametric counterparts.
|
693. | Hueber, E, Bigue, L, Refregier, P, and Ambs, P, "Optical snake-based segmentation processor with a shadow-casting incoherent correlator," OPTICS LETTERS, vol. 26, pp. 1852-1854, 2001.
Abstract:
What is believed to be the first incoherent snake-based optoelectronic
processor that is able to segment an object in a real image is
described. The process, based on active contours (snakes), consists of
correlating adaptive binary references with the scene image. The
proposed optical implementation of algorithms that are already
operational numerically opens attractive possibilities for faster
processing. Furthermore, this experiment has yielded a new, versatile
application for optical processors. (C) 2001 Optical Society of America.
|
694. | Wang, ZQ, and Ben-Arie, J, "Detection and segmentation of generic shapes based on affine modeling of energy in eigenspace," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 10, pp. 1621-1629, 2001.
Abstract:
This paper presents a novel approach for detection and segmentation of
man made generic shapes in cluttered images. The set of shapes to be
detected are members of affine transformed versions of basic geometric
shapes such as rectangles, circles etc. The shape set is represented by
its vectorial edge map transformed over a wide range of affine
parameters. We use vectorial boundary instead of regular boundary to
improve robustness to noise, background clutter and partial occlusion.
Our approach consists of a detection stage and a verification stage. In
the detection stage, we first derive the energy from the principal
eigenvectors of the set. Next, an a posteriori probability map of
energy distribution is computed from the projection of the edge map
representation in a vectorial eigen-space. Local peaks of the posterior
probability map are located and indicate candidate detections. We use
energy/probability based detection since we find that the underlying
distribution is not Gaussian and resembles a hypertoroid. In the
verification stage, each candidate is verified using a fast search
algorithm based on a novel representation in angle space and the
corresponding pose information of the detected shape is obtained. The
angular representation used in the verification stage yields better
results than a Euclidean distance representation. Experiments are
performed in various interfering distortions, and robust detection and
segmentation are achieved.
|
695. | Tsap, LV, Goldgof, DB, and Sarkar, S, "Fusion of physically-based registration and deformation modeling for nonrigid motion analysis," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 10, pp. 1659-1669, 2001.
Abstract:
In our previous work, we used finite element models to determine
nonrigid motion parameters and recover unknown local properties of
objects given correspondence data recovered with snakes or other
tracking models. In this paper, we present a novel multiscale approach
to recovery of nonrigid motion from sequences of registered intensity
and range images. The main idea of our approach is that a finite
element (FEM) model incorporating material properties of the object can
naturally handle both registration and deformation modeling using a
single model-driving strategy. The method includes a multiscale
iterative algorithm based on analysis of the undirected Hausdorff
distance to recover correspondences. The method is evaluated with
respect to speed and accuracy. Noise sensitivity issues are addressed.
Advantages of the proposed approach are demonstrated using man-made
elastic materials and human skin motion. Experiments with regular grid
features are used for performance comparison with a conventional
approach (separate snakes and FEM models). It is shown, however, that
the new method does not require a sampling/correspondence template and
can adapt the model to available object features. Usefulness of the
method is presented not only in the context of tracking and motion
analysis, but also for a burn scar detection application.
|
696. | Lamard, M, and Cochener, B, "Modeling the eye with a view to refractive surgery simulation," JOURNAL FRANCAIS D OPHTALMOLOGIE, vol. 24, pp. 813-822, 2001.
Abstract:
Purpose: To achieve three-dimensional modelizing of the eyeball
(morphological and mechanical behavior) in order to simulate the impact
of various refractive surgery techniques and to study the normal and
pathological states of the eye.
Method: Rebuilding the ocular shell is based on different kinds of
imaging (MR[, ultrasound) including information provided by video
topography. Image data are treated using suitable numerized filters
that allow automatic segmentations of ocular globus edges.
Reconstruction is based on specific mathematical functions (B-splines).
The mechanical behavior of a reconstructed model is simulated by
solving equations of linearized elasticity with the finited elements
method.
Results: Numerous simulations mimed different refractive surgical
techniques and, then validated the model. In addition, simulations of
various pathologies allowed us to verify certain clinical hypotheses.
Conclusion: This work, although still experimental, demonstrates the
advantages of such simulations and will allow novice physicians an
easier approach to different surgical techniques and will help them
understand their effect. Furthermore, it might be useful for simulation
of new surgical concepts even before their in vivo evaluation.
|
697. | Liu, RJ, and Yuan, BZ, "Automatic eye feature extraction in human face images," COMPUTING AND INFORMATICS, vol. 20, pp. 289-301, 2001.
Abstract:
This paper presents a fuzzy-based method to extract the eye features in
a head-shoulder image with plain background. This method is comprised
of two stages, namely the face region estimation and the eye features
extraction. In the first stage, a region growing method is adopted to
estimate the face region. In the second stage, the coarse eye area is
firstly determined based on the location of the nasion, then the
deformable template algorithm is completed in two steps to extract the
features of the eyes. Experimental results show the efficiency and
robustness of this method.
|
698. | Mishra, A, Dutta, PK, and Ghosh, MK, "Non-rigid cardiac motion quantification from 2D image sequences based on wavelet synthesis," IMAGE AND VISION COMPUTING, vol. 19, pp. 929-939, 2001.
Abstract:
Motion quantification from 2D sequential cardiac images has been
performed on axial images of the left ventricle (LV) obtained from two
different imaging modalities (MRI and Echocardiography images). The
detail point wise motion vectors were evaluated by establishing shape
correspondence between the consecutive contours after reconstructing
curvature information by wavelet synthesis filters at multiple levels.
We present a simple approach that optimizes the shape correspondence
taking the non-uniform contour variation in to account. The shape
matching is done by maximizing the correlation between the
approximation coefficient vectors at certain levels. The algorithm has
been tested over sets of 2D images and the results are compared with
that obtained from a bending energy model. Some experimental results
have also been presented for validation of the algorithm. (C) 2001
Elsevier Science B.V. All rights reserved.
|
699. | Schoepflin, T, Chalana, V, Haynor, DR, and Kim, Y, "Video object tracking with a sequential hierarchy of template deformations," IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, vol. 11, pp. 1171-1182, 2001.
Abstract:
We have developed a new contour-based tracking algorithm that uses a
sequence of template deformations to model and track generic video
objects. We organize the deformations into a hierarchy: globally affine
deformations, piecewise (locally) affine deformations, and arbitrary
smooth deformations (snakes). This design enables the algorithm to
track objects whose pose and shape change in time compared to the
template. If the object is not a rigid body, we model the temporal
evolution of its shape by updating the entire template after each video
frame; otherwise, we only update the pose of the object. Experimental
results demonstrate that our method is able to track a variety of video
objects, including those undergoing rapid changes. We quantitatively
compare our algorithm with its constituent pieces (e.g., the snake
algorithm) and show that the complete algorithm can track objects with
moving parts for a longer duration than partial versions of the
hierarchy. It could be benefited from a higher level algorithm to
dynamically adjust the parameters and template deformations to improve
the segmentation accuracy further. The hierarchical nature of this
algorithm provides a framework that offers a modular approach for the
design and enhancement of future object-tracking algorithms.
|
700. | Velasco, FA, and Marroquin, JL, "Robust parametric active contours: the Sandwich Snakes," MACHINE VISION AND APPLICATIONS, vol. 12, pp. 238-242, 2001.
Abstract:
Snakes are active contours that minimize an energy function. We present
a new kind of active contours called "Sandwich Snakes". They are formed
by two snakes, one inside and the other outside of the curve that one
is looking for. They have the same number of particles, which are
connected in one-to-one correspondence. At the minimum the two snakes
have the same position. We also present here a multi-scale system,
where Sandwich Snakes are adjusted at increasing resolutions, and an
interactive tool that permits one to easily specify the initial
position for the Sandwich Snakes. Sandwich Snakes exhibit very good
perfomance detecting contours with complex shapes, where the
traditional methods fail. They are also very robust with respect to
noise.
|
701. | Angelini, ED, Laine, AF, Takuma, S, Holmes, JW, and Homma, S, "LV volume quantification via spatiotemporal analysis of real-time 3-D echocardiography," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 20, pp. 457-469, 2001.
Abstract:
This paper presents a method of four-dimensional (4-D) (3-D + Time)
space-frequency analysis for directional denoising and enhancement of
real-time three-dimensional (RT3D) ultrasound and quantitative measures
in diagnostic cardiac ultrasound. Expansion of echocardiographic
volumes is performed with complex exponential wavelet-like basis
functions called brushlets, These functions offer good localization in
time and frequency and decompose a signal into distinct patterns of
oriented harmonics, which are invariant to intensity and contrast
range. Deformable-model segmentation is carried out on denoised data
after thresholding of transform coefficients, This process attenuates
speckle noise while preserving cardiac structure location, The
superiority of 4-D over 3-D analysis for decorrelating additive white
noise and multiplicative speckle noise on a 4-D phantom volume
expanding in time is demonstrated, Quantitative validation, computed
for contours and volumes, is performed on in vitro balloon phantoms.
Clinical applications of this spaciotemporal analysis tool are reported
for six patient cases providing measures of left ventricular volumes
and ejection fraction.
|
702. | Chen, J, Qi, FH, and Cen, F, "3D image segment method with forecasting capability," JOURNAL OF INFRARED AND MILLIMETER WAVES, vol. 20, pp. 194-198, 2001.
Abstract:
A new 3D image segmentation algorithm was proposed. This algorithm
integrates the improved Active Contour model and a new forecast
algorithm. The forecast algorithm is based on the peculiarity of 3D
images i.e. the deformation of the contour along the space or time axis
is continuous in 3D images. The forecast algorithm analyzes the trend
of the deformation of the contour in the segmented images, then
prognosticates the location and the shape of the contour in the next
image. Experiments on medical anatomic images show that the new
algorithm can observably improve the accuracy of the segmentation and
reduce the rime needed.
|
703. | Debreuve, E, Barlaud, M, Aubert, G, Laurette, I, and Darcourt, J, "Space-time segmentation using level set active contours applied to myocardial gated SPECT," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 20, pp. 643-659, 2001.
Abstract:
This paper presents a new variational method for the segmentation of a
moving object against a still background, over a sequence of
[two-dimensional or three-dimensional (3-D)] image frames. The method
is illustrated in application to myocardial gated single photon
emission computed tomography (SPECT) data, and incorporates a level set
framework to handle topological changes while providing closed
boundaries.
The key innovation is the introduction of a geometrical constraint into
the derivation of the Euler-Lagrange equations, such that the
segmentation of each individual frame can be interpreted as a closed
boundary of an object (an isolevel of a set of hyper-surfaces) while
integrating information over the entire sequence. This results in the
definition of an evolution velocity normal to the object boundary.
Applying this method to 3-D myocardial gated SPECT sequences, the left
ventricle endocardial and epicardial limits can be computed in each
frame.
This space-time segmentation method was tested on simulated and
clinical 3-D myocardial gated SPECT sequences and the corresponding
ejection fractions were computed.
|
704. | Abrantes, AJ, and Marques, JS, "Shape tracking using centroid-based methods," ENERGY MINIMIZATION METHODS IN COMPUTER VISION AND PATTERN RECOGNITION, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2134, pp. 576-591, 2001.
Abstract:
Algorithms for tracking generic 2D object boundaries in a video
sequence should not make strong assumptions about the shapes to be
tracked. When only a weak prior is at hand, the tracker performance
becomes heavily dependent on its ability to detect image features; to
classify them as informative (i.e., belonging to the object boundary)
or as outliers; and to match the informative features with
corresponding model points. Unlike simpler approaches often adopted in
tracking problems, this work looks at feature classification and
matching as two unsupervised learning problems. Consequently, object
tracking is converted into a problem of dynamic clustering of data,
which is solved using competitive learning algorithms. It is shown that
competitive learning is a key technique for obtaining accurate local
motion estimates (avoiding aperture problems) and for discarding the
outliers. In fact, the competitive learning approach shows several
benefits: (i) a gradual propagation of shape information across the
model; (ii) the use of shape and noise models competing for explaining
the data; and (iii) the possibility of adopting high dimensional
feature spaces containing relevant information extracted from the
image. This work extends the unified framework proposed by the authors
in [1].
|
705. | Samson, C, Blanc-Feraud, L, Aubert, G, and Zerubia, J, "Two variational models for multispectral image classification," ENERGY MINIMIZATION METHODS IN COMPUTER VISION AND PATTERN RECOGNITION, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2134, pp. 344-356, 2001.
Abstract:
We propose two variational models for supervised classification of
multispectral data. Both models take into account contour and region
information by minimizing a functional compound of a data term (2D
surface integral) taking into account the observation data and
knowledge on the classes, and a regularization term (1D length
integral) minimizing the length of the interfaces between regions. This
is a free discontinuity problem and we have proposed two different ways
to reach such a minimum, one using a Gamma-convergence approach and the
other using a level set approach to model contours and regions.
Both methods have been previously developed in the case of monospectral
observations. Multispectral techniques allow to take into account
information of several spectral bands of satellite or aerial sensors.
The goal of this paper is to present the extension of both variational
classification methods to multispectral data. We show an application on
real data from SPOT (XS mode) satellite for which we have a ground
truth. Our results are also compared to results obtained by using a
hierarchical stochastic model.
|
706. | Olabarriaga, SD, and Smeulders, AWM, "Interaction in the segmentation of medical images: A survey," MEDICAL IMAGE ANALYSIS, vol. 5, pp. 127-142, 2001.
Abstract:
Segmentation of the object of interest is a difficult step in the
analysis of digital images. Fully automatic methods sometimes fail,
producing incorrect results and requiring the intervention of a human
operator. This is often true in medical applications, where image
segmentation is particularly difficult due to restrictions imposed by
image acquisition, pathology and biological variation. In this paper we
present an early review of the largely unknown territory of
human-computer interaction in image segmentation. The purpose is to
identify patterns in the use of interaction and to develop qualitative
criteria to evaluate interactive segmentation methods. We discuss
existing interactive methods with respect to the following aspects: the
type of information provided by the user, how this information affects
the computational part, and the purpose of interaction in the
segmentation process. The discussion is based on the potential impact
of each strategy on the accuracy, repeatability and interaction
efficiency. Among others, these are important aspects to characterise
and understand the implications of interaction to the results generated
by an interactive segmentation method. This survey is focused on
medical imaging, however similar patterns are expected to hold for
other applications as well. (C) 2001 Elsevier Science B.V. All rights
reserved.
|
707. | Brown, MS, Feng, WC, Hall, TR, McNitt-Gray, MF, and Churchill, BM, "Knowledge-based segmentation of pediatric kidneys in CT for measurement of parenchymal volume," JOURNAL OF COMPUTER ASSISTED TOMOGRAPHY, vol. 25, pp. 639-648, 2001.
Abstract:
Purpose: The purpose of this work was to develop an automated method
for segmenting pediatric kidneys in helical CT images and measuring
their volume.
Method: An automated system was developed to segment the kidneys.
Parametric Features of anatomic structures were used to guide
segmentation and labeling of image regions. Kidney volumes were
calculated by summing included voxels. For validation, the kidney
volumes of four swine were calculated using our approach and compared
with the "true" volumes measured after harvesting the kidneys.
Automated volume calculations were also performed in a cohort of nine
children.
Results: The mean difference between the calculated and measured values
in the swine kidneys was 1.38 mi. For the pediatric cases, calculated
volumes ranged from 41.7 to 252.1 ml/kidney, and the mean ratio of
right to left kidney volume was 0.96.
Conclusion: These results demonstrate the accuracy of a volumetric
technique that may in the future provide an objective assessment of
renal damage.
|
708. | Sahiner, B, Chan, HP, Petrick, N, Helvie, MA, and Hadjiiski, LM, "Improvement of mammographic mass characterization using spiculation measures and morphological features," MEDICAL PHYSICS, vol. 28, pp. 1455-1465, 2001.
Abstract:
We are developing new computer vision techniques for characterization
of breast masses on mammograms. We had previously developed a
characterization method based on texture features. The goal of the
present work was to improve our characterization method by making use
of morphological features. Toward this goal, we have developed a fully
automated, three-stage segmentation method that includes clustering,
active contour, and spiculation detection stages. After segmentation,
morphological features describing the shape of the mass were extracted.
Texture features were also extracted from a band of pixels surrounding
the mass. Stepwise feature selection and linear discriminant analysis
were employed in the morphological, texture, and combined feature
spaces for classifier design. The classification accuracy was evaluated
using the area A(z) under the receiver operating characteristic curve.
A data set containing 249 films from 102 patients was used. When the
leave-one-case-out method was applied to partition the data set into
trainers and testers, the average test A(z) for the task of classifying
the mass on a single mammographic view was 0.83 +/- 0.02, 0.84 +/-
0.02, and 0.87 +/- 0.02 in the morphological, texture, and combined
feature spaces, respectively. The improvement obtained by supplementing
texture features with morphological features in classification was
statistically significant (p = 0.04). For classifying a mass as
malignant or benign, we combined the leave-one-case-out discriminant
scores from different views of a mass to obtain a summary score. In
this task, the test A(z) value using the combined feature space was
0.91 +/- 0.02. Our results indicate that combining texture features
with morphological features extracted from automatically segmented mass
boundaries will be an effective approach for computer-aided
characterization of mammographic masses. (C) 2001 American Association
of Physicists in Medicine.
|
709. | Merrifield, R, Keegan, J, Firmin, D, and Yang, GZ, "Dual contrast TrueFISP imaging for left ventricular segmentation," MAGNETIC RESONANCE IN MEDICINE, vol. 46, pp. 939-945, 2001.
Abstract:
Based on varying tissue contrasts at different RIF flip angles, a new
TrueFISP imaging strategy for cardiac function measurement is
presented. A single breath-hold dual RIF flip angle cine multi-slice
TrueFISP imaging sequence was implemented which provides a significant
increase in signal contrast between blood and myocardium. The increase
in image contrast combined with different characteristics in RIF
response facilitates the delineation of cardiovascular borders. Based
on this imaging strategy it is demonstrated how a simple 2D histogram
clustering algorithm can be used for the fully automatic segmentation
of the left ventricular (LV) blood pool. The method is validated with
data acquired from 10 asymptomatic subjects, and the results are shown
to be comparable to that of manual delineation by experienced
observers. Magn Reson Med 46: 939-945, 2001. (C) 2001 Wiley-Liss, Inc.
|
710. | Ben Sbeh, Z, Cohen, LD, Mimoun, G, and Coscas, G, "A new approach of geodesic reconstruction for drusen segmentation in eye fundus images," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 20, pp. 1321-1333, 2001.
Abstract:
Segmentation of bright blobs in an image is an important problem in
computer vision and particularly in biomedical imaging. In retinal
angiography, segmentation of drusen, a yellowish deposit located on the
retina, is a serious challenge in proper diagnosis and prevention of
further complications.
Drusen extraction using classic segmentation methods does not lead to
good results. We present a new segmentation method based on new
transformations we introduced in mathematical morphology. It is based
on the search for a new class of regional maxima components of the
image. These maxima correspond to the regions inside the drusen.
We present experimental results for drusen extraction using images
containing examples having different types and shapes of drusen. We
also apply our segmentation technique to two important cases of dynamic
sequences of drusen images. The first case is for tracking the average
gray level of a particular drusen in a sequence of angiographic images
during a fluorescein exam. The second case is for registration and
matching of two angiographic images from widely spaced exams in order
to characterize the evolution of drusen.
|
711. | Yagi, Y, Nagai, H, Yamazawa, K, and Yachida, M, "Reactive visual navigation based on omnidirectional sensing - Path following and collision avoidance," JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS, vol. 31, pp. 379-395, 2001.
Abstract:
Described here is a visual navigation method for navigating a mobile
robot along a man-made route such as a corridor or a street. We have
proposed an image sensor, named HyperOmni Vision, with a hyperboloidal
mirror for vision-based navigation of the mobile robot. This sensing
system can acquire an omnidirectional view around the robot in real
time. In the case of the man-made route, road boundaries between the
ground plane and wall appear as a close-looped curve in the image. By
making use of this optical characteristic, the robot can avoid
obstacles and move along the corridor by tracking the close-looped
curve with an active contour model. Experiments that have been done in
a real environment are described.
|
|
|
2002 |
712. | Kulkarni, S, and Chatterji, BN, "Accurate shape modeling with front propagation using adaptive level sets," PATTERN RECOGNITION LETTERS, vol. 23, pp. 1559-1568, 2002.
Abstract:
A new constraint on geometric active contour has been proposed, that is
capable of propagating adaptively (bidirectional) and extracting the
shape of the object more accurately. The constraint used is an image
based steering function derived from histogram features in a
non-overlapped distribution function, as against the conventional
method that uses gradient-based edge stopping function. (C) 2002
Elsevier Science B.V. All rights reserved.
|
713. | Hinshaw, KP, Poliakov, AV, Moore, EB, Martin, RF, Shapiro, LG, and Brinkley, JF, "Shape-based cortical surface segmentation for visualization brain mapping," NEUROIMAGE, vol. 16, pp. 295-316, 2002.
Abstract:
We describe a knowledge-based approach to cortical surface segmentation
that uses learned knowledge of the overall shape and range of variation
of the cortex (excluding the detailed gyri and sulci) to guide the
search for the grey-CSF boundary in a structural MRI image volume. The
shape knowledge is represented by a radial surface model, which is a
type of geometric constraint network (GCN) that we hypothesize can
represent shape by networks of locally interacting constraints. The
shape model is used in a protocol for visualization-based mapping of
cortical stimulation mapping (CSM) sites onto the brain surface, prior
to integration with other mapping modalities or as input to existing
surface analysis and reconfiguration programs. Example results are
presented for CSM data related to language organization in the cortex,
but the methods should be applicable to other situations where a
realistic visualization of the brain surface, as seen at neurosurgery,
is desired. (C) 2002 Elsevier Science (USA).
|
714. | Marchant, JA, "Testing a measure of image quality for acquisition control," IMAGE AND VISION COMPUTING, vol. 20, pp. 449-458, 2002.
Abstract:
Previous work by the author has shown that the entropy of an image's
histogram can be used to control the acquisition variables (brightness,
contrast, shutter speed) of a camera/digitiser combination in
situations where the imaging conditions are changing. Although the
control leads to histograms that satisfy pragmatic expectations of what
a 'good' histogram should look like (i.e. filling the dynamic range of
the digitiser without too much saturation), it avoids the problem of
what we mean by a good histogram in the machine vision context and
whether the control produces images that have these histograms.
In this work a good image is defined to be one where the subsequent
analysis algorithms work well. Three different algorithms, each
containing many diverse components, are tested on sets of images with
different acquisition parameters. As well as acquiring at different
parameters, a simulation of the image acquisition process is derived
and validated to assist evaluation. Test results show that near-optimal
performance is obtained with maximum entropy and it is concluded that
this measure is a suitable one for control of image acquisition. (C)
2002 Elsevier Science B.V. All rights reserved.
|
715. | Bai, J, Jiang, Y, Li, X, Pan, D, Hu, G, and He, P, "Novel ultrasonic fusion imaging method based on cyclic variation in myocardial backscatter," MEDICAL & BIOLOGICAL ENGINEERING & COMPUTING, vol. 40, pp. 163-167, 2002.
Abstract:
Quantitative ultrasonic tissue characterisation of the myocardium based
on integrated backscatter (IB) has the potential of becoming an
effective method for detecting and evaluating myocardial ischaemia. To
facilitate IB-based clinical applications, a new imaging method has
been developed that combines the anatomical information of a B-mode
image with the contractile performance of a selected myocardial region.
To produce such a fusion image, a region of interest (ROI) in a B-mode
cardiac image was first selected by the user. Algorithms for detection
of the endocardium and epicardium were developed, and the resulting
mean distance between the computer-detected curve and the manually
traced curve was 0.83 mm for the endocardium and 0.58 mm for the
epicardium. The cyclic variation of IB (CVIB) of each myocardial tissue
element within the ROI was then calculated over one cardiac cycle.
Finally, a grey-scale B-mode image at the end of diastole was displayed
as a still image, and the pixels representing the myocardial tissue in
the ROI colour-coded according to the corresponding CVIB over the past
heart cycle. Both the B-mode image and the colour-coded region were
refreshed (up-dated) at the next end-of-diastole. Preliminary results
from normal (CVIB = 10-12 dB) and ischaemic (CVIB = 5-7 dB) canine
hearts are presented that demonstrate the utility of this new imaging
method.
|
716. | Coulon, O, Hickman, SJ, Parker, GJ, Barker, GJ, Miller, DH, and Arridge, SR, "Quantification of spinal cord atrophy from magnetic resonance images via a B-spline active surface model," MAGNETIC RESONANCE IN MEDICINE, vol. 47, pp. 1176-1185, 2002.
Abstract:
A method is presented that aims at segmenting and measuring the surface
of the spinal cord from MR images in order to detect and quantify
atrophy. A semiautomatic segmentation with very little intervention
from an operator is proposed. It is based on the optimization of a
B-spline active surface. The method allows for the computation of
orthogonal cross-sections at any level along the cord, from which
measurements are derived, such as cross-sectional area or curvature. An
evaluation of the accuracy and reproducibility of the method is
presented.
|
717. | Cheung, KW, Yeung, DY, and Chin, RT, "On deformable models for visual pattern recognition," PATTERN RECOGNITION, vol. 35, pp. 1507-1526, 2002.
Abstract:
This paper reviews model-based methods for non-rigid shape recognition.
These methods model, match and classify non-rigid shapes. which are
generally problematic for conventational algorithms using rigid models.
Issues including model representation, optimization criteria
formulation, model matching, and classification are examined in detail
with the objective to provide interested researchers a roadmap for
exploring the field. This paper emphasizes on 2D deformable models.
Their potential applications and future research directions,
particularly on deformable pattern classification, are discussed. (C)
2002 Published by Elsevier Science Ltd on behalf of Pattern Recognition
Society.
|
718. | Yezzi, A, Tsai, A, and Willsky, A, "A fully global approach to image segmentation via coupled curve evolution equations," JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, vol. 13, pp. 195-216, 2002.
Abstract:
In this paper, we develop a novel region-based approach to snakes
designed to optimally separate the values of certain image statistics
over a known number of region types. Multiple sets of contours deform
according to a coupled set of curve evolution equations derived from a
single global cost functional. The resulting active contour model, in
contrast to many other edge and region based models, is fully global in
that the evolution of each curve depends at all times upon every pixel
in the image and is directly coupled to the evolution of every other
curve regardless of their mutual proximity. As such evolving contours
enjoy a very wide "field of view," endowing the algorithm with a
robustness to initial contour placement above and beyond the
significant improvement exhibited by other region based snakes over
earlier edge based snakes. (C) 2002 Elsevier Science (USA).
|
719. | Boscolo, R, Brown, MS, and McNitt-Gray, MF, "Medical image segmentation with knowledge-guided robust active contours," RADIOGRAPHICS, vol. 22, pp. 437-448, 2002.
Abstract:
Medical image segmentation techniques typically require some form of
expert human supervision to provide accurate and consistent
identification of anatomic structures of interest. A novel segmentation
technique was developed that: combines a knowledge-based segmentation
system with a sophisticated active contour model. This approach
exploits the guidance of a higher-level process to robustly perform the
segmentation of various anatomic structures. The user need not provide
initial contour placement, and the high-level process carries out the
required parameter optimization automatically. Knowledge about the
anatomic structures to be segmented is defined statistically in terms
of probability density functions of parameters such as location, size,
and image intensity (eg, computed tornographic [CT] attenuation value).
Preliminary results suggest that the performance of the algorithm at
chest and abdominal CT is comparable to that of more traditional
segmentation techniques like region growing and morphologic operators.
In some cases, the active contour-based technique may outperform
standard segmentation methods due to its capacity to fully enforce the
available a priori knowledge concerning the anatomic structure of
interest. The active contour algorithm is particularly suitable for
integration with high-level image understanding frameworks, providing a
robust and easily controlled low-level segmentation tool. Further study
is required to determine whether the proposed: algorithm is indeed
capable of providing consistently superior segmentation. (C)RSNA, 2002.
|
720. | Ji, L, and Yan, H, "Robust topology-adaptive snakes for image segmentation," IMAGE AND VISION COMPUTING, vol. 20, pp. 147-164, 2002.
Abstract:
'Snakes'-based segmentation techniques have a variety of applications
in computer vision. Traditional snakes however are well known to be
topologically inflexible. They are incapable of dealing with more
complicated object shapes as well as multiple-object scenes since the
snakes require that the topology of object structures of interest must
be known in advance, This paper introduces a robust topology-adaptive
snake, based on the attractable snake model [6], to extend the snakes'
topological adaptability. Three embedded schemes: the robust
self-looping process, the efficient contour-merging and the improved
adaptive interpolation scheme, are involved. Experiment results show
that the new snake model is able to; consistently evolve towards its
target objects, handle topological changes (i.e. splitting or merging)
automatically as necessary and conform to more complicated geometries
and topologies, without restrictive requirements on the initial
conditions of the snake or on its deformation movement. (C) 2002
Elsevier Science B.V. All rights reserved.
|
721. | Drummond, C, "Accelerating reinforcement learning by composing solutions of automatically identified subtasks," JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, vol. 16, pp. 59-104, 2002.
Abstract:
This paper discusses a system that accelerates reinforcement learning
by using transfer from related tasks. Without such transfer, even if
two tasks are very similar at some abstract level, an extensive
re-learning effort is required. The system achieves much of its power
by transferring parts of previously learned solutions rather than a
single complete solution. The system exploits strong features in the
multi-dimensional function produced by reinforcement learning in
solving a particular task. These features are stable and easy to
recognize early in the learning process. They generate a partitioning
of the state space and thus the function. The partition is represented
as a graph. This is used to index and compose functions stored in a
case base to form a close approximation to the solution of the new
task. Experiments demonstrate that function composition often produces
more than an order of magnitude increase in learning rate compared to a
basic reinforcement learning algorithm.
|
722. | Ji, LL, and Yan, H, "Attractable snakes based on the greedy algorithm for contour extraction," PATTERN RECOGNITION, vol. 35, pp. 791-806, 2002.
Abstract:
While most improved snakes were built under the original variational
scheme, this paper presents an attractable snake based on the greedy
snake (Williams and Shah, CVGIP: Image Understanding 55(1) (1992)
14-26). By use of a direct feedback mechanism that is seamlessly
consistent with the search strategy of the greedy algorithm, the
proposed approach is capable of inheriting the simplicity and
efficiency of that algorithm and performing competitively with related
snakes. To avoid undesirable local minima, an overall optimal edge
detector is designed. A suitable synthetic convergent criterion is
proposed which enables snakes to converge normally or oscillatingly on
target objects. An adaptive interpolation scheme that encourages snakes
to accurately sense the details of object shapes is also described.
This model is applied to extract contours from various images with
encouraging results. (C) 2002 Pattern Recognition Society. Published by
Elsevier Science Ltd. All rights reserved.
|
723. | Rettmann, ME, Han, X, Xu, CY, and Prince, JL, "Automated sulcal segmentation using watersheds on the cortical surface," NEUROIMAGE, vol. 15, pp. 329-344, 2002.
Abstract:
The human cortical surface is a highly complex, folded structure.
Sulci, the spaces between the folds, define location on the cortex and
provide a parcellation into anatomically distinct areas. A topic that
has recently received increased attention is the segmentation of these
sulci from magnetic resonance images, with most work focusing on
extracting either the sulcal spaces between the folds or curve
representations of sulci. Unlike these methods, we propose a technique
that extracts actual regions of the cortical surface that surround
sulci, which we call "sulcal regions." The method is based on a
watershed algorithm applied to a geodesic depth measure on the cortical
surface. A well-known problem with the watershed algorithm is a
tendency toward oversegmentation, meaning that a single region is
segmented as several pieces. To address this problem, we propose a
postprocessing algorithm that merges appropriate segments from the
watershed algorithm. The sulcal regions are then manually labeled by
simply selecting the appropriate regions with a mouse click and a
preliminary study of sulcal depth is reported. Finally, a scheme is
presented for computing a complete parcellation of the cortical
surface. (C) 2002 Elsevier Science.
|
724. | Triglia, JM, Nazarian, B, Sudre-Levillain, I, Marciano, S, Moulin, G, and Giovanni, A, "Virtual laryngotracheal endoscopy based on geometric surface modeling using spiral computed tomography data," ANNALS OF OTOLOGY RHINOLOGY AND LARYNGOLOGY, vol. 111, pp. 36-43, 2002.
Abstract:
This prospective study describes the clinical utility of virtual
endoscopy based on geometric sur face modeling of the laryngotracheal
lumen. Eighteen children with dyspnea related to either subglottic
angioma (n = 5) or laryngotracheal stenosis (n = 13) were included. All
patients underwent video-recorded operative endoscopy, spiral computed
tomography. and 3-dimensional reconstruction of the laryngotracheal
lumen. Modeling was achieved by contour detection on spiral computed
tomographic image and reconstruction using a geometric
shape-recognition algorithm. The generated surface was, used for
diagnosis and measurement using interactive and automatic tools.
Findings of virtual endoscopy and operative endoscopy were compared,
Virtual endoscopy confirmed narrowing of the airway in all cases. In 9
cases, high-grade stenosis prevented complete operative endoscopy. but
virtual endoscopy allowed accurate assessment and measurement of the
stenosis. The findings of operative and virtual endoscopy were
concordant in 9 cases. We conclude that surface modeling provides
valuable information for preoperative evaluation of laryngotracheal
narrowing. The ability to assess extraluminal anatomy provides a
clearer picture of overall disease involvement. In the future, virtual
endoscopy will probably be used in conjunction with operative endoscopy
for therapeutic decision-making. Noninvasive virtual endoscopy could
become an alternative to traditional endoscopy under general anesthesia
for therapeutic follow-up.
|
725. | Kawata, Y, Niki, N, Ohmatsu, H, and Moriyama, N, "Visualization of interval changes of pulmonary nodules using high-resolution CT images," IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, vol. E85D, pp. 77-87, 2002.
Abstract:
This paper presents a method to analyze volumetrically evolutions of
pulmonary nodules for discrimination between malignant and benign
nodules. Our method consists of four steps; (1) The 3-D rigid
registration of the two successive 3-D thoracic CT images, (2) the 3-D
affine registration of the two successive region-of-interest (ROI)
images, (3) non-rigid registration between local volumetric ROIs, and
(4) analysis of the local displacement Field between successive
temporal images. In the preliminary study, the method was applied to
the successive 3-D thoracic images of two pulmonary nodules including a
metastasis malignant nodule and a inflammatory benign nodule to
quantify evolutions of the pulmonary nodules and their surrounding
structures. The time intervals between successive 3-D thoracic images
for the benign and malignant cases were 150 and 30 days, respectively.
From the display of the displacement fields and the contrasted image by
the vector field operator based on the Jacobian, it was observed that
the benign case reduced in the volume and the surrounding structure was
involved into the nodule. It was also observed that the malignant case
expanded in the volume. These experimental results indicate that our
method is a promising tool to quantify how the lesions evolve their
volume and surrounding structures.
|
726. | Hellwich, O, Laptev, I, and Mayer, H, "Extraction of linear objects from interferometric SAR data," INTERNATIONAL JOURNAL OF REMOTE SENSING, vol. 23, pp. 461-475, 2002.
Abstract:
A new method for the automated extraction of pipelines and other linear
objects from Synthetic Aperture Radar ( SAR) scenes is presented. It
combines intensity data with coherence data from an interferometric
evaluation of a SAR scene pair. The fusion is based on Bayesian
statistics and is part of a Markov random field ( MRF) model for line
extraction. Both intensity and coherence data are evaluated using
rotating templates. The different statistical properties of intensity
and coherence are taken into account by a multiplicative noise model
and an additive noise model respectively. The MRF model introduces
prior knowledge about the continuity and the narrowness of lines.
Posterior odds resulting from the MRF method are input to a method
based on ziplock snakes for linear object extraction. This processing
step is controlled interactively which is necessary as fully automatic
processing of the given noisy data does not provide sufficiently
predictable results. The method is applied to data of the ERS tandem
mission.
|
727. | Montillo, A, Metaxas, D, and Axel, L, "Automated segmentation of the left and right ventricles in 4D cardiac SPAMM images," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION-MICCAI 2002, PT 1, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2488, pp. 620-633, 2002.
Abstract:
In this paper we describe a completely automated volume-based method
for the segmentation of the left and fight ventricles in 4D tagged MR
(SPAMM) images for quantitative cardiac analysis. We correct the
background intensity variation in each volume caused by surface coils
using a new scale-based fuzzy connectedness procedure. We apply 3D
grayscale opening to the corrected data to create volumes containing
only the blood filled regions. We threshold the volumes by minimizing
region variance or by an adaptive statistical thresholding method. We
isolate the ventricular blood filled regions using a novel approach
based on spatial and temporal shape similarity. We use these regions to
define the endocardium contours and use them to initialize an active
contour that locates the epicardium through the gradient vector flow of
an edgemap of a grayscale-closed image. Both quantitative and
qualitative results on normal and diseased patients are presented.
|
728. | Huggins, PS, and Zucker, SW, "Representing edge models via local principal component analysis," COMPUTER VISON - ECCV 2002, PT 1, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2350, pp. 384-398, 2002.
Abstract:
Edge detection depends not only upon the assumed model of what an edge
is, but also on how this model is represented. The problem of how to
represent the edge model is typically neglected, despite the fact that
the representation is a bottleneck for both computational cost and
accuracy. We propose to represent edge models by a partition of the
edge manifold corresponding to the edge model, where each local element
of the partition is described by its principal components. We describe
the construction of this representation and demonstrate its benefits
for various edge models.
|
729. | Auclair-Fortier, MF, Poulin, P, Ziou, D, and Allili, M, "A computational algebraic topology model for the deformation of curves," ARTICULATED MOTION AND DEFORMABLE OBJECTS, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2492, pp. 56-67, 2002.
Abstract:
A new method for the deformation of curves is presented. It is based
upon a decomposition of the linear elasticity problem into basic
physical laws. Unlike other methods which solve the partial
differential equation arising from the physical laws by numerical
techniques, we encode the basic laws using computational algebraic
topology. Conservative laws use exact global values while constitutive
allow to make wise. assumptions using some knowledge about the problem
and the domain. The deformations computed with our approach have a
physical interpretation. Furthermore, our algorithm performs with
either 21) or 3D problems. We finally present an application of the
model in updating road databases and results validating our approach.
|
730. | Saxena, R, Zachariah, SG, and Sanders, JE, "Processing computer tomography bone data for prosthetic finite element modeling: A technical note," JOURNAL OF REHABILITATION RESEARCH AND DEVELOPMENT, vol. 39, pp. 609-613, 2002.
Abstract:
A software scheme is presented to extract the shapes of tibiae and
fibulae from amputee computer tomography (CT) data for use in
prosthetic finite element modeling. A snake algorithm is implemented to
overcome challenges of bone-soft tissue edge detection common in this
application. Means to enhance initial guess contours, ensure contour
continuity, overcome point-clustering problems, and handle
high-curvature regions are also described. Effectiveness of the
algorithm is demonstrated on image data from a unilateral transtibial
amputee subject.
|
731. | Foo, SW, and Dong, L, "Recognition of visual speech elements using Hidden Markov Models," ADVANCES IN MULTIMEDIA INFORMATION PROCESSING - PCM 2002, PROCEEDING, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2532, pp. 607-614, 2002.
Abstract:
In this paper, a novel subword lip reading system using continuous
Hidden Markov Models (HMMs) is presented. The constituent HMMs are
configured according to the statistical features of lip motion and
trained with the Baum-Welch method. The performance of the proposed
system in identifying the fourteen visemes defined in MPEG-4 standards
is addressed. Experiment results show that an average accuracy above
80% can be achieved using the proposed system.
|
732. | Tohka, J, "Surface extraction from volumetric images using deformable meshes: A comparative study," COMPUTER VISION - ECCV 2002 PT III, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2352, pp. 350-364, 2002.
Abstract:
Deformable models are by their formulation able to solve surface
extraction problem from noisy volumetric images. This is since they use
image independent information, in form of internal energy or internal
forces, in addition to image data to achieve the goal. However, it is
riot a simple task to deform initially given surface meshes to a good
representation of the target surface in the presence of noise. Several
methods to do this have been proposed and in this study a few recent
ones are compared. Basically, we supply an image and an arbitrary but
reasonable initialization and examine how well the target surface is
captured with different methods for controlling the deformation of the
mesh. Experiments with synthetic images as well as medical images are
performed and results are reported and discussed. With synthetic
images, the quality of results is measured also quantitatively. No
optimal method was found, but the properties of different methods in
distinct situations were highlighted.
|
733. | Jehan-Besson, S, Barlaud, M, and Aubert, G, "DREAM(2)S: Deformable regions driven by an Eulerian accurate minimization method for image and video segmentation - Application to face detection in color video sequences," COMPUTER VISION - ECCV 2002 PT III, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2352, pp. 365-380, 2002.
Abstract:
In this paper, we propose a general Eulerian framework for region-based
active contours named DREAM(2)S. We introduce a general criterion
including both region-based and boundary-based terms where the
information on a region is named "descriptor". The originality of this
work is twofold. Firstly we propose to use shape optimization
principles to compute the evolution equation of the active contour that
will make it evolve as fast as possible towards a minimum of the
criterion. Secondly, we take into account the variation of the
descriptors during the propagation of the curve. Indeed, a descriptor
is generally globally attached to the region and thus
"region-dependent". This case arises for example if the mean or the
variance of a region are chosen as descriptors. We show that the
dependence of the descriptors with the region induces additional terms
in the evolution equation of the active contour that have never been
previously computed. DREAM(2)S gives an easy way to take such a
dependence into account and to compute the resulting additional terms.
Experimental results point out the importance of the additional terms
to reach a true minimum of the criterion and so to obtain accurate
results. The covariance matrix determinant appears to be a very
relevant tool for homogeneous color regions segmentation. As an
example, it has been successfully applied to face detection in real
video sequences.
|
734. | Gerard, O, Deschamps, T, Greff, M, and Cohen, LD, "Real-time interactive path extraction with on-the-fly adaptation of the external forces," COMPUTER VISION - ECCV 2002 PT III, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2352, pp. 807-821, 2002.
Abstract:
The aim of this work is to propose an adaptation of optimal path based
interactive tools for image segmentation (related to Live-Wire [12] and
Intelligent Scissors [18] approaches). We efficiently use both discrete
[10] and continuous [6] path search approaches. The segmentation relies
on the notion of energy function and we introduce the possibility of
complete on-the-fly adaptation of each individual energy term, as well
as of their relative weights. Non-specialist users have then a full
control of the drawing process which automatically selects the most
relevant set of features to steer the path extraction. Tests have been
performed on a large variety of medical images.
|
735. | Masero, V, Leon-Rojas, JM, and Moreno, J, "Volume reconstruction for health care - A survey of computational methods," TECHNIQUES IN BIOINFORMATICS AND MEDICAL INFORMATICS, ANNALS OF THE NEW YORK ACADEMY OF SCIENCES, vol. 980, pp. 198-211, 2002.
Abstract:
In many scientific and technical applications, a three-dimensional (3D)
object must he reconstructed, either to assist in understanding the
object's structure or to ease its automatic handling and analysis.
Volume reconstruction has been used in health care to diagnose,
simulate, facilitate surgical planning, develop image-guided surgery,
facilitate telemedicine, and to assist in many other applications. This
paper presents a survey of computational methods used to achieve volume
reconstruction. First, we review 3D imaging techniques. Second, since
we consider image segmentation the most important and difficult phase
of 3D reconstruction, we focus on this topic. Subsequently, we
concentrate on some of the most successful techniques of segmentation
used for 3D reconstruction, such as active contours. We also review
computer graphics and visualization methods used with volume
reconstruction. Finally, we indicate future lines for research in
volume reconstruction and 3D imaging for health care.
|
736. | Aleksic, PS, Williams, JJ, Wu, ZL, and Katsaggelos, AK, "Audio-visual speech recognition using MPEGA compliant visual features," EURASIP JOURNAL ON APPLIED SIGNAL PROCESSING, vol. 2002, pp. 1213-1227, 2002.
Abstract:
We describe an audio-visual automatic continuous speech recognition
system, which significantly improves speech recognition performance
over a wide range of acoustic noise levels, as well as under clean
audio conditions. The system utilizes facial animation parameters
(FAps) supported by the MPEG-4 standard for the visual representation
of speech. We also describe a robust and automatic algorithm we have
developed to extract FAPs from visual data, which does not require hand
labeling or extensive training procedures. The principal component
analysis (PCA) was performed on the FAPs in order to decrease the
dimensionality of the visual feature vectors, and the derived
projection weights were used as visual features in the audio-visual
automatic speech recognition (ASR) experiments. Both single-stream and
multistream hidden Markov models (HMMs) were used to model the ASR
system, integrate audio and visual information, and perform a
relatively large vocabulary (approximately 1000 words) speech
recognition experiments. The experiments performed use clean audio data
and audio data corrupted by stationary white Gaussian noise at various
SNRs. The proposed system reduces the word error rate (WER) by 20% to
23% relatively to audio-only speech recognition WERs, at various SNRs
(0-30 dB) with additive white Gaussian noise, and by 19% relatively to
audio-only speech recognition WER under clean audio conditions.
|
737. | Zhang, XZ, Broun, CC, Mersereau, RM, and Clements, MA, "Automatic Speechreading with applications to human-computer interfaces," EURASIP JOURNAL ON APPLIED SIGNAL PROCESSING, vol. 2002, pp. 1228-1247, 2002.
Abstract:
There has been growing interest in introducing speech as a new modality
into the human-computer interface (HCI). Motivated by the multimodal
nature of speech, the visual component is considered to yield
information that is not always present in the acoustic signal and
enables improved system performance over acoustic-only methods,
especially in noisy environments. In this paper, we investigate the
usefulness of visual speech information in HCI related applications. We
first introduce a new algorithm for automatically locating the mouth
region by using color and motion information and segmenting the lip
region by making use of both color and edge information based on Markov
random fields. We then derive a relevant set of visual speech
parameters and incorporate them into a recognition engine. We present
various visual feature performance comparisons to explore their impact
on the recognition accuracy, including the lip inner contour and the
visibility of the tongue and teeth. By using a common visual feature
set, we demonstrate two applications that exploit speechreading in a
joint audio-visual speech signal processing task: speech recognition
and speaker verification. The experimental results based on two
databases demonstrate that the visual information is highly effective
for improving recognition performance over a variety of acoustic noise
levels.
|
738. | Archip, N, Erard, PJ, Egmont-Petersen, M, Haefliger, JM, and Germond, JF, "A knowledge-based approach to automatic detection of the spinal cord in CT images," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 21, pp. 1504-1516, 2002.
Abstract:
Accurate planning of radiation therapy entails the definition of
treatment volumes and a clear delimitation of normal tissue of which
unnecessary exposure should be prevented. The spinal cord is a
radiosensitive organ, which should be precisely identified because an
overexposure to radiation may lead to undesired complications for the
patient such as neuronal disfunction or paralysis. In this paper, a
knowledge-based approach to identifying the spinal cord in computed
tomography images of the thorax is presented. The approach relies on a
knowledge-base which consists of a so-called anatomical structures map
(ASM) and a task-oriented architecture called the plan solver. The ASM
contains a frame-like knowledge representation of the macro-anatomy in
the human thorax. The plan solver is responsible for determining the
position, orientation and size of the structures of interest to
radiation therapy. The plan solver relies on a number of image
processing operators. Some are so-called atomic (e.g., thresholding and
snakes) whereas others are composite. The whole system has been
implemented on a standard PC. Experiments performed on the image
material from 23 patients show that the approach results in a reliable
recognition of the spinal cord (92% accuracy) and the spinal canal (85%
accuracy). The lamina is more problematic to locate correctly (accuracy
72%). The position of the outer thorax is always determined correctly.
|
739. | Goldenberg, R, Kimmel, R, Rivlin, E, and Rudzsky, M, "Cortex segmentation: A fast variational geometric approach," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 21, pp. 1544-1551, 2002.
Abstract:
An automatic cortical gray matter segmentation from a three-dimensional
(3-D) brain images [magnetic resonance (MR) or computed tomography] is
a well known problem in medical image processing. In this paper, we
first formulate it as a geometric variational problem for propagation
of two coupled bounding surfaces. An efficient numerical scheme is then
used to implement the geodesic active surface model. Experimental
results of cortex segmentation on real 3-D MR data are provided.
|
740. | Zimmer, C, Labruyere, E, Meas-Yedid, V, Guillen, N, and Olivo-Marin, JC, "Segmentation and tracking of migrating cells in videomicroscopy with parametric active contours: A tool for cell-based drug testing," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 21, pp. 1212-1221, 2002.
Abstract:
This paper presents a segmentation and tracking method for quantitative
analysis of cell dynamics from in vitro videomicroscopy data. The
method is based on parametric active contours and includes several
adaptations that address important difficulties of cellular imaging,
particularly the presence of low-contrast boundary deformations known
as pseudopods, and the occurence of multiple contacts between cells.
First, we use an edge map based on the average intensity dispersion
that takes advantage of relative background homogeneity to facilitate
the detection of both pseudopods and interfaces between adjacent cells.
Second, we introduce a repulsive interaction between contours that
allows correct segmentation of objects in contact and overcomes the
shortcomings of previously reported techniques to enforce contour
separation. Our tracking technique was validated on a realistic data
set by comparison with a manually defined ground-truth and was
successfully applied to study the motility of amoebae in a biological
research project.
|
741. | Ray, N, Acton, ST, and Ley, K, "Tracking leukocytes in vivo with shape and size constrained active contours," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 21, pp. 1222-1235, 2002.
Abstract:
Inflammatory disease is initiated by leukocytes (white blood cells)
rolling along the inner surface lining of small blood vessels called
postcapillary venules. Studying the number and velocity of rolling
leukocytes is essential to understanding and successfully treating
inflammatory diseases. Potential inhibitors of leukocyte recruitment
can be screened by leukocyte rolling assays and successful inhibitors
validated by intravital microscopy. In this paper, we present an active
contour or snake-based technique to automatically track the movement of
the leukocytes. The novelty of the proposed method lies in the energy
functional that constrains the shape and size of the active contour.
This paper introduces a significant enhancement over existing
gradient-based snakes in the form of a modified gradient vector flow.
Using the gradient vector flow, we can track leukocytes rolling at high
speeds that are not amenable to tracking with the existing edge-based
techniques. We also propose a new energy-based implicit sampling method
of the points on the active contour that replaces the computationally
expensive explicit method. To enhance the performance of this shape and
size constrained snake model, we have coupled it with Kalman filter so
that during coasting (when the leukocytes are completely occluded or
obscured), the tracker may infer the location of the center of the
leukocyte. Finally, we have compared the performance of the proposed
snake tracker with that of the correlation and centroid-based trackers.
The proposed snake tracker results in superior performance measures,
such as reduced error in locating the leukocyte under tracking and
improvements in the percentage of frames successfully tracked. For
screening and drug validation, the tracker shows promise as an
automated data collection tool.
|
742. | Bandyopadhyay, S, "Contour extraction using genetic algorithms," IETE JOURNAL OF RESEARCH, vol. 48, pp. 369-376, 2002.
Abstract:
A fast and efficient contour extraction algorithm that exploits the
enhanced searching capability of genetic algorithm While minimising the
energy of an active contour is proposed in this article. The energy is
computed based on a chamfer image, in which pixel values relate to
their closeness to surrounding edges. Given an initial approximation of
the contour of interest, its energy (both internal and external) is
computed. Subsequently, genetic algorithm is used to minimize the
energy by appropriately moving the contour towards the one of interest.
Comparison of the performance of the proposed algorithm with snake, a
traditional contour extraction technique based on the active contour
model, demonstrates the superiority of the former for situations where
the spline drawn from initial control points do not closely approximate
the contour of interest.
|
743. | Corsi, C, Saracino, G, Sarti, A, and Lamberti, C, "Left ventricular volume estimation for real-time three-dimensional echocardiography," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 21, pp. 1202-1208, 2002.
Abstract:
The application of level set techniques to echocardiographic data is
presented. This method allows semiautomatic segmentation of heart
chambers, which regularizes the shapes and improves edge fidelity,
especially in the presence of gaps, as is common in ultrasound data.
The task of the study was to reconstruct left ventricular shape and to
evaluate left ventricular volume. Data were acquired with a real-time
three-dimensional (3-D) echocardiographic system. The method was
applied directly in the three-dimensional domain and was based on a
geometric-driven scheme. The numerical scheme for solving the proposed
partial differential equation is borrowed from numerical methods for
conservation law. Results refer to in vitro and human in vivo acquired
3-D+time echocardiographic data. Quantitative validation was performed
on in vitro balloon phantoms. Clinical application of this segmentation
technique is reported for 20 patient cases providing measures of left
ventricular volumes and ejection fraction.
|
744. | Suri, JS, Liu, KC, Reden, L, and Laxminarayan, S, "A review on MR vascular image processing: Skeleton versus nonskeleton approaches: part II," IEEE TRANSACTIONS ON INFORMATION TECHNOLOGY IN BIOMEDICINE, vol. 6, pp. 338-350, 2002.
Abstract:
Vascular segmentation has recently been given much attention. This
review paper has two parts. Part I of this review focused on the
physics of magnetic resonance angiography (MRA) and prefiltering
techniques applied to MRA. Part 11 of this review presents the
state-of-the-art overview, status, and hew achievements in vessel
segmentation algorithms from MRA. The first part of this review paper
is focused on the nonskeleton or direct-based techniques. Here, we
present eight different techniques along with their mathematical
foundations, algorithms and their pros and cons. We will also focus on
the skeleton or indirect-based techniques. We will discuss three
different techniques along with their mathematical foundations,
algorithms and their pros and cons. This paper also includes a clinical
discussion on skeleton versus nonskeleton-based segmentation
techniques. Finally, we shall conclude this paper with the possible
challenges, the future, and a brief summary on vascular segmentation
techniques.
|
745. | Tong, CS, Yuen, PC, and Wong, YY, "Dividing snake algorithm for multiple object segmentation," OPTICAL ENGINEERING, vol. 41, pp. 3177-3182, 2002.
Abstract:
Active contour models, otherwise known as snakes, are extensively used
in image processing and computer vision applications. However, although
the approach is popular for detecting the contours of smooth convex
objects, it is much more problematic in handling images containing an
object with concave parts or sharp corners, or multiple objects. We
further develop our segmented snake approach to contour detection and
illustrate its flexibility by showing how it can be adapted to yield a
dividing snake algorithm for use in multiple object segmentation. We
also introduce a snake relaxation technique that can improve the
convergence of the snake contour onto the object boundary. (C) 2002
Society of Photo-Optical Instrumentation Engineers.
|
746. | Sebe, N, and Lew, M, "Robust shape matching," IMAGE AND VIDEO RETRIEVAL, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2383, pp. 17-28, 2002.
Abstract:
Many visual matching algorithms can be described in terms of the
features and the inter-feature distance or metric. The most commonly
used metric is the sum of squared differences (SSD), which is valid
from a maximum likelihood perspective when the real noise distribution
is Gaussian. However, we have found experimentally that the Gaussian
noise distribution assumption is often invalid. This implies that other
metrics, which have distributions closer to the real noise
distribution, should be used. In this paper we considered a shape
matching application. We implemented two algorithms from the research
literature and for each algorithm we compared the efficacy of the SSD
metric, the SAD (sum of the absolute differences) metric, and the
Cauchy metric. Furthermore, in the case where sufficient training data
is available, we discussed and experimentally tested a metric based
directly on the real noise distribution, which we denoted the maximum
likelihood metric.
|
747. | Ilic, S, and Fua, P, "Using Dirichlet Free Form Deformation to fit deformable models to noisy 3-D data," COMPUTER VISION - ECCV 2002, PT II, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2351, pp. 704-717, 2002.
Abstract:
Free-form deformations (FFD) constitute an important geometric shape
modification method that has been extensively investigated for computer
animation and geometric modelling. In this work, we show that FFDs are
also very effective to fit deformable models to the kind of noisy 3-D
data that vision algorithms such as stereo tend to produce.
We advocate the use of Dirichlet Free Form Deformation (DFFD) instead
of more conventional FFDs because they give us the ability to place
control points at arbitrary locations rather than on a regular lattice,
and thus much greater flexibility. We tested our approach on stereo
data acquired from monocular video-sequences and show that it can be
successfully used to reconstruct a complex object such as the whole
head, including the neck and the ears, as opposed to the face only.
|
748. | Wu, XD, and Chen, DZ, "Optimal net surface problems with applications," AUTOMATA, LANGUAGES AND PROGRAMMING, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2380, pp. 1029-1042, 2002.
Abstract:
In this paper, we study an interesting geometric graph called
multi-column graph in the d-D space (d greater than or equal to 3), and
formulate two combinatorial optimization problems called the optimal
net surface problems on such graphs. Our formulations capture a number
of important problems such as surface reconstruction with a given
topology, medical image segmentation, and metric labeling. We prove
that the optimal net surface problems on general d-D multi-column
graphs (d greater than or equal to 3) are NP-hard. For two useful
special cases of these d-D (d greater than or equal to 3) optimal net
surface problems (on the so-called proper ordered multi-column graphs)
that often arise in applications, we present polynomial time
algorithms. We further apply our algorithms to some surface
reconstruction problems in 3-D and 4-D, and some medical image
segmentation problems in 3-D and 4-D, obtaining polynomial time
solutions for these problems. The previously best known algorithms for
some of these applied problems, even for relatively simple cases, take
at least exponential time. Our approaches for these applied problems
can be extended to higher dimensions.
|
749. | Ozer, IB, Wolf, W, and Akansu, AN, "A graph-based object description for information retrieval in digital image and video libraries," JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, vol. 13, pp. 425-459, 2002.
Abstract:
This work focuses on the search of a sample object (car) in video
sequences and images based on shape similarity. We form anew
description for cars, using relational graphs in order to annotate the
images where the object of interest (OOI) is present. Query by text can
be performed afterward to extract images of OOI from an automatically
preprocessed database. The performance of the general retrieval systems
is not satisfactory due to the gap between high level concepts and low
level features. In this study we successfully fulfill this gap by using
the graph-based description scheme which provides an efficient way to
obtain high-level semantics from low-level features. We investigate the
full potential of the shape matching method based on relational graph
of objects with respect to its accuracy, efficiency, and scalability.
We use hierarchical segmentation that increases the accuracy of the
detection of the object in the transformed and occluded images. Many
shape-based similarity retrieval methods perform well if the initial
segmentation is adequate; however, in most cases segmentation without a
priori information or user interference yields unsuccessful object
extraction results. Compared to other methods, the major advantage of
the proposed method is its ability to create semantic segments
automatically from the combination of low level edge- or region-based
segments using model-based segmentation. It is shown that a graph-based
description of the complex objects with model-based segmentation is a
powerful scheme for automatic annotation of images and videos. (C) 2002
Elsevier Science (USA).
|
750. | Kosmopoulos, DI, Varvarigou, TA, Emiris, DM, and Kostas, AA, "MD-SIR: a methodology for developing sensor-guided industry robots," ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, vol. 18, pp. 403-419, 2002.
Abstract:
In this paper, we preseat a generic methodology for the synthesis of
industrial robot applications with sensory feedback at the end-effector
level. The presented methodology assumes an open controller
architecture and leads to the creation of a library of modular and
reusable entities, which can be used to build new systems based on the
proposed architectural framework. The library facilitates the
integration of new algorithms and it evolves as new modular
applications are built. The library components belong to the control
objects layer of the open controller architecture and implement
functionality for sensor interfacing, sensor modeling, pattern
recognition, state estimation and state regulation. The validity of the
approach is verified by composing real industrial applications. The
experimental results indicate the high quality of the developed
systems. (C) 2002 Elsevier Science Ltd. All rights reserved.
|
751. | Ferrant, M, Nabavi, A, Macq, B, Black, PM, Jolesz, FA, Kikinis, R, and Warfield, SK, "Serial registration of intraoperative MR images of the brain," MEDICAL IMAGE ANALYSIS, vol. 6, pp. 337-359, 2002.
Abstract:
The increased use of image-guided surgery systems during neurosurgery
has brought to prominence the inaccuracies of conventional
intraoperative navigation systems caused by shape changes such as those
due to brain shift. We propose a method to track the deformation of the
brain and update preoperative images using intraoperative MR images
acquired at different crucial time points during surgery. We use a
deformable, surface matching algorithm to capture the deformation of
boundaries of key structures (cortical surface, ventricles and tumor)
throughout the neurosurgical procedure, and a linear finite element
elastic model to infer a volumetric deformation. The boundary data are
extracted from intraoperative MR images using a real-time
intraoperative segmentation algorithm. The algorithm has been applied
to a sequence of intraoperative MR images of the brain exhibiting brain
shift and tumor resection. Our results characterize the brain shift
after opening of the dura and at the different stages of tumor
resection, and brain swelling afterwards. Analysis of the average
deformation capture was assessed by comparing landmarks identified
manually and the results indicate an accuracy of 0.7+/-0.6 mm
(mean+/-S.D.) for boundary surface landmarks, of 0.9+/-0.6 mm for
landmarks inside the boundary surfaces, and 1.6+/-0.9 mm for landmarks
in the vicinity of the tumor.
(C) 2002 Published by Elsevier Science B.V.
|
752. | Park, HK, and Chung, MJ, "External force of snake: virtual electric field," ELECTRONICS LETTERS, vol. 38, pp. 1500-1502, 2002.
Abstract:
Gradient vector flow (GVF) is an external force of snake that overcomes
traditional snake's problems: limited capture range and poor
convergence to concave boundaries. A new external force with the same
properties as the GVF is proposed. The proposed method has much shorter
computational time than the GVF.
|
753. | Lam, SY, and Tong, CS, "Conformal Snake algorithm for contour detection," ELECTRONICS LETTERS, vol. 38, pp. 452-453, 2002.
Abstract:
A novel and effective modification of the original Snake algorithm is
proposed, The modification can improve the capability of the algorithm
to detect boundaries with shop corners or concave parts without the
need to introduce external forces. The essential idea is to apply
conformal mapping to transform the image so that the object boundary in
the new domain can be captured by the Snake algorithm.
|
754. | Snel, JG, Venema, HW, and Grimbergen, CA, "Deformable triangular surfaces using fast 1-D radial Lagrangian dynamics - Segmentation of 3-D MR and CT images of the wrist," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 21, pp. 888-903, 2002.
Abstract:
We developed a new triangulated deformable surface model, which is used
to detect the boundary of the bones in three-dimensional magnetic
resonance (MR) and computed tomography (CT) images of the wrist. This
surface model is robust to initialization and provides wide geometrical
coverage and quantitative power.
The surface is deformed by applying one-dimensional (I-D) radial
Lagrangian dynamics. For initialization a tetrahedron is placed within
the bone to be segmented. This initial surface is inflated to a binary
approximation of the boundary. During inflation, the surface is refined
by the addition of vertices. After the surface is fully inflated, a
detailed, accurate boundary detection is obtained by the application of
radial scale-space relaxation. In this optimization stage, the image
intensity is filtered with a series of I-D second-order Gaussian
filters. The resolution of the triangulated mesh is adapted to the
width of the Gaussian filter.
To maintain the coherence between the vertices, a resampling technique
is applied which is based on collapsing and splitting of edges. We
regularized the triangulated mesh by a combination of volume-preserving
vertex averaging and equi-angulation of edges.
In this paper, we present both qualitative and quantitative results of
the surface segmentations in eight MR and ten CT images.
|
755. | Fan, Y, Jiang, TZ, and Evans, DJ, "Volumetric segmentation of brain images using parallel genetic algorithms," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 21, pp. 904-909, 2002.
Abstract:
Active model-based segmentation has frequently been used in medical
image processing with considerable success. Although the active
model-based method was initially viewed as an optimization problem,
most researchers implement it as a partial differential equation
solution. The advantages and disadvantages of the active model-based
method are distinct: speed and stability. To improve its performance, a
parallel genetic algorithm-based active model method is proposed and
applied to segment the lateral ventricles from magnetic resonance brain
images. First, an objective function is defined. Then one instance
surface was extracted using the finite-difference method-based active
model and used to initialize the first generation of a parallel genetic
algorithm. Finally, the parallel genetic algorithm is employed to
refine the result. We demonstrate that the method successfully
overcomes numerical instability and is capable of generating an
accurate and robust anatomic descriptor for complex objects in the
human brain, such as the lateral ventricles.
|
756. | Pitiot, A, Toga, AW, and Thompson, PM, "Adaptive elastic segmentation of brain MRI via shape-model-guided evolutionary programming," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 21, pp. 910-923, 2002.
Abstract:
This paper presents a fully automated segmentation method for medical
images. The goal is to localize and parameterize a variety of types of
structure in these images for subsequent quantitative analysis. We
propose a new hybrid strategy that combines a general elastic template
matching approach and an evolutionary heuristic. The evolutionary
algorithm uses prior statistical information about the shape of the
target structure to control the behavior of a number of deformable
templates. Each template, modeled in the form of a B-spline, is warped
in a potential field which is itself dynamically adapted.
Such a hybrid scheme proves to be promising: by maintaining a
population of templates, we cover a large domain of the solution space
under the global guidance of the evolutionary heuristic, and thoroughly
explore interesting areas.
We address key issues of automated image segmentation systems.
The potential fields are initially designed based on the spatial
features of the edges in the input image, and are subjected to
spatially adaptive diffusion to guarantee the deformation of the
template. This also improves its global consistency and convergence
speed.
The deformation algorithm can modify the internal structure of the
templates to allow a better match.
We investigate in detail the preprocessing phase that the images
undergo before they can be used more effectively in the iterative
elastic matching procedure: a texture classifier, trained via linear
discriminant analysis of a learning set, is used to enhance the
contrast of the target structure with respect to surrounding tissues.
We show how these techniques interact within a statistically driven
evolutionary scheme to achieve a better tradeoff between template
flexibility and sensitivity to noise and outliers.
We focus on understanding the features of template matching that are
most beneficial in terms of the achieved match. Examples from simulated
and real image data are discussed, with considerations of algorithmic
efficiency.
|
757. | van Ginneken, B, Frangi, AF, Staal, JJ, Romeny, BMT, and Viergever, MA, "Active shape model segmentation with optimal features," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 21, pp. 924-933, 2002.
Abstract:
An active shape model segmentation scheme is presented that is steered
by optimal local features, contrary to normalized first order
derivative profiles, as in the original formulation [Cootes and Taylor,
1995, 1999, and 2001]. A nonlinear kNN-classifier is used, instead of
the linear Mahalanobis distance, to find optimal displacements for
landmarks. For each of the landmarks that describe the shape, at each
resolution level taken into account during the segmentation
optimization procedure, a distinct set of optimal features is
determined. The selection of features is automatic, using the training
images and sequential feature forward and backward selection. The new
approach is tested on synthetic data and in four medical segmentation
tasks: segmenting the right and left lung fields in a database of 230
chest radiographs, and segmenting the cerebellum and corpus callosum in
a database of 90 slices from MRI brain images. In all cases, the new
method produces significantly better results in terms of an overlap
error measure (p < 0.001 using a paired T-test) than the original
active shape model scheme.
|
758. | Pardas, M, and Bonafonte, A, "Facial animation parameters extraction and expression recognition using Hidden Markov Models," SIGNAL PROCESSING-IMAGE COMMUNICATION, vol. 17, pp. 675-688, 2002.
Abstract:
The video analysis system described in this paper aims at facial
expression recognition consistent with the MPEG4 standardized
parameters for facial animation, FAR For this reason, two levels of
analysis are necessary: low-level analysis to extract the MPEG4
compliant parameters and high-level analysis to estimate the expression
of the sequence using these low-level parameters.
The low-level analysis is based on an improved active contour algorithm
that uses high level information based on principal component analysis
to locate the most significant contours of the face (eyebrows and
mouth), and on motion estimation to track them. The high-level analysis
takes as input the FAP produced by the low-level analysis tool and, by
means of a Hidden Markov Model classifier, detects the expression of
the sequence. (C) 2002 Elsevier Science B.V. All rights reserved.
|
759. | Ruchala, KJ, Olivera, GH, Kapatoes, JM, Reckwerdt, PJ, and Mackie, TR, "Methods for improving limited field-of-view radiotherapy reconstructions using imperfect a priori images," MEDICAL PHYSICS, vol. 29, pp. 2590-2605, 2002.
Abstract:
There are many benefits to having an online CT imaging system for
radiotherapy, as it helps identify changes in the patient's position
and anatomy between the time of planning and treatment. However, many
current online CT systems suffer from a limited field-of-view (LFOV) in
that collected data do not encompass the patient's complete cross
section. Reconstruction of these data sets can quantitatively distort
the image values and introduce artifacts. This work explores the use of
planning CT data as a priori information for improving these
reconstructions. Methods are presented to incorporate this data by
aligning the LFOV with the planning images and then merging the data
sets in sinogram space. One alignment option is explicit fusion,
producing fusion-aligned reprojection (FAR) images. For cases where
explicit fusion is not viable, FAR can be implemented using the
implicit fusion of normal setup error, referred to as
normal-error-aligned reprojection (NEAR). These methods are evaluated
for multiday patient images showing both internal and skin-surface
anatomical variation. The iterative use of NEAR and FAR is also
investigated, as are applications of NEAR and FAR to dose calculations
and the compensation of LFOV online MVCT images with kVCT planning
images. Results indicate that NEAR and FAR can utilize planning CT data
as imperfect a priori information to reduce artifacts and
quantitatively improve images. These benefits can also increase the
accuracy of dose calculations and be used for augmenting CT images
(e.g., MVCT) acquired at different energies than the planning CT. (C)
2002 American Association of Physicists in Medicine.
|
760. | McInerney, T, Hamarneh, G, Shenton, M, and Terzopoulos, D, "Deformable organisms for automatic medical image analysis," MEDICAL IMAGE ANALYSIS, vol. 6, pp. 251-266, 2002.
Abstract:
We introduce a new approach to medical image analysis that combines
deformable model methodologies with concepts from the field of
artificial life. In particular, we propose 'deformable organisms',
autonomous agents whose task is the automatic segmentation, labeling,
and quantitative analysis of anatomical structures in medical images.
Analogous to natural organisms capable of voluntary movement, our
artificial organisms possess deformable bodies with distributed
sensors, as well as (rudimentary) brains with motor, perception,
behavior, and cognition centers. Deformable organisms are perceptually
aware of the image analysis process. Their behaviors, which manifest
themselves in voluntary movement and alteration of body shape, are
based upon sensed image features, pre-stored anatomical knowledge, and
a deliberate cognitive plan. We demonstrate several prototype
deformable organisms based on a multiscale axisymmetric body
morphology, including a 'corpus callosum worm' that can overcome noise,
incomplete edges, considerable anatomical variation, and interference
from collateral structures to segment and label the corpus callosum in
2D mid-sagittal MR brain images. (C) 2002 Elsevier Science B.V. All
rights reserved.
|
761. | Kamijo, S, Nishida, T, and Sakauchi, M, "Occlusion robust and illumination invariant vehicle tracking for acquiring detailed statistics from traffic images," IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, vol. E85D, pp. 1753-1766, 2002.
Abstract:
Among ITS applications, it is very important to acquire detailed
statistics of traffic flows. For that purpose, vision sensors have an
advantage because of their rich information compared to such spot
sensors such as loop detectors or supersonic wave sensors. However, for
many years, vehicle tracking in traffic images has suffered from the
problems of occlusion effect and illumination effect. In order to
resolve occlusion problems, we have been proposing the Spatio-Temporal
Markov Random Field model(S-T MRF) for segmentation of Spatio-Temporal
images. This S-T MRF model optimizes the segmentation boundaries of
occluded vehicles and their motion vectors simultaneously by referring
to textures and segment labeling correlations along the temporal axis
as well as the spatial axis. Consequently, S-T MRF has been proven to
be successful for vehicle tracking even against severe occlusions found
in low-angle traffic images with complicated motions, such at highway
junctions. In addition, in this paper, we define a method for obtaining
illumination-invariant images by estimating MRF energy among neighbor
pixel intensities. These illumination-invariant images are very stable
even when sudden variations in illumination or shading effect are
occurred in the original images. We then succeeded in seamlessly
integrating the method for MRF energy images into our S-T MRF model.
Thus, vehicle tracking was performed successfully by S-T MRF, even
against sudden variations in illumination and against shading effects.
Finally, in order to verify the effectiveness of our tracking algorithm
based on the S-T MRF for practical uses, we developed an automated
system for acquiring traffic statistics out of a flow of traffic
images. This system has been operating continuously for ten months, and
thus effectiveness of the tracking algorithm based on S-T MRF model was
proven.
|
762. | Choi, HC, and Kim, SD, "Boundary extraction using statistical shape descriptor," ELECTRONICS LETTERS, vol. 38, pp. 1330-1332, 2002.
Abstract:
An algorithm is proposed for extracting an object boundary from a
low-quality image obtained by infrared sensors. With the training data
set, the global shape is modelled by incorporating the statistical
curvature model into the point distribution model (PDM). Simulation
results show better performance than the PDM in the sense of
computation speed and distortion under noise, pose variation and some
kinds of occlusions.
|
763. | Cremers, D, Tischhauser, F, Weickert, J, and Schnorr, C, "Diffusion snakes: Introducing statistical shape knowledge into the Mumford-Shah functional," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 50, pp. 295-313, 2002.
Abstract:
We present a modification of the Mumford-Shah functional and its
cartoon limit which facilitates the incorporation of a statistical
prior on the shape of the segmenting contour. By minimizing a single
energy functional, we obtain a segmentation process which maximizes
both the grey value homogeneity in the separated regions and the
similarity of the contour with respect to a set of training shapes. We
propose a closed-form, parameter-free solution for incorporating
invariance with respect to similarity transformations in the
variational framework. We show segmentation results on artificial and
real-world images with and without prior shape information. In the
cases of noise, occlusion or strongly cluttered background the shape
prior significantly improves segmentation. Finally we compare our
results to those obtained by a level set implementation of geodesic
active contours.
|
764. | Chen, YM, Tagare, HD, Thiruvenkadam, S, Huang, F, Wilson, D, Gopinath, KS, Briggs, RW, and Geiser, EA, "Using prior shapes in geometric active contours in a variational framework," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 50, pp. 315-328, 2002.
Abstract:
In this paper, we report an active contour algorithm that is capable of
using prior shapes. The energy functional of the contour is modified so
that the energy depends on the image gradient as well as the prior
shape. The model provides the segmentation and the transformation that
maps the segmented contour to the prior shape. The active contour is
able to find boundaries that are similar in shape to the prior, even
when the entire boundary is not visible in the image (i.e., when the
boundary has gaps). A level set formulation of the active contour is
presented. The existence of the solution to the energy minimization is
also established.
We also report experimental results of the use of this contour on 2d
synthetic images, ultrasound images and fMRI images. Classical active
contours cannot be used in many of these images.
|
765. | Paragios, N, "A variational approach for the segmentation of the left ventricle in cardiac image analysis," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 50, pp. 345-362, 2002.
Abstract:
In this paper we propose a level set method to segment MR cardiac
images. Our approach is based on a coupled propagation of two cardiac
contours and integrates visual information with anatomical constraints.
The visual information is expressed through a gradient vector
flow-based boundary component and a region term that aims at best
separating the cardiac contours/regions according to their global
intensity properties. In order to deal with misleading visual support,
an anatomical constraint is considered that couples the propagation of
the cardiac contours according to their relative distance. The
resulting motion equations are implemented using a level set approach
and a fast and stable numerical approximation scheme, the Additive
Operator Splitting. Encouraging experimental results are provided using
real data.
|
766. | Petrakis, EGM, Diplaros, A, and Milios, E, "Matching and retrieval of distorted and occluded shapes using dynamic programming," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 24, pp. 1501-1516, 2002.
Abstract:
We propose an approach for matching distorted and possibly occluded
shapes using Dynamic Programming (DP). We distinguish among various
cases of matching such as cases where the shapes are scaled with
respect to each other and cases where an open shape matches the whole
or only a part of another open or closed shape. Our algorithm treats
noise and shape distortions by allowing matching of merged sequences of
consecutive small segments in a shape with larger segments of another
shape, while being invariant to translation, scale, orientation, and
starting point selection. We illustrate the effectiveness of our
algorithm in retrieval of shapes on two data sets of two-dimensional
open and closed shapes of marine life species. We demonstrate the
superiority of our approach over traditional approaches to shape
matching and retrieval based on Fourier descriptors and moments. We
also compare our method with SQUID, a well-known method which is
available on the Internet. Our evaluation is based on human relevance
judgments following a well-established methodology from the information
retrieval field.
|
767. | Liew, AWC, Leung, SH, and Lau, WH, "Lip contour extraction from color images using a deformable model," PATTERN RECOGNITION, vol. 35, pp. 2949-2962, 2002.
Abstract:
The use of visual information from lip movements can improve the
accuracy and robustness of a speech recognition system. In this paper,
a region-based lip contour extraction algorithm based on deformable
model is proposed. The algorithm employs a stochastic cost function to
partition a color lip image into lip and non-lip regions such that the
joint probability of the two regions is maximized. Given a discrete
probability map generated by spatial fuzzy clustering, we show how the
optimization of the cost function can be done in the continuous
setting. The region-based approach makes the algorithm more tolerant to
noise and artifacts in the image. It also allows larger region of
attraction, thus making the algorithm less sensitive to initial
parameter settings. The algorithm works on unadorned lips and accurate;
extraction of lip contour is possible. (C) 2002 Pattern Recognition
Society. Published by Elsevier Science Ltd. All rights reserved.
|
768. | Metaxas, DN, and Kakadiaris, IA, "Elastically adaptive deformable models," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 24, pp. 1310-1321, 2002.
Abstract:
We present a novel technique for the automatic adaptation of a
deformable model's elastic parameters within a Kalman filter framework
for shape estimation applications The novelty of the technique is that
the model's elastic parameters are not constant, but spatio-temporally
varying. The variation of the elastic parameters depends on the
distance of the model from the data and the rate of change of this
distance. Each pass of the algorithm uses physics-based modeling
techniques to iteratively adjust both the geometric and the elastic
degrees of freedom of the model in response to forces that are computed
from the discrepancy between the model and the data. By augmenting the
state equations of an extended Kalman filter to incorporate these
additional variables, we are able to significantly improve the quality
of the shape estimation. Therefore, the model's elastic parameters are
always initialized to the same value and they are subsequently modified
depending on the data and the noise distribution. We present results
demonstrating the effectiveness of our method for both two-dimensional
and three-dimensional data.
|
769. | Lee, YJ, and Lee, SY, "Geometric snakes for triangular meshes," COMPUTER GRAPHICS FORUM, vol. 21, pp. 229-+, 2002.
Abstract:
Feature detection is important in various mesh processing techniques,
such as mesh editing, mesh morphing, mesh compression, and mesh signal
processing. In spite of much research in computer vision, automatic
feature detection even for images still remains a difficult problem. To
avoid this dfficulty, semi-automatic or interactive techniques for
image feature detection have been investigated. In this paper, we
propose a geometric snake as an interactive tool for feature detection
on a 3D triangular mesh. A geometric snake is an extension of an image
snake, which is an active contour model that slithers from its initial
position specified by the user to a nearby feature while minimizing an
energy functional. To constrain the movement of a geometric snake onto
the surface of a mesh, we use the parameterization of the surrounding
region of a geometric snake. Although the definition of a feature may
vary among applications, we use the normal changes of faces to detect
features on a mesh. Experimental results demonstrate that geometric
snakes can successfully capture nearby features from user-specified
initial positions.
|
770. | Luo, HT, and Eleftheriadis, A, "An interactive authoring system for video object segmentation and annotation," SIGNAL PROCESSING-IMAGE COMMUNICATION, vol. 17, pp. 559-572, 2002.
Abstract:
An interactive authoring system is proposed for semi-automatic video
object (VO) segmentation and annotation. This system features a new
contour interpolation algorithm, which enables the user to define the
contour of a VO on multiple frames while the computer interpolates the
missing contours of this object on every frame automatically. Typical
active contour (snake) model is adapted and the contour interpolation
problem is decomposed into a two-directional contour tracking problem
and a merging problem. In addition, new user interaction models are
designed for the user to interact with the computer. Experiments
indicate that this system offers a good balance between algorithm
complexity and user interaction efficiency. (C) 2002 Elsevier Science
B.V. All rights reserved.
|
771. | Persson, A, Holmgren, J, and Soderman, U, "Detecting and measuring individual trees using an airborne laser scanner," PHOTOGRAMMETRIC ENGINEERING AND REMOTE SENSING, vol. 68, pp. 925-932, 2002.
Abstract:
High-resolution airborne laser scanner data offer the possibility to
detect and measure individual trees. In this study an algorithm which
estimated position, height, and crown diameter of individual trees was
validated with field measurements. Because all the trees in this study
were measured on the ground with high accuracy, their positions could
be linked with laser measurements, making validation on an individual
tree basis possible. In total, 71 percent of the trees were correctly
detected using laser scanner data. Because a large portion of the
undetected trees had a small stem diameter, 91 percent of the total
stern volume was detected. Height and crown diameter of detected trees
could be estimated with a root-mean-square error (RMSE) of 0.63 m and
0.61 m, respectively Stem diameter was estimated, using laser measured
tree height and crown diameter, with an RMSE of 3.8 cm. Different laser
beam diameters (0.26 to 3.68 m) were also tested, the smallest beam
size showing a better detection rate in dense forest. However,
estimates of tree height and crown diameter were not affected much by
different beam size.
|
772. | Axel, L, "Biomechanical dynamics of the heart with MRI," ANNUAL REVIEW OF BIOMEDICAL ENGINEERING, vol. 4, pp. 321-347, 2002.
Abstract:
Magnetic resonance imaging (MRI) provides a noninvasive way to evaluate
the biomechanical dynamics of the heart. MRI can provide spatially
registered tomographic imaged, of the heart in different phases of the
cardiac cycle, which can be used to assess global cardiac function and
regional endocardial surface motion. In addition, MRI can provide
detailed information on the patterns of motion within the heart wall,
permitting calculation of the evolution of regional strain and related
motion variables within the wall. These show consistent patterns of
spatial and temporal variation in normal subjects, which are affected
by alterations of function due to disease. Although still an evolving
technique, MRI shows promise as a new method for research and clinical
evaluation of cardiac dynamics.
|
773. | Iannizzotto, G, and Vita, L, "On-line object tracking for colour video analysis," REAL-TIME IMAGING, vol. 8, pp. 145-155, 2002.
Abstract:
Real-time object tracking is recently becoming more and more important
in the field of video analysis and processing. Applications like
traffic control, user-computer interaction, on-line video processing
and production and video surveillance need reliable and economically
affordable video tracking tools. It seems, however, that most of the
available solutions are computationally intensive and sometimes require
expensive video hardware, quite often without guaranteeing a suitable
level of reliability. In this paper, we present a new approach to
real-time object tracking from colour video sequences. It relies on
contours in order to track the shape, position and orientation of
objects, without exploiting snakes or "traditional" active contours. A
closed-loop control approach is adopted to enforce motion tracking
stability, while a separate shape model is maintained, featuring a
two-stage model and a median filtering technique to cope with temporary
occlusions and noise. The system was tested in several different
environments with different constraints, and gave very encouraging
performance. Experimental results are reported and commented on. (C)
2002 Published by Elsevier Science Ltd.
|
774. | Shenton, ME, Gerig, G, McCarley, RW, Szekely, G, and Kikinis, R, "Amygdala-hippocampal shape differences in schizophrenia: the application of 3D shape models to volumetric MR data," PSYCHIATRY RESEARCH-NEUROIMAGING, vol. 115, pp. 15-35, 2002.
Abstract:
Evidence suggests that sonic structural brain abnormalities in
schizophrenia are neurodevelopmental in origin. There is also growing
evidence to suggest that shape deformations in brain structure may
reflect abnormalities in neurodevelopment. While many magnetic
resonance (MR) imaging studies have investigated brain area and volume
measures in schizophrenia, fewer have focused on shape deformations. In
this MR study we used a 3D shape representation technique, based on
spherical harmonic functions, to analyze left and right
amygdala-hippocampus shapes in each of 15 patients with schizophrenia
and 15 healthy controls matched for age, gender, handedness and
parental socioeconomic status. Left/right asymmetry was also measured
for both shape and volume differences. Additionally, shape and Volume
measurements were combined in a composite analysis. There were no
differences between groups in overall volume or shape. Left/right
amygdala-hippocampal asymmetry, however, was significantly larger in
patients than controls for both relative volume and shape. The local
brain regions responsible for the left/ right asymmetry differences in
patients with schizophrenia were in the tail of the hippocampus
(including both the inferior aspect adjacent to parahippocampal gyrus
and the superior aspect adjacent to the lateral geniculate nucleus and
more anteriorly to the cerebral peduncles) and in portions of the
amygdala body (including the anterior-superior aspect adjacent to the
basal nucleus), Also, in patients, increased volumetric asymmetry
tended to be correlated with increased left/right shape asymmetry.
Furthermore, a combined analysis of volume and shape asymmetry resulted
in improved differentiation between groups. Classification function
analyses correctly classified 70%, of cases using volume, 73.3% using
shape, and 87% using combined volume and shape measures. These findings
suggest that shape provides important new information toward
characterizing the pathophysiology of schizophrenia, and that combining
volume and shape measures provides improved group discrimination in
studies investigating brain abnormalities in schizophrenia. An
evaluation of shape deformations also suggests local abnormalities in
the amygdala-hippocampal complex in schizophrenia. (C) 2002 Elsevier
Science Ireland Ltd. All rights reserved.
|
775. | Jang, DS, Jang, SW, and Choi, HI, "2D human body tracking with Structural Kalman filter," PATTERN RECOGNITION, vol. 35, pp. 2041-2049, 2002.
Abstract:
Tracking moving objects is one of the most important techniques in
motion analysis and understanding. and it has many difficult problems
to solve. Especially. estimating and identifying moving objects. when
the background and moving objects vary dynamically, are very difficult.
It is possible under such a complex environment that targets may
disappear totally or partially due to occlusion by other objects. The
Kalman filter has been used to estimate motion information and use the
information in predicting the appearance of targets in the succeeding
frames. In this paper, we propose another version of the Kalman filter,
to be called Structural Kalman filter, which can successfully work its
role of estimating motion information under such a deteriorating
condition as Occlusion. Experimental results show that the suggested
approach is very effective in estimating and tracking non-rigid moving
objects reliably. (C) 2002 Pattern Recognition Society. Published by
Elsevier Science Ltd. All rights reserved.
|
776. | Rellier, G, Descombes, X, and Zerubia, J, "Local registration and deformation of a road cartographic database on a SPOT satellite image," PATTERN RECOGNITION, vol. 35, pp. 2213-2221, 2002.
Abstract:
Herein, we propose a new method to locally register cartographic road
networks on SPOT satellite images. This approach is based on Markov
random fields (MRF) on graphs. Since the cartographic and image data
are obtained from different sources, the noises degrading these data
are of different nature. Cartographers also introduce. in the
generalization process, distortions in the road map in order to
emphasize some details of the road. This can create important
differences between the map data and the ground truth. The proposed
algorithm aims at correcting the error due to noise and generalization,
hence increasing the accuracy of the road map. The first step of the
method is to translate the road network into a graph where the nodes
are characteristic points of the roads (e.g., crossroads). The random
variable or descriptors are defined by the nodes position, The edges
are defined by the roads joining these points. Then, local registration
is performed by defining a model in a Bayesian framework. The solution
is obtained by computing the maximum a posteriori (MAP). The posterior
probability is assumed to be a product of two probabilities, the prior
of the network and the likelihood of the map, each depending on the
image data. Both are Markov Random Field probabilities. The likelihood
of the registered map is the probability of a network configuration
given the map data. It is a measure of a global resemblance between the
two. We use geometrical measures. euclidean distances and angles, to
build this probability. The prior consists of two terms, both depending
on the image data. The dependance exists through the fact that between
two connected nodes, we compute a best path, thanks to a dynamic
programing algorithm, minimizing a cost function based on image gray
levels, Curvature and gradient information. The first term of the prior
penalizes configurations for which different roads overlap each other.
and the second term depends on gray level statistics along these paths.
We run a simulated annealing algorithm to optimize the proposed model,
The tests are done on one real image data extracted from SPOT satellite
images, and artificially noisy cartographic data (translated, rotated
or randomly deformed network). We present some results showing a good
global registration, but also accurate correction of local distortions
(C) 2002 Pattern Recognition Society. Published by Elsevier Science
Ltd. All rights reserved.
|
777. | Huh, S, Ketter, TA, Sohn, KH, and Lee, CH, "Automated cerebrum segmentation from three-dimensional sagittal brain MR images," COMPUTERS IN BIOLOGY AND MEDICINE, vol. 32, pp. 311-328, 2002.
Abstract:
We present a fully automated cerebrum segmentation algorithm for full
three-dimensional sagittal brain MR images. First, cerebrum
segmentation from a midsagittal brain MR image is performed utilizing
landmarks, anatomical information, and a connectivity-based threshold
segmentation algorithm as previously reported. Recognizing that
cerebrum in laterally adjacent slices tends to have similar size and
shape, we use the cerebrum segmentation result from the midsagittal
brain MR image as a mask to guide cerebrum segmentation in adjacent
lateral slices in an iterative fashion. This masking operation yields a
masked image (preliminary cerebrum segmentation) for the next lateral
slice, which may truncate brain region(s). Truncated regions are
restored by first finding end points of their boundaries, by comparing
the mask image and masked image boundaries, and then applying a
connectivity-based algorithm. The resulting final extracted cerebrum
image for this slice is then used as a mask for the next lateral slice.
The algorithm yielded satisfactory fully automated cerebrum
segmentations in three-dimensional sagittal brain MR images, and had
performance superior to conventional edge detection algorithms for
segmentation of cerebrum from 3D sagittal brain MR images. (C) 2002
Elsevier Science Ltd. All rights reserved.
|
778. | McCane, B, Galvin, B, and Novins, K, "Algorithmic fusion for more robust feature tracking," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 49, pp. 79-89, 2002.
Abstract:
We present a framework for merging the results of independent
feature-based motion trackers using a classification based approach. We
demonstrate the efficacy of the framework using corner trackers as an
example. The major problem with such systems is generating ground truth
data for training. We show how synthetic data can be used effectively
to overcome this problem. Our combined system performs better in both
dropouts and errors than a correspondence tracker, and had less than
half the dropouts at the cost of moderate increase in error compared to
a relaxation tracker.
|
779. | Dillabaugh, CR, Niemann, KO, and Richardson, DE, "Semi-automated extraction of rivers from digital imagery," GEOINFORMATICA, vol. 6, pp. 263-284, 2002.
Abstract:
The manual production of vector maps from digital imagery can be a time
consuming and costly process. Developing tools to automate this task
for specific features, such as roads, has become an important research
topic. The purpose of this paper was to present a technique for the
semi-automatic extraction of multiple pixel width river features
appearing in high resolution satellite imagery. This was accomplished
using a two stage, multi-resolution procedure. Initial river extraction
was performed on low resolution (SPOT multi-spectral, 20 m) imagery.
The results from this low resolution extraction were then refined on
higher resolution (KFA1000, panchromatic, 5 m) imagery to produce a
detailed outline of the channel banks. To perform low resolution
extraction a cost surface was generated to represent the combined local
evidence of the presence of a river feature. The local evidence of a
river was evaluated based on the results of a number of simple
operators. Then, with user specified start and end points for the
network, rivers were extracted by performing a least cost path search
across this surface using the A* algorithm. The low resolution results
were transferred to the high resolution imagery as closed contours
which provided an estimate of the channel banks. These contours were
then fit to the channel banks using the dynamic contours (or snakes)
technique.
|
780. | Archip, N, Erard, PJ, Haefliger, JM, and Germond, JF, "Lung metastasis detection and visualization on CT images: a knowledge-based method," JOURNAL OF VISUALIZATION AND COMPUTER ANIMATION, vol. 13, pp. 65-76, 2002.
Abstract:
A solution to the problem of lung metastasis detection oil computed
tomography (CT) scans of the thorax is presented. A knowledge-based
top-down approach for image interpretation is used. The method is
inspired by the manner in which a radiologist and radiotherapist
interpret CT images before radiotherapy is planned. A two-dimensional
followed by a three-dimensional analysis is performed. The algorithm
first detects the thorax contour, the lungs and the ribs, which further
help the detection of metastases. Thus, two types of tumors are
detected: nodules and metastases located at the lung extremities. A
method to visualize the anatomical structures segmented is also
presented. The system Was tested on 20 patients (988 total images) from
the Oncology Department of La Chaux-de-Fonds Hospital and the results
show that the method is reliable as a computer-aided diagnostic tool
for clinical purpose in all oncology department. Copyright (C) 2002
John Wiley Sons, Ltd.
|
781. | Harders, M, Wildermuth, S, and Szekely, G, "New paradigms for interactive 3D volume segmentation," JOURNAL OF VISUALIZATION AND COMPUTER ANIMATION, vol. 13, pp. 85-95, 2002.
Abstract:
We present a new virtual reality-based interaction metaphor for
semi-automatic segmentation of medical 3D volume data, The mouse-based,
manual initialization of deformable surfaces in 3D represents a major
bottleneck in interactive segmentation. In our multi-modal system we
enhance this process with additional sensory feedback. A 3D haptic
device is used to extract the centreline of a tubular structure. Based
on the obtained path a cylinder with varying diameter is generated,
which in turn is used as the initial guess for a deformable surface.
Copyright (C) 2002 John Wiley Sons, Ltd.
|
782. | Precioso, F, and Barlaud, M, "B-spline active contour with handling of topology changes for fast video segmentation," EURASIP JOURNAL ON APPLIED SIGNAL PROCESSING, vol. 2002, pp. 555-560, 2002.
Abstract:
This paper deals with video segmentation for MPEG-4 and MPEG-7
applications. Region-based active contour is a powerful technique for
segmentation. However most of these methods are implemented using level
sets. Although level-set methods provide accurate segmentation, they
suffer from large computational cost. We propose to use a regular
B-spline parametric method to provide a fast and accurate segmentation.
Our B-spline interpolation is based on a fixed number of points 2(j)
depending on the level of the desired details. Through this spatial
multiresolution approach, the computational cost of the segmentation is
reduced. We introduce a length penalty. This results in improving both
smoothness and accuracy. Then we show some experiments on real-video
sequences.
|
783. | Ahlberg, J, "An active model for facial feature tracking," EURASIP JOURNAL ON APPLIED SIGNAL PROCESSING, vol. 2002, pp. 566-571, 2002.
Abstract:
We present a system for finding and tracking a face and extract global
and local animation parameters from a video sequence. The system uses
an initial colour processing step for finding a rough estimate of the
position, size, and inplane rotation of the face, followed by a
refinement step drived by an active model. The latter step refines the
previous estimate, and also extracts local animation parameters. The
system is able to track the face and some facial features in near
real-time, and can compress the result to a bitstream compliant to
MPEG-4 face and body animation.
|
784. | Jehan-Besson, S, Barlaud, M, and Aubert, G, "A 3-step algorithm using region-based active contours for video objects detection," EURASIP JOURNAL ON APPLIED SIGNAL PROCESSING, vol. 2002, pp. 572-581, 2002.
Abstract:
We propose a 3-step algorithm for the automatic detection of moving
objects in video sequences using region-based active contours. First,
we introduce a very full general framework for region-based active
contours with a new Eulerian method to compute the evolution equation
of the active contour from a criterion including both region-based and
boundary-based terms. This framework can be easily adapted to various
applications, thanks to the introduction of functions named descriptors
of the different regions. With this new Eulerian method based on shape
optimization principles, we can easily take into account the case of
descriptors depending upon features globally attached to the regions.
Second, we propose a 3-step algorithm for detection of moving objects,
with a static or a mobile camera, using region-based active contours.
The basic idea is to hierarchically associate temporal and spatial
information. The active contour evolves with successively three sets of
descriptors: a temporal one, and then two spatial ones. The third
spatial descriptor takes advantage of the segmentation of the image in
intensity homogeneous regions. User interaction is reduced to the
choice of a few parameters at the beginning of the process. Some
experimental results are supplied.
|
785. | Bottigli, U, and Golosio, B, "Feature extraction from mammographic images using fast marching methods," NUCLEAR INSTRUMENTS & METHODS IN PHYSICS RESEARCH SECTION A-ACCELERATORS SPECTROMETERS DETECTORS AND ASSOCIATED EQUIPMENT, vol. 487, pp. 209-215, 2002.
Abstract:
Features extraction from medical images represents a fundamental step
for shape recognition and diagnostic support. The present work faces
the problem of the detection of large features, such as massive lesions
and organ contours, from mammographic images. The regions of interest
are often characterized by an average grayness intensity that is
different from the surrounding. In most cases, however, the desired
features cannot be extracted by simple gray level thresholding, because
of image noise and non-uniform density of the surrounding tissue. In
this work, edge detection is achieved through the fast marching method
(Level Set Methods and Fast Marching Methods, Cambridge University
Press, Cambridge, 1999), which is based on the theory of interface
evolution. Starting from a seed point in the shape of interest, a front
is generated which evolves according to an appropriate speed function.
Such function is expressed in terms of geometric properties of the
evolving interface and of image properties, and should become zero when
the front reaches the desired boundary. Some examples of application of
such method to mammographic images from the CALMA database (Nucl.
Instr. and Meth. A 460 (2001) 107) are presented here and discussed.
(C) 2002 Elsevier Science B.V. All rights reserved.
|
786. | Lee, RST, and Liu, JNK, "Scene analysis using an integrated composite neural oscillatory elastic graph matching model," PATTERN RECOGNITION, vol. 35, pp. 1835-1846, 2002.
Abstract:
Scene analysis is so far one of the most important topics in machine
vision. In this paper, we present a neural oscillatory model integrated
with an elastic graph dynamic link model to provide an automatic means
of processing color images. The system involves: (1) multi-frequency
bands feature extraction scheme using Gabor filters, (2) automatic
figures-ground object segmentation using a composite neural oscillatory
model, and (3) object matching using an elastic graph dynamic link
model. Using an image gallery of over 3000 color objects, with the
recognition of 6000 different scenes, our model shows an average
recognition rate of over 95%. For occluded objects in cluttered scenes,
the model can still maintain a promising recognition rate of over 87%.
Compared with that of the contemporary scene analysis models of
gray-level images based on a coupled oscillatory network, the proposed
model provides an efficient solution for color images using the
composite neural oscillatory model (CNOM). Coupled with the elastic
graph dynamic link model (EGDLM), the object recognition process takes
less than 35 s on average to complete, which is quite promising in many
applications. (C) 2002 Pattern Recognition Society. Published by
Elsevier Science Ltd. All rights reserved.
|
787. | Ruther, H, Martine, HM, and Mtalo, EG, "Application of snakes and dynamic programming optimisation technique in modeling of buildings in informal settlement areas," ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING, vol. 56, pp. 269-282, 2002.
Abstract:
This paper presents a novel approach to semiautomatic building
extraction in informal settlement areas from aerial photographs. The
proposed approach uses a strategy of delineating buildings by
optimising their approximate building contour position. Approximate
building contours are derived automatically by locating elevation blobs
in digital surface models. Building extraction is then effected by
means of the snakes algorithm and the dynamic programming optimisation
technique. With dynamic programming, the building contour optimisation
problem is realized through a discrete multistage process and solved by
the "time-delayed" algorithm, as developed in this work. The proposed
building extraction approach is a semiautomatic process, with
user-controlled operations linking fully automated subprocesses. Inputs
into the proposed building extraction system are ortho-images and
digital surface models, the latter being generated through image
matching techniques. Buildings are modeled as "lumps" or elevation
blobs in digital surface models, which are derived by altimetric
thresholding of digital surface models. Initial windows for building
extraction are provided by projecting the elevation blobs centre points
onto an ortho-image. In the next step, approximate building contours
are extracted from the ortho-image by region growing constrained by
edges. Approximate building contours thus derived are inputs into the
dynamic programming optimisation process in which final building
contours are established. The proposed system is tested on two study
areas: Marconi Beam in Cape Town, South Africa, and Manzese in Dar es
Salaam, Tanzania. Sixty percent of buildings in the study areas have
been extracted and verified and it is concluded that the proposed
approach contributes meaningfully to the extraction of buildings in
moderately complex and crowded informal settlement areas. (C) 2002
Published by Elsevier Science B.V.
|
788. | Ozer, IB, and Wolf, WH, "A hierarchical human detection system in (un)compressed domains," IEEE TRANSACTIONS ON MULTIMEDIA, vol. 4, pp. 283-300, 2002.
Abstract:
With the rapid growth of multimedia information in forms of digital
image and video libraries, there is an increasing need for intelligent
database management tools with an efficient information retrieval
system. For this purpose, we propose a hierarchical retrieval system
where shape, color and motion characteristics of human body are
captured in compressed and uncompressed domains. The proposed retrieval
method provides human detection and activity recognition at different
resolution levels from low complexity to low false rates and connects
low level features to high level semantics by developing relational
object and activity presentations. The available information of
standard video compression algorithms are used in order to reduce the
amount of time and storage needed for the information retrieval. The
principal component analysis is used for activity recognition using
MPEG motion vectors and results are presented for walking, kicking, and
running to demonstrate that the classification among activities is
clearly visible. For low resolution and monochrome images it is
demonstrated that the structural information of human silhouettes can
be captured from AC-DCT coefficients. The system performance is tested
on 40 images that contain a total of 126 nonoccluded frontal poses and
the algorithm can detect 101 of them correctly. The finest details in
the images and video sequences are obtained from the uncompressed
domain via model based segmentation and graph matching for an in depth
analysis of human bodies. The detection rate for human body parts is
70.27% for images and sequences including human body regions at
different resolutions and with different postures.
|
789. | Todd-Pokropek, A, "Advances in computers and image processing with applications in nuclear medicine," QUARTERLY JOURNAL OF NUCLEAR MEDICINE, vol. 46, pp. 62-69, 2002.
Abstract:
The continuing advances in hardware performance had made many
previously computationally unattractive methods feasible, an example
being iterative reconstruction in tomography, which is now routine.
Dynamic SPECT can also be performed. However the aim of image
processing is not just to produce pretty pictures, but to extract good
clinical information. The methods also need to incorporate clinical
knowledge and he defined using clinical constraints. in general data in
nuclear medicine are n-D, often 3-D plus time. Data reduction for
example by the extraction of physiological information, is important.
Such data are in any case hard to visualise without compression, for
example some kind of dimensionality reduction, going from n-D to a 2-D
"functional" image. Both linear and non-linear operations can be
considered. To extract physiological data, we need to fit models. Two
classes of method are important. data driven and hypothesis driven.
Examples of data driven methods are principal component analysis and
factor analysis, where the model is derived form the data Hypothesis
driven methods are all implicitly or explicitly based on model fitting.
A preliminary data driven step followed by an hypothesis driven
approach could be called constrained statistical image analysis.
Examples are shown as used in nuclear medicine and are being extended
to MRI. Another important problem considered is that of multi-modality
image registration and fusion. Although many methods exist, all based
on the minimisation of an appropriate distance functions between 2
image data sets such as mutual information, additional constraints are
required when the images are not so similar. Additional constraints can
be imposed by means of cluster analysis of the n-dimensional feature
space. in the analysis of such data, tests against reference data sets
(atlases) are required, normally requiring warping the data sets in
space, for example by the use of optic flow, or some kind of diffusion
equation. Real time analysis of data during acquisition can lead to
optimisation of acquisition procedures. Incorporation of such image
analysis into a decision support system is desirable.
|
790. | Sifakis, E, Grinias, I, and Tziritas, G, "Video segmentation using fast marching and region growing algorithms," EURASIP JOURNAL ON APPLIED SIGNAL PROCESSING, vol. 2002, pp. 379-388, 2002.
Abstract:
The algorithm presented in this paper is comprised of three main
stages: (1) classification of the image sequence and, in the case of a
moving camera, parametric motion estimation, (2) change detection
having as reference a fixed frame, an appropriately selected frame or a
displaced frame, and (3) object localization using local colour
features. The image sequence classification is based on statistical
tests on the frame difference. The change detection module uses a
two-label fast marching algorithm. Finally, the object localization
uses a region growing algorithm based on the colour similarity. Video
object segmentation results are shown using the COST 211 data set.
|
791. | Chang, YJ, and Chen, YC, "Facial model adaptation from a monocular image sequence using a textured polygonal model," SIGNAL PROCESSING-IMAGE COMMUNICATION, vol. 17, pp. 373-392, 2002.
Abstract:
Although several algorithms have been proposed for facial model
adaptation from image sequences, the insufficient feature set to adapt
a full facial model, imperfect matching of feature points, and
imprecise head motion estimation may degrade the accuracy of model
adaptation. In this paper, we propose to resolve these difficulties by
integrating facial model adaptation, texture mapping, and head pose
estimation as cooperative and complementary processes. By using an
analysis-by-synthesis approach, salient facial feature points and head
profiles are reliably tracked and extracted to form a growing and more
complete feature set for model adaptation. A more robust head motion
estimation is achieved with the assistance of the textured facial
model. The proposed scheme is performed with image sequences acquired
with single uncalibrated camera and requires only little manual
adjustment in the initialization setup, which proves to be a feasible
approach for facial model adaptation. (C) 2002 Elsevier Science B.V.
All rights reserved.
|
792. | Wang, Z, Yang, X, and Shi, PF, "Segmentation based on Mumford-Shah model combined with narrow band," JOURNAL OF INFRARED AND MILLIMETER WAVES, vol. 21, pp. 161-166, 2002.
Abstract:
A segmentation model that combines the Mumford-Shah( M-S) model and
narrow band scheme of level set was presented. The disadvantage of
Mumford-Shah model is computationally time-consuming. In each step of
its iteration, the data of whole image have to be renewed, which is
unbearable for segmentation of large image or 3D image. Therefore, a
fast segmentation model was introduce, which combines the M-S model and
narrow band scheme by a new initialization method. The new
initialization method is based on fast marching method, and the
computing time decreases to O(N). In each step of iteration, the new
segmentation model only deals with the data in a narrow band instead of
the whole image. The experiments show that the two models can obtain
almost the same segmentation result, but the computing time of new
narrow band M-S model is much less than that of M-S model.
|
793. | Cen, F, and Qi, F, "Tracking non-rigid objects in clutter background with geometric active contours," ELECTRONICS LETTERS, vol. 38, pp. 550-551, 2002.
Abstract:
A new variational framework of geometric active contours to track
multiple non-rigid moving objects in the clutter background is
presented. Incorporating motion edge information, it consists of motion
detection and tracking stages. The results of experiments are promising
and demonstrate the validity of the proposed framework.
|
794. | Suri, JS, Singh, S, and Reden, L, "Computer vision and pattern recognition techniques for 2-D and 3-D MR cerebral cortical segmentation (Part I): A state-of-the-art review," PATTERN ANALYSIS AND APPLICATIONS, vol. 5, pp. 46-76, 2002.
Abstract:
Extensive growth in functional brain imaging, perfusion-weighted
imaging, diffusion-weighted imaging, brain mapping and brain scanning
techniques has led tremendously to the importance of the cerebral
cortical segmentation, both in 2-D and 3-D, from volumetric brain
magnetic resonance imaging data sets. Besides that, recent growth in
deformable brain segmentation techniques in 2-D and 3-D has brought the
engineering community, such as the areas of computer vision, image
processing, pattern recognition and graphics, closer to the medical
community, such as to neuro-surgeons, psychiatrists, oncologists,
neuro-radiologists and internists. This paper is an attempt to review
the state-of-the-art 2-D and 3-D cerebral cortical segmentation
techniques from brain magnetic resonance imaging based on three main
classes: region-based, boundary/surface-based and fusion of
boundary/surface-based with region-based techniques. In the first
class, region-based techniques, we demonstrated more than 18 different
techniques for segmenting the cerebral cortex from brain slices
acquired in orthogonal directions. In the second class,
boundary/surface-based, we showed more than ten different techniques to
segment the cerebral cortex from magnetic resonance brain volumes.
Particular emphasis will be placed by presenting four state-of-the-art
systems in the third class, based on the fusion of
boundary/surface-based with region-based techniques outlined in Part II
of the paper, also called regional-geometric deformation models, which
take the paradigm of partial differential equations in the level set
framework. We also discuss the pros and cons of various techniques,
besides giving the mathematical foundations for each sub-class in the
cortical taxonomy.
|
795. | Suri, JS, Singh, S, and Reden, L, "Fusion of region and boundary/surface-based computer vision and pattern recognition techniques for 2-D and 3-D MR cerebral cortical segmentation (Part-II): A state-of-the-art review," PATTERN ANALYSIS AND APPLICATIONS, vol. 5, pp. 77-98, 2002.
Abstract:
Extensive growth in functional brain imaging, perfusion-weighted
imaging, diffusion-weighted imaging, brain mapping and brain scanning
techniques has led tremendously to the importance of cerebral cortical
segmentation both in 2-D and 3-D from volumetric brain magnetic
resonance imaging data sets. Besides that, recent growth in deformable
brain segmentation techniques in 2-D and 3-D has brought the
engineering community, such as the areas of computer vision, image
processing, pattern recognition and graphics, closer to the medical
community, such as to neuro-surgeons, psychiatrists, oncologists,
neuro-radiologists and internists. In Part I of this research (see Suri
et al [1]), an attempt was made to review the state-of-the-art in 2-D
and 3-D cerebral cortical segmentation techniques from brain magnetic
resonance imaging based on two main classes: region- and
boundary/surface-based. More than 18 different techniques for
segmenting the cerebral cortex from brain slices acquired in orthogonal
directions were shown using region-based techniques. We also showed
more than ten different techniques to segment the cerebral cortex from
magnetic resonance brain volumes using boundary/surface-based
techniques. This paper (Part II) focuses on presenting state-of-the-art
systems based on the fusion of boundary/surface-based with region-based
techniques, also called regional-geometric deformation models, which
takes the paradigm of partial differential equations in the level set
framework. We also discuss the pros and cons of these various
techniques, besides giving the mathematical foundations for each
sub-class in the cortical taxonomy. Special emphasis is placed on
discussing the advantages, validation, challenges and
neuro-science/clinical applications of cortical segmentation.
|
796. | Ding, ZH, Zhu, H, and Friedman, MH, "Coronary artery dynamics in vivo," ANNALS OF BIOMEDICAL ENGINEERING, vol. 30, pp. 419-429, 2002.
Abstract:
There is considerable evidence that the localization and evolution of
vascular disease are mediated, at least in part, by mechanical factors.
The mechanical environment of the coronary arteries, which are tethered
to the beating heart, is influenced by cardiac motion; the motion of
the vessels must be described quantitatively to characterize fully the
mechanical forces acting on and in the vessel wall. Several techniques
that have been used to characterize coronary artery dynamics from
biplane cineangiograms are described and illustrated. There is
considerable variability in dynamic geometric parameters from site to
site along a vessel, between the right and left anterior descending
arteries, and among individuals, consistent with the hypotheses that
variations in stresses mediated by geometry and dynamics affect the
localization of atherosclerosis and individual risk of coronary heart
disease. The few frankly atherosclerotic vessels that have been
examined exhibit high torsions in the neighborhood of lesions, an
observation which may have etiologic or diagnostic implications. (C)
2002 Biomedical Engineering Society.
|
797. | Liu, LF, and Sclaroff, S, "Index trees for accelerating deformable template matching," PATTERN RECOGNITION LETTERS, vol. 23, pp. 1483-1493, 2002.
Abstract:
An improved method for deformable shape-based object detection and
segmentation is described. A pre-computed index tree is used to improve
the speed of deformable template fitting. Simple shape features are
used as keys in a pregenerated index tree of model instances. A coarse
to fine indexing scheme is used at different levels of the tree to
further improve speed. The index tree approach is demonstrated as an
improvement to a previously-reported template-based region segmentation
system. Experimental results show that when index trees are used, the
speedup is significant while accuracy of shape-based indexing is
maintained. (C) 2002 Elsevier Science B.V. All rights reserved.
|
798. | Glasbey, CA, and Young, MJ, "Maximum a posteriori estimation of image boundaries by dynamic programming," JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES C-APPLIED STATISTICS, vol. 51, pp. 209-221, 2002.
Abstract:
We seek a computationally fast method for solving a difficult image
segmentation problem: the positioning of boundaries on medical scanner
images to delineate tissues of interest. We formulate a Bayesian model
for image boundaries such that the maximum a posteriori estimator is
obtainable very efficiently by dynamic programming. The prior model for
the boundary is a biased random walk and the likelihood is based on a
border appearance model, with parameter values obtained from training
images. The method is applied successfully to the segmentation of
ultrasound images and X-ray computed tomographs of sheep, for
application in sheep breeding programmes.
|
799. | Dammann, F, "Image processing in radiology," ROFO-FORTSCHRITTE AUF DEM GEBIET DER RONTGENSTRAHLEN UND DER BILDGEBENDEN VERFAHREN, vol. 174, pp. 541-550, 2002.
Abstract:
Medical imaging processing and analysis methods have significantly
improved during recent years and are now being increasingly used in
clinical applications. Preprocessing algorithms are used to influence
image contrast and noise. Three-dimensional visualization techniques
including volume rendering and virtual endoscopy are increasingly
available to evaluate sectional imaging data sets. Registration
techniques have been developed to merge different examination
modalities. Structures of interest can be extracted from the image data
sets by various segmentation methods. Segmented structures are used for
automated quantification analysis as well as for three-dimensional
therapy planning, simulation and intervention guidance, including
medical modelling, virtual reality environments, surgical robots and
navigation systems. These newly developed methods require specialized
skills for the production and postprocessing of radiological imaging
data as well as new definitions of the roles of the traditional
specialities. The aim of this article is to give an overview of the
state-of-the-art of medical imaging processing methods, practical
implications for the ragiologist's daily work and future aspects.
|
800. | Tang, CK, and Medioni, G, "Curvature-augmented tensor voting for shape inference from noisy 3D data," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 24, pp. 858-864, 2002.
Abstract:
We improve the basic tensor voting formalism to infer the sign and
direction of principal curvatures at each input site from noisy 3D
data. Unlike most previous approaches, no local surface fitting,
partial derivative computation, nor oriented normal vector recovery is
performed in our method. These approaches are known to be
noise-sensitive since accurate partial derivative information is often
required, which is usually unavailable from real data. Also, unlike
approaches that detect signs of Gaussian curvature, we can handle
points with zero Gaussian curvature uniformly, without first localizing
them in a separate process. The tensor voting curvature estimation is
noniterative, does not require initialization, and is robust to a
considerable amount of outlier noise, as its effect is reduced by
collecting a large number of tensor votes. Qualitative and quantitative
results on synthetic and real, complex data are presented.
|
801. | Wang, J, Bao, HJ, Zhou, WH, Peng, QH, and Xu, YQ, "Automatic image-based pencil sketch rendering," JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, vol. 17, pp. 347-355, 2002.
Abstract:
This paper presents an automatic image-based approach for converting
greyscale images to pencil sketches, in which strokes follow the image
features. The algorithm first extracts a dense direction field
automatically using Logical/Linear operators which embody the drawing
mechanism, Next, a reconstruction approach based on a
sampling-and-interpolation scheme is introduced to generate stroke
paths from the direction field. Finally, pencil strokes are rendered
along the specified paths with consideration of image tone and
artificial illumination. As an important application, the technique is
applied to render portraits from images with little user interaction.
The experimental results demonstrate that the approach can
automatically achieve compelling pencil sketches from reference images.
|
802. | Jang, DS, Jang, SW, and Choi, HI, "Tracking a partially occluded target with a cluster of Kalman filters," INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, vol. 17, pp. 595-607, 2002.
Abstract:
Tracking moving objects is one of the most important techniques in
motion analysis and understanding, and it has many difficult problems
to solve. Estimating and identifying moving objects, when the
background and moving objects vary dynamically, are especially
difficult. It is possible under such a complex environment that targets
might disappear totally or partially due to occlusion by other objects.
The Kalman filter has been used to estimate motion information and use
the information in predicting the appearance of targets in succeeding
frames. In this article, we propose another version of the Kalman
filter, to be called the structural Kalman filter, which can
successfully accomplish its role of estimating motion information under
such a deteriorating condition as occlusion. Experimental results show
that the suggested approach is very effective in estimating and
tracking non-rigid moving objects reliably. (C) 2002 Wiley Periodicals,
Inc.
|
803. | Hurley, DJ, Nixon, MS, and Carter, JN, "Force field energy functionals for image feature extraction," IMAGE AND VISION COMPUTING, vol. 20, pp. 311-317, 2002.
Abstract:
The overall objective in defining feature space is to reduce the
dimensionality of pattern space yet maintaining discriminatory power
for classification and invariant description. To meet this objective,
in the context of ear biometrics, a novel force field transformation
has been developed in which the image is treated as an array of
Gaussian attractors that act as the source of a force field. The
directional properties of the force field are exploited to
automatically locate the extrema of a small number of potential energy
wells and associated potential channels. These form the basis of the
ear description. This has been applied to a small database of ears and
initial results show that the new approach has suitable performance
attributes and shows promising results in automatic ear recognition.
(C) 2002 Published by Elsevier Science B.V.
|
804. | Kobayashi, H, Suzuki, S, Takahashi, H, Tange, A, and Kikuchi, K, "Automatic contour extraction of facial organs for frontal facial images with various facial expressions," JSME INTERNATIONAL JOURNAL SERIES C-MECHANICAL SYSTEMS MACHINE ELEMENTS AND MANUFACTURING, vol. 45, pp. 298-305, 2002.
Abstract:
This study deals with a method to realize automatic contour extraction
of facial features such as eyebrows, eyes and mouth for the time-wise
frontal face with various facial expressions. Because Snakes which is
one of the most famous methods used to extract contours, has several
disadvantages, we propose a new method to overcome these issues. We
define the elastic contour model in order to hold the contour shape and
then determine the elastic energy acquired by the amount of
modification of the elastic contour model. Also we utilize the image
energy obtained by brightness differences of the control points on the
elastic contour model. Applying the dynamic programming method, we
determine the contour position where the total value of the elastic
energy and the image energy becomes minimum. Employing 1/30 s time-wise
facial frontal images changing from neutral to one of six typical
facial expressions obtained from 20 subjects, we have estimated our
method and find it enables high accuracy automatic contour extraction
of facial features.
|
805. | Tu, ZW, and Zhu, SC, "Image segmentation by data-driven Markov Chain Monte Carlo," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 24, pp. 657-673, 2002.
Abstract:
This paper presents a computational paradigm called Data-Driven Markov
Chain Monte Carlo (DDMCMC) for image segmentation in the Bayesian
statistical framework. The paper contributes to image segmentation in
four aspects. First, it designs efficient and well-balanced Markov
Chain dynamics to explore the complex solution space and, thus,
achieves a nearly global optimal solution independent of initial
segmentations. Second, it presents a mathematical principle and a
K-adventurers algorithm for computing multiple distinct solutions from
the Markov chain sequence and, thus, it incorporates intrinsic
ambiguities in image segmentation. Third, it utilizes data-driven
(bottom-up) techniques, such as clustering and edge detection, to
compute importance proposal probabilities, which drive the Markov chain
dynamics and achieve tremendous speedup in comparison to the
traditional jump-diffusion methods [12], [11]. Fourth, the DDMCMC
paradigm provides a unifying framework in which the role of many
existing segmentation algorithms, such as, edge detection, clustering,
region growing, split-merge, snake/balloon, and region competition, are
revealed as either realizing Markov chain dynamics or computing
importance proposal probabilities. Thus, the DDMCMC paradigm combines
and generalizes these segmentation methods in a principled way. The
DDMCMC paradigm adopts seven parametric and nonparametric image models
for intensity and color at various regions. We test the DDMCMC paradigm
extensively on both color and gray-level images and some results are
reported in this paper.
|
806. | Lee, RST, and Liu, JNK, "SCENOGRAM - Scene analysis using CompositE Neural Oscillatory-based elastic GRAph Model," INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, vol. 16, pp. 215-237, 2002.
Abstract:
Scene analysis is so far one of the most important topics in machine
vision. In this paper, we present an integrated scene analysis model,
namely SCENOGRAM (Scene analysis using CompositE Neural
Oscillatory-based elastic GRAph Model). Basically the proposed scene
analyzer is based on the integration of the composite neural
oscillatory model with our elastic graph dynamic link model. The system
involves: (1) multifrequency bands feature extraction scheme using
Gabor filters, (2) automatic figure-ground object segmentation using a
composite neural oscillatory model, and (3) object matching using an
elastic graph dynamic link model.
From the implementation point of view, we introduce an intelligent
agent based scene analysis and object identification solution using the
SCENOGRAM technology. From the experimental point of view, a scene
gallery of over 6000 color scene images is used for automatic scene
segmentation testing and object identification test, An overall correct
invariant facial recognition rate of over 87% is attained. It is
anticipated that the implementation of the SCENOGRAM can provide an
invariant and higher-order intelligent object (pattern) encoding,
searching and identification solution for future intelligent e-Business.
|
807. | Sarti, A, Malladi, R, and Sethian, JA, "Subjective surfaces: A geometric model for boundary completion," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 46, pp. 201-221, 2002.
Abstract:
We present a geometric model and a computational method for
segmentation of images with missing boundaries. In many situations, the
human visual system fills in missing gaps in edges and boundaries,
building and completing information that is not present, Boundary
completion presents a considerable challenge in computer vision, since
most algorithms attempt to exploit existing data. A large body of work
concerns, completion models, which postulate how to construct missing
data; these models are often trained and specific to particular images.
In this paper, we take the following, alternative perspective: we
consider a given reference point within the image, and then develop an
algorithm which tries to build missing information on the basis of the
given point of view and the available information as boundary data to
the algorithm. Starting from this point of view, a surface is
constructed. It is then evolved with the mean curvature flow in the
metric induced by the image until a piecewise constant solution is
reached. We test the computational model on modal completion, amodal
completion, and texture segmentation. We extend the geometric model and
the algorithm to 3D in order to extract shapes from low signal/noise
ratio ultrasound image volumes. Results in 3D echocardiography and 3D
fetal echography are also presented.
|
808. | Paragios, N, and Deriche, R, "Geodesic active regions and level set methods for supervised texture segmentation," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 46, pp. 223-247, 2002.
Abstract:
This paper presents a novel variational framework to deal with frame
partition problems in Computer Vision. This framework exploits boundary
and region-based segmentation modules under a curve-based optimization
objective function. The task of supervised texture segmentation is
considered to demonstrate the potentials of the proposed framework. The
textured feature space is generated by filtering the given textured
images using isotropic and anisotropic filters, and analyzing their
responses as multi-component conditional probability density functions.
The texture segmentation is obtained by unifying region and
boundary-based information as an improved Geodesic Active Contour
Model. The defined objective function is minimized using a
gradient-descent method where a level set approach is used to implement
the obtained PDE. According to this PDE, the curve propagation towards
the final solution is guided by boundary and region-based segmentation
forces, and is constrained by a regularity force. The level set
implementation is performed using a fast front propagation algorithm
where topological changes are naturally handled. The performance of our
method is demonstrated on a variety of synthetic and real textured
frames.
|
809. | Suri, JS, Liu, KC, Singh, S, Laxminarayan, SN, Zeng, XL, and Reden, L, "Shape recovery algorithms using level sets in 2-D/3-D medical imagery: A state-of-the-art review," IEEE TRANSACTIONS ON INFORMATION TECHNOLOGY IN BIOMEDICINE, vol. 6, pp. 8-28, 2002.
Abstract:
The class of geometric deformable models, also known as level sets, has
brought tremendous impact to medical imagery due to its capability of
topology preservation and fast shape recovery. In an effort to
facilitate a clear and full understanding of these powerful
state-of-the-art applied mathematical tools, this paper is an attempt
to explore these geometric methods, their implementations and
integration of regularizers to improve the robustness of these
topologically independent propagating curves/surfaces. This paper first
presents the origination of level sets, followed by the taxonomy of
level sets. We then derive the fundamental equation of curve/surface
evolution and zero-level curves/surfaces. The paper then focuses on the
first core class of level sets, known as "level sets without
regularizers." This class presents five prototypes: gradient, edge,
area-minimization, curvature-dependent and application driven. The next
section is devoted to second core class of level sets, known as "level
sets with regularizers." In this class, we present four kinds:
clustering-based, Bayesian bidirectional classifier-based, shape-based
and coupled constrained-based. An entire section is dedicated to
optimization and quantification techniques for shape recovery when used
in the level set framework. Finally, the paper concludes with 22
general merits and four demerits on level sets and the future of level
sets in medical image segmentation. We present applications of level
sets to complex shapes like the human cortex acquired via MRI for
neurological image analysis.
|
810. | Ji, LL, and Yan, H, "Loop-free snakes for highly irregular object shapes," PATTERN RECOGNITION LETTERS, vol. 23, pp. 579-591, 2002.
Abstract:
'Snakes' are an effective approach to image segmentation. However,
self-looping is a common problem that can cause segmentation failure of
snakes in the recovery of highly irregular object shapes, such as in
long tube-like shapes, sharp corners or deep concave/convex shapes.
This paper introduces the notion of loop-free snakes that can quickly
and effectively remove all self-loops during their evolution,
consistently deforming and conforming to complicated shapes of target
objects. The proposed snakes are less sensitive to their initial
contour condition, are resilient to their inconsistent parameter
settings in a certain degree and require low computing cost in terms of
both computation time and storage. Experiments are conducted to segment
real images with encouraging results. (C) 2002 Elsevier Science B.V.
All rights reserved.
|
811. | Behiels, G, Maes, F, Vandermeulen, D, and Suetens, P, "Evaluation of image features and search strategies for segmentation of bone structures in radiographs using Active Shape Models," MEDICAL IMAGE ANALYSIS, vol. 6, pp. 47-62, 2002.
Abstract:
In this paper, we evaluate various image features and different search
strategies for fitting Active Shape Models (ASM) to bone object
boundaries in digitized radiographs. The original ASM method
iteratively refines the pose and shape parameters of the point
distribution model driving the ASM by a least squares fit of the shape
to update the target points at the estimated object boundary position,
as determined by a suitable object boundary criterion. We propose an
improved search procedure that is more robust against outlier
configurations in the boundary target points by requiring subsequent
shape changes to be smooth, which is imposed by a smoothness constraint
on the displacement of neighbouring target points at each iteration and
implemented by a minimal cost path approach. We compare the original
ASM search method and our improved search algorithm with a third method
that does not rely on iteratively refined target point positions, but
instead optimizes a global Bayesian objective function derived from
statistical a priori contour shape and image models. Extensive
validation of these methods on a database containing more than 400
images of the femur, humerus and calcaneus using the manual expert
segmentation as ground truth shows that our minimal cost path method is
the most robust. We also evaluate various measures for capturing local
image appearance around each boundary point and conclude that the
Mahalanobis distance applied to normalized image intensity profiles
extracted normal to the shape is the most suitable criterion among the
tested ones for guiding the ASM optimization. (C) 2002 Elsevier Science
B.V. All rights reserved.
|
812. | Shah, J, "Elastica with hinges," JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, vol. 13, pp. 36-43, 2002.
Abstract:
During the past decade, curve evolution has been applied to shape
recovery, shape analysis, image smoothing, and image segmentation.
Almost all of these applications are based on curve evolution which
minimizes the total length of the curve. The curve moves with velocity
proportional to the curvature and hence corners are smoothed out very
rapidly. However, many of the approaches to shape analysis require
corner-preserving presmoothing of shapes. To preserve corners, it is
necessary to consider cost functionals based on curvature rather than
on total length. Classically, such functionals have been applied to
study bending of thin elastic rods called elastica. In this paper, an
implementable formulation based on curvature is developed for smoothing
curves while preserving corners. (C) 2002 Elsevier Science (USA).
|
813. | Sifakis, E, Garcia, C, and Tziritas, G, "Bayesian level sets for image segmentation," JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, vol. 13, pp. 44-64, 2002.
Abstract:
This paper presents a new general framework for image segmentation. A
level set formulation is used to model the boundaries of the image
regions and a new Multilabel Fast Marching is introduced for the
evolution of the region contours toward the se-mentation result.
Statistical tests are performed to yield an initial estimate of
high-confidence subsets of the image regions. Furthermore, the
velocities for the propagation of the region contours are defined in
accordance with the a posteriori probability of the respective regions,
leading to the Bayesian Level Set methodology described in this paper.
Typical segmentation problems are considered and experimental results
are given to illustrate the robustness of the method against noise and
its performance in precise region boundary localization. (C) 2002
Elsevier Science (USA).
|
814. | Jawerth, B, and Lin, P, "Shape recovery by diffusion generated motion," JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, vol. 13, pp. 94-102, 2002.
Abstract:
Diffusion generated motion has been used to generate a variety of
interface motions. In this paper, we present a new shape recovery model
with diffusion generated motion. The approach is based on alternately
diffusing and sharpening the initial region to move the sharp interface
toward the boundaries of the desired objects. The shapes are recovered
by an anisotropic inter-face motion with a local image property
dependent speed. Our algorithm is simple and easy to implement. It
automatically captures topological changes and works for both 2D and 3D
image data. Experimental results for synthetic and real images are
presented. (C) 2002 Elsevier Science (USA).
|
815. | Paragios, N, and Deriche, R, "Geodesic active regions: A new framework to deal with frame partition problems in computer vision," JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, vol. 13, pp. 249-268, 2002.
Abstract:
This paper presents a novel variational framework for dealing with
frame partition problems in computer vision by the propagation of
curves. This framework integrates boundary- and region-based frame
partition modules under a curve-based objective function, which aims at
finding a set of minimal length curves that preserve three main
properties: (i) they are regular and smooth, (ii) they are attracted by
the boundary points (boundary-based information), (iii) and they create
a partition that is optimal according to the expected region properties
of the different hypotheses (region-based information). The defined
objective function is minimized using a gradient descent method.
According to the obtained motion equations, the set of initial curves
is propagated toward the best partition under the influence of
boundary- and region-based forces, and is constrained by a regularity
force. The changes of topology are naturally handled thanks to the
level set implementation. Furthermore, a coupled multiphase propagation
that imposes the idea of mutually exclusive propagating curves and
increases the robustness as well as the convergence rate is proposed.
The proposed framework has been validated using three important
applications in computer vision, the tasks of image and supervised
texture segmentation in low-level vision and the task of motion
estimation and tracking in motion analysis. (C) 2002 Elsevier Science
(USA).
|
816. | Hernandez-Hoyos, M, Orkisz, M, Puech, P, Mansard-Desbleds, C, Douek, P, and Magnin, IE, "Computer-assisted analysis of three-dimensional MR angiograms," RADIOGRAPHICS, vol. 22, pp. 421-436, 2002.
Abstract:
The software tools required for postprocessing of magnetic resonance
(MR) angiograms include, the following functions: data handling, image
visualization, and vascular analysis. A custom postprocessing software
called Magnetic Resonance Angiography Computer Assisted Analysis
(MARACAS) has been developed. This software combines the most commonly
used three-dimensional visualization techniques with image processing
methods for analysis of vascular morphology on MR angiograms. The main
contributions of MARACAS are (a) implementation of a fast method for
stenosis quantification on three-dimensional MR angiograms, which is
clinically applicable in a personal computer-based system; and (b)
portability to the most widespread platforms. The quantification is
performed in three steps: extraction of the vessel centerline,
detection of vessel boundaries in planes locally orthogonal to the
centerline, and calculation of stenosis parameters on the basis of the
resulting contours. Qualitative results from application of the method
to data from patients showed that the vessel centerline correctly
tracked the vessel path and that contours were correctly estimated.
Quantitative results obtained from images of phantoms showed that the
computation of stenosis severity was accurate. (C)RSNA, 2002.
|
817. | Xu, DX, Hwang, JN, and Yuan, C, "Segmentation of multi-channel image with Markov random field based active contour model," JOURNAL OF VLSI SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, vol. 31, pp. 45-55, 2002.
Abstract:
Segmentation is an important research area in image processing and
computer vision. The essential purpose of research work is to achieve
two goals: (i) partition the image into homogeneous regions based on
certain properties, and (ii) accurately track the boundary for each
region. In this study, we will present a novel framework that is
designed to fulfill these requirements. Distinguished from most
existing approaches, our method consists of three steps in the
segmentation processes: global region segmentation, control points
searching and object boundary tracking. In step one, we apply Markov
Random Field (MRF) modeling to multi-channel images and propose a
robust energy minimization approach to solve the multi-dimensional
Markov Random Field. In step two, control points are found along the
target region boundary by using a maximum reliability criterion and
deployed to automatically initialize a Minimum Path Approach (MPA).
Finally, the active contour evolves to the optimal solution in the
fine-tuning process. In this study, we have applied this framework to
color images and multi-contrast weighting magnetic resonance image
data. The experimental results show encouraging performance. Moreover,
the proposed approach also has the potential to deal with topology
changing and composite object problems in boundary tracking.
|
818. | Xue, Z, Li, SZ, and Teoh, EK, "Al-EigenSnake: an affine-invariant deformable contour model for object matching," IMAGE AND VISION COMPUTING, vol. 20, pp. 77-84, 2002.
Abstract:
An affine-invariant (AI) deformable contour model for object matching,
called AI-EigenSnake (AI-ES), is proposed in the Bayesian framework. In
AI-ES, the prior distribution of object shapes is estimated from the
sample data. This distribution is then used to constrain the prototype
contour, which is dynamically adjustable in the matching process. In
this way, large shape deformations due to the variations of samples can
be tolerated. Moreover, an AI internal energy term is introduced to
describe the shape deformations between the prototype contour in the
shape domain and the deformable contour in the image domain.
Experiments based on real object matching demonstrate that the proposed
model is more robust and insensitive to the positions, viewpoints, and
large deformations of object shapes, as compared to the Active Shape
Model and the AI-Snake Model. (C) 2002 Elsevier Science B.V. All rights
reserved.
|
819. | Mamic, G, and Bennamoun, M, "Representation and recognition of 3D free-form objects," DIGITAL SIGNAL PROCESSING, vol. 12, pp. 47-76, 2002.
Abstract:
The problem of 3D object recognition has been one that has perplexed
the computer vision community for the past two decades. This paper
describes and analyzes techniques which have been developed for object
representation and recognition. A set of specifications, which all
object recognition systems should strive to meet, forms the basis upon
which this critical review has been formulated. The literature
indicates that there is a powerful requirement for a precise and
accurate representation, which is simultaneously concise in nature.
Such a representation must be relatively inexpensive and provide a
means for determining the error in the surface fit such that the
effects of error propagation may be analyzed in the system and
appropriate confidence bounds determined in the subsequent pose
estimation. (C) 2002 Elsevier Science (USA).
|
820. | Goto, T, Lee, WS, and Magnenat-Thalmann, N, "Facial feature extraction for quick 3D face modeling," SIGNAL PROCESSING-IMAGE COMMUNICATION, vol. 17, pp. 243-259, 2002.
Abstract:
There are two main processes to create a 3D animatable facial model
from photographs. The first is to extract features such as eyes, nose,
mouth and chin curves on the photographs. The second is to create 3D
individualized facial model using extracted feature information. The
final facial model is expected to have an individualized shape,
photograph-realistic skin color, and animatable structures. Here, we
describe our novel approach to detect features automatically using a
statistical analysis for facial information. We are not only interested
in the location of the features but also the shape of local features.
How to create 3D models from detected features is also explained and
several resulting 3D facial models are illustrated and discussed. (C)
2002 Elsevier Science B.V. All rights reserved.
|
821. | Cheng, DC, Schmidt-Trucksass, A, Cheng, KS, and Burkhardt, H, "Using snakes to detect the intimal and adventitial layers of the common carotid artery wall in sonographic images," COMPUTER METHODS AND PROGRAMS IN BIOMEDICINE, vol. 67, pp. 27-37, 2002.
Abstract:
This study presents an innovative automatic system for detecting the
intima-media complex of the far wall of the common carotid artery by
applying the snake techniques. Cohen's snake was modified and some
criteria were added for our applications. In addition, the oscillating
problem of using snakes was solved by properly choosing the time step
from analysis of the frequency response of the filters. A
time-diminishing gravity window, external forces, and a cost function
assist the snake in selecting the optimal shape of intimal and
adventitia layers. We compared the proposed snake and ziplock snake
with respect to the manual extraction contour. The results show that
the system can automatically detect the intimal and adventitial layers
without any manual correction. (C) 2002 Elsevier Science Ireland Ltd.
All rights reserved.
|
822. | Tabb, K, Davey, N, Adams, R, and George, S, "The recognition and analysis of animate objects using neural networks and active contour models," NEUROCOMPUTING, vol. 43, pp. 145-172, 2002.
Abstract:
In this paper we describe a method for tracking walking humans in the
visual field. Active contour models are used to track moving objects in
a sequence of images. The resulting contours are then encoded in a
scale-, location-, resolution- and control point rotation-invariant
vector. These vectors are used to train and test feedforward
error-backpropagation neural networks, which are able to distinguish
both static and dynamic human objects from other classes of object,
including horses, dogs and inanimate objects, Experimental results are
presented which show the neural network's ability to successfully
categorise objects which have become partially occluded. Classes of
object can be distinguished by the network, and experimental results
are presented which show how the representational vectors used as input
patterns can be used to identify, classify and analyse the temporal
behaviour of pedestrians. (C) 2002 Publishcd by Elsevier Science B,V.
|
823. | Guo, L, Liu, TM, and Han, JW, "Adaptive self-excitation groups in visual curve integration," NEUROCOMPUTING, vol. 43, pp. 277-306, 2002.
Abstract:
To enhance visual curves by neural models, many authors have used a
self-excitation (S-E) neuron group inside which neurons are excitedly
interacted. Typically, an S-E group is immovably arranged as a
subnetwork in which S-E actions are done through the direct excitatory
connections between the neurons. These models are often only fit for
simple and fixed input patterns and have no ability to dynamically
self-organize S-E groups on the basis of external inputs. This article
presents an adaptive S-E model that can dynamically self-organize
various S-E groups according to actual inputs. The significant merit of
our model is that the organization of each S-E group is temporally
separated from the others. As a result, a local neural circuit can be
shared by multiple related S-E groups. This model consists of three
parts, heuristic curve-searching neural structure, time filter, and
accumulation representation. The curve search is realized by random
walks of neural impulses. An S-E group is temporarily constructed via
the instruction of a continuous search trajectory. Different S-E groups
exist temporally separately. S-E action is dependent on synchronous
impulses that are implemented by time filter. The repetitive searches
as a statistical method are to accumulate curve stimuli and cut down
the effects of noise. Finally, many experimental results show that our
dynamic S-E model can work well in noisy images. (C) 2002 Elsevier
Science B.V. All rights reserved.
|
824. | Yang, J, Staib, LH, and Duncan, JS, "Statistical neighbor distance influence in active contours," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION-MICCAI 2002, PT 1, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2488, pp. 588-595, 2002.
Abstract:
In this paper, we propose a new model for segmentation of images
containing multiple objects. In order to take advantage of the
constraining information provided by neighboring objects, we
incorporate information about the relative position and shape of
neighbors into the segmentation process by defining a new "distance"
term into the energy functional. We introduce a representation for
relative neighbor distances, and define a probability distribution over
the variances of the relative neighbor distances of a set of training
images. By minimizing the energy functional, we formulate the model in
terms of level set functions, and compute the associated Euler-Lagrange
equations. The contours evolve both according to the relative distance
information and the image grey level information. Several objects in an
image can be automatically detected simultaneously.
|
825. | Lapeer, RJ, Tan, AC, and Aldridge, R, "Active watersheds: Combining 3D watershed segmentation and active contours to extract abdominal organs from MR images," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION-MICCAI 2002, PT 1, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2488, pp. 596-603, 2002.
Abstract:
The three-dimensional segmentation of regions of interest in medical
images, be it a 2D slice by slice based approach or directly across the
3D dataset, has numerous applications for the medical professional.
These applications may involve something as simple as visualisation up
to more critical tasks such as volume estimation, tissue quantification
and classification, the detection of abnormalities and more. In this
paper we describe a method which aims to combine two of the more
popular segmentation techniques: the watershed segmentation and the
active contour segmentation. Watershed segmentation provides unique
boundaries for a particular image or series of images but does not
easily allow for the discrete nature of the image and the image noise.
Active contours or snakes do possess this generalisation or smoothing
property but are difficult to initialise and usually require to be
close to the boundary of interest to converge. We present a hybrid
approach by segmenting a region of interest (ROI) using a 3D
marker-based watershed algorithm. The resulting ROI's boundaries are
then converted into a contour, using a contour following algorithm
which is explained during the course of the paper. Once the contours
are determined, different parameter settings of internal/external
forces allow the expert user to adapt the initial segmentation. The
approach thus yields a fast initial segmentation from the watershed
algorithm and allows fine-tuning using active contours. Results of the
technique are illustrated on 3D colon, kidney and liver segmentations
from MRI datasets.
|
826. | Yezzi, A, and Tannenbaum, A, "4D active surfaces for cardiac analysis," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION-MICCAI 2002, PT 1, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2488, pp. 667-673, 2002.
Abstract:
In this note, we employ the geometric active contour models formulated
in [5,11,19] for edge detection and segmentation to temporal MR cardiac
images. The method is based on defining feature-based metrics on a
given image which leads to a snake paradigm in which the feature of
interest may be as the steady state of a curvature driven gradient
flow. The implementation of the flow is done without level sets. This
allow us to segment 4D sets directly, i.e., not as a series of 2D
slices or a temporal series of 3D volumes.
|
827. | Hansen, MB, Moller, J, and Togersen, FA, "Bayesian contour detection in a time series of ultrasound images through dynamic deformable template models," BIOSTATISTICS, vol. 3, pp. 213-228, 2002.
Abstract:
Deformable template models and Markov chain Monte Carlo methods are
used for analysing a space-time process of intracoronary ultrasound
images in order to detect the artery contour and various other
characteristics as a function of time.
|
828. | Taton, B, and Lachaud, JO, "Deformable model with non-euclidean metrics," COMPUTER VISION - ECCV 2002 PT III, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2352, pp. 438-452, 2002.
Abstract:
Deformable models like snakes are a classical tool for image
segmentation. Highly deformable models extend them with the ability to
handle dynamic topological changes, and therefore to extract arbitrary
complex shapes. However, the resolution of these models largely depends
on the resolution of the image. As a consequence, their time and memory
complexity increases at least as fast as the size of input data. In
this paper we extend an existing highly deformable model, so that it is
able to locally adapt its resolution with respect to its position. With
this property, a significant precision is achieved in the interesting
parts of the image, while a coarse resolution is maintained elsewhere.
The general idea is to replace the Euclidean metric of the image space
by a deformed non-Euclidean metric, which geometrically expands areas
of interest. With this approach, we obtain a new model that follows the
robust framework of classical deformable models, while offering a
significant independence from both the size of input data and the
geometric complexity of image components.
|
829. | Yu, ZY, and Bajaj, C, "Normalized gradient vector diffusion and image segmentation," COMPUTER VISION - ECCV 2002 PT III, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2352, pp. 517-530, 2002.
Abstract:
In this paper, we present an approach for image segmentation, based on
the existing Active Snake Model and Watershed-based Region Merging. Our
algorithm includes initial segmentation using Normalized Gradient
Vector Diffusion (NGVD) and region merging based on Region Adjacency
Graph (RAG). We use a set of heat diffusion equations to generate a
vector field over the image domain, which provides us with a natural
way to define seeds as well as an external force to attract the active
snakes. Then an initial segmentation of the original image can be
obtained by a similar idea as seen in active snake model. Finally an
RAG-based region merging technique is used to find the true
segmentation as desired. The experimental results show that our
NGVD-based region merging algorithm overcomes some problems as seen in
classic active snake model. We will also see that our NGVD has several
advantages over the traditional gradient vector diffusion.
|
830. | Santos, LM, and du Buf, JMH, "Computational cortical cell models for continuity and texture," BIOLOGICALLY MOTIVATED COMPUTER VISION, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2525, pp. 90-98, 2002.
Abstract:
Area VI and higher areas in the visual cortex contain many feature
extraction engines that serve to build a symbolic image representation.
In this paper we present models of cells that complement a multiscale
line and edge extraction. After reviewing a frontend that comprises
Gabor filters (simple cells), bar and grating cells, we introduce a bar
cell grouping for completing occluded curvilinear structures (snakes),
as well as a grating cell grouping for coding periodic textures with
different complexities.
|
831. | Song, MZ, Haralick, RM, Sheehan, FH, and Johnson, RK, "Integrated surface model optimization for freehand three-dimensional echocardiography," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 21, pp. 1077-1090, 2002.
Abstract:
The major obstacle of three-dimensional (3-D) echocardiography is that
the ultrasound image quality is too low to reliably detect features
locally. Almost all available surface-finding algorithms depend on
decent quality boundaries to get satisfactory surface models. We
formulate the surface model optimization problem in a Bayesian
framework, such that the inference made about a surface model is based
on the integration of both the low-level image evidence and the
high-level prior shape knowledge through a pixel class prediction
mechanism. We model the probability of pixel classes instead of making
explicit decisions about them. Therefore, we avoid the unreliable edge
detection or image segmentation problem and the pixel correspondence
problem. An optimal surface model best explains the observed images
such that the posterior probability of the surface model for the
observed images is maximized. The pixel feature vector as the image
evidence includes several parameters such as the smoothed grayscale
value and the minimal second directional derivative. Statistically, we
describe the feature vector by the pixel appearance probability model
obtained by a nonparametric optimal quantization technique.
Qualitatively, we display the imaging plane intersections of the
optimized surface models together with those of the ground-truth
surfaces reconstructed from manual delineations. Quantitatively, we
measure the projection distance error between the optimized and the
ground-truth surfaces. In our experiment, we use 20 studies to obtain
the probability models offline. The prior shape knowledge is
represented by a catalog of 86 left ventricle surface models. In
another set of 25 test studies, the average epicardial and endocardial
surface projection distance errors are 3.2 +/- 0.85 mm and 2.6 +/- 0.78
mm, respectively.
|
832. | Osareh, A, Mirmehdi, M, Thomas, B, and Markham, R, "Classification and localisation of diabetic-related eye disease," COMPUTER VISION - ECCV 2002, PT IV, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2353, pp. 502-516, 2002.
Abstract:
Retinal exudates are a characteristic feature of many retinal diseases
such as Diabetic Retinopathy. We address the development of a method to
quantitatively diagnose these random yellow patches in colour retinal
images automatically. After a colour normalisation and contrast
enhancement preprocessing step, the colour retinal image is segmented
using Fuzzy C-Means clustering. We then classify the segmented regions
into two disjoint classes, exudates and non-exudates, comparing the
performance of various classifiers. We also locate the optic disk both
to remove it as a candidate region and to measure its boundaries
accurately since it is a significant landmark feature for
ophthalmologists. Three different approaches are reported for optic
disk localisation based on template matching, least squares arc
estimation and snakes. The system could achieve an overall diagnostic
accuracy of 90.1% for identification of the exudate pathologies and
90.7% for optic disk localisation.
|
833. | Borenstein, E, and Ullman, S, "Class-specific, top-down segmentation," COMPUTER VISION - ECCV 2002, PT II, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2351, pp. 109-122, 2002.
Abstract:
In this paper we present a novel class-based segmentation method, which
is guided by a stored representation of the shape of objects within a
general class (such as horse images). The approach is different from
bottom-up segmentation methods that primarily use the continuity of
grey-level, texture, and bounding contours. We show that the method
leads to markedly improved segmentation results and can deal with
significant variation in shape and varying backgrounds. We discuss the
relative merits of class-specific and general image-based segmentation
methods and suggest how they can be usefully combined.
|
834. | Yang, RG, and Zhang, ZY, "Eye gaze correction with stereovision for video-teleconferencing," COMPUTER VISION - ECCV 2002, PT II, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2351, pp. 479-494, 2002.
Abstract:
The lack of eye contact in desktop video teleconferencing substantially
reduces the effectiveness of video contents. While expensive and bulky
hardware is available on the market to correct eye gaze, researchers
have been trying to provide a practical software-based solution to
bring video-teleconferencing one step closer to the mass market. This
paper presents a novel approach that is based on stereo analysis
combined with rich domain knowledge (a personalized face model). This
marriage is mutually beneficial. The personalized face model greatly
improved the accuracy and robustness of the stereo analysis by
substantially reducing the search range; the stereo techniques, using
both feature matching and template matching, allow us to extract 3D
information of objects other than the face and to determine the head
pose in a much more reliable way than if only one camera is used. Thus
we enjoy the versatility of stereo techniques without suffering from
their vulnerability. By emphasizing a 3D description of the scene on
the face part, we synthesize virtual views that maintain eye contact
using graphics hardware. Our current system is able to generate an
eye-gaze corrected video stream at about 5 frames per second on a
commodity PC.
|
835. | Chen, ZK, and Molloi, S, "Vascular tree object segmentation by deskeletonization of valley courses," COMPUTERIZED MEDICAL IMAGING AND GRAPHICS, vol. 26, pp. 419-428, 2002.
Abstract:
In this paper, we propose a valley-course-based image segmentation
technique for tree-like object delineation, as an alternative to the
traditional centerline-based methods. This technique consists of
valley-course extraction, skeleton pruning and deskeletonization.
Valley courses, constructed from valley points that are obtained by
star-pattern scanning over an image, offer a natural manner of
identifying tree skeletons. Unattached segments are removed using
morphological operations. A structured tree is then constructed from
the skeletons by using a tree pruning/spanning algorithm. A fleshy
tree-like object is obtained by a deskeletonization procedure, which
consists of extracting tree boundary in vicinity of the skeletons in
the original image. The tree boundary is determined by identifying
paired edge points at a valley point. A derivative-free edge
identification approach is proposed, which defines an edge point at a
side-slope by a relative intensity drop with respect to the local
background. An empirical formula using a logarithmic function of local
intensity contrast offer's desirable characteristics of adaptability
and stability. The adaptability of edge points to the local background
is attributed to the compression behavior of logarithmic function.
Furthermore, stability to noise is resulted because derivative
operations are not used. The segmentation technique was validated using
coronary angiographic images. (C) 2002 Elsevier Science Ltd. All rights
reserved.
|
836. | Vasilevskiy, A, and Siddiqi, K, "Flux maximizing geometric flows," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 24, pp. 1565-1578, 2002.
Abstract:
Several geometric active contour models have been proposed for
segmentation in computer vision and image analysis. The essential idea
is to evolve a curve (in 2D) or a surface (in 3D) under constraints
from image forces so that it clings to features of interest in an
intensity image. Recent variations on this theme take into account
properties of enclosed regions and allow for multiple curves or
surfaces to be simultaneously represented. However, it is still unclear
how to apply these techniques to images of narrow elongated structures,
such as blood vessels, where intensity contrast may be low and reliable
region statistics cannot be computed. To address this problem, we
derive the gradient flows which maximize the rate of increase of flux
of an appropriate vector field through a curve (in 2D) or a surface (in
3D). The key idea is to exploit the direction of the vector field along
with its magnitude. The calculations lead to a simple and elegant
interpretation which is essentially parameter free and has the same
form in both dimensions. We illustrate its advantages with several
level-set-based segmentations of 2D and 3D angiography images of blood
vessels.
|
837. | Adams, GJ, Simoni, DM, Bordelon, CB, Vick, GW, Kimball, KT, Insull, W, and Morrisett, JD, "Bilateral symmetry of human carotid artery atherosclerosis," STROKE, vol. 33, pp. 2575-2580, 2002.
Abstract:
Background and Purpose-Atherosclerosis is a principal cause of stroke
and myocardial infarction. The carotid arteries provide a site at which
progression of atherosclerosis can be monitored reproducibly and
noninvasively. This study was conducted to determine the similarity of
atherosclerotic plaques in the left and right carotid arteries. This
question was explored with the use of perfusion-fixed cadaveric carotid
arteries and 2 noninvasive clinical imaging techniques, MRI and
electron-beam CT.
Methods-Fifty pairs of carotid arteries from cadaveric donors (aged 48
to 98 years) were imaged with MRI and electron-beam CT. Thirty-eight of
the pairs met the criteria for rigorous analysis. Carotid artery wall
volumes, were measured from the MRI images, and calcification scores
were computed from the electron-beam CT images.
Results-Total wall volumes of the left (972.5 +/- 241.6 mm(3)) and
right (1016.3 +/- 275.0 mm(3)) carotid arteries were moderately
correlated (concordance correlation coefficient [r(c)]=0.71).
Calcification scores were highly correlated, with r(c)=0.95 for the
Agatston scores and r(c)=0.94 for the calcium volume scores.
Conclusions-Total wall volume and plaque calcification in the left and
right human carotid arteries are substantially similar. These results
suggest that atherosclerosis of the human carotid arteries is generally
a bilaterally symmetrical disease. This evidence of symmetry suggests
that diagnostic information about atherosclerotic plaque. in one
carotid artery can be used to infer information about the composition
and volume of atherosclerotic plaque in the contralateral artery.
|
838. | Brinkley, JF, and Rosse, C, "Imaging and the human brain project: A review," METHODS OF INFORMATION IN MEDICINE, vol. 41, pp. 245-260, 2002.
Abstract:
Objectives: Survey current work primarily funded by the US Human Brain
Project (HBP) that involves substantial use of images. Organize this
work around a framework based on the physical organization of the body.
Methods. Painters to individual research efforts were obtained through
the HBP home page as well as personal contacts from HBP annual
meetings. References from these sources were followed to find closely
related work. The individual research efforts were then studied and
characterized.
Results. The subject of the review is the intersection of
neuroinformatics (information about the brain), imaging informatics
(information about images), and structural informatics (information
about the physical structure of the body). Of the 30 funded projects
currently listed on the HBP web site, at least 22 make heavy use at
images. These projects are described in terms of broad categories of
structural imaging functional imaging, and image-based brain
information systems.
Conclusions: Understanding the most complex entity known (the brain)
gives rise to many interesting and difficult problems in informatics
and computer science. Although much progress has been made by HBP and
other neuroinformatics researchers, a great many problems remain that
will require substantial informatics research efforts. Thus, the HPB
can and should be seen as an excellent driving application area for
biomedical informatics research.
|
839. | Kervrann, C, and Trubuil, A, "Optimal level curves and global minimizers of cost functionals in image segmentation," JOURNAL OF MATHEMATICAL IMAGING AND VISION, vol. 17, pp. 153-174, 2002.
Abstract:
We propose a variational framework for determining global minimizers of
rough energy functionals used in image segmentation. Segmentation is
achieved by minimizing an energy model, which is comprised of two
parts: the first part is the interaction between the observed data and
the model, the second is a regularity term. The optimal boundaries are
the curves that globally minimize the energy functional. Our motivation
comes from the observation that energy functionals are traditionally
complex, for which it is usually difficult to precise global minimizers
corresponding to "best" segmentations. Therefore, we focus on basic
energy models, which global minimizers can be characterized. None of
the proposed segmentation models captures all the important scene
variables but may be useful to get an insight into objects, surfaces or
parts of objects in the scene. In this paper, we prove that the set of
curves that minimizes the cost functionals is a subset of level lines,
i.e. the boundaries of level sets of the image. For the completeness of
the paper, we present a fast algorithm for computing partitions with
connected components. It leads to a sound initialization-free algorithm
without any hidden parameter to be tuned. We illustrate the performance
of our algorithm with several examples on both 2D biomedical and aerial
images, and synthetic images.
|
840. | Nguyen, HT, Worring, M, van den Boomgaard, R, and Smeulders, AWM, "Tracking nonparameterized object contours in video," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 11, pp. 1081-1091, 2002.
Abstract:
We propose a new method for contour tracking in video. The inverted
distance transform of the edge map is used as an edge indicator
function for contour detection. Using the concept of topographical
distance, the watershed segmentation can be formulated as a
minimization. This new viewpoint gives a way to combine the results of
the watershed algorithm on different surfaces. In particular, our
algorithm determines the contour as a combination of the current edge
map and the contour, predicted from the tracking result in the previous
frame. We also show that the problem of background clutter can be
relaxed by taking the object motion into account. The compensation with
object motion allows to detect and remove spurious edges in background.
The experimental results confirm the expected advantages of the
proposed method over the existing approaches.
|
841. | Chen, CM, Lu, HHS, and Huang, YS, "Cell-based dual snake model: A new approach to extracting highly winding boundaries in the ultrasound images," ULTRASOUND IN MEDICINE AND BIOLOGY, vol. 28, pp. 1061-1073, 2002.
Abstract:
Two common deficiencies of most conventional deformable models are the
need to place the initial contour very close to the desired boundary
and the incapability of capturing a highly winding boundary for
sonographic boundary extraction. To remedy these two deficiencies, a
new deformable model (namely, the cell-based dual snake model) is
proposed in this paper. The basic idea is to apply the dual snake model
in the cell-based deformation manner. While the dual snake model
provides an effective mechanism allowing a distant initial contour, the
cell-based deformation makes it possible to catch the winding
characteristics of the desired boundary. The performance of the
proposed cell-based dual snake model has been evaluated on synthetic
images with simulated speckles and on the clinical ultrasound (US)
images. The experimental results show that the mean distances from the
derived to the desired boundary points are 0.9 +/- 0.42 pixels and 1.29
+/- 0.39 pixels for the synthetic and the clinical US images,
respectively.
|
842. | Shi, DM, Gunn, SR, and Damper, RI, "Handwritten Chinese character recognition using nonlinear active shape models and the Viterbi algorithm," PATTERN RECOGNITION LETTERS, vol. 23, pp. 1853-1862, 2002.
Abstract:
Since Chinese characters are composed from a small set of fundamental
shapes (radicals) the problem of recognising large numbers of
characters can be converted to that of extracting a small number of
radicals and then finding their optimal combination. In this paper,
radical extraction is carried out by nonlinear active shape models, in
which kernel principal component analysis is employed to capture the
nonlinear variation. Treating Chinese character composition as a
discrete Markov process, we also propose an approach to recognition
with the Viterbi algorithm. Our initial experiments are conducted on
off-line recognition of 430,800 loosely-con strained characters,
comprised of 200 radical categories covering 2154 character categories
from 200 writers. The correct recognition rate is 93.5% characters
correct (writer-independent). Consideration of published figures for
existing radical approaches suggests that our method achieves superior
performance.
(C) 2002 Elsevier Science B.V. All rights reserved.
|
843. | Cheung, KW, Yeung, DY, and Chin, RT, "Bidirectional deformable matching with application to handwritten character extraction," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 24, pp. 1133-1139, 2002.
Abstract:
To achieve integrated segmentation and recognition in complex scenes,
the model-based approach has widely been accepted as a promising
paradigm. However, the performance is still far from satisfactory when
the target object is highly deformed and the level of outlier
contamination is high. In this paper, we first describe two Bayesian
frameworks, one for classifying input patterns and another for
detecting target patterns in complex scenes using deformable models.
Then, we show that the two frameworks are similar to the
forward-reverse setting of Hausdorff matching and that their matching
and discriminating properties are complementary to each other. By
properly combining the two frameworks, we propose a new matching scheme
called bidirectional matching. This combined approach inherits the
advantages of the two Bayesian frameworks. In particular, we have
obtained encouraging empirical results on shape-based pattern
extraction, using a subset of the CEDAR handwriting database containing
handwritten words of highly varying shape.
|
844. | Dormann, D, Libotte, T, Weijer, CJ, and Bretschneider, T, "Simultaneous quantification of cell motility and protein-membrane-association using active contours," CELL MOTILITY AND THE CYTOSKELETON, vol. 52, pp. 221-230, 2002.
Abstract:
We present a new method for the quantification of dynamic changes in
fluorescence intensities at the cell membrane of moving cells. It is
based on an active contour method for cell-edge detection, which allows
tracking of changes in cell shape and position. Fluorescence
intensities at specific cortical subregions can be followed in space
and time and correlated with cell motility. The translocation of two
GFP tagged proteins (CRAC and GRP1) from the cytosol to the membrane in
response to stimulation with the chemoattractant cAMP during chemotaxis
of Dictyostelium cells and studies of the spatio-temporal dynamics of
this process exemplify the method: We show that the translocation can
be correlated with motility parameters and that quantitative
differences in the rate of association and dissociation from the
membrane can be observed for the two PH domain containing proteins. The
analysis of periodic CRAC translocation to the leading edge of a cell
responding to natural cAMP waves in a mound demonstrates the power of
this approach. It is not only capable of tracking the outline of cells
within aggregates in front of a noisy background, but furthermore
allows the construction of spatio-temporal polar plots, capturing the
dynamics of the protein distribution at the cell membrane within the
cells' moving co-ordinate system. Compilation of data by means of
normalised polar plots is suggested as a future tool, which promises
the so-far impossible practicability of extensive statistical studies
and automated comparison of complex spatio-temporal protein
distribution patterns.
|
845. | Kim, J, and Pellacini, F, "Jigsaw image mosaics," ACM TRANSACTIONS ON GRAPHICS, vol. 21, pp. 657-664, 2002.
Abstract:
This paper introduces a new kind of mosaic, called Jigsaw Image Mosaic
(JIM), where image tiles of arbitrary shape are used to compose the
final picture. The generation of a Jigsaw Image Mosaic is a solution to
the following problem: given an arbitrarily-shaped container image and
a set of arbitrarily-shaped image tiles, fill the container as
compactly as possible with tiles of similar color to the container
taken from the input set while optionally deforming them slightly to
achieve a more visually-pleasing effect. We approach the problem by
defining a mosaic as the tile configuration that minimizes a mosaicing
energy function. We introduce a general energy-based framework for
mosaicing problems that extends some of the existing algorithms such as
Photomosaics and Simulated Decorative Mosaics. We also present a fast
algorithm to solve the mosaicing problem at an acceptable computational
cost. We demonstrate the use of our method by applying it to a wide
range of container images and tiles.
|
|
|
2003 |
846. | Perlibakas, V, "Automatical detection of face features and exact face contour," PATTERN RECOGNITION LETTERS, vol. 24, pp. 2977-2985, 2003.
Abstract:
The approach based on the mathematical morphology and the variational
calculus is presented for the detection of an exact face contour in
still grayscale images. The facial features (eyes and lips) are
detected by using the mathematical morphology and the heuristic rules.
Using these features an image is filtered and an edge map is prepared.
The face contour is detected by minimizing its internal and external
energy. The internal energy is defined by the contour tension and the
rigidity. The external energy is defined by using the generalized
gradient vector flow field of the image edge map. Initial contour is
calculated using the detected face features. The contour detection
experiments were performed using the database of 427 face images.
Automatically detected contours were compared with manually labeled
contours using an area and the Euclidean distance-based error measures.
(C) 2003 Elsevier B.V. All rights reserved.
|
847. | Kimia, BB, "On the role of medial geometry in human vision," JOURNAL OF PHYSIOLOGY-PARIS, vol. 97, pp. 155-190, 2003.
Abstract:
A key challenge underlying theories of vision is how the spatially
restricted, retinotopically represented feature analysis can be
integrated to form abstract, coordinate-free object models. A
resolution likely depends on the use of intermediate-level
representations which can on the one hand be populated by local
features and on the other hand be used as atomic units underlying the
formation of. and interaction with, object hypotheses. The precise
structure of this intermediate representation derives from the varied
requirements of a range of visual tasks which motivate a significant
role for incorporating a geometry of visual form. The need to integrate
input from features capturing surface properties such as texture,
shading, motion, color, etc., as well as from features capturing
Surface discontinuities such as Silhouettes, T-junctions, etc., implies
a geometry which captures both regional and boundary aspects. Curves.
as a geometric model of boundaries, have been extensively used as an
intermediate representation in computational. perceptual, and
physiological Studies, while the use of the medial axis (MA) has been
popular mainly in computer vision as a geometric region-based model of
the interior of closed boundaries. We extend the traditional model of
the MA to represent images. where each MA segment represents a region
of the image which we call a visual fragment. We present a unified
theory of perceptual grouping and object recognition where through
various sequences of transformations of the MA representation. visual
fragments are grouped in various configurations to form object
hypotheses, and are related to stored models. The mechanisms underlying
both the computation and the transformation of the MA is a lateral wave
propagation model. Recent psychophysical experiments depicting contrast
sensitivity map peaks at the medial axes of stimuli, and experiments on
perceptual filling-in. and brightness induction Mid modulation. are
consistent with both the use of an MA representation and a
propagation-based scheme. Also, recent neurophysiological recordings in
VI correlate with the MA hypothesis and a horizontal propagation
scheme. This evidence Supports a geometric computational paradigm for
processing sensory data where both dynamic in-plane propagation and
feedforward-feedback connections play an integral role. (C) 2004
Elsevier Ltd. All rights reserved.
|
848. | Wang, JH, Tang, Z, Cao, QP, and Xu, XS, "An elastic net learning algorithm for edge linking of images," IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, vol. E86A, pp. 2879-2886, 2003.
Abstract:
Edge linking is a fundamental computer vision task, yet presents
difficulties arising from the lack of information in the image. Viewed
as a constrained optimization problem, it is NP hard-being isomorphic
to the classical Traveling Salesman Problem. This paper proposes a
gradient ascent learning algorithm of the elastic net approach for edge
linking of images. The learning algorithm has two phases: an elastic
net phase, and a gradient ascent phase. The elastic net phase minimizes
the path through the edge points. The procedure is equivalent to
gradient descent of an energy function, and leads to a local minimum of
energy that represents a good solution to the problem. Once the elastic
net gets stuck in local minima, the gradient ascent phase attempts to
fill up the valley by modifying parameters in a gradient ascent
direction of the energy function. Thus, these two phases are repeated
until the elastic net gets out of local minima and produces the
shortest or better contour through edge points. We test the algorithm
on a set of artificial images devised with the aim of demonstrating the
sort of features that may occur in real images. For all problems; the
systems are shown to be capable of escaping from the elastic net local
minima and producing more meaningful contents than the original elastic
net.
|
849. | Jin, HL, Yezzi, AJ, Tsai, YH, Cheng, LT, and Soatto, S, "Estimation of 3D surface shape and smooth radiance from 2D images: A level set approach," JOURNAL OF SCIENTIFIC COMPUTING, vol. 19, pp. 267-292, 2003.
Abstract:
We cast the problem of shape reconstruction of a scene as the global
region segmentation of a collection of calibrated images. We assume
that the scene is composed of a number of smooth surfaces and a
background, both of which support smooth Lambertian radiance functions.
We formulate the problem in a variational framework, where the solution
(both the shape and radiance of the scene) is a minimizer of a global
cost functional which combines a geometric prior on shape, a smoothness
prior on radiance and a data fitness score. We estimate the shape and
radiance via an alternating minimization: The radiance is computed as
the solutions of partial differential equations defined on the surface
and the background. The shape is estimated using a gradient descent
flow, which is implemented using the level set method. Our algorithm
works for scenes with smooth radiances as well as fine homogeneous
textures, which are known challenges to traditional stereo algorithms
based on local correspondence.
|
850. | Behrad, A, and Motamedi, SA, "Moving target detection and tracking using edge features detection and matching," IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, vol. E86D, pp. 2764-2774, 2003.
Abstract:
A new algorithm for fast detection and tracking of moving targets using
a mobile video camera is presented. Our algorithm is based on image
feature detection and matching. To detect features, we used edge points
and their accumulated curvature. When the features are detected they
are matched with their corresponding points using a new method called
fuzzy-edge based feature matching. The proposed algorithm has two
modes: detection and tracking. In the detection mode, background motion
is estimated and compensated using an affine transformation. The
resultant motion-rectified image is used for detection of the target
location using split and merge algorithm. We also checked other
features for precise detection of the target. When the target is
identified, algorithm switches to the tracking mode, which also has two
phases. In the first phase, the algorithm tracks the target with the
intention to recover the target bounding-box more precisely and when
the target bounding-box is determined precisely, the second phase of
tracking algorithm starts to track the specified target more
accurately. The algorithm has good performance in the environment with
noise and illumination change.
|
851. | Cremers, D, and Schnorr, C, "Statistical shape knowledge in variational motion segmentation," IMAGE AND VISION COMPUTING, vol. 21, pp. 77-86, 2003.
Abstract:
We present a generative approach to model-based motion segmentation by
incorporating a statistical shape prior into a novel variational
segmentation method. The shape prior statistically encodes a training
set of object outlines presented in advance during a training phase.
In a region competition manner the proposed variational approach
maximizes the homogeneity of the motion vector field estimated on a set
of regions, thus evolving the separating discontinuity set. Due to the
shape prior, this discontinuity set is not only sensitive to motion
boundaries but also favors shapes according to the statistical shape
knowledge.
In numerical examples we verify several properties of the proposed
approach: for objects which cannot be easily discriminated from the
background by their appearance, the desired motion segmentation is
obtained, although the corresponding segmentation based on image
intensities fails. The region-based formulation facilitates convergence
of the contour from its initialization over fairly large distances, and
the estimated flow field is progressively improved during the gradient
descent minimization. Due to the shape prior, partial occlusions of the
moving object by 'unfamiliar' objects are ignored, and the evolution of
the motion boundary is effectively restricted to the subspace of
familiar shapes. (C) 2002 Elsevier Science B.V. All rights reserved.
|
852. | Wang, J, Ji, L, and Ma, H, "Reconstruction of deforming aortas in two-photon autofluorescence image sequences," APPLIED OPTICS, vol. 42, pp. 834-844, 2003.
Abstract:
Information loss may occur frequently in the imaging of living tissues
by using two-photon fluorescence microscopy due to the intensive
deformation of the tissue. A landmark-based optical flow interpolation
scheme is proposed for image reconstruction of living aorta walls in
two-photon autofluorescence image sequences. Landmarks are extracted
and evaluated by an active contour-based aorta model, and are aligned
and reconstructed by use of a hierarchical algorithm. The accuracy of
the calculation of optical flow is improved by applying landmark-based
image warping. Experimental results show that the proposed scheme
outperforms commonly used optical flow interpolation techniques for the
reconstruction of intensively deforming tissues. (C) 2003 Optical
Society of America.
|
853. | Chalmoviansky, P, and Juttler, B, "Filling holes in point clouds," MATHEMATICS OF SURFACES, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2768, pp. 196-212, 2003.
Abstract:
Laser scans of real objects produce data sets (point clouds) which may
have holes, due to problems with visibility or with the optical
properties of the surface. We describe a method for detecting and
filling these holes. After detecting the boundary of the hole, we fit
an algebraic surface patch to the neighbourhood and sample auxiliary
points. The method is able to reproduce technically important surfaces,
such as planes, cylinders, and spheres. Moreover, since it avoids the
parameterization problem for scattered data fitting by parametric
surfaces, it can be applied to holes with complicated topology.
|
854. | Cen, F, and Qi, FH, "A new geometric active contour for medical image segmentation," JOURNAL OF INFRARED AND MILLIMETER WAVES, vol. 22, pp. 441-446, 2003.
Abstract:
Generally, the segmentation of a medical image is difficult, because
the medical image is often corrupted by norrupted by noise, and the
anatomical shape in the medical image is complicated. In this paper
presents a new geometric active contour scheme for medical image
segmentation. First, we regularize the attraction force field in the
geometric active contour model to extend the capture range of the
object boundaries, and improve the ability of convergence to the
concavities. Then, using a multi-scale scheme improve the boundary
detection accuracy. In addition, combining the regularization and the
multi-scale method, the proposed scheme can effectively suppress and
eliminate the noise and the spurious edges in the medical images.
Furthermore, the topology of the deforming curve can naturally change
without and special topolygy handing procedures added to the scheme.
This permits synchronously extracting several anatomical structures.
The experiments on some medical images obtained from different medical
imaging methods demonstrate that the proposed approach is competent for
medical image segmentation.
|
855. | Henk, CB, Grampp, S, Backfrieder, W, Liskutin, J, Czerny, C, and Mostbeck, GH, "Automated vessel edge detection in velocity-encoded cine-MR (VEC-MR) flow measurements: a retrospective evaluation in critically ill patients," EUROPEAN JOURNAL OF RADIOLOGY, vol. 48, pp. 274-281, 2003.
Abstract:
Objective: To assess feasibility of automated edge detection in
magnetic resonance (MR) flow calculations in a clinical setting with
critically ill patients. Material and methods: Velocity encoded cine-MR
(VEC-MR) flow measurements cross-sectional area (CSA), mean spatial
velocity (MSV), instantaneous flow (IF), flow (F), 0.5 T Philips, TR
800-800, TE = 8 ms, 30degrees flip angle, FOV 280 mm, 128 x 256 matrix,
temporal resolution 16 time frames/RR, VENC = 120 cm/s) were obtained
in 20 major thoracic human vessels (ascending aorta, main, right and
left pulmonary artery-AAO, MPA, RPA, LPA) of five patients, suffering
from severe chronic thromboembolic pulmonary hypertension (CTEPH). Flow
maps were evaluated by two independent observers using conventional
manual edge detection (INTER m/m). Flow calculations were performed by
one observer using both, manual and automated edge detection (INTRA
m/a), by a second observer using automated edge detection two times
(INTRA a/a) and by two independent observers using automated edge
detection (INTER a/a). Evaluation time was measured. Linear regression
analysis and Student's t-test were performed. Results: Overall
regression coefficients (r(2)) for INTER m/m, INTRA m/a, INTER a/a and
INTRA a/a, respectively, were as follows: CSA, 0.91, 0.91, 0.96, 0.98;
MSV, 0.97, 0.99, 0.99, 0.99; IF, 0.98, 0.99, 0.99, 0.99; F, 0.98, 0.99,
0.99, 0.99. Manual CSA values differed significantly from automated
data in MPA (P = 0.01), RPA (P = 0.0008) and LPA (P = 0.02). No
difference was found for the other assessed parameters of the pulmonary
circulation. Average evaluation time per vessel was 20.2+/-2.6 min for
manual and 2.1+/-0.7 min for automated edge detection (P < 0.00001).
Conclusion: The software program used provided reproducible data, lead
to a 90% reduction in evaluation and calculation time and, therefore,
might excel the utilization of VEC-MR flow measurements. Despite
variations in the evaluation of the pulmonary circulation CSAs, flow
assessment is feasible in critically ill patients. (C) 2003 Elsevier
Science Ireland Ltd. All rights reserved.
|
856. | Nascimento, JC, and Marques, JS, "An adaptive potential for robust shape estimation," IMAGE AND VISION COMPUTING, vol. 21, pp. 1107-1116, 2003.
Abstract:
This paper describes an algorithm for shape estimation in cluttered
scenes. A new image potential is defined based on strokes detected in
the image. The motivation is simple. Feature detectors (e.g. edge
points detectors) produce many outliers, which hamper the performance
of boundary extraction algorithms. To overcome this difficulty we
organize edges in strokes and assign a confidence degree (weight) to
each stroke. The confidence degrees depend on the distance of the
stroke points to the boundary estimates and they are updated during the
estimation process. A deformable model is used to estimate the object
boundary, based on the minimization of an adaptive potential function
which depends on the confidence degree assigned to each stroke.
Therefore, the image potential changes during the estimation process.
Both steps (weight update, energy minimization) are derived as the
solution of a maximum likelihood estimation problem using the EM
algorithm.
Experimental tests are provided to illustrate the performance of the
proposed algorithm. (C) 2003 Elsevier B.V. All rights reserved.
|
857. | Fantoni, C, and Gerbino, W, "Contour interpolation by vector-field combination," JOURNAL OF VISION, vol. 3, pp. 281-303, 2003.
Abstract:
We model the visual interpolation of missing contours by extending
contour fragments under a smoothness constraint. Interpolated
trajectories result from an algorithm that computes the vector sum of
two fields corresponding to different unification factors: the good
continuation (GC) field and the minimal path (MP) field. As the
distance from terminators increases, the GC field decreases and the MP
field increases. Viewer-independent and viewer-dependent variables
modulate GC-MP contrast (i.e., the relative strength of GC and MP
maximum vector magnitudes). Viewer-independent variables include the
local geometry as well as more global properties such as contour
support ratio and shape regularity. Viewer-dependent variables include
the retinal gap between contour endpoints and the retinal orientation
of their stems. GC-MP contrast is the only free parameter of our field
model. In the case of partially occluded angles, interpolated
trajectories become flatter as GC-MP contrast decreases. Once GC-MP
contrast is set to a specific value, derived from empirical measures on
a given configuration, the model predicts all interpolation
trajectories corresponding to different types of occlusion of the same
angle. Model predictions fit psychophysical data on the effects of
viewer-independent and viewer-dependent variables.
|
858. | Gerlich, D, Mattes, J, and Eils, R, "Quantitative motion analysis and visualization of cellular structures," METHODS, vol. 29, pp. 3-13, 2003.
Abstract:
The availability of cellular markers tagged with the green fluorescent
protein (GFP) has recently allowed a large number of cell biological
studies to be carried out in live cells, thereby addressing the dynamic
organization of cellular structures. Typically, microscopes capable of
video recording are used to generate time-resolved data sets. Dynamic
imaging data are complex and often difficult to interpret by pure
visual inspection. Therefore, specialized image processing methods for
object detection, motion estimation, visualization, and quantitation
are required. In this review, we discuss concepts for automated
analysis of multidimensional image data from live cell microscopy and
their application to the dynamics of cell nuclear subcompartments. (C)
2002 Elsevier Science (USA). All rights reserved.
|
859. | Bao, XYR, Lee, HJ, and Quake, SR, "Behavior of complex knots in single DNA molecules," PHYSICAL REVIEW LETTERS, vol. 91, pp. 937-958, 2003.
Abstract:
We used optical tweezers to tie individual DNA molecules in knots.
Although these knots become highly localized under tension, they remain
surprisingly mobile and undergo thermal diffusion with classical random
walk statistics. The diffusion constants of knots with different
complexities correlate with theoretical calculations of knot sizes. We
show that this correlation can be explained by a simple hydrodynamical
model of "self-reptation" of the knot along a polymer.
|
860. | Hintermuller, M, and Ring, W, "A second order shape optimization approach for image segmentation," SIAM JOURNAL ON APPLIED MATHEMATICS, vol. 64, pp. 442-467, 2003.
Abstract:
The problem of segmentation of a given image using the active contour
technique is considered. An abstract calculus to find appropriate speed
functions for active contour models in image segmentation or related
problems based on variational principles is presented. The speed method
from shape sensitivity analysis is used to derive speed functions which
correspond to gradient or Newton-type directions for the underlying
optimization problem. The Newton-type speed function is found by
solving an elliptic problem on the current active contour in every time
step. Numerical experiments comparing the classical gradient method
with Newton's method are presented.
|
861. | Yang, J, and Duncan, JS, "3D image segmentation of deformable objects with shape-appearance joint prior models," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2003, PT 1, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2878, pp. 573-580, 2003.
Abstract:
We propose a novel method for 3D image segmentation, where a Bayesian
formulation, based on joint prior knowledge of the shape and the image
gray levels, along with information derived from the input image, is
employed. Our method is motivated by the observation that the shape of
the object and the gray level variation in an image have consistent
relations that provide configurations and context that aid in
segmentation. We define a Maximum A Posteriori(MAP) estimation model
using the joint prior information of the shape and image gray levels to
realize image segmentation. We introduce a representation for the joint
density function of the object and the image gray level values, and
define joint probability distribution over the variations of object
shape and the gray levels contained in a set of training images. By
estimating the MAP shape of the object, we formulate the
shape-appearance model in terms of level set function as opposed to
landmark points of the shape. We found the algorithm to be robust to
noise, able to handle multidimensional data, and avoiding the need for
point correspondences during the training phase. Results and validation
from various experiments on 2D/3D medical images are demonstrated.
|
862. | Labruyere, E, Zimmer, C, Galy, V, Olivo-Marin, JC, and Guillen, N, "EhPAK, a member of the p21-activated kinase family, is involved in the control of Entamoeba histolytica migration and phagocytosis," JOURNAL OF CELL SCIENCE, vol. 116, pp. 61-71, 2003.
Abstract:
Entamoeba histolytica migration is essential for the development of
amoebiasis, a human disease characterised by invasion and destruction
of tissues. Amoebic motility requires both polarisation of the cell and
formation of a predominant pseudopod. As p21-activated kinases PAKs are
known to regulate eukaryotic cell motility and morphology, we
investigated the role of PAK in E. histolytica. We showed that the
C-terminal domain of EhPAK comprised a constitutive kinase activity in
vitro and that overproduction of this fragment, in E. histolytica,
caused a significant reduction in amoeboid migration, as measured by
dynamic image analysis, indicating an involvement of EhPAK in this
process. A dramatic loss of polarity, as indicated by the increased
number of membrane extensions all around E. histolytica, was also
observed, suggesting that the N-terminal domain of EhPAK was necessary
for maintenance of cell polarity. To support this view, we showed that
despite the absence of the consensus motif to bind to Rac and Cdc42,
the N-terminal domain of EhPAK bound to Rac1, suggesting that the
N-terminal region was a regulatory domain. In addition, we also found
an increased rate of human red blood cell phagocytosis, suggesting for
the first time an active role for a PAK protein in this process. Taking
together, the results suggest strongly that EhPAK is a key regulatory
element in polarity, motility and phagocytosis of E. histolytica.
|
863. | Zhang, ZX, and Braun, M, "Smoothness-based forces for deformable models: a long-range force and a corner fitting force," COMPUTERS IN BIOLOGY AND MEDICINE, vol. 33, pp. 91-112, 2003.
Abstract:
Deformable models, originally proposed by Terzopoulos et al. (Artif.
Intell. 36 (1988) 91) and Kass et al. (Int. J. Comput. Vision 1 (1988)
321) in 1988, have been widely used in medical image segmentation.
However, they manifest two well-known limitations: the lack of an
appropriate long-range force to drive the model surface towards the
object boundary and poor performance at high curvature boundaries (such
as corners) due to the models' intrinsic smoothness constraint. In this
paper, a new smoothness force with local control is proposed. The local
control is used to devise a long-range force, referred to as the
self-zoom force, and a corner fitting force. The self-zoom force
enables the model surface to expand and shrink without a limit in
range. The corner fitting force propels the model surface to fit
high-curvature boundaries. Experiments demonstrate that the model
surface is driven to the object boundary by the new forces even if the
initial estimate is not close and the object is nonconvex or has a high
local curvature. (C) 2002 Elsevier Science Ltd. All rights reserved.
|
864. | Cao, F, "Geometric curve evolution and image processing - Preface," GEOMETRIC CURVE EVOLUTION AND IMAGE PROCESSING, LECTURE NOTES IN MATHEMATICS, vol. 1805, pp. V-+, 2003.
Abstract:
Reliable and efficient optic disk localization and segmentation are
important tasks in automated retinal screening. General-purpose edge
detection algorithms often fail to segment the optic disk due to fuzzy
boundaries, inconsistent image contrast or missing edge features. This
paper presents an algorithm for the localization and segmentation of
the optic nerve head boundary in low-resolution images (about 20
mu/pixel). Optic disk localization is achieved using specialized
template matching, and segmentation by a deformable contour model. The
latter uses a global elliptical model and a local deformable model with
variable edge-strength dependent stiffness. The algorithm is evaluated
against a randomly selected database of 100 images from a diabetic
screening programme. Ten images were classified as unusable; the others
were of variable quality. The localization algorithm succeeded on all
bar one usable image; the contour estimation algorithm was
qualitatively assessed by an ophthalmologist as having Excellent-Fair
performance in 83% of cases, and performs well even on blurred images.
|
865. | Montagnat, J, Sermesant, M, Delingette, H, Malandain, G, and Ayache, N, "Anisotropic filtering for model-based segmentation of 4D cylindrical echocardiographic images," PATTERN RECOGNITION LETTERS, vol. 24, pp. 815-828, 2003.
Abstract:
This paper presents a 4D (3D + time) echocardiographic image
anisotropic filtering and a 3D model-based segmentation system. To
improve the extraction of left ventricle boundaries, we rely on two
preprocessing stages. First, we apply an anisotropic filter that
reduces image noise. This 4D filter takes into account the spatial and
temporal nature of echocardiographic images. Second, we adapt the usual
gradient filter estimation to the cylindrical geometry of the 3D
ultrasound images. The reconstruction of the endocardium takes place by
deforming a deformable simplex mesh having an a priori knowledge of
left ventricle shape and that is guided by a region-based data
attraction force. The external force formulation improves the
segmentation robustness against noise and outliers. We illustrate our
method by showing experimental results on very challenging sparse and
noisy ultrasound images of the heart and by computing quantitative
measurements of the left ventricle volume. (C) 2002 Elsevier Science
B.V. All rights reserved.
|
866. | Qatarneh, SM, Noz, ME, Hyodynmaa, S, Maguire, GQ, Kramer, EL, and Crafoord, J, "Evaluation of a segmentation procedure to delineate organs for use in construction of a radiation therapy planning atlas," INTERNATIONAL JOURNAL OF MEDICAL INFORMATICS, vol. 69, pp. 39-55, 2003.
Abstract:
Objectives: This paper evaluates a semi-automatic segmentation
procedure to enhance utilizing atlas based treatment plans. For this
application, it is crucial to provide a collection of 'reference'
organs, restorable from the atlas so that they closely match those of
the current patient. To enable assembling representative organs, we
developed a semiautomatic procedure using an active contour method.
Method: The 3D organ volume was identified by defining contours on
individual slices. The initial organ contours were matched to patient
volume data sets and then superimposed on them. These starting contours
were then adjusted and refined to rapidly find the organ outline of the
given patient. Performance was evaluated by contouring organs of
different size, shape complexity, and proximity to surrounding
structures. We used representative organs defined on CT volumes
obtained from 12 patients and compared the resulting outlines to those
drawn by a radiologist. Results: A strong correlation was found between
the area measures of the delineated liver (r = 0.992), lung (r = 0.996)
and spinal cord (r = 0.81), obtained by both segmentation techniques. A
paired Student's t-test showed no statistical difference between the
two techniques regarding the liver and spinal cord (p > 0.05).
Conclusion: This method could be used to form 'standard' organs, which
would form part of a whole body atlas (WBA) database for radiation
treatment plans as well as to match atlas organs to new patient data.
(C) 2002 Elsevier Science Ireland Ltd. All rights reserved.
|
867. | Ho, GHP, and Shi, PC, "Boundary finding with curve embedding potential field," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2003, PT 2, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2879, pp. 721-729, 2003.
Abstract:
We introduce an implicit vector field representation for arbitrary
number of closed curves in space. Each curve-defining vector of the
Curve Embedding Potential Field (CEPF) is defined to be perpendicular
to the nearest curve, with its magnitude determined by its distance to
that curve. Thereafter, we present an image segmentation strategy
through the detection of the CEPF distortion caused by vector-form
image data constraints. The CEPF-based method allows grid-free
localization of curve elements at any detection stage, while
maintaining the advantages of being geometric in nature. Unlike the
level set methods, the evolution of the embedded curves is not
constrained in any particular directions, and the implementation is
straightforward. We discuss the accuracy and robustness of the
algorithms under different noise conditions, and present segmentation
results of various medical images, including MRI, ultrasound, and
mammogram. (1)
|
868. | Heizmann, M, and Leon, FP, "Imaging and analysis of forensic striation marks," OPTICAL ENGINEERING, vol. 42, pp. 3423-3432, 2003.
Abstract:
We present a new image processing strategy that enables an automated
comparison of striation patterns. A signal model is introduced to
describe the interesting features of forensically relevant striation
marks. To provide a high image quality, several images of the same
surface area are recorded under systematically varying conditions and
then combined for an improved result by means of data fusion
techniques. Based on the signal model, the signal of interest is
concentrated, and a compact representation of the marks is obtained. To
enable an efficient description of the relevant features, even in the
cases of deformed surfaces or curved striation marks, a straightening
of the grooves is performed beforehand. Following, a meaningful
"signature" describing the information of interest is extracted using
the whole length of the grooves. This signature is used for an
objective evaluation of similarity of the striation patterns. (C) 2003
Society of Photo-Optical Instrumentation Engineers.
|
869. | Chung, R, and Wong, HS, "Polyhedral object localization in an image by referencing to a single model view," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 51, pp. 139-163, 2003.
Abstract:
Identifying a three-dimensional (3D) object in an image is
traditionally dealt with by referencing to a 3D model of the object. In
the last few years there has been a growing interest of using not a 3D
shape but multiple views of the object as the reference. This paper
attempts a further step in the direction, using not multiple views but
a single clean view as the reference model. The key issue is how to
establish correspondences from the model view where the boundary of the
object is explicitly available, to the scene view where the object can
be surrounded by various distracting entities and its boundary
disturbed by noise. We propose a solution to the problem, which is
based upon a mechanism of predicting correspondences from just four
particular initial point correspondences. The object is required to be
polyhedral or near-polyhedral. The correspondence mechanism has a
computational complexity linear with respect to the total number of
visible corners of the object in the model view. The limitation of the
mechanism is also analyzed thoroughly in this paper. Experimental
results over real images are presented to illustrate the performance of
the proposed solution.
|
870. | Chang, JS, Kim, EY, and Kim, HJ, "Face detection with active contours using color information," CURRENT TOPICS IN ARTIFICIAL INTELLIGENCE, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3040, pp. 334-343, 2003.
Abstract:
This paper proposes a method for detecting facial regions in complex
environments. To obtain accurate facial boundaries, active contours are
used. In the active contour model, a contour is presented by zero level
set of level function phi, and evolved via level set partial
differential equations. The advantages of the proposed method include
1) the robustness to noise, 2) accurate detection regions of multiple
face with various viewpoints and sizes. To assess the effectiveness of
the proposed method, it was tested with several natural scenes, and the
results are compared with these of geometric active contours.
Experimental results show the effectiveness of the proposed method.
|
871. | Wang, JK, and Li, XB, "A content-guided searching algorithm for balloons," PATTERN RECOGNITION, vol. 36, pp. 205-215, 2003.
Abstract:
Cohen and Cohen's balloon model improves the original active contour
models by providing an ability to search for distant contours. Driven
by an artificial inflating force, a balloon's searching ability is
rather primitive. In previous papers, we have presented several new
models that incorporate different cues in their searching algorithm. In
this paper, we present a new method that uses local image contents to
guide a balloon's searching process. Sha'ashua and Ullman's saliency
map method is used to trace the strongest curve that passes through a
particular pixel. This locally-derived information is then used to
guide a balloon's searching process. Benefiting from both a global
model and locally derived cues, the combined model is faster and more
robust than the original balloon model. (C) 2002 Pattern Recognition
Society. Published by Elsevier Science Ltd. All rights reserved.
|
872. | Giraldi, G, Strauss, E, and Oliveira, A, "Dual-T-Snakes model for medical imaging segmentation," PATTERN RECOGNITION LETTERS, vol. 24, pp. 993-1003, 2003.
Abstract:
The Dual-T-Snakes model plus dynamic programming (DP) techniques is a
powerful methodology for boundary extraction and segmentation of 2D
images. However, the original Dual-T-Snakes is not efficient for noisy
images due to nonconvexity problems. In this paper we improve the model
through multigrid and region growing methods to get more robustness
against local minima. Besides, we demonstrate the advantage of using
pass-band filtering methods and a fuzzy segmentation technique plus
Dual-T-Snakes. We test these methods for artificial and cell images.
(C) 2002 Elsevier Science B.V. All rights reserved.
|
873. | Geiger, D, Liu, TL, and Kohn, RV, "Representation and self-similarity of shapes," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 25, pp. 86-99, 2003.
Abstract:
Representing shapes in a compact and informative form is a significant
problem for vision systems that must recognize or classify objects. We
describe a compact representation model for two-dimensional (2D) shapes
by investigating their self-similarities and constructing their shape
axis trees (SA-trees). Our approach can be formulated as a variational
one (or, equivalently, as MAP estimation of a Markov random field). We
start with a 2D shape, its boundary contour, and two different
parameterizations for the contour (one parameterization is oriented
counterclockwise and the other clockwise). To measure its
self-similarity, the two parameterizations are matched to derive the
best set of one-to-one point-to-point correspondences along the
contour. The cost functional used in the matching may vary and is
determined by the adopted self-similarity criteria, e.g.,
cocircularity, distance variation, parallelism, and region homogeneity.
The loci of middle points of the pairing contour points yield the shape
axis and they can be grouped into a unique free tree structure, the
SA-tree. By implicitly encoding the (local and global) shape
information into an SA-tree, a variety of vision tasks, e.g., shape
recognition, comparison, and retrieval, can be performed in a more
robust and efficient way via various tree-based algorithms. A dynamic
programming algorithm gives the optimal solution in O(N-4), where N is
the size of the contour.
|
874. | Sebastian, TB, Tek, H, Crisco, JJ, and Kimia, BB, "Segmentation of carpal bones from CT images using skeletally coupled deformable models," MEDICAL IMAGE ANALYSIS, vol. 7, pp. 21-45, 2003.
Abstract:
The in vivo investigation of joint kinematics in normal and injured
wrist requires the segmentation of carpal bones from 3D (CT) images,
and their registration over time. The non-uniformity of bone tissue,
ranging from dense cortical bone to textured spongy bone, the irregular
shape of closely packed carpal bones, small inter-bone spaces compared
to the resolution of CT images, along with the presence of blood
vessels, and the inherent blurring of CT imaging render the
segmentation of carpal bones a challenging task. We review the
performance of statistical classification, deformable models (active
contours), region growing, region competition, and morphological
operations for this application. We then propose a model which combines
several of these approaches in a unified framework. Specifically, our
approach is to use a curve evolution implementation of region growing
from initialized seeds, where growth is modulated by a
skeletally-mediated competition between neighboring regions. The
inter-seed skeleton, which we interpret as the predicted boundary of
collision between two regions, is used to couple the growth of seeds
and to mediate long-range; competition between them. The implementation
requires subpixel representations of each growing region as well as the
inter-region skeleton. This method combines the advantages of active
contour models, region growing, and both local and global region
competition methods. We demonstrate the effectiveness of this approach
for our application where many of the difficulties presented above are
overcome as illustrated by synthetic and real examples. Since this
segmentation method does not rely on domain-specific knowledge, it
should be applicable to a range of other medical imaging segmentation
tasks. (C) 2002 Published by Elsevier Science B.V.
|
875. | Giachetti, A, Tuveri, M, and Zanetti, G, "Reconstruction and web distribution of measurable arterial models," MEDICAL IMAGE ANALYSIS, vol. 7, pp. 79-93, 2003.
Abstract:
In this paper a novel framework for the segmentation, 31)
reconstruction and web distribution of vessel structures specifically
tailored to the assessment of abdominal aortic aneurysms for
endovascular surgery planning is presented. Deformable models are used
for segmentation, while VRML97 and ECMA scripting are used to obtain
models that are not only viewable from any VRML97 enabled browser, but
that also allow users to perform, directly from standard web browsers,
guided measurements of geometrical parameters, relevant to surgical
planning. (C) 2002 Published by Elsevier Science B.V.
|
876. | Sebastian, TB, Klein, PN, and Kimia, BB, "On aligning curves," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 25, pp. 116-125, 2003.
Abstract:
We present a novel approach to finding a correspondence (alignment)
between two curves. The correspondence is based on a notion of an
alignment curve which treats both curves symmetrically. We then define
a similarity metric based on the alignment curve using two intrinsic
properties of the curve, namely, length and curvature. The optimal
correspondence is found by an efficient dynamic-programming method both
for aligning pairs of curve segments and pairs of closed curves, and is
effective in the presence of a variety of transformations of the curve.
Finally, the correspondence is shown in application to handwritten
character recognition, prototype formation, and object recognition, and
is potentially useful in other applications such as registration and
tracking.
|
877. | Velasco, FA, and Marroquin, JL, "Growing snakes: active contours for complex topologies," PATTERN RECOGNITION, vol. 36, pp. 475-482, 2003.
Abstract:
Snakes are active contours that minimize an energy function. In this
paper we introduce a new kind of snakes, called growing snakes. These
snakes are modeled as a set of particles connected by thin rods. Unlike
the traditional snakes, growing snakes are automatically initialized,
They start at the position where the gradient magnitude of an image is
largest, and start to grow, looking for zones of high gradient
magnitude; simultaneously the associated energy function is minimized.
Growing snakes can find contours with complex topology, describing
holes, occlusions, separate objects and bifurcations. In a post-process
the T-junctions are refined looking for the configuration with minimal
energy. We also describe a technique that permits one to regularize the
field of external forces that act on the Growing Snakes, which allow
them to have good performance, even in the case of images with high
levels of noise. Finally. we present results in synthetic and real
images. (C) 2002 Pattern Recognition Society. Published by Elsevier
Science Ltd. All rights reserved.
|
878. | Gee, A, Prager, R, Treece, G, and Berman, L, "Engineering a freehand 3D ultrasound system," PATTERN RECOGNITION LETTERS, vol. 24, pp. 757-777, 2003.
Abstract:
This article surveys current techniques for the acquisition,
visualisation and quantitative analysis of three-dimensional ultrasound
data. Particular attention is paid to the design and implementation of
freehand systems. The extensive bibliography includes references to a
wide range of clinical applications. (C) 2002 Elsevier Science B.V. All
rights reserved.
|
879. | Chen, CM, Lu, HHS, and Chen, YL, "A discrete region competition approach incorporating weak edge enhancement for ultrasound image segmentation," PATTERN RECOGNITION LETTERS, vol. 24, pp. 693-704, 2003.
Abstract:
Ultrasound images are inherently difficult to analyze due to their echo
texture, speckle noise and weak edges. Taking into account these
characteristics, we present a new region-based approach for ultrasound
image segmentation. It is composed of two primary algorithms, discrete
region competition and weak edge enhancement. The discrete region
competition features four techniques, region competition, statistical
modeling of speckle, early vision modeling, and discrete concepts. In
addition, to prevent regions from leaking out of the desired area
across weak edges, edges located on the slowly varying slope are
enhanced according to their position on the slope and the length of the
slope. This new approach has been implemented and verified on clinical
ultrasound images. (C) 2002 Elsevier Science B.V. All rights reserved.
|
880. | Zaritsky, R, Peterfreund, N, and Shimkin, N, "Velocity-guided tracking of deformable contours in three dimensional space," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 51, pp. 219-238, 2003.
Abstract:
This paper presents a 3D active contour model for boundary detection
and tracking of non-rigid objects, which applies stereo vision and
motion analysis to the class of energy-minimizing deformable contour
models, known as snakes. The proposed contour evolves in
three-dimensional space in reaction to a 3D potential function, which
is derived by projecting the contour onto the 2D stereo images. The
potential function is augmented by a kinetic term, which is related to
the velocity field along the contour. This term is used to guide the
inter-image contour displacement. The incorporation of inter-frame
velocity estimates in the tracking algorithm is especially important
for contours which evolve in 3D space, where the added freedom of
motion can easily result in loss of tracking. The proposed scheme
incorporates local velocity information seamlessly in the snake model,
with little computational overhead, and does not require exogenous
computation of the optical flow or related quantities in each image.
The resulting algorithm is shown to provide good tracking performance
with only one iteration per frame, which provides a considerable
advantage for real time operation.
|
881. | Shi, D, Gunn, SR, and Damper, RI, "Handwritten Chinese radical recognition using nonlinear active shape models," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 25, pp. 277-280, 2003.
Abstract:
Handwritten Chinese characters can be recognized by first extracting
the basic shapes (radicals) of which they are composed. Radicals are
described by nonlinear active shape models and optimal parameters found
using the chamfer distance transform and a dynamic tunneling algorithm.
The radical recognition rate is 96.5 percent correct
(writer-independent) on 280,000 characters containing 98 radical
classes.
|
882. | Nguyen, HT, Worring, M, and van den Boomgaard, R, "Watersnakes: Energy-driven watershed segmentation," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 25, pp. 330-342, 2003.
Abstract:
The watershed algorithm from mathematical morphology is powerful for
segmentation. However, it does not allow incorporation of a priori
information as segmentation methods that are based on energy
minimization. In particular, there is no control of the smoothness of
the segmentation result. In this paper, we show how to represent
watershed segmentation as an energy minimization problem using the
distance-based definition of the watershed line. A priori
considerations about smoothness can then be imposed by adding the
contour length to the energy function. This leads to a new segmentation
method called watersnakes, integrating the strengths of watershed
segmentation and energy based segmentation. Experimental results show
that, when the original watershed segmentation has noisy boundaries or
wrong limbs attached to the object of interest, the proposed method
overcomes those drawbacks and yields a better segmentation.
|
883. | Santarelli, MF, Positano, V, Michelassi, C, Lombardi, M, and Landini, L, "Automated cardiac MR image segmentation: theory and measurement evaluation," MEDICAL ENGINEERING & PHYSICS, vol. 25, pp. 149-159, 2003.
Abstract:
We present a new approach to magnetic resonance image segmentation with
a Gradient-Vector-Flow-based snake applied to selective smoothing
filtered images. The system also allows automated image segmentation in
the presence of grey scale inhomogeneity, as in cardiac Magnetic
Resonance imaging. Removal of such inhomogeneities is a difficult task,
but we proved that using non-linear anisotropic diffusion filtering,
myocardium edges are selectively preserved. The approach allowed
medical data to be automatically segmented in order to track not only
endocardium, which is usually a less difficult task, but also
epicardium in anatomic and perfusion studies with Magnetic Resonance.
The method developed proceeds in three distinct phases: (a) an
anisotropic diffusion filtering tool is used to reduce grey scale
inhomogeneity and to selectively preserve edges; (b) a
Gradient-Vector-Flow-based snake is applied on filtered images to allow
capturing a snake from a long range and to move into concave boundary
regions; and (c) an automatic procedure based on a snake is used to fit
both endocardium and epicardium borders in a multiphase, multislice
examination. A good agreement (P < 0.001) between manual and automatic
data analysis, based on the mean difference+/-SD, was assessed in a
pool of 907 cardiac function and perfusion images. (C) 2002 IPEM.
Published by Elsevier Science Ltd. All rights reserved.
|
884. | Maddah, M, Afzali-Kusha, A, and Soltanian-Zadeh, H, "Efficient center-line extraction for quantification of vessels in confocal microscopy images," MEDICAL PHYSICS, vol. 30, pp. 204-211, 2003.
Abstract:
In this paper we present a novel method for the three-dimensional (3-D)
centerline extraction of elongated objects such as vessels. This method
combines the basic ideas in distance transform-based, thinning, and
path planning methods to extract thin and connected centerlines. This
efficient approach needs no user interaction or any prior knowledge of
the object shape. We used the path planning approach, which has
exclusively been used in the virtual endoscopy or robotics, to obtain
the medial curve of the objects. To make our approach fully automated,
a distance transform mapping is used to identify the end points of the
object branches. The initial paths are also constructed on the surface
of the object, traversing the same distance map. Then a thinning
algorithm centralizes the paths. The proposed approach is especially
efficient for centerline extraction of the complex branching
structures. The method has been applied on the confocal microscopy
images of rat brains and the results confirm its efficiency in
extracting the medial curve of vessels, essential for the computation
of quantitative parameters. (C) 2003 American Association of Physicists
in Medicine.
|
885. | Roy, S, Arsenault, HH, and Lefebvre, D, "Invariant object recognition under three-dimensional rotations and changes of scale," OPTICAL ENGINEERING, vol. 42, pp. 813-821, 2003.
Abstract:
Research on object recognition invariant under out-of-plane rotations
has so far yielded limited results. The problem becomes even more
complex when in addition scale changes must also be taken into account.
We develop a new object recognition method invariant to translations,
rotations, changes of pose, and scale. The method is based on angular
wedge sampling about the centroid of the object, yielding translation-,
rotation-, and scale-invariant features: A modified feature space
trajectory classifier is used to obtain out-of-plane rotation
invariance. The method is successfully tested on models of military
land vehicles and is optically implementable. (C) 2003 society of
Photo-optical Instrumentation Engineers.
|
886. | Valdes-Cristerna, R, and Yanez-Suarez, O, "Active contours and surfaces with cubic splines for semiautomatic tracheal segmentation," JOURNAL OF ELECTRONIC IMAGING, vol. 12, pp. 81-96, 2003.
Abstract:
Signs and symptoms of tracheal stenosis can create confusion about the
etiology of the problem. While bronchoscopy is the diagnostic method of
choice to evaluate the extension and localization of the lesion, the
use of x-ray computed axial tomography (CAT) images has also been
considered. Recent works on airway segmentation in CAT images propose
the extensive use of automatic segmentation techniques based on 3-D
region growing. This technique is computationally expensive and thus
alternative analysis procedures are still under development. We present
a segmentation method constructed over an active surface model based on
cubic splines interpolation. The 3-D rendering of the upper-airway path
segmented from neck and thorax CAT scans using the proposed method is
validated in regard to its possible use as a diagnostic tool for the
characterization of tracheal stenosis. The results presented relative
to the performance of the model, both on synthetic and real CAT scan
volumes, indicate that the proposed procedure improves over the
reference active model methods. (C) 2003 SPIE and IST.
|
887. | Ray, N, Acton, ST, Altes, T, de Lange, EE, and Brookeman, JR, "Merging parametric active contours within homogeneous image regions for MRI-based lung segmentation," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 22, pp. 189-199, 2003.
Abstract:
Inhaled hyperpolarized helium-3 (He-3) gas is a new magnetic resonance
(MR) contrast agent that is being used to study lung functionality. To
evaluate the total lung ventilation from the hyperpolarized He-3 MR
images, it is necessary to segment the lung cavities. This is difficult
to accomplish using only the hyperpolarized He-3 MR images, so
traditional proton (H-1) MR images are frequently obtained concurrent
with the hyperpolarized He-3 MR examination. Segmentation of the lung
cavities from traditional proton (H-1) MRI is a necessary first step in
the analysis of hyperpolarized He-3 MR images. In this paper, we
develop an active contour model that provides a smooth boundary and
accurately, captures the high curvature features of the lung cavities
from the H-3 MR images. This segmentation method is the first
parametric active contour model that facilitates straightforward
merging of multiple contours. The proposed method of merging computes
an external force field that is based on the solution of partial
differential equations with boundary condition defined by the initial
positions of the evolving contours. A theoretical connection with fluid
flow in porous media and the proposed force field is established. Then
by using the properties of fluid flow we prove that the proposed method
indeed achieves merging and the contours stop at the object boundary as
well. Experimental results involving merging in synthetic images are
provided. The segmentation technique has been employed in lung H-1 MR
imaging for segmenting the total lung air space. This technology plays
a key role in computing the functional air space from MR images that
use hyperpolarized He-3 gas as a contrast agent.
|
888. | Bredno, J, Lehmann, TM, and Spitzer, K, "A general discrete contour model in two, three, and four dimensions for topology-adaptive multichannel segmentation," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 25, pp. 550-563, 2003.
Abstract:
We present a discrete contour model for the segmentation of image data
with any dimension of image domain and value range. The model consists
of a representation using simplex meshes and a mechanical formulation
of influences that drive an iterative segmentation. The object's
representation as well as the influences are valid for any dimension of
the image domain. The image influences introduced here, can combine
information from independent channels of higher-dimensional value
ranges. Additionally, the topology of the model automatically adapts to
objects contained in images. Noncontextual tests have validated the
ability of the model to reproducibly delineate synthetic objects. In
particular, images with a signal to noise ratio of SNR < 0.5 are
delineated within two pixels of their ground truth contour. Contextual
validations have shown the applicability of the model for medical image
analysis in image domains of two, three, and four dimensions in single
as well as multichannel value ranges.
|
889. | Li, YM, Gong, SG, and Liddell, H, "Constructing facial identity surfaces for recognition," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 53, pp. 71-92, 2003.
Abstract:
We present a novel approach to face recognition by constructing facial
identity structures across views and over time, referred to as identity
surfaces, in a Kernel Discriminant Analysis (KDA) feature space. This
approach is aimed at addressing three challenging problems in face
recognition: modelling faces across multiple views, extracting
non-linear discriminatory features, and recognising faces over time.
First, a multi-view face model is designed which can be automatically
fitted to face images and sequences to extract the normalised facial
texture patterns. This model is capable of dealing with faces with
large pose variation. Second, KDA is developed to compute the most
significant non-linear basis vectors with the intention of maximising
the between-class variance and minimising the within-class variance. We
applied KDA to the problem of multi-view face recognition, and a
significant improvement has been achieved in reliability and accuracy.
Third, identity surfaces are constructed in a pose-parameterised
discriminatory feature space. Dynamic face recognition is then
performed by matching the object trajectory computed from a video input
and model trajectories constructed on the identity surfaces. These two
types of trajectories encode the spatio-temporal dynamics of moving
faces.
|
890. | Yezzi, A, and Soatto, S, "Stereoscopic segmentation," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 53, pp. 31-43, 2003.
Abstract:
We cast the problem of multiframe stereo reconstruction of a smooth
surface as the global region segmentation of a collection of images of
the scene. Dually, the problem of segmenting multiple calibrated images
of an object becomes that of estimating the solid shape that gives rise
to such images. We assume that the radiance of the scene results in
piecewise homogeneous image statistics. This simplifying assumption
covers Lambertian scenes with constant albedo as well as fine
homogeneous textures, which are known challenges to stereo algorithms
based on local correspondence. We pose the segmentation problem within
a variational framework, and use fast level set methods to find the
optimal solution numerically. Our algorithm does not work in the
presence of strong photometric features, where traditional
reconstruction algorithms do. It enjoys significant robustness to noise
under the assumptions it is designed for.
|
891. | Sclaroff, S, and Isidoro, J, "Active blobs: region-based, deformable appearance models," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 89, pp. 197-225, 2003.
Abstract:
A region-based approach to nonrigid motion tracking is described. Shape
is defined in terms of a deformable triangular mesh that captures
object shape plus a color texture map that captures object appearance.
Photometric variations are also modeled. Nonrigid shape registration
and motion tracking are achieved by posing the problem as an
energy-based, robust minimization procedure. The approach provides
robustness to occlusions, wrinkles, shadows, and specular highlights.
The formulation is tailored to take advantage of texture mapping
hardware available in many workstations, PCs, and game consoles. This
enables nonrigid tracking at speeds approaching video rate. (C) 2003
Elsevier Science (USA). All rights reserved.
|
892. | Yezzi, A, Zollei, L, and Kapur, T, "A variational framework for integrating segmentation and registration through active contours," MEDICAL IMAGE ANALYSIS, vol. 7, pp. 171-185, 2003.
Abstract:
Traditionally, segmentation and registration have been solved as two
independent problems, even though it is often the case that the
solution to one impacts the solution to the other. In this paper, we
introduce a geometric, variational framework that uses active contours
to simultaneously segment and register features from multiple images.
The key observation is that multiple images may be segmented by
evolving a single contour as well as the mappings of that contour into
each image. (C) 2003 Elsevier Science B.V. All rights reserved.
|
893. | Davatzikos, C, Tao, XD, and Shen, DG, "Hierarchical active shape models, using the wavelet transform," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 22, pp. 414-423, 2003.
Abstract:
Active shape models (ASMs) are often limited by the inability of
relatively few eigenvectors to capture the full range of biological
shape variability. This paper presents a method that overcomes this
limitation, by using a hierarchical formulation of active shape models,
using the wavelet transform. The statistical properties of the wavelet
transform of a deformable contour are analyzed via principal component
analysis, and used as priors in the contour's deformation. Some of
these priors reflect relatively global shape characteristics of the
object boundaries, whereas, some of them capture local and
high-frequency shape characteristics and, thus, serve as local
smoothness constraints. This formulation achieves two objectives.
First, it is robust when only a limited number of training samples is
available. Second, by using local statistics as smoothness constraints,
it eliminates the need for adopting ad hoc physical models, such as
elasticity or other smoothness models, which do not necessarily reflect
true biological variability. Examples on magnetic resonance images of
the corpus callosum and hand contours demonstrate that good and fully
automated segmentations can be achieved, even with as few as five
training samples.
|
894. | Elder, JH, Krupnik, A, and Johnston, LA, "Contour grouping with prior models," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 25, pp. 661-674, 2003.
Abstract:
Conventional approaches to perceptual grouping assume little specific
knowledge about the object(s) of interest. However, there are many
applications in which such knowledge is available and useful. Here, we
address the problem of finding the bounding contour of an object in an
image when some prior knowledge about the object is available. We
introduce a framework for combining prior probabilistic knowledge of
the appearance of the object with probabilistic models for contour
grouping. A constructive search technique is used to compute candidate
closed object boundaries, which are then evaluated by combining figure,
ground, and prior probabilities to compute the maximum a posteriori
estimate. A significant advantage of our formulation is that it
rigorously combines probabilistic local cues with important global
constraints such as simplicity (no self-intersections), closure,
completeness, and nontrivial scale priors. We apply this approach to
the problem of computing exact lake boundaries from satellite imagery,
given approximate prior knowledge from an existing digital database. We
quantitatively evaluate the performance of our algorithm and find that
it exceeds the performance of human mapping experts and a competing
active contour approach, even with relatively weak prior knowledge.
While the priors may be task-specific, the approach is general, as we
demonstrate by applying it to a completely different problem: the
computation of human skin boundaries in natural imagery.
|
895. | Cai, YY, Ye, XZ, Chui, C, and Anderson, JH, "Constructive algorithms of vascular network modeling for training of minimally invasive catheterization procedure," ADVANCES IN ENGINEERING SOFTWARE, vol. 34, pp. 439-450, 2003.
Abstract:
In this paper, three-dimensional modeling of vascular networks is
described. We propose a constructive approach to generating vascular
segments and bifurcations using sweeping and blending operations. This
allows smooth connection of individual branching segments at the
vascular bifurcations. A tangential continuity or visual smooth (e.g.
GC(1)) representation of the vascular network is derived to formulate
constructive algorithms for vascular modeling. The vascular modeling
technique developed is applied in our medical simulation system for the
training and pretreatment planning of minimally invasive vascular
surgery using catheterization procedure. (C) 2003 Elsevier Science Ltd.
All rights reserved.
|
896. | Chen, ZK, and Molloi, S, "Multiresolution vessel tracking in angiographic images using valley courses," OPTICAL ENGINEERING, vol. 42, pp. 1673-1682, 2003.
Abstract:
Vessel tracking is an essential step for 3-D reconstruction and
quantitative analysis of angiograms. We present a multiresolution
vessel tracking method and its application to 2-D coronary angiographic
images. The method consists of: 1. multiresolution wavelet
decomposition; 2. wavelet denoising; 3. vessel valley map generation in
a low-resolution image; 4. vascular tree construction; 5. valley course
refinement using a "peg-quiver" algorithm; and 6. lumen diameter
calculation using a derivative-free edge detection algorithm. A vessel
valley map consisting of all vessel valley points can be generated
using a star-scan scheme, followed by local minima detection along each
scanline. The vessel paths and vascular trees are then constructed by
using a recursive "depth-first" searching scheme on the valley map. A
peg-quiver refinement algorithm produces optimal valley courses in
high-resolution images by alternatively pegging and quivering the
control points and the interpolated points. With high-resolution valley
courses, vessel boundary is defined by exploiting vessel cross-section
profiles. Compared to centerline-based vessel tracking, the
vessel-tracking scheme using valley courses exhibits more simplicity,
effectiveness, and stability. (C) 2003 Society of Photo-Optical
Instrumentation Engineers.
|
897. | Ohtake, Y, Belyaev, A, and Pasko, A, "Dynamic mesh optimization for polygonized implicit surfaces with sharp features," VISUAL COMPUTER, vol. 19, pp. 115-126, 2003.
Abstract:
The paper presents a novel approach for accurate polygonization of
implicit surfaces with sharp features. The approach is based on mesh
evolution toward a given implicit surface with simultaneous control of
the mesh vertex positions and mesh normals. Given an initial
polygonization of an implicit surface, a mesh evolution process
initialized by the polygonization is used. The evolving mesh converges
to a limit mesh which delivers a high-quality approximation of the
implicit surface. For analyzing how close the evolving mesh approaches
the implicit surface, we use two error metrics: the metrics measure
deviations of the mesh vertices from the implicit surface and
deviations of mesh normals from the normals of the implicit surface.
|
898. | Li, HQ, and Chutatape, O, "Boundary detection of optic disk by a modified ASM method," PATTERN RECOGNITION, vol. 36, pp. 2093-2104, 2003.
Abstract:
A new algorithm to automatically detect the boundary of optic disk in
color fundus images is proposed. The optic disk is located by principal
component analysis (PCA) based model, which is employed to initialize
active shape model (ASM) to detect the disk boundary. ASM is modified
with two aspects: one is the self-adjusting weight in the
transformation from shape space to image space; the other is exclusion
of outlying points in obtaining shape parameters. The modifications
make the proposed algorithm more robust and converge faster than the
original ASM method, especially in the case where the edge of optic
disk is weak or occluded by blood vessels. (C) 2003 Pattern Recognition
Society. Published by Elsevier Science Ltd. All rights reserved.
|
899. | Feng, GC, and Jiang, JM, "Image segmentation in compressed domain," JOURNAL OF ELECTRONIC IMAGING, vol. 12, pp. 390-397, 2003.
Abstract:
We propose a direct image segmentation algorithm in the JPEG compressed
domain. The algorithm features extracting statistical parameters from
direct cosine transform (DCT) coefficients without its inverse
transform, and growing regions in line with JPEG compression seamlessly
in blocks of 8 x 8 pixels. In comparison with the latest research
efforts in region-based image segmentation, our proposed algorithm
achieves significant advantages, including (1) no iteration is
involved, (2) no full decompression is required, and (3) segmentation
performance is competitive. (C) 2003 SPIE and IST.
|
900. | Tissainayagam, P, and Suter, D, "Contour tracking with automatic motion model switching," PATTERN RECOGNITION, vol. 36, pp. 2411-2427, 2003.
Abstract:
In this paper we present an efficient contour-tracking algorithm which
can track 2D silhouette of objects in extended image sequences. We
demonstrate the ability of the tracker by tracking highly deformable
contours (such as walking people) captured by a static camera. We
represent contours (silhouette) of moving objects by using a cubic
B-spline. The tracking algorithm is based on tracking a lower
dimensional shape space (as opposed to tracking in spline space).
Tracking the lower dimensional space has proved to be fast and
efficient. The tracker is also coupled with an automatic motion-model
switching algorithm, which makes the tracker robust and reliable when
the object of interest is moving with multiple motion. The model-based
tracking technique provided is capable of tracking rigid and non-rigid
object contours with good tracking accuracy. (C) 2003 Pattern
Recognition Society. Published by Elsevier Ltd. All rights reserved.
|
901. | Baert, SAM, Viergever, MA, and Niessen, WJ, "Guide-wire tracking during endovascular interventions," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 22, pp. 965-972, 2003.
Abstract:
A method is presented to extract and track the position of a guide wire
during endovascular interventions under X-ray fluoroscopy. The method
can be used to improve guide-wire visualization in low-quality
fluoroscopic images and to estimate the position of the guide wire in
world coordinates. A two-step procedure is utilized to track the guide
wire in subsequent frames. First, a rough estimate of the displacement
is obtained using a template-matching procedure. Subsequently, the
position of the guide wire is determined by fitting a spline to a
feature image. The feature images that have been considered enhance
line-like structures on: 1) the original images; 2) subtraction images;
and 3) preprocessed images in which coherent structures are enhanced.
In the optimization step, the influence of the scale at which the
feature is calculated and the additional value of using directional
information is investigated. The method is evaluated on 267 frames from
ten clinical image sequences. Using the automatic method, the guide
wire could be tracked in 96% of the frames, with a similar accuracy to
three observers, although the position of the tip was estimated less
accurately.
|
902. | Decraemer, WF, Dirckx, JJJ, and Funnell, WRJ, "Three-dimensional modelling of the middle-ear ossicular chain using a commercial high-resolution X-ray CT scanner," JARO-JOURNAL OF THE ASSOCIATION FOR RESEARCH IN OTOLARYNGOLOGY, vol. 4, pp. 250-263, 2003.
Abstract:
The quantitative measurement of the three-dimensional (3-D) anatomy of
the ear is of great importance in the making of teaching models and the
design of mathematical models of parts of the ear, and also for the
interpretation and presentation of experimental results. This article
describes how we used virtual sections from a commercial
high-resolution X-ray computed tomography (CT) scanner to make
realistic 3-D anatomical models for various applications in our
middle-ear research. The important problem of registration of the 3-D
model within the experimental reference frame is discussed. The
commercial X-ray CT apparatus is also compared with X-ray CT using
synchrotron radiation, with magnetic resonance microscopy, with
fluorescence optical sectioning, and with physical (histological)
serial sections.
|
903. | Pujol, O, Rosales, M, Radeva, P, and Nofrerias-Fernandez, E, "Intravascular ultrasound images vessel characterization using AdaBoost," FUNCTIONAL IMAGING AND MODELING OF THE HEART, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2674, pp. 242-251, 2003.
Abstract:
This paper presents a method for accurate location of the vessel
borders based on boosting of classifiers and feature selection.
Intravascular Ultrasound Images (IVUS) are an excellent tool for direct
visualization of vascular pathologies and evaluation of the lumen and
plaque in coronary arteries. Nowadays, the most common methods to
separate the tissue from the lumen are based on gray levels providing
non-satisfactory segmentations. In this paper, we propose and analyze a
new approach to separate tissue from lumen based on an ensemble method
for classification and feature selection. We perform a supervised
learning of local texture patterns of the plaque and lumen regions and
build a large feature space using different texture extractors. A
classifier is constructed by selecting a small number of important
features using AdaBoost. Feature selection is achieved by a
modification of the AdaBoost. A snake is set to deform to achieve
continuity on the classified image. Different tests on medical images
show the advantages.
|
904. | Moreno-Noguer, F, Andrade-Cetto, J, and Sanfeliu, A, "Fusion of color and shape for object tracking under varying illumination," PATTERN RECOGNITION AND IMAGE ANALYSIS, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2652, pp. 580-588, 2003.
Abstract:
In this paper a new technique to perform tracking in cluttered
scenarios with varying illumination conditions is presented. The
robustness of the approach lies in the integration of appearance and
structural information of the object. The fusion is done using the
CONDENSATION algorithm that formulates multiple hypothesis about the
estimation of the object's color distribution and validates them taking
into account the contour information of the object.
|
905. | Yan, JY, and Zhuang, TG, "Applying improved fast marching method to endocardial boundary detection in echocardiographic images," PATTERN RECOGNITION LETTERS, vol. 24, pp. 2777-2784, 2003.
Abstract:
An improved fast marching approach for endocardial boundary detection
and tracking in echocardiographic images is presented. Firstly, the
traditional fast marching algorithm is applied to the echocardiographic
images. And the existing problems are discussed. Then, the algorithm is
improved by introducing the average energy of the whole advancing front
into the speed term instead of determining the speed term only with the
local image features. The experimental results show that the improved
algorithm is very effective and stable. (C) 2003 Elsevier B.V. All
rights reserved.
|
906. | Gil, D, and Radeva, P, "Curvature vector flow to assure convergent deformable models for shape modelling," ENERGY MINIMIZATION METHODS IN COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2683, pp. 357-372, 2003.
Abstract:
Poor convergence to concave shapes is a main limitation of snakes as a
standard segmentation and shape modelling technique. The gradient of
the external energy of the snake represents a force that pushes the
snake into concave regions, as its internal energy increases when new
inflexion points are created. In spite of the improvement of the
external energy by the gradient vector flow technique, highly non
convex shapes can not be obtained, yet. In the present paper, we
develop a new external energy based on the geometry of the curve to be
modelled. By tracking back the deformation of a curve that evolves by
minimum curvature flow, we construct a distance map that encapsulates
the natural way of adapting to non convex shapes. The gradient of this
map, which we call curvature vector flow (CVF), is capable of
attracting a snake towards any contour, whatever its geometry. Our
experiments show that, any initial snake condition converges to the
curve to be modelled in optimal time.
|
907. | Karlsson, A, Strahlen, K, and Heyden, A, "A fast snake segmentation method applied to histopathological sections," ENERGY MINIMIZATION METHODS IN COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2683, pp. 261-274, 2003.
Abstract:
Using snakes to segment images has proven to be a powerful tool in many
different applications. The snake is usually propagated by minimizing
an energy function. The standard way of updating the snake from the
energy function is time consuming. This paper presents a fast snake
evolution algorithm, based on a more efficient numeric scheme for
updating the snake. Instead of inverting a matrix derived from
approximating derivatives in a sampled snake, an analytical expression
is obtained. The expression takes the form of a convolution with a
filter given by an explicit formula. The filter function can then be
sampled and used to propagate snakes in a fast and straightforward
manner. The proposed method is generally applicable to snakes and is
here used for propagating snakes in a gradient vector flow field.
Experiments axe carried out on images of histopathological tissue
sections and the results axe very promising.
|
908. | Kwon, MJ, Han, YJ, Shin, IH, and Park, HW, "Hierarchical fuzzy segmentation of brain MR images," INTERNATIONAL JOURNAL OF IMAGING SYSTEMS AND TECHNOLOGY, vol. 13, pp. 115-125, 2003.
Abstract:
In brain magnetic resonance (MR) images, image segmentation and 3D
visualization are very useful tools for the diagnosis of abnormalities.
Segmentation of white matter (WM), gray matter (GM), and cerebrospinal
fluid (CSF) is the basic process for 3D visualization of brain MR
images. Of the many algorithms, the fuzzy c-means (FCM) technique has
been widely used for segmentation of brain MR images. However, the FCM
technique does not yield sufficient results under radio frequency (RF)
nonuniformity. We propose a hierarchical FCM (HFCM), which provides
good segmentation results under RF nonuniformity and does not require
any parameter setting. We also generate Talairach templates of the
brain that are deformed to 3D brain MR images. Using the deformed
templates, only the cerebrum region is extracted from the 3D brain MR
images. Then, the proposed HFCM partitions the cerebrum region into WM,
GM, and CSF. (C) 2003 Wiley Periodicals, Inc.
|
909. | Jackson, JD, Yezzi, A, Wallace, W, and Bear, MF, "Segmentation of coarse and fine scale features using multi-scale diffusion and Mumford-Shah," SCALE SPACE METHODS IN COMPUTER VISION, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2695, pp. 615-624, 2003.
Abstract:
Here we present a segmentation algorithm that uses multi-scale
diffusion with the Mumford-Shah model. The image data inside and
outside a surface is smoothed by minimizing an energy functional using
a partial differential equation that results in a trade-off between
smoothing and data fidelity. We propose a scale-space approach that
uses a good deal of diffusion as its coarse scale space and that
gradually reduces the diffusion to get a fine scale space. So our
algorithm continually moves to a particular diffusion level rather than
just using a set diffusion coefficient with the Mumford-Shah model.
Each time the smoothing is decreased, the data fidelity term increases
and the surface is moved to a steady state. This method is useful in
segmenting biomedical images acquired using high-resolution confocal
fluorescence microscopy. Here we tested the method on images of
individual dendrites of neurons in rat visual cortex. These dendrites
are studded with dendritic spines, which have very small heads and
faint necks. The coarse scale segments out the dendrite and the
brighter spine heads, while avoiding noise. Backing off the diffusion
to a medium scale fills in more of the structure, which gets some of
the brighter spine necks. The finest scale fills in the small and
detailed features of the spines that are missed in the initial
segmentation. Because of the thin, faint structure of the spine necks,
we incorporate into our level set framework a topology preservation
method for the surface which aids in segmentation and keeps a simple
topology.
|
910. | Karlsson, A, Strahlen, K, and Heyden, A, "Segmentation of histopathological section using snakes," IMAGE ANALYSIS, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2749, pp. 595-602, 2003.
Abstract:
This paper presents a semi-automatic method for Segmentation of digital
images. The segmentation method is based on snakes and a novel
implementation of the snake evolution algorithm is presented.
Analytical expressions describing the snake evolution axe derived using
the Fourier transform. These expressions can be sampled and used in a
fast algorithm for snake propagation. Experiments are carried out on
images of histopathological tissue sections and the results are very
promising. In particular the method is able to cope with overlapping
nuclei.
|
911. | Lotjonen, J, "Construction of patient-specific surface models from MR images: application to bioelectromagnetism," COMPUTER METHODS AND PROGRAMS IN BIOMEDICINE, vol. 72, pp. 167-178, 2003.
Abstract:
Patient-specific geometric models are needed in many engineering
problems. This work reports a novel software tool developed to
construct individualized triangulated surface models from MR images.
The program consists of three main parts; segmentation triangulation
and registration. The software tool was developed under the UNIX
operating system. The application area demonstrated in this work is
bioelectromagnetism but the program can be used as well in other
engineering problems. The tool has been successfully applied in
numerous cases, both for the thorax and the head, (C) 2002 Elsevier
Science Ireland Ltd. rights reserved.
|
912. | Sharma, R, Yeasin, M, Krahnstoever, N, Rauschert, I, Cai, G, Brewer, I, MacEachren, AM, and Sengupta, K, "Speech-gesture driven multimodal interfaces for crisis management," PROCEEDINGS OF THE IEEE, vol. 91, pp. 1327-1354, 2003.
Abstract:
Emergency response requires strategic assessment of risks, decisions,
and communications that are time critical while requiring teams of
individuals to have fast access to large volumes of complex information
and technologies that enable tightly coordinated work. The access to
this information by crisis management teams in emergency operations
centers can be facilitated through various human-computer interfaces.
Unfortunately, these interfaces are hard to use, require extensive
training, and often impede rather than support teamwork.
Dialogue-enabled devices, based on natural, multimodal interfaces, have
the potential of making a variety of information technology tools
accessible during crisis management. This paper establishes the
importance of multimodal interfaces in various aspects of crisis
management and explores many issues in realizing successful
speech-gesture driven, dialogue-enabled interfaces for crisis
management.
This paper is organized in five parts. The first part discusses the
needs of crisis management that can be potentially met by the
development of appropriate interfaces. The second part discusses the
issues related to the design and development of multimodal interfaces
in the context of crisis management. The third part discusses the state
of the art in both the theories and practices involving these
human-computer interfaces. In particular it describes the evolution and
implementation details of two representative systems, Crisis Management
(XISM) and Dialog Assisted Visual Environment for Geoinformation
(DAVE_G). The fourth part speculates on the short-term and long-term
research directions that will help addressing the outstanding
challenges in interfaces that support dialogue and collaboration.
Finally, the fifth part concludes the paper.
|
913. | Votsis, GN, Drosopoulos, AI, and Kollias, SD, "A modular approach to facial feature segmentation on real sequences," SIGNAL PROCESSING-IMAGE COMMUNICATION, vol. 18, pp. 67-89, 2003.
Abstract:
In this paper a modular approach of gradual confidence for facial
feature extraction over real video frames is presented. The problem is
being dealt under general imaging conditions and soft presumptions. The
proposed methodology copes with large variations in the appearance of
diverse subjects, as well as of the same subject in various instances
within real video sequences. Areas of the face that statistically seem
to be outstanding form an initial set of regions that are likely to
include information about the features of interest. Enhancement of
these regions produces closed objects, which reveal-through the use of
a fuzzy system-a dominant angle, i.e. the facial rotation angle. The
object set is restricted using the dominant angle. An exhaustive search
is performed among all candidate objects, matching a pattern that
models the relative position of the eyes and the mouth. Labeling of the
winner features can be used to evaluate the features extracted and
provide feedback in an iterative framework. A subset of the MPEG-4
facial definition or facial animation parameter set can be obtained.
This gradual feature revelation is performed under optimization for
each step, producing a posteriori knowledge about the face and leading
to a step-by-step visualization of the features in search. (C) 2002
Elsevier Science B.V. All rights reserved.
|
914. | Ghanem, RN, Ramanathan, C, Jia, P, and Rudy, Y, "Heart-surface reconstruction and ECG electrodes localization using fluoroscopy, epipolar geometry and stereovision: Application to noninvasive imaging of cardiac electrical activity," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 22, pp. 1307-1318, 2003.
Abstract:
To date there is no imaging modality for cardiac arrhythmias which
remain the leading cause of sudden death in the United States
(>300000/yr.). Electrocardiographic imaging (ECGI), a noninvasive
modality that images cardiac arrhythmias from body surface potentials,
requires the geometrical relationship between the heart surface and the
positions of body surface ECG electrodes. A photographic method was
validated in a mannequin and used to determine the three-dimensional
coordinates of body surface ECG electrodes to within 1 mm of their
actual positions. Since fluoroscopy is available in the cardiac
electrophysiology (EP) laboratory where diagnosis and treatment of
cardiac arrhythmias is conducted, a fluoroscopic method to determine
the heart surface geometry was developed based on projective geometry,
epipolar geometry, point reconstruction, b-spline interpolation and
visualization. Fluoroscopy-reconstructed hearts in a phantom and a
human subject were validated using high-resolution computed tomography
(CT) imaging. The mean absolute distance error for the
fluoroscopy-reconstructed heart relative to the CT heart was 4 mm
(phantom) and 10 mm (human). In the human, ECGI images of normal
cardiac electrical activity on the fluoroscopy-reconstructed heart
showed close correlation with those obtained on the CT heart. Results
demonstrate the feasibility of this approach for clinical noninvasive
imaging of cardiac arrhythmias in the interventional EP laboratory.
|
915. | Yang, J, Staib, LH, and Duncan, JS, "Neighbor-constrained segmentation with 3D deformable models," INFORMATION PROCESSING IN MEDICAL IMAGING, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2732, pp. 198-209, 2003.
Abstract:
A novel method for the segmentation of multiple objects from 3D medical
images using inter-object constraints is presented. Our method is
motivated by the observation that neighboring structures have
consistent locations and shapes that provide configurations and context
that aid in segmentation. We define a Maximum A Posteriori(MAP)
estimation framework using the constraining information provided by
neighboring objects to segment several objects simultaneously. We
introduce a representation for the joint density function of the
neighbor objects, and define joint probability distributions over the
variations of the neighboring positions and shapes of a set of training
images. By estimating the MAP shapes of the objects, we formulate the
model in terms of level set functions, and compute the associated
Euler-Lagrange equations. The contours evolve both according to the
neighbor prior information and the image gray level information. We
feel that this method is useful in situations where there is limited
inter-object information as opposed to robust global atlases. Results
and validation from various experiments on synthetic data and medical
imagery in 2D and 3D are demonstrated.
|
916. | Tian, TP, Chen, Y, Leow, WK, Hsu, W, Howe, TS, and Png, MA, "Computing neck-shaft angle of femur for X-ray fracture detection," COMPUTER ANALYSIS OF IMAGES AND PATTERNS, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2756, pp. 82-89, 2003.
Abstract:
Worldwide, 30% - 40% of women and 13% of men suffer from osteoporotic
fractures of the bone, particularly the older people. Doctors in the
hospitals need to manually inspect a large number of x-ray images to
identify the fracture cases. Automated detection of fractures in x-ray
images can help to lower the workload of doctors by screening out the
easy cases, leaving a small number of difficult cases and the second
confirmation to the doctors to examine more closely. To our best
knowledge, such a system does not exist as yet. This paper describes a
method of measuring the neck-shaft angle of the femur, which is one of
the main diagnostic rules that doctors use to determine whether a
fracture is present at the femur. Experimental tests performed on test
images confirm that the method is accurate in measuring neck-shaft
angle and detecting certain types of femur fractures.
|
917. | Shiffman, S, Rubin, GD, Schraedley-Desmond, P, and Napel, S, "Semiautomated segmentation of blood vessels using ellipse-overlap criteria: Method and comparison to manual editing," MEDICAL PHYSICS, vol. 30, pp. 2572-2583, 2003.
Abstract:
Two-dimensional intensity-based methods for the segmentation of blood
vessels from computed-tomography-angiography data often result in
spurious segments that originate from other objects whose intensity
distributions overlap with those of the vessels. When segmented images
include spurious segments, additional methods are required to select
segments that belong to the target vessels. We describe a method that
allows experts to select vessel segments from sequences of segmented
images with little effort. Our method uses ellipse-overlap criteria to
differentiate between segments that belong to different objects and are
separated in plane but are connected in the through-plane direction. To
validate our method, we used it to extract vessel regions from volumes
that were segmented via analysis of isolabel-contour maps, and showed
that the difference between the results of our method and
manually-edited results was within inter-expert variability. Although
the total editing duration for our method, which included
user-interaction and computer processing, exceeded that of manual
editing, the extent of user interaction required for our method was
about a fifth of that required for manual editing. (C) 2003 American
Association of Physicists in Medicine.
|
918. | Sun, SJ, Haynor, DR, and Kim, Y, "Semiautomatic video object segmentation using VSnakes," IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, vol. 13, pp. 75-82, 2003.
Abstract:
Video object segmentation and tracking are essential for content-based
video processing. This paper presents a framework for a semiautomatic
approach to this problem. A semantic video object is initialized with
human assistance in a key frame. The video object is then tracked and
segmented automatically in the following frames. A new active contour
model, VSnakes, is introduced as a segmentation method in this
framework. The active contour energy is defined so as to reflect the
energy difference between two contours instead of the energy of a
single contour. Multiple-resolution wavelet decomposition is applied in
generating the edge energy of the image frame. Contour relaxation is
used to deal with the object deformation frame by frame, and the
Viterbi algorithm is used to update the contour path during contour
relaxation. Compared to the original snakes algorithm, semiautomatic
video object segmentation with the VSnakes algorithm resulted in
improved performance in terms of video object shape distortion (1.4%
versus 2.9% in one experiment), which suggests that it could be a
useful tool in many content-based video applications, e.g., MPEG-4
video object generation and medical imaging.
|
919. | Nava, FP, and Martel, AF, "Wavelet modeling of contour deformations in Sobolev spaces for fitting and tracking applications," PATTERN RECOGNITION, vol. 36, pp. 1119-1130, 2003.
Abstract:
This paper proposes a new model for contour deformations using
wavelets. This model uses Sobolev spaces to control the smoothness of
the contour deformation. This formulation defines a probabilistic model
that induces a prior distribution for contour deformation. Based on
this distribution, the fitting problem is solved in Bayesian terms. The
deformation model is also used to generate a prior dynamic model for
contour evolution in time. This probabilistic model is then applied to
solve the tracking problem. Computational results for several
real-image problems are given for both the Kalman and Condensation
filters. (C) 2002 Pattern Recognition Society. Published by Elsevier
Science Ltd. All rights reserved.
|
920. | Shah-Hosseini, H, and Safabakhsh, R, "A TASOM-based algorithm for active contour modeling," PATTERN RECOGNITION LETTERS, vol. 24, pp. 1361-1373, 2003.
Abstract:
Active contour modeling is a powerful technique for modeling object
boundaries. Various methods introduced for this purpose, however, have
certain difficulties such as getting stuck in local minima, poor
modeling of long concavities, and producing inaccurate results when the
initial contour is chosen simple or far from the object boundary. A
modified form of time adaptive self-organizing map network with a
variable number of neurons is proposed here for active contour modeling
which does not show such difficulties and automatically determines the
required number of control points. The initial contour for the object
boundary can be defined inside, outside, or across the boundary. This
contour can be open or closed, may be as simple as desired, and can be
placed far from the object boundary. In addition, the boundary may
contain long concavities. The proposed algorithm is tested for modeling
different objects and shows very good performance. (C) 2002 Elsevier
Science B.V. All rights reserved.
|
921. | Nilsson, B, and Heyden, A, "A fast algorithm for level set-like active contours," PATTERN RECOGNITION LETTERS, vol. 24, pp. 1331-1337, 2003.
Abstract:
This paper describes a fast algorithm for topology independent tracking
of moving interfaces under curvature- and velocity field-dependent
speed laws. This is usually done in the level set framework using the
narrow-band algorithm, which accurately solves the level set equation
but is too slow to use in real-time or near real-time image
segmentation applications. In this paper we introduce a fast algorithm
for tracking moving interfaces in a level set-like manner. The
algorithm relies on two key components: First, it tracks the interface
by scheduling point-wise propagation events using a heap sorted queue.
Second, the local geometric properties of the interface are defined so
that they can be efficiently updated in an incremental manner and so
that they do not require the presence of the signed distance function.
Finally examples are given that indicate that the algorithm is fast and
accurate enough for near real-time segmentation applications. (C) 2002
Elsevier Science B.V. All rights reserved.
|
922. | Wang, CCL, Wang, Y, Chang, TKK, and Yuen, MMF, "Virtual human modeling from photographs for garment industry," COMPUTER-AIDED DESIGN, vol. 35, pp. 577-589, 2003.
Abstract:
The research presented in this paper is to develop a technique of
virtual human modeling for the garment industry from two photographs of
a human body in two orthogonal views. Firstly, an efficient
segmentation method is applied on the two photographs to obtain the
contours of the human body. After this, a template-based feature
extraction algorithm is introduced to determine the feature points on
the human contours by human morphology rules. Finally, a view-dependent
deformation technique is described to construct the virtual human body
by using human contours. Our segmentation algorithm is derived from the
Mumford-Shah segmentation technology and the level set formulation, and
it is accelerated by applying multi-pyramid levels. The deformation
technique is related to axial deformation. With our deformation method,
the reference silhouettes (the front-view and right-view silhouettes of
the template human model) and the target silhouettes (the front-view
and right-view silhouettes of the human body from the photographs) are
used to deform the template human model, which is represented by a
polygonal mesh with predefined features. The self-intersection problem
in the axial deformation is solved in our deformation approach.
Compared with other virtual human modeling approaches, the speed of
constructing the human model is increased; and our deformation
technique has better continuity and local deformation properties. At
the end of the paper, some potential applications for the garment
industry are given to demonstrate the functionality of virtual human
models constructed by our approach. (C) 2002 Elsevier Science Ltd. All
rights reserved.
|
923. | Shah-Hosseini, H, and Safabakhsh, R, "TASOM: A new time adaptive self-organizing map," IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, vol. 33, pp. 271-282, 2003.
Abstract:
The time adaptive self-organizing map (TASOM) network is a modified
self-organizing map (SOM) network with adaptive learning rates and
neighborhood sizes as its learning parameters. Every neuron in the
TASOM has its own learning rate and neighborhood size. For each new
input vector, the neighborhood size and learning rate of the winning
neuron and the learning rates of its neighboring neurons are updated. A
scaling vector is also employed in the TASOM algorithm for compensation
against scaling transformations. Analysis of the updating rules of the
algorithm reveals that the learning parameters may increase or decrease
for adaptation to a changing environment, such that the minimum
increase or decrease is achieved according to a specific measure.
Several versions of the TASOM-based networks are proposed in this paper
for different applications, including bilevel thresholding of grey
level images, tracking of moving objects and their boundaries, and
adaptive clustering. Simulation results show satisfactory performance
of the proposed methods in the implemented applications.
|
924. | Tognola, G, Parazzini, M, Svelto, C, Ravazzani, P, and Grandori, F, "A fast and reliable system for 3D surface acquisition and reconstruction," IMAGE AND VISION COMPUTING, vol. 21, pp. 295-305, 2003.
Abstract:
A prototype 3D scanning system is presented together with a novel
surface reconstruction algorithm to obtain an explicit 3D
reconstruction of both open and closed surfaces, with particular
attention to anatomical parts for biomedical applications. The whole
system is based on acquisition of unorganized range data by laser
scanning and successive image processing, by expanding and fitting a
regular geometrical model within the range data, for surface
reconstruction. The prototype system proved to be working finely, with
an estimated resolution < 10 μm, a repeatability < 50 mum, and an
acquisition noise of similar to 170 mum (rms value). Simulations with a
synthetic test surface are described to provide quantitative figures on
the robustness to noise of the proposed reconstruction algorithm.
Reconstruction of 3D models of human organs are presented as well. (C)
2003 Published by Elsevier Science B.V.
|
925. | Kambhamettu, C, Goldgof, D, He, M, and Laskov, P, "3D nonrigid motion analysis under small deformations," IMAGE AND VISION COMPUTING, vol. 21, pp. 229-245, 2003.
Abstract:
We present a novel method for estimating motion parameters and point
correspondences between 3D surfaces under small nonrigid motion. A
vector point function is utilized as the motion parameter, called the
displacement function. Differential-geometric changes of surfaces are
then used in tracking small deformations. Discriminant (of first
fundamental form), unit-normal and Gaussian curvature are the invariant
differential-geometric parameters that have been utilized for nonrigid
motion analysis.
Tests were performed by generating nonrigid motion on a simulated data
set to illustrate performance and accuracy of our algorithms.
Experiments were then performed on a Cyberware range data sequence of
facial motion. A total of 16 sets of facial motion images were used in
our experiments, belonging to eight different persons, each having two
facial expressions. We have demonstrated the correct point
correspondence recovery by tracking features of the face during each
facial expression and comparing against the manual tracking of feature
points by different users. In addition, nonrigid motion segmentation
and interpolation of intermediate frames of data were successfully
performed on these images. We have also performed experiments on
cardiac data in order to estimate the motion parameters related to the
abnormality in cardiac motion. Two sets of volumetric CT data of the
left ventricle of a dog's heart in cardiac cycle were used in our
experiments. All our experiments indicate that the system performs very
well and proves to be extremely useful in other nonrigid motion
analysis applications. (C) 2002 Elsevier Science B.V. All rights
reserved.
|
926. | Vilarino, DL, Cabello, D, Pardo, XM, and Brea, VM, "Cellular neural networks and active contours: a tool for image segmentation," IMAGE AND VISION COMPUTING, vol. 21, pp. 189-204, 2003.
Abstract:
In this paper Cellular Neural Networks (CNN) are applied to image
segmentation based on active contour techniques. The approach is based
on deformable contours which evolve pixel by pixel from their initial
shapes and locations until delimiting the objects of interest. The
contour shift is guided by external information from the image under
consideration which attracts them towards the target characteristics
(intensity extremes, edges, etc.) and by internal forces which try to
maintain the smoothness of the contour curve. This CNN-based proposal
combines the characteristics from implicit and parametric models. As a
consequence a high flexibility and control for the evolution dynamics
of the snakes are provided, allowing the solution of complex tasks as
is the case of the topologic transformations. In addition the proposal
is suitable for its implementation as an integrated circuit allowing to
take advantages of the massively parallel processing in CNN to reduce
processing time. (C) 2003 Elsevier Science B.V. All rights reserved.
|
927. | Fedkiw, RP, Sapiro, G, and Shu, CW, "Shock capturing, level sets, and PDE based methods in computer vision and image processing: a review of Osher's contributions," JOURNAL OF COMPUTATIONAL PHYSICS, vol. 185, pp. 309-341, 2003.
Abstract:
In this paper we review the algorithm development and applications in
high resolution shock capturing methods, level set methods, and PDE
based methods in computer vision and image processing. The emphasis is
on Stanley Osher's contribution in these areas and the impact of his
work. We will start with shock capturing methods and will review the
Engquist-Osher scheme, TVD schemes, entropy conditions, ENO and WENO
schemes, and numerical schemes for Hamilton-Jacobi type equations.
Among level set methods we will review level set calculus, numerical
techniques, fluids and materials, variational approach, high
codimension motion, geometric optics, and the computation of
discontinuous solutions to Hamilton-Jacobi equations. Among computer
vision and image processing we will review the total variation model
for image denoising, images on implicit surfaces, and the level set
method in image processing and computer vision. (C) 2003 Elsevier
Science B.V. All rights reserved.
|
928. | Lee, KM, and Street, WN, "Model-based detection, segmentation, and classification for image analysis using on-line shape learning," MACHINE VISION AND APPLICATIONS, vol. 13, pp. 222-233, 2003.
Abstract:
Detection, segmentation, and classification of specific objects are the
key building blocks of a computer vision system for image analysis.
This paper presents a unified model-based approach to these three
tasks. It is based on using unsupervised learning to find a set of
templates specific to the objects being outlined by the user. The
templates are formed by averaging the shapes that belong to a
particular cluster, and are used to guide a probabilistic search
through the space of possible objects. The main difference from
previously reported methods is the use of on-line learning, ideal for
highly repetitive tasks. This results in faster and more accurate
object detection, as system performance improves with continued use.
Further, the information gained through clustering and user feedback is
used to classify the objects for problems in which shape is relevant to
the classification. The effectiveness of the resulting system is
demonstrated in two applications: a medical diagnosis task using
cytological images, and a vehicle recognition task.
|
929. | Wong, HS, and Chung, R, "Three-dimensional shape recovery across two views using approximate geometric constraints," OPTICAL ENGINEERING, vol. 42, pp. 632-641, 2003.
Abstract:
We propose a new approach to object matching and shape reconstruction
across two views. The approach relies on the topological relationship
among the feature points and a planarity approximation for the object
surfaces in carrying the object from the model view to the scene view.
The correspondences are then refined by fitting an active contour model
to the transferred feature points on the scene view, which
automatically assumes the shape of the object on correct matching. For
the purpose of 3-D reconstruction, it could be shown that while the
establishment of such correct correspondences alone would result in
ambiguities under the assumption of weak perspective projection, the
adoption of a regularization criterion, in the form of a
depth-continuity constraint, and a set of geometric constraints
associated with selected subset of surfaces and contours of the object,
would overcome this problem and lead to the recovery of the approximate
3-D structure of the object. (C) 2003 Society of Photo-Optical
Instrumentation Engineers.
|
930. | Lee, RST, "iJADE surveillant - an intelligent multi-resolution composite neuro-oscillatory agent-based surveillance system," PATTERN RECOGNITION, vol. 36, pp. 1425-1444, 2003.
Abstract:
Due to the rapid development of technology, especially in the field of
Internet systems, there is an increasing demand both for intelligent,
mobile and autonomous systems and for the usage and conveyance of
multi-media information through cyberspace. In this paper, we propose
an innovative, intelligent multi-agent based model, namely intelligent
Java Agent Development Environment (iJADE), to provide an intelligent
agent-based platform in the e-commerce environment. In addition to the
facilities found in contemporary agent development platforms, which
focus on the autonomy and mobility of multi-agents, iJADE provides an
intelligent layer (known as the "Conscious Layer") to support the
implementation of various AI functionalities in order to produce
"smart" agents.
From an implementation point of view, we introduce an intelligent,
multi-media processing system known as "iJADE Surveillant" -an
intelligent multi-resolution composite neuro-oscillatory agent-based
surveillance system-which is based on the integration of the following
modules. (a) An automatic coarse-to-fine figure-ground scene
segmentation module using the Composite Neuro-Oscillatory Wavelet-based
model. (b) An automatic human face detection and extraction module
using an Active Contour Model with facial "landmarks" vectors. (c)
Invariant human face identification based on the Elastic Graph Dynamic
Link Model. To conform to the current (and future) multi-media system
standards, all of iJADE Surveillant is implemented using the MPEG-7
system framework-with comprehensive Description Schemes, feature
descriptors and a model framework.
From an experimental point of view, a scene gallery of over 6000 color
scene images is used to test the automatic scene segmentation. One
hundred distinct human subjects (with over 1020 tested scenes) are used
to test the intelligent human face identification. An overall correct
(invariant) facial recognition rate of over 90% is attained. We hope
that the implementation of the iJADE Surveillant can provide an
invariant and higher-order intelligent object (pattern) encoding,
searching and identification solution for future MPEG-7 applications.
(C) 2003 Pattern Recognition Society. Published by Elsevier Science
Ltd. All rights reserved.
|
931. | Gomes, J, and Faugeras, O, "The Vector Distance Functions," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 52, pp. 161-187, 2003.
Abstract:
We present a novel method for representing and evolving objects of
arbitrary dimension. The method, called the Vector Distance Function
(VDF) method, uses the vector that connects any point in space to its
closest point on the object. It can deal with smooth manifolds with and
without boundaries and with shapes of different dimensions. It can be
used to evolve such objects according to a variety of motions,
including mean curvature. If discontinuous velocity fields are allowed
the dimension of the objects can change. The evolution method that we
propose guarantees that we stay in the class of VDF's and therefore
that the intrinsic properties of the underlying shapes such as their
dimension, curvatures can be read off easily from the VDF and its
spatial derivatives at each time instant. The main disadvantage of the
method is its redundancy: the size of the representation is always that
of the ambient space even though the object we are representing may be
of a much lower dimension. This disadvantage is also one of its
strengths since it buys us flexibility.
|
932. | Sbert, C, and Sole, AF, "3D curves reconstruction based on deformable models," JOURNAL OF MATHEMATICAL IMAGING AND VISION, vol. 18, pp. 211-223, 2003.
Abstract:
We present a new method, based on curve evolution, for the
reconstruction of a 3D curve from two different projections. It is
based on the minimization of an energy functional. Following the work
on geodesic active contours by Caselles et al. (in Int. Conf. on
Pattern Recognition, 1996, Vol. 43, pp. 693-737), we then transform the
problem of minimizing the functional into a problem of geodesic
computation in a Riemann space. The Euler-Lagrange equation of this new
functional is derived and its associated PDE is solved using the level
set formulation, giving the existence and uniqueness results. We apply
the model to the reconstruction of a vessel from a biplane angiography.
|
933. | Yoshida, H, "Multiscale edge-guided wavelet snake model for delineation of pulmonary nodules in chest radiographs," JOURNAL OF ELECTRONIC IMAGING, vol. 12, pp. 69-80, 2003.
Abstract:
A novel approach based on a multiscale edge-guided wavelet snake model
is developed for deliniation of pulmonary nodules in digital chest
radiographs. The approach is applied to the differentiation of nodules
and false positives reported by our computer-aided diagnosis (CAD)
scheme for detection of nodules. The wavelet snake is a deformable
contour that is designed to identify the boundary of a round object The
shape of the snake is determined by a set of wavelet coefficients in a
certain range of scales. Portions of the boundary of a nodule are first
extracted by multiscale edge representation. Then the multiscale edges
are fitted by deformation of the shape of the snake through a change in
the wavelet coefficients by use of a gradient descent algorithm. The
degree of overlap between the fitted snake and the multiscale edges is
calculated as a measure for classification of nodules and false
detections. A total of 242 regions of interest, consisting of 90
nodules and 152 false positives, reported by our existing CAD scheme
are used for evaluation of our method by means of receiver operating
characteristic (ROC) analysis. The false positives are difficult to
distinguish from nodules, because they cannot be removed, even though
various methods for false-positive elimination processes are employed
in our CAD scheme. Our method based on the multiscale edge-guided snake
model yields an area under the ROC curve of 0.74, which can eliminate
15% of false positives with the sacrifice of only one nodule. The
result indicates that our method appears to be effective in the
classification of nodules and false positives, even when difficult
false positives are included. (C) 2003 SPIE and IST.
|
934. | Lehmann, TM, Bredno, J, and Spitzer, K, "On the design of active contours for medical image segmentation - A scheme for classification and construction," METHODS OF INFORMATION IN MEDICINE, vol. 42, pp. 89-98, 2003.
Abstract:
Objectives: To provide a comprehensive bottom-up categorization of
model-based segmentation techniques that allows to select, implement,
and apply well-suited active contour models for segmentation of medical
images, where major challenges are the high variability in shape and
appearance of objects, noise, artifacts, partial occlusions of objects,
and the required reliability and correctness of results.
Methods: We consider the general purpose of segmentation, the dimension
of images, the object representation within the model image and contour
influences, as well as the solution and the parameter selection of the
model. Potentials and limits are characterized for all instances in
each category providing essential information for the application of
active contours to various purposes in medical image processing. Based
on prolaps surgery planning, we exemplify the use of the scheme to
successfully design robust 3D-segmentation.
Results: The construction scheme allows to design robust segmentation
methods, which, in particular, should avoid any gaps of dimension. Such
gaps result from different image domains and value ranges with respect
to the applied model domain and the dimension of relevant subsets for
image influences, respectively.
Conclusions: A general segmentation procedure with sufficient
robustness for medical applications is still missing. IT is shown that
in almost every category, novel techniques are available to improve the
initial snake model, which was introduced in 1987.
|
935. | Tanaka, T, and Torikai, M, "Contour extraction of fetus' head from echocardiogram using SNAKES," IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, vol. E86D, pp. 768-771, 2003.
Abstract:
This paper deals with contour extraction of fetus' head from
echocardiogram and its application to diagnosis in obstetrics. Active
contour model "SNAKES" is modified and used for contour extraction.
After contour extraction we automatically obtained the biparietal
diameter (BPD) and the occipitofrontal. diameter (OFD) from the contour.
|
936. | Jodouin, S, Bentabet, L, Ziou, D, Vaillancourt, J, and Armenakis, C, "Spatial database updating using active contours for multispectral images: application with Landsat 7," ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING, vol. 57, pp. 346-355, 2003.
Abstract:
This paper presents a fully automated approach for area detection and
delineation based on multispectral images and features from a
topographic database. The vectors residing in the database are refined
using active contours (snakes) according to updated information
provided by the multispectral images. The conventional methods of
defining the external energy guiding the deformation of the snake based
on: (1) statistical measures; or (2) gradient-based boundary finding is
often corrupted by poor image quality. Here a method to integrate the
two approaches is proposed using an estimation of the maximum a
posteriori (MAP) segmentation in an effort to form a unified approach
that is robust to noise and poor edges. We further propose to improve
the accuracy of the resulting boundary location and update of the snake
topology. A number of experiments are performed on both synthetic and
LANDSAT 7 images to evaluate the approach. (C) 2003 Published by
Elsevier Science B.V.
|
937. | Zhou, R, Pickup, S, Glickson, JD, Scott, CH, and Ferrari, VA, "Assessment of global and regional myocardial function in the mouse using Cine and tagged MRI," MAGNETIC RESONANCE IN MEDICINE, vol. 49, pp. 760-764, 2003.
Abstract:
Mouse models are expected to play an important role in future
investigations of human cardiac diseases. In the present report, MRI
methods for determining global and regional cardiac function in the
mouse are demonstrated. ECG-gated cine images were acquired in five
C57BL/6 mice at physiological temperatures (37degreesC) and heart rates
of 500 +/- 50 beats per minute. Left ventricular mass, ejection
fraction, and cardiac output were estimated from the resulting images.
Regional myocardial function was also determined in three animals by
application of 2D SPAtial Modulation of Magnetization (SPAMM) in
combination with the cine protocol. The quality of the tagged images
was sufficient to allow mapping of myocardial strains and
displacements. The results of the regional strain analysis were
consistent with similar studies in larger animals. This work
demonstrates the first characterization of regional myocardial function
in the mouse via SPAMM techniques. (C) 2003 Wiley-Liss, Inc.
|
938. | Kang, HW, and Shin, SY, "Enhanced lane: interactive image segmentation by incremental path map construction," GRAPHICAL MODELS, vol. 64, pp. 282-303, 2003.
Abstract:
Live-wire type techniques for interactive image segmentation are of
practical use for various applications such as medical image analysis.
digital image composition. etc, Intelligent scissors [5] and live wire
[8] are the representative techniques,, of this type, which are based
on a graph search over an entire image. Another technique called live
lane [8] is also based on a graph search but localizes the search
domain to give in interactive feedback. Compared to the live wire, the
live lane trades off the repeatability of segmentation for its time
efficiency. In this paper. we present a novel image segmentation
technique called enhanced modified lane, a modified version of the live
lane that ensures both efficiency and repeatability. B restricting the
search domain and Updating the path map incrementally. the enhanced
lane can extract objects from an image interactively with its
efficiency comparable to that of the live lane while also keeping its
repeatability comparable to that of the Iive wire, Based on the live
lane paradigm, our technique also differs from the time-efficient
version of live wire callcd live wire on the fly [9]: the enhanced lane
always guarantees strictly bounded response time regardless of the
image size and follows the target boundary with little digression which
leads to better repeatability. (C) 2003 Elsevier Science (USA). All
rights reserved.
|
939. | Koschan, A, Kang, SK, Paik, J, Abidi, B, and Abidi, M, "Color active shape models for tracking non-rigid objects," PATTERN RECOGNITION LETTERS, vol. 24, pp. 1751-1765, 2003.
Abstract:
Active shape models can be applied to tracking non-rigid objects in
video image sequences. Traditionally these models do not include color
information in their formulation. In this paper, we present a
hierarchical realization of an enhanced active shape model for color
video tracking and we study the performance of both hierarchical and
non-hierarchical implementations in the RGB, YUV, and HSI color spaces.
(C) 2002 Elsevier Science B.V. All rights reserved.
|
940. | Mitiche, A, Feghali, R, and Mansouri, A, "Motion tracking as spatio-temporal motion boundary detection," ROBOTICS AND AUTONOMOUS SYSTEMS, vol. 43, pp. 39-50, 2003.
Abstract:
The purpose of this study is to investigate tracking of moving objects
in a sequence of images by detecting the surface generated by motion
boundaries in the space-time domain. Estimation of this spatio-temporal
surface is formulated as a Bayesian image partitioning problem.
Minimization of the resulting energy functional seeks a solution biased
toward smooth closed surfaces which coincide with motion boundaries,
have small area, and partition the image into regions of contrasting
motion activity. The Euler-Lagrange partial differential equations of
minimization are expressed as level set evolution equations to obtain a
topology independent and numerically stable algorithm. The formulation
does not require estimation of the image motion field or assume a known
background. It allows multiple non-simultaneous independent motions to
occur and can account for camera motion without prior estimation of
this motion. The analysis assumes short-range image motion. With moving
cameras, it assumes that this short-range motion varies smoothly
everywhere except across motion boundaries. (C) 2003 Elsevier Science
B.V. All rights reserved.
|
941. | Kamijo, S, Matsushita, Y, Ikeuchi, K, and Sakauchi, M, "An occlusion-robust tracking algorithm based on a spatiotemporal Markov random field model," ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, vol. 86, pp. 73-86, 2003.
Abstract:
The tracking of vehicles on images is important as a baseline
technology for applying ITS image processing to the detection of
abnormal phenomena such as accidents. However, up to now one of the
most difficult problems in vehicle tracking has been occlusion, which
creates a difficult environment for realizing stable tracking. This has
been particularly true in our research, because our objects of study
are large intersections in which an average of 20 vehicles are present
at the same time, of various sizes and shapes, and so on. The various
motions of these vehicles, also generate various conditions under which
occlusion can occur. In tracking under these circumstances, it is
necessary to use a paradigm different from those used previously, which
assume a model of rectilinear motion, largely vacant intersections,
predictions based on straight-line trajectories, and specific vehicle
shapes: To solve this problem, we developed an algorithm that makes use
of the Markov. random field (MRF) model; generalized beyond a single
image to include temporal sequences of images, and evaluated its degree
of accuracy based on spatiotemporal correlation of textures from one
image to the one immediately following it and the connection of loci
followed by the moving bodies. The results were further optimized by
stochastic relaxation of the energy distributions exhibited by images
from this space-time MRF, which makes the tracking robust against
various forms of occlusion. We applied this space-time MRF to image
data taken over about 25 minutes, tracking 3214 vehicles moving through
an intersection under conditions of heavy congestion. Our results
showed that the tracking was successful with a 99% probability when the
vehicles being tracked generated no occlusions, while for the 541 cars
that did cause occlusions the probability of successfully tracking
multiple cars and distinguishing the separate vehicles through the
occlusions was 95%: Because this algorithm uses information obtained
from black-and-white images only, and can be implemented without any
prior hypotheses about the vehicle's shape etc. it is useful over long
periods of time and under a broad range of conditions: For this reason,
we anticipate that it will be effective for detecting accidents and
other; anomalies in traffic at intersections. (C) 2003 Wiley
Periodicals, Inc.
|
942. | Tsai, A, Yezzi, A, Wells, W, Tempany, C, Tucker, D, Fan, A, Grimson, WE, and Willsky, A, "A shape-based approach to the segmentation of medical imagery using level sets," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 22, pp. 137-154, 2003.
Abstract:
We propose a shape-based approach to curve evolution for the
segmentation of medical images containing known object types. In
particular, motivated by the work of Leventon, Grimson, and Faugeras
[15], we derive a parametric model for an implicit representation of
the segmenting curve by applying principal component analysis to a
collection of signed distance representations of the training data. The
parameters of this representation are then manipulated to minimize an
objective function for segmentation. The resulting algorithm is able to
handle multidimensional data, can deal with topological changes of the
curve, is robust to noise and initial contour placements, and is
computationally efficient. At the same time, it avoids the need for
point correspondences during the training phase of the algorithm. We
demonstrate this technique by applying it to two medical applications;
two-dimensional segmentation of cardiac magnetic resonance imaging
(MRI) and three-dimensional segmentation of prostate MRI.
|
943. | Dosil, R, and Pardo, XM, "Generalized ellipsoids and anisotropic filtering for segmentation improvement in 3D medical imaging," IMAGE AND VISION COMPUTING, vol. 21, pp. 325-343, 2003.
Abstract:
Deformable models have demonstrated to be very useful techniques for
image segmentation. However, they present several weak points. Two of
the main problems with deformable models are the following: (1) results
are often dependent on the initial model location. and (2) the
generation of image potentials is very sensitive to noise. Modeling and
preprocessing methods presented in this paper contribute to solve these
problems. We propose an initialization tool to obtain a good
approximation to global shape and location of a given object into a 3D
image. We also introduce a novel technique for corner preserving
anisotropic diffusion filtering to improve contrast and corner
measures. This is useful for both guiding initialization (global shape)
and subsequent deformation for fine tuning (local shape). (C) 2003
Elsevier Science B.V. All rights reserved.
|
944. | Jehan-Besson, S, Barlaud, M, and Aubert, G, "DREAM(2)S: Deformable Regions driven by an Eulerian Accurate Minimization Method for image and video Segmentation," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 53, pp. 45-70, 2003.
Abstract:
This paper deals with image and video segmentation using active
contours. We propose a general form for the energy functional related
to region-based active contours. We compute the associated evolution
equation using shape derivation tools and accounting for the evolving
region-based terms. Then we apply this general framework to compute the
evolution equation from functionals that include various statistical
measures of homogeneity for the region to be segmented. Experimental
results show that the determinant of the covariance matrix appears to
be a very relevant tool for segmentation of homogeneous color regions.
As an example, it has been successfully applied to face segmentation in
real video sequences.
|
945. | Les, Z, and Les, M, "Shape understanding system: understanding a convex object," JOURNAL OF ELECTRONIC IMAGING, vol. 12, pp. 327-341, 2003.
Abstract:
A method for understanding convex objects is presented. Convex objects
frequently appear in many fields of research and engineering. Research
into the problem of understanding convex objects has been carried out
as part of wider investigations related to the method of shape
understanding, implemented as a shape understanding system (SUS), The
main novelty of the presented method is that the process of
understanding a convex object is related to the visual concept
represented as a symbolic name of the possible classes of shapes., The
possible classes of shapes are viewed as a hierarchical structure,
where at each level of description the different aspects of shape are
incorporated into the shape model. The new "intelligent" way of
processing is proposed, in which at each stage of the reasoning process
that leads to assigning an examined object to one of the possible
classes, the specialized processing methods are used. These methods are
very efficient because they deal with a specific class of objects. The
proposed shape understanding system is designed to interpret visual
data in terms of shape properties to perform tasks that require higher
levels of understanding capabilities. (C) 2003 SPIE and IST.
|
946. | Liu, F, Luo, XP, Song, XD, and Hu, DC, "Active surface model-based adaptive thresholding algorithm by repulsive external force," JOURNAL OF ELECTRONIC IMAGING, vol. 12, pp. 299-306, 2003.
Abstract:
Inspired by the idea that threshold surface always intersects the image
surface at high gradient points, an active surface-based adaptive
thresholding algorithm is proposed to get the binarized result. In this
model, the external force is designed to be repulsive from the image
surface, thus at the equilibrium state the active surface tends to
cover the, supporting points of high gradient with smooth property. as
well as be away from the image surface locally, which makes the
obtained. threshold surface properly, separate the foreground and
background. The description of the algorithm,is. in a simple and
reasonable energy functional form, and only two parameters need to be
tuned, which gives more convenience to the operation. Analysis and
comparison for the, experimental. results reveal that it cannot only
give the proper thresholding result but also restrain the occurrence of
the ghost phenomenon. (C) 2003 SPIE and IST.
|
947. | Itskovich, VV, Lieb, M, Aguinaldo, JGS, Samber, DD, Ramirez, F, and Fayad, ZA, "Magnetic resonance microscopy quantifies the disease progression in Marfan syndrome mice," JOURNAL OF MAGNETIC RESONANCE IMAGING, vol. 17, pp. 435-439, 2003.
Abstract:
Purpose: To use noninvasive magnetic resonance microscopy (MRM) to
examine aneurysmal disease in the mouse model of Marfan syndrome (MFS).
Materials and Methods: A total of eight wild-type (WT) and MFS mice
were imaged using MRM; four of them at three different time points over
an 8-week period and the remaining animals were imaged at one time
point. The maximal cross-sectional area of the aorta was measured by
manual tracing and by automated means from combined cardiac and
respiratory-gated bright blood images. Relationships between aortic
size and age and the differences between WT and mutant mice aortic size
were established.
Results: Maximal cross-sectional aortic areas differed significantly (P
< 0.05) between WT and mutant mice for all time points, with MFS mice
having larger aortic size. There was a positive correlation between
aortic size and age in MFS mice (r = 0.80) with a significant increase
from the 14th to the 22nd week (P < 0.05).
Conclusion: MRM detected the differences in aortic size between WT and
mutant mice over time, demonstrating a potential for noninvasive
technique for the assessment of potential therapies in MFS mice.
|
948. | Matwyschuk, A, Ambs, P, and Christnacher, F, "Target tracking correlator assisted by a snake-based optical segmentation method," OPTICS COMMUNICATIONS, vol. 219, pp. 125-137, 2003.
Abstract:
To improve the efficiency of a target tracking correlator, we have
developed a snake-based segmentation method of extracting the target
from the reference window. This method uses the snake method in the
spatial domain. The purpose is to darken the target background in order
to avoid its disruptive influence on the tracking. Even if the contour
does not fit the target perfectly, the reference window contains enough
details for us to obtain a good correlation peak. With a new
optimisation criterion, an optical image preprocessing and an iris
diaphragm, the extraction is achieved with a negligible reaction time
in comparison with the target tracking. A complete tracking correlator
based on the joint transform architecture, including a holographic edge
enhancement filter and a "snake"-based optical segmentation was
constructed and tested successfully. (C) 2003 Elsevier Science B.V. All
rights reserved.
|
949. | Richard, FJP, and Cohen, LD, "A new Image Registration technique with free boundary constraints: application to mammography," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 89, pp. 166-196, 2003.
Abstract:
In this paper, a new image-matching mathematical model is presented
with its application to mammogram registration. In a variational
framework, an energy minimization problem is formulated and a multigrid
resolution algorithm is designed. The model focuses on the matching of
regions of interest. It also combines several constraints which are
both intensity- and segmentation-based. A new feature of our model is
combining region matching and segmentation by formulation of the energy
minimization problem with free boundary conditions. Moreover, the
energy has a new registration constraint. The performances of the new
model and an equivalent model with fixed boundary conditions are
compared on simulated mammogram pairs. It is shown that the model with
free boundary is more robust to initialization inaccuracies than the
one with fixed boundary conditions. Both models are applied to several
real bilateral mammogram pairs. The model ability to compensate
significantly for some normal differences between mammograms is
illustrated. Results suggest that the new model could enable some
improvements of mammogram comparisons and tumor detection system
performances. (C) 2003 Elsevier Science (USA). All rights reserved.
|
950. | Kim, DY, Kim, JH, Noh, SM, and Park, JW, "Pulmonary nodule detection using chest CT images," ACTA RADIOLOGICA, vol. 44, pp. 252-257, 2003.
Abstract:
Purpose: Automated methods for the detection of pulmonary nodules and
nodule volume calculation on CT are described.
Material and Methods: Gray-level threshold methods were used to segment
the thorax from the background and then the lung parenchyma from the
thoracic wall and mediastinum. A deformable model was applied to
segment the lung boundaries, and the segmentation results were compared
with the thresholding method. The lesions that had high gray values
were extracted from the segmented lung parenchyma. The selected lesions
included nodules, blood vessels and partial volume effects. The
discriminating features such as size, solid shape, average, standard
deviation and correlation coefficient of selected lesions were used to
distinguish true nodules from pseudolesions. With texture features of
true nodules, the contour-following method, which tracks the segmented
lung boundaries, was applied to detect juxtapleural nodules that were
contiguous to the pleural surface. Volume and circularity calculations
were performed for each identified nodule. The identified nodules were
sorted in descending order of volume. These methods were applied to 827
image slices of 24 cases.
Results: Computer-aided diagnosis gave a nodule detection sensitivity
of 96% and no false-positive findings.
Conclusion: The computer-aided diagnosis scheme was useful for
pulmonary nodule detection and gave characteristics of detected nodules.
|
951. | Kimmel, R, and Bruckstein, AM, "Regularized Laplacian zero crossings as optimal edge integrators," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 53, pp. 225-243, 2003.
Abstract:
We view the fundamental edge integration problem for object
segmentation in a geometric variational framework. First we show that
the classical zero-crossings of the image Laplacian edge detector as
suggested by Marr and Hildreth, inherently provides optimal
edge-integration with regard to a very natural geometric functional.
This functional accumulates the inner product between the normal to the
edge and the gray level image-gradient along the edge. We use this
observation to derive new and highly accurate active contours based on
this functional and regularized by previously proposed geodesic active
contour geometric variational models. We also incorporate a 2D
geometric variational explanation to the Haralick edge detector into
the geometric active contour framework.
|
952. | Erdem, CE, Tekalp, AM, and Sankur, B, "Video object tracking with feedback of performance measures," IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, vol. 13, pp. 310-324, 2003.
Abstract:
We present a scalable object tracking framework, which is capable of
tracking the contour of nonrigid objects in the presence of occlusion.
The framework consists of open-loop boundary prediction and closed-loop
boundary correction parts. The open-loop prediction block adaptively
divides the object contour into subcontours, and estimates the mapping
parameters for each subsegment. The closed-loop boundary correction
block employs a suitably weighted combination of low-level features
such as color edge, color segmentation, motion models, and motion
segmentation for each subcontour. Performance evaluation measures are
used in a feedback loop to evaluate the goodness of the
segmentation/tracking in order to adjust the weights assigned to each
of these low-level features for each subcontour at each frame. The
framework is scalable because it can be adapted to track a coarse
estimate of the boundary of selected objects in real-time, as well as
pixel-accurate boundary tracking in off-line mode. The proposed method
does,not depend on any single motion or shape model, and does not need
training. Experimental results demonstrate that the algorithm is able
to track the object boundaries under significant occlusion and.
background clutter.
|
953. | Lee, KM, and Street, WN, "An adaptive resource-allocating network for automated detection, segmentation, and classification of breast cancer nuclei topic area: Image processing and recognition," IEEE TRANSACTIONS ON NEURAL NETWORKS, vol. 14, pp. 680-687, 2003.
Abstract:
This paper presents a unified image analysis approach for automated
detection, segmentation, and classification of breast cancer nuclei
using a neural network, which learns to cluster shapes and to classify
nuclei. The proposed neural network is incrementally grown by creating
a new cluster whenever a previously unseen shape is presented. Each
hidden node represents a cluster used as a template to provide faster
and more accurate nuclei detection and segmentation. On-line learning
gives the system improved performance with continued use. The
effectiveness of the resulting system is demonstrated on a task of
cytological image analysis, with classification of individual nuclei
used to diagnose the sample. This demonstrates the potential
effectiveness of such a system on diagnostic tasks that require the
classification of individual cells.
|
954. | Shao, F, Ling, KV, Ng, WS, and Wu, RY, "Prostate boundary detection from ultrasonographic images," JOURNAL OF ULTRASOUND IN MEDICINE, vol. 22, pp. 605-623, 2003.
Abstract:
Objective. Prostate diseases are very common in adult and elderly men,
and prostate boundary detection from ultrasonographic images plays a
key role in prostate disease diagnosis and treatment. However, because
of the poor quality of ultrasonographic images, prostate boundary
detection still remains a challenging task. Currently, this task is
performed manually, which is arduous and heavily user dependent. To
improve the efficiency by automating the boundary detection process,
numerous methods have been proposed. We present a review of these
methods, aiming to find a good solution that could efficiently detect
the prostate boundary on ultrasonographic images. Methods. A full
description of various methods is beyond the scope of this article;
instead, we focus on providing an introduction to the different methods
with a discussion of their advantages and disadvantages. Moreover,
verification methods for estimating the accuracies of the algorithms
reported in the literature are discussed as well. Results. From the
investigation, we summarize several key issues that might be confronted
and project possible future research. Conclusions. Those model-based
methods that minimize user involvement but allow for interactive
guidance of experts will likely be most immediately successful.
|
955. | Lie, WN, and Chuang, CH, "Contour-based image registration with local deformations," OPTICAL ENGINEERING, vol. 42, pp. 1405-1416, 2003.
Abstract:
This research is focused on the study of local-type image registration
techniques, which concern pixel mapping between two correlated images.
with both global and local deformations. Our algorithm is
object-contour-based, meaning that control points that conduct the
transformation are adaptively selected from the matched contour points.
It is novel in two important respects. First, we propose to match
object contours in the source and target images by using
locally-maximal-curvature points and curve projection. Second, the
selection of control points is capable of adapting to both global and
local deformations, normally being denser in contour segments with
substantial local deformations. The proposed scheme is also hybrid in
the sense that local contour matching and global surface-spline fitting
of control points are combined. Simulations and some comparisons are
made by using infrared thermographs and ordinary gray images.
Experiments show better registration accuracy of object contours than
with traditional methods such as elastic or curvature scale space
matching. (C) 2003 Society of Photo-Optical Instrumentation Engineers.
|
956. | Straub, BM, Gerke, M, and Pahl, M, "Automatic mapping of settlement areas using a knowledge-based image interpretation system," COMPUTER VISION SYSTEMS, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2626, pp. 355-364, 2003.
Abstract:
We introduce the knowledge-based image interpretation system GeoAIDA
and give examples for an image operator, extracting trees from aerial
imagery. Moreover we present a generic grouping approach, based on the
Relative Neighborhood Graph. The application of the tree operator to a
test site shows that the introduced approach for the delineation of
trees using Active Contour Models leads to good results. The grouping
algorithm is used in order to identify building rows. In the paper we
shortly describe the theory of the image operator, and the performance
of the whole system is demonstrated by means of examples. Results from
a test area show that the information about building rows can be used
for the enhancement of the building reconstruction.
|
957. | Goldenstein, SK, Vogler, C, and Metaxas, D, "Statistical cue integration in DAG deformable models," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 25, pp. 801-813, 2003.
Abstract:
Deformable models are a useful modeling paradigm in computer vision. A
deformable model is a curve, a surface, or a volume, whose shape,
position, and orientation are controlled through a set of parameters.
They can represent manufactured objects, human faces and skeletons, and
even bodies of fluid. With low-level computer vision and image
processing techniques, such as optical flow, we extract relevant
information from images. Then, we use this information to change the
parameters of the model iteratively until we find a good approximation
of the object in the images. When we have multiple computer vision
algorithms providing distinct sources of information (cues), we have to
deal with the difficult problem of combining these, sometimes
conflicting contributions in a sensible way. In this paper, we
introduce the use of a directed acyclic graph (DAG) to describe the
position and Jacobian of each point of deformable models. This
representation is dynamic, flexible, and allows computational
optimizations that would be difficult to do otherwise. We then describe
a new method for statistical cue integration method for tracking
deformable models that scales well with the dimension of the parameter
space. We use affine forms and affine arithmetic to represent and
propagate the cues and their regions of confidence. We show that we can
apply the Lindeberg theorem to approximate each cue with a Gaussian
distribution, and can use a maximum-likelihood estimator to integrate
them. Finally, we demonstrate the technique at work in a 3D cleformable
face tracking system on monocular image sequences with thousands of
frames.
|
958. | Cremers, D, Kohlberger, T, and Schnorr, C, "Shape statistics in kernel space for variational image segmentation," PATTERN RECOGNITION, vol. 36, pp. 1929-1943, 2003.
Abstract:
We present a variational integration of nonlinear shape statistics into
a Mumford-Shah based segmentation process. The nonlinear statistics are
derived from a set of training silhouettes by a novel method of density
estimation which can be considered as an extension of kernel PICA to a
probabilistic framework.
We assume that the training data forms a Gaussian distribution after a
nonlinear mapping to a higher-dimensional feature space. Due to the
strong nonlinearity, the corresponding density estimate in the original
space is highly non-Gaussian.
Applications of the nonlinear shape statistics in segmentation and
tracking of 2D and 3D objects demonstrate that the segmentation process
can incorporate knowledge on a large variety of complex real-world
shapes. It makes the segmentation process robust against misleading
information due to noise, clutter and occlusion. (C) 2003 Pattern
Recognition Society. Published by Elsevier Science Ltd. All rights
reserved.
|
959. | Sugioka, K, Hozumi, T, Yagi, T, Yamamuro, A, Akasaka, T, Takeuchi, K, Homma, S, Yoshida, K, and Yoshikawa, J, "Automated quantification of left ventricular function by the automated contour tracking method," ECHOCARDIOGRAPHY-A JOURNAL OF CARDIOVASCULAR ULTRASOUND AND ALLIED TECHNIQUES, vol. 20, pp. 313-318, 2003.
Abstract:
The automated contour tracking (ACT) method has been developed for the
automated measurement of area volume using the energy minimization
method without tracing a region of interest. The purpose of this study
was to compare the ACT method and left ventriculography (LVG) for the
measurement of left ventricular (LV) function in the clinical setting.
An apical four-chamber view was visualized by two-dimensional
echocardiography and recorded for off-line analysis in 14 patients with
high-quality images who underwent LVG The ACT method automatically
traces the endocardial border from the recorded images and calculates
LV volumes (end-diastole and end-systole) and ejection fraction (EF).
Both ACT and LVG were compared by linear regression analysis for the
measurement of EF EF determined by the ACT method agreed well with that
by LVG (r = 0.96, y = 0.94x + 4.6, standard error of the estimate =
3.9%). The mean difference between the ACT and LVG was -1.4% +/- 7.3%.
In conclusion, the ACT method is reliable for noninvasive estimation of
EF in high-quality images. This suggests that this new technique may be
useful in the automated quantification of LV function.
(ECHOCARDIOGRAPHY, Volume 20, May 2003).
|
960. | Paragios, N, "A level set approach for shape-driven segmentation and tracking of the left ventricle," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 22, pp. 773-776, 2003.
Abstract:
Knowledge-based segmentation has been explored significantly in medical
imaging. Prior anatomical knowledge can be used to define constraints
that can improve performance of segmentation algorithms to physically
corrupted and incomplete data. In this paper, the objective is to
introduce such knowledge-based constraints while preserving the ability
of dealing with local deformations. Toward this end, we propose a
variational level set framework that can account for global shape
consistency as well as for local deformations. In order to improve
performance, the problems of segmentation and tracking of the structure
of interest are dealt with simultaneously by introducing the notion of
time in the process and looking for a solution that satisfies that
prior constraints while being consistent along consecutive frames.
Promising experimental results in magnetic resonance and ultrasonic
cardiac images demonstrate the potentials of our approach.
|
961. | Chen, SYJ, and Carroll, JD, "Kinematic and deformation analysis of 4-D coronary arterial trees reconstructed from cine angiograms," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 22, pp. 710-721, 2003.
Abstract:
In the cardiovascular arena, percutaneous catheter-based interventional
(i.e., therapeutic) procedures include a variety of coronary and other
vascular system interventions. These procedures use two-dimensional
(2-D) X-ray-based imaging as the sole or the major imaging modality for
procedure guidance and quantification of key parameters. Coronary
vascular curvilinearity is one key parameter that requires a
four-dimensional (4-D) format, i.e., three-dimensional (3-D) anatomical
representation that changes during the cardiac cycle. A new method has
been developed for reconstruction and analysis of these
patient-specific 4-D datasets utilizing routine cine angiograms. The
proposed method consists of three major processes: 1) reconstruction of
moving coronary arterial tree throughout the cardiac cycle; 2)
establishment of temporal correspondence with smoothness constraints;
and 3) kinematic and deformation analysis of the reconstructed 3-D
moving coronary arterial trees throughout the cardiac cycle.
|
962. | Le Thuc, V, Taleb-Ahmed, A, Leclerc, X, and Saint Michel, T, "Method to segment the brain automatically applied to a magnetic resonance imaging sequence," OPTICAL ENGINEERING, vol. 42, pp. 1976-1992, 2003.
Abstract:
The purpose of this preliminary study is to segment the brain on
magnetic resonance (MR) images by using a robust and fully automatic
method. A 2-D T2-weighted MR sequence is used as a reference for
imaging the brain. Our segmentation technique could segment the brain
in each slice taken from different MR scanners using different image
resolutions and MR sequences. This method is based on an integrated
approach that uses image processing techniques and a priori knowledge.
The originality of our work is to integrate the 3-D information of the
sequence in the geometrical approach, to adapt this method for other MR
imaging modalities, and to use only one MR sequence to segment the
whole brain. This is a multistage process requiring the background
noise to be removed, and the head mask is then obtained thanks to the
combination of a recursive filling technique and geometrical properties
of the brain. We describe the main features of the method, and give
results for some brain studies. (C) 2003 Society of Photo-Optical
Instrumentation Engineers.
|
963. | Fan, ZM, Zhou, J, and Gao, DS, "A robust algorithm of contour extraction for vehicle tracking," CHINESE JOURNAL OF ELECTRONICS, vol. 12, pp. 358-361, 2003.
Abstract:
Contour extraction of moving vehicle is an important and challenging
issue in traffic surveillance. In this paper, a robust algorithm is
proposed for contour extraction and moving vehicle tracking. First, we
establish a modified snake model and utilize the directional
information of the edge map to guide the snaxels' behavior. Then an
adaptive shape restriction is embedded into the algorithm to govern the
scope of the snake's motion, and Kalman filter is employed to estimate
spatio-temporal relationship between successive frames. In addition,
multiple refinements are suggested to compensate for the snake's
vulnerability to fake edges. All of them contribute to a robust overall
performance in contour extraction and vehicle tracking. Experimental
results in real traffic scene prove the effectiveness of our algorithm.
The comparison with conventional snakes is also provided.
|
964. | Kaus, MR, Pekar, V, Lorenz, C, Truyen, R, Lobregt, S, and Weese, J, "Automated 3-D PDM construction from segmented images using deformable models," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 22, pp. 1005-1013, 2003.
Abstract:
In recent years, several methods have been proposed for constructing
statistical shape models to aid image analysis tasks by providing a
priori knowledge. Examples include principal component analysis of
manually or semiautomatically placed corresponding landmarks on the
learning shapes [point distribution models (PDMs)], which is time
consuming and subjective. However, automatically establishing surface
correspondences continues to be a difficult problem. This paper
presents a novel method for the automated construction of
three-dimensional PDM from segmented images. Corresponding surface
landmarks are established by adapting a triangulated learning shape to
segmented volumetric images of the remaining shapes. The adaptation is
based on a novel deformable model technique. We illustrate our approach
using computed tomography data of the vertebra and the femur. We
demonstrate that our method accurately represents and predicts shapes.
|
965. | Ballerini, L, and Bocchi, L, "Multiple genetic snakes for bone segmentation," APPLICATIONS OF EVOLUTIONARY COMPUTING, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2611, pp. 346-356, 2003.
Abstract:
Clinical assessment of skeletal age is a frequent, but yet difficult
and time-consuming task. Automatic methods which estimate the skeletal
age from a hand radiogram are currently being studied. This work
presents a method to segment each bone complex in the radiogram, using
a modified active contour approach. Each bone is modelled by an
independent contour, while neighbouring contours are coupled by an
elastic force. The optimization of the contour is done using a genetic
algorithm. Experimental results, carried out on a portion of the whole
radiogram, show that coupling of deformable, contours with genetic
optimization allows to obtain an accurate segmentation.
|
966. | Hueber, E, Bigue, L, and Ambs, P, "Active contour segmentation by use of a multichannel incoherent optical correlator," APPLIED OPTICS, vol. 42, pp. 4681-4687, 2003.
Abstract:
We describe an optoelectronic incoherent multichannel processor that is
able to segment an object in a real image. The process is based on an
active contour algorithm that has been transposed to optical signal
processing to accelerate image processing. This implementation requires
exact-valued correlations and thus opens attractive perspectives in
terms of optical analog computation. Furthermore, this optical
multichannel processor setup encourages incoherent processing with
high-resolution images. (C) 2003 Optical Society of America.
|
967. | Galland, F, Bertaux, N, and Refregier, P, "Minimum description length synthetic aperture radar image segmentation," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 12, pp. 995-1006, 2003.
Abstract:
We present a new minimum description length (MDL) approach based on a
deformable partition-a polygonal grid-for automatic segmentation of
speckled image composed of several homogeneous regions. The image
segmentation thus consists in the estimation of the polygonal grid, or,
more precisely, its number of regions, its number of nodes and the
location of its nodes. These estimations are performed by minimizing a
unique MDL criterion which takes into account the probabilistic
properties of speckle fluctuations and a measure of the stochastic
complexity of the polygonal grid. This approach then leads to a global
MDL criterion without undetermined parameter since no other
regularization term than the stochastic complexity of the polygonal
grid is necessary and noise parameters can be estimated with maximum
likelihood-like approaches. The performance of this technique is
illustrated on synthetic and real Synthetic Aperture Radar images of
agricultural regions and the influence of different terms of the model
is analyzed.
|
968. | Constandinou, TG, Lande, TS, and Toumazou, C, "Bio-pulsating architecture for object-based processing in next generation vision systems," ELECTRONICS LETTERS, vol. 39, pp. 1169-1170, 2003.
Abstract:
A novel and robust distributed architecture for real-time object-based
processing is presented for tasks such as object size, centre and count
determination. This approach uses the input image to enclose a feedback
loop and realise a data-driven pulsating action, ideally suited for
implementation in standard CMOS technologies.
|
969. | Charnoz, A, Lingrand, D, and Montagnat, J, "A levelset based method for segmenting the heart in 3D+T gated SPECT images," FUNCTIONAL IMAGING AND MODELING OF THE HEART, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2674, pp. 52-61, 2003.
Abstract:
Levelset methods were introduced in medical images segmentation by
Malladi et al. in 1995. In this paper, we propose several improvements
of the original method to speed up the algorithm convergence and to
improve the quality of the segmentation in the case of cardiac gated
SPECT images.
We studied several evolution criterions, taking into account the
dynamic property of heart image sequences. For each step of the
segmentation algorithm, we have compared different solutions in order
to both reduce time and improve. quality.
We have developed a modular segmentation tool with 3D+T visualization
capabilities to experiment the proposed solutions and tune the
algorithm parameters. We show segmentation results on both simulated
and real SPECT images.
|
970. | Axel, L, "Tagged MRI-based studies of cardiac function," FUNCTIONAL IMAGING AND MODELING OF THE HEART, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2674, pp. 1-7, 2003.
Abstract:
Tagged MRI provides a potentially powerful new way to non-invasively
assess the regional function of the heart. Although its potential has
not yet been fully realized, due to remaining technical limitations in
image acquisition and analysis, good progress is being made to overcome
these limitations. Current research focuses on improving imaging
methods to obtain high resolution 3D spatially registered tagged
images, designing more efficient methods to extract the heart wall
contours and tag positions within the wall from the tagged images, and
implementing efficient ways to reconstruct the 3D motion of the heart
from this data. In addition to the new regional motion and deformation
data that tagged MRI can provide on normal and abnormal cardiac
function, we can potentially use this motion data to model the
corresponding forces within the heart wall.
|
971. | Bentabet, L, Jodouin, S, Ziou, D, and Vaillancourt, J, "Road vectors update using SAR imagery: A snake-based method," IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, vol. 41, pp. 1785-1803, 2003.
Abstract:
The paper presents an approach for roads detection based on synthetic
aperture radar (SAR) images and road databases. The vectors provided by
the database are refined using active contours (snakes). In this
framework, we firstly develop a restoration filter based on the frost
filter achieving an acceptable compromise between speckle elimination
and lines preserving. This is followed by a line plausibility
calculation step which is used to deform the snake from its initial
location toward the final solution. The snake is reformulated using
finite elements method. The setting of the snake parameters is not an
obvious problem especially when they are tuned by trial-and-error
process. We propose a new automatic computational rule for the snake
parameters. Our approach is validated by a series of tests on synthetic
and SAR images.
|
972. | Giachetti, A, and Zanetti, G, "3D reconstruction of large tubular geometries from CT data," SURGERY SIMULATION AND SOFT TISSUE MODELING, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2673, pp. 132-144, 2003.
Abstract:
In several medical applications it is necessary to have a good
reconstruction of approximately tubular structures-mainly blood vessels
but also intestine or bones-providing a description of both the
internal lumen (usually a triangulated surface) and its networked
structure (skeleton). This description should be such that it allows
lengths and diameters estimation. Several methods have been proposed
for these tasks, each one with advantages and drawbacks and, typically,
specialized to a particular application. We focused our attention on
methods making as few assumptions as possible on the structure to be
determined in order to capture also anomalous features like bulges and
bifurcations. We looked for a method able to obtain surfaces that are
smooth, with a limited number of triangles but accurate and skeletons
that are continuously connected and centered. The results of our work
is the use of customized deformable surface and multi-scale regularized
voxel coding centerlines to obtain geometries and skeletons with the
desired properties. The algorithms are being tested for real clinical
analysis and results are promising.
|
973. | Chandrashekara, R, Mohiaddin, RH, and Rueckert, D, "Analysis of myocardial motion and strain patterns using a cylindrical B-spline transformation model," SURGERY SIMULATION AND SOFT TISSUE MODELING, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2673, pp. 88-99, 2003.
Abstract:
We present a novel method for tracking the motion of the myocardium. in
tagged magnetic resonance (MR) images of the heart using a nonrigid
registration algorithm based on a cylindrical free-form deformation
(FFD) model and the optimization of a cost function based on normalized
mutual information (NMI). The new aspect of our work is that we use a
FFD defined in a cylindrical rather than a Cartesian coordinate system.
This models more closely the geometry and motion of the left ventricle
(LV). Validation results using a cardiac motion simulator and tagged MR
data from 6 normal volunteers are also presented.
|
974. | Kubota, T, "Contextual and non-combinatorial approach to feature extraction," ENERGY MINIMIZATION METHODS IN COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2683, pp. 467-482, 2003.
Abstract:
Extracting features from an image is the first step in many computer
vision applications. Traditionally, features represent physical or
visual primitives such as edges and corners. In this paper, we augment
the definition to include any attributes that conveniently describe the
correlation and contextual relation between the primitive and its
neighbors. The augmentation allows us to design a more detailed
probability distribution model. If the distribution model is
differentiable with respect to each attribute of a feature, a simple
local search will find a feature set that is a local maximum in the
joint probability distribution. Therefore, the final representation is
free from noise and aliasing that perturbs the representation away from
the local maximum. We can apply the approach to many low level vision
tasks. In this paper, we demonstrate our approach with sub-pixel
contour representation and surface reconstruction problems.
|
975. | Goudail, F, Refregier, P, and Ruch, O, "Definition of a signal-to-noise ratio for object segmentation using polygonal MDL-based statistical snakes," ENERGY MINIMIZATION METHODS IN COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2683, pp. 373-388, 2003.
Abstract:
We address the problem of the characterization of segmentation
performance of Minimum Description Length snake techniques in function
of the noise which affects the image. It is shown that a parameter
quantifying the contrast between the object of interest and the
background can be defined from the Bhattacharyya distance. This
contrast parameter is very general since it applies to several
different noise statistics which belong to the exponential family. We
illustrate its relevancy with a segmentation application using a
polygonal snake descriptor.
|
976. | Savadjiev, P, Ferrie, FP, and Siddiqi, K, "Surface recovery from 3D point data using a combined parametric and geometric flow approach," ENERGY MINIMIZATION METHODS IN COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2683, pp. 325-340, 2003.
Abstract:
This paper presents a novel method for surface recovery from discrete
3D point data sets. In order to produce improved reconstruction
results, the algorithm presented in this paper combines the advantages
of a parametric approach to model local surface structure, with the
generality and the topological adaptability of a geometric flow
approach. This hybrid method is specifically designed to preserve
discontinuities in 3D, to be robust to noise, and to reconstruct
objects with arbitrary topologies. The key ideas are to tailor a
curvature consistency algorithm to the case of a set of points in 3D
and to then incorporate a flux maximizing geometric flow for surface
reconstruction. The approach is illustrated with experimental results
on a variety of data sets.
|
977. | Chen, YM, Guo, WH, Huang, F, Wilson, D, and Geiser, EA, "Using prior shape and points in medical image segmentation," ENERGY MINIMIZATION METHODS IN COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2683, pp. 291-305, 2003.
Abstract:
In this paper we present a new variational framework in level set form
for image segmentation, which incorporates both a prior shape and prior
fixed locations of a small number of points. The idea underlying the
model is the creation of two energy terms in the energy function for
the geodesic active contours. The first energy term is for the shape,
the second for the locations of the points In this model, segmentation
is achieved through a registration technique, which combines a rigid
transformation and a local deformation. The rigid transformation is
determined explicitly by using shape information, while the local
deformation is determined implicitly by using image gradients and prior
locations. We report experimental results on both synthetic and
ultrasound images. These results compared with the results obtained by
using a previously reported model, which only incorporates a shape
prior into the active contours.
|
978. | Ivekovic, S, and Leonardis, A, "Multiresolution approach to biomedical image segmentation with statistical models of appearance," SCALE SPACE METHODS IN COMPUTER VISION, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2695, pp. 667-682, 2003.
Abstract:
Structural variability present in biomedical images is known to
aggravate the segmentation process. Statistical models of appearance
proved successful in exploiting the structural variability information
in the learning set to segment a previously unseen medical image more
reliably. In this paper we show that biomedical image segmentation with
statistical models of appearance can be improved in terms of accuracy
and efficiency by a multiresolution approach. We outline two different
multiresolution approaches. The first demonstrates a straightforward
extension of the original statistical model and uses a pyramid of
statistical models to segment the input image on various resolution
levels. The second applies the idea of direct coefficient propagation
through the Gaussian image pyramid and uses only one statistical model
to perform the multiresolution segmentation in a much simpler manner.
Experimental results illustrate the scale of improvement achieved by
using the multiresolution approaches described. Possible further
improvements are discussed at the end.
|
979. | Saitoh, T, Aoki, K, and Kaneko, T, "Automatic extraction of object region from photographs," IMAGE ANALYSIS, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2749, pp. 1130-1137, 2003.
Abstract:
This paper presents a new method for automatically extracting an object
region from a photograph based upon a well-known method "Intelligent
Scissors" (IS). For our application, it will be shown that (1) the cost
should not be based on accumulated cost adopted by IS but rather on
average cost and (2) only a few past pixels are needed for deciding the
future route. It will be shown that our new method will be able to
extract object region with a correct rate of approximately 93% if
object images are well-focused.
|
980. | Langs, G, Peloschek, P, and Bischof, H, "ASM driven snakes in rheumatoid arthritis assessment," IMAGE ANALYSIS, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2749, pp. 454-461, 2003.
Abstract:
In this paper a method is proposed that combines active shape models
(ASM) and active contours (snakes) in order to identify fine structured
contours with high accuracy and stability. Based on an estimate of the
contour position by an active shape model the accuracy of the landmarks
and the contour in between is enhanced by applying an iterative active
contour algorithm to a set of gray value profiles extracted
orthogonally to the interpolation obtained by the ASM. The active shape
model is trained with a set of training shapes, whereas the snake
detects the contour with fewer constraints. This is of particular
importance for the assessment of pathological changes of bones like
erosive destructions caused by rheumatoid arthritis.
|
981. | Ballerini, L, "Multiple genetic snakes for people segmentation in video sequences," IMAGE ANALYSIS, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2749, pp. 275-282, 2003.
Abstract:
In this paper we propose a method for finding people and segmenting
their body parts in video image sequences. We propose the use of
Genetic Snakes, that are active contour models, also known as snakes,
with an energy minimization procedure based on Genetic Algorithms (GA).
Genetic Snakes have been proposed to overcome some limits of the
classical snakes, as initialization and existence of multiple minima,
and have been successfully applied to images from different domains. We
extend the formulation of Genetic Snakes in two ways, by adding an
elastic force that couples multiple contours together and by applying
them to color images. Experimental results, carried out on images
acquired in our lab, are described.
|
982. | Krug, R, Boese, JM, and Schad, LR, "Determination of aortic compliance from magnetic resonance images using an automatic active contour model," PHYSICS IN MEDICINE AND BIOLOGY, vol. 48, pp. 2391-2404, 2003.
Abstract:
The possibility of monitoring changes in aortic elasticity in humans
has important applications for clinical trials because it estimates the
efficacy of plaque-reducing therapies. The elasticity is usually
quantified by compliance measurements. Therefore, the relative temporal
change in the vessel cross-sectional area throughout the cardiac cycle
has to be determined. fit this work we determined and compared the
compliance between three magnetic resonance (MR) methods (FLASH,
TrueFISP and pulse-wave). Since manual outlining of the aortic wall
area is a very time-consuming process and depends on an operator's
variability, an algorithm for the automatic segmentation of the artery
wall from MR images through the entire heart cycle is presented. The
reliable detection of the artery cross-sectional area over the whole
heart cycle was possible with a relative error of about 1%. Optimizing
the temporal resolution to 60 ms we obtained a relative error in
compliance of about 7% from TrueFISP (1.0 x 1.0 x 10 mm(3),
signal-to-noise ratio (SNR) > 12) and FLASH (0.7 x 0.7 x 10 mm(3), SNR
> 12) measurements in volunteers. Pulse-wave measurements yielded an
error of more than 9%. In a study of ten volunteers, a compliance
between C = 3 x 10(-5) Pa-1 and C = 8 x 10(-5) Pa-1 was determined,
depending on age. The results of the TrueFISP and the pulse-wave
measurements agreed very well with one another (confidence interval of
1 x 10(-5) Pa-1) while the results of the FLASH method more clearly
deviated from the TrueFISP and pulse-wave (confidence interval of more
than 2 x 10(-5) Pa-1).
|
983. | Bischoff, S, and Kobbelt, L, "Sub-voxel topology control for level-set surfaces," COMPUTER GRAPHICS FORUM, vol. 22, pp. 273-280, 2003.
Abstract:
Active contour models are an efficient, accurate, and robust tool for
the segmentation of 2D and 3D image data. In particular, geometric
deformable models (GDM) that represent an active contour as the level
set of an implicit function have proven to be very effective. GDMs,
however, do not provide any topology control, i.e. contours may merge
or split arbitrarily and hence change the genus of the reconstructed
surface. This behavior is inadequate in settings like the segmentation
of organic tissue or other objects whose genus is known beforehand. In
this paper we describe a novel method to overcome this limitation while
still preserving the favorable properties of the GDM setup. We achieve
this by adding (sparse) topological information to the volume
representation at locations where it is necessary to locally resolve
topological ambiguities. Since the sparse topology information is
attached to the edges of the voxel grid, we can reconstruct the
interfaces where the deformable surface touches itself at sub-voxel
accuracy. We also demonstrate the efficiency and robustness of our
method.
|
984. | Kawata, Y, Niki, N, Ohmatsu, H, and Moriyama, N, "A deformable surface model based on boundary and region information for pulmonary nodule segmentation from 3-D thoracic CT images," IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, vol. E86D, pp. 1921-1930, 2003.
Abstract:
Accurately segmenting and quantifying pulmonary nodule structure is a
key issue in three-dimensional (3-D) computer-aided diagnosis (CAD)
schemes. This paper presents a nodule segmentation method from 3-D
thoracic CT images based on a deformable surface model. In this method,
first, a statistical analysis of the observed intensity is performed to
measure differences between the nodule and other regions. Based on this
analysis, the boundary and region information are represented by
boundary and region likelihood, respectively. Second, an initial
surface in the nodule is manually set. Finally, the deformable surface
model moves the initial surface so that the surface provides high
boundary likelihood and high posterior segmentation probability with
respect to the nodule. For the purpose, the deformable surface model
integrates the boundary and region information. This integration makes
it possible to cope with inappropriate position or size of an initial
surface in the nodule. Using the practical 3-D thoracic CT images, we
demonstrate the effectiveness of the proposed method.
|
985. | Potamianos, G, Neti, C, Gravier, G, Garg, A, and Senior, AW, "Recent advances in the automatic recognition of audiovisual speech," PROCEEDINGS OF THE IEEE, vol. 91, pp. 1306-1326, 2003.
Abstract:
Visual speech information from the speaker's mouth region has been
successfully shown to improve noise robustness of automatic speech
recognizers, thus promising to extend their usability in the human
computer interface. In this paper we review the main, components of
audiovisual automatic speech recognition (ASR) and present novel
contributions in two main areas: first, the visual front-end design,
based on a cascade of linear image transforms of an appropriate video
region of interest, and subsequently, audiovisual speech integration.
On the latter topic, we discuss new work on feature and decision fusion
combination, the modeling of audiovisual speech asynchrony, and
incorporating modality reliability estimates to the bimodal recognition
process: We also briefly touch upon the issue of audiovisual
adaptation. We apply our algorithms to three multisubject bimodal
databases, ranging from small- to, large-vocabulary recognition tasks,
recorded in both visually controlled and challenging environments. Our
experiments demonstrate that the visual modality improves ASR over all
conditions and data considered, though less so for visually challenging
environments and large vocabulary tasks.
|
986. | Pottmann, H, and Leopoldseder, S, "A concept for parametric surface fitting which avoids the parametrization problem," COMPUTER AIDED GEOMETRIC DESIGN, vol. 20, pp. 343-362, 2003.
Abstract:
An active contour model to surface approximation is presented. It
adapts to the model shape to be approximated with help of local
quadratic approximants of the squared distance function. The approach
completely avoids the parametrization problem. The concept is open for
inclusion of smoothing operators and shape constraints. (C) 2003
Elsevier B.V. All rights reserved.
|
987. | Quek, FKH, Yarger, RWI, and Kirbas, C, "Surface parameterization in volumetric images for curvature-based feature classification," IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, vol. 33, pp. 758-765, 2003.
Abstract:
Curvature-based surface features are well suited for use in multimodal
medical image registration. The accuracy of such feature-based
registration, techniques is dependent upon the reliability of the
feature computation. The computation of Curvature. features requires
second derivative information that is best obtained from a parametric
surface representation. We present a method of explicitly
parameterizing surfaces from volumetric data. Surfaces are extracted,
without a global thresholding, using active contour models. A monge
basis for each surface patch is estimated and used to transform the
patch into local, or parametric, coordinates. Surface patches are fit
to a bicubic polynomial in local coordinates using least squares solved
by singular value decomposition. We tested our method by reconstructing
surfaces from the surface in model and analytically computing gaussian
and mean curvatures. The model was tested on analytical and medical
data.
|
988. | Wang, X, He, L, Tang, YJ, and Wee, WG, "A divide and conquer deformable contour method with a model based searching algorithm," IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, vol. 33, pp. 738-751, 2003.
Abstract:
A divide and conquer deformable contour method is presented with an
initial inside closed contour being divided into arbitrary segments,
and these segments are allowed to deform separately preserving the
segments' connectivity. A maximum area threshold, A a., is used to stop
these outward contour segments' marching. Clear and blur contour points
are then identified to partition the whole contour into clear and blur
segments. A bi-directional searching method is then recursively applied
to each blur segment including a search for contour-within-contour
segment to reach a final close contour. Further improvements are
provided by a model based searching algorithm. It is a two-step process
with step 1 being a linked contour model matching operation where
landmarks are extracted, and step 2 being a posteriori probability
model matching and correction operation where large error segments are
fine tuned to obtain the final results. The experiments include
ultrasound images of pig heart, MRI brain images, MRI knee images
having complex shapes with or without gaps, and inhomogeneous interior
and contour region brightness distributions. These experiments have
shown that the method has the capability of moving a contour into the
neighboring region of the desired boundary by overcoming inhomogeneous
interior, and by adapting each contour segment searching operation to
different local difficulties, through a contour partition and
repartition scheme in searching for a final solution.
|
989. | Dal Bello, S, Marchiori, G, Rossi, G, Sonato, P, and Zampato, M, "Development of an image recognition system for RFX first wall maintenance," FUSION ENGINEERING AND DESIGN, vol. 69, pp. 163-168, 2003.
Abstract:
Since the beginning of the machine operation a remote handling system
(RHS) has been used to carry out maintenance tasks inside the RFX
vacuum vessel, such as tile replacement, first wall inspection and
graphite fragment removal. In order to speed up the tile replacement
operations and to increase their reliability and safety, it was
envisaged to develop a monoscopic vision system capable of recognizing
the tile clamping system components on which the end-effector must act
to dismount/mount the tiles. The vision system has now been realized
and it is described in the paper along with end-effector modifications
and executed tests. (C) 2003 Elsevier Science B.V. All rights reserved.
|
990. | Cenedese, A, Beghi, A, Ciscato, D, and Sartori, F, "Active contours approach for plasma boundary reconstruction," FUSION ENGINEERING AND DESIGN, vol. 66-8, pp. 675-680, 2003.
Abstract:
In the current generation of tokamak devices, fusion performance is
related to plasma geometric characteristics as elongation and
triangularity. Shape diagnostics and control systems are, therefore,
essential to plasma operations. It follows that the quality of a
tokamak control system depends on the availability of fast and reliable
measurements of plasma position and shape. For this purpose, classic
reconstruction and control algorithms that have been applied to
existing machines refer to the position of a discrete set of points
(gaps) around the outermost flux surface [Proc. 11th Symp. Fusion
Technol. 2 (1980) 1033; Fusion Technol. 1 (1994) 731]. The paper
presents an attempt of producing an integral, more than pointwise
description of the plasma boundary using modern techniques, derived
from the active vision field. It provides an intuitive and elegant tool
for plasma boundary representation and dynamic reconstruction, while
widening the point of view over plasma shape diagnostics and control
systems. A comparison with the reconstruction code currently available
at JET will be presented. (C) 2003 Elsevier Science B.V. All rights
reserved.
|
991. | van Bemmel, CM, Spreeuwers, LJ, Viergever, MA, and Niessen, WJ, "Level-set-based artery-vein separation in blood pool agent CE-MR angiograms," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 22, pp. 1224-1234, 2003.
Abstract:
Blood pool agents (BPAs) for contrast-enhanced (CE) magnetic-resonance
angiography (MRA) allow prolonged imaging times for higher contrast and
resolution. Imaging is performed during the steady state when the
contrast agent is distributed through the complete vascular system.
However, simultaneous venous and arterial enhancement in this steady
state hampers interpretation. In order to improve visualization of the
arteries and veins from steady-state BPA data, a semiautomated method
for artery-vein separation is presented. In this method, the central
arterial axis and central venous axis are used as initializations for
two surfaces that simultaneously evolve in order to capture the
arterial and venous parts of the vasculature using the level-set
framework. Since arteries and veins can be in close proximity of each
other, leakage from the evolving arterial (venous) surface into the
venous (arterial) part of the vasculature is inevitable. In these
situations, voxels are labeled arterial or venous based on the arrival
time of the respective surface. The evolution is steered by external
forces related to feature images derived from the image data and by
internal forces related to the geometry of the level sets. In this
paper, the robustness and accuracy of three external forces (based on
image intensity, image gradient, and vessel-enhancement filtering) and
combinations of them are investigated and tested on seven patient
datasets. To this end, results with the level-set-based segmentation
are compared to the reference-standard manually obtained segmentations.
Best results are achieved by applying a combination of intensity- and
gradient-based forces and a smoothness constraint based on the
curvature of the surface. By applying this combination to the seven
datasets, it is shown that, with minimal user interaction, artery-vein
separation for improved arterial and venous visualization in BPA CE-MRA
can be achieved.
|
992. | Gonzalez-Linares, JM, Guil, N, and Zapata, EL, "An efficient 2D deformable objects detection and location algorithm," PATTERN RECOGNITION, vol. 36, pp. 2543-2556, 2003.
Abstract:
This paper presents a complete method for the automatic detection and
location of two-dimensional objects even in the presence of noise,
occlusion, cluttering and/or deformations. This method is based on
shape information extracted from the edges gradient and only needs a
template of the object to be located. A new Generalized Hough Transform
is proposed to automatically locate rigid objects in the presence of
noise, occlusion and/or cluttering. A Bayesian scheme uses this rigid
objects location algorithm to obtain the deformation of the object. The
whole method is invariant to rotation, scale, displacement and minor
deformations. Several examples with real images are presented to show
the validity of the method. (C) 2003 Pattern Recognition Society.
Published by Elsevier Ltd. All rights reserved.
|
993. | Mishra, A, Dutta, PK, and Ghosh, MK, "A GA based approach for boundary detection of left ventricle with echocardiographic image sequences," IMAGE AND VISION COMPUTING, vol. 21, pp. 967-976, 2003.
Abstract:
In this paper automatic detection of the boundary of left ventricle
(LV) in a sequence of cardiac images has been proposed. The contour
detection algorithm is formulated as a constrained optimization problem
based on active contour model. The optimization problem has been solved
using Genetic Algorithm (GA). The result obtained by the proposed GA
based approach is compared with conventional nonlinear programming
methods. Validation of the computer-generated boundaries is done after
comparing them with manually outlined contours by expert observers. The
performance of the algorithm is comparable to inter-observer anomalies.
(C) 2003 Elsevier B.V. All rights reserved.
|
994. | Aubert, G, Barlaud, M, Faugeras, O, and Jehan-Besson, S, "Image segmentation using active contours: Calculus of variations or shape gradients?," SIAM JOURNAL ON APPLIED MATHEMATICS, vol. 63, pp. 2128-2154, 2003.
Abstract:
We consider the problem of segmenting an image through the minimization
of an energy criterion involving region and boundary functionals. We
show that one can go from one class to the other by solving Poisson's
or Helmholtz's equation with well-chosen boundary conditions. Using
this equivalence, we study the case of a large class of region
functionals by standard methods of the calculus of variations and
derive the corresponding Euler - Lagrange equations. We revisit this
problem using the notion of a shape derivative and show that the same
equations can be elegantly derived without going through the unnatural
step of converting the region integrals into boundary integrals. We
also de. ne a larger class of region functionals based on the
estimation and comparison to a prototype of the probability density
distribution of image features and show how the shape derivative tool
allows us to easily compute the corresponding Gateaux derivatives and
Euler - Lagrange equations. Finally we apply this new functional to the
problem of regions segmentation in sequences of color images. We
briefly describe our numerical scheme and show some experimental
results.
|
995. | Barreira, N, Penedo, MG, Marino, C, and Ansia, FM, "Topological active volumes," COMPUTER ANALYSIS OF IMAGES AND PATTERNS, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2756, pp. 337-344, 2003.
Abstract:
In the last years, deformable models raised much interest and found
various applications in the field of 2D and 3D computer vision. Active
surfaces are usually employed for segmentation and object
reconstruction. In this paper, a new model for 3D image segmentation is
proposed, the Topological Active Volumes (TAV). This model is based on
deformable models, it is able to integrate the most representative
characteristics of the region-based and boundary-based segmentation
models and it also provides information about the topological
properties of the inside of detected objects. This model has the
ability to perform topological local changes in its structure during
the adjustment phase in order to: obtain a specific adjustment to
object's local singularities, find several objects in the scene and
identify and delimit holes in detected structures.
|
996. | Behnke, S, "Hierarchical neural networks for image interpretation - Introduction," HIERARCHICAL NEURAL NETWORKS FOR IMAGE INTERPRETATION, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2766, pp. 1-+, 2003.
Abstract:
As a computational bridge between the high-level a priori knowledge of
object shape and the low-level image data, active contours (or snakes)
are useful models for the extraction of deformable objects. We propose
an approach for manipulating multiple snakes iteratively, called
interacting snakes, that minimizes the attraction energy functionals on
both contours and enclosed regions of individual snakes and the
repulsion energy functionals among multiple snakes that interact with
each other. We implement the interacting snakes through explicit curve
(parametric active contours) representation in the domain of face
recognition. We represent human faces semantically via facial
components such as eyes, mouth, face outline, and the hair outline.
Each facial component is encoded by a closed (or open) snake that is
drawn from a 3D generic face model. A collection of semantic facial
components form a hypergraph, called semantic face graph, which employs
interacting snakes to align the general facial topology onto the sensed
face images. Experimental results show that a successful interaction
among multiple snakes associated with facial components makes the
semantic face graph a useful model for face representation, including
cartoon faces and caricatures, and recognition.
|
997. | Hsu, RL, and Jain, AK, "Generating discriminating cartoon faces using interacting snakes," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 25, pp. 1388-1398, 2003.
Abstract:
As a computational bridge between the high-level a priori knowledge of
object shape and the low-level image data, active contours (or snakes)
are useful models for the extraction of deformable objects. We propose
an approach for manipulating multiple snakes iteratively, called
interacting snakes, that minimizes the attraction energy functionals on
both contours and enclosed regions of individual snakes and the
repulsion energy functionals among multiple snakes that interact with
each other. We implement the interacting snakes through explicit curve
(parametric active contours) representation in the domain of face
recognition. We represent human faces semantically via facial
components such as eyes, mouth, face outline, and the hair outline.
Each facial component is encoded by a closed (or open) snake that is
drawn from a 3D generic face model. A collection of semantic facial
components form a hypergraph, called semantic face graph, which employs
interacting snakes to align the general facial topology onto the sensed
face images. Experimental results show that a successful interaction
among multiple snakes associated with facial components makes the
semantic face graph a useful model for face representation, including
cartoon faces and caricatures, and recognition.
|
998. | Abu-Gharbieh, R, Hamarneh, G, Gustavsson, T, and Kaminski, C, "Level set curve matching and particle image velocimetry for resolving chemistry and turbulence interactions in propagating flames," JOURNAL OF MATHEMATICAL IMAGING AND VISION, vol. 19, pp. 199-218, 2003.
Abstract:
We present an imaging, image processing, and image analysis framework
for facilitating the separation of flow and chemistry effects on local
flame front structures. Image data of combustion processes are obtained
by a novel technique that combines simultaneous measurements of
distribution evolutions of OH radicals and of instantaneous velocity
fields in turbulent flames. High-speed planar laser induced
fluorescence (PLIF) of OH radicals is used to track the response of the
flame front to the turbulent flow field. Instantaneous velocity field
measurements are simultaneously performed using particle image
velocimetry (PIV). Image analysis methods are developed to process the
experimentally captured data for the quantitative study of turbulence/
chemistry interactions. The flame image sequences are smoothed using
nonlinear diffusion filtering and flame boundary contours are
automatically segmented using active contour models. OH image sequences
are analyzed using a curve matching algorithm that incorporates level
sets and geodesic path computation to track the propagation of curves
representing successive flame contours within a sequence. This makes it
possible to calculate local flame front velocities, which are strongly
affected by turbulence/ chemistry interactions. Since the PIV data
resolves the turbulent flow field, the combined technique allows a more
detailed investigation of turbulent flame phenomena.
|
999. | Hanek, R, Schmitt, T, Buck, S, and Beetz, M, "Towards RoboCup without color labeling," ROBOCUP 2002: ROBOT SOCCER WORLD CUP VI, LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, vol. 2752, pp. 179-194, 2003.
Abstract:
Object recognition and localization methods in RoboCup work on color
segmented camera images. Unfortunately, color labeling can be applied
to object recognition tasks only in very restricted environments, where
different kinds of objects have different colors. To overcome these
limitations we propose an algorithm named the Contracting Curve Density
(CCD) algorithm for fitting parametric curves to image data. The method
neither assumes object specific color distributions, nor specific edge
profiles, nor does it need threshold parameters. Hence, no training
phase is needed. In order to separate adjacent regions we use local
criteria which are based on local image statistics. We apply the method
to the problem of localizing the ball and show that the CCD algorithm
reliably localizes the ball even in the presence of heavily changing
illumination, strong clutter, specularity, partial occlusion, and
texture.
|
1000. | Wang, DJ, Tang, Y, Yu, HC, and Tang, ZS, "Level set methods based on distance function," APPLIED MATHEMATICS AND MECHANICS-ENGLISH EDITION, vol. 24, pp. 950-960, 2003.
Abstract:
Some basic problems on the level set methods were discussed, such as
the method used to preserve the distance function, the existence and
uniqueness of solution for the level set equations. The main
contribution is to prove that in a neighborhood of the initial zero
level set, the level set equations with the restriction of the distance
function have a unique solution, which must be the signed distance
function with respect to the evolving surface. Some skilful approaches
were used: Noticing that any solution for the original equation was a
distance function, the original level set equations were transformed
into a simpler alternative form. Moreover, since the new system was not
a classical one, the system was transformed into an ordinary one, for
which the implicit function method was adopted.
|
1001. | Luo, B, and Hancock, ER, "A unified framework for alignment and correspondence," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 92, pp. 26-55, 2003.
Abstract:
This paper casts the problem of 2D point-set alignment and
correspondence matching into a unified framework. Our aim in providing
this unification is to constrain the recovery of pose parameters using
relational constraints provided by the structural arrangement of the
points. This structural information is provided by a neighbourhood
graph for the points. We characterise the problem using distinct
probability distributions for alignment errors and correspondence
errors. The utility measure underpinning the work is the cross-entropy
between probability distributions for alignment and assignment errors.
This statistical framework interleaves the processes of finding point
correspondences and estimating the alignment parameters. In the case of
correspondence matching, the probability distribution models departures
from edge consistency in the matching of the neighbourhood graphs. We
investigate two different models for the alignment error process. In
the first of these, we study Procrustes alignment. Here we show how the
parameters of the similarity transform and the correspondence matches
can be located using dual singular value decompositions. The second
alignment process uses a point-distribution model. We show how this
augmented point-distribution model can be matched to unlabelled
point-sets which are subject to both additional clutter and point
drop-out. Experimental results using both synthetic and real images are
given. (C) 2003 Elsevier Inc. All rights reserved.
|
1002. | Cheng, HD, Cai, XP, Chen, XW, Hu, LM, and Lou, XL, "Computer-aided detection and classification of microcalcifications in mammograms: a survey," PATTERN RECOGNITION, vol. 36, pp. 2967-2991, 2003.
Abstract:
Breast cancer continues to be a significant public health problem in
the world. Approximately, 182,000 new cases of breast cancer are
diagnosed and 46,000 women die of breast cancer each year in the United
States. Even more disturbing is the fact that one out of eight women in
US will develop breast cancer at some point during her lifetime.
Primary prevention seems impossible since the causes of this disease
still remain unknown. Early detection is the key to improving breast
cancer prognosis. Mammography is one of the reliable methods for early
detection of breast carcinomas. There are some limitations of human
observers, and it is difficult for radiologists to provide both
accurate and uniform evaluation for the enormous number of mammograms
generated in widespread screening. The presence of microcalcification
clusters (MCCs) is an important sign for the detection of early breast
carcinoma. An early sign of 30-50% of breast cancer detected
mammographically is the appearance of clusters of fine, granular
microcalcification, and 60-80% of breast carcinomas reveal MCCs upon
histological examinations. The high correlation between the appearance
of the microcalcification clusters and the diseases show that the CAD
(computer aided diagnosis) systems for automated
detection/classification of MCCs will be very useful and helpful for
breast cancer control. In this survey paper, we summarize and compare
the methods used in various stages of the computer-aided detection
systems (CAD). In particular, the enhancement and segmentation
algorithms, mammographic features, classifiers and their performances
are studied and compared. Remaining challenges and future research
directions are also discussed. (C) 2003 Pattern Recognition Society.
Published by Elsevier Ltd. All rights reserved.
|
1003. | Wilhelms, J, and Van Gelder, A, "Combining vision and computer graphics for video motion capture," VISUAL COMPUTER, vol. 19, pp. 360-376, 2003.
Abstract:
We describe innovative methods for extracting three-dimensional motion
of humans and animals from unrestricted monocular video, using a
combination of new and established computer vision and computer
graphics techniques. We identity features using image processing and
active contours. Active contours become anchored to model segments in
specified image frames and automatically "pull" the segments to feature
positions in other frames. Adjustments are subject to joint limits and
may use inverse kinematics. Occluded contour points are detected using
object geometry and do not participate in feature tracking. Interactive
adjustments are possible at any time in the process, allowing
extraction of complicated movements regardless of background, camera
movement, or feature clarity.
|
1004. | Chang, RF, Wu, WJ, Moon, WK, Chen, WM, Lee, W, and Chen, DR, "Segmentation of breast tumor in three-dimensional ultrasound images using three-dimensional discrete active contour model," ULTRASOUND IN MEDICINE AND BIOLOGY, vol. 29, pp. 1571-1581, 2003.
Abstract:
In this paper, we apply the three-dimensional (3-D) active contour
model to a 3-D ultrasonic data file for segmenting of the breast tumor.
The 3-D ultrasonic file is composed of a series of two-dimensional
(2-D) images. Most of traditional techniques of 2-D image segmentation
will not use the information between adjacent images. To suit the
property of the 3-D data, we introduce the concept of the 3-D stick,
the 3-D morphologic process and the 3-D active contour model. The 3-D
stick can get over the problem that the ultrasonic image is full of
speckle noise and highlight the edge information in images. The 3-D
morphologic process helps to determine the contour of the tumor and the
resulting contour can be regarded as the initial contour of the active
contour model. Finally, the 3-D active contour model will make the
initial contour approach to the real contour of the tumor. However,
there is emphasis on these 3-D techniques that they do not consist of a
series of 2-D techniques. When they work, they will consider the
horizontal, vertical and depth directions at the same time. The use of
these 3-D techniques not only segments the 3-D shape but also obtains
the volume of the tumor. The volume of the tumor calculated by the
proposed method will be compared with the volume calculated by the
VOCAL(TM) software with the physician's manually drawn shape and it
shows that the performance of our method is satisfactory.
|
1005. | Sugioka, K, Hozumi, T, Watanabe, H, Yamagishi, H, Matsumura, Y, Takemoto, Y, Muro, T, Yoshiyama, M, Takeuchi, K, and Yoshikawa, J, "Rapid and accurate noninvasive assessment of global left ventricular systolic function using biplane advanced automated contour tracking method," JOURNAL OF THE AMERICAN SOCIETY OF ECHOCARDIOGRAPHY, vol. 16, pp. 1237-1243, 2003.
Abstract:
Background: The advanced automated contour tracking (AACT) method has
been newly developed for automated detection of the left ventricular
endocardial boundary. Left ventricular ejection fraction (LVEF) may be
estimated by applying the AACT method to 2 orthogonal planes of
patients even when regional wall-motion abnormalities exist. The
purpose of this study was to examine the reliability of the biplane
AACT method in the measurement of LVEF in patients with suggested
ischemic heart disease with use of quantitative gated single photon
emission computed tomography (QGS) as a reference standard.
Methods: The study population consisted of 47 consecutive patients with
suggested ischemic heart disease. All patients underwent 2-dimensional
echocardiography and QGS. Biplane LVEF from apical 4- and 2-chamber
views was measured offline by the AACT method using disk summation
method. The accuracy of the AACT method for LVEF measurement was
determined in comparison with QGS.
Results. In 41 (29 with and 12 without regional wall-motion
abnormalities) of 47 patients (87%), automated tracing of the
endocardial border was adequately achieved with the AACT method. LVEF
measured by the AACT method correlated well with that measured by QGS
(y = 0.97x + 2.4, r = 0.91). The mean difference between AACT and QGS
was 0.6 +/- 5.5% (mean +/- SD). The mean time required for analysis of
1 set of images during 1 cardiac cycle by the AACT method was much
shorter than that required by manual tracing method (7 +/- 1 vs 37 +/-
4 seconds, P < .0001).
Conclusion: The biplane AACT method provides accurate and quick
measurement of LVEF in patients even with regional wall-motion
abnormalities.
|
1006. | Satoh, Y, Okatani, T, and Deguchi, K, "Binocular motion tracking by gaze fixation control and three-dimensional shape reconstruction," ADVANCED ROBOTICS, vol. 17, pp. 1057-1072, 2003.
Abstract:
It is an easy task for the human visual system to gaze continuously at
an object moving in three-dimensional (3-D) space. While tracking the
object, human vision seems able to comprehend its 3-D shape with
binocular vision. We conjecture that, in the human visual system, the
function of comprehending the 3-D shape is essential for robust
tracking of a moving object. In order to examine this conjecture, we
constructed an experimental system of binocular vision for motion
tracking. The system is composed of a pair of active pan-tilt cameras
and a robot arm. The cameras are for simulating the two eyes of a human
while the robot arm is for simulating the motion of the human body
below the neck. The two active cameras are controlled so as to fix
their gaze at a particular point on an object surface. The shape of the
object surface around the point is reconstructed in real-time from the
two images taken by the cameras based on the differences in the image
brightness. If the two cameras successfully gaze at a single point on
the object surface, it is possible to reconstruct the local object
shape in real-time. At the same time, the reconstructed shape is used
for keeping a fixation point on the object surface for gazing, which
enables robust tracking of the object. Thus these two processes,
reconstruction of the 3-D shape and maintaining the fixation point,
must be mutually connected and form one closed loop. We demonstrate the
effectiveness of this framework for visual tracking through several
experiments.
|
1007. | Langs, G, Peloschek, P, and Bischof, H, "Determining position and fine shape detail in radiological anatomy," PATTERN RECOGNITION, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2781, pp. 532-539, 2003.
Abstract:
In this paper a method is proposed that identifies bone positions and
fine structure of bone contours in radiographs by combining active
shape models (ASM) and active contours (snakes) resulting in high
accuracy and stability. After a coarse estimate of the bone position
has been determined by neural nets, an approximation of the contour is
obtained by an active shape model. The accuracy of the landmarks and
the contour in between is enhanced by applying an iterative active
contour algorithm to a set of gray value profiles extracted
orthogonally to the interpolation obtained by the ASM. The neural nets
obtain knowledge about visual appearance as well as anatomical
configuration during a training phase. The active shape model is
trained with a set of training shapes, whereas the snake detects the
contour with fewer constraints and decreases the influence of a priori
knowledge in a controlled manner. This is of particular importance for
the assessment of pathological changes of bones like erosive
destructions caused by rheumatoid arthritis.
|
1008. | Shan, SG, Gao, W, Wang, W, Zhao, DB, and Yin, BC, "Enhanced active shape models with global texture constraints for image analysis," FOUNDATIONS OF INTELLIGENT SYSTEMS, LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, vol. 2871, pp. 593-597, 2003.
Abstract:
Active Shape Model (ASM) has been widely recognized as one of the best
methods for image understanding. In this paper, we propose to enhance
ASMs by introducing global texture constraints expressed by its
reconstruction residual in the texture subspace. In the proposed
method, each landmark is firstly matched by its local profile in its
current neighborhood, and the overall configure of all the landmarks is
re-shaped by the statistical shape constraint as in the ASMs. Then, the
global texture is warped out from the original image according to the
current shape model, and its reconstruction residual from the
pre-trained texture subspace is further exploited to evaluate the
fitting degree of the current shape model to the novel image. Also, the
texture is exploited to predict and update the shape model parameters
before we turn to the next iterative local matching for each landmark.
Our experiments on the facial feature analysis have shown the
effectiveness of the proposed method.
|
1009. | Yang, FG, and Jiang, TZ, "Pixon-based image segmentation with Markov random fields," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 12, pp. 1552-1559, 2003.
Abstract:
Image segmentation is an essential processing step for many image
analysis applications. In this paper, we propose a novel pixon-based
adaptive scale method for image segmentation. The key idea of our
approach is that a pixon-based image model is combined with a Markov
random field (MRF) model under a Bayesian framework. In our method, we
introduce a new pixon scheme that is more suitable for image
segmentation than the "fuzzy" pixon scheme. The anisotropic diffusion
equation is successfully used to form the pixons in our new pixon
scheme. Experimental results demonstrate that our algorithm performs
fairly well and computational costs decrease dramatically compared with
the pixel-based MRF algorithm.
|
1010. | Pichon, E, Tannenbaum, A, and Kikinis, R, "A statistically based surface evolution method for medical image segmentation: Presentation and validation," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2003, PT 2, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2879, pp. 711-720, 2003.
Abstract:
In this paper we present a new algorithm for 3D medical image
segmentation. The algorithm is fast, relatively simple to implement,
and semi-automatic. It is based on minimizing a global energy defined
from a learned non-parametric estimation of the statistics of the
region to be segmented. Implementation details are discussed and source
code is freely available as part of the 3D Slicer project. In addition,
a new unified set of validation metrics is proposed. Results on
artificial and real MRI images show that the algorithm performs well on
large brain structures both in terms of accuracy and robustness to
noise.
|
1011. | Chen, T, and Metaxas, D, "Gibbs prior models, marching cubes, and deformable models: A hybrid framework for 3D medical image segmentation," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2003, PT 2, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2879, pp. 703-710, 2003.
Abstract:
Hybrid frameworks combining region-based and boundary-based
segmentation methods have been used in 3D medical image segmentation
applications. In this paper we propose a hybrid 3D segmentation
framework which combines Gibbs models, marching cubes and deformable
models. We use Gibbs models to create 3D binary masks of the object.
Then we use the marching cubes method to initialize a deformable model
based on the mask. The deformable model will fit to the object surface
driven by the gradient information in the original image. The
deformation result will then be used to update the parameters of Gibbs
models. These methods will work recursively to achieve a final
segmentation. By using the marching cubes method, we succeed in
improving the accurancy and efficiency of 3D segmentation. We validate
our method by comparing the, segmentation result with expert manual
segmentation, the results show that high quality segmentation can be
achieved with computational efficiency.
|
1012. | Holtzman-Gazit, M, Goldsher, D, and Kimmel, R, "Hierarchical segmentation of thin structures in volumetric medical images," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2003, PT 2, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2879, pp. 562-569, 2003.
Abstract:
We introduce a new method for segmentation of 3D medical data based on
geometric variational principles. A minimal variance criterion is
coupled with a geometric edge alignment measure and the geodesic active
surface model. An efficient numerical scheme is proposed. In order to
simultaneously detect a number of different objects in the image, a
hierarchal method is presented. Finally, our method is compared with
the multi-level set approach for segmentation of medical images.
|
1013. | Cardinal, MHR, Meunier, J, Soulez, G, Therasse, E, and Cloutier, G, "Intravascular ultrasound image segmentation: A fast-marching method," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2003, PT 2, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2879, pp. 432-439, 2003.
Abstract:
Intravascular ultrasound (IVUS) is a medical imaging technique that not
only provides three-dimensional information about the blood vessel
lumen and wall, but also directly depicts atherosclerotic plaque
structure and morphology. Automatic processing of large data sets of
IVUS data represents an important challenge due to ultrasound speckle
and technology artifacts. A new semi-automatic IVUS segmentation model,
the fast-marching method, based on grayscale statistics of the images,
is compared to active contour segmentation. With fast-marching
segmentation, the lumen, intima plus plaque structure, and media
contours are computed in parallel. Preliminary results of this new IVUS
segmentation model agree very well with vessel wall contours. Moreover,
fast-marching segmentation is less sensitive to initialization with
average distance between segmentation performed with different
initializations <0.85 % and Haussdorf distance <2.6 %.
|
1014. | Guevara, MA, Silva, A, Oliveira, H, Pereira, MD, and Morgado, F, "Segmentation and morphometry of histological sections using deformable models: A new tool for evaluating testicular histopathology," PROGRESS IN PATTERN RECOGNITION, SPEECH AND IMAGE ANALYSIS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2905, pp. 282-290, 2003.
Abstract:
This paper presents a tool that uses image segmentation and
morphometric methods to evaluate testicular toxicity through the
analysis of histological sections of mice testis. The tool is based on
deformable models (Snakes) and includes several adaptations to solve
important difficulties of histological sections imaging, mainly the low
contrast edges between the boundary tissue of seminiferous tubules and
the interstitial tissue. The method is designed to produce accurate
segmentation and to keep track of tubular identities on images under
study. The extracted data can be used straightforwardly to compute
quantitative parameters characterizing tubular morphology. The method
was validated on a realistic data set and the results were compared
with those obtained with traditional techniques. The application of
this new technique facilitates measurements allowing assessing a higher
number of tubules in a fastest and accurate way.
|
1015. | Wu, XD, "Segmenting doughnut-shaped objects in medical images," ALGORITHMS AND COMPUTATION, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2906, pp. 375-384, 2003.
Abstract:
Image segmentation with specific constraints has found applications in
several areas such as biomedical image analysis and data mining. In
this paper, we study the problem of segmenting doughnut-shaped and
smooth objects in 2-D medical images. Image objects of these shapes are
often studied in medical applications. We present an O(IJU(U - L) log J
log(U - L)) time algorithm, where the size of the input 2-D image is I
x J, M is the smoothness parameter with 1 less than or equal to M less
than or equal to J, and L and U are the thickness parameters specifying
the thickness between two border contours of a doughnut-shaped object.
Previous approaches for solving this segmentation problem are
computationally expensive and/or need a lot of user interference. Our
algorithm improves the straightforward dynamic programming algorithm by
a factor of O (J(U-L)M-2/U log J log(U-L)). We explore some interesting
observations, which make possible to apply the divide-and-conquer
strategy combined with dynamic programming. Our algorithm is also based
on computing optimal paths in an implicitly represented graph.
|
1016. | Katzer, M, Kummert, F, and Sagerer, G, "Methods for automatic microarray image segmentation," IEEE TRANSACTIONS ON NANOBIOSCIENCE, vol. 2, pp. 202-214, 2003.
Abstract:
This paper describes image processing methods for automatic spotted
microarray image analysis. Automatic gridding is important to achieve
constant data quality and is, therefore, especially interesting for
large-scale experiments as well as for integration of microarray
expression data from different sources.
We propose a Markov random field (MRF) based approach to high-level
grid segmentation, which is robust to common problems encountered with
array images and does not require calibration. We also propose an
active contour method for single-spot segmentation. Active contour
models describe objects in images by properties of their boundaries.
Both MRFs and active contour models have been used in various other
computer vision applications. The traditional active contour model must
be generalized for successful application to microarray spot
segmentation.
Our active contour model is employed for spot detection in the MRF
score functions as well as for spot signal segmentation in quantitative
array image analysis.
An evaluation using several image series from different sources shows
the robustness of our methods.
|
1017. | Kaneko, T, Masukura, K, and Hori, O, "Description method for spatio-temporal regions in a video and its application," INTERNATIONAL JOURNAL OF IMAGING SYSTEMS AND TECHNOLOGY, vol. 13, pp. 257-266, 2003.
Abstract:
A new description method for spatio-temporal regions in a video is
proposed. It is efficient in terms of description data size and
computational complexity under the condition that the regions in each
frame can be approximated by simple figures. It approximates the object
region in a frame by a simple figure such as a rectangle, an ellipse,
or a polygon, and describes the coordinates of its representative
points (vertices). Then, the motions of the representative points are
described by polynomial spline functions to express the regions in the
following frames efficiently. The proposed method is adopted in the
MPEG-7 standard to provide the functionality of spatio-temporal
location description. Experimental results using synthesized and real
videos are presented to show the efficiency. Also, movie-centric
hypermedia, a typical application of this description method, is
introduced in this article. (C) 2004 Wiley Periodicals, Inc.
|
|
|
2004 |
1018. | Shih, FY, and Zhang, K, "Efficient contour detection based on improved snake model," INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, vol. 18, pp. 197-209, 2004.
Abstract:
Active contour model, also called snake, adapts to edges in an image. A
snake is defined as an energy minimizing spline - the snake's energy
depends on its shape and location within the image. Problems associated
with initialization and poor convergence to boundary concavities,
however, have limited its utility. In this paper, we present a new
external force field, named gravitation force field, for the snake
model. We associate this force field with edge preserving smoothing to
drive the snake for solving the problems. Our gravitation force field
uses gradient values as particles to construct force field in the whole
image. This force field will attract the active contour toward the edge
boundary. The locations of the initial contour are very flexible, such
that they can be very far away from the objects and can be inside,
outside, or the mixture. The improved snake can converge toward the
object boundary in a fast pace.
|
1019. | Welser, ME, and Acton, ST, "Projection model snakes for tracking using a Monte Carlo approach," JOURNAL OF ELECTRONIC IMAGING, vol. 13, pp. 384-398, 2004.
Abstract:
We propose a method that uses projection models in conjunction with a
sequential Monte Carlo approach to track rigid targets. We specifically
address the problems associated with tracking objects in scenarios
characterized by cluttered images and high variability In target scale.
The projection model snake is introduced in order to track a target
boundary over a variety of scales by geometrically transforming the
boundary to account for three-dimensional relative motion between the
target and camera, The complete solution is a potent synergism of the
projection model snake and a sequential Monte Carlo method. The
projection model Monte Carlo method randomly generates the parameters
of target motion and pose from empirically derived distributions. The
resultant "particles" are then weighted according to a likelihood
determined by the integration of the mean gradient magnitude around the
target contour, yielding the expected target path and pose. We
demonstrate the effectiveness of this approach for tracking dynamic
targets in sequences with noise, clutter, occlusion, and scale
variability. (C) 2004 SPIE and IST.
|
1020. | Sahiner, B, Chan, HP, Roubidoux, MA, Helvie, MA, Hadjiiski, LM, Ramachandran, A, Paramagul, C, LeCarpentier, GL, Nees, A, and Blane, C, "Computerized characterization of breast masses on three-dimensional ultrasound volumes," MEDICAL PHYSICS, vol. 31, pp. 744-754, 2004.
Abstract:
We are developing computer vision techniques for the characterization
of breast masses as malignant or benign on radiologic examinations. In
this study, we investigated the computerized characterization of breast
masses on three-dimensional (3-D) ultrasound (US) volumetric images. We
developed 2-D and 3-D active contour models for automated segmentation
of the mass volumes. The effect of the initialization method of the
active contour on the robustness of the iterative segmentation method
was studied by varying the contour used for its initialization. For a
given segmentation, texture and morphological features were
automatically extracted from the segmented masses and their margins.
Stepwise discriminant analysis with the leave-one-out method was used
to select effective features for the classification task and to combine
these features into a malignancy score. The classification accuracy was
evaluated using the area A(z) under the receiver operating
characteristic (ROC) curve, as well as the partial area index
A(z)((0.9)), defined as the relative area under the ROC curve above a
sensitivity threshold of 0.9. For the purpose of comparison with the
computer classifier, four experienced breast radiologists provided
malignancy ratings for the 3-D US masses. Our dataset consisted of 3-D
US volumes of 102 biopsied masses (46 benign, 56 malignant). The
classifiers based on 2-D and 3-D segmentation methods achieved test A 7
values of 0.87+/-0.03 and 0.92+/-0.03, respectively. The difference in
the A(z) values of the two computer classifiers did not achieve
statistical significance. The A(z) values of the four radiologists
ranged between 0.84 and 0.92. The difference between the computer's
A(z) value and that of any of the four radiologists did not achieve
statistical significance either. However, the computer's A(z)((0.9))
value was significantly higher than that of three of the four
radiologists. Our results indicate that an automated and effective
computer classifier can be designed for differentiating malignant and
benign breast masses on 3-D US volumes. The accuracy of the classifier
designed in this study was similar to that of experienced breast
radiologists. (C) 2004 American Association of Physicists in Medicine.
|
1021. | Yang, HP, Wang, WP, and Sun, JG, "Control point adjustment for B-spline curve approximation," COMPUTER-AIDED DESIGN, vol. 36, pp. 639-652, 2004.
Abstract:
Pottmann et al. propose an iterative optimization scheme for
approximating a target curve with a B-spline curve based on square
distance minimization, or SDM. The main advantage of SDM is that it
does not need a parameterization of data points on the target curve.
Starting with an initial B-spline curve, this scheme makes an active
B-spline curve converge faster towards the target curve and produces a
better approximating B-spline curve than existing methods relying on
data point parameterization. However, SDM is sensitive to the initial
B-spline curve due to its local nature of optimization. To address
this, we integrate SDM with procedures for automatically adjusting both
the number and locations of the control points of the active spline
curve. This leads to a method that is more robust and applicable than
SDM used alone. Furthermore, it is observed that the most time
consuming part of SDM is the repeated computation of the foot-point on
the target curve of a sample point on the active B-spline curve. In our
implementation, we speed up the foot-point computation by pre-computing
the distance field of the target curve using the Fast Marching Method.
Experimental examples are presented to demonstrate the effectiveness of
our method. Problems for further research are discussed. (C) 2003
Elsevier Ltd. All rights reserved.
|
1022. | Yang, RG, and Zhang, ZY, "Eye gaze correction with stereovision for video-teleconferencing," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 26, pp. 956-960, 2004.
Abstract:
The lack of eye contact in desktop video teleconferencing substantially
reduces the effectiveness of video contents. While expensive and bulky
hardware is available on the market to correct eye gaze, researchers
have been trying to provide a practical software-based solution to
bring video-teleconferencing one step closer to the mass market. This
paper presents a novel approach: Based on stereo analysis combined with
rich domain knowledge (a personalized face model), we synthesize, using
graphics hardware, a virtual video that maintains eye contact. A 3D
stereo head tracker with a personalized face model is used to compute
initial correspondences across two views. More correspondences are then
added through template and feature matching. Finally, all the
correspondence information is fused together for view synthesis using
view morphing techniques. The combined methods greatly enhance the
accuracy and robustness of the synthesized views. Our current system is
able to generate an eye-gaze corrected video stream at five frames per
second on a commodity 1 GHz PC.
|
1023. | Borenstein, E, and Ullman, S, "Learning to segment," COMPUTER VISION - ECCV 2004, PT 3, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3023, pp. 315-328, 2004.
Abstract:
We describe a new approach for learning to perform class-based
segmentation using only unsegmented training examples. As in previous
methods, we first use training images to extract fragments that contain
common object parts. We then show how these parts can be segmented into
their figure and ground regions in an automatic learning process. This
is in contrast with previous approaches, which required complete manual
segmentation of the objects in the training examples. The figure-ground
learning combines top-down and bottom-up processes and proceeds in two
stages, an initial approximation followed by iterative refinement. The
initial approximation produces figure-ground labeling of individual
image fragments using the unsegmented training images. It is based on
the fact that on average, points inside the object are covered by more
fragments than points outside it. The initial labeling is then improved
by an iterative refinement process, which converges in up to three
steps. At each step, the figure-ground labeling of individual fragments
produces a segmentation of complete objects in the training images,
which in turn induce a refined figure-ground labeling of the individual
fragments. In this manner, we obtain a scheme that starts from
unsegmented training images, learns the figure-ground labeling of image
fragments, and then uses this labeling to segment novel images. Our
experiments demonstrate that the learned segmentation achieves the same
level of accuracy as methods using manual segmentation of training
images, producing an automatic and robust top-down segmentation.
|
1024. | Abolmaesumi, P, and Sirouspour, MR, "An interacting multiple model probabilistic data association filter for cavity boundary extraction from ultrasound images," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 23, pp. 772-784, 2004.
Abstract:
This paper presents a novel segmentation technique for extracting
cavity contours from ultrasound images. The problem is first
discretized by projecting equispaced radii from an arbitrary seed point
inside the cavity toward its boundary. The distance of the cavity
boundary from the seed point is modeled by the trajectory of a moving
object. The motion of this moving object is assumed to be governed by a
finite set of dynamical models subject to uncertainty. Candidate edge
points obtained along each radius include the measurement of the object
position and some false returns. The modeling approach enables us to
use the interacting multiple model estimator along with a probabilistic
data association filter, for contour extraction. The convergence rate
of the method is very fast because it does not employ any numerical
optimization. The robustness and accuracy of the method are
demonstrated by segmenting contours from a series of ultrasound images.
The results are validated through comparison with manual segmentations
performed by an expert. An application of the method in segmenting bone
contours from computed tomography images is also presented.
|
1025. | Plissiti, ME, Fotiadis, DI, Michalis, LK, and Bozios, GE, "Automated method for lumen and media-adventitia border detection in a sequence of IVUS frames," IEEE TRANSACTIONS ON INFORMATION TECHNOLOGY IN BIOMEDICINE, vol. 8, pp. 131-141, 2004.
Abstract:
In this paper, we present a method for the automated detection of lumen
and media-adventitia border in sequential intravascular ultrasound
(IVUS) frames. The method is based on the use of deformable models. The
energy function is appropriately modified and minimized using a
Hopfield neural network. Proper modifications in the definition of the
bias of the neurons have been introduced to incorporate image
characteristics. A simulated annealing scheme is included to ensure
convergence at a global minimum. The method overcomes distortions in
the expected image pattern, due to the presence of calcium, employing a
specialized structure of the neural network and boundary correction
schemas which are based on a priori knowledge about the vessel
geometry. The proposed method is evaluated using sequences of IVUS
frames from 18 arterial segments, some of them indicating calcified
regions. The obtained results demonstrate that our method is
statistically accurate, reproducible, and capable to identify the
regions of interest in sequences of IVUS frames.
|
1026. | Techavipoo, U, Varghese, T, Zagzebski, JA, Chen, Q, and Liu, W, "Semiautomated thermal lesion segmentation for three- dimensional elastographic imaging," ULTRASOUND IN MEDICINE AND BIOLOGY, vol. 30, pp. 655-664, 2004.
Abstract:
Several studies have demonstrated that lesion volumes computed from
multiple planar slices through the region-of-interest (ROI) are more
accurate than volumes estimated assuming simple shapes and
incorporating single or orthogonal diameter estimates. However, manual
delineation of boundaries on multiple planar 2-D images is tedious and
labor-intensive. Automatic extraction of lesion boundaries is,
therefore, attractive and imperative to remove subjectivity and reduce
assessment time. This paper presents a semiautomated segmentation
algorithm for thermal lesions on 3-D elastographic data to obtain both
area and volume information. The semiautomated segmentation algorithm
is based on thresholding and morphologic opening of both 2-D and 3-D
elastographic data. Results obtained on 44 thermal lesions imaged in
vitro using elastography were compared to manual delineation of both
elastographic and pathology images. Results obtained using
semiautomated segmentation demonstrate a close correspondence with
manual delineation results. However, area and volume estimates obtained
using both manual and semiautomated segmentation of lesions seen on
elastograms slightly underestimate areas and volumes measured from
pathology. (E-mail: tvarghese@wisc.edu) (C) 2004 World Federation for
Ultrasound in Medicine Biology.
|
1027. | Park, J, and Park, S, "Object boundary edge selection using level-of-detail canny edges," COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2004, PT 4, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3046, pp. 369-378, 2004.
Abstract:
Recently, Nguyen proposed a method[1] for tracking a nonparameterized
object (subject) contour in a single video stream with a moving camera
and changing background. Nguyen's approach combined outputs of two
steps: creating a predicted contour and removing background edges.
Nguyen's background edge removal method of leaving many irrelevant
edges is subject to inaccurate contour tracking in a complex scene.
Nguyen's method[1] of combining the predicted contour computed from the
previous frame accumulates tracking error. We propose a brand-new
method for tracking a nonparameterized subject contour in a single
video stream with a moving camera and changing background. Our method
is based on level-of-detail (LOD) Canny edge maps and graph-based
routing operations on the LOD maps. We compute a predicted contour as
Nguyen do. But to reduce side-effects because of irrelevant edges, we
start our basic tracking using simple (strong) Canny edges generated
from large image intensity gradients of an input image, called Scanny
edges. Starting from Scanny edges, we get more edge pixels ranging from
simple Canny edge maps untill the most detailed (weaker) Canny edge
maps, called Wcanny maps. If Scanny edges are disconnected, routing
between disconnected parts are planned using level-of-detail Canny
edges, favoring stronger Canny edge pixels. Our accurate tracking is
based on reducing effects from irrelevant edges by selecting the
strongest edge pixels only, thereby relying on the current frame edge
pixel as much as possible contrary to Nguyen's approach of always
combining the previous contour. Our experimental results show that this
tracking approach is robust enough to handle a complex-textured scene.
|
1028. | Hong, M, Choi, MH, and Lee, C, "Constraint-based contact analysis between deformable objects," COMPUTATIONAL SCIENCE - ICCS 2004, PT 2, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3037, pp. 300-308, 2004.
Abstract:
The key to the successful simulation of deformable objects is to model
the realistic behavior of deformation when they Eire influenced by
intricate contact conditions and geometric constraints. This paper
describes constraint-based contact modeling between deformable objects
using a nonlinear finite element method. In contrast to the penalty
force based approaches, constraint-based enforcement of contact provide
accuracy and freedom from finding proper penalty coefficients. This
paper is focused on determining contact regions and calculating
reaction forces at appropriate nodes and elements within the contact
regions. The displacement and deformation of all nodes are dynamically
updated based on the contact reaction forces. Our constraint based
contact force computation method guarantees tight error bound at the
contact regions and maintains hard constraints without overshoot or
oscillation at the boundaries. In addition, the proposed method doesn't
require us to choose proper penalty coefficients, thus greater
numerical stability can be achieved and generally large integration
steps can be utilized for the ODE solver. Contact conditions are
formulated as nonlinear equality and inequality constraints and the
force computation is cast into a nonlinear optimization problem. Our
rigid-to-deformable and deformable-to-deformable contact simulation
demonstrates that the non-penetration constraints are well maintained.
|
1029. | Sheppard, AP, Sok, RM, and Averdunk, H, "Techniques for image enhancement and segmentation of tomographic images of porous materials," PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, vol. 339, pp. 145-151, 2004.
Abstract:
This article presents a three-stage approach, combining novel and
traditional algorithms, for the segmentation of images of porous and
composite materials obtained from X-ray tomography. The first stage is
an anisotropic diffusion filter which removes noise while preserving
significant features. The second stage applies the unsharp mask
sharpening filter which enhances edges and partially reverses the
smoothing that is often a consequence of tomographic reconstruction.
The final stage uses a combination of watershed and active contour
methods for segmentation of the grey-scale data. For the data sets we
have analysed, this approach gives the highest quality results. In
addition, it has been implemented on cluster-type parallel computers
and applied to cubic images comprising up to 2000(3) voxels. (C) 2004
Published by Elsevier B.V.
|
1030. | Debeir, O, Camby, I, Kiss, R, Van Ham, P, and Decaestecker, C, "A model-based approach for automated in vitro cell tracking and chemotaxis analyses," CYTOMETRY PART A, vol. 60A, pp. 29-40, 2004.
Abstract:
Background: Chemotaxis may be studied in two main ways: 1) counting
cells passing through an insert (e.g., using Boyden chambers), and 2)
directly observing cell cultures (e.g., using Dunn chambers), both in
response to stationary concentration gradients. This article promotes
the use of Dunn chambers and in vitro cell-tracking, achieved by video
microscopy coupled with automatic image analysis software, in order to
extract quantitative and qualitative measurements characterizing the
response of cells to a diffusible chemical agent.
Methods: Previously, we set up a videomicroscopy system coupled with
image analysis software that was able to compute cell trajectories from
in vitro cell cultures. In the present study, we are introducing a new
software increasing the application field of this system to chemotaxis
studies. This software is based on an adapted version of the active
contour methodology, enabling each cell to be efficiently tracked for
hours and resulting in detailed descriptions of individual cell
trajectories. The major advantages of this method come from an improved
robustness with respect to variability in cell morphologies between
different cell lines and dynamical changes in cell shape during cell
migration. Moreover, the software includes a very small number of
parameters which do not require overly sensitive tuning. Finally, the
running time of the software is very short, allowing improved
possibilities in acquisition frequency and, consequently, improved
descriptions of complex cell trajectories, i.e. trajectories including
cell division and cell crossing.
Results: We validated this software on several artificial and real cell
culture experiments in Dunn chambers also including comparisons with
manual (human-controlled) analyses.
Conclusions: We developed new software and data analysis tools for
automated cell tracking which enable cell chemotaxis to be efficiently
analyzed. (C) 2004 Wiley-Liss, Inc.
|
1031. | Yu, Y, and Acton, ST, "Automated delineation of coastline from polarimetric SAR imagery," INTERNATIONAL JOURNAL OF REMOTE SENSING, vol. 25, pp. 3423-3438, 2004.
Abstract:
In this paper we present a new diffusion-based method for the
delineation of coastlines from space-borne polarimetric SAR imagery of
coastal urban areas. Both polarimetric filtering and speckle reducing
anisotropic diffusion (SRAD) are exploited to generate a base image
where speckle is reduced and edges are enhanced. The primary edge
information is then derived from the base image using the instantaneous
coefficient of variation edge detector. Next, the resulting edge image
is parsed by a watershed transform, which partitions the image into
disjoint segments where the division lines between segments are
collocated with detected edges. The over-segmentation problem
associated with the watershed transform is solved by a region merging
technique that combines neighbouring segments with similar radar
brightness. As a result, undesired boundary segments are eliminated and
true coastlines are correctly delineated. The proposed algorithm has
been applied to a space-borne polarimetric SAR dataset, demonstrating a
good visual match between the detected coastline and the manually
contoured coastline. The performance of the proposed algorithm is
compared with those of two polarimetric SAR classification algorithms
and two edge-based shoreline detection methods that are tailored to
single polarization SAR images. Experimental results are shown using
polarimetric SAR data from Hong Kong.
|
1032. | Kim, D, Epstein, FH, Gilson, WD, and Axel, L, "Increasing the signal-to-noise ratio in DENSE MRI by combining displacement-encoded echoes," MAGNETIC RESONANCE IN MEDICINE, vol. 52, pp. 188-192, 2004.
Abstract:
A new technique was developed. to increase the signal-to-noise ratio
(SNR) in displacement encoding With stimulated, echoes (DENSE) MRI.
This signal-averaged DENSE (sav-DENSE) technique is based on the SNR
advantage of extracting a pair of DENSE images with uncorrelated noise
from the complex complementary spatial modulation of the magnetization
image, and combining them during image reconstruction. Eleven healthy
volunteers Were imaged at three short-axis locations With the use of
sav-DENSE, cine DENSE, and myocardial tagging pulse sequences. in this
study, sav-DENSE increased the SNR by 15-34% as compared to dine DENSE.
Circumferential strain values measured by sav-DENSE and. myocardial
tagging were strongly correlated (slope = 0.05, intercept = -0.02, R =
0.92) and within the 95% limits of agreement. The breath-hold sav-DENSE
technique yielded relatively accurate and precise quantification of 2D
intramyocardial function, with a 40.2-ms temporal resolution. and a 3.5
x 3.5 mm(2) spatial resolution.
|
1033. | Moses, DA, and Axel, L, "Quantification of the curvature and shape of the interventricular septum," MAGNETIC RESONANCE IN MEDICINE, vol. 52, pp. 154-163, 2004.
Abstract:
The interventricular septum (IVS) occupies a unique position within the
heart, lying between the left (LV) and right (RV) ventricular cavities.
Changes in its normal geometry may signify not only abnormalities of
the septal myocardium, but also abnormal pressure differences between
the LV and RV. Flattening of the IVS has been noted with
cross-sectional imaging in association with pulmonary hypertension, but
the septal curvature and shape have not previously been measured in
three dimensions. This paper describes a method to model the RV surface
of the IVS from spatially registered cross-sectional images for
measurements of curvature. A smoothing 2D spline surface is constructed
through the RV septal surface at regular times during the cardiac
cycle, and the principal curvatures, as well as the Gaussian and mean
curvatures, shape index, and curvedness, are calculated. Vector,and
color surface maps and graphs of average curvature and shape indices
are constructed. Consistent curvature patterns were observed in four
normal subjects. This method of measuring septal geometry can provide
potentially useful new information on the effects of RV disease. We
examine the problem of describing septal motion, and describe a simple
measure of septal curvature that may be of clinical value.
|
1034. | Agarwala, A, Hertzmann, A, Salesin, DH, and Seitz, SM, "Keyframe-based tracking for rotoscoping and animation," ACM TRANSACTIONS ON GRAPHICS, vol. 23, pp. 584-591, 2004.
Abstract:
We describe a new approach to rotoscoping-the process of tracking
contours in a video sequence-that combines computer vision with user
interaction. In order to track contours in video, the user specifies
curves in two or more frames; these curves are used as keyframes by a
computer-vision-based tracking algorithm. The user may interactively
refine the curves and then restart the tracking algorithm. Combining
computer vision with user interaction allows our system to track any
sequence with significantly less effort than interpolation-based
systems-and with better reliability than "pure" computer vision
systems. Our tracking algorithm is cast as a spacetime optimization
problem that solves for time-varying curve shapes based on an input
video sequence and user-specified constraints. We demonstrate our
system with several rotoscoped examples. Additionally, we show how
these rotoscoped contours can be used to help create cartoon animation
by attaching user-drawn strokes to the tracked contours.
|
1035. | Wang, J, Xu, YQ, Shum, HY, and Cohen, MF, "Video tooning," ACM TRANSACTIONS ON GRAPHICS, vol. 23, pp. 574-583, 2004.
Abstract:
We describe a system for transforming an input video into a highly
abstracted, spatio-temporally coherent cartoon animation with a range
of styles. To achieve this, we treat video as a space-time volume of
image data. We have developed an anisotropic kernel mean shift
technique to segment the video data into contiguous volumes. These
provide a simple cartoon style in themselves, but more importantly
provide the capability to semi-automatically rotoscope semantically
meaningful regions.
In our system, the user simply outlines objects on keyframes. A mean
shift guided interpolation algorithm is then employed to create three
dimensional semantic regions by interpolation between the keyframes,
while maintaining smooth trajectories along the time dimension. These
regions provide the basis for creating smooth two dimensional edge
sheets and stroke sheets embedded within the spatio-temporal video
volume. The regions, edge sheets, and stroke sheets are rendered by
slicing them at particular times. A variety of styles of rendering are
shown. The temporal coherence provided by the smoothed semantic regions
and sheets results in a temporally consistent non-photorealistic
appearance.
|
1036. | Hofer, M, and Pottmann, H, "Energy-minimizing splines in manifolds," ACM TRANSACTIONS ON GRAPHICS, vol. 23, pp. 284-293, 2004.
Abstract:
Variational interpolation in curved geometries has many applications,
so there has always been demand for geometrically meaningful and
efficiently computable splines in manifolds. We extend the definition
of the familiar cubic spline curves and splines in tension, and we show
how to compute these on parametric surfaces, level sets, triangle
meshes, and point samples of surfaces. This list is more comprehensive
than it looks, because it includes variational motion design for
animation, and allows the treatment of obstacles via barrier surfaces.
All these instances of the general concept are handled by the same
geometric optimization algorithm, which minimizes an energy of curves
on surfaces of arbitrary dimension and codimension.
|
1037. | Yang, J, Staib, LH, and Duncan, JS, "Neighbor-constrained segmentation with level set based 3-D deformable models," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 23, pp. 940-948, 2004.
Abstract:
A novel method for the segmentation of multiple objects from
three-dimensional (3-D) medical images using interobject constraints is
presented. Our method is motivated by the observation that neighboring
structures have consistent locations and shapes that provide
configurations and context that aid in segmentation. We define a
maximum a posteriori (MAP) estimation framework using the constraining
information provided by neighboring objects to segment several objects
simultaneously. We introduce a representation for the joint density
function of the neighbor objects, and define joint probability
distributions over the variations of the neighboring shape and position
relationships of a set of training images. In order to estimate the MAP
shapes of the objects, we formulate the model in terms of level set
functions, and compute the associated Euler-Lagrange equations. The
contours evolve both according to the neighbor prior information and
the image gray level information. This method is useful in situations
where there is limited interobject information as opposed to robust
global atlases. In addition, we compare our level set representation of
the object shape to the point distribution model. Results and
validation from experiments on synthetic data and medical imagery in
two-dimensional and 3-D are demonstrated.
|
1038. | Giusto, DD, Massidda, F, and Perra, C, "FACE: fast active-contour curvature-based evolution," SIGNAL PROCESSING-IMAGE COMMUNICATION, vol. 19, pp. 517-538, 2004.
Abstract:
This paper presents an active contour model for fast object
segmentation called FACE. A novel energy term that takes into account
the computational complexity of the active contour is introduced
together with related constraints and minimization procedure. The
described process is based on the regularization and optimization of
the active contour control points position. The trade-off between
computational complexity and final contour accuracy is based on
curvature estimation. The result is a fast active contour convergence
towards desired object boundaries. This method can be combined with
most of the other active contour approaches presented in literature,
thanks to the independence between the computational minimization
process and the classical active contour minimization process. The
object segmentation procedure can be automatic or semiautomatic
depending on the original image complexity. Several tests and
experiments have been realized. Results show improvements in terms of
computational time reduction when compared with other similar active
contour models. (C) 2004 Elsevier B.V. All rights reserved.
|
1039. | Zoroofi, RA, Sato, Y, Nishii, T, Sugano, N, Yoshikawa, H, and Tamura, S, "Automated segmentation of necrotic femoral head from 3D MR data," COMPUTERIZED MEDICAL IMAGING AND GRAPHICS, vol. 28, pp. 267-278, 2004.
Abstract:
Segmentation of diseased organs is an important topic in computer
assisted medical image analysis. In particular, automatic segmentation
of necrotic femoral head is of importance for various corresponding
clinical tasks including visualization, quantitative assessment, early
diagnosis and adequate management of patients suffering from avascular
necrosis of the femoral head (ANFH). Early diagnosis and treatment of
ANFH is crucial since the disease occurs in relatively young
individuals with an average age of 20-50, and since treatment options
for more advanced disease are frequently unsuccessful. The present
paper describes several new techniques and software for automatic
segmentation of necrotic femoral head based on clinically obtained
multi-slice T1-weighted MR data. In vivo MR data sets of 50 actual
patients are used in the study. An automatic method built up to manage
the segmentation task according to image intensity of bone tissues,
shape of the femoral head, and other characters. The processing scheme
consisted of the following five steps. (1) Rough segmentation of
nonnecrotic lesions of the femur by applying a 3D gray morphological
operation and a 3D region growing technique. (2) Fitting a 3D ellipse
to the femoral head by a new approach utilizing the constraint of the
shape of the femur, and employing a principle component analysis and a
simulated annealing technique. (3) Estimating the femoral neck
location, and also femoral head axis by integrating anatomical
information of the femur and boundary of estimated 3D ellipse. (4)
Removal of non-bony tissues around the femoral neck and femoral head
ligament by utilizing the estimated femoral neck axis. (5)
Classification of necrotic lesions inside the estimated femoral head by
a k-means technique. The above method was implemented in a Microsoft
Windows software package. The feasibility of this method was tested on
the data sets of 50 clinical cases (3000 MR images). (C) 2004 Elsevier
Ltd. All rights reserved.
|
1040. | Jalba, AC, Wilkinson, MHF, and Roerdink, JBTM, "CPM: A deformable model for shape recovery and segmentation based on charged particles," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 26, pp. 1320-1335, 2004.
Abstract:
A novel, physically motivated deformable model for shape recovery and
segmentation is presented. The model, referred to as the
charged-particle model (CPM), is inspired by classical electrodynamics
and is based on a simulation of charged particles moving in an
electrostatic field. The charges are attracted towards the contours of
the objects of interest by an electrostatic field, whose sources are
computed based on the gradient-magnitude image. The electric field
plays the same role as the potential forces in the snake model, while
internal interactions are modeled by repulsive Coulomb forces. We
demonstrate the flexibility and potential of the model in a wide
variety of settings: shape recovery using manual initialization,
automatic segmentation, and skeleton computation. We perform a
comparative analysis of the proposed model with the active contour
model and show that specific problems of the latter are surmounted by
our model. The model is easily extendable to 3D and copes well with
noisy images.
|
1041. | Yoo, KH, and Ha, JS, "Geometric snapping for 3D meshes," COMPUTATIONAL SCIENCE - ICCS 2004, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3039, pp. 90-97, 2004.
Abstract:
Image snapping is the technique to move a cursor position to a nearby
feature such as edges in a 2D image when the cursor is located by a
user. This paper proposes a new snapping technique called the geometric
snapping that naturally moves the cursor position to a geometric
feature in 3D meshes. The cursor movement is based on the approximate
curvatures defined for measuring the geometric characteristics of the
3D meshes. The proposed geometric snapping can be applied to extracting
geometric features of 3D mesh models in many CAD and graphics systems.
|
1042. | Hanni, M, Edvardsson, H, Wagberg, M, Pettersson, K, and Smedby, O, "Quantification of atherosclerosis with MRI and image processing in spontaneously hyperlipidemic rabbits," JOURNAL OF CARDIOVASCULAR MAGNETIC RESONANCE, vol. 6, pp. 675-684, 2004.
Abstract:
The need for a quantitative method to assess atherosclerosis in vivo is
well known. This study tested, in a familiar animal model of
atherosclerosis, a combination of magnetic resonance imaging (MRI) and
image processing. Six spontaneously hyperlipidemic (Watanabe) rabbits
were examined with a knee coil in a 1.5-T clinical MRI scanner. Inflow
angio (2DI) and proton density weighted (PDW) images were acquired to
examine 10 cm of the aorta immediately cranial to the aortic
bifurcation. Examination of the thoracic aorta was added in four
animals. To identify the inner and outer boundary of the arterial wall,
a dynamic contour algorithm (Gradient Vector Flow snakes) was applied
to the 2DI and PDW images, respectively, after which the vessel wall
area was calculated. The results were compared with histopathological
measurements of intima and intima-media cross-sectional area. The
correlation coefficient between wall area measurements with MRI snakes
and intima-media area was 0.879 when computed individual-wise for
abdominal aortas, 0.958 for thoracic aortas, and 0.834 when computed
segment-wise. When the algorithm was applied to the PDW images only,
somewhat lower correlations were obtained. The MRI yielded
significantly higher values than histopathology, which excludes the
adventitia. Magnetic resonance imaging, in combination with dynamic
contours, may be a suitable technique for quantitative assessment of
atherosclerosis in vivo. Using two sequences for the measurement seems
to be superior to using a single sequence.
|
1043. | Ho, GHP, and Shi, PC, "Robust object segmentation with constrained curve embedding potential field," MEDICAL IMAGING AND AUGMENTED REALITY, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3150, pp. 145-153, 2004.
Abstract:
We have earlier introduced an implicit vector field representation for
arbitrary number of curves in space, the curve embedding potential
field (CEPF), and a general image segmentation strategy based on the
detection of the CEPF distortion under the influence of vector-form
image data [3]. In this paper, we present an improved CEPF framework
which incorporates prior knowledge of the object boundary and has
consistent object definition through a region growing process. The
embedded implicit curves deform through the image- and model-induced
changes of the CEPF, which evidently improves the segmentation accuracy
under noisy and broken-edge situations. Further, the closure
enforcement and the natural advection on the curves enhance the
stability of CEPF evolution and the implementation is straightforward.
Robust experimental results on cardiac and brain images are presented.
|
1044. | Li, Y, and Tang, QY, "A level set algorithm for contour tracking in medical images," MEDICAL IMAGING AND AUGMENTED REALITY, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3150, pp. 137-144, 2004.
Abstract:
In this paper, a novel curve evolution strategy driven by boundary
statistics for the segmentation of medical images is proposed and
realized under the Level Set framework. It has a speed term similar to
that of the Chan-Vese's method [1] for bimodal pictures, but is driven
by boundary statistics (the statistics of intensity in an observing
window) instead of the global statistics. In the case of multimodal
pictures, the target's shape can, therefore, be more easily recovered.
Here, we present methods for shape prediction based on the signed
distance functions and extension field constructed from the boundary
statistics. Employing the above techniques, our algorithm can
adaptively handle both the sharp and smooth edges of the target, and
its efficiency is demonstrated in the contour tracking of medical
images.
|
1045. | Ran, X, and Qi, FH, "Segmental active contour model integrating region information for medical image segmentation," MEDICAL IMAGING AND AUGMENTED REALITY, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3150, pp. 129-136, 2004.
Abstract:
A segmental active contour model integrating region information is
proposed. Different deformation schemes are used at two stages for
segmenting the object correctly in image plain. At the first stage the
contour of the model is divided into several segments hierarchically
that deform respectively using affine transformation. After the contour
is deformed to the approximate boundary of object, a fine match
mechanism using statistical information of local region is adopted to
make the contour fit the object's boundary exactly. The experimental
results indicate that the proposed model is robust to local minima and
able to search for concave objects.
|
1046. | Kim, TY, Park, JH, and Lee, SW, "Object boundary edge selection for human body tracking using level-of-detail canny edges," PRICAI 2004: TRENDS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, vol. 3157, pp. 787-796, 2004.
Abstract:
We propose a method for an accurate subject tracking by selecting only
tracked subject boundary edges in a video stream with changing
background and a moving camera. Our boundary edge selection is done in
two steps; 1) remove background edges using an edge motion, 2) from the
output of the previous step, select boundary edges using a normal
direction derivative of the tracked contour. Our accurate tracking is
based on reducing affects from irrelevant edges by selecting boundary
edge pixels only. In order to remove background edges using the edge
motion, we compute tracked subject motion and edge motions. The edges
with different motion direction than the subject motion are removed. In
selecting boundary edges using the contour normal direction, we compute
image gradient values on every edge pixels, and select edge pixels with
large gradient values. We use multi-level Canny edge maps to get proper
details of a scene. Multi-level edge maps allow us robust tracking even
though the tracked object boundary is not clear, because we can adjust
the detail level of an edge map for the scene. The computed contour is
improved by checking against a strong (simple) Canny edge map and
hiring strong Canny edge pixels around the computed contour using
Dijkstra's minimum cost routing. Our experimental results show that our
tracking approach is robust enough to handle a complex-textured scene.
|
1047. | Wang, YZ, and Yang, J, "Gradient vector flow snake with embedded edge confidence," PRICAI 2004: TRENDS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, vol. 3157, pp. 778-786, 2004.
Abstract:
Snakes, or active contours, are used extensively in computer vision and
image processing applications, particularly in locating object
boundaries. Problems associated with initialization and poor
convergence to boundary concavities have limited their utility.
Gradient vector flow (GVF) snake solved both problems successfully.
However, boundaries in noisy images are often blurred even destroyed
with smoothing and false results usually occur when such images are
processed even with GVF snake model. We have incorporated embedded edge
confidence (EEC) into GVF snake model. The improved method can solve
this problem when noisy images were processed.
|
1048. | Yang, J, and Duncan, JS, "3D image segmentation of deformable objects with joint shape-intensity prior models using level sets," MEDICAL IMAGE ANALYSIS, vol. 8, pp. 285-294, 2004.
Abstract:
We propose a novel method for 3D image segmentation, where a Bayesian
formulation, based on joint prior knowledge of the object shape and the
image gray levels, along with information derived from the input image,
is employed. Our method is motivated by the observation that the shape
of an object and the gray level variation in an image have consistent
relations that provide configurations and context that aid in
segmentation. We define a maximum a posteriori (MAP) estimation model
using the joint prior information of the object shape and the image
gray levels to realize image segmentation. We introduce a
representation for the joint density function of the object and the
image gray level values, and define a joint probability distribution
over the variations of the object shape and the gray levels contained
in a set of training images. By estimating the MAP shape of the object,
we formulate the shape-intensity model in terms of level set functions
as opposed to landmark points of the object shape. In addition, we
evaluate the performance of the level set representation of the object
shape by comparing it with the point distribution model (PDM). We found
the algorithm to be robust to noise and able to handle multidimensional
data, while able to avoid the need for explicit point correspondences
during the training phase. Results and validation from various
experiments on 2D and 3D medical images are shown. (C) 2004 Elsevier
B.V. All rights reserved.
|
1049. | Cates, JE, Lefohn, AE, and Whitaker, RT, "GIST: an interactive, GPU-based level set segmentation tool for 3D medical images," MEDICAL IMAGE ANALYSIS, vol. 8, pp. 217-231, 2004.
Abstract:
While level sets have demonstrated a great potential for 3D medical
image segmentation, their usefulness has been limited by two problems.
First, 3D level sets are relatively slow to compute. Second, their
formulation usually entails several free parameters which can be very
difficult to correctly tune for specific applications. The second
problem is compounded by the first. This paper describes a new tool for
3D segmentation that addresses these problems by computing level-set
surface models at interactive rates. This tool employs two important,
novel technologies. First is the mapping of a 3D level-set solver onto
a commodity graphics card (GPU). This mapping relies on a novel
mechanism for GPU memory management. The interactive rates level-set
PDE solver give the user immediate feedback on the parameter settings,
and thus users can tune free parameters and control the shape of the
model in real time. The second technology is the use of intensity-based
speed functions, which allow a user to quickly and intuitively specify
the behavior of the deformable model. We have found that the
combination of these interactive tools enables users to produce good,
reliable segmentations. To support this observation, this paper
presents qualitative results from several different datasets as well as
a quantitative evaluation from a study of brain tumor segmentations.
(C) 2004 Elsevier B.V. All rights reserved.
|
1050. | Jian, C, and Amini, AA, "Quantifying 3-D vascular structures in MRA images using hybrid PDE and geometric deformable models," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 23, pp. 1251-1262, 2004.
Abstract:
The aim of this paper is to present a hybrid approach to accurate
quantification of vascular structures from magnetic resonance
angiography (MRA) images using level set methods and deformable
geometric models constructed with 3-D Delaunay triangulation. Multiple
scale filtering based on the analysis of local intensity structure
using the Hessian matrix is used to effectively enhance vessel
structures with various diameters. The level set method is then applied
to automatically segment vessels enhanced by the filtering with a speed
function derived from enhanced MRA images. Since the goal of this paper
is to obtain highly accurate vessel borders, suitable for use in fluid
flow simulations, in a subsequent step, the vessel surface determined
by the level set method is triangulated using 3-D Delaunay
triangulation and the resulting surface is used as a parametric
deformable model. Energy minimization is then performed within a
variational setting with a first-order internal energy; the external
energy is derived from 3-D image gradients. Using the proposed method,
vessels are accurately segmented from MRA data.
|
1051. | Positano, V, Gastaidelli, A, Sironi, AM, Santarelli, MF, Lombardi, M, and Landini, L, "An accurate and robust method for unsupervised assessment of abdominal fat by MRI," JOURNAL OF MAGNETIC RESONANCE IMAGING, vol. 20, pp. 684-689, 2004.
Abstract:
Purpose: To describe and evaluate an automatic and unsupervised method
for assessing the quantity and distribution of abdominal adipose tissue
by MRI.
Material and Methods: A total of 20 patients underwent whole-abdomen
MRI. A total of 32 transverse T1-weighted images were acquired from
each subject. The data collected were transferred to a dedicated
workstation and analyzed by both our unsupervised method and a manual
procedure. The proposed methodology allows the automatic processing of
MRI axial images, segmenting the adipose tissue by fuzzy clustering
approach. The use of an active contour algorithm on image masks
provided by the fuzzy clustering algorithm allows the separation of
subcutaneous fat from visceral fat. Finally, an automated procedure
based on automatic image histogram analysis identifies the visceral fat.
Results: The accuracy, reproducibility, and speed of our automatic
method were compared with the state-of-the-art manual approach. The
unsupervised analysis correlated well with the manual analysis, and was
significantly faster than manual tracing. Moreover, the unsupervised
method was not affected by intraobserver and interobserver variability.
Conclusion: The results obtained demonstrate that the proposed method
can provide the volume of subcutaneous adipose tissue, visceral adipose
tissue, global adipose tissue, and the ratio between subcutaneous and
visceral fat in an unsupervised and effective manner.
|
1052. | Wimmers, AJ, and Moody, JL, "Tropopause folding at satellite-observed spatial gradients: 2. Development of an empirical model," JOURNAL OF GEOPHYSICAL RESEARCH-ATMOSPHERES, vol. 109, pp. 975-985, 2004.
Abstract:
We develop an empirical model that estimates the horizontal
distribution of tropopause folds based primarily on a robust
relationship between upper tropospheric specific humidity gradients and
tropopause folding. The specific humidity gradients are resolved by the
altered water vapor (AWV) product, developed from the GOES imager water
vapor channel. Unexpectedly, no proportional relationship was found
between tropopause fold size and AWV gradient magnitude beyond the
one-to-one occurrence of strong gradients at tropopause folds. This
indicates that tropopause folds do not commonly reach a "steady state"
mass of ozone inside the fold. Rather, the mass of air must be
controlled at least as much by the age of the fold and dynamical
dispersion mechanisms that are not linearly related to the strength of
the corresponding tropopause depression. This has important
implications for the interpretation of lidar imagery and in situ ozone
data at tropopause folds. In lieu of this result, a uniform fold size
is assigned at all locations of modeled folding on the basis of the
average of the folds used in parameterization. The model estimates the
distribution of actively developing and residual tropopause folds,
which is a useful method of tracking the dispersal of all
stratospherically enhanced air in the troposphere and is unique to this
observation-based model of tropopause folding.
|
1053. | Shih, FY, and Zhang, K, "Inter-frame interpolation by snake model and greedy algorithm," INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, vol. 18, pp. 975-985, 2004.
Abstract:
In this paper, we present a novel method to solve the inter-frame
interpolation problem in image morphing. We use our improved snake
model that is associated with the gravitationa force field to locate
control points in the object contours. Afterwards, we apply the greedy
algorithm in free-form deformations to achieve optimal warps among
feature point pairs in starting and ending frames. The new method uses
an energy-minimization function under the influence of inter-frames.
The energy serves to impose frame-wise and curve-wise constraints among
the interpolated frames.
|
1054. | Berg, E, Mahfouz, M, Debrunner, C, and Hoff, W, "A 2D Fourier approach to deformable model segmentation of 3D medical images," COMPUTER VISION AND MATHEMATICAL METHODS IN MEDICAL AND BIOMEDICAL IMAGE ANALYSIS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3117, pp. 181-192, 2004.
Abstract:
Anatomical shapes present a unique problem in terms of accurate
representation and medical image segmentation. Three-dimensional
statistical shape models have been extensively researched as a means of
autonomously segmenting and representing models. We present a
segmentation method driven by a statistical shape model based on a
priori shape information from manually segmented training image sets.
Our model is comprised of a stack of two-dimensional Fourier
descriptors computed from the perimeters of the segmented training
image sets after a transformation into a canonical coordinate frame. We
apply our shape model to the segmentation of CT and MRI images of the
distal femur via an original iterative method based on active contours.
The results from the application of our novel method demonstrate its
ability to accurately capture anatomical shape variations and guide
segmentation. Our quantitative results are unique in that most similar
previous work presents only qualitative results.
|
1055. | Kim, TY, Park, JH, and Lee, SW, "Object boundary edge selection for accurate contour tracking using multi-level canny edges," IMAGE ANALYSIS AND RECOGNITION, PT 2, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3212, pp. 536-543, 2004.
Abstract:
We propose a method of selecting only tracked subject boundary edges in
a video stream with changing background and a moving camera. Our
boundary edge selection is done in two steps; first, remove background
edges using an edge motion, second, from the output of the previous
step, select boundary edges using a normal direction derivative of the
tracked contour. In order to remove background edges, we compute edge
motions and object motions. The edges with different motion direction
than the subject motion are removed. In selecting boundary edges using
the contour normal direction, we compute image gradient values on every
edge pixels, and select edge pixels with large gradient values. We use
multi-level Canny edge maps to get proper details of a scene.
Detailed-level edge maps give us more scene information even though the
tracked object boundary is not clear, because we can adjust the detail
level of edge maps for a scene. We use Watersnake model to decide a new
tracked contour. Our experimental results show that our approach is
superior to Nguyen's.
|
1056. | Park, JH, Kim, TY, and Park, S, "LOD canny edge based boundary edge selection for human body tracking," IMAGE ANALYSIS AND RECOGNITION, PT 2, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3212, pp. 528-535, 2004.
Abstract:
We propose a simple method for tracking a nonparameterized subject
contour in a single video stream with a moving camera and changing
background. Our method is based on level-of-detail (LOD) Canny edge
maps and graph-based routing operations on the LOD maps. LOD Canny edge
maps are generated by changing scale parameters for a given image.
Simple (strong) Canny edge map has the smallest number of edge pixels
while the most detailed Canny edge map, Wcanny(N), has the biggest
number of edge pixels. We start our basic tracking using strong Canny
edges generated from large image intensity gradients of an input image,
called Scanny edges to reduce side-effects because of irrelevant edges.
Starting from Scanny edges, we get more edge pixels ranging from simple
Canny edge maps until the most detailed Canny edge maps. LOD Canny edge
pixels become nodes in routing, and LOD values of adjacent edge pixels
determine routing costs between the nodes. We find a best route to
follow Canny edge pixels favoring stronger Canny edge pixels. Our
accurate tracking is based on reducing effects from irrelevant edges by
selecting the stronger edge pixels, thereby relying on the current
frame edge pixel as much as possible contrary to other approaches of
always combining the previous contour. Our experimental results show
that this tracking approach is robust enough to handle a
complex-textured scene.
|
1057. | Smolka, B, and Lukac, R, "Segmentation of the comet assay images," IMAGE ANALYSIS AND RECOGNITION, PT 2, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3212, pp. 124-131, 2004.
Abstract:
The single cell gel electrophoresis, called Comet Assay, is a
microelectrophoretic technique of direct visualization of the DNA
damage at the cell level. In the comet assay, the cells suspended in an
agarose gel on a microscope slide are subjected to lysis, unwinding of
DNA and electrophoresis. Under the influence of weak, static electric
field, charged DNA migrates away from the nucleus, forming the so
called comet. The damage is quantified by measuring the amount of the
genetic material, which migrates from the nucleus to form the comet
tail. In this paper we present three novel methods of the comet tail
and head extraction, which allow to quantify the cell's damage.
|
1058. | Wang, JB, Betke, M, and Ko, JP, "Shape-based curve growing model and adaptive regularization for pulmonary fissure segmentation in CT," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2004, PT 1, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3216, pp. 541-548, 2004.
Abstract:
This paper presents a shape-based curve-growing algorithm for object
recognition in the field of medical imaging. The proposed curve growing
process, modeled by a Bayesian network, is influenced by both image
data and prior knowledge of the shape of the curve. A maximum a
posteriori (MAP) solution is derived using an energy-minimizing
mechanism. It is implemented in an adaptive regularization framework
that balances the influence of image data and shape prior in estimating
the curve, and reflects the causal dependencies in the Bayesian
network. The method effectively alleviates over-smoothing, an effect
that can occur with other regularization methods. Moreover, the
proposed framework also addresses initialization and local minima
problems. Robustness and performance of the proposed method are
demonstrated by segmentation of pulmonary fissures in computed
tomography (CT) images.
|
1059. | Solem, JE, Persson, M, and Heyden, A, "Velocity based segmentation in phase contrast MRI images," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2004, PT 1, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3216, pp. 459-466, 2004.
Abstract:
Phase contrast MRI is a relatively new technique that extends standard
MRI by obtaining flow information for tissue in the human body. The
output data is a velocity vector field in a three-dimensional (3D)
volume. This paper presents EL method for 3D segmentation of blood
vessels and determining the surface of the inner wall using this vector
field. The proposed method uses a variational formulation and the
segmentation is performed using the level set method. The purpose of
this paper is to show that it is possible to perform segmentation using
only velocity data which would indicate that velocity is a strong cue
in these types of segmentation problems. This is shown in experiments.
A novel vector field discontinuity detector is introduced and used in
the variational formulation. The performance of this measure is tested
with satisfactory results.
|
1060. | Ho, S, and Gerig, G, "Profile scale-spaces for multiscale image match," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2004, PT 1, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3216, pp. 176-183, 2004.
Abstract:
We present a novel statistical image-match model for use in Bayesian
segmentation, a multiscale extension of image profile models akin to
those in Active Shape Models. A spherical-harmonic based 3D shape
representation provides a mapping of the object boundary to the sphere
S-2, and a scale-space for profiles on the sphere defines a scale-space
on the object. A key feature is that profiles are not blurred across
the object boundary, but only along the boundary. This profile
scale-space is sampled in a coarse-to-fine fashion to produce features
for the statistical image-match model. A framework for model-building
and segmentation has been built, and testing and validation are in
progress with a dataset of 70 segmented images of the caudate nucleus.
|
1061. | Wong, WCK, Chung, ACS, and Yu, SCH, "Augmented vessels for pre-operative preparation in endovascular treatments," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2004, PT 2, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3217, pp. 602-609, 2004.
Abstract:
Three-dimensional rotational angiography is a very useful tool for
accessing abnormal vascular structures related to a variety of vascular
diseases. Quantitative study of the abnormalities could aid the
radiologists to choose the appropriate apparatuses and endovascular
treatments. Given a segmentation of an angiography, effective
quantitation of the abnormalities is attainable if the abnormalities
are detached from the normal vasculature. To achieve this, a novel
method is presented, which allows the users to construct imaginary
disease-free vessel lumens, namely augmented vessels, and demarcate the
abnormalities on the fly interactively. The method has been tested on
several synthetic images and clinical datasets. The experimental
results have shown that it is capable of separating a variety of
abnormalities, e.g., stenosis, saccular and fusiform aneurysms, from
the normality.
|
1062. | Camara, O, Colliot, O, and Bloch, I, "Computational modeling of thoracic and abdominal anatomy using spatial relationships for image segmentation," REAL-TIME IMAGING, vol. 10, pp. 263-273, 2004.
Abstract:
This paper presents an original hierarchical segmentation approach of
several thoracic and abdominal structures in CT and emission PET
images. Segmentation results will be used to initialize a non-linear
registration procedure between these complementary imaging modalities.
Therefore, structures involved in the segmentation system must be
visible in both CT and emission PET images in order to compute a
spatial transformation between them. Thus, the chosen structures
include lungs, kidneys and liver (skin and skeleton are also segmented
as support structures). In the hierarchical segmentation procedure, the
extraction of a given structure is driven by information derived from a
simpler one. This information is composed of spatial constraints
inferred from the previously segmented structures and expressed by
means of Regions Of Interest (ROI) in which the search for new
structures will take place. The segmentation of each structure follows
a two-phase process: a first stage is composed of automatic
thresholding and other low-level operations in the ROI defined by
previously segmented objects; a second stage employs a 3D deformable
model to refine and regularize results provided by the former step.
Visual inspection by medical experts has stated that the proposed
segmentation approach provides results which are accurate enough to
guide a subsequent non-linear registration procedure. (C) 2004 Elsevier
Ltd. All rights reserved.
|
1063. | Jalba, AC, Wilkinson, MH, and Roerdink, JBTM, "Automatic image segmentation using a deformable model based on charged particles," IMAGE ANALYSIS AND RECOGNITION, PT 1, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3211, pp. 1-8, 2004.
Abstract:
We present a method for automatic segmentation of grey-scale images,
based on a recently introduced deformable model, the charged-particle
model (CPM). The model is inspired by classical electrodynamics and is
based on a simulation of charged particles moving in an electrostatic
field. The charges are attracted towards the contours of the objects of
interest by an electrostatic field, whose sources are computed based on
the gradient-magnitude image. Unlike the case of active contours,
extensive user interaction in the initialization phase is not
mandatory, and segmentation can be performed automatically. To
demonstrate the reliability of the model, we conducted experiments on a
large database of microscopic images of diatom shells. Since the shells
are highly textured, a post-processing step is necessary in order to
extract only their outlines.
|
1064. | Akahn-Acar, Z, and Gencer, NG, "An advanced boundary element method (BEM) implementation for the forward problem of electromagnetic source imaging," PHYSICS IN MEDICINE AND BIOLOGY, vol. 49, pp. 5011-5028, 2004.
Abstract:
The forward problem of electromagnetic source imaging has two
components: a numerical model to solve the related integral equations
and a model of the head geometry. This study is on the boundary element
method (BEM) implementation for numerical solutions and realistic head
modelling. The use of second-order (quadratic) isoparametric elements
and the recursive integration technique increase the accuracy in the
solutions. Two new formulations are developed for the calculation of
the transfer matrices to obtain the potential and magnetic field
patterns using realistic head models. The formulations incorporate the
use of the isolated problem approach for increased accuracy in
solutions. If a personal computer is used for computations, each
transfer matrix is calculated in 2.2 h. After this pre-computation
period, solutions for arbitrary source configurations can be obtained
in milliseconds for a realistic head model. A hybrid algorithm that
uses snakes, morphological operations, region growing and thresholding
is used for segmentation. The scalp, skull, grey matter, white matter
and eyes are segmented from the multimodal magnetic resonance images
and meshes for the corresponding surfaces are created. A mesh
generation algorithm is developed for modelling the intersecting tissue
compartments, such as eyes. To obtain more accurate results quadratic
elements are used in the realistic meshes. The resultant BEM
implementation provides more accurate forward problem solutions and
more efficient calculations. Thus it can be the firm basis of the
future inverse problem solutions.
|
1065. | Chiu, B, Freeman, GH, Salama, MMA, and Fenster, A, "Prostate segmentation algorithm using dyadic wavelet transform and discrete dynamic contour," PHYSICS IN MEDICINE AND BIOLOGY, vol. 49, pp. 4943-4960, 2004.
Abstract:
Knowing the location and the volume of the prostate is important for
ultrasound-guided prostate brachytherapy, a commonly used prostate
cancer treatment method. The prostate boundary must be segmented before
a dose plan can be obtained. However, manual segmentation is arduous
and time consuming. This paper introduces a semi-automatic segmentation
algorithm based on the dyadic wavelet transform (DWT) and the discrete
dynamic contour (DDC). A spline interpolation method is used to
determine the initial contour based on four user-defined initial
points. The DDC model then refines the initial contour based on the
approximate coefficients and the wavelet coefficients generated using
the DWT. The DDC model is executed under two settings. The coefficients
used in these two settings are derived using smoothing functions with
different sizes. A selection rule is used to choose the best contour
based on the contours produced in these two settings. The accuracy of
the final contour produced by the proposed algorithm is evaluated by
comparing it with the manual contour Outlined by an expert observer. A
total of 114 2D TRUS images taken for six different patients scheduled
for brachytherapy were segmented using the proposed algorithm. The
average difference between the contour segmented using the proposed
algorithm and the manually outlined contour is less than 3 pixels.
|
1066. | Cho, J, "Sequential cardiac segmentation by seed contour tracking," ELECTRONICS LETTERS, vol. 40, pp. 1467-1469, 2004.
Abstract:
A sequential cardiac segmentation method based on an active contour
model, initial seed contour tracking (SCT) scheme, and phase contrast
magnetic resonance imaging (MRI) has been developed to improve the
accuracy of automatic sequential segmentation of the myocardial
boundaries, especially the endocardial boundary. The performance of the
proposed method was assessed by experiments performed on phase contrast
MRI data sets from three normal human volunteers. Experimental results
showed that the propagation of errors caused by improper positioning of
initial seed contours in sequential cardiac segmentation was reduced
significantly by the use of the SCT scheme.
|
1067. | Ran, X, Qi, FH, and Fang, Y, "Image segmenting using segmental deformable model based on affine invariants," JOURNAL OF INFRARED AND MILLIMETER WAVES, vol. 23, pp. 446-450, 2004.
Abstract:
A segmental deformable model for image segmentation was presented and
affine invariants were introduced into. the model's energy function.
The contour of the model is deformed hierachically, which keeps the
relationship of control points along the contour. Reformative
definitions of internal and external energy can reduce computational
complexity. In comparison with the classical deformable model, the
experimental results demonstrate that the proposed model, which is more
effective and more robust to local minima and noise, can achieve better
performance-for medical image segmentation.
|
1068. | Jalba, AC, Wilkinson, MH, and Roerdink, JBTM, "Automatic segmentation of diatom images for classification," MICROSCOPY RESEARCH AND TECHNIQUE, vol. 65, pp. 72-85, 2004.
Abstract:
A general framework for automatic segmentation of diatom images is
presented. This segmentation is a critical first step in contour-based
methods for automatic identification of diatoms by computerized image
analysis. We review existing results, adapt popular segmentation
methods to this difficult problem, and finally develop a method that
substantially improves existing results. This method is based on the
watershed segmentation from mathematical morphology, and belongs to the
class of hybrid segmentation techniques. The novelty of the method is
the use of connected operators for the computation and selection of
markers, a critical ingredient in the watershed method to avoid
over-segmentation. All methods considered were used to extract binary
contours from a large database of diatom images, and the quality of the
contours was evaluated both visually and based on identification
performance. (C) 2004 Wiley-Liss, Inc.
|
1069. | Cootes, TF, and Taylor, CJ, "Anatomical statistical models and their role in feature extraction," BRITISH JOURNAL OF RADIOLOGY, vol. 77, pp. S133-S139, 2004.
Abstract:
A detailed model of the shape of anatomical structures can
significantly improve the ability to segment such structures from
medical images. Statistical models representing the variation of shape
and appearance can be constructed from suitably annotated training
sets. Such models can be used to synthesize images of anatomy, and to
search new images to accurately locate the structures of interest, even
in the presence of noise and clutter. In this paper we summarize recent
work on constructing and using such models, and demonstrate their
application to several domains.
|
1070. | Kim, YG, Gwun, OB, and Song, JW, "Brain region extraction and direct volume rendering of MRI head data," COMPUTATIONAL AND INFORMATION SCIENCE, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3314, pp. 516-522, 2004.
Abstract:
This paper proposes a new 3D visualization method for MRI head data
based upon direct volume rendering. Surface rendering has difficulties
in displaying speckles due to information loss during the surface
construction procedure, whereas direct volume rendering does not have
this problem, though managing MR head image data is not an easy task.
In our method, brain structures are extracted from MR images, and then
embedded back into the remaining regions. To extract the brain
structure, we use a combination of thresholding, morphology and SNAKES
operations. Experimental results show that our method makes it possible
to simultaneously visualize all the anatomical organs of human brains
in three dimensions.
|
1071. | Fernandez-Gonzalez, R, Deschamps, T, Idica, A, Malladi, R, and de Solorzano, CO, "Automatic segmentation of histological structure in mammary gland tissue sections," JOURNAL OF BIOMEDICAL OPTICS, vol. 9, pp. 444-453, 2004.
Abstract:
Real-time three-dimensional (3-D) reconstruction of epithelial
structures in human mammary gland tissue blocks mapped with selected
markers would be an extremely helpful tool for diagnosing breast cancer
and planning treatment. Besides its clear clinical application, this
tool could also shed a great deal of light on the molecular basis of
the initiation and progression of breast cancer. We present a framework
for real-time segmentation of epithelial structures in two-dimensional
(2-D) images of sections of normal and neoplastic mammary gland tissue
blocks. Complete 3-D rendering of the tissue can then be done by
surface rendering of the structures detected in consecutive sections of
the blocks. Paraffin-em bedded or frozen tissue blocks are first sliced
and sections are stained with hematoxylin and eosin. The sections are
then imaged using conventional bright-field microscopy and their
background corrected using a phantom image. We then use the
fast-marching algorithm to roughly extract the contours of the
different morphological structures in the images. The result is then
refined with the level-set method, which converges to an accurate
(subpixel) solution for the segmentation problem. Finally, our system
stacks together the 2-D results obtained in order to reconstruct a 3-D
representation of the entire tissue block under study. Our method is
illustrated with results from the segmentation of human and mouse
mammary gland tissue samples. (C) 2004 Society of Photo-Optical
Instru-mentation Engineers.
|
1072. | Holmgren, J, and Persson, A, "Identifying species of individual trees using airborne laser scanner," REMOTE SENSING OF ENVIRONMENT, vol. 90, pp. 415-423, 2004.
Abstract:
Individual trees can be detected using high-density airborne laser
scanner data. Also, variables characterizing the detected trees such as
tree height, crown area, and crown base height can be measured. The
Scandinavian boreal forest mainly consists of Norway spruce (Picea
abies L. Karst.), Scots pine (Pinus sylvestris L.), and deciduous
trees. It is possible to separate coniferous from deciduous trees using
near-infrared images, but pine and spruce give similar spectral
signals. Airborne laser scanning, measuring structure and shape of tree
crowns could be used for discriminating between spruce and pine. The
aim of this study was to test classification of Scots pine versus
Norway spruce on an individual tree level using features extracted from
airborne laser scanning data. Field measurements were used for training
and validation of the classification. The position of all trees on 12
rectangular plots (50 X 20 in 2) were measured in field and tree
species was recorded. The dominating species (>80%) was Norway spruce
for six of the plots and Scots pine for six plots. The field-measured
trees were automatically linked to the laser-measured trees. The
laser-detected trees on each plot were classified into species classes
using all laser-detected trees on the other plots as training data. The
portion correctly classified trees on all plots was 95%. Crown base
height estimations of individual trees were also evaluated (r=0.84).
The classification results in this study demonstrate the ability to
discriminate between pine and spruce using laser data. This method
could be applied in an operational context. In the first step, a
segmentation of individual tree crowns is performed using laser data.
In the second step, tree species classification is performed based on
the segments. Methods could be developed in the future that combine
laser data with digital near-infrared photographs for classification
with the three classes: Norway spruce, Scots pine, and deciduous trees.
(C) 2003 Elsevier Inc. All rights reserved.
|
1073. | Sachse, FB, "Computational Cardiology - Modeling of Anatomy, Electrophysiology, and Mechanics - Introduction," COMPUTATIONAL CARDIOLOGY: MODELING OF ANATOMY, ELECTROPHYSIOLOGY, AND MECHANICS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2966, pp. 1-322, 2004.
Abstract:
In this paper we assess the performance of a variety of corner (point)
detecting algorithms for feature tracking applications. We analyze four
different types of corner extractors, which have been widely used for a
variety of applications (they are described later in the paper). We use
corner stability and corner localization properties as measures to
evaluate the quality of the features extracted by the four detectors.
For effective assessment of the corner detectors, first, we employed
image sequences with no motion (simply static image sequences), so that
the appearance and disappearance of corners in each frame is purely due
to image plane noise and illumination conditions. The second stage
included experiments on sequences with small motion. The experiments
were devised to make the testing environment ideal to analyze the
stability and localization properties of the corners extracted. The
corners detected from the initial frame are then matched through the
sequence using a corner matching strategy. We employed two different
types of matchers, namely the GVM (Gradient Vector Matcher) and the
Product Moment Coefficient Matcher (PMCM). Each of the corner detectors
was tested with each of the matching algorithms to evaluate their
performance in tracking (matching) the features. The experiments were
carried out on a variety of image sequences with and without motion.
(C) 2004 Elsevier B.V. All rights reserved.
|
1074. | Tissainayagam, P, and Suter, D, "Assessing the performance of corner detectors for point feature tracking applications," IMAGE AND VISION COMPUTING, vol. 22, pp. 663-679, 2004.
Abstract:
In this paper we assess the performance of a variety of corner (point)
detecting algorithms for feature tracking applications. We analyze four
different types of corner extractors, which have been widely used for a
variety of applications (they are described later in the paper). We use
corner stability and corner localization properties as measures to
evaluate the quality of the features extracted by the four detectors.
For effective assessment of the corner detectors, first, we employed
image sequences with no motion (simply static image sequences), so that
the appearance and disappearance of corners in each frame is purely due
to image plane noise and illumination conditions. The second stage
included experiments on sequences with small motion. The experiments
were devised to make the testing environment ideal to analyze the
stability and localization properties of the corners extracted. The
corners detected from the initial frame are then matched through the
sequence using a corner matching strategy. We employed two different
types of matchers, namely the GVM (Gradient Vector Matcher) and the
Product Moment Coefficient Matcher (PMCM). Each of the corner detectors
was tested with each of the matching algorithms to evaluate their
performance in tracking (matching) the features. The experiments were
carried out on a variety of image sequences with and without motion.
(C) 2004 Elsevier B.V. All rights reserved.
|
1075. | Goldlucke, B, and Magner, M, "Weighted minimal hypersurfaces and their applications in computer vision," COMPUTER VISION - ECCV 2004, PT 2, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3022, pp. 366-378, 2004.
Abstract:
Many interesting problems in computer vision can be formulated as a
minimization problem for an energy functional. If this functional is
given as an integral of a scalar-valued weight function over an unknown
hypersurface, then the minimal surface we are looking for can be
determined as a solution of the functional's Euler-Lagrange equation.
This paper deals with a general class of weight functions that may
depend on the surface point and normal. By making use of a mathematical
tool called the method of the moving frame, we are able to derive the
Euler-Lagrange equation in arbitrary-dimensional space and without the
need for any surface parameterization. Our work generalizes existing
proofs, and we demonstrate that it yields the correct evolution
equations for a variety of previous computer vision techniques which
can be expressed in terms of our theoretical framework. In addition,
problems involving minimal hypersurfaces in dimensions higher than
three, which were previously impossible to solve in practice, can now
be introduced and handled by generalized versions of existing
algorithms. As one example, we sketch a novel idea how to reconstruct
temporally coherent geometry from multiple video streams.
|
1076. | Kuthirummal, S, Jawahar, CV, and Narayanan, PJ, "Constraints on coplanar moving points," COMPUTER VISION - ECCV 2004, PT 4, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2034, pp. 168-179, 2004.
Abstract:
Configurations of dynamic points viewed by one or more cameras have not
been studied much. In this paper, we present several view and
time-independent constraints on different configurations of points
moving on a plane. We show that 4 points with constant independent
velocities or accelerations under affine projection can be
characterized in a view independent manner using 2 views. Under
perspective projection, 5 coplanar points under uniform linear velocity
observed for 3 time instants in a. single view have a view-independent
characterization. The best known constraint for this case involves 6
points observed for 35 frames. Under uniform acceleration, 5 points in
5 time instants have a view-independent characterization. We also
present constraints on a point undergoing arbitrary planar motion under
affine projections in the Fourier domain. The constraints introduced in
this paper involve fewer points or views than similar results reported
in the literature and axe simpler to compute in most cases. The
constraints developed can be applied to many aspects of computer
vision. Recognition constraints for several planar point configurations
of moving points can result from them. We also show how time-alignment
of views captured independently can follow from the constraints on
moving point configurations.
|
1077. | Mio, W, Srivastava, A, and Liu, XW, "Learning and Bayesian shape extraction for object recognition," COMPUTER VISION - ECCV 2004, PT 4, LECTURE NOTES IN COMPUTER SCIENCE, vol. 2034, pp. 62-73, 2004.
Abstract:
We present a novel algorithm for extracting shapes of contours of
(possibly partially occluded) objects from noisy or low-contrast
images. The approach taken is Bayesian: we adopt a region-based model
that incorporates prior knowledge of specific shapes of interest. To
quantify this prior knowledge, we address the problem of learning
probability models for collections of observed shapes. Our method is
based on the geometric representation and algorithmic analysis of
planar shapes introduced and developed in [15]. In contrast with the
commonly used approach to active contours using partial differential
equation methods [12,20,1], we model the dynamics of contours on vector
fields on shape manifolds.
|
1078. | Duan, Y, Yang, L, Qin, H, and Samaras, D, "Shape reconstruction from 3D and 2D data using PDE-based deformable surfaces," COMPUTER VISION - ECCV 2004, PT 3, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3023, pp. 238-251, 2004.
Abstract:
In this paper, we propose a new PDE-based methodology for deformable
surfaces that is capable of automatically evolving its shape to capture
the geometric boundary of the data and simultaneously discover its
underlying topological structure. Our model can handle multiple types
of data (such as volumetric data, 3D point clouds and 2D image data),
using a common mathematical framework. The deformation behavior of the
model is governed by partial differential equations (e.g. the weighted
minimal surface flow). Unlike the level-set approach, our model always
has an explicit representation of geometry and topology. The regularity
of the model and the stability of the numerical integration process are
ensured by a powerful Laplacian tangential smoothing operator. By
allowing local adaptive refinement of the mesh, the model can
accurately represent sharp features. We have applied our model for
shape reconstruction from volumetric data, unorganhed 3D point clouds
and multiple view images. The versatility and robustness of our model
allow its application to the challenging problem of multiple view
reconstruction. Our approach is unique in its combination of
simultaneous use of a high number of arbitrary camera views with an
explicit mesh that is intuitive and easy-to-interact-with. Our
model-based approach automatically selects the best views for
reconstruction, allows for visibility checking and progressive
refinement of the model as more images become available. The results of
our extensive experiments on synthetic and real data demonstrate
robustness, high reconstruction accuracy and visual quality.
|
1079. | Baroni, M, and Barletta, G, "Contour definition and tracking in cardiac imaging through the integration of knowledge and image evidence," ANNALS OF BIOMEDICAL ENGINEERING, vol. 32, pp. 688-695, 2004.
Abstract:
The main contribution of this paper is the use of simple processing
techniques, incorporated in a new multistage approach, to automatically
delineate left ventricle contours. Another contribution is the proposal
of the centerline distances for contour comparison, which promises a
more accurate measurement than the common method, based on the distance
to the closest point. Edges are detected by Gaussian filtering at
coarse and fine scale. The region of interest is defined as a binary
map where coarse edges are extracted throughout image sequence. A
contour template is matched against the gradient of the first image.
Candidate boundary points are instantiated by scanning the coarse edge
map perpendicularly to the matched template. A candidate contour is
estimated from these points by maximizing an edge likelihood function.
A region growing algorithm gives another candidate contour. Both edge
and region candidate contours are then integrated with the edge map
computed at fine scale by maximizing another likelihood function.
Evaluation was carried out on 12 echocardiographic and 4
angiocardiographic sequences (for a total of 289 frames). Distances
between computer-generated contours and the contours traced by three
experts were within interobserver variability, unlike the results
obtained by Acoustic Quantification and by a general-purpose deformable
model.
|
1080. | Gevers, T, "Robust segmentation and tracking of colored objects in video," IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, vol. 14, pp. 776-781, 2004.
Abstract:
Segmenting and tracking of objects in video is of great importance for
video-based encoding, surveillance, and retrieval. However, the
inherent difficulty of object segmentation and tracking is to
distinguish changes in the displacement of objects from disturbing
effects such as noise and illumination changes.
Therefore, in this paper, we formulate a color-based deformable model
which is robust against noisy data and changing illumination.
Computational methods are presented to measure color constant
gradients. Further, a model is given to estimate the amount of sensor
noise through these color constant gradients. The obtained uncertainty
is subsequently used as a weighting term in the deformation process.
Experiments are conducted on image sequences recorded from
three-dimensional scenes. From the experimental results, it is shown
that the proposed color constant deformable method successfully rinds
object contours robust against illumination, and noisy, but homogeneous
regions.
|
1081. | Kang, DJ, Ha, JE, and Ahn, IM, "Object mark segmentation algorithm using dynamic programming for poor quality images in automated inspection process," COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2004, PT 4, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3046, pp. 896-905, 2004.
Abstract:
This paper presents a method to segment object ID (identification)
marks on poor quality images under uncontrolled lighting conditions of
automated inspection process. The method is based on multiple templates
and normalized gray-level correlation (NGC) method. We propose a
multiple template method, called as ATM (Active Template Model) which
uses a search technique of multiple templates from model templates to
match and segment character regions of the inspection images.
Conventional Snakes algorithm provides a good methodology to model the
functional of ATM. To increase the computation speed to segment the ID
mark regions, we introduce the Dynamic Programming based algorithm.
Experimental results using real images from automated factory are
presented.
|
1082. | Azernikov, S, and Fischer, A, "Efficient surface reconstruction method for distributed CAD," COMPUTER-AIDED DESIGN, vol. 36, pp. 799-808, 2004.
Abstract:
This paper describes a new fast Reverse Engineering (RE) method for
creating a 3D computerized model from an unorganized cloud of points.
The proposed method is derived directly from the problems and
difficulties currently associated with remote design over the Internet,
such as accuracy, transmission time and representation at different
levels of abstraction. With the proposed method, 3D models suitable for
distributed design systems can be reconstructed in real time. The mesh
reconstruction approach is based on aggregating very large scale 3D
scanned data into a Hierarchical Space Decomposition Model (HSDM),
realized by the Octree data structure. Then, a Connectivity Graph (CG)
is extracted and filled with facets. The HSDM can represent both the
boundary surface and the interior volume of an object. Based on the
proposed volumetric model, the surface reconstruction process becomes
robust and stable with respect to sampling noise. Moreover, the data
received from different surface/volume sampling devices can be handled
naturally. The hierarchical structure of the proposed volumetric model
enables data reduction, while preserving significant geometrical
features and object topology. As a result, reconstruction and
transmission over the network are efficient. Furthermore, the
hierarchical representation provides a capability for extracting models
at desired levels of detail, thus enabling designers to collaborate at
any product development stage: draft or detailed design. (C) 2003
Elsevier Ltd. All rights reserved.
|
1083. | Su, MS, Hwang, WL, and Cheng, KY, "Analysis on multiresolution mosaic images," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 13, pp. 952-959, 2004.
Abstract:
Image mosaicing is the act of combining two or more images and is used
in many applications in computer vision, image processing, and computer
graphics. It aims to combine images such that no obstructive boundaries
exist around overlapped regions and to create a mosaic image that
exhibits as little distortion as possible from the original images. In
the proposed technique, the to-be-combined images are first projected
into wavelet subspaces. The images projected into the same wavelet
space are then blended. Our blending function is derived from an energy
minimization model which balances the smoothness around the overlapped
region and the fidelity of the blended image to the original images.
Experiment results and subjective comparison with other methods are
given.
|
1084. | Zhang, ZY, Liu, ZC, Adler, D, Cohen, MF, Hanson, E, and Shan, Y, "Robust and rapid generation of animated faces from video images: A model-based modeling approach," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 58, pp. 93-119, 2004.
Abstract:
We have developed an easy-to-use and cost-effective system to construct
textured 3D animated face models from videos with minimal user
interaction. This is a particularly challenging task for faces due to a
lack of prominent textures. We develop a robust system by following a
model-based approach: we make full use of generic knowledge of faces in
head motion determination, head tracking, model fitting, and
multiple-view bundle adjustment. Our system first takes, with an
ordinary video camera, images of a face of a person sitting in front of
the camera turning their head from one side to the other. After five
manual clicks on two images to indicate the position of the eye
corners, nose tip and mouth corners, the system automatically generates
a realistic looking 3D human head model that can be animated
immediately (different poses, facial expressions and talking). A user,
with a PC and a video camera, can use our system to generate his/her
face model in a few minutes. The face model can then be imported in
his/her favorite game, and the user sees themselves and their friends
take part in the game they are playing. We have demonstrated the system
on a laptop computer live at many events, and constructed face models
for hundreds of people. It works robustly under various environment
settings.
|
1085. | Mira, J, Delgado, AE, Fernandez-Caballero, A, and Fernandez, MA, "Knowledge modelling for the motion detection task: the algorithmic lateral inhibition method," EXPERT SYSTEMS WITH APPLICATIONS, vol. 27, pp. 169-185, 2004.
Abstract:
In this article knowledge modelling at the knowledge level for the task
of moving objects detection in image sequences is introduced. Three
items have been the focus of the approach: (1) the convenience of
knowledge modelling of tasks and methods in terms of a library of
reusable components and in advance to the phase of operationalization
of the primitive inferences; (2) the potential utility of looking for
inspiration in biology; (3) the convenience of using these biologically
inspired problem-solving methods (PSMs) to solve motion detection tasks.
After studying a summary of the methods used to solve the motion
detection task, the moving targets in indefinite sequences of images
detection task is approached by means of the algorithmic lateral
inhibition (ALI) PSM. The task is decomposed in four subtasks: (a)
thresholded segmentation; (b) motion detection; (c) silhouettes parts
obtaining; and (d) moving objects silhouettes fusion. For each one of
these subtasks, first, the inferential scheme is obtained and then each
one of the inferences is operationalized. Finally, some experimental
results are presented along with comments on the potential value of our
approach. (C) 2004 Elsevier Ltd. All rights reserved.
|
1086. | Segonne, F, Dale, AM, Busa, E, Glessner, M, Salat, D, Hahn, HK, and Fischl, B, "A hybrid approach to the skull stripping problem in MRI," NEUROIMAGE, vol. 22, pp. 1060-1075, 2004.
Abstract:
We present a novel skull-stripping algorithm based on a hybrid approach
that combines watershed algorithms and deformable surface models. Our
method takes advantage of the robustness of the former as well as the
surface information available to the latter. The algorithm first
localizes a single white matter voxel in a T1-weighted MRI image, and
uses it to create a global minimum in the white matter before applying
a watershed algorithm with a preflooding height. The watershed
algorithm builds an initial estimate of the brain volume based on the
three-dimensional connectivity of the white matter. This first step is
robust, and performs well in the presence of intensity nonuniformities
and noise, but may erode parts of the cortex that abut bright nonbrain
structures such as the eye sockets, or may remove parts of the
cerebellum. To correct these inaccuracies, a surface deformation
process fits a smooth surface to the masked volume, allowing the
incorporation of geometric constraints into the skull-stripping
procedure. A statistical atlas, generated from a set of accurately
segmented brains, is used to validate and potentially correct the
segmentation, and the MRI intensity values are locally re-estimated at
the boundary of the brain. Finally, a high-resolution surface
deformation is performed that accurately matches the outer boundary of
the brain, resulting in a robust and automated procedure. Studies by
our group and others outperform other publicly available
skull-stripping tools. (C) 2004 Elsevier Inc. All rights reserved.
|
1087. | Galland, F, and Refregier, P, "Information-theory-based snake adapted to multiregion objects with different noise models," OPTICS LETTERS, vol. 29, pp. 1611-1613, 2004.
Abstract:
We propose a segmentation technique adapted to objects composed of
several regions with gray-level fluctuations described by different
probability laws. This, approach is based on information theory
techniques and leads to a multiregion polygonal snake driven by the
minimization of a criterion without any parameters to be tuned by the
user. We demonstrate the improvements obtained with this approach as
well as its low computational cost. This approach is compatible with
applications such as object recognition and object tracking with
nonrigid deformation in images perturbed by different types of optical
noise. (C) 2004 Optical Society of America.
|
1088. | Bischoff, S, and Kobbelt, LP, "Parameterization-free active contour models with topology control," VISUAL COMPUTER, vol. 20, pp. 217-228, 2004.
Abstract:
We present a novel approach for representing and evolving deformable
active contours by restricting the movement of the contour vertices to
the grid lines of a uniform lattice. This restriction implicitly
controls the (re)parameterization of the contour and hence makes it
possible to employ parameterization-independent evolution rules.
Moreover, the underlying uniform grid makes self-collision detection
very efficient. Our contour model is also able to perform topology
changes, but - more importantly - it can detect and handle
selfcollisions at subpixel precision. In applications where topology
changes are not appropriate, we generate contours that touch themselves
without any gaps or self-intersections.
|
1089. | Han, F, Tu, ZW, and Zhu, SC, "Range image segmentation by an effective jump-diffusion method," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 26, pp. 1138-1153, 2004.
Abstract:
This paper presents an effective jump-diffusion method for segmenting a
range image and its associated reflectance image in the Bayesian
framework. The algorithm works on complex real-world scenes (indoor and
outdoor), which consist of an unknown number of objects (or surfaces)
of various sizes and types, such as planes, conics, smooth surfaces,
and cluttered objects (like trees and bushes). Formulated in the
Bayesian framework, the posterior probability is distributed over a
solution space with a countable number of subspaces of varying
dimensions. The algorithm simulates Markov chains with both reversible
jumps and stochastic diffusions to traverse the solution space. The
reversible jumps realize the moves between subspaces of different
dimensions, such as switching surface models and changing the number of
objects. The stochastic Langevin equation realizes diffusions within
each subspace. To achieve effective computation, the algorithm
precomputes some importance proposal probabilities over multiple scales
through Hough transforms, edge detection, and data clustering. The
latter are used by the Markov chains for fast mixing. The algorithm is
tested on 100 1D simulated data sets for performance analysis on both
accuracy and speed. Then, the algorithm is applied to three data sets
of range images under the same parameter setting. The results are
satisfactory in comparison with manual segmentations.
|
1090. | Lee, C, and Bethel, JS, "Extraction, modelling, and use of linear features for restitution of airborne hyperspectral imagery," ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING, vol. 58, pp. 289-300, 2004.
Abstract:
This paper presents an approach for the restitution of airborne
hyperspectral imagery with linear features. The approach consisted of
semi-automatic line extraction and mathematical modelling of the linear
features. First, the line was approximately determined manually and
refined using dynamic programming. The extracted lines could then be
used as control data with the ground information of the lines, or as
constraints with simple assumption for the ground information of the
line. The experimental results are presented numerically in tables of
RMS residuals of check points as well as visually in ortho-rectified
images. (C) 2003 Elsevier B.V. All rights reserved.
|
1091. | Das, B, and Banerjee, S, "Inertial snake for contour detection in ultrasonography images," IEE PROCEEDINGS-VISION IMAGE AND SIGNAL PROCESSING, vol. 151, pp. 235-240, 2004.
Abstract:
Snakes, or active contour models are used extensively for image
segmentation in varied fields. However, some major challenges restrict
their use in many fields. The authors propose a new inertial snake
model, that introduces an inertial effect of the control points into
the snake framework. The proposed inertial force along with the first-
and second-order continuity forces controls the spline motion through
the concavities and also against weak edge forces. This smart force
field, added to the inertial energy framework, posses the ability to
adaptively reduce its effect near the true edges, so that the energy
minimising spline converges into the edges. A greedy snake has been
used for computation of the energy minimising spline. The algorithm has
been tested on phantoms and ultrasound images as well. It is shown in
the results that the proposed algorithm classifies the object from the
background class in most of the images perfectly. Ultrasound images of
a lower limb artery of an adult woman have been tested with this
algorithm, and also extended for motion tracking.
|
1092. | Lohscheller, J, Dollinger, M, Schuster, M, Schwarz, R, Eysholdt, U, and Hoppe, U, "Quantitative investigation of the vibration pattern of the substitute voice generator," IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, vol. 51, pp. 1394-1400, 2004.
Abstract:
After a total excision of the larynx, mucosal tissue at the upper part
of the esophagus can be used as a substitute voice generating element.
The properties of the tissue dynamics are closely related to the
substitute voice quality. The process of substitute voice is
investigated by recording simultaneously the acoustic signal with a
microphone and the vibrations of the voice generator with a digital
high-speed camera. We propose an automatic image-processing technique
which is applied to analyze the vibration pattern of the substitute
voice generating element. First, an initialization step detects the
voice generator within a high-speed sequence. Second, a combination of
a threshold technique and an active contour algorithm tracks the tissue
deformations of the substitute voice generator. The applicability of
the algorithm is shown in three high-speed recordings. For the first
time, tissue deformations of substitute voice generating elements are
successfully tracked. The results of the image processing procedure are
used to describe quantitatively the temporal properties of the
substitute voice generator. Comparisons of the spectral components of
tissue deformations and tracheoesophageal voice signals reveal the
close relationship between the vibration pattern of the substitute
voice generator and the quality of substitute voice.
|
1093. | Yahia-Cherif, L, Gilles, B, Molet, T, and Magnenat-Thalmann, N, "Motion capture and visualization of the hip joint with dynamic MRI and optical systems," COMPUTER ANIMATION AND VIRTUAL WORLDS, vol. 15, pp. 377-385, 2004.
Abstract:
We present a methodology for motion tracking and visualization of the
hip joint by combining MR images and optical motion capture systems.
MRI is typically used to capture the subject's anatomy while optical
systems are used to capture and analyse the relative movement between
adjacent bones of the joint. Reflective markers are attached to the
subject's skin and their trajectories are tracked and processed.
However, the skin surface deforms while in motion due to muscle
contraction leading to significant errors in the estimation of
trajectories. In order to reduce these errors, we use MR images to
capture both the anatomy and the trajectories of the bone. Prior to the
scanning, we attach skin markers to the subject in order to analyse the
markers displacements relative to the bone. We reconstruct the
anatomical models of the subject and we compute the markers
trajectories from the images. Using these calculated trajectories, we
select the best markers configuration based on the criteria of markers
displacements. The optimized configuration is used for recording
external movements with the optical motion capture system. The
resulting animation is mapped onto the virtual body of the subject
including internal bones and the joint motion is visualized. Copyright
(C) 2004 John Wiley Sons, Ltd.
|
1094. | Duan, Y, and Qin, H, "A subdivision-based deformable model for surface reconstruction of unknown topology," GRAPHICAL MODELS, vol. 66, pp. 181-202, 2004.
Abstract:
This paper presents a surface reconstruction algorithm that can recover
correct shape geometry as well as its unknown topology from both
volumetric images and unorganized point clouds. The algorithm starts
from a simple seed model (of genus zero) that can be arbitrarily
initiated within any datasets. The deformable behavior of the model is
governed by a locally defined objective function associated with each
vertex of the model. Through the numerical computation of function
optimization, the algorithm can adaptively subdivide the model
geometry, automatically detect self-collision of the model, properly
modify its topology (because of the occurrence of self-collision),
continuously evolve the model towards the object boundary, and reduce
fitting error and improve fitting quality via global refinement.
Commonly used mesh optimization techniques are employed throughout the
geometric deformation and topological variation to ensure the model
both locally smooth and globally well defined. Our experiments have
demonstrated that the new modeling algorithm is valuable for
iso-surface extraction in visualization, shape recovery and
segmentation in medical imaging, and surface reconstruction in reverse
engineering. Published by Elsevier Inc.
|
1095. | Petrovic, A, Escoda, OD, and Vandergheynst, P, "Multiresolution segmentation of natural images: From linear to nonlinear scale-space representations," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 13, pp. 1104-1114, 2004.
Abstract:
In this paper, we introduce a framework that merges classical ideas
borrowed from scale-space and multiresolution segmentation with
nonlinear partial differential equations. A nonlinear scale-space stack
is constructed by means of an appropriate diffusion equation. This
stack is analyzed and a tree of coherent segments is constructed based
on relationships between different scale layers. Pruning this tree
proves to be a very efficient tool for unsupervised segmentation of
different classes of images (e.g., natural, medical, etc.). This
technique is light on the computational point of view and can be
extended to nonscalar data in a straightforward manner.
|
1096. | Tzouveli, P, Andreou, G, Tsechpenakis, G, Avrithis, Y, and Kollias, S, "Intelligent visual descriptor extraction from video sequences," ADAPTIVE MULTIMEDIA RETRIEVAL, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3094, pp. 132-146, 2004.
Abstract:
Extraction of visual descriptors is a crucial problem for
state-of-the-art visual information analysis. In this paper, we present
a knowledge-based approach for detection of visual objects in video
sequences, extraction of visual descriptors and matching with
pre-defined objects. The proposed approach models objects through their
visual descriptors defined in MPEG7. It first extracts moving regions
using an efficient active contours technique. It then computes visual
descriptions of the moving regions including color, motion and shape
features that are invariant to affine transformations. The extracted
features axe matched to a-priori knowledge about the objects'
descriptions, using appropriately defined matching functions. Results
are presented which illustrate the theoretical developments.
|
1097. | Hanek, R, and Beetz, M, "The contracting curve density algorithm: Fitting parametric curve models to images using local self-adapting separation criteria," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 59, pp. 233-258, 2004.
Abstract:
The task of fitting parametric curve models to the boundaries of
perceptually meaningful image regions is a key problem in computer
vision with numerous applications, such as image segmentation, pose
estimation, object tracking, and 3-D reconstruction. In this article,
we propose the Contracting Curve Density (CCD) algorithm as a solution
to the curve-fitting problem.
The CCD algorithm extends the state-of-the-art in two important ways.
First, it applies a novel likelihood function for the assessment of a
fit between the curve model and the image data. This likelihood
function can cope with highly inhomogeneous image regions, because it
is formulated in terms of local image statistics. The local image
statistics are learned on the fly from the vicinity of the expected
curve. They provide therefore locally adapted criteria for separating
the adjacent image regions. These local criteria replace often used
predefined fixed criteria that rely on homogeneous image regions or
specific edge properties. The second contribution is the use of blurred
curve models as efficient means for iteratively optimizing the
posterior density over possible model parameters. These blurred curve
models enable the algorithm to trade-off two conflicting objectives,
namely heaving a large area of convergence and achieving high accuracy.
We apply the CCD algorithm to several challenging image segmentation
and 3-D pose estimation problems. Our experiments with RGB images show
that the CCD algorithm achieves a high level of robustness and
sub-pixel accuracy even in the presence of severe texture, shading,
clutter, partial occlusion, and strong changes of illumination.
|
1098. | Niethammer, M, Betelu, S, Sapiro, G, Tannenbaum, A, and Giblin, PJ, "Area-based medial axis of planar curves," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 60, pp. 203-224, 2004.
Abstract:
A new definition of affine invariant medial axis of planar closed
curves is introduced. A point belongs to the affine medial axis if and
only if it is equidistant from at least two points of the curve, with
the distance being a minimum and given by the areas between the curve
and its corresponding chords. The medial axis is robust, eliminating
the need for curve denoising. In a dynamical interpretation of this
affine medial axis, the medial axis points are the affine shock
positions of the affine erosion of the curve. We propose a simple
method to compute the medial axis and give examples. We also
demonstrate how to use this method to detect affine skew symmetry in
real images.
|
1099. | Santos, BS, Ferreira, C, Silva, JS, Silva, A, and Teixeira, L, "Quantitative evaluation of a pulmonary contour segmentation algorithm in x-ray computed tomography images," ACADEMIC RADIOLOGY, vol. 11, pp. 868-878, 2004.
Abstract:
Rationale and Objectives. Pulmonary contour extraction from thoracic
x-ray computed tomography images is a mandatory preprocessing step in
many automated or semiautomated analysis tasks. This study was
conducted to quantitatively assess the performance of a method for
pulmonary contour extraction and region identification.
Materials and Methods. The automatically extracted contours were
statistically compared with manually drawn pulmonary contours detected
by six radiologists on a set of 30 images. Exploratory data analysis,
nonparametric statistical tests, and multivariate analysis were used,
on the data obtained using several figures of merit, to perform a study
of the interobserver variability among the six radiologists and the
contour extraction method. The intraobserver variability of two human
observers was also studied.
Results. In addition to a strong consistency among all of the quality
indexes used, a wider interobserver variability was found among the
radiologists than the variability of the contour extraction method when
compared with each radiologist. The extraction method exhibits a
similar behavior (as a pulmonary contour detector), to the six
radiologists, for the used image set.
Conclusion. As an overall result of the application of this evaluation
methodology, the consistency and accuracy of the contour extraction
method was confirmed to be adequate for most of the quantitative
requirements of radiologists. This evaluation methodology could be
applied to other scenarios.
|
1100. | Tsechpenakis, G, Rapantzikos, K, Tsapatsoulis, N, and Kollias, S, "Rule-driven object tracking in clutter and partial occlusion with model-based snakes," EURASIP JOURNAL ON APPLIED SIGNAL PROCESSING, vol. 2004, pp. 841-860, 2004.
Abstract:
In the last few years it has been made clear to the research community
that further improvements in classic approaches for solving low-level
computer vision and image/video understanding tasks are difficult to
obtain. New approaches started evolving, employing knowledge-based
processing, though transforming a priori knowledge to low-level models
and rules are far from being straightforward. In this paper, we examine
one of the most popular active contour models, snakes, and propose a
snake model, modifying terms and introducing a model-based one that
eliminates basic problems through the usage of prior shape knowledge in
the model. A probabilistic rule-driven utilization of the proposed
model follows, being able to handle (or cope with) objects of different
shapes, contour complexities and motions; different environments,
indoor and outdoor; cluttered sequences; and cases where background is
complex (not smooth) and when moving objects get partially occluded.
The proposed method has been tested in a variety of sequences and the
experimental results verify its efficiency.,
|
1101. | Jacob, M, Blu, T, and Unser, M, "Efficient energies and algorithms for parametric snakes," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 13, pp. 1231-1244, 2004.
Abstract:
Parametric active contour models are one of the preferred approaches
for image segmentation because of their computational efficiency and
simplicity. However, they have a few drawbacks which limit their
performance. In this paper, we identify some of these problems and
propose efficient solutions to get around them. The widely-used
gradient magnitude-based energy is parameter dependent; its use will
negatively affect the parametrization of the curve and, consequently,
its stiffness. Hence, we introduce a new edge-based energy that is
independent of the parameterization. It is also more robust since it
takes into account the gradient direction as well. We express this
energy term as a surface integral, thus unifying it naturally with the
region-based schemes. The unified framework enables the user to tune
the image energy to the application at hand. We show that parametric
snakes can guarantee low curvature curves, but only if they are
described in the curvilinear abscissa. Since normal curve evolution do
not ensure constant arc-length, we propose a new internal energy term
that will force this configuration. The curve evolution can sometimes
give rise to closed loops in the contour, which will adversely
interfere with the optimization algorithm. We propose a curve evolution
scheme that prevents this condition.
|
1102. | Naftel, AJ, and Trenouth, MJ, "Stereo-assisted landmark detection for the analysis of changes in 3-D facial shape," MEDICAL INFORMATICS AND THE INTERNET IN MEDICINE, vol. 29, pp. 137-155, 2004.
Abstract:
In this paper, a semi-automated approach to 3-D landmark digitization
of the face is described which uses a combination of active shape
model-driven feature detection and stereophotogrammetric analysis. The
study aims to assess whether the proposed method is capable of
detecting statistically significant changes in facial soft tissue shape
due to mandibular repositioning in a cross-sectional patient sample. A
hybrid stereophotogrammetric and structured-light imaging system is
used for acquiring 3-D face models in the first instance. A
landmark-based statistical analysis of facial shape change is then
carried out using procrustes registration, principal component analysis
and thin plate spline warping on the 2-D facial midline profiles and
automatically digitized 3-D landmarks. The proposed method is validated
both statistically and visually by characterizing shape changes induced
by mandibular repositioning in a heterogeneous cross-sample of 20
orthodontic patients. It is shown that the method is capable of
distinguishing between changes in facial morphology due to simulated
surgical correction and changes due to other factors such as growth and
normal variation within the patient sample. The study shows that the
proposed method may be useful for auditing outcomes of clinical
treatment or surgical intervention which result in changes to facial
soft tissue morphology.
|
1103. | Feng, J, Ip, HHS, Cheng, SH, and Chan, PK, "A relational-tubular (ReTu) deformable model for vasculature quantification of zebrafish embryo from microangiography image series," COMPUTERIZED MEDICAL IMAGING AND GRAPHICS, vol. 28, pp. 333-344, 2004.
Abstract:
Embryonic cardiovascular system plays a vital role in embryonic
development of human and animal. In this work, we introduce a novel
deformable model, which we called Relational-tubular (ReTu) deformable
model for segmenting and quantifying the embryonic vasculature of
zebrafish embryo from microangiography image series. Particularly, to
incorporate additional constraints on the spatial relationships among
vessel branches, we introduce a new energy term called relation energy
into the model energy function. This energy item acts as a repulsion
force between neighboring vessels during the deformation to encourage
them to move towards their respective volume data. Using the ReTu
deformable model, the deformation process is an iterative two-stage
procedure: vascular axis deformation and vascular surface deformation.
The efficiency and robustness of this approach are demonstrated by
experiments which show that satisfactory quantifications of the
vasculature can be obtained after 3-4 iterations. (C) 2004 Elsevier
Ltd. All rights reserved.
|
1104. | Iglesias, I, Tahoces, PG, Souto, M, de Alegria, AM, Lado, MJ, and Vidal, JJ, "Lung segmentation on postero-anterior digital chest radiographs using active contours," STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3138, pp. 538-546, 2004.
Abstract:
A computerized pulmonary segmentation based on the detection of
oriented edges was performed in postero-anterior (PA) digital
radiography (DR) images. To further improve detection of lung contours,
a method based on the use of active contours models was developed.
First, the technique calculates a set of reference lines to determine
the relative position of the lungs in the image. Then, vertical and
horizontal rectangular regions of interest (ROIs) are studied to
identify the preliminary edge. These points are an approximation to the
lung edges that are adjusted using the active contours models. We
studied the influence of the different parameters of the active
contours on the final result over 30 DR images. Results prove that the
active contour models, with selected parameters, can be used to improve
the results of a given segmentation scheme.
|
1105. | Chuang, CH, and Lie, WN, "A downstream algorithm based on extended gradient vector flow field for object segmentation," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 13, pp. 1379-1392, 2004.
Abstract:
For object segmentation, traditional snake algorithms often require
human interaction; region growing methods are considerably dependent on
the selected homogeneity criterion and initial seeds; watershed
algorithms, however, have the drawback of over segmentation. A new
downstream algorithm based on a proposed extended gradient vector How
(E-GVF) field model is presented in this paper for multiobject
segmentation. The proposed flow field, on one hand, diffuses and
propagates gradients near object boundaries to provide an effective
guiding force and, on the other hand, presents a higher resolution of
direction than traditional GVF field. The downstream process starts
with a set of seeds scored and selected by considering local gradient
direction information around each pixel. This step is automatic and
requires no human interaction, making our algorithm more suitable for
practical applications. Experiments show that our algorithm is noise
resistant and has the advantage of segmenting objects that are
separated from the background, while ignoring the internal structures
of them. We have tested the proposed algorithm with several realistic
images (e.g., medical and complex background images) and gained good
results.
|
1106. | Ecabert, O, and Thiran, JP, "Adaptive Hough transform for the detection of natural shapes under weak affine transformations," PATTERN RECOGNITION LETTERS, vol. 25, pp. 1411-1419, 2004.
Abstract:
This paper introduces a two-steps adaptive generalized Hough transform
(GHT) for the detection of non-analytic objects undergoing weak affine
transformations in images. The first step of our algorithm coarsely
locates the region of interest with a GHT for similitudes. The returned
detection is then used by an adaptive GHT for affine transformations.
The adaptive strategy makes the computation more amenable and ensures
high accuracy, while keeping the size of the accumulator array small.
To account for the deformable nature of natural objects, local shape
variability is incorporated into the algorithm in both the detection
and reconstruction steps. Finally, experiments are performed on real
medical data showing that both accuracy and reasonable computation
times can be reached. (C) 2004 Elsevier B.V. All rights reserved.
|
1107. | Li, SY, Zhu, LT, and Jiang, TZ, "Active shape model segmentation using local edge structures and AdaBoost," MEDICAL IMAGING AND AUGMENTED REALITY, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3150, pp. 121-128, 2004.
Abstract:
The paper describes a machine learning approach for improving active
shape model segmentation, which can achieve high detection rates.
Rather than represent the image structure using intensity gradients, we
extract local edge features for each landmark using steerable filters.
A machine learning algorithm based on AdaBoost selects a small number
of critical features from a large set and yields extremely efficient
classifiers. These non-linear classifiers are used, instead of the
linear Mahalanobis distance, to find optimal displacements by searching
along the direction perpendicular to each landmark. These features give
more accurate and reliable matching between model and new images than
modeling image intensity alone. Experimental results demonstrated the
ability of this improved method to accurately locate edge features.
|
1108. | Heger, T, and Pandit, M, "Optical wear assessment system for grinding tools," JOURNAL OF ELECTRONIC IMAGING, vol. 13, pp. 450-461, 2004.
Abstract:
The inspection and monitoring of the wear of grinding tools is
essential to ensure the quality of the grinding tool surface and the
finished product Most of the current methods for examining a grinding
tool surface rely on dismounting the grinding tool. Often, the state of
the grinding tool surface is checked indirectly by evaluating the
quality of the workpiece. We describe the application of image
processing, which offers an effective means for in situ inspection and
monitoring. It yields more detailed information about the surface and
the kind of wear observed than the common methods. By using
multidirectional illumination and image fusion, an image with a high
degree of relevant information is generated that is then segmented
using the wavelet transform (multiscale analysis) and classified to
distinguish grains and cavities on the surface. Results of the
application of the algorithms for a high-performance grinding tool with
CBN grains embedded in a resin base are presented. (C) 2004 SPIE and
IST.
|
1109. | Xu, WB, Amin, SA, Haas, OCL, Burnham, KJ, and Mills, JA, "Snake-aided automatic organ delineation," PATTERN RECOGNITION, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3175, pp. 504-511, 2004.
Abstract:
This paper presents a knowledge-based image segmentation tool for organ
delineation in CT (Computed Tomography) images. The noise and low
contrast make the detection difficult. Therefore in this method, radial
search, noise reduction method and post-processing algorithm have been
implemented to improve the quality of contour detection. Three edge
detection algorithms have been used and after detection several
optimization methods have been employed to get the accurate contour
from three detected contours. Finally to achieve higher accuracy of
detection, active contour model (ACM), snake, has been used after the
contour detected by previous methods.
|
1110. | Les, Z, and Les, M, "Shape-understanding system: A system of experts," INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, vol. 19, pp. 949-978, 2004.
Abstract:
A shape-understanding system (SUS) that is able to perform different
tasks of shape analysis and recognition, based on the ability of the
system to understand different concepts of shape at the different
levels of cognition, is proposed. This system is an implementation of a
shape-understanding method. The proposed method of shape understanding
is based on the concept of possible classes of shapes. Possible classes
of shape are based on shape models and are viewed as a hierarchical
structure at different levels of description. At each level of
description the different aspects of shape such as geometrical
properties of shape, perceptual properties of figure, or meaningful
properties of visual form are incorporated in the shape model. The
shape-understanding system consists of different types of experts that
perform different processing and reasoning tasks. (C) 2004 Wiley
Periodicals, Inc.
|
1111. | Pan, CH, Yan, HP, and Ma, SD, "Parametric tracking of legs by exploiting intelligent edge," JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, vol. 19, pp. 674-683, 2004.
Abstract:
In this paper the idea of Intelligent Scissors is adopted for contour
tracking in dynamic image sequence. Tracking contour of human can
therefore be converted to tracking seed points in images by making use
of the properties of the optimal path (Intelligent Edge). The main
advantage of the approach is that it can handle correctly occlusions
that occur frequently when human is moving. Non-Uniform Rational
B-Spline (NURBS) is used to represent parametrically the contour that
one wants to track. In order to track robustly the contour in images,
similarity and compatibility measurements of the edge are computed as
the weighting functions of optimal estimator. To reduce dramatically
the computational load, an efficient method for extracting the region
interested is proposed. Experiments show that the approach works
robustly for sequences with frequent occlusions.
|
1112. | Pichon, E, Tannenbaum, A, and Kikinis, R, "A statistically based flow for image segmentation," MEDICAL IMAGE ANALYSIS, vol. 8, pp. 267-274, 2004.
Abstract:
In this paper we present a new algorithm for 3D medical image
segmentation. The algorithm is versatile, fast, relatively simple to
implement, and semi-automatic. It is based on minimizing a global
energy defined from a learned non-parametric estimation of the
statistics of the region to be segmented. Implementation details are
discussed and source code is freely available as part of the 3D Slicer
project. In addition, a new unified set of validation metrics is
proposed. Results on artificial and real MRI images show that the
algorithm performs well on large brain structures both in terms of
accuracy and robustness to noise. (C) 2004 Elsevier B.V. All rights
reserved.
|
1113. | Kaus, MR, von Berg, J, Weese, R, Niessen, W, and Pekar, V, "Automated segmentation of the left ventricle in cardiac MRI," MEDICAL IMAGE ANALYSIS, vol. 8, pp. 245-254, 2004.
Abstract:
We present a fully automated deformable model technique for myocardium
segmentation in 3D MRI. Loss of signal due to blood flow, partial
volume effects and significant variation of surface grey value
appearance make this a difficult problem. We integrate various sources
of prior knowledge learned from annotated image data into a deformable
model. Inter-individual shape variation is represented by a statistical
point distribution model, and the spatial relationship of the epi- and
endocardium is modeled by adapting two coupled triangular surface
meshes. To robustly accommodate variation of grey value appearance
around the myocardiac surface, a prior parametric spatially varying
feature model is established by classification of grey value surface
profiles. Quantitative validation of 121 3D MRI datasets in
end-diastolic (end-systolic) phase demonstrates accuracy and
robustness, with 2.45 mm (2.84 mm) mean deviation from manual
segmentation. (C) 2004 Elsevier B.V. All rights reserved.
|
1114. | Weruaga, L, Verdu, R, and Morales, J, "Frequency domain formulation of active parametric deformable models," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 26, pp. 1568-1578, 2004.
Abstract:
Active deformable models are simple tools, very popular in computer
vision and computer graphics, for solving ill-posed problems or mimic
real physical systems. The classical formulation is given in the
spatial domain, the motor of the procedure is a second-order linear
system, and rigidity and elasticity are the basic parameters for its
characterization. This paper proposes a novel formulation based on a
frequency-domain analysis: The internal energy functional and the
Lagrange minimization are performed entirely in the frequency domain,
which leads to a simple formulation and design. The frequency-based
implementation offers important computational savings in comparison to
the original one, a feature that is improved by the efficient hardware
and software computation of the FFT algorithm. This new formulation
focuses on the stiffness spectrum, allowing the possibility of
constructing deformable models apart from the elasticity and
rigidity-based original formulation. Simulation examples validate the
theoretical results.
|
1115. | Pekar, V, McNutt, TR, and Kaus, MR, "Automated model-based organ delineation for radiotherapy planning in prostatic region," INTERNATIONAL JOURNAL OF RADIATION ONCOLOGY BIOLOGY PHYSICS, vol. 60, pp. 973-980, 2004.
Abstract:
Purpose: Organ delineation is one of the most tedious and
time-consuming parts of radiotherapy planning. It is usually performed
by manual contouring in two-dimensional slices using simple drawing
tools, and it may take several hours to delineate all structures of
interest in a three-dimensional (3D) data set used for planning. In
this paper, a 3D model-based approach to automated organ delineation is
introduced that allows for a significant reduction of the time required
for contouring.
Methods and Materials: The presented method is based on an adaptation
of 3D deformable surface models to the boundaries of the anatomic
structures of interest. The adaptation is based on a tradeoff between
deformations of the model induced by its attraction to certain image
features and the shape integrity of the model. To make the concept
clinically feasible, interactive tools are introduced that allow quick
correction in problematic areas in which the automated model adaptation
may fail. A feasibility study with 40 clinical data sets was done for
the nude pelvic area, in which the risk organs (bladder, rectum, and
femoral heads) were segmented by automatically adapting the
corresponding organ models.
Results: In several cases of the validation study, minor user
interaction was required. Nevertheless, a statistically significant
reduction in the time required compared with manual organ contouring
was achieved. The results of the validation study showed that the
presented model-based approach is accurate (1.0-1.7 mm mean error) for
the tested anatomic structures.
Conclusion: A framework for organ delineation in radiotherapy planning
is presented, including automated 3D model-based segmentation, as well
as tools for interactive corrections. We demonstrated that the proposed
approach is significantly more efficient than manual contouring in
two-dimensional slices. (C) 2004 Elsevier Inc.
|
1116. | Drost, RJ, and Singer, AC, "Factor graph methods for three-dimensional shape reconstruction as applied to LIDAR imaging," JOURNAL OF THE OPTICAL SOCIETY OF AMERICA A-OPTICS IMAGE SCIENCE AND VISION, vol. 21, pp. 1855-1868, 2004.
Abstract:
Two methods based on factor graphs for reconstructing the
three-dimensional (3D) shape of an object from a series of
two-dimensional images are presented. First, a factor graph model is
developed for image segmentation to obtain silhouettes from raw images;
the shape-from-silhouette technique is then applied to yield the 3D
reconstruction of the object. The second method presented is a direct
3D reconstruction of the object using a factor graph model for the
voxels of the reconstruction. While both methods should be applicable
to a variety of input data types, they will be developed and
demonstrated for a particular application involving the LIDAR imaging
of a submerged target. Results from simulations and from real LIDAR
data are shown that detail the performance of the methods. (C) 2004
Optical Society of America.
|
1117. | Chin, CL, Wehrli, FW, Fan, YL, Hwang, SN, Schwartz, ED, Nissanov, J, and Hackney, DB, "Assessment of axonal fiber tract architecture in excised rat spinal cord by localized NMR q-space imaging: Simulations and experimental studies," MAGNETIC RESONANCE IN MEDICINE, vol. 52, pp. 733-740, 2004.
Abstract:
NMR q-space imaging is a method designed to obtain information from
porous materials where diffusion-diffraction phenomena were observed
from which pore size was derived. Recently, the technique has been
applied to the study of biological structures as well. Although
diffusive diffraction has so far not been observed in multicellular
systems, displacement profiles have been used with some success as a
means to estimate structure size. However, there have been no
quantitative correlations of the retrieved structure sizes with
histology. Clearly, the complexity of tissue architecture poses
significant challenges to the interpretation of q-space data. In this
work, simulations were first performed on a two-compartment model to
demonstrate the effects of interference of the diffraction patterns
arising from intra and extra-axonal compartments and finite boundary
permeability on q-space data. Second, q-space echo attenuation was
simulated on the basis of histologic images of various rat spinal cord
fiber tracts and the information obtained from the displacement
profiles were compared with structural parameters computed from the
histologic images. The results show that calculated mean displacements
and kurtosis parallel mean axon size and axonal density. Finally,
spatially localized q-space measurements were carried out at the
locations where simulations had previously been performed, resulting in
displacement data that support those obtained by simulation. The data
suggest the NMR q-space approach has potential for non-destructive
analysis of the axonal architecture in the mammalian spinal cord. (C)
2004 Wiley-Liss, Inc.
|
1118. | Bentabet, L, and Ziou, D, "Neuroanatomy registration: An algebraic-topology based approach," ARTICULATED MOTION AND DEFORMABLE OBJECTS, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3179, pp. 76-85, 2004.
Abstract:
In this paper, a method for image deformation is presented. It is based
upon decomposition of the deformation problem into basic physical laws.
Unlike other methods that solve a differential or an energetic
formulation of the physical laws involved, we encode the basic laws
using computational algebraic topology. Conservative laws are
translated into exact global values and constitutive laws are
judiciously approximated. In order to illustrate the effectiveness of
our model, we utilize the viscous fluid model to achieve neuroanatomy
image registration
|
1119. | Husby, O, and Rue, H, "Estimating blood vessel areas in ultrasound images using a deformable template model," STATISTICAL MODELLING, vol. 4, pp. 211-226, 2004.
Abstract:
We consider the problem of obtaining interval estimates of vessel areas
from ultrasound images of cross sections through the carotid artery.
Robust and automatic estimates of the cross sectional area is of
medical interest and of help in diagnosing atherosclerosis, which is
caused by plaque deposits in the carotid artery. We approach this
problem by using a deformable template to model the blood vessel
outline, and use recent developments in ultrasound science to model the
likelihood. We demonstrate that by using an explicit model for the
outline, we can easily adjust for an important feature in the data:
strong edge reflections called specular reflection. The posterior is
challenging to explore, and naive standard MCMC algorithms simply
converge too slowly. To obtain an efficient MCMC algorithm we make
extensive use of computational efficient Gaussian Markov random fields,
and use various block sampling constructions that jointly update large
parts of the model.
|
1120. | Soussen, C, and Mohammad-Djafari, A, "Polygonal and polyhedral contour reconstruction in computed tomography," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 13, pp. 1507-1523, 2004.
Abstract:
This paper is about three-dimensional (3-D) reconstruction of a binary
image from its X-ray tomographic data. We study the special case of a
compact uniform polyhedron totally included in a uniform background and
directly perform the polyhedral surface estimation. We formulate this
problem as a nonlinear inverse problem using the Bayesian framework.
Vertice estimation is done without using a voxel approximation of the
3-D image. It is based on the construction and optimization of a
regularized criterion that accounts for surface smoothness. We
investigate original deterministic local algorithms, based on the exact
computation of the line projections, their update, and their
derivatives with respect to the vertice coordinates. Results are first
derived in the two-dimensional (2-D) case, which consists of
reconstructing a 2-D object of deformable polygonal contour from its
tomographic data. Then, we investigate the 3-D extension that requires
technical adaptations. Simulation results illustrate the performance of
polygonal and polyhedral reconstruction algorithms in terms of quality
and computation time.
|
1121. | Gonzalez-Velasco, HM, Garcia-Orellana, CJ, Macias-Macias, M, Lopez-Aligue, FJ, and Acevedo-Sotoca, MI, "Neural-networks-based edges selector for boundary extraction problems," IMAGE AND VISION COMPUTING, vol. 22, pp. 1129-1135, 2004.
Abstract:
In the present work, a neural-networks-based system is presented that
makes it possible to reduce, when generating edge maps to be used in an
object boundary detection problem, the number of edges that are not due
to the object itself, but to the background. Starting from a
conventional edge detection, the selection is carried out by a
neural-networks-based classifier, which is trained using examples. As a
test for the system, the application to bovine livestock images (from
which we want to extract the boundary of the animal) is presented. (C)
2004 Elsevier B.V. All rights reserved.
|
1122. | Herzog, A, Boyer, KL, and Roberts, C, "Robust extraction of the optic nerve head in optical coherence tomography," COMPUTER VISION AND MATHEMATICAL METHODS IN MEDICAL AND BIOMEDICAL IMAGE ANALYSIS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3117, pp. 395-407, 2004.
Abstract:
Glaucoma is a leading cause of blindness. While glaucoma is a treatable
and controllable disease, there is still no cure available. Early
diagnosis is important in order to prevent severe vision loss. Many
current diagnostic techniques are subjective and variable. This
provides motivation for a more objective and repeatable method. Optical
Coherence Tomography (OCT) is a relatively new imaging technique that
is proving useful in diagnosing, monitoring, and studying glaucoma.
OCT, like ultrasound, suffers from signal dependent noise which can
make accurate, automatic segmentation of images difficult. In this
article we propose a method to automatically extract the optic nerve
and retinal boundaries from axial OCT scans through the optic nerve
head. We also propose a method to automatically segment the curve to
extract the nerve head profile that is important in diagnosing and
monitoring glaucoma.
|
1123. | Ardon, R, and Cohen, LD, "Efficient initialization for constrained active surfaces, applications in 3D medical images," COMPUTER VISION AND MATHEMATICAL METHODS IN MEDICAL AND BIOMEDICAL IMAGE ANALYSIS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3117, pp. 205-217, 2004.
Abstract:
A novel method allowing simplified and efficient active surface
initialization for 3D images segmentation is presented. Our method
allows to initialize an active surface through simple objects like
points and curves and ensures that the further evolution of the active
object will not be trapped by unwanted local minima. Our approach is
based on minimal paths that integrate the information coming from the
user given curves and from the image volume. The minimal paths build a
network representing a first approximation of the initialization
surface. An interpolation method is then used to build a mesh or an
implicit representation based on the information retrieved from the
network of paths. From this initialization, an active surface converges
quickly to the expected solution. Our paper describes a fast
construction obtained by exploiting the Fast Marching algorithm. The
algorithm has been successfully applied to synthetic images and 3D
medical images.
|
1124. | Giachetti, A, and Zanetti, G, "AQUATICS reconstruction software: The design of a diagnostic tool based on computer vision algorithms," COMPUTER VISION AND MATHEMATICAL METHODS IN MEDICAL AND BIOMEDICAL IMAGE ANALYSIS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3117, pp. 48-63, 2004.
Abstract:
Computer vision methods can be applied to a variety of medical and
surgical applications, and many techniques and algorithms are available
that can be used to recover 3D shapes and information from images range
and volume data. Complex practical applications, however, are rarely
approachable with a single technique, and require detailed analysis on
how they can be subdivided in subtasks that are computationally
treatable and that, at the same time, allow for the appropriate level
of user-interaction. In this paper we show an example of a complex
application where, following criteria of efficiency, reliability and
user friendliness, several computer vision techniques have been
selected and customized to build a system able to support diagnosis and
endovascular treatment of Abdominal Aortic Aneurysms. The system
reconstructs the geometrical representation of four different
structures related to the aorta (vessel lumen, thrombus, calcifications
and skeleton) from CT angiography data. In this way it supports the
three dimensional measurements required for a careful geometrical
evaluation of the vessel, that is fundamental to decide if the
treatment is necessary and to perform, in this case, its planning. The
system has been realized within the European trial AQUATICS
(IST-1999-20226 EUTIST-M WP 12), and it has been widely tested on
clinical data.
|
1125. | Lefevre, S, and Vincent, N, "Real time multiple object tracking based on active contours," IMAGE ANALYSIS AND RECOGNITION, PT 2, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3212, pp. 606-613, 2004.
Abstract:
In this paper our purpose is to present some solutions to multiple
object tracking in an image sequence with a real time constraint and a
possible mobile camera. We propose to use active contours (or snakes)
modelling. Classical active contours fail to track several objects at
once, so occlusion problems are difficult to solve. The model proposed
here enables some topology change for the objects concerned. Indeed a
merging and a splitting phases are respectively performed when two
objects become close together or move apart. Moreover, these topology
changes help the tracking method to increase its robustness to noise
characterized by high gradient values. In the process we have
elaborated, no preprocessing nor motion estimation (which are both time
consuming tasks) is required. The tracking is performed in two steps
that are active contour initialisation and deformation. The process
supports non-rigid objects in colour video sequences from a mobile
camera. In order to take advantage of compressed formats and to speed
up the process when possible, a multiresolution framework is proposed,
working in the lowest-resolution frame, with respect to a quality
criterion to ensure a satisfying quality of the results. The proposed
method has been validated in the context of real time tracking of
players in soccer game TV broadcasts. Player positions obtained can
then be used in a real time analysis tool of soccer video sequences.
|
1126. | Caderno, IG, Penedo, MG, Marino, C, Carreira, MJ, Gomez-Ulla, F, and Gonzalez, F, "Automatic extraction of the retina AV index," IMAGE ANALYSIS AND RECOGNITION, PT 2, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3212, pp. 132-140, 2004.
Abstract:
In this paper we describe a new method to approach the diameter of
veins and arteries in the retina vascular tree, focusing not only on
precision and reliability, but also on suitability for on-line
assistance. The performed system may analyze the region of interest
selected in the image to estimate the retinal arteriovenous index. This
analysis involves two different steps: the blood vessels detection,
which extracts the vascular structures present in the image, and the
blood vessel measurement, which estimates the caliber of the already
located vessels. The method may locate 90% of the structures, giving a
reliability of 99% in detection and 95% in measurement.
|
1127. | Silva, JS, Santos, BS, Silva, A, and Madeira, J, "A level-set based volumetric CT segmentation technique: A case study with pulmonary air bubbles," IMAGE ANALYSIS AND RECOGNITION, PT 2, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3212, pp. 68-75, 2004.
Abstract:
The identification of pulmonary air bubbles plays a significant role
for medical diagnosis of pulmonary pathologies. A method to segment
these abnormal pulmonary regions on volumetric data, using a model
deforming towards the objects of interest, is presented. We propose a
variant to the well known level-set method that keeps the level-set
function moving along desired directions, with an improved stopping
function that proved to be successful, even for large time steps. A
region seeking approach is used instead of the traditional edge
seeking. Our method is stable, robust, and automatically handles
changes in surface topology during the deformation. Experimental
results, for 2D and 3D high resolution computed tomography images,
demonstrate its performance.
|
1128. | Bueno, G, Martinez-Albala, A, and Adan, A, "Fuzzy-snake segmentation of anatomical structures applied to CT images," IMAGE ANALYSIS AND RECOGNITION, PT 2, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3212, pp. 33-42, 2004.
Abstract:
This paper presents a generic strategy to facilitate the segmentation
of anatomical structures in medical images. The segmentation is
performed using an adapted PDM by fuzzy c-means classification, which
also uses the fuzzy decision to evolve PDM into the final contour.
Furthermore, the fuzzy reasoning exploits a priori statistical
information from several knowledge sources based on histogram analysis
and the intensity values of the structures under consideration. The
fuzzy reasoning is also applied and compared to a geometrical active
contour model (or level set). The method has been developed to assist
clinicians and radiologists in conformal RTP. Experimental results and
their quantitative validation to assess the accuracy and efficiency are
given segmenting the bladder on CT images. To assess precision, results
are also presented in CT images with added Gaussian noise. The
fuzzy-snake is free of parameter and it is able to properly segment the
structures by using the same initial spline curve for a whole study
image-patient set.
|
1129. | Huysmans, T, Haex, B, Van Audekercke, R, Sloten, JV, and Van der Perre, G, "Three-dimensional mathematical reconstruction of the spinal shape, based on active contours," JOURNAL OF BIOMECHANICS, vol. 37, pp. 1793-1798, 2004.
Abstract:
To reduce the amount of radiographs needed for patients with a
scoliosis, a radiation-free method based on topographic images of the
back was developed. An active contour model simulating spinal stiffness
has been applied to video rasterstereographic (VRS) data. The aim of
the present study is (a) to evaluate the applicability of active
contours to improve the accuracy and the reliability of the
three-dimensional (313) spinal midline reconstruction from back surface
data and (b) to design a more robust method to detect the spinal
midline.
To evaluate the reliability and accuracy, the active contour-based
method is compared to a conventional procedure, which has been
specifically developed for scoliosis; both methods produce a 3D curve
of the spinal midline. The frontal projections and surface rotations of
these spinal midlines are compared; r.m.s. deviations of 0.9 mm between
the frontal curves and 0.4degrees between the surface rotations were
obtained. Applying the active contour-based method does therefore not
result in a substantial difference in accuracy to the conventional
procedure.
As a conclusion the active contour method is a valuable mathematical
method that can accurately reconstruct the spinal midline based on back
surface data. In addition, the method can be applied to various
postures. (C) 2004 Elsevier Ltd. All rights reserved.
|
1130. | Antani, S, Lee, DJ, Long, LR, and Thoma, GR, "Evaluation of shape similarity measurement methods for spine X-ray images," JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, vol. 15, pp. 285-302, 2004.
Abstract:
Efficient content-based image retrieval (CBIR) of biomedical images is
a challenging problem. Feature representation algorithms used in
indexing medical images on the pathology of interest have to address
conflicting goals of reducing feature dimensionality while retaining
important and often subtle biomedical features. At the Lister Hill
National Center for Biomedical Communications, an intramural R&D
division of the U.S. National Library of Medicine, we are developing
CBIR prototype for digitized images of a collection of 17,000 cervical
and lumbar spine X-rays taken as a part of the second National Health
and Nutrition Examination Survey (NHANES 11). The vertebra shape
effectively describes various pathologies identified by medical experts
as being consistently and reliably found in the image collection. A
suitable shape algorithm must represent shapes in low dimension, be
invariant to rotation, translation, and scale transforms, and retain
relevant pathology. Additionally, supported similarity algorithms must
be useful in retrieving images that are relevant to the queries posed
by the intended target community, viz. medical researchers, physicians,
etc. This paper describes an evaluation of two popular shape similarity
methods from the literature on a set of 250 vertebra boundary shapes.
The polygon approximation method achieved a performance score of 55.94%
and bettered the Fourier descriptor algorithm which had a performance
score of 46.96%. (C) 2004 Elsevier Inc. All rights reserved.
|
1131. | Taron, M, Paragios, N, and Jolly, MP, "Border detection on short axis echocardiographic views using a region based ellipse-driven framework," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2004, PT 1, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3216, pp. 443-450, 2004.
Abstract:
In this paper, we propose a robust technique that integrates spatial
and temporal information for consistent recovery of the endcocardium.
To account for the low image quality we introduce a local variant of
the Mumford-Shah that is coupled with a model of limited parameters to
describe the ventricle, namely an ellipse. The objective function is
defined on the implicit space of ellipses, separates locally the blood
pool from the heart wall and explores geometric constraints on the
deformations of the endocardium to impose temporal consistency.
Promising experimental results demonstrate the potentials of our method.
|
1132. | Qu, YG, Chen, Q, Heng, PA, and Wong, TT, "Segmentation of left ventricle via level set method based on enriched speed term," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2004, PT 1, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3216, pp. 435-442, 2004.
Abstract:
Level set methods have been widely employed in medical image
segmentation, and the construction of speed function is vital to
segmentation results. In this paper, two ideas for enriching the speed
function in level set methods are introduced, based on the problem of
segmenting left ventricle from tagged MR image. Firstly, a relaxation
factor is introduced, aimed at relaxing the boundary condition when the
boundary is unclear or blurred. Secondly, in order to combine visual
contents of an image, which reflects human visual response directly, a
simple and general model is introduced to endow speed function with
more variability and better performance. Promising experimental results
in MR images are shown to demonstrate the potentials of our approach.
|
1133. | Li, H, Elmoataz, A, Fadili, J, and Ruan, S, "Dual front evolution model and its application in medical imaging," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2004, PT 1, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3216, pp. 103-110, 2004.
Abstract:
This paper presents a curve evolution model for 3D slice-by-slice image
segmentation and its application in medical imaging. It is an iterative
process based on the dual front evolution and the morphological
dilatation to iteratively deform the initial contour towards the
segmentation result. The dual front evolution model is proposed to form
the new boundary by the contact position of two (or more) curves
evolving in opposite directions. The fast sweeping evolution scheme is
introduced for the contour evolution and the velocities for the
propagation of the different curves are defined in accordance with the
region-based characteristics. This model can achieve the global energy
minimum and solves the disadvantages of classical level set evolution
methods. Experimental results are given to illustrate the robustness of
the method and its performance in precise region boundary localization
and medical imaging.
|
1134. | Denis, K, Huysmans, T, De Wilde, T, Forausberger, C, Rapp, W, Haex, B, Sloten, JV, Van Audekercke, R, Van der Perre, G, Heitmann, KR, and Diers, H, "A 4D-optical measuring system for the dynamic acquisition of anatomical structures," MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2004, PT 2, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3217, pp. 259-266, 2004.
Abstract:
This paper presents a novel measuring system for the detection of
moving skeletal structures. The system uses white light raster line
triangulation in combination with biomechanical modeling techniques.
White light raster line triangulation visualizes surfaces (e.g. the
back surface) in an accurate and repeatable way, without detrimental
effects, and without making contact to the human body. By making use of
modeling techniques such as active contour models, active shape models
and inverse kinematic models, biomechanically relevant results such as
the position of the skeletal segments during motion are obtained.
|
1135. | Weichert, F, Wawro, M, Muller, H, and Wilke, C, "Registration of biplane angiography and intravascular ultrasound for 3D vessel reconstruction," METHODS OF INFORMATION IN MEDICINE, vol. 43, pp. 398-402, 2004.
Abstract:
If planned and applied correctly, intravascular brachytherapy (IVB) can
significantly reduce the risk of restenosis after interventional
treatment of stenotic arteries.
Objectives: In order to facilitate computer-based IVB planning, a
three-dimensional reconstruction of the stenotic artery based on
intravasculor ultrasound (IVUS) sequences is desirable.
Methods:To attain a 3D reconstruction, the frames of the IVUS sequence
are properly aligned in space and completed with additional
intermediate frames generated by interpolation. The alignment procedure
uses additional information that is obtained from biplane X-ray
angiography performed simultaneously during the capturing of the IVUS
sequence. After IVUS images and biplane angiography data are acquired
from the patient, the vessel-wall borders and the IVUS catheter are
detected by an active contour algorithm. Next, the twist between
adjacent IVUS frames is determined by a sequential triangulation method
combined with stochastic analysis.
Results. The above procedure results in a 3D volume-model of the
vessel, which also contains information from the IVUS modality. This
data is sufficient for computer-based intavascular brachytherapy
planning.
Conclusion: The proposed methodology can be used to improve the current
state-of-the-art IVB treatment planning by enabling computerized dosage
computations on a highly accurate 3D model.
|
1136. | Duch, C, and Mentel, T, "Activity affects dendritic shape and synapse elimination during steroid controlled dendritic retraction in Manduca sexta," JOURNAL OF NEUROSCIENCE, vol. 24, pp. 9826-9837, 2004.
Abstract:
Insect metamorphosis is a compelling example for dendritic and synaptic
remodeling as larval and adult behaviors place distinct demands on the
CNS. During the metamorphosis of the moth, Manduca sexta, many larval
motoneurons are remodeled to serve a new function in the adult. During
late larval life, steroid hormones trigger axonal and dendritic
regression as well as larval synapse elimination. These regressive
events are accompanied by stereotypical changes in motor behavior
during the so-called wandering stages. Both normally occurring changes
in dendritic shape and in motor output have previously been analyzed
quantitatively for the individually identified motoneuron MN5. This
study tested whether activity affected steroid-induced dendritic
regression and synapse disassembly in MN5 by means of chronically
implanted extracellular electrodes. Stimulating MN5 in vivo in intact,
normally developing animals during a developmental period when it
usually shows no activity significantly slowed the regression of
high-order dendrites. Both physiological and anatomical analysis
demonstrated that reduced dendritic regression was accompanied by a
significant reduction in larval synapse disassembly. Therefore,
steroid-induced alterations of dendritic shape and synaptic
connectivity are modified by activity-dependent mechanisms. This
interaction might be a common mechanism for rapid adjustments of rigid,
inflexible, hormonal programs.
|
1137. | Kirbas, C, and Quek, F, "A review of vessel extraction techniques and algorithms," ACM COMPUTING SURVEYS, vol. 36, pp. 81-121, 2004.
Abstract:
Vessel segmentation algorithms are the critical components of
circulatory blood vessel analysis systems. We present a survey of
vessel extraction techniques and algorithms. We put the various vessel
extraction approaches and techniques in perspective by means of a
classification of the existing research. While we have mainly targeted
the extraction of blood vessels, neurosvascular structure in
particular, we have also reviewed some of the segmentation methods for
the tubular objects that show similar characteristics to vessels. We
have divided vessel segmentation algorithms and techniques into six
main categories: (1) pattern recognition techniques, (2) model-based
approaches, (3) tracking-based approaches, (4) artificial
intelligence-based approaches, (5) neural network-based approaches, and
(6) tube-like object detection approaches. Some of these categories are
further divided into subcategories. We have also created tables to
compare the papers in each category against such criteria as
dimensionality, input type, preprocessing, user interaction, and result
type.
|
1138. | Yao, JH, Miller, M, Franaszek, M, and Summers, RM, "Colonic polyp segmentation in CT colonography-based on fuzzy clustering and deformable models," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 23, pp. 1344-1352, 2004.
Abstract:
An automatic method to segment colonic polyps in computed tomography
(CT) colonography is presented in this paper. The method is based on a
combination of knowledge-guided intensity adjustment, fuzzy c-mean
clustering, and deformable models. The computer segmentations were
compared with manual segmentations to validate the accuracy of our
method. An average 76.3% volume overlap percentage among 105 polyp
detections was reported in the validation, which was very good
considering the small polyp size. Several experiments were performed to
investigate the intraoperator and interoperator repeatability of manual
colonic polyp segmentation. The investigation demonstrated that the
computer-human repeatability was as good as the interoperator
repeatability. The polyp segmentation was also applied in
computer-aided detection (CAD) to reduce the number of false positive
(FP) detections and provide volumetric features for polyp
classification. Our segmentation method was able to eliminate 30% of FP
detections. The volumetric features computed from the segmentation can
further reduce FP detections by 50% at 80% sensitivity.
|
1139. | Matsuyama, T, Wu, X, Takai, T, and Nobuhara, S, "Real-time 3D shape reconstruction, dynamic 3D mesh deformation, and high fidelity visualization for 3D video," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 96, pp. 393-434, 2004.
Abstract:
3D video [IEEE Multimedia (1997) 18] is the ultimate image media
recording dynamic visual events in the real world as is; it records
time varying 3D object shape with high fidelity surface properties
(i.e., color and texture). Its applications cover wide varieties of
personal and social human activities: entertainment (e.g., 3D game and
3D TV), education (e.g., 3D animal picture books), sports (e.g., sport
performance analysis), medicine (e.g., 3D surgery monitoring), culture
(e.g., 3D archive of traditional dances), and so on. In this paper, we
propose: (1) a PC cluster system for real-time reconstruction of
dynamic 3D object action from multiview video images, (2) a deformable
3D mesh model for reconstructing the accurate dynamic 3D object shape,
and (3) an algorithm of rendering natural-looking texture on the 3D
object surface from the multi-view video images. Experimental results
with quantitative performance evaluations demonstrate the effectiveness
of these methods in generating high fidelity 3D video from multi-view
video images. (C) 2004 Elsevier Inc. All rights reserved.
|
1140. | Esteban, CH, and Schmitt, F, "Silhouette and stereo fusion for 3D object modeling," COMPUTER VISION AND IMAGE UNDERSTANDING, vol. 96, pp. 367-392, 2004.
Abstract:
In this paper, we present a new approach to high quality 3D object
reconstruction. Starting from a calibrated sequence of color images,
the algorithm is able to reconstruct both the 3D geometry and the
texture. The core of the method is based on a deformable model, which
defines the framework where texture and silhouette information can be
fused. This is achieved by defining two external forces based on the
images: a texture driven force and a silhouette driven force. The
texture force is computed in two steps: a multi-stereo correlation
voting approach and a gradient vector flow diffusion. Due to the high
resolution of the voting approach a multi-grid version of the gradient
vector flow has been developed. Concerning the silhouette force, a new
formulation of the silhouette constraint is derived. It provides a
robust way to integrate the silhouettes in the evolution algorithm. As
a consequence, we are able to recover the contour generators of the
model at the end of the iteration process. Finally, a texture map is
computed from the original images for the reconstructed 3D model. (C)
2004 Elsevier Inc. All rights reserved.
|
1141. | Lam, THW, and Lee, RST, "Visual tracking by using Kalman Gradient Vector Flow (KGVF) snakes," KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT 2, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3214, pp. 557-563, 2004.
Abstract:
In this paper, we propose a new tracking model called Kalman Gradient
Vector Flow (KGVF) snakes. KGVF snakes employ the Gradient Vector Flow
(GVF) model [9] with the Kalman Filter [4] for object tracking. GVF
model is an active contour model that used gradient vector flow field
as the external force. This force ensures a larger capture range in the
model and stronger ability to contract to the object boundary. Kalman
Filter is an estimation algorithm that can be used in stochastic
environment. In this paper, we explain how KGVF snakes works and also
we have done some experiments to show how KGVF snakes have a strong
tracking ability in clutter scenes.
|
1142. | Wang, YC, and Chou, JJ, "Automatic segmentation of touching rice kernels with an active contour model," TRANSACTIONS OF THE ASAE, vol. 47, pp. 1803-1811, 2004.
Abstract:
An approach was developed to segment touching rice kernels in an image.
An inverse gradient vector flow (IGVF) was first proposed to
automatically generate afield center for individual rice kernel in an
image. These centers were employed as the references for setting
initial deformable contours that were required for building an active
contour model (ACM). In addition, to describe the formation of the
initial deformable contours in detail, a complete image process for the
segmentation of touching rice kernels was also developed. The result
showed that as long as 50% of piecewise edge information remained in an
image, the algorithm could reconstruct the whole contour successfully.
Compared with the original contours, the contours generated in this
study achieved more than 96% similarity. The complete contours of
touching objects by the approach proposed in this study could
facilitate the subsequent image processing to obtain the geometric,
texture, and color characteristics of objects in an image. These
features might then be used for further clustering, classification, or
image understanding.
|
1143. | Marin-Hernandez, A, Devy, M, and Avina-Cervantes, G, "Color active contours for tracking roads in natural environments," PROGRESS IN PATTERN RECOGNITION, IMAGE ANALYSIS AND APPLICATIONS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3287, pp. 124-131, 2004.
Abstract:
Scene interpretation and feature tracking in natural environments are
very complex perceptual functions. Complexity lies on several factors,
for example: the lack of control on illumination conditions and the
presence of different textures in the environment. This paper presents
a real-time method to track roads in natural environments. The scene is
previously characterized and classified in different regions by a
combined ICA and color segmentation method (not described in this
paper). This method is not so fast to track desired features in real
time. The region tracking is executed on color active contours. New
color potential fields are proposed: a) one to attract active contours
depending on the selected region color, and b) the second one to
repulse active contours when it is inside the region. Two potential
fields are defined from the results of the initial characterization
process and are updated by the same process at a given constant
frequency, to avoid errors mainly due to global changes in illumination
conditions or to local changes on the characteristics of the selected
region. This approach has been evaluated on image sequences, acquired
in natural environments.
|
1144. | Kim, TJ, Park, SR, Kim, MG, Jeong, S, and Kim, KO, "Tracking road centerlines from high resolution remote sensing images by least squares correlation matching," PHOTOGRAMMETRIC ENGINEERING AND REMOTE SENSING, vol. 70, pp. 1417-1422, 2004.
Abstract:
This paper describes a semi-automatic algorithm for tracking road
centerlines from satellite images at 1 m resolution. We assume that
road centerlines are visible in the image and that among points on road
centerlines similarity transformation holds. Previous approaches
proposed for semi-automatic road extraction include energy minimization
and template matching with global enforcement. In this paper we will
show that least squares correlation matching alone can work for
tracking road centerlines. Our algorithm works by defining a template
around a user-given input point, which shall lie on a road centerline,
and then by matching the template against the image along the
orientation of the road under consideration. Once matching succeeds,
new match proceeds by shifting a matched target window further along
road orientation. By repeating the process above, we obtain a series of
points, which lie on a road centerline successively. An Ikonos image
over Seoul area was used for test. The algorithm could successfully
extract road centerlines once valid input points were provided from a
user. The contribution of this paper is that we proved template
matching could offer wider applicability in feature extraction, and we
designed a new template matching scheme that worked for feature
extraction without global enforcements.
|
1145. | Yu, YJ, Molloy, JA, and Acton, ST, "Segmentation of the prostate from suprapubic ultrasound images," MEDICAL PHYSICS, vol. 31, pp. 3474-3484, 2004.
Abstract:
We present a technique for semiautomated segmentation of human
prostates using suprapubic ultrasound (US) images. In this approach, a
speckle reducing anisotropic diffusion (SRAD) is applied to enhance the
images and the instantaneous coefficient of variation (ICOV) is
utilized for edge detection. Segmentation is accomplished via a
parametric active contour model in a polar coordinate system that is
tailored to the application. The algorithm initially approximates the
prostate boundary in two stages. First a primary contour is detected
using an elliptical model, followed by a primary contour optimization
using an area-weighted mean-difference binary flow geometric snake
model. The algorithm was assessed by comparing the computer-derived
contours with contours produced manually by three sonographers. The
proposed method has application in radiation therapy planning and
delivery, as well as in automated volume measurements for ultrasonic
diagnosis. The average root mean square discrepancy between computed
and manual outlines is less than the inter-observer variability.
Furthermore, 76% of the computer-outlined contour is less than 1 sigma
manual outline variance away from "true" boundary of prostate. We
conclude that the methods developed herein possess acceptable agreement
with manually contoured prostate boundaries and that they are
potentially valuable tools for radiotherapy treatment planning and
verification. (C) 2004 American Association of Physicists in Medicine.
|
1146. | Shin, JH, Hwang, SY, Kim, KM, Kang, JY, Lee, SW, and Paik, J, "Blur identification and image restoration based on evolutionary multiple object segmentation for digital auto-focusing," COMBINATORIAL IMAGE ANALYSIS, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3322, pp. 656-668, 2004.
Abstract:
This paper presents a digital auto-focusing algorithm based on
evolutionary multiple object segmentation method. Robust object
segmentation can be conducted by the evolutionary algorithm on an image
that has several differently out-of-focused objects. After segmentation
is completed, point spread functions (PSFs) are estimated at
differently out-of-focused objects and spatially adaptive image
restorations are applied according to the estimated PSFs. Experimental
results show that the proposed auto-focusing algorithm can efficiently
remove the space-variant out-of-focus blur from the image with
multiple, blurred objects.
|
1147. | Chalechale, A, Naghdy, G, and Premaratne, P, "Sketch-based shape retrieval using length and curvature of 2D digital contours," COMBINATORIAL IMAGE ANALYSIS, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3322, pp. 474-487, 2004.
Abstract:
This paper presents a novel effective method for line segment
extraction using chain code differentiation. The resulting line
segments are employed for shape feature extraction. Length distribution
of the extracted segments along with distribution of the angle between
adjacent segments are exploited to extract compact hybrid features. The
extracted features are used for sketch-based shape retrieval.
Comparative results obtained from six other well known methods within
the literature have been discussed. Using MPEG-7 contour shape database
(CE-1) as the test bed, the new proposed method shows significant
improvement in retrieval performance for sketch-based shape retrieval.
The Average Normalized Modified Retrieval Rank (ANMRR) is used as the
performance indicator. Although the retrieval performance has been
improved using the proposed method, its computational intensity and
subsequently, its feature extraction time are slightly higher than some
other methods.
|
1148. | Wang, Q, Robson, MD, Francis, JM, Petersen, SE, Channon, KM, Neubauer, S, and Wiesmann, F, "Accuracy of quantitative MR vessel wall Imaging applying a semi-automated gradient detection algorithm - A validation study," JOURNAL OF CARDIOVASCULAR MAGNETIC RESONANCE, vol. 6, pp. 895-907, 2004.
Abstract:
Magnetic resonance imaging (MRI) is uniquely suited to study the
pathophysiology of arteriosclerosis. So far, magnetic resonance (MR)
measurements of vessel dimensions have mainly been done by manual
tracing of vessel wall contours. However, such data postprocessing is
very time-consuming and has limited accuracy due to difficulties in
precise tracing of the thin vessel wall. Purpose: To assess the
accuracy and reproducibility of quantitative vascular MR imaging
applying a data analysis method based on (1) vessel wall unwrapping,
followed by (2) a gradient detection algorithm for MR data
postprocessing. Vascular MR imaging studies were done both in vessel
phantoms and in healthy volunteers (n=29) on a clinical 1.5 T MR
scanner. A dark blood double-inversion turbo spin echo sequence with
fat suppression was applied, with proton-density-weighted and
breath-hold acquisition for aortic imaging and T2-weighted acquisition
for carotid imaging. Intraobserver and interobserver variability were
systematically evaluated by two independent observers. A repeat study
within 10 days of the first MRI was performed in 10 of these subjects
for assessment of interstudy reproducibility. Results: The
semiautomated edge detection software revealed a clear view of the
inner and outer vessel wall boundaries both in the phantoms and in the
volunteers studied. There was close agreement between MR-derived
measurements and phantom dimensions (mean difference of 1.1 +/- 16.9
mm(2), 8.0 +/- 19.9 mm(2), 9.0 +/- 12.1 mm(2) for vessel wall
cross-sectional area, inner vessel area, and total vessel area,
respectively). Quantification of vessel dimensions was feasible in all
29 healthy volunteers studied. Semiautomated quantification of
cross-sectional vessel wall area (mean +/- SD, 253.6 +/- 208.4 mm(2))
revealed close correlation for repeated measurements by one or two
observers (r=0.99 each). Both intraobserver and interobserver
variability of vessel wall area MR measurements were low (mean
difference 7.5 +/- 16.7 mm(2) and 14.4 +/- 24.6 mm(2), respectively).
In the repeat study of 10 volunteers, MRI with semiautomated
postprocessing quantitation revealed a high correlation and agreement
of vessel dimensions between the two scans (r=0.994, mean difference
2.6 +/- 25.1 mm(2)). Conclusion: Semiautomated analysis methods can
provide approaches that benefit from the human understanding of the
image and the computer's ability to measure precisely and rapidly.
Thus, by combining the latest MRI methods and semiautomated image
analysis methods, we are now able to reproducibly determine the
geometric parameters of blood vessels.
|
1149. | Schmitt, S, Evers, JF, Duch, C, Scholz, M, and Obermayer, K, "New methods for the computer-assisted 3-D reconstruction of neurons from confocal image stacks," NEUROIMAGE, vol. 23, pp. 1283-1298, 2004.
Abstract:
Exact geometrical reconstructions of neuronal architecture are
indispensable for the investigation of neuronal function. Neuronal
shape is important for the wiring of networks, and dendritic
architecture strongly affects neuronal integration and firing
properties as demonstrated by modeling approaches. Confocal microscopy
allows to scan neurons with submicron resolution. However, it is still
a tedious task to reconstruct complex dendritic trees with fine
structures just above voxel resolution. We present a framework
assisting the reconstruction. User time investment is strongly reduced
by automatic methods, which fit a skeleton and a surface to the data,
while the user can interact and thus keeps full control to ensure a
high quality reconstruction. The reconstruction process composes a
successive gain of metric parameters. First, a structural description
of the neuron is built, including the topology and the exact dendritic
lengths and diameters. We use generalized cylinders with circular cross
sections. The user provides a rough initialization by marking the
branching points. The axes and radii are fitted to the data by
minimizing an energy functional, which is regularized by a smoothness
constraint. The investigation of proximity to other structures
throughout dendritic trees requires a precise surface reconstruction.
In order to achieve accuracy of 0.1 mum and below, we additionally
implemented a segmentation algorithm based on geodesic active contours
that allow for arbitrary cross sections and uses locally adapted
thresholds. In summary, this new reconstruction tool saves time and
increases quality as compared to other methods, which have previously
been applied to real neurons. (C) 2004 Elsevier Inc. All rights
reserved.
|
1150. | Kim, S, Kang, J, Shin, J, Lee, S, Paik, J, Kang, S, Abidi, B, and Abidi, MG, "Using a non-prior training active feature model," ADVANCES IN MULTIMEDIA INFORMATION PROCESSING - PCM 2004, PT 3, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3333, pp. 69-78, 2004.
Abstract:
This paper presents a feature point tracking algorithm using optical
flow under the non-prior training active feature model (NPT-AFM)
framework. The proposed algorithm mainly focuses on analysis of
deformable objects, and provides real-time, robust tracking. The
proposed object tracking procedure can be divided into two steps: (i)
optical flow-based tracking of feature points and (ii) NPT-AFM for
robust tracking. In order to handle occlusion problems in object
tracking. feature points inside an object are estimated instead of its
shape boundary of the conventional active contour model (ACM) or active
shape model (ASM), and are updated as an element of the training set
for the AFM. The proposed NPT-AFM framework enables the tracking of
occluded objects in complicated background. Experimental results show,
that the proposed NPT-AFM-based algorithm can track deformable objects
in real-time.
|
1151. | Lameyre, B, and Gouet, V, "Object tracking and identification in video streams with snakes and points," ADVANCES IN MULTIMEDIA INFORMATION PROCESSING - PCM 2004, PT 3, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3333, pp. 61-68, 2004.
Abstract:
This paper presents a generic approach for object tracking and
identification in video sequences, called SAP. The object is described
with two image primitives: first, its content is described with Points
of interest that are automatically extracted and characterized
according to an appearance-based model. Second, the object's envelope
is described with a Snake. The originality of SAP consists in a
complementary use of these primitives: the snake allows to reduce the
points extraction to a limited area, and the point description is
efficiently exploited during the snake tracking. Such a
characterization is robust to wide occlusions and can be use for object
identification and localization purposes. SAP has been implemented with
the aim of achieving near real-time performance.
|
1152. | Xiong, T, and Debrunner, C, "Stochastic car tracking with line- and color-based features," IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, vol. 5, pp. 324-328, 2004.
Abstract:
Color- and edge-based trackers can often be "distracted," causing them
to track the wrong object. Many researchers have dealt with this
problem by using multiple features, as it is unlikely that all will be
distracted at the same time. It is also important for the tracker to
maintain multiple hypotheses for the state; sequential Monte Carlo
filters have been shown to be a convenient and straightforward means of
maintaining multiple hypotheses. In this paper, we improve the accuracy
and robustness of real-time tracking by combining a color histogram
feature with an edge-gradient-based shape feature under a sequential
Monte Carlo framework.
|
1153. | Kim, DY, and Park, JW, "Computer-aided detection of kidney tumor on abdominal computed tomography scans," ACTA RADIOLOGICA, vol. 45, pp. 791-795, 2004.
Abstract:
Purpose: To implement a computer-aided detection system for kidney
segmentation and kidney tumor detection on abdominal computed
tomography (CT) scans.
Material and Methods: Abdominal CT images were digitized with a film
digitizer, and a gray-level threshold method was used to segment the
kidney. Based on texture analysis performed on sample images of kidney
tumors, a portion of the kidney tumor was selected as seed region for
start point of the region-growing process. The average and standard
deviations were used to detect the kidney tumor. Starting at the
detected seed region, the region-growing method was used to segment the
kidney tumor with intensity values used as an acceptance criterion for
a homogeneous test. This test was performed to merge the neighboring
region as kidney tumor boundary. These methods were applied on 156
transverse images of 12 cases of kidney tumors scanned using a G.E.
Hispeed CT scanner and digitized with a Lumisys LS-40 film digitizer.
Results: The computer-aided detection system resulted in a kidney tumor
detection sensitivity of 85% and no false-positive findings.
Conclusion: This computer-aided detection scheme was useful for kidney
tumor detection and gave the characteristics of detected kidney tumors.
|
1154. | Xu, JF, and Gu, LX, "Evaluation of morphological reconstruction, fast marching and a novel hybrid segmentation method," COMPUTATIONAL AND INFORMATION SCIENCE, PROCEEDINGS, LECTURE NOTES IN COMPUTER SCIENCE, vol. 3314, pp. 678-684, 2004.
Abstract:
An evaluation of two traditional segmentation algorithms of
Morphological Reconstruction and the Fast Marching method along with a
novel hybrid segmentation approach is presented. After introducing the
Fast Marching and the Morphological Reconstruction segmentation, we
propose a novel hybrid segmentation approach in multi-stage, which is
derived from both an improved Fast Marching method and the
Morphological Reconstruction. To demonstrate the effectiveness and
accuracy of the three methods, we employ an MRI brain image in our
experiments, in which "gold standard" is known. The evaluation is
measured accordingly in accuracy and speed when running a 2.0 GHz based
windows XP PC. The accuracy results of average 0.9738, 0.6302 and
0.9734 measured in similarity indexes of the Morphological
Reconstruction, the Fast Marching and the hybrid approach are achieved,
respectively. The computing performance required 188.6, 22.3 and 43.4
in seconds accordingly.
|
1155. | Middleton, I, and Damper, RI, "Segmentation of magnetic resonance images using a combination of neural networks and active contour models," MEDICAL ENGINEERING & PHYSICS, vol. 26, pp. 71-86, 2004.
Abstract:
Segmentation of medical images is very important for clinical research
and diagnosis, leading to a requirement for robust automatic methods.
This paper reports on the combined use of a neural network (a
multilayer perceptron, MLP) and active contour model ('snake') to
segment structures in magnetic resonance (MR) images. The perceptron is
trained to produce a binary classification of each pixel as either a
boundary or a non-boundary point. Subsequently, the resulting binary
(edge-point) image forms the external energy function for a snake, used
to link the candidate boundary points into a continuous, closed
contour. We report here on the segmentation of the lungs from multiple
MR slices of the torso; lung-specific constraints have been avoided to
keep the technique as general as possible. In initial investigations,
the inputs to the MLP were limited to normalised intensity values of
the pixels from an (7 x 7) window scanned across the image. The use of
spatial coordinates as additional inputs to the MLP is then shown to
provide an improvement in segmentation performance as quantified using
the effectiveness measure (a weighted product of precision and recall).
Training sets were first developed using a lengthy iterative process.
Thereafter, a novel cost function based on effectiveness is proposed
for training that allows us to achieve dramatic improvements in
segmentation performance, as well as faster, non-iterative selection of
training examples. The classifications produced using this cost
function were sufficiently good that the binary image produced by the
MLP could be post-processed using an active contour model to provide an
accurate segmentation of the lungs from the multiple slices in almost
all cases, including unseen slices and subjects. (C) 2003 IPEM.
Published by Elsevier Ltd. All rights reserved.
|
1156. | Liu, H, and Jezek, KC, "Automated extraction of coastline from satellite imagery by integrating Canny edge detection and locally adaptive thresholding methods," INTERNATIONAL JOURNAL OF REMOTE SENSING, vol. 25, pp. 937-958, 2004.
Abstract:
This paper presents a comprehensive approach to effectively and
accurately extract coastlines from satellite imagery. It consists of a
sequence of image processing algorithms, in which the key component is
image segmentation based on a locally adaptive thresholding technique.
Several technical innovations have been made to improve the accuracy
and efficiency for determining the land/ water boundaries. The use of
the Levenberg-Marquardt method and the Canny edge detector speeds up
the convergence of iterative Gaussian curve fitting process and
improves the accuracy of the bimodal Gaussian parameters. The result is
increased reliability of local thresholds for image segmentation. A
series of further image processing steps are applied to the segmented
images. Particularly, grouping and labelling contiguous image regions
into individual image objects enables us to utilize heuristic human
knowledge about the size and continuity of the land and ocean masses to
discriminate the true coastline from other object boundaries. The final
product of our processing chain is a vector-based line coverage of the
coastline, which can be readily incorporated into a GIS database. Our
method has been applied to both radar and optical satellite images, and
the positional precision of the resulting coastline is measured at the
pixel level.
|
1157. | Li, J, and Hero, AO, "A fast spectral method for active 3D shape reconstruction," JOURNAL OF MATHEMATICAL IMAGING AND VISION, vol. 20, pp. 73-87, 2004.
Abstract:
Variational energy minimization techniques for surface reconstruction
are implemented by evolving an active surface according to the
solutions of a sequence of elliptic partial differential equations
(PDE's). For these techniques, most current approaches to solving the
elliptic PDE are iterative involving the implementation of costly
finite element methods (FEM) or finite difference methods (FDM). The
heavy computational cost of these methods makes practical application
to 3D surface reconstruction burdensome. In this paper, we develop a
fast spectral method which is applied to 3D active surface
reconstruction of star-shaped surfaces parameterized in polar
coordinates. For this parameterization the Euler-Lagrange equation is a
Helmholtz-type PDE governing a diffusion on the unit sphere. After
linearization, we implement a spectral non-iterative solution of the
Helmholtz equation by representing the active surface as a double
Fourier series over angles in spherical coordinates. We show how this
approach can be extended to include region-based penalization. A number
of 3D examples and simulation results are presented to illustrate the
performance of our fast spectral active surface algorithms.
|
1158. | Hintermuller, M, and Ring, W, "An inexact Newton-CG-type active contour approach for the minimization of the Numford-Shah functional," JOURNAL OF MATHEMATICAL IMAGING AND VISION, vol. 20, pp. 19-42, 2004.
Abstract:
The problem of segmentation of a given gray scale image by minimization
of the Mumford-Shah functional is considered. The minimization problem
is formulated as a shape optimization problem where the contour which
separates homogeneous regions is the ( geometric) optimization
variable. Expressions for first and second order shape sensitivities
are derived using the speed method from classical shape sensitivity
calculus. Second order information ( the shape Hessian of the cost
functional) is used to set up a Newton-type algorithm, where a
preconditioning operator is applied to the gradient direction to obtain
a better descent direction. The issue of positive definiteness of the
shape Hessian is addressed in a heuristic way. It is suggested to use a
positive definite approximation of the shape Hessian as a
preconditioner for the gradient direction. The descent vector field is
used as speed vector field in the level set formulation for the
propagating contour. The implementation of the algorithm is discussed
in some detail. Numerical experiments comparing gradient and
Newton-type flows for different images are presented.
|
1159. | Tang, JS, and Acton, ST, "Vessel boundary tracking for intravital Microscopy via multiscale gradient vector flow snakes," IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, vol. 51, pp. 316-324, 2004.
Abstract:
Due to movement of the specimen, vasodilation, and intense clutter, the
intravital location of a vessel boundary from video microscopy is a
difficult but necessary task in analyzing the mechanics of inflammation
and the structure of the microvasculature. This paper details an active
contour model for vessel boundary detection and tracking. In developing
the method, two innovations are introduced. First, the B-spline model
is combined with the gradient vector flow (GVF) external force. Second,
a multiscale gradient vector flow (MSGVF) is employed to elude clutter
and to reliably localize the vessel boundaries. Using synthetic
experiments and video microscopy obtained via transillumination of the
mouse cremaster muscle, we demonstrate that the MSGVF approach is
superior to the fixed-scale GVF approach in terms of boundary
localization. In each experiment, the fixed scale approach yielded at
least a 50% increase in root mean squared error over the multiscale
approach. In addition to delineating the vessel boundary so that cells
can be detected and tracked, we demonstrate the boundary location
technique enables automatic blood flow velocity computation in vivo.
|
1160. | Mansard, CD, Soulas, EPC, Anwander, A, Chaabane, L, Neyran, B, Serfaty, JM, Magnin, IE, Douek, PC, and Orkisz, M, "Quantification of multicontrast vascular MR images with NLSnake, an active contour model: In vitro validation and in vivo evaluation," MAGNETIC RESONANCE IN MEDICINE, vol. 51, pp. 370-379, 2004.
Abstract:
Vessel-wall measurements from multicontrast MRI provide information on
plaque structure and evolution. This requires the extraction of
numerous contours. In this work a contour-extraction method is proposed
that uses, an active contour model (NLSnake) adapted for a. wide range
of MR vascular images. This new method employs length normalization for
the purpose of deformation computation and offers the advantages of
simplified parameter tuning, fast convergence, and minimal user
interaction. The model can be initialized far from the boundaries of
the region to be segmented, even by only one pixel. The accuracy and
reproducibility of NLSnake endoluminal contours were assessed on
vascular phantom MR angiography (MRA) and high-resolution in vitro MR
images of rabbit aorta. An in vivo evaluation was performed on rabbit
and clinical data for both internal and external vessel-wall contours.
In phantoms with 95% stenoses, NLSnake measured 94.3% +/- 3.8%, and the
accuracy was even better for milder stenoses. In the images of rabbit
aorta, variability between NLSnake and experts was less than
interobserver variability, while the maximum intravariability of
NLSnake was equal to 1.25%. In conclusion, the NLSnake technique
successfully quantified the vessel lumen in multicontrast MR images
using constant parameters. (C) 2004 Wiley-Liss, Inc.
|
1161. | Shih, FY, and Chuang, CF, "Automatic extraction of head and face boundaries and facial features," INFORMATION SCIENCES, vol. 158, pp. 117-130, 2004.
Abstract:
This paper presents a novel approach for the extraction of human head,
face and facial features. In the double-threshold method, the
high-thresholded image is used to trace head boundary and the
low-thresholded image is used to scan face boundary. We obtain facial
features candidates and eliminate noises, and apply x- and
y-projections to extract facial features such as eyes, nostrils and
mouth. Because low contrast of chin occurs in some face images, its
boundary cannot be completely detected. An elliptic model is used to
repair it. Because of noises or clustered facial features candidates,
we apply a geometric face model to locate facial features and an
elliptic model to trace face boundary. The Gabor filter algorithm is
adopted to locate two eyes. We have tested our algorithm on more than
100 FERET face images. Experimental results show that our algorithm can
perform the extraction of human head, face and facial features
successfully. (C) 2003 Elsevier Inc. All rights reserved.
|
1162. | Jehan-Besson, S, Gastaud, M, Precioso, F, Barlaud, M, Aubert, G, and Debreuve, T, "From snakes to region-based active contours defined by region-dependent parameters," APPLIED OPTICS, vol. 43, pp. 247-256, 2004.
Abstract:
Image and sequence segmentation of a the segmentation task are
discussed from the point of view of optimizing the segmentation
criterion. Such a segmentation criterion involves so-called (boundary
and region) descriptors, which, in general, may depend on their
respective boundaries or regions. This dependency must be taken into
account when one is computing the criterion derivative with respect to
the unknown object domain (defined by its boundary). If this dependency
not considered, some correctional terms may be omitted. Computing the
derivative of the segmentation criterion with a dynamic scheme is
described. The scheme is general enough to provide a framework for a
wide variety of applications in segmentation. It also provides a
theoretical meaning to the philosophy of active contours. 0 2004
Optical Society of America.
|
1163. | Lowell, J, Hunter, A, Steel, D, Basu, A, Ryder, R, Fletcher, E, and Kennedy, L, "Optic nerve head segmentation," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 23, pp. 256-264, 2004.
Abstract:
Reliable and efficient optic disk localization and segmentation are
important tasks in automated retinal screening. General-purpose edge
detection algorithms often fail to segment the optic disk due to fuzzy
boundaries, inconsistent image contrast or missing edge features. This
paper presents an algorithm for the localization and segmentation of
the optic nerve head boundary in low-resolution images (about 20
mu/pixel). Optic disk localization is achieved using specialized
template matching, and segmentation by a deformable contour model. The
latter uses a global elliptical model and a local deformable model with
variable edge-strength dependent stiffness. The algorithm is evaluated
against a randomly selected database of 100 images from a diabetic
screening programme. Ten images were classified as unusable; the others
were of variable quality. The localization algorithm succeeded on all
bar one usable image; the contour estimation algorithm was
qualitatively assessed by an ophthalmologist as having Excellent-Fair
performance in 83% of cases, and performs well even on blurred images.
|
1164. | Yuasa, M, Yamaguchi, O, and Fukui, K, "Precise pupil contour detection based on minimizing the energy of pattern and edge," IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, vol. E87D, pp. 105-112, 2004.
Abstract:
We propose a new method to precisely detect pupil contours in face
images. Pupil contour detection is necessary for various applications
using face images. It is, however, difficult to detect pupils precisely
because of their weak edges or lack of edges. The proposed method is
based on minimizing the energy of pattern and edge. The basic idea of
this method is that the energy, which consists of the pattern and the
edge energy, has to be minimized. An efficient search method is also
introduced to overcome the underlying problem of efficiency in energy
minimization methods. "Guide patterns" are introduced for this purpose.
Moreover, to detect pupils more precisely we use an ellipse model as
pupil shape in this paper. Experimental results show the effectiveness
of the proposed method.
|
1165. | Yamashita, A, Kaneko, T, Matsushita, S, and Miura, KT, "Region extraction with chromakey using stripe backgrounds," IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, vol. E87D, pp. 66-73, 2004.
Abstract:
In this paper, we propose a new region extraction method with a
chromakey technique using a two-tone striped background. A chromakey
compositing is a technique for separating actors or actresses from a
background, and then compositing a different background. The
conventional chromakey technique usually uses an unicolored blue or
green background, and has a problem that one's clothes are regarded as
the background if their colors are same with the background's color.
Therefore, we use two-tone striped background and utilize the adjacency
condition between two-tone striped areas on the background to extract
the foreground regions whose colors are same with the background. The
procedure of our proposed method consists of four steps: 1) background
color extraction, 2) striped region extraction, 3) foreground
extraction, and 4) image composition. As to the background color
extraction, the color space approach is used. As to the striped region
extraction, it is difficult to extract striped region by a color space
approach because the color of this region may be a composite of two
background colors and different from them. Therefore, the striped
region is extracted from adjacency conditions between two background
colors. As to the foreground extraction, the boundary between the
foreground and the background is detected to recheck the foreground
region whose color is same as the background, and the background region
whose color is same as the foreground. To detect the region whose color
is same as the background, the adjacency conditions with the striped
region are utilized. As to the image composition, the process that
smoothes the color of the foreground's boundary against the new
background is carried out to create natural images. The validity of
proposed method is shown through experiments with the foreground
objects whose color is same as the background color.
|
1166. | Glaunes, J, Vaillant, M, and Miller, MI, "Landmark matching via large deformation diffeomorphisms on the sphere," JOURNAL OF MATHEMATICAL IMAGING AND VISION, vol. 20, pp. 179-200, 2004.
Abstract:
This paper presents a methodology and algorithm for generating
diffeomorphisms of the sphere onto itself, given the displacements of a
finite set of template landmarks. Deformation maps are constructed by
integration of velocity fields that minimize a quadratic smoothness
energy under the specified landmark constraints. We present additional
formulations of this problem which incorporate a given error variance
in the positions of the landmarks. Finally, some experimental results
are presented. This work has application in brain mapping, where
surface data is typically mapped to the sphere as a common coordinate
system.
|
1167. | Yan, JY, Zhuang, TG, Zhao, BS, and Schwartz, LH, "Lymph node segmentation from CT images using fast marching method," COMPUTERIZED MEDICAL IMAGING AND GRAPHICS, vol. 28, pp. 33-38, 2004.
Abstract:
Accurate lymph node size analysis is important medically. This paper
presents an improved fast marching method to perform semiautomatic
segmentation for lymph node from CT images. In this work, we have
incorporated the gray scale information of the target region into the
fast marching speed term and have given a hard constraint for the stop
criteria, instead of only using the spatial image gradient, to remedy
the 'boundary leaking' problem of the traditional fast marching method.
Various experimental results are provided to demonstrate the
effectiveness of the proposed method. (C) 2004 Elsevier Ltd. All rights
reserved.
|
1168. | Wang, Y, Teoh, EK, and Shen, DG, "Lane detection and tracking using B-Snake," IMAGE AND VISION COMPUTING, vol. 22, pp. 269-280, 2004.
Abstract:
In this paper, we proposed a B-Snake based lane detection and tracking
algorithm without any cameras' parameters. Compared with other lane
models, the B-Snake based lane model is able to describe a wider range
of lane structures since B-Spline can form any arbitrary shape by a set
of control points. The problems of detecting both sides of lane
markings (or boundaries) have been merged here as the problem of
detecting the mid-line of the lane, by using the knowledge of the
perspective parallel lines. Furthermore, a robust algorithm, called
CHEVP, is presented for providing a good initial position for the
B-Snake. Also, a minimum error method by Minimum Mean Square Error
(MMSE) is proposed to determine the control points of the B-Snake model
by the overall image forces on two sides of lane. Experimental results
show that the proposed method is robust against noise, shadows, and
illumination variations in the captured road images. It is also
applicable to the marked and the unmarked roads, as well as the dash
and the solid paint line roads. (C) 2003 Elsevier B.V. All rights
reserved.
|
1169. | Bovenkamp, EGP, Dijkstra, J, Bosch, JG, and Reiber, JHC, "Multi-agent segmentation of IVUS images," PATTERN RECOGNITION, vol. 37, pp. 647-663, 2004.
Abstract:
A novel multi-agent image interpretation system has been developed
which is markedly different from previous approaches in especially its
elaborate high-level knowledge-based control over low-level image
segmentation algorithms. Agents dynamically adapt segmentation
algorithms based on knowledge about global constraints, contextual
knowledge, local image information and personal beliefs. Generally
agent control allows the underlying segmentation algorithms to be
simpler and be applied to a wider range of problems with a higher
reliability.
The agent knowledge model is general and modular to support easy
construction and addition of agents to any image processing task. Each
agent in the system is further responsible for one type of high-level
object and cooperates with other agents to come to a consistent overall
image interpretation. Cooperation involves communicating hypotheses and
resolving conflicts between the interpretations of individual agents.
The system has been applied to IntraVascular Ultrasound (IVUS) images
which are segmented by five agents, specialized in lumen, vessel,
calcified-plaque, shadow and sidebranch detection. IVUS image sequences
from 7 patients were processed and vessel and lumen contours were
detected fully automatically. These were compared with expert-corrected
semiautomatically detected contours. Results show good correlations
between agents and expert with r = 0.84 for the lumen and r = 0.92 for
the vessel cross-sectional areas, respectively. (C) 2003 Pattern
Recognition Society. Published by Elsevier Ltd. All rights reserved.
|
1170. | Hong, J, Dohi, T, Hashizume, M, Konishi, K, and Hata, N, "An ultrasound-driven needle-insertion robot for percutaneous cholecystostomy," PHYSICS IN MEDICINE AND BIOLOGY, vol. 49, pp. 441-455, 2004.
Abstract:
A real-time ultrasound-guided needle-insertion medical robot for
percutaneous cholecystostomy has been developed. Image-guided
interventions have become widely accepted because they are consistent
with minimal invasiveness. However, organ or abnormality displacement
due to involuntary patient motion may undesirably affect the
intervention. The proposed instrument uses intraoperative images and
modifies the needle path in real time by using a novel ultrasonic image
segmentation technique. In phantom and volunteer experiments, the
needle path updating time was 130 and 301 ms per cycle, respectively.
In animal experiments, the needle could be placed accurately in the
target.
|
1171. | Valverde, FL, Guil, N, and Munoz, J, "Segmentation of vessels from mammograms using a deformable model," COMPUTER METHODS AND PROGRAMS IN BIOMEDICINE, vol. 73, pp. 233-247, 2004.
Abstract:
Vessel extraction is a fundamental step in certain medical imaging
applications such as angiograms. Different methods are available to
segment vessels in medical images, but they are not fully automated
(initial vessel points are required) or they are very sensitive to
noise in the image. Unfortunately, the presence of noise, the
variability of the background, and the tow and varying contrast of
vessels in many imaging modalities such as mammograms, makes it quite
difficult to obtain reliable fully automatic or even semi-automatic
vessel detection procedures. In this paper a fully automatic algorithm
for the extraction of vessels in noisy medical images is presented and
validated for mammograms. The main issue in this research is the
negative influence of noise on segmentation algorithms. A two-stage
procedure was designed for noise reduction. First, a global approach
phase including edge detection and thresholding is applied. Then, the
local approach phase performs vessel segmentation using a deformable
model with a new energy term that reduces the noise still remaining in
the image from the first stage. Experimental results on mammograms show
that this method has an excellent performance level in terms of
accuracy, sensitivity, and specificity. The computation time also makes
it suitable for real-time applications within a clinical environment.
(C) 2003 Elsevier Ireland Ltd. All rights reserved.
|
1172. | Yoon, SW, Lee, HK, Kim, JH, and Lee, MH, "Medical endoscopic image segmentation using snakes," IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, vol. E87D, pp. 785-789, 2004.
Abstract:
Image segmentation is an essential technique of image analysis. In
spite of the issues in contour initialization and boundary concavities,
active contour models (snakes) are popular and successful methods for
segmentation. In this paper, we present a new active contour model,
Gaussian Gradient Force snake (GGF snake), for segmentation of an
endoscopic image. The GGF snake is less sensitive to contour
initialization and it ensures a high accuracy, large capture range, and
fast CPU time for computing an external force. It was observed that the
GGF snake produced more reasonable results in various image types :
simple synthetic images, commercial digital camera images, and
endoscopic images, than previous snakes did.
|
1173. | Grau, V, Mewes, AUJ, Alcaniz, M, Kikinis, R, and Warfield, SK, "Improved watershed transform for medical image segmentation using prior information," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 23, pp. 447-458, 2004.
Abstract:
The watershed transform has interesting properties that make it useful
for many different image segmentation applications: it is simple and
intuitive, can be parallelized, and always produces a complete division
of the image. However, when applied to medical image analysis, it has
important drawbacks (oversegmentation, sensitivity to noise, poor
detection of thin or low signal to noise ratio structures). We present
an improvement to the watershed transform that enables the introduction
of prior information in its calculation. We propose to introduce this
information via the use of a previous probability calculation.
Furthermore, we introduce a method to combine the watershed transform
and atlas registration, through the use of markers. We have applied our
new algorithm to two challenging applications: knee cartilage and gray
matter/white matter segmentation in MR images. Numerical validation of
the results is provided, demonstrating the strength of the algorithm
for medical image segmentation.
|
1174. | Lievin, M, and Luthon, F, "Nonlinear color space and spatiotemporal MRF for hierarchical segmentation of face features in video," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 13, pp. 63-71, 2004.
Abstract:
This paper deals with the low-level joint processing of color and
motion for robust face analysis within a feature-based approach. To
gain robustness and contrast under unsupervised viewing conditions, a
nonlinear color transform relevant for hue segmentation is derived from
a logarithmic model. A hierarchical segmentation scheme is based on
Markov random field modeling, that combines hue and motion detection
within a spatiotemporal neighborhood. Relevant face regions are
segmented without parameter tuning. The accuracy of the label fields
enables not only face detection and tracking but also geometrical
measurements on facial feature edges, such as lips or eyes. Results are
shown both on typical test sequences and on various sequences acquired
from micro- or mobile cameras. The efficiency of the method makes it
suitable for real-time applications aiming at audiovisual communication
in unsupervised environments.
|
1175. | Yan, H, "Convergence condition and efficient implementation of the fuzzy curve-tracing (FCT) algorithm," IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, vol. 34, pp. 210-221, 2004.
Abstract:
The fuzzy curve-tracing (FCT) algorithm can be used to extract a smooth
curve from unordered noisy data. In this paper, we analyze the
convergence property of the algorithm based on the diagonal dominance
requirement of the matrix used in the clustering procedure and prove
that the algorithm is guaranteed to converge if the weighting
coefficient for the smoothness constraint is chosen properly. Based on
the convergence condition, we develop several methods for fast and
reliable implementation of the algorithm. We show that the algorithm
can be initialized with a user-defined curve in many cases, that a
multiresolution clustering based approach and an image down-sampling
scheme can be used to improve the algorithm stability and speed and
that two types of traps can be removed to correct the mistakes in curve
tracing. We demonstrate several advantages of our algorithm over the
commonly used snake models for boundary detection and several methods
for principle curve extraction.
|
1176. | Wallner, J, "Gliding spline motions and applications," COMPUTER AIDED GEOMETRIC DESIGN, vol. 21, pp. 3-21, 2004.
Abstract:
We consider the ICP (iterative closest point) algorithm, which may in
general be used for moving 'active' elements such as curves and
surfaces towards geometric objects whose distance field is computable.
We show how it may be accelerated, and how it can be applied to the
design of near-Euclidean near-contact spline motions. One particular
application of this concept is the modeling of milling tool paths in
five-axis milling. The method involves computing the distance from and
footpoints in both the Euclidean motion group and the configuration
space of surface-surface contact. (C) 2003 Elsevier B.V. All rights
reserved.
|
1177. | Liang, BJ, and Wallace, AM, "Viewpoint independent matching of planar curves in 3D space," PATTERN RECOGNITION, vol. 37, pp. 525-542, 2004.
Abstract:
We present a new approach to match planar curves using the weak
perspective projection model. This is based on a set of shape
parameters that can be extracted from a closed or open contour, derived
from the original image as a theta(s) boundary code. In order to reduce
the complexity and increase the robustness of the matching process, the
original parameters are reduced to a set of three intermediate
variables, each of which can be calculated independently. These
variables are contained within a system of linear equations which
define the angles and the ratio of the heights of corresponding point
pairs on the two contours with respect to a floating coordinate system.
The shape matching process is scale and orientation independent, and
the original parameters that describe the relative pose of the two
contours in 3D space can be recovered subsequently. The approach can be
applied to "featured" and "featureless" contours, to whole and partial
contours, and is demonstrated on images of contours and mechanical
parts and tools to recover identity and pose. (C) 2003 Pattern
Recognition Society. Published by Elsevier Ltd. All rights reserved.
|
1178. | Wang, X, Peng, Z, Gao, F, and Wee, WG, "Deformable contour method based on variational approach to a constrained optimisation formulation," ELECTRONICS LETTERS, vol. 40, pp. 110-112, 2004.
Abstract:
A deformable contour method derived from the variational approach to a
constrained contour energy minimisation formulation is presented. The
constraint is a function that characterises target object interiors. A
new constraint is also proposed with better results when compared to
other conventional deformable contour methods.
|
1179. | Wang, J, Ji, L, Lin, XS, and Ma, H, "Tracking deforming aortas in two-photon autofluorescence images and its application on quantitative evaluation of aorta-related drugs," COMPUTERIZED MEDICAL IMAGING AND GRAPHICS, vol. 28, pp. 51-59, 2004.
Abstract:
This paper describes a novel approach to an objective measurement of
aorta samples of rats and a quantitative evaluation of aorta-related
drugs. Two-photon fluorescence microscopy is used for recording image
sequences of deforming aorta. Time sequence snake models are used to
track the structural deformations of aorta walls caused by drug
stimulation of the elastic lamina in the aorta. Several objective and
quantitative biomarkers extracted from these models are used as
diagnostic indicators. In a preliminary study, the technique was
successfully used for evaluating the effect of a newly developed
drug-human erythrocyte-derived depressing factor quantitatively and
objectively. (C) 2003 Elsevier Ltd. All rights reserved.
|
1180. | Les, Z, and Les, M, "Shape understanding: Knowledge generation and learning," IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, vol. 16, pp. 343-353, 2004.
Abstract:
In this paper, a method of knowledge generation as part of a
shape-understanding method is presented. The proposed method of
knowledge generation consists of: learning the description of. new a
posteriori classes, learning the concept of visual objects, and
generation of the visual representation of "inner" objects. The visual
concept, as part of the concept of the visual object, is expressed as a
set of symbolic names that refers to possible classes of shape. The
visual concept can be used to find the visual similarities between
different visual objects, perform visual transformations as part of
visual thinking capabilities of a system, and memorize a visual object
as a symbolic representation. The knowledge obtained in the process of
knowledge generation is integrated with an existing knowledge of a
shape understanding system and used in the explanatory process. This
system of shape understanding (SUS), that is, the implementation of the
shape understanding method, is designed to imitate the visual thinking
capabilities of the human visual system. The SUS consists of different
types of experts that perform different processing and reasoning tasks
and is designed to perform visual diagnosis in medical applications.
|
1181. | Greminger, MA, and Nelson, BJ, "Vision-based force measurement," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 26, pp. 290-298, 2004.
Abstract:
This paper demonstrates a method to visually measure the force
distribution applied to a linearly elastic object using the contour
data in an image. The force measurement is accomplished by making use
of the result from linear elasticity that the displacement field of the
contour of a linearly elastic object is sufficient to completely
recover the force distribution applied to the object. This result leads
naturally to a deformable template matching approach where the template
is deformed according to the governing equations of linear elasticity.
An energy minimization method is used to match the template to the
contour data in the image. This technique of visually measuring forces
we refer to as vision-based force measurement (VBFM). VBFM has the
potential to increase the robustness and reliability of
micromanipulation and biomanipulation tasks where force sensing is
essential for success. The effectiveness of VBFM is demonstrated for
both a microcantilever beam and a microgripper. A sensor resolution of
less than +/- 3 nN for the microcantilever and +/- 3 mN for the
microgripper was achieved using VBFM. Performance optimizations for the
energy minimization problem are also discussed that make this algorithm
feasible for real-time applications.
|
1182. | Burnett, SSC, Starkschall, G, Stevens, CW, and Liao, ZX, "A deformable-model approach to semi-automatic segmentation of CT images demonstrated by application to the spinal canal," MEDICAL PHYSICS, vol. 31, pp. 251-263, 2004.
Abstract:
Because of the importance of accurately defining the target in
radiation treatment planning, we have developed a deformable-template
algorithm for the semi-automatic delineation of normal tissue
structures on computed tomography (CT) images. We illustrate the method
by applying it to the spinal canal. Segmentation is per-formed in three
steps: (a) partial delineation of the anatomic structure is obtained by
wavelet-based edge detection; (b) a deformable-model template is fitted
to the edge set by chamfer matching; and (c) the template is relaxed
away from its original shape into its final position. Appropriately
chosen ranges for the model parameters limit the deformations of the
template, accounting for interpatient variability. Our approach differs
from those used in other deformable models in that it does not
inherently require the modeling of forces. Instead, the spinal canal
was modeled using Fourier descriptors derived from four sets of
manually drawn contours. Segmentation was carried out, without manual
intervention, on five CT data sets and the algorithm's performance was
judged subjectively by two radiation oncologists. Two assessments were
considered: in the first, segmentation on a random selection of 100
axial CT images was compared with the corresponding contours drawn
manually by one of six dosimetrists, also chosen randomly; in the
second assessment, the segmentation of each image in the five evaluable
CT sets (a total of 557 axial images) was rated as either successful,
unsuccessful, or requiring further editing. Contours generated by the
algorithm were more likely than manually drawn contours to be
considered acceptable by the oncologists. The mean proportions of
acceptable contours were 93% (automatic) and 69% (manual). Automatic
delineation of the spinal canal was deemed to be successful on 91% of
the images, unsuccessful on 2% of the images, and requiring further
editing on 7% of the images. Our deformable template algorithm thus
gives a robust segmentation of the spinal canal on CT images. The
method can be extended to other structures, although it remains to be
shown that chamfer matching is sufficiently robust for the delineation
of soft-tissue structures surrounded by soft tissue. (C) 2004 American
Association of Physicists in Medicine.
|
1183. | Liu, LF, and Sclaroff, S, "Deformable model-guided region split and merge of image regions," IMAGE AND VISION COMPUTING, vol. 22, pp. 343-354, 2004.
Abstract:
The incorporation of model-based splitting operations produces an
improved algorithm for image segmentation with deformable templates.
Image regions are merged together and/or split apart, based on
agreement with a statistical shape model, as well as local shape
properties of the region bounding contours. Experiments indicate that
the new split/merge strategy yields a significant improvement over the
previous template-based segmentation method that used merging alone.
(C) 2003 Elsevier B.V. All rights reserved.
|
1184. | Tsechpenakis, G, Rapantzikos, K, Tsapatsoulis, N, and Kollias, S, "A snake model for object tracking in natural sequences," SIGNAL PROCESSING-IMAGE COMMUNICATION, vol. 19, pp. 219-238, 2004.
Abstract:
Tracking moving objects in video sequences is a task that emerges in
various fields of study: video analysis, computer vision, biomedical
systems, etc. In the last decade, special attention has been drawn to
problems concerning tracking in real-world environments, where moving
objects do not obey any afore-known constraints about their nature and
motion or the scenes they are moving in. Apart from the existence of
noise and environmental changes, many problems are also concerned, due
to background texture, complicated object motion, and deformable and/or
articulated objects, changing their shape while moving along time.
Another phenomenon in natural sequences is the appearance of occlusions
between different objects, whose handling requires motion information
and, in some cases, additional constraints. In this work, we revisit
one of the most known active contours, the Snakes, and we propose a
motion-based utilization of it, aiming at successful handling of the
previously mentioned problems. The use of the object motion history and
first order statistical measurements of it, provide us with information
for the extraction of uncertainty regions, a kind of shape prior
knowledge w.r.t. the allowed object deformations. This constraining
also makes the proposed method efficient, handling the trade-off
between accuracy and computation complexity. The energy minimization is
approximated by a force-based approach inside the extracted uncertainty
regions, and the weights of the total snake energy function are
automatically estimated as respective weights in the resulting
evolution force. Finally, in order to handle background complexity and
partial occlusion cases, we introduce two rules, according to which the
moving object region is correctly separated from the background,
whereas the occluded boundaries are estimated according to the object's
expected shape. To verify the performance of the proposed method, some
experimental results are included, concerning different cases of object
tracking, indoors and outdoors, with rigid and deformable objects,
noisy and textured backgrounds, as well as appearance of occlusions.
(C) 2003 Elsevier B.V. All rights reserved.
|
1185. | Jia, JY, and Tang, CK, "Inference of segmented color and texture description by tensor voting," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 26, pp. 771-786, 2004.
Abstract:
A robust synthesis method is proposed to automatically infer missing
color and texture information from a damaged 2D image by ND tensor
voting (N > 3). The same approach is generalized to range and 3D data
in the presence of occlusion, missing data and noise. Our method
translates texture information into an adaptive ND tensor, followed by
a voting process that infers noniteratively the optimal color values in
the ND texture space. A two-step method is proposed. First, we perform
segmentation based on insufficient geometry, color, and texture
information in the input, and extrapolate partitioning boundaries by
either 2D or 3D tensor voting to generate a complete segmentation for
the input. Missing colors are synthesized using ND tensor voting in
each segment. Different feature scales in the input are automatically
adapted by our tensor scale analysis. Results on a variety of difficult
inputs demonstrate the effectiveness of our tensor voting approach.
|
1186. | Mohr, J, Hess, A, Scholz, M, and Obermayer, K, "A method for the automatic segmentation of autoradiographic image stacks and spatial normalization of functional cortical activity patterns," JOURNAL OF NEUROSCIENCE METHODS, vol. 134, pp. 45-58, 2004.
Abstract:
This paper introduces two new methods for the automatic anatomical and
functional analysis of neurobiological autoradiographic image stacks,
such as 2-fluoro-deoxyglucose (2FDG) images. The difficulty in the
evaluation of these "2(1/2)D" datasets is that they do not inherently
represent a continuous 3D data volume (as generated by MRI or CT), but
consist of a stack of images from single tissue slices, suffering from
unavoidable preparation artifacts. In the first part of the paper, a
semi-automatic segmentation method is presented which generates a 3D
surface model of certain brain structures and which is robust against
different cutting directions with respect to the brain coordinate
system. The method saves man-hours compared to manual segmentation and
the results are highly reproducible. In the second part, a fully
automatic method for the extraction, analysis and 3D visualization of
functional information is described, which allows not only a more
accurate localization of activation sites, but also greatly enhances
the comparability of different individuals. Results are shown for 2FDG
autoradiographs from rat brains under acoustical stimulation. (C) 2003
Elsevier B.V. All rights reserved.
|
1187. | Wang, GJ, Tang, K, and Tai, CL, "Parametric representation of a surface pencil with a common spatial geodesic," COMPUTER-AIDED DESIGN, vol. 36, pp. 447-459, 2004.
Abstract:
In this paper, we study the problem of constructing a family of
surfaces from a given spatial geodesic curve. We derive a parametric
representation for a surface pencil whose members share the same
geodesic curve as an isoparametric curve. By utilizing the Frenet
trihedron frame along the given geodesic, we express the surface pencil
as a linear combination of the components of this local coordinate
frame, and derive the necessary and sufficient conditions for the
coefficients to satisfy both the geodesic and the isoparametric
requirements. We illustrate and verify the method by finding exact
surface pencil formulations for some simple surfaces, such as surfaces
of revolution and ruled surfaces. Finally, we demonstrate the use of
this method in a garment design application. (C) 2003 Elsevier Ltd. All
rights reserved.
|
1188. | Ning, HZ, Tan, TN, Wang, L, and Hu, WM, "Kinematics-based tracking of human walking in monocular video sequences," IMAGE AND VISION COMPUTING, vol. 22, pp. 429-441, 2004.
Abstract:
Human tracking is currently one of the most active research topics in
computer vision. This paper proposed a kinematics-based approach to
recovering motion parameters of people walking from monocular video
sequences using robust image matching and hierarchical search. Tracking
a human with unconstrained movements in monocular image sequences is
extremely challenging. To reduce the search space, we design a
hierarchical search strategy in a divide-and-conquer fashion according
to the tree-like structure of the human body model. Then a
kinematics-based algorithm is proposed to recursively refine the joint
angles. To measure the matching error, we present a pose evaluation
function combining both boundary and region information. We also
address the issue of initialization by matching the first frame to six
key poses acquired by clustering and the pose having minimal matching
error is chosen as the initial pose. Experimental results in both
indoor and outdoor scenes demonstrate that our approach performs well.
(C) 2004 Published by Elsevier B.V.
|
1189. | Weichert, F, Wawro, M, and Wilke, C, "A 3D computer graphics approach to brachytherapy planning," INTERNATIONAL JOURNAL OF CARDIOVASCULAR IMAGING, vol. 20, pp. 173-182, 2004.
Abstract:
Intravascular brachytherapy (IVB) can significantly reduce the risk of
restenosis after interventional treatment of stenotic arteries, if
planned and applied correctly. In order to facilitate computer-based
IVB planning, a three-dimensional reconstruction of the stenotic artery
based on intravascular ultrasound (IVUS) sequences is desirable. For
this purpose, the frames of the IVUS sequence are properly aligned in
space, possible gaps inbetween the IVUS frames are filled by
interpolation with radial basis functions known from scattered data
interpolation. The alignment procedure uses additional information
which is obtained from biplane X-ray angiography performed
simultaneously during the capturing of the IVUS sequence. After IVUS
images and biplane angiography data are acquired from the patient, the
vessel-wall borders and the IVUS catheter are detected by an active
contour algorithm. Next, the twist (relative orientation) between
adjacent IVUS frames is determined by a sequential triangulation
method. The absolute orientation of each frame is established by a
stochastic analysis based on anatomical landmarks. Finally, the
reconstructed 3D vessel model is visualized by methods of combined
volume and polygon rendering. The reconstruction is then used for the
computation of the radiation-distribution within the tissue, emitted
from a beta-radiation source. All these steps are performed during the
percutaneous intervention.
|
1190. | Narayanan, S, Nayak, K, Lee, SB, and Byrd, D, "An approach to real-time magnetic resonance imaging for speech production," JOURNAL OF THE ACOUSTICAL SOCIETY OF AMERICA, vol. 115, pp. 1771-1776, 2004.
Abstract:
Magnetic resonance imaging (MRI) has served as a valuable tool for
studying static postures in speech production. Now, recent improvements
in temporal resolution are making it possible to examine the dynamics
of vocal-tract shaping during fluent speech using MRI. The present
study uses spiral k-space acquisitions with a low flip-angle gradient
echo pulse sequence on a conventional GE Signa 1.5-T CV/i scanner. This
strategy allows for acquisition rates of 8-9 images per second and
reconstruction rates of 20-24 images per second, making veridical
movies of speech production now possible. Segmental durations,
positions, and interarticulator timing can all be quantitatively
evaluated. Data show clear real-time movements of the lips, tongue, and
velum. Sample movies and data analysis strategies are presented. (C)
2004 Acoustical Society of America.
|
1191. | Cances, E, Keriven, R, Lodier, F, and Savin, A, "How electrons guard the space: shape optimization with probability distribution criteria," THEORETICAL CHEMISTRY ACCOUNTS, vol. 111, pp. 373-380, 2004.
Abstract:
Efficient formulas for computing the probabilities of finding exactly
nu electrons in an arbitrarily chosen volume Omegasubset ofR(3) for
Hartree-Fock wavefunctions are presented. These formulas allow the use
of shape optimization techniques, such as level set methods, for
optimizing with respect to Omega various criteria involving such
probabilities. The criterion defined as the difference between the
Hartree-Fock and the independent-particle model probabilities of
finding nu electrons in Omega stresses the quantum effects due to the
Pauli principle. We have implemented a 2D level set method for
optimizing this criterion in order to study spatial separation of
electron pairs in linear molecules. The method is described and the
illustrative example of the BH molecule is reported.
|
1192. | van Bemmel, CM, Viergever, MA, and Niessen, WJ, "Semiautomatic segmentation of 3D contrast-enhanced MR and stenosis quantification angiograms of the internal carotid artery," MAGNETIC RESONANCE IN MEDICINE, vol. 51, pp. 753-760, 2004.
Abstract:
A technique is presented for the segmentation and quantification of
stenosed internal carotid arteries (ICAs) in 3D contrast-enhanced MR
angiography (CE-MRA). Segmentation with subpixel accuracy of the ICA is
achieved via level-set techniques in which the central axis serves as
the initialization. The central axis is determined between two
user-defined points, and minimal user interaction is required. For
quantification, the cross-sectional area is measured in the stenosis
and at a reference segment in planes perpendicular to the central axis.
The technique was applied to 20 ICAs. The variation in measurements
obtained by this method in comparison with manual observations was
8.7%, which is smaller than the interobserver variability among three
experts (11.0%). (C) 2004 Wiley-Liss, Inc.
|
1193. | Pardo, XM, Leboran, V, and Dosil, R, "Integrating prior shape models into level-set approaches," PATTERN RECOGNITION LETTERS, vol. 25, pp. 631-639, 2004.
Abstract:
To incorporate prior shape information into a deformable model either
local or global shape modeling must be carried out. Local shape
modeling involves manual interaction to accumulate information on the
shape variability of any object. It depends on the existence of
homologous points, or landmarks, that must be unambiguously and
consistently located in different specimens. Global shape modeling does
not require the existence of landmarks. Global properties can be
characterized using only a few parameters, and tend to be much more
stable than local properties. In this work we propose a new approach
that combines the benefits of local and global shape modeling in the
field of level-set approaches. The method starts with local shape
parameterization, which eases user interaction. Then, the shape is
converted into an implicit representation which exploits the stability
and compactness of global shape parameters. (C) 2004 Elsevier B.V. All
rights reserved.
|
1194. | Martin, P, Refregier, P, Goudail, F, and Guerault, F, "Influence of the noise model on level set active contour segmentation," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 26, pp. 799-803, 2004.
Abstract:
We analyze level set implementation of region snakes based on the
maximum likelihood method for different noise models that belong to the
exponential family. We show that this approach can improve segmentation
results in noisy images and we demonstrate that the regularization term
can be efficiently determined using an information theory-based
approach, i.e., the minimum description length principle. The criterion
to be optimized has no free parameter to be tuned by the user and the
obtained segmentation technique is adapted to nonsimply connected
objects.
|
1195. | Destrempes, F, and Mignotte, M, "A statistical model for contours in images," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 26, pp. 626-638, 2004.
Abstract:
In this paper, we describe a statistical model for the gradient vector
field of the gray level in images validated by different experiments.
Moreover, we present a global constrained Markov model for contours in
images that uses this statistical model for the likelihood. Our model
is amenable to an Iterative Conditional Estimation (ICE) procedure for
the estimation of the parameters; our model also allows segmentation by
means of the Simulated Annealing (SA) algorithm, the Iterated
Conditional Modes (ICM) algorithm, or the Modes of Posterior Marginals
(MPM) Monte Carlo (MC) algorithm. This yields an original unsupervised
statistical method for edge-detection, with three variants. The
estimation and the segmentation procedures have been tested on a total
of 160 images. Those tests indicate that the model and its estimation
are valid for applications that require an energy term based on the
log-likelihood ratio. Besides edge-detection, our model can be used for
semiautomatic extraction of contours, localization of shapes,
non-photo-realistic rendering; more generally, it might be useful in
various problems that require a statistical likelihood for contours.
|
1196. | Amini, L, Soltanian-Zadeh, H, Lucas, C, and Gity, M, "Automatic segmentation of thalamus from brain MRI integrating fuzzy clustering and dynamic contours," IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, vol. 51, pp. 800-811, 2004.
Abstract:
Thalamus is an important neuro-anatomic structure in the brain. In this
paper, an automated method is presented to segment thalamus from
magnetic resonance images (MRI). The method is based on a discrete
dynamic contour model that consists of vertices and edges connecting
adjacent vertices. The model starts from an initial contour and deforms
by external and internal forces. Internal forces are calculated from
local geometry of the model and external forces are estimated from
desired image features such as edges. However, thalamus has low
contrast and discontinues edges on MRI, making external force
estimation a challenge. The problem is solved using a new algorithm
based on fuzzy C-means (FCM) unsupervised clustering, Prewitt
edge-finding filter, and morphological operators. In addition, manual
definition of the initial contour for the model makes the final
segmentation operator-dependent. To eliminate this dependency, new
methods are developed for generating the initial contour automatically.
The proposed approaches are evaluated and validated by comparing
automatic and radiologist's segmentation results and illustrating their
agreement.
|
1197. | Xie, XH, and Mirmehdi, M, "RAGS: Region-aided Geometric Snake," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 13, pp. 640-652, 2004.
Abstract:
An enhanced, region-aided, geometric active contour that is more
tolerant toward weak edges and noise in images is introduced. The
proposed method integrates gradient flow forces with region
constraints, composed of image region vector flow forces obtained
through the diffusion of the region segmentation map. We refer to this
as the Region-aided Geometric Snake or RAGS. The diffused region forces
can be generated from any reliable region segmentation technique,
greylevel or color. This extra region force gives the snake a global
complementary view of the boundary information within the image which,
along with the local gradient flow, helps detect fuzzy boundaries and
overcome noisy regions. The partial differential equation (PDE)
resulting from this integration of image, gradient flow and diffused
region flow is implemented using a level set approach. We present
various examples and also evaluate and compare the performance of RAGS
on weak boundaries and noisy images.
|
1198. | Chang, CJ, Hsieh, JW, Chen, YS, and Hu, WF, "Tracking multiple moving objects using a level-set method," INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, vol. 18, pp. 101-125, 2004.
Abstract:
This paper presents a novel approach to track multiple moving objects
using the level-set method. The proposed method can track different
objects no matter if they are rigid, nonrigid, merged, split, with
shadows, or without shadows. At the first stage, the paper proposes an
edge-based camera compensation technique for dealing with the problem
of object tracking when the background is not static. Then, after
camera compensation, different moving pixels can be easily extracted
through a subtraction technique. Thus, a speed function with three
ingredients, i.e. pixel motions, object variances and background
variances, can be accordingly defined for guiding the process of object
boundary detection. According to the defined speed function, different
object boundaries can be efficiently detected and tracked by a curve
evolution technique, i.e. the level-set-based method. Once desired
objects have been extracted, in order to further understand the video
content, this paper takes advantage of a relation table to identify and
observe different behaviors of tracked objects. However, the above
analysis sometimes fails due to the existence of shadows. To avoid this
problem, this paper adopts a technique of Gaussian shadow modeling to
remove all unwanted shadows. Experimental results show that the
proposed method is much more robust and powerful than other traditional
methods.
|
1199. | Shen, DG, Lao, QQ, Zeng, JC, Zhang, W, Sesterhenn, IA, Sun, L, Moul, JW, Herskovits, EH, Fichtinger, G, and Davatzikos, C, "Optimized prostate biopsy via a statistical atlas of cancer spatial distribution," MEDICAL IMAGE ANALYSIS, vol. 8, pp. 139-150, 2004.
Abstract:
A methodology is presented for constructing a statistical atlas of
spatial distribution of prostate cancer from a large patient cohort,
and it is used for optimizing needle biopsy. An adaptive-focus
deformable model is used for the spatial normalization and registration
of 100 prostate histological samples, which were provided by the Center
for Prostate Disease Research of the US Department of Defense,
resulting in a statistical atlas of spatial distribution of prostate
cancer. Based on this atlas, a statistical predictive model was
developed to optimize the needle biopsy sites, by maximizing the
probability of detecting cancer. Experimental results using
cross-validation show that the proposed method can detect cancer with a
99% success rate using seven needles, in these samples. (C) 2003
Elsevier B.V. All rights reserved.
|
1200. | Minakuchi, Y, Ito, M, and Kohara, Y, "SPI: a tool for incorporating gene expression data into a four-dimensional database of Caenorhabditis elegans embryogenesis," BIOINFORMATICS, vol. 20, pp. 1097-1109, 2004.
Abstract:
Motivation: A comprehensive gene expression database is essential for
computer modeling and simulation of biological phenomena, including
development. Development is a four-dimensional (4D; 3D structure and
time course) phenomenon. We are constructing a 4D database of gene
expression for the early embryogenesis of the nematode Caenorhabditis
elegans. As a framework of the 4D database, we have constructed
computer graphics (CG), into which we will incorporate the expression
data of a number of genes at the subcellular level. However, the
assignment of 3D distribution of gene products (protein, mRNA), of
embryos at various developmental stages, is both difficult and tedious.
We need to automate this process. For this purpose, we developed a new
system, named SPI after superimposing fluorescent confocal microscopic
data onto a CG framework.
Results: The scheme of this system comprises the following: (1)
acquirement of serial sections (40 slices) of fluorescent confocal
images of three colors (4',6'-diamino-2-phenylindole (DAPI) for nuclei,
indodicarbocyanine (Cy-3) for the internal marker, which is a
germline-specific protein POS-1 and indocarbocyanine (Cy-5) for the
gene product to be examined); (2) identification of several features of
the stained embryos, such as contour, developmental stage and position
of the internal marker; (3) selection of CG images of the corresponding
stage for template matching; (4) superimposition of serial sections
onto the CG; (5) assignment of the position of superimposed gene
products. The Snakes algorithm identified the embryo contour. The
detection accuracy of embryo contours was 92.1% when applied to 2- to
28-cell-stage embryos. The accuracy of the developmental stage
prediction method was 81.2% for 2- to 8-cell-stage embryos. We manually
judged only the later stage embryos because the accuracy for embryos at
the later stages was unsatisfactory due to experimental noise effects.
Finally, our system chose the optimal CG and performed the
superposition and assignment of gene product distribution. We
established an initial 4D gene expression database with 56 maternal
gene products.
|
1201. | Kimura, A, Itaya, K, and Watanabe, T, "Structural pattern recognition of biological textures with growing deformations: A case of cattle's muzzle patterns," ELECTRONICS AND COMMUNICATIONS IN JAPAN PART II-ELECTRONICS, vol. 87, pp. 54-66, 2004.
Abstract:
Textured patterns on living organisms (hereafter referred to as
biological textures), which are typified by human fingerprints or
cattle muzzle patterns, have features that differ according to the
individual organism, and it is well known that these biological
textures can be used for identification. However, the pattern structure
of cattle muzzle patterns, for example, is more complex than that of
human fingerprints, and since the structure features are changed or
deformed during the growing stage, these pat tern structures cannot be
skillfully recognized by using a technique like the one used for
conventional fingerprint comparison. In this paper, the authors propose
a new recognition technique that is applicable even to biological
textures with these kinds of growing deformations. Specifically, they
focus on cattle muzzle patterns as an example of a biological texture
and select graph matching based on a horizontal search as the basic
strategy to create this new recognition technique consisting of a
technique for determining a pair of Hough-transformed search-starting
cycles and a muzzle pattern recognition method that improves search
efficiency by incorporating processing for merging non-searched cycles.
The authors performed evaluation experiments to verify the
effectiveness of the proposed technique and. obtained good results. (C)
2004 Wiley Periodicals, Inc.
|
1202. | Ito, H, and Matsuyama, T, "A measure for assessing edge fidelity of coded images based on shape analysis," ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, vol. 87, pp. 9-23, 2004.
Abstract:
The authors propose a method, for quantifying the edge degradation of a
coded image produced by aliasing distortion or block distortion based
on the change in its shape. Essentially, when a change is generated in
a smooth portion, a human can quickly detect it. With conventional
techniques based on signal differences, it was difficult to assess a
geometric distortion for which continuity or uni-formity changed. The
proposed technique obtains mutually corresponding edge segments for the
original image and coded image and quantifies the shape degradation
based on their curvature. To match subjective assessments, the meas-ure
that was obtained takes into consideration (1) the spatial size of the
shape change, (2) the shape error masking effect, and (3) the edge
gradient (contrast) effect in the quantification process. The authors
performed simulations for several standard images while changing the
coding rate and coding method, and the results that were obtained
reflected the impressions of the images well. (C) 2004 Wiley
Periodicals, Inc.
|
1203. | Wang, X, He, L, and Wee, W, "Deformable contour method: A constrained optimization approach," INTERNATIONAL JOURNAL OF COMPUTER VISION, vol. 59, pp. 87-108, 2004.
Abstract:
In this paper, a class of deformable contour methods using a
constrained optimization approach of minimizing a contour energy
function satisfying an interior homogeneity constraint is proposed. The
class is defined by any positive potential function describing the
contour interior characterization. An evolutionary strategy is used to
derive the algorithm. A similarity threshold T-v can be used to
determine the interior size and shape of the contour. Sensitivity and
significance of T-v and sigma (a spreadness measure) are also discussed
and shown. Experiments on noisy images and the convergence to a minimum
energy gap contour are included. The developed method has been applied
to a variety of medical images from CT abdominal section, MRI image
slices of brain, brain tumor, a pig heart ultrasound image sequence to
visual blood cell images. As the results show, the algorithm can be
adapted to a broad range of medical images containing objects with
vague, complex and/or irregular shape boundary, inhomogeneous and noisy
interior, and contour with small gaps.
|
1204. | Ferrari, RJ, Rangayyan, RM, Desautels, JEL, Borges, RA, and Frere, AF, "Identification of the breast boundary in mammograms using active contour models," MEDICAL & BIOLOGICAL ENGINEERING & COMPUTING, vol. 42, pp. 201-208, 2004.
Abstract:
A method for the identification of the breast boundary in mammograms is
presented. The method can be used in the preprocessing stage of a
system for computer-aided diagnosis (CAD) of breast cancer and also in
the reduction of image file size in picture archiving and communication
system applications. The method started with modification of the
contrast of the original image. A binarisation procedure was then
applied to the image, and the chain-code algorithm was used to find an
approximate breast contour. Finally, the identification of the true
breast boundary was performed by using the approximate contour as the
input to an active contour model algorithm specially tailored for this
purpose. After demarcation of the breast boundary, all artifacts
outside the breast region were eliminated. The method was applied to 84
medio-lateral oblique mammograms from the Mini-MIAS database.
Evaluation of the detected breast boundary was performed based upon the
percentage of false-positive and false-negative pixels determined by a
quantitative comparison between the contours identified by a
radiologist and those identified by the proposed method. The average
false positive and false negative rates were 0.41% and 0.58%,
respectively. The two radiologists who evaluated the results considered
the segmentation results to be acceptable for CAD purposes.
|
1205. | Hamarneh, G, and Gustavsson, T, "Deformable spatio-temporal shape models: extending active shape models to 2D+time," IMAGE AND VISION COMPUTING, vol. 22, pp. 461-470, 2004.
Abstract:
This paper extends 2D active shape models to 2D + time by presenting a
method for modeling and segmenting spatio-temporal shapes (ST-shapes).
The modeling part consists of constructing a statistical model of
ST-shape parameters. This model describes the principal modes of
variation of the ST-shape in addition to constraints on the allowed
variations. An active approach is used in segmentation where an initial
ST-shape is deformed to better fit the data and the optimal proposed
deformation is calculated using dynamic programming. Segmentation
results on both synthetic and real data are presented. (C) 2003
Elsevier B.V. All rights reserved.
|
1206. | Schroedl, S, Wagstaff, K, Rogers, S, Langley, P, and Wilson, C, "Mining GPS traces for map refinement," DATA MINING AND KNOWLEDGE DISCOVERY, vol. 9, pp. 59-87, 2004.
Abstract:
Despite the increasing popularity of route guidance systems, current
digital maps are still inadequate for many advanced applications in
automotive safety and convenience. Among the drawbacks are the
insufficient accuracy of road geometry and the lack of fine-grained
information, such as lane positions and intersection structure. In this
paper, we present an approach to induce high-precision maps from traces
of vehicles equipped with differential GPS receivers. Since the cost of
these systems is rapidly decreasing and wireless technology is
advancing to provide the communication infrastructure, we expect that
in the next few years large amounts of car data will be available
inexpensively. Our approach consists of successive processing steps:
individual vehicle trajectories are divided into road segments and
intersections; a road centerline is derived for each segment; lane
positions are determined by clustering the perpendicular offsets from
it; and the transitions of traces between segments are utilized in the
generation of intersection models. This paper describes an approach to
this complex data-mining task in a contiguous manner. Among the new
contributions are a spatial clustering algorithm for inferring the
connectivity structure, more powerful lane finding algorithms that are
able to handle lane splits and merges, and an approach to inferring
detailed intersection models.
|
1207. | Gastaud, M, Barlaud, M, and Aubert, G, "Combining shape prior and statistical features for active contour segmentation," IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, vol. 14, pp. 726-734, 2004.
Abstract:
This paper deals with image and video segmentation using active
contours. The proposed variational approach is based on a criterion
featuring a shape prior allowing free-form deformation. The shape prior
is defined as a functional of the distance between the active contour
and a contour of reference. We develop the complete differentiation of
this criterion. First we propose two applications using only the shape
prior term: the first application concerns shape warping and the second
concerns video interpolation. Then the shape prior is combined with
region-based features. This general framework is applied to interactive
segmentation and face tracking on a real sequence.
|
1208. | Eveno, N, Caplier, A, and Coulon, PY, "Accurate and quasi-automatic lip tracking," IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, vol. 14, pp. 706-715, 2004.
Abstract:
Lip segmentation is an essential stage in many multimedia systems such
as videoconferencing, lip reading, or low-bit-rate coding communication
systems. In this paper, we propose an accurate and robust
quasi-automatic lip segmentation algorithm. First, the upper mouth
boundary and several characteristic points are detected in the first
frame by using a new kind of active contour: the "jumping snake."
Unlike classic snakes, it can be initialized far from the final edge
and the adjustment of its parameters is easy and intuitive. Then, to
achieve the segmentation, we propose a parametric model composed of
several cubic curves. Its high flexibility enables accurate lip contour
extraction even in the challenging case of a very asymmetric mouth.
Com-pared to existing models, it brings a significant improvement in
accuracy and realism. The segmentation in the following frames is
achieved by using an interframe tracking of the keypoints and the model
parameters. However, we show that, with a usual tracking algorithm, the
keypoints' positions become unreliable after a few frames. We therefore
propose an adjustment process that enables an accurate tracking even
after hundreds of frames. Finally, we show that the mean keypoints'
tracking errors of our algorithm are comparable to manual points'
selection errors.
|
1209. | Brea, VM, Vilarino, DL, Paasio, A, and Cabello, D, "Design of the processing core of a mixed-signal CMOS DTCNN chip for pixel-level snakes," IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, vol. 51, pp. 997-1013, 2004.
Abstract:
This paper introduces the processing core of a full-custom mixed-signal
CMOS chip intended for an active-contour-based technique, the so-called
pixel-level snakes (PLS). Among the different parameters to optimize on
the top-down design flow our methodology is focused on area. This
approach results in a single-instruction-multiple-data chip implemented
by a discrete-time cellular neural network with a correspondence
between pixel and processing element. This is the first prototype for
PLS; an integrated circuit with a 9 x 9 resolution manufactured in a
0.25-mum CMOS STMicroelectronics technology process. Awaiting for
experimental results, HSPICE simulations prove the validity of the
approach introduced here.
|
1210. | Vilarino, DL, and Rekeczky, C, "Implementation of a pixel-level snake algorithm on a CNNUM-based chip set architecture," IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, vol. 51, pp. 885-891, 2004.
Abstract:
In this paper, an on-chip implementation of the active contour
technique called pixel-level snakes is proposed. This is based on an
optimized cellular neural network (CNN) algorithm with capabilities to
support changes in the contour topology. The entire algorithm has been
implemented on a 64 x 64 CNN universal machine chip-set architecture
for which the results of the time performance measurements are given.
To illustrate the validity and capabilities of the proposed
implementation some on-chip experiments are also included.
|
1211. | Brusseau, E, de Korte, CL, Mastik, F, Schaar, J, and van der Steen, AFW, "Fully automatic luminal contour segmentation in intracoronary ultrasound imaging - A statistical approach," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 23, pp. 554-566, 2004.
Abstract:
In this paper, a fully automatic method for luminal contour
segmentation in intracoronary ultrasound imaging is introduced. Its
principle is based on a contour with a priori properties that evolves
according to the statistics of the ultrasound texture brightness, which
is generally Rayleigh distributed. The main interest of the technique
is its fully automatic character. This is insured by an initial contour
that is not set by the user, like in classical snake-based algorithms,
but estimated and, thus, adapted to each image. Its estimation combines
two pieces of information extracted from the a posteriori probability
function of the contour position: the function maximum location (or
maximum a posteriori estimator) and the first zero-crossing of its
derivative. Then, starting from the initial contour, a region of
interest is automatically selected and the process iterated until the
contour evolution can be ignored.
In vivo coronary images from 15 patients, acquired with the 20-MHz
central frequency Joined Invision ultrasound scanner, were segmented
with the developed method. Automatic contours were compared to those
manually drawn by two physicians in terms of mean absolute difference.
The results demonstrate that the error between automatic contours and
the average of manual ones is of small amplitude, and only very
slightly higher (0.099 +/- 0.032 mm) than the interexpert error (0.097
+/- 0.027 mm).
|
|
|
2005 |
1212. | Gates, J, Haseyama, M, and Kitajima, H, "A new conic section extraction approach and its applications," IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, vol. E88D, pp. 239-251, 2005.
Abstract:
This paper presents a new conic section extraction approach that can
extract all conic sections (lines, circles, ellipses, parabolas and
hyperbolas) simultaneously. This approach is faster than the
conventional approaches with a computational complexity that is O(n),
where n is the number of edge pixels, and is robust in the presence of
moderate levels of noise. It has been combined with a classification
tree to produce an offline character recognition system that is
invariant to scale, rotation, and translation. The system was tested
with synthetic images and with images scanned from real world sources
with good results.
|
1213. | Suri, J, Guo, YJ, Coad, C, Danielson, T, Elbakri, L, and Janer, R, "Image quality assessment via segmentation of breast lesion in X-ray and ultrasound phantom images from Fischer's full field digital mammography and ultrasound (FFDMUS) system," TECHNOLOGY IN CANCER RESEARCH & TREATMENT, vol. 4, pp. 83-92, 2005.
Abstract:
Fischer has been developing a fused full-field digital mammography and
ultrasound (FFDMUS) system funded by the National Institute of Health
(NIH). In FFDMUS, two sets of acquisitions are performed: 2-D X-ray and
3-D ultrasound. The segmentation of acquired lesions in phantom images
is important: (i) to assess the image quality of X-ray and ultrasound
images; (ii) to register multi-modality images; and (iii) to establish
an automatic lesion detection methodology to assist the radiologist.
In this paper we developed lesion segmentation strategies for
ultrasound and X-ray images acquired using FFDMUS. For ultrasound
lesion segmentation, a signal-to-noise (SNR)-based method was adapted.
For X-ray segmentation, we used gradient vector flow (GVF)-based
deformable model. The performance of these segmentation algorithms was
evaluated. We also performed partial volume correction (PVC) analysis
on the segmentation of ultrasound images. For X-ray lesion
segmentation, we also studied the effect of PDE smoothing on GVF's
ability to segment the lesion.
We conclude that ultrasound image qualities from FFDMUS and Hand-Held
ultrasound (HHUS) are comparable. The mean percentage error with PVC
was 4.56% (4.31%) and 6.63% (5.89%) for 5 mm lesion and 3 mm lesion
respectively. The mean average error from the segmented X-ray images
with PDE yielded an average error of 9.61%. We also tested our program
on synthetic datasets. The system was developed for Linux workstation
using C/C++.
|
1214. | Rao, M, Stough, J, Chi, YY, Muller, K, Tracton, G, Pizer, SM, and Chaney, EL, "Comparison of human and automatic segmentations of kidneys from CT images," INTERNATIONAL JOURNAL OF RADIATION ONCOLOGY BIOLOGY PHYSICS, vol. 61, pp. 954-960, 2005.
Abstract:
Purpose: A controlled observer study was conducted to compare a method
for automatic image segmentation with conventional user-guided
segmentation of right and left kidneys from planning computerized
tomographic (CT) images.
Methods and Materials: Deformable shape models called m-reps were used
to automatically segment right and left kidneys from 12 target CT
images, and the results were compared with careful manual segmentations
performed by two human experts. M-rep models were trained based on
manual segmentations from a collection of images that did not include
the targets. Segmentation using m-reps began with interactive
initialization to position the kidney model over the target kidney in
the image data. Fully automatic segmentation proceeded through two
stages at successively smaller spatial scales. At the first stage, a
global similarity transformation of the kidney model was computed to
position the model closer to the target kidney. The similarity
transformation was followed by large-scale deformations based on
principal geodesic analysis (PGA). During the second stage, the medial
atoms comprising the m-rep model were deformed one by one. This
procedure was iterated until no changes were observed. The
transformations and deformations at both stages were driven by
optimizing an objective function with two terms. One term penalized the
currently deformed m-rep by an amount proportional to its deviation
from the mean m-rep derived from PGA of the training segmentations. The
second term computed a model-to-image match term based on the goodness
of match of the trained intensity template for the currently deformed
m-rep with the corresponding intensity data in the target image. Human
and m-rep segmentations were compared using quantitative metrics
provided in a toolset called Valmet. Metrics reported in this article
include (1) percent volume overlap; (2) mean surface distance between
two segmentations; and (3) maximum surface separation (Hausdorff
distance).
Results: Averaged over all kidneys the mean surface separation was 0.12
cm, the mean Hausdorff distance was 0.99 cm, and the mean volume
overlap for human segmentations was 88.8%. Between human and m-rep
segmentations the mean surface separation was 0.18-0.19 cm, the mean
Hausdorff distance was 1.14-1.25 cm, and the mean volume overlap was
82-83%.
Conclusions: Overall in this study, the best m-rep kidney segmentations
were at least as good as careful manual slice-by-slice segmentations
performed by two experienced humans, and the worst performance was no
worse than typical segmentations from our clinical setting. The mean
surface separations for human-m-rep segmentations were slightly larger
than for human-human segmentations but still in the subvoxel range, and
volume overlap and maximum surface separation were slightly better for
human-human comparisons. These results were expected because of
experimental factors that favored comparison of the human- human
segmentations. In particular, m-rep agreement with humans appears to
have been limited largely by fundamental differences between manual
slice-by-slice and true three-dimensional segmentation, imaging
artifacts, image voxel dimensions, and the use of an m-rep model that
produced a smooth surface across the renal pelvis. (C) 2005 Elsevier
Inc.
|
1215. | Gu, HS, and Ji, Q, "Information extraction from image sequences of real-world facial expressions," MACHINE VISION AND APPLICATIONS, vol. 16, pp. 105-115, 2005.
Abstract:
Information extraction of facial expressions deals with facial-feature
detection, feature tracking, and capture of the spatiotemporal
relationships among features. It is a fundamental task in facial
expression analysis and will ultimately determine the performance of
expression recognition. For a real-world facial expression sequence,
there are three challenges: (1) detection failure of some or all facial
features due to changes in illumination and rapid head movement; (2)
non-rigid object tracking resulting from facial expression change; and
(3) feature occlusion due to out-of-plane head rotation. In this paper,
a new approach is proposed to tackle these challenges. First, we use an
active infrared (IR) illumination to reliably detect pupils under
variable lighting conditions and head orientations. The pupil positions
are then used to guide the entire information-extraction process. The
simultaneous use of a global head motion constraint and Kalman
filtering can robustly track individual facial features even in
condition of rapid head motion and significant expression change. To
handle feature occlusion, we propose a warping-based reliability
propagation method. The reliable neighbor features and the spatial
semantics among these features are used to detect and infer occluded
features through an interframe warping transformation. Experimental
results show that accurate information extraction can be achieved for
video sequences with real-world facial expressions.
|
1216. | Okada, K, Comaniciu, D, and Krishnan, A, "Robust anisotropic Gaussian fitting for volumetric characterization of pulmonary nodules in multislice CT," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 24, pp. 409-423, 2005.
Abstract:
This paper proposes a robust statistical estimation and verification
framework for characterizing the ellipsoidal (anisotropic) geometrical
structure of pulmonary nodules in the Multislice X-ray computed
tomography (CT) images. Given a marker indicating a rough location of a
target, the proposed solution estimates the target's center location,
ellipsoidal boundary approximation, volume, maximum/average diameters,
and isotropy by robustly and efficiently fitting an anisotropic
Gaussian intensity model. We propose a novel multiscale joint
segmentation and model fitting solution which extends the robust mean
shift-based analysis to the linear scale-space theory. The design is
motivated for enhancing the robustness against margin-truncation
induced by neighboring structures, data with large deviations from the
chosen model, and marker location variability. A chi-square-based
statistical verification and analytical volumetric measurement
solutions are also proposed to complement this estimation framework.
Experiments with synthetic one-dimensional and two-dimensional data
clearly demonstrate the advantage of our solution in comparison with
the gamma-normalized Laplacian approach (Linderberg, 1998) and the
standard sample estimation approach (Matei, 2001). A quasi-real-time
three-dimensional nodule characterization system is developed using
this framework and validated with two clinical data sets of
thin-section chest CT images. Our experiments with 1310 nodules
resulted in 1) robustness against intraoperator and interoperator
variability due to varying marker locations, 2) 81% correct estimation
rate, 3) 3% false acceptance and 5% false rejection rates, and 4)
correct characterization of clinically significant nonsolid
ground-glass opacity nodules. This system processes each 33-voxel
volume-of-interest by an average of 2s with a 2.4-GHz Intel CPU. Our
solution is generic and can be applied for the analysis of blob-like
structures in various other applications.
|
1217. | Sun, Y, Nelson, BJ, and Greminger, MA, "Investigating protein structure change in the zona pellucida with a microrobotic system," INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, vol. 24, pp. 211-218, 2005.
Abstract:
In this paper we present a microrobotic system that integrates
microscope vision and microforce feedback for characterizing
biomembrane mechanical properties. We describe robust visual tracing of
deformable biomembrane contours using physics-based models. A
multi-axis microelectromechanical systems based force sensor is used to
determine applied forces on biomembranes and to develop a novel
biomembrane mechanical model. By visually extracting biomembrane
deformations during loading, geometry changes can be used to estimate
applied forces using a biomembrane mechanical model and the determined
elastic modulus. Forces on a biomembrane can be visually observed and
controlled, thus creating a framework for vision and force assimilated
cell manipulation. The experimental results quantitatively describe a
stiffness increase seen in the mouse zona pellucida (ZP) after
fertilization. Understanding this stiffness increase, referred to as
"zona hardening", helps provide an understanding of ZP protein
structure development, i.e., an increase in the number of cross links
of protein ZP1 between ZP2 and ZP3 units that is conjectured to be
responsible for zona hardening. Furthermore, the system, technique, and
model presented in this paper can be applied to investigating
mechanical properties of other biomembranes and other cell types, which
has the potential to facilitate many biological studies, such as cell
injury and recovery where biomembrane mechanical property changes need
to be monitored.
|
1218. | Kang, JS, Cha, EY, and Chon, TS, "Energy minimization model for pattern extraction of the movement behavior of animals," ON THE CONVERGENCE OF BIO-INFORMATION-, ENVIRONMENTAL-, ENERGY-, SPACE- AND NANO-TECHNOLOGIES, PTS 1 AND 2, KEY ENGINEERING MATERIALS, vol. 277-279, pp. 589-594, 2005.
Abstract:
Recently, patterning and analyzing complex data of behaviors of animals
in response to external stimuli such as toxic chemicals has become
focus of attentions. In this paper, an energy minimization model to
extract the features of response behavior of chironomids under toxic
treatment is proposed, which is applied on the image of velocity
vectors. The model is based on the improved active contour model and
the variation of the energy values produced by the evolving active
contour. We attempt to implement an adaptive computational method to
characterize the changes in response behaviors of chironomids after
treatment with an insecticide, diazinon. Active contour is formed
around each collection of velocities to gradually evolve to find the
optimal boundaries of velocity collections through processes of energy
minimization. The energy minimization model effectively reveals
characteristic patterns of behavior for the treatment versus no
treatment, and identifies changes in behavioral states as the time
progressed.
|
1219. | Sluzek, A, "On moment-based local operators for detecting image patterns," IMAGE AND VISION COMPUTING, vol. 23, pp. 287-298, 2005.
Abstract:
Local operators, template matching and moments are widely used in image
processing. In this paper, they are combined into an efficient method
of designing detectors for various image patterns. The method is using
a circular window of the size corresponding to the problem
requirements. For each location of the window, moment features are used
to determine the optimum template that is subsequently matched to the
actual content of the window to produce a 'pattern intensity' map.
Theory and general recommendations are illustrated by results obtained
for exemplary patterns. The method is also briefly compared to other
techniques. (C) 2004 Elsevier B.V. All rights reserved.
|
1220. | Erkol, B, Moss, RH, Stanley, RJ, Stoecker, WV, and Hvatum, E, "Automatic lesion boundary detection in dermoscopy images using gradient vector flow snakes," SKIN RESEARCH AND TECHNOLOGY, vol. 11, pp. 17-26, 2005.
Abstract:
Background: Malignant melanoma has a good prognosis if treated early.
Dermoscopy images of pigmented lesions are most commonly taken at x 10
magnification under lighting at a low angle of incidence while the skin
is immersed in oil under a glass plate. Accurate skin lesion
segmentation from the background skin is important because some of the
features anticipated to be used for diagnosis deal with shape of the
lesion and others deal with the color of the lesion compared with the
color of the surrounding skin.
Methods: In this research, gradient vector flow (GVF) snakes are
investigated to find the border of skin lesions in dermoscopy images.
An automatic initialization method is introduced to make the skin
lesion border determination process fully automated.
Results: Skin lesion segmentation results are presented for 70 benign
and 30 melanoma skin lesion images for the GVF-based method and a color
histogram analysis technique. The average errors obtained by the
GVF-based method are lower for both the benign and melanoma image sets
than for the color histogram analysis technique based on comparison
with manually segmented lesions determined by a dermatologist.
Conclusions: The experimental results for the GVF-based method
demonstrate promise as an automated technique for skin lesion
segmentation in dermoscopy images.
|
1221. | Wang, S, Kubota, T, Siskind, JM, and Wang, J, "Salient closed boundary extraction with ratio contour," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 27, pp. 546-561, 2005.
Abstract:
We present ratio contour, a novel graph-based method for extracting
salient closed boundaries from noisy images. This method operates on a
set of boundary fragments that are produced by edge detection. Boundary
extraction identifies a subset of these fragments and connects them
sequentially to form a closed boundary with the largest saliency. We
encode the Gestalt laws of proximity and continuity in a novel
boundary-saliency measure based on the relative gap length and average
curvature when connecting fragments to form a closed boundary. This new
measure attempts to remove a possible bias toward short boundaries. We
present a polynomial-time algorithm for finding the most-salient closed
boundary. We also present supplementary preprocessing steps that
facilitate the application of ratio contour to real images. We compare
ratio contour to two closely related methods for extracting closed
boundaries: Elder and Zucker's method based on the shortest-path
algorithm and Williams and Thornber's method based on spectral analysis
and a strongly-connected-components algorithm. This comparison involves
both theoretic analysis and experimental evaluation on both synthesized
data and real images.
|
1222. | Krinidis, S, and Pitas, L, "Fast free-vibration modal analysis of 2-D physics-based deformable objects," IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 14, pp. 281-293, 2005.
Abstract:
This paper presents an accurate, very fast approach for the
deformations of two-dimensional physically based shape models
representing open and closed curves. The introduced models are much
faster than other deformable models (e.g., finite-element methods). The
approach relies on the determination of explicit deformation governing
equations that involve neither eigenvalue decomposition, nor any other
computationally intensive numerical operation. The approach was
evaluated and compared with another fast and accurate physics-based
deformable shape model, both in terms of deformation accuracy and
computation time. The conclusion is that the introduced model is
completely accurate and is deformed very fast on current personal
computers (Pentium III), achieving more than 380 contour deformations
per second.
|
1223. | Chang, RF, Wu, WJ, Moon, WK, and Chen, DR, "Automatic ultrasound segmentation and morphology based diagnosis of solid breast tumors," BREAST CANCER RESEARCH AND TREATMENT, vol. 89, pp. 179-185, 2005.
Abstract:
Ultrasound ( US) is a useful diagnostic tool to distinguish benign from
malignant masses of the breast. It is a very convenient and safe
diagnostic method. However, there is a considerable overlap benignancy
and malignancy in ultrasonic images and interpretation is subjective. A
high performance breast tumors computer-aided diagnosis ( CAD) system
can provide an accurate and reliable diagnostic second opinion for
physicians to distinguish benign breast lesions from malignant ones.
The potential of sonographic texture analysis to improve breast tumor
classifications has been demonstrated. However, the texture analysis is
system-dependent. The disadvantages of these systems which use texture
analysis to classify tumors are they usually perform well only in one
specific ultrasound system. While Morphological based US diagnosis of
breast tumor will take the advantage of nearly independent to either
the setting of US system and different US machines. In this study, the
tumors are segmented using the newly developed level set method at
first and then six morphologic features are used to distinguish the
benign and malignant cases. The support vector machine (SVM) is used to
classify the tumors. There are 210 ultrasonic images of pathologically
proven benign breast tumors from 120 patients and carcinomas from 90
patients in the ultrasonic image database. The database contains only
one image from each patient. The ultrasonic images are captured at the
largest diameter of the tumor. The images are collected consecutively
from August 1, 1999 to May 31, 2000; the patients' ages ranged from 18
to 64 years. Sonography is performed using an ATL HDI 3000 system with
a L10-5 small part transducer. In the experiment, the accuracy of SVM
with shape information for classifying malignancies is 90.95%
(191/210), the sensitivity is 88.89% (80/90), the specificity is 92.5%
(111/120), the positive predictive value is 89.89% (80/89), and the
negative predictive value is 91.74% (111/121).
|
1224. | Vilarino, DL, and Rekeczky, C, "Pixel-level snakes on the CNNUM: algorithm design, on-chip implementation and applications," INTERNATIONAL JOURNAL OF CIRCUIT THEORY AND APPLICATIONS, vol. 33, pp. 17-51, 2005.
Abstract:
In this paper, a new algorithm for the cellular active contour
technique called pixel-level snakes is proposed. The motivation is
twofold: on the one hand, a higher efficiency and flexibility in the
contour evolution towards the boundaries of interest are pursued. On
the other hand, a higher performance and suitability for its hardware
implementation onto a cellular neural network (CNN) chip-set
architecture are also required. Based on the analysis of previous
schemes the contour evolution is improved and a new approach to manage
the topological transformations is incorporated. Furthermore, new
capabilities in the contour guiding are introduced by the incorporation
of inflating/deflating terms based on the balloon forces for the
parametric active contours. The entire algorithm has been implemented
on a CNN universal machine (CNNUM) chip set architecture for which the
results of the time performance measurements are also given. To
illustrate the validity and efficiency of the new scheme several
examples are discussed including real applications from medical
imaging. Copyright (C) 2005 John Wiley Sons, Ltd.
|
1225. | Godbout, B, Ing, M, de Guise, JA, Soulez, G, and Cloutier, G, "3D elastic registration of vessel structures from IVUS data on biplane angiography," ACADEMIC RADIOLOGY, vol. 12, pp. 10-16, 2005.
Abstract:
Rationale and Objectives. Planar angiograms and intravascular
ultrasound (IVUS) imaging provide important insight for the evaluation
of atherosclerotic diseases and blood flow abnormalities. The
construction of realistic three-dimensional models is essential to
efficiently follow the progression of arterial plaque. This requires an
explicit localization of IVUS frames from angiograms. Because of the
difficulties encountered when trying to track the position of an IVUS
transducer, we propose an elastic registration approach that relies on
a virtual catheter path.
Materials and Methods. Deformable surface models of the lumen and
external wall are constructed from segmented IVUS contours. A crude
registration is obtained using a three-dimensional vessel centerline,
reconstructed from two calibrated angiograms. Robust optimization of
the virtual catheter path, position, absolute orientation, and
regulation of the external wall shape is performed until near-perfect
alignment of the back-projected silhouettes on image edges is reached.
Results. Visual assessment of the reconstructed vessels showed a good
superposition of virtual models on the angiograms. We measured a 0.4-mm
residual error value. A preliminary study of convergence properties on
15 datasets showed that initial absolute orientation may affect the
solution. However, for follow-ups, coherent solutions were found among
datasets.
Conclusion. The advantages of the virtual catheter path approach are
demonstrated. Future work will look at ways to single out the true
solution with a better use of the available information in both
modalities and additional validation studies on improved datasets.
|
1226. | Neu, CP, Hull, ML, Walton, JH, and Buonocore, MH, "MRI-Based technique for determining nonuniform deformations throughout the volume of articular cartilage explants," MAGNETIC RESONANCE IN MEDICINE, vol. 53, pp. 321-328, 2005.
Abstract:
Articular cartilage is critical to the normal function of diarthrodial
joints. Despite the importance of the tissue and the prevalence of
cartilage degeneration (e.g., osteoarthritis), the technology required
to noninvasively describe nonuniform deformations throughout the volume
of the tissue has not been available until recently. The objectives of
the work reported in this paper were to 1) describe a noninvasive
technique (termed the cartilage deformation by tag registration (CDTR)
technique) to determine nonuniform deformations in articular cartilage
explants with the use of specialized MRI tagging and image processing
methods, 2) evaluate the strain error of the CDTR technique using a
custom MRI-compatible phantom material, and 3) demonstrate the
applicability of the CDTR technique to articular cartilage by
determining 3D strain fields throughout the volume of a bovine
articular cartilage explant. A custom MRI pulse sequence was designed
to tag and image articular cartilage explants at 7 Testa in undeformed
and deformed states during the application of multiple load cycles. The
custom pulse sequence incorporated the "delays alternating with
nutations for tailored excitation" (DANTE) pulse sequence to apply
tags. This was followed by a "fast spin echo" (FSE) pulse sequence to
create images of the tags. The error analysis using the phantom
material indicated that deformations can be determined with an error,
defined as the strain precision, better than 0.83% strain. When this
technique was applied to a single articular cartilage explant loaded in
unconfined compression, hetereogeneous deformations throughout the
volume of the tissue were evident. This technique potentially can be
applied to determine normal cartilage deformations, analyze degenerated
cartilage, and evaluate cartilage surgical repair and treatment
methodologies. In addition, this technique may be applied to other soft
tissues that can be appropriately imaged by MR. (C) 2005 Wiley-Liss,
Inc.
|
1227. | Yao, AF, and Wu, CH, "An automated image-based technique for tracking sequential surface wave profiles," OCEAN ENGINEERING, vol. 32, pp. 157-173, 2005.
Abstract:
Fast-deforming steep surface wave profiles are of particular interests
to the design of marine structures and validation of numerical models.
In this paper, an improved active contour model, gradient vector flow
(GVF) snake, is adapted to automatically track sequential wave profiles
taken by a non-intrusive high-speed imager. The robustness and
efficiency of the adapted GVF snake is demonstrated through accurately
delineating temporal and spatial wave profiles of three examples,
including a spiller, a plunger, and a plunging breaker striking a
vertical cylinder. Detailed characterizations to these breaking surface
wave profiles are given. Overall, the automated adapted GVF snake
imaged-based technique is shown to be a power tool for measuring
surface wave motions and interfacial flows. (C) 2004 Elsevier Ltd. All
rights reserved.
|
1228. | Imielinska, C, and Molholt, P, "Incorporating 3D virtual anatomy into the medical curriculum," COMMUNICATIONS OF THE ACM, vol. 48, pp. 49-54, 2005.
Abstract:
Fast-deforming steep surface wave profiles are of particular interests
to the design of marine structures and validation of numerical models.
In this paper, an improved active contour model, gradient vector flow
(GVF) snake, is adapted to automatically track sequential wave profiles
taken by a non-intrusive high-speed imager. The robustness and
efficiency of the adapted GVF snake is demonstrated through accurately
delineating temporal and spatial wave profiles of three examples,
including a spiller, a plunger, and a plunging breaker striking a
vertical cylinder. Detailed characterizations to these breaking surface
wave profiles are given. Overall, the automated adapted GVF snake
imaged-based technique is shown to be a power tool for measuring
surface wave motions and interfacial flows. (C) 2004 Elsevier Ltd. All
rights reserved.
|
1229. | Martin-Fernandez, M, and Alberola-Lopez, C, "An approach for contour detection of human kidneys from ultrasound images using Markov random fields and active contours," MEDICAL IMAGE ANALYSIS, vol. 9, pp. 1-23, 2005.
Abstract:
In this paper, a novel method for the boundary detection of human
kidneys from three dimensional (3D) ultrasound (US) is proposed. The
inherent difficulty of interpretation of such images, even by a trained
expert, makes the problem unsuitable for classical methods. The method
here proposed finds the kidney contours in each slice. It is a
probabilistic Bayesian method. The prior defines a Markov field of
deformations and imposes the restriction of contour smoothness. The
likelihood function imposes a probabilistic behavior to the data,
conditioned to the contour position. This second function, which is
also Markov, uses an empirical model of distribution of the
echographical data and a function of the gradient of the data. The
model finally includes, as a volumetric extension of the prior, a term
that forces smoothness along the depth coordinate. The experiments that
have been carried out on echographies from real patients validate the
model here proposed. A sensitivity analysis of the model parameters has
also been carried out. (C) 2004 Elsevier B.V. All rights reserved.
|
1230. | Felzenszwalb, PF, "Representation and detection of deformable shapes," IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 27, pp. 208-220, 2005.
Abstract:
We describe some techniques that can be used to represent and detect
deformable shapes in images. The main difficulty with deformable
template models is the very large or infinite number of possible
nonrigid transformations of the templates. This makes the problem of
finding an optimal match of a deformable template to an image
incredibly hard. Using a new representation for deformable shapes, we
show how to efficiently find a global optimal solution to the nonrigid
matching problem. The representation is based on the description of
objects using triangulated polygons. Our matching algorithm can
minimize a large class of energy functions, making it applicable to a
wide range of problems. We present experimental results of detecting
shapes in medical images and images of natural scenes. Our method does
not depend on initialization and is very robust, yielding good matches
even in images with high clutter. We also consider the problem of
learning a nonrigid shape model for a class of objects from examples.
We show how to learn good models while constraining them to be in the
form required by the matching algorithm.
|
1231. | Bertozzi, AL, Kemp, M, and Marthaler, D, "Determining environmental boundaries: Asynchronous communication and physical scales," COOPERATIVE CONTROL, LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, vol. 309, pp. 25-42, 2005.
Abstract:
This paper considers a recently proposed model for the self-organizing,
decentralized, real-time motion planning for a swarm of homogeneous
mobile robots in a stationary environment. The model allows the robots
to cooperatively locate the boundary of a given environmental function
in two space dimensions using a combination of sensing and
communication. Starting from a partial differential equation (PDE) used
in image processing for edge detection, a finite difference
approximation provides the movement rules for each robot. We consider
physical parameters for a specific platform of underwater vehicles. We
design the algorithm to function with asynchronous communication and
noisy position information. We present numerical simulations
illustrating the stability and performance of this system.
|
1232. | Tissainayagam, P, and Suter, D, "Object tracking in image sequences using point features," PATTERN RECOGNITION, vol. 38, pp. 105-113, 2005.
Abstract:
This paper presents an object tracking technique based on the Bayesian
multiple hypothesis tracking (MHT) approach. Two algorithms, both based
on the MHT technique are combined to generate an object tracker. The
first MHT algorithm is employed for contour segmentation. The
segmentation of contours is based on an edge map. The segmented
contours are then merged to form recognisable objects. The second MHT
algorithm is used in the temporal tracking of a selected object from
the initial frame. An object is represented by key feature points that
are extracted from it. The key points (mostly corner points) are
detected using information obtained from the edge map. These key points
are then tracked through the sequence. To confirm the correctness of
the tracked key points, the location of the key points on the
trajectory are verified against the segmented object identified in each
frame. If an acceptable number of key-points lie on or near the contour
of the object in a particular frame (n-th frame), we conclude that the
selected object has been tracked (identified) successfully in frame n.
(C) 2004 Pattern Recognition Society. Published by Elsevier Ltd. All
rights reserved.
|
1233. | Goobic, AP, Tang, JS, and Acton, ST, "Image stabilization and registration for tracking cells in the microvasculature," IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, vol. 52, pp. 287-299, 2005.
Abstract:
We propose a registration system to be used for tracking cells in
intravital video microscopy that 1) stabilizes jitter-the undesired
translational displacement of frames due to respiratory movement, etc.,
and 2) registers frames in a moving field of view (FOV) to allow for
cell tracking over an extended range. For the first time, tracking of
rolling leukocytes in vivo over a moving FOV is demonstrated. In a
fixed FOV, stable background regions are located using a morphological
Approach. Template subregions are then selected from the stable regions
and matched to corresponding locations in a reference frame. We show
the effectiveness of the stabilization algorithm by using an active
contour to track 15 leukocytes previously untrackable due to jitter.
For 30 fixed FOV sequences containing rolling leukocytes, the resulting
root-mean-square error (RMSE) is less than 0.5 mum. To align frames in
a moving FOV, we, present a modified correlation approach to estimate,
the common region between two consecutive fixed FOVs. We correlate the
overlapping regions of the initial frame of the current fixed FOV and
the final frame of the previous fixed FOV to register the images in the
adjoining moving FOV. The RMSE of our moving FOV. registration
technique was less than 0.6 mum. In 10 sequences from different
venules, we were able to track 11 cells using an active contour
approach over moving FOVs.
|
1234. | Mischi, M, Kalker, AACM, and Korsten, HHM, "Cardiac image segmentation for contrast agent videodensitometry," IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, vol. 52, pp. 277-286, 2005.
Abstract:
Indicator dilution techniques are widely used in the intensive care
unit and operating room for cardiac parameter measurements. However,
the invasiveness of current techniques represents a limitation for
their clinical use. The development of stable ultrasound contrast
agents allows new applications of the indicator dilution method.
Ultrasound contrast agent dilutions permit an echographic noninvasive
measurement of cardiac output, ejection fraction, and blood volumes.
The indicator dilution curves I are measured by videodensitometry of
specific regions of interest and processed for the cardiac parameter
assessment! Therefore, the major indicator dilution imaging issue is
the detection of proper contrast videodensitometry regions that
maximize the signal-to-noise ratio of the measured indicator dilution
curves. This paper presents an automatic contour detection algorithm
for indicator dilution videodensitometry. The algorithm consists of a
radial filter combined with an outlier correction. It maximizes the
region of interest by excluding cardiac structures that act as
interference to the videodensitometric analysis. It is fast, projection
independent, and allows the simultaneous detection of multiple contours
in real time. The system is compared to manual contour definition on
both echographic and magnetic resonance images.
|
1235. | Mahfouz, MR, Hoff, WA, Komistek, RD, and Dennis, DA, "Effect of segmentation errors on 3D-to-2D registration of implant models in X-ray images," JOURNAL OF BIOMECHANICS, vol. 38, pp. 229-239, 2005.
Abstract:
In many biomedical applications, it is desirable to estimate the
three-dimensional (3D) position and orientation (pose) of a metallic
rigid object (such as a knee or hip implant) from its projection in a
two-dimensional (2D) X-ray image. If the geometry of the object is
known, as well as the details of the image formation process, then the
pose of the object with respect to the sensor can be determined. A
common method for 3D-to-2D registration is to first segment the
silhouette contour from the X-ray image; that is, identify all points
in the image that belong to the 2D silhouette and not to the
background. This segmentation step is then followed by a search for the
3D pose that will best match the observed contour with a predicted
contour.
Although the silhouette of a metallic object is often clearly visible
in an X-ray image, adjacent tissue and occlusions can make the exact
location of the silhouette contour difficult to determine in places.
Occlusion can occur when another object (such as another implant
component) partially blocks the view of the object of interest. In this
paper, we argue that common methods for segmentation can produce errors
in the location of the 2D contour, and hence errors in the resulting 3D
estimate of the pose. We show, on a typical fluoroscopy image of a knee
implant component, that interactive and automatic methods for
segmentation result in segmented contours that vary significantly. We
show how the variability in the 2D contours (quantified by two
different metrics) corresponds to variability in the 3D poses. Finally,
we illustrate how traditional segmentation methods can fail completely
in the (not uncommon) cases of images with occlusion. (C) 2004 Elsevier
Ltd. All rights reserved.
|
1236. | Ates, HF, and Orchard, MT, "An adaptive edge model in the wavelet domain for wavelet image coding," SIGNAL PROCESSING-IMAGE COMMUNICATION, vol. 20, pp. 169-185, 2005.
Abstract:
State-of-art wavelet coders owe their performance to smart ideas for
exploiting inter and intra-band dependencies of wavelet coefficients.
We claim that developing more efficient coders requires us to look at
the main source of these dependencies; i.e., highly localized
information around edges. This paper investigates the structural
relationships among wavelet coefficients based on an idealized view of
edge behavior, and proposes a simple edge model that explains the roots
of existing dependencies. We describe how the model is used to
approximate and estimate the significant wavelet coefficients.
Simulations support its relevance for understanding and analyzing edge
information. Specifically, model-based estimation within the
space-frequency quantization (SFQ) framework increases the peak
signal-to-noise ratio (PSNR) by up to 0.3dB over the original SFQ
coding algorithm. Despite being simple, the model provides valuable
insights into the problem of edge-based adaptive modeling of value and
location information in the wavelet domain. (C) 2004 Elsevier B.V. All
rights reserved.
|
1237. | Xie, J, Jiang, YF, and Tsui, HT, "Segmentation of kidney from ultrasound images based on texture and shape priors," IEEE TRANSACTIONS ON MEDICAL IMAGING, vol. 24, pp. 45-57, 2005.
Abstract:
This paper presents a novel texture and shape priors based method for
kidney segmentation in ultrasound (US) images. Texture features are
extracted by applying a bank of Gabor filters on test images through a
two-sided convolution strategy. The texture model is constructed via
estimating the parameters of a set of mixtures of half-planed Gaussians
using the expectation-maximization method. Through this texture model,
the texture similarities of areas around the segmenting curve are
measured in the inside and outside regions, respectively. We also
present an iterative segmentation framework to combine the texture
measures into the parametric shape model proposed by Leventon and
Faugeras. Segmentation is implemented by calculating the parameters of
the shape model to minimize a novel energy function. The goal of this
energy function is to partition the test image into two regions, the
inside one with high texture similarity and low texture variance, and
the outside one with high texture variance. The effectiveness of this
method is demonstrated through experimental results on both natural
images and US data compared with other image segmentation methods and
manual segmentation.
|
1238. | Shan, ZY, Ji, Q, Gajjar, A, and Reddick, WE, "A knowledge-guided active contour method of segmentation of cerebella on MR images of pediatric patients with medulloblastoma," JOURNAL OF MAGNETIC RESONANCE IMAGING, vol. 21, pp. 1-11, 2005.
Abstract:
Purpose: To develop an automated method for identification of the
cerebella on magnetic resonance (MR) images of patients with
medulloblastoma.
Materials and Methods: The method used a template constructed from 10
patients' aligned MR head images, and the contour of this template was
superimposed on the aligned data set of a given patient as the starting
contour. The starting contour was then actively adjusted to locate the
boundary of the cerebellum of the given patient. Morphologic operations
were applied to the outlined volume to generate cerebellum images. The
method was then applied to data sets of 20 other patients to generate
cerebellum images and volumetric results.
Results: Comparison of the automatically generated cerebellum images
with two sets of manually traced images showed a strong correlation
between the automatically and manually generated volumetric results
(correlation coefficient, 0.97). The average Jaccard similarities were
0.89 and 0.88 in comparison to each of two manually traced images,
respectively. The same comparisons yielded average kappa indexes of
0.94 and 0.93, respectively.
Conclusion: The method was robust and accurate for cerebellum
segmentation on MR images of patients with medulloblastoma. The method
may be applied to investigations that require segmentation and
quantitative measurement of MR images of the cerebellum.
|
|