974 research outputs found
The Data Big Bang and the Expanding Digital Universe: High-Dimensional, Complex and Massive Data Sets in an Inflationary Epoch
Recent and forthcoming advances in instrumentation, and giant new surveys,
are creating astronomical data sets that are not amenable to the methods of
analysis familiar to astronomers. Traditional methods are often inadequate not
merely because of the size in bytes of the data sets, but also because of the
complexity of modern data sets. Mathematical limitations of familiar algorithms
and techniques in dealing with such data sets create a critical need for new
paradigms for the representation, analysis and scientific visualization (as
opposed to illustrative visualization) of heterogeneous, multiresolution data
across application domains. Some of the problems presented by the new data sets
have been addressed by other disciplines such as applied mathematics,
statistics and machine learning and have been utilized by other sciences such
as space-based geosciences. Unfortunately, valuable results pertaining to these
problems are mostly to be found only in publications outside of astronomy. Here
we offer brief overviews of a number of concepts, techniques and developments,
some "old" and some new. These are generally unknown to most of the
astronomical community, but are vital to the analysis and visualization of
complex datasets and images. In order for astronomers to take advantage of the
richness and complexity of the new era of data, and to be able to identify,
adopt, and apply new solutions, the astronomical community needs a certain
degree of awareness and understanding of the new concepts. One of the goals of
this paper is to help bridge the gap between applied mathematics, artificial
intelligence and computer science on the one side and astronomy on the other.Comment: 24 pages, 8 Figures, 1 Table. Accepted for publication: "Advances in
Astronomy, special issue "Robotic Astronomy
A Second Order Non-Smooth Variational Model for Restoring Manifold-Valued Images
We introduce a new non-smooth variational model for the restoration of
manifold-valued data which includes second order differences in the
regularization term. While such models were successfully applied for
real-valued images, we introduce the second order difference and the
corresponding variational models for manifold data, which up to now only
existed for cyclic data. The approach requires a combination of techniques from
numerical analysis, convex optimization and differential geometry. First, we
establish a suitable definition of absolute second order differences for
signals and images with values in a manifold. Employing this definition, we
introduce a variational denoising model based on first and second order
differences in the manifold setup. In order to minimize the corresponding
functional, we develop an algorithm using an inexact cyclic proximal point
algorithm. We propose an efficient strategy for the computation of the
corresponding proximal mappings in symmetric spaces utilizing the machinery of
Jacobi fields. For the n-sphere and the manifold of symmetric positive definite
matrices, we demonstrate the performance of our algorithm in practice. We prove
the convergence of the proposed exact and inexact variant of the cyclic
proximal point algorithm in Hadamard spaces. These results which are of
interest on its own include, e.g., the manifold of symmetric positive definite
matrices
Multiscale Representations for Manifold-Valued Data
We describe multiscale representations for data observed on equispaced grids and taking values in manifolds such as the sphere , the special orthogonal group , the positive definite matrices , and the Grassmann manifolds . The representations are based on the deployment of Deslauriers--Dubuc and average-interpolating pyramids "in the tangent plane" of such manifolds, using the and maps of those manifolds. The representations provide "wavelet coefficients" which can be thresholded, quantized, and scaled in much the same way as traditional wavelet coefficients. Tasks such as compression, noise removal, contrast enhancement, and stochastic simulation are facilitated by this representation. The approach applies to general manifolds but is particularly suited to the manifolds we consider, i.e., Riemannian symmetric spaces, such as , , , where the and maps are effectively computable. Applications to manifold-valued data sources of a geometric nature (motion, orientation, diffusion) seem particularly immediate. A software toolbox, SymmLab, can reproduce the results discussed in this paper
Total variation regularization for manifold-valued data
We consider total variation minimization for manifold valued data. We propose
a cyclic proximal point algorithm and a parallel proximal point algorithm to
minimize TV functionals with -type data terms in the manifold case.
These algorithms are based on iterative geodesic averaging which makes them
easily applicable to a large class of data manifolds. As an application, we
consider denoising images which take their values in a manifold. We apply our
algorithms to diffusion tensor images, interferometric SAR images as well as
sphere and cylinder valued images. For the class of Cartan-Hadamard manifolds
(which includes the data space in diffusion tensor imaging) we show the
convergence of the proposed TV minimizing algorithms to a global minimizer
Inpainting of Cyclic Data using First and Second Order Differences
Cyclic data arise in various image and signal processing applications such as
interferometric synthetic aperture radar, electroencephalogram data analysis,
and color image restoration in HSV or LCh spaces. In this paper we introduce a
variational inpainting model for cyclic data which utilizes our definition of
absolute cyclic second order differences. Based on analytical expressions for
the proximal mappings of these differences we propose a cyclic proximal point
algorithm (CPPA) for minimizing the corresponding functional. We choose
appropriate cycles to implement this algorithm in an efficient way. We further
introduce a simple strategy to initialize the unknown inpainting region.
Numerical results both for synthetic and real-world data demonstrate the
performance of our algorithm.Comment: accepted Converence Paper at EMMCVPR'1
Geometric deep learning: going beyond Euclidean data
Many scientific fields study data with an underlying structure that is a
non-Euclidean space. Some examples include social networks in computational
social sciences, sensor networks in communications, functional networks in
brain imaging, regulatory networks in genetics, and meshed surfaces in computer
graphics. In many applications, such geometric data are large and complex (in
the case of social networks, on the scale of billions), and are natural targets
for machine learning techniques. In particular, we would like to use deep
neural networks, which have recently proven to be powerful tools for a broad
range of problems from computer vision, natural language processing, and audio
analysis. However, these tools have been most successful on data with an
underlying Euclidean or grid-like structure, and in cases where the invariances
of these structures are built into networks used to model them. Geometric deep
learning is an umbrella term for emerging techniques attempting to generalize
(structured) deep neural models to non-Euclidean domains such as graphs and
manifolds. The purpose of this paper is to overview different examples of
geometric deep learning problems and present available solutions, key
difficulties, applications, and future research directions in this nascent
field
- …