A graph signal filtering-based approach for detection of different edge types on airborne lidar data

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In the scope of rigorous sensor fusion in kinematic laser scanning, we present a qualitative improvement of an automated retrieval method of lidar-to-lidar 3D correspondences in terms of accuracy and speed, where correspondences are locally refined shifts ...

We examine the connection of two graph parameters, the size of a minimum feedback arcs set and the acyclic disconnection. A feedback arc set of a directed graph is a subset of arcs such that after deletion the graph becomes acyclic. The acyclic disconnecti ...

Spectral algorithms are some of the main tools in optimization and inference problems on graphs. Typically, the graph is encoded as a matrix and eigenvectors and eigenvalues of the matrix are then used to solve the given graph problem. Spectral algorithms ...

A sequence sigma of p non-negative integers is unigraphic if it is the degree sequence of exactly one graph, up to isomorphism. A polyhedral graph is a 3-connected, planar graph. We investigate which sequences are unigraphic with respect to the class of po ...

Modern integrated circuits are tiny yet incredibly complex technological artifacts, composed of millions and billions of individual structures working in unison. Managing their complexity and facilitating their design drove part of the co-evolution of mode ...

Technology mapping transforms a technology-independent representation into a technology-dependent one given a library of cells. This process is performed by means of local replacements that are extracted by matching sections of the subject graph to library ...

This article focuses on spectral methods for recovering communities in temporal networks. In the case of fixed communities, spectral clustering on the simple time-aggregated graph (i.e., the weighted graph formed by the sum of the interactions over all tem ...

Translation elongation plays an important role in regulating protein concentrations in the cell, and dysregulation of this process has been linked to several human diseases. In this study, we use data from ribo-seq experiments to model ribosome densities, ...

Photometric stereo, a computer vision technique for estimating the 3D shape of objects through images captured under varying illumination conditions, has been a topic of research for nearly four decades. In its general formulation, photometric stereo is an ...

In this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems. We formally show that for large graphs and specific classes of interact ...

Orthogonal group synchronization is the problem of estimating n elements Z(1),& mldr;,Z(n) from the rxr orthogonal group given some relative measurements R-ij approximate to Z(i)Z(j)(-1). The least-squares formulation is nonconvex. To avoid its local minim ...

Patterns in nature arise from processes interacting across a continuum of spatial scales, where new relationships emerge at each level of investigation. These patterns are nested features encompassing fine-scale local patterns, such as topography and geolo ...

Volume electron microscopy is the method of choice for the in situ interrogation of cellular ultrastructure at the nanometer scale, and with the increase in large raw image datasets generated, improving computational strategies for image segmentation and s ...

Turning pass-through network architectures into iterative ones, which use their own output as input, is a well-known approach for boosting performance. In this paper, we argue that such architectures offer an additional benefit: The convergence rate of the ...

Let F be a family of n pairwise intersecting circles in the plane. We show that the number of lenses, that is convex digons, in the arrangement induced by F is at most 2n - 2. This bound is tight. Furthermore, if no two circles in F touch, then the geometr ...

Solid-State Transformers with Input-Series/Output-Parallel configuration offer a convenient solution for AC/DC conversion due to their scalability and modularity. In this configuration, each module experiences a second-order harmonic ripple caused by local ...

Graph neural networks (GNNs) have demonstrated promising performance across various chemistry-related tasks. However, conventional graphs only model the pairwise connectivity in molecules, failing to adequately represent higher order connections, such as m ...

The optical domain presents potential avenues for enhancing both computing and communication due to its inherent properties of bandwidth, parallelism, and energy efficiency. This research focuses on harnessing 3-Dimensional (3D) diffractive optics for nove ...

Graph machine learning offers a powerful framework with natural applications in scientific fields such as chemistry, biology and material sciences. By representing data as a graph, we encode the prior knowledge that the data is composed of a set of entiti ...

When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in Benjamini and Timar, using ...

A graph signal filtering-based approach for detection of different edge types on airborne lidar data

Chat with Graph Search

Generalization of point-to-point matching for rigorous optimization in kinematic laser scanning

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al

The Power of Two Matrices in Spectral Algorithms for Community Recovery

On Unigraphic Polyhedra with One Vertexof Degreep-2

Graph generative deep learning models with an application to circuit topologies

In Medio Stat Virtus: Combining Boolean and Pattern Matching

Recovering Static and Time-Varying Communities Using Persistent Edges

Towards improving full-length ribosome density prediction by bridging sequence and graph-based representations

Aggregating Spatial and Photometric Context for Photometric Stereo

Network-based kinetic models: Emergence of a statistical description of the graph topology

BENIGN LANDSCAPES OF LOW-DIMENSIONAL RELAXATIONS FOR ORTHOGONAL SYNCHRONIZATION ON GENERAL GRAPHS

At what spatial scale does natural selection operate? Using multiscale frameworks to calibrate the effects of environmental factors across landscape continuums

Modular segmentation, spatial analysis and visualization of volume electron microscopy datasets

Enabling Uncertainty Estimation in Iterative Neural Networks

A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane

Stability Analysis of Input-Series/Output-Parallel Solid-State Transformers Equipped with Second-Order Harmonic Active Power Filters

Molecular hypergraph neural networks

3D diffractive optics for linear interconnects and nonlinear processing

Equivariant Neural Architectures for Representing and Generating Graphs

A full characterization of invariant embeddability of unimodular planar graphs