944 research outputs found
Continuous Multiclass Labeling Approaches and Algorithms
We study convex relaxations of the image labeling problem on a continuous
domain with regularizers based on metric interaction potentials. The generic
framework ensures existence of minimizers and covers a wide range of
relaxations of the originally combinatorial problem. We focus on two specific
relaxations that differ in flexibility and simplicity -- one can be used to
tightly relax any metric interaction potential, while the other one only covers
Euclidean metrics but requires less computational effort. For solving the
nonsmooth discretized problem, we propose a globally convergent
Douglas-Rachford scheme, and show that a sequence of dual iterates can be
recovered in order to provide a posteriori optimality bounds. In a quantitative
comparison to two other first-order methods, the approach shows competitive
performance on synthetical and real-world images. By combining the method with
an improved binarization technique for nonstandard potentials, we were able to
routinely recover discrete solutions within 1%--5% of the global optimum for
the combinatorial image labeling problem
Optimum graph cuts for pruning binary partition trees of polarimetric SAR images
This paper investigates several optimum graph-cut techniques for pruning binary partition trees (BPTs) and their usefulness for the low-level processing of polarimetric synthetic aperture radar (PolSAR) images. BPTs group pixels to form homogeneous regions, which are hierarchically structured by inclusion in a binary tree. They provide multiple resolutions of description and easy access to subsets of regions. Once constructed, BPTs can be used for a large number of applications. Many of these applications consist in populating the tree with a specific feature and in applying a graph cut called pruning to extract a partition of the space. In this paper, different pruning examples involving the optimization of a global criterion are discussed and analyzed in the context of PolSAR images for segmentation. Through the objective evaluation of the resulting partitions by means of precision-and-recall-for-boundaries curves, the best pruning technique is identified, and the influence of the tree construction on the performances is assessed.Peer ReviewedPostprint (author's final draft
Neural-based Compression Scheme for Solar Image Data
Studying the solar system and especially the Sun relies on the data gathered
daily from space missions. These missions are data-intensive and compressing
this data to make them efficiently transferable to the ground station is a
twofold decision to make. Stronger compression methods, by distorting the data,
can increase data throughput at the cost of accuracy which could affect
scientific analysis of the data. On the other hand, preserving subtle details
in the compressed data requires a high amount of data to be transferred,
reducing the desired gains from compression. In this work, we propose a neural
network-based lossy compression method to be used in NASA's data-intensive
imagery missions. We chose NASA's SDO mission which transmits 1.4 terabytes of
data each day as a proof of concept for the proposed algorithm. In this work,
we propose an adversarially trained neural network, equipped with local and
non-local attention modules to capture both the local and global structure of
the image resulting in a better trade-off in rate-distortion (RD) compared to
conventional hand-engineered codecs. The RD variational autoencoder used in
this work is jointly trained with a channel-dependent entropy model as a shared
prior between the analysis and synthesis transforms to make the entropy coding
of the latent code more effective. Our neural image compression algorithm
outperforms currently-in-use and state-of-the-art codecs such as JPEG and
JPEG-2000 in terms of the RD performance when compressing extreme-ultraviolet
(EUV) data. As a proof of concept for use of this algorithm in SDO data
analysis, we have performed coronal hole (CH) detection using our compressed
images, and generated consistent segmentations, even at a compression rate of
bits per pixel (compared to 8 bits per pixel on the original data)
using EUV data from SDO.Comment: Accepted for publication in IEEE Transactions on Aerospace and
Electronic Systems (TAES). arXiv admin note: text overlap with
arXiv:2210.0647
Tubular Surface Evolution for Segmentation of the Cingulum Bundle From DW-MRI
Presented at the 2nd MICCAI Workshop on Mathematical Foundations of Computational Anatomy: Geometrical and Statistical Methods for Biological Shape Variability Modeling, September 6th, 2008, Kimmel Center, New York, USA.This work provides a framework for modeling and extracting the Cingulum Bundle (CB) from Diffusion-Weighted Imagery (DW-MRI) of the brain. The CB is a tube-like structure in the brain that is of potentially of tremendous importance to clinicians since it may be helpful in diagnosing Schizophrenia. This structure consists of a collection of fibers in the brain that have locally similar diffusion patterns, but vary globally. Standard region-based segmentation techniques adapted to DW-MRI are not suitable here because the diffusion pattern of the CB cannot be described by a global set of simple statistics. Active surface models extended to DW-MRI are not suitable since they allow for arbitrary deformations that give rise to unlikely shapes, which do not respect the tubular geometry of the CB. In this work, we explicitly model the CB as a tube-like surface and construct a general class of energies defined on tube-like surfaces. An example energy of our framework is optimized by a tube that encloses a region that has locally similar diffusion patterns, which differ from the diffusion patterns immediately outside. Modeling the CB as a tube-like surface is a natural shape prior. Since a tube is characterized by a center-line and a radius function, the method is reduced to a 4D (center-line plus radius) curve evolution that is computationally much less costly than an arbitrary surface evolution. The method also provides the center-line of CB, which is potentially of clinical significance
Learning the dynamics and time-recursive boundary detection of deformable objects
We propose a principled framework for recursively segmenting deformable objects across a sequence
of frames. We demonstrate the usefulness of this method on left ventricular segmentation across a cardiac
cycle. The approach involves a technique for learning the system dynamics together with methods of
particle-based smoothing as well as non-parametric belief propagation on a loopy graphical model capturing
the temporal periodicity of the heart. The dynamic system state is a low-dimensional representation
of the boundary, and the boundary estimation involves incorporating curve evolution into recursive state
estimation. By formulating the problem as one of state estimation, the segmentation at each particular
time is based not only on the data observed at that instant, but also on predictions based on past and future
boundary estimates. Although the paper focuses on left ventricle segmentation, the method generalizes
to temporally segmenting any deformable object
- …