4,071 research outputs found
Graph Spectral Image Processing
Recent advent of graph signal processing (GSP) has spurred intensive studies
of signals that live naturally on irregular data kernels described by graphs
(e.g., social networks, wireless sensor networks). Though a digital image
contains pixels that reside on a regularly sampled 2D grid, if one can design
an appropriate underlying graph connecting pixels with weights that reflect the
image structure, then one can interpret the image (or image patch) as a signal
on a graph, and apply GSP tools for processing and analysis of the signal in
graph spectral domain. In this article, we overview recent graph spectral
techniques in GSP specifically for image / video processing. The topics covered
include image compression, image restoration, image filtering and image
segmentation
The curvelet transform for image denoising
We describe approximate digital implementations of two new mathematical transforms, namely, the ridgelet transform and the curvelet transform. Our implementations offer exact reconstruction, stability against perturbations, ease of implementation, and low computational complexity. A central tool is Fourier-domain computation of an approximate digital Radon transform. We introduce a very simple interpolation in the Fourier space which takes Cartesian samples and yields samples on a rectopolar grid, which is a pseudo-polar sampling set based on a concentric squares geometry. Despite the crudeness of our interpolation, the visual performance is surprisingly good. Our ridgelet transform applies to the Radon transform a special overcomplete wavelet pyramid whose wavelets have compact support in the frequency domain. Our curvelet transform uses our ridgelet transform as a component step, and implements curvelet subbands using a filter bank of a` trous wavelet filters. Our philosophy throughout is that transforms should be overcomplete, rather than critically sampled. We apply these digital transforms to the denoising of some standard images embedded in white noise. In the tests reported here, simple thresholding of the curvelet coefficients is very competitive with "state of the art" techniques based on wavelets, including thresholding of decimated or undecimated wavelet transforms and also including tree-based Bayesian posterior mean methods. Moreover, the curvelet reconstructions exhibit higher perceptual quality than wavelet-based reconstructions, offering visually sharper images and, in particular, higher quality recovery of edges and of faint linear and curvilinear features. Existing theory for curvelet and ridgelet transforms suggests that these new approaches can outperform wavelet methods in certain image reconstruction problems. The empirical results reported here are in encouraging agreement
Nonlinear Spectral Geometry Processing via the TV Transform
We introduce a novel computational framework for digital geometry processing,
based upon the derivation of a nonlinear operator associated to the total
variation functional. Such operator admits a generalized notion of spectral
decomposition, yielding a sparse multiscale representation akin to
Laplacian-based methods, while at the same time avoiding undesirable
over-smoothing effects typical of such techniques. Our approach entails
accurate, detail-preserving decomposition and manipulation of 3D shape geometry
while taking an especially intuitive form: non-local semantic details are well
separated into different bands, which can then be filtered and re-synthesized
with a straightforward linear step. Our computational framework is flexible,
can be applied to a variety of signals, and is easily adapted to different
geometry representations, including triangle meshes and point clouds. We
showcase our method throughout multiple applications in graphics, ranging from
surface and signal denoising to detail transfer and cubic stylization.Comment: 16 pages, 20 figure
Characterizing neuromorphologic alterations with additive shape functionals
The complexity of a neuronal cell shape is known to be related to its
function. Specifically, among other indicators, a decreased complexity in the
dendritic trees of cortical pyramidal neurons has been associated with mental
retardation. In this paper we develop a procedure to address the
characterization of morphological changes induced in cultured neurons by
over-expressing a gene involved in mental retardation. Measures associated with
the multiscale connectivity, an additive image functional, are found to give a
reasonable separation criterion between two categories of cells. One category
consists of a control group and two transfected groups of neurons, and the
other, a class of cat ganglionary cells. The reported framework also identified
a trend towards lower complexity in one of the transfected groups. Such results
establish the suggested measures as an effective descriptors of cell shape
Left-invariant evolutions of wavelet transforms on the Similitude Group
Enhancement of multiple-scale elongated structures in noisy image data is
relevant for many biomedical applications but commonly used PDE-based
enhancement techniques often fail at crossings in an image. To get an overview
of how an image is composed of local multiple-scale elongated structures we
construct a multiple scale orientation score, which is a continuous wavelet
transform on the similitude group, SIM(2). Our unitary transform maps the space
of images onto a reproducing kernel space defined on SIM(2), allowing us to
robustly relate Euclidean (and scaling) invariant operators on images to
left-invariant operators on the corresponding continuous wavelet transform.
Rather than often used wavelet (soft-)thresholding techniques, we employ the
group structure in the wavelet domain to arrive at left-invariant evolutions
and flows (diffusion), for contextual crossing preserving enhancement of
multiple scale elongated structures in noisy images. We present experiments
that display benefits of our work compared to recent PDE techniques acting
directly on the images and to our previous work on left-invariant diffusions on
orientation scores defined on Euclidean motion group.Comment: 40 page
- …