49 research outputs found
Curve evolution implementation of the Mumford-Shah functional for image segmentation, denoising, interpolation, and magnification
©2001 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or distribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.DOI: 10.1109/83.935033In 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
Non-Rigid Puzzles
Shape correspondence is a fundamental problem in computer graphics and vision, with applications in various problems including animation, texture mapping, robotic vision, medical imaging, archaeology and many more. In settings where the shapes are allowed to undergo non-rigid deformations and only partial views are available, the problem becomes very challenging. To this end, we present a non-rigid multi-part shape matching algorithm. We assume to be given a reference shape and its multiple parts undergoing a non-rigid deformation. Each of these query parts can be additionally contaminated by clutter, may overlap with other parts, and there might be missing parts or redundant ones. Our method simultaneously solves for the segmentation of the reference model, and for a dense correspondence to (subsets of) the parts. Experimental results on synthetic as well as real scans demonstrate the effectiveness of our method in dealing with this challenging matching scenario
Level Set Method for Positron Emission Tomography
In positron emission tomography (PET), a radioactive compound is injected into the body to promote a tissue-dependent emission rate.
Expectation maximization (EM) reconstruction algorithms are iterative techniques which estimate the concentration coefficients
that provide the best fitted solution, for example, a maximum likelihood estimate. In this paper, we combine the EM algorithm with a level set approach.
The level set method is used to capture the coarse scale information and the discontinuities of the concentration coefficients.
An intrinsic advantage of the level set formulation is that anatomical information can be efficiently incorporated and used in an easy and natural way.
We utilize a multiple level set formulation to represent the geometry of the objects in the scene. The proposed algorithm can be applied to any PET configuration, without major modifications
Crystal image analysis using synchrosqueezed transforms
We propose efficient algorithms based on a band-limited version of 2D
synchrosqueezed transforms to extract mesoscopic and microscopic information
from atomic crystal images. The methods analyze atomic crystal images as an
assemblage of non-overlapping segments of 2D general intrinsic mode type
functions, which are superpositions of non-linear wave-like components. In
particular, crystal defects are interpreted as the irregularity of local
energy; crystal rotations are described as the angle deviation of local wave
vectors from their references; the gradient of a crystal elastic deformation
can be obtained by a linear system generated by local wave vectors. Several
numerical examples of synthetic and real crystal images are provided to
illustrate the efficiency, robustness, and reliability of our methods.Comment: 27 pages, 17 figure