English
Related papers

Related papers: A Maximum Likelihood Approach to Extract Polylines…

200 papers

We describe a new algorithm for the "perfect" extraction of one-dimensional spectra from two-dimensional (2D) digital images of optical fiber spectrographs, based on accurate 2D forward modeling of the raw pixel data. The algorithm is…

Instrumentation and Methods for Astrophysics · Physics 2015-05-14 Adam S. Bolton , David J. Schlegel

Unsupervised learning of depth from indoor monocular videos is challenging as the artificial environment contains many textureless regions. Fortunately, the indoor scenes are full of specific structures, such as planes and lines, which…

Computer Vision and Pattern Recognition · Computer Science 2021-10-13 Hualie Jiang , Laiyan Ding , Junjie Hu , Rui Huang

Radio propagation modeling is essential in telecommunication research, as radio channels result from complex interactions with environmental objects. Recently, Machine Learning has been attracting attention as a potential alternative to…

This paper consists of a formal analysis and one solid solution to the knot finding problem given a source polyline and a parametric curve (e.g. circular arc, ellipse or biarc). We solve the problem using both a greedy algorithm to collect…

Computational Geometry · Computer Science 2018-08-21 Honorio Salmerón Valdivieso

We consider the problem of simultaneously clustering and learning a linear representation of data lying close to a union of low-dimensional manifolds, a fundamental task in machine learning and computer vision. When the manifolds are…

Machine Learning · Computer Science 2023-08-25 Tianjiao Ding , Shengbang Tong , Kwan Ho Ryan Chan , Xili Dai , Yi Ma , Benjamin D. Haeffele

In man-made environments such as indoor scenes, when point-based 3D reconstruction fails due to the lack of texture, lines can still be detected and used to support surfaces. We present a novel method for watertight piecewise-planar surface…

Computer Vision and Pattern Recognition · Computer Science 2019-11-04 Pierre-Alain Langlois , Alexandre Boulch , Renaud Marlet

Compressed sensing (CS) is an innovative technique allowing to represent signals through a small number of their linear projections. In this paper we address the application of CS to the scenario of progressive acquisition of 2D visual…

Information Theory · Computer Science 2014-03-06 Giulio Coluccia , Enrico Magli

Camera relocalization plays a vital role in many robotics and computer vision tasks, such as global localization, recovery from tracking failure and loop closure detection. Recent random forests based methods exploit randomly sampled pixel…

Computer Vision and Pattern Recognition · Computer Science 2018-07-31 Lili Meng , Frederick Tung , James J. Little , Julien Valentin , Clarence de Silva

In many high energy experiments, the physics quantities are obtained by measuring the cross sections at a few energy points over an energy region. This was referred to as scan experiment. The optimal design of the scan experiment (how many…

High Energy Physics - Phenomenology · Physics 2015-09-22 X. H. Mo

We propose an unsupervised method for parsing large 3D scans of real-world scenes with easily-interpretable shapes. This work aims to provide a practical tool for analyzing 3D scenes in the context of aerial surveying and mapping, without…

Computer Vision and Pattern Recognition · Computer Science 2024-03-29 Romain Loiseau , Elliot Vincent , Mathieu Aubry , Loic Landrieu

We propose Panoptic Lifting, a novel approach for learning panoptic 3D volumetric representations from images of in-the-wild scenes. Once trained, our model can render color images together with 3D-consistent panoptic segmentation from…

Computer Vision and Pattern Recognition · Computer Science 2022-12-21 Yawar Siddiqui , Lorenzo Porzi , Samuel Rota Buló , Norman Müller , Matthias Nießner , Angela Dai , Peter Kontschieder

Flat surfaces captured by 3D point clouds are often used for localization, mapping, and modeling. Dense point cloud processing has high computation and memory costs making low-dimensional representations of flat surfaces such as polygons…

Computer Vision and Pattern Recognition · Computer Science 2020-07-24 Jeremy Castagno , Ella Atkins

We present an algorithm for sampling tightly confined random equilateral closed polygons in three-space which has runtime linear in the number of edges. Using symplectic geometry, sampling such polygons reduces to sampling a moment…

Geometric Topology · Mathematics 2026-05-19 Clayton Shonkwiler , Kandin Theis

When performing classification tasks, raw high dimensional features often contain redundant information, and lead to increased computational complexity and overfitting. In this paper, we assume the data samples lie on a single underlying…

Image and Video Processing · Electrical Eng. & Systems 2020-08-11 Bowen Jiang , Maohao Shen

Recent technical advances in collecting spatial data have been increasing the demand for methods to analyze large spatial datasets. The statistical analysis for these types of datasets can provide useful knowledge in various fields.…

Methodology · Statistics 2021-06-16 Toshihiro Hirano

We introduce machine learning methodology to the study of lattice polytopes. With supervised learning techniques, we predict standard properties such as volume, dual volume, reflexivity, etc, with accuracies up to 100%. We focus on 2d…

There are many practical applications that require simplification of polylines. Some of the goals are to reduce the amount of information necessary to store, improve processing time, or simplify editing. The simplification is usually done…

Computational Geometry · Computer Science 2018-12-12 Alexander Gribov

Event cameras respond primarily to edges--formed by strong gradients--and are thus particularly well-suited for line-based motion estimation. Recent work has shown that events generated by a single line each satisfy a polynomial constraint…

Computer Vision and Pattern Recognition · Computer Science 2024-09-20 Ling Gao , Daniel Gehrig , Hang Su , Davide Scaramuzza , Laurent Kneip

We present a fast algorithm for global rigid symmetry detection with approximation guarantees. The algorithm is guaranteed to find the best approximate symmetry of a given shape, to within a user-specified threshold, with very high…

Computational Geometry · Computer Science 2016-09-20 Simon Korman , Roee Litman , Shai Avidan , Alex Bronstein

Ultrasound (US) images usually contain identifying information outside the ultrasound fan area and manual annotations placed by the sonographers during exams. For those images to be exploitable in a Deep Learning framework, one needs to…

Image and Video Processing · Electrical Eng. & Systems 2021-02-04 Hind Dadoun , Hervé Delingette , Anne-Laure Rousseau , Eric de Kerviler , Nicholas Ayache