In recent years, researchers have proposed to introduce statistical shape knowledge into the levelset method in order to cope with insufficient low-level information. While these priors were shown to drastically impr...
详细信息
ISBN:
(纸本)3540293485
In recent years, researchers have proposed to introduce statistical shape knowledge into the levelset method in order to cope with insufficient low-level information. While these priors were shown to drastically improve the segmentation of images or image sequences, so far the focus has been on statistical shape priors that are time-invariant. Yet, in the context of tracking deformable objects, it is clear that certain silhouettes may become more or less likely over time. In this paper, we tackle the challenge of learning dynamical statistical models for implicitly represented shapes. We show how these can be integrated into a segmentation process in a Bayesian framework for image sequence segmentation. Experiments demonstrate that such shape priors with memory can drastically improve the segmentation of image sequences.
Current state-of-the-art methods in variational image segmentation using levelsetmethods are able to robustly segment complex textured images in an unsupervised manner. In recent work, [18,19] we have explored the p...
详细信息
ISBN:
(纸本)3540293485
Current state-of-the-art methods in variational image segmentation using levelsetmethods are able to robustly segment complex textured images in an unsupervised manner. In recent work, [18,19] we have explored the potential of AM-FM features for driving the unsupervised segmentation of a wide variety of textured images. Our first contribution in this work is at the feature extraction level, where we introduce a regularized approach to the demodulation of the AM-FM-modelled signals. By replacing the cascade of multiband filtering and subsequent differentiation with analytically derived equivalent filtering operations, increased noise-robustness can be achieved, while discretization problems in the implementation of the demodulation algorithm are alleviated. Our second contribution is based on a generative model we have recently proposed [18,20] that offers a measure related to the local prominence of a specific class of features, like edges and textures. The introduction of these measures as weighting terms in the evolution equations facilitates the fusion of different cues in a simple and efficient manner. Our systematic evaluation on the Berkeley segmentation benchmark demonstrates that this fusion method offers improved results when compared to our previous work as well as current state-of-the-art methods.
In this paper we describe a new framework for the tracking of closed curves described through implicit surface modeling. The approach proposed here enables a continuous tracking along an image sequence of deformable o...
详细信息
ISBN:
(纸本)3540293485
In this paper we describe a new framework for the tracking of closed curves described through implicit surface modeling. The approach proposed here enables a continuous tracking along an image sequence of deformable object contours. Such an approach is formalized through the minimization of a global spatio-temporal continuous cost functional stemming from a Bayesian Maximum a posteriori estimation of a Gaussian probability distribution. The resulting minimization sequence consists in a forward integration of an evolution law followed by a backward integration of an adjoint evolution model, This latter pde include also a term related to the discrepancy between the curve evolution law and a noisy observation of the curve. The efficiency of the approach is demonstrated on image sequences showing deformable objects of different natures.
作者:
Peyré, GCohen, LCNRS
CMAP UMR 7641 Ecole Polytech F-91128 Palaiseau France Univ Paris 09
CEREMADE CNRS UMR 7534 F-75775 Paris France
In this paper we present a simple modification of the Fast Marching algorithm to speed up the computation using a heuristic. This modification leads to an algorithm that is similar in spirit to the A* algorithm used i...
详细信息
ISBN:
(纸本)3540293485
In this paper we present a simple modification of the Fast Marching algorithm to speed up the computation using a heuristic. This modification leads to an algorithm that is similar in spirit to the A* algorithm used in artificial intelligence. Using a heuristic allows to extract geodesics from a single source to a single goal very quickly and with a low memory requirement. Any application that needs to compute a lot of geodesic paths can gain benefits from our algorithm. The computational saving is even more important for 3D medical images with tubular structures and for higher dimensional data.
The introduction of statistical shape knowledge into levelset based segmentation methods was shown to improve the segmentation of familiar structures in the presence of noise, clutter or partial occlusions. While mos...
详细信息
ISBN:
(纸本)9781424411795
The introduction of statistical shape knowledge into levelset based segmentation methods was shown to improve the segmentation of familiar structures in the presence of noise, clutter or partial occlusions. While most work has been focused on shape priors which are constant in time, it is clear that when tracking deformable shapes certain silhouettes may become more or less likely over time. In fact, the deformations of familiar objects such as the silhouettes of a walking person are often characterized by pronounced temporal correlations. In this paper, we propose a nonlinear dynamical shape prior for levelset based image segmentation. Specifically, we propose to approximate the temporal evolution of the eigenmodes of the levelset function by means of a mixture of autoregressive models. We detail how such shape priors "with memory" can be integrated into a variational framework for levelset segmentation. As an application, we experimentally validate that the nonlinear dynamical prior drastically improves the tracking of a person walking in different directions, despite large amounts of clutter and noise.
Many problems in image analysis and computervision involving boundaries and regions can be cast in a variational formulation. This means that m-surfaces, e.g. curves and surfaces, are determined as minimizers of func...
详细信息
In this paper we generalize the iterated refinement method, introduced by the authors in [8], to a time-continuous inverse scale-space formulation. The iterated refinement procedure yields a sequence of convex variati...
详细信息
ISBN:
(纸本)3540293485
In this paper we generalize the iterated refinement method, introduced by the authors in [8], to a time-continuous inverse scale-space formulation. The iterated refinement procedure yields a sequence of convex variational problems, evolving toward the noisy image. The inverse scale space method arises as a limit for a penalization parameter tending to zero, while the number of iteration steps tends to infinity. For the limiting flow, similar properties as for the iterated refinement procedure hold. Specifically, when a discrepancy principle is used as the stopping criterion, the error between the reconstruction and the noise-free image decreases until termination, even if only the noisy image is available and a bound on the variance of the noise is known. The inverse flow is computed directly for one-dimensional signals, yielding high quality restorations. In higher spatial dimensions, we introduce a relaxation technique using two evolution equations. These equations allow accurate, efficient and straightforward implementation.
We investigate a multiview shape reconstruction problem based on an active surface model whose geometric evolution is driven by radar measurements acquired at sparse locations. Building on our previous work in the con...
详细信息
We investigate a multiview shape reconstruction problem based on an active surface model whose geometric evolution is driven by radar measurements acquired at sparse locations. Building on our previous work in the context of variationalmethods for the reconstruction of a scene conceptualized as the graph of a function, we generalize this inversion approach for a general geometry, now described by an active surface, strongly motivated by prior variationalcomputervision approaches to multiview stereo reconstruction from camera images. While conceptually similar, use of radar echoes within a variational scheme to drive the active surface evolution requires significant changes in regularization strategies compared to prior image based methodologies for the active surface evolution to work effectively. We describe all of these aspects and how we addressed them. While our long term objective is to develop a framework capable of fusing radar as well as other image based information, in which the active surface becomes an explicit shared reference for data fusion. In this paper, we explore the reconstruction using radar as a single modality, demonstrating that the presented approach can provide reconstructions of quality comparable to those from image based methods showing great potential for further development toward data fusion.
This paper exposes a novel formulation of prior shape constraint incorporation for the levelset segmentation of objects from corrupted images. Applicable to variational frameworks, the proposed scheme consists in wei...
详细信息
ISBN:
(纸本)3540302875
This paper exposes a novel formulation of prior shape constraint incorporation for the levelset segmentation of objects from corrupted images. Applicable to variational frameworks, the proposed scheme consists in weighting the prior shape constraint by a function of time and space to overcome local minima issues of the energy functional. Pose paxameters which make the prior shape constraint invariant from global transformations are estimated by the downhill simplex algorithm, which is more tractable and robust than the traditional gradient descent. The proposed scheme is simple, easy to implement and can be generalized to any variational approach incorporating a single prior shape. Results illustrated with different kinds of images demonstrate the efficiency of the method.
In this paper, we propose a new method to integrate multiview normal fields using levelsets. In contrast with conventional normal integration algorithms used in shape from shading and photometric stereo that reconstr...
详细信息
ISBN:
(纸本)9781424411795
In this paper, we propose a new method to integrate multiview normal fields using levelsets. In contrast with conventional normal integration algorithms used in shape from shading and photometric stereo that reconstruct a 2.5D surface using a single-view normal field, our algorithm can combine multiview normal fields simultaneously and recover the full 3D shape of a target object. We formulate this multiview normal integration problem by an energy minimization framework and find an optimal solution in a least square sense using a variational technique. A levelset method is applied to solve the resultant geometric PDE that minimizes the proposed error functional. It is shown that the resultant flow is composed of the well known mean curvature and flux maximizing flows. In particular, we apply the proposed algorithm to the problem of 3D shape modelling in a multiview photometric stereo setting. Experimental results for various synthetic data show the validity of our approach.
暂无评论