44,815 research outputs found
Geometric Wavelet Scattering Networks on Compact Riemannian Manifolds
The Euclidean scattering transform was introduced nearly a decade ago to
improve the mathematical understanding of convolutional neural networks.
Inspired by recent interest in geometric deep learning, which aims to
generalize convolutional neural networks to manifold and graph-structured
domains, we define a geometric scattering transform on manifolds. Similar to
the Euclidean scattering transform, the geometric scattering transform is based
on a cascade of wavelet filters and pointwise nonlinearities. It is invariant
to local isometries and stable to certain types of diffeomorphisms. Empirical
results demonstrate its utility on several geometric learning tasks. Our
results generalize the deformation stability and local translation invariance
of Euclidean scattering, and demonstrate the importance of linking the used
filter structures to the underlying geometry of the data.Comment: 35 pages; 3 figures; 2 tables; v3: Revisions based on reviewer
comment
A Spectral Graph Uncertainty Principle
The spectral theory of graphs provides a bridge between classical signal
processing and the nascent field of graph signal processing. In this paper, a
spectral graph analogy to Heisenberg's celebrated uncertainty principle is
developed. Just as the classical result provides a tradeoff between signal
localization in time and frequency, this result provides a fundamental tradeoff
between a signal's localization on a graph and in its spectral domain. Using
the eigenvectors of the graph Laplacian as a surrogate Fourier basis,
quantitative definitions of graph and spectral "spreads" are given, and a
complete characterization of the feasibility region of these two quantities is
developed. In particular, the lower boundary of the region, referred to as the
uncertainty curve, is shown to be achieved by eigenvectors associated with the
smallest eigenvalues of an affine family of matrices. The convexity of the
uncertainty curve allows it to be found to within by a fast
approximation algorithm requiring typically sparse
eigenvalue evaluations. Closed-form expressions for the uncertainty curves for
some special classes of graphs are derived, and an accurate analytical
approximation for the expected uncertainty curve of Erd\H{o}s-R\'enyi random
graphs is developed. These theoretical results are validated by numerical
experiments, which also reveal an intriguing connection between diffusion
processes on graphs and the uncertainty bounds.Comment: 40 pages, 8 figure
A Vertical Channel Model of Molecular Communication based on Alcohol Molecules
The study of Molecular Communication(MC) is more and more prevalence, and
channel model of MC plays an important role in the MC System. Since different
propagation environment and modulation techniques produce different channel
model, most of the research about MC are in horizontal direction,but in nature
the communications between nano machines are in short range and some of the
information transportation are in the vertical direction, such as transpiration
of plants, biological pump in ocean, and blood transportation from heart to
brain. Therefore, this paper we propose a vertical channel model which
nano-machines communicate with each other in the vertical direction based on
pure diffusion. We first propose a vertical molecular communication model, we
mainly considered the gravity as the factor, though the channel model is also
affected by other main factors, such as the flow of the medium, the distance
between the transmitter and the receiver, the delay or sensitivity of the
transmitter and the receiver. Secondly, we set up a test-bed for this vertical
channel model, in order to verify the difference between the theory result and
the experiment data. At last, we use the data we get from the experiment and
the non-linear least squares method to get the parameters to make our channel
model more accurate.Comment: 5 pages,7 figures, Accepted for presentation at BICT 2015 Special
Track on Molecular Communication and Networking (MCN). arXiv admin note: text
overlap with arXiv:1311.6208 by other author
The Small World of Osteocytes: Connectomics of the Lacuno-Canalicular Network in Bone
Osteocytes and their cell processes reside in a large, interconnected network
of voids pervading the mineralized bone matrix of most vertebrates. This
osteocyte lacuno-canalicular network (OLCN) is believed to play important roles
in mechanosensing, mineral homeostasis, and for the mechanical properties of
bone. While the extracellular matrix structure of bone is extensively studied
on ultrastructural and macroscopic scales, there is a lack of quantitative
knowledge on how the cellular network is organized. Using a recently introduced
imaging and quantification approach, we analyze the OLCN in different bone
types from mouse and sheep that exhibit different degrees of structural
organization not only of the cell network but also of the fibrous matrix
deposited by the cells. We define a number of robust, quantitative measures
that are derived from the theory of complex networks. These measures enable us
to gain insights into how efficient the network is organized with regard to
intercellular transport and communication. Our analysis shows that the cell
network in regularly organized, slow-growing bone tissue from sheep is less
connected, but more efficiently organized compared to irregular and
fast-growing bone tissue from mice. On the level of statistical topological
properties (edges per node, edge length and degree distribution), both network
types are indistinguishable, highlighting that despite pronounced differences
at the tissue level, the topological architecture of the osteocyte canalicular
network at the subcellular level may be independent of species and bone type.
Our results suggest a universal mechanism underlying the self-organization of
individual cells into a large, interconnected network during bone formation and
mineralization
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
Characterization and Inference of Graph Diffusion Processes from Observations of Stationary Signals
Many tools from the field of graph signal processing exploit knowledge of the
underlying graph's structure (e.g., as encoded in the Laplacian matrix) to
process signals on the graph. Therefore, in the case when no graph is
available, graph signal processing tools cannot be used anymore. Researchers
have proposed approaches to infer a graph topology from observations of signals
on its nodes. Since the problem is ill-posed, these approaches make
assumptions, such as smoothness of the signals on the graph, or sparsity
priors. In this paper, we propose a characterization of the space of valid
graphs, in the sense that they can explain stationary signals. To simplify the
exposition in this paper, we focus here on the case where signals were i.i.d.
at some point back in time and were observed after diffusion on a graph. We
show that the set of graphs verifying this assumption has a strong connection
with the eigenvectors of the covariance matrix, and forms a convex set. Along
with a theoretical study in which these eigenvectors are assumed to be known,
we consider the practical case when the observations are noisy, and
experimentally observe how fast the set of valid graphs converges to the set
obtained when the exact eigenvectors are known, as the number of observations
grows. To illustrate how this characterization can be used for graph recovery,
we present two methods for selecting a particular point in this set under
chosen criteria, namely graph simplicity and sparsity. Additionally, we
introduce a measure to evaluate how much a graph is adapted to signals under a
stationarity assumption. Finally, we evaluate how state-of-the-art methods
relate to this framework through experiments on a dataset of temperatures.Comment: Submitted to IEEE Transactions on Signal and Information Processing
over Network
- âŠ