no code implementations • 3 Apr 2025 • Benjy Friedmann, Michael Werman
Point cloud processing poses two fundamental challenges: establishing consistent point ordering and effectively learning fine-grained geometric features.
no code implementations • 7 Nov 2024 • Yair Bleiberg, Michael Werman
By training each block on the corresponding frequencies of the signal, we show that Fibonacci Networks can reconstruct arbitrarily high frequencies.
no code implementations • 24 Sep 2024 • Nissim Barzilay, Ofek Narinsky, Michael Werman
This paper presents a novel technique for camera calibration using a single view that incorporates a spherical mirror.
1 code implementation • 3 Oct 2023 • Yoav Arad, Michael Werman
MFAD excels in both simple and complex anomaly detection scenarios.
3 code implementations • 5 Mar 2023 • Alexander Kolpakov, Michael Werman
Robust Affine Matching with Grassmannians (RoAM) is a new algorithm to perform affine registration of point clouds.
1 code implementation • 10 Dec 2022 • Alexander Kolpakov, Michael Werman
In this note, we propose an approach to initialize the Iterative Closest Point (ICP) algorithm to match unlabelled point clouds related by rigid transformations.
1 code implementation • 3 Jul 2022 • Noam Gottlieb, Michael Werman
DNNs perform well due to their representational learning capabilities, while DTs are computationally efficient as they perform inference along one route (root-to-leaf) that is dependent on the input data.
1 code implementation • 20 Mar 2022 • Michael Soloveitchik, Michael Werman
We introduce a fully convolutional fractional scaling component, FCFS.
no code implementations • 24 Mar 2021 • Steven B. Damelin, David L. Ragozin, Michael Werman
We study a realization of motion and similarity group equivalence classes of $n\geq 1$ labeled points in $\mathbb R^k,\, k\geq 1$ as a metric space with a computable metric.
no code implementations • 26 Oct 2020 • Levi Kassel, Michael Werman
Neural networks are a powerful framework for foreground segmentation in video acquired by static cameras, segmenting moving objects from the background in a robust way in various challenging scenarios.
no code implementations • 28 Nov 2019 • Danail Brezov, Michael Werman
A basic problem in computer vision is to understand the structure of a real-world scene given several images of it.
no code implementations • 6 Mar 2019 • Tavi Halperin, Harel Cain, Ofir Bibi, Michael Werman
Digital videos such as those captured by a smartphone often exhibit exposure inconsistencies, a poorly exposed sky, or simply suffer from an uninteresting or plain looking sky.
no code implementations • 21 Dec 2018 • Erez Yahalomi, Michael Chernofsky, Michael Werman
Distal radius fractures are the most common fractures of the upper extremity in humans.
no code implementations • 5 Dec 2018 • Steven B. Damelin, David L. Ragozin, Michael Werman
We study Min-Max affine approximants of a continuous convex or concave function $f:\Delta\subset \mathbb R^k\xrightarrow{} \mathbb R$ where $\Delta$ is a convex compact subset of $\mathbb R^k$.
no code implementations • 15 Nov 2018 • Shachar Honig, Michael Werman
We present a deep network to recover pixel values lost to clipping.
no code implementations • 15 Nov 2018 • Levi Offen, Michael Werman
This paper proposes using sketch algorithms to represent the votes in Hough transforms.
no code implementations • 22 Oct 2018 • Yoni Kasten, Michael Werman
We show how it can be used to reduce the number of required points for the epipolar geometry when some information about the epipoles is available and demonstrate this with a buddy search app.
no code implementations • 29 Sep 2017 • Dokhyam Hoshen, Michael Werman
IQ tests are an accepted method for assessing human intelligence.
no code implementations • 28 Mar 2017 • Tavi Halperin, Michael Werman
In this paper we propose a new method to compute the epipolar geometry from a video stream, by exploiting the following observation: For a pixel p in Image A, all pixels corresponding to p in Image B are on the same epipolar line.
1 code implementation • 17 Sep 2016 • Marcelo Cicconet, Vighnesh Birodkar, Mads Lund, Michael Werman, Davi Geiger
We present a convolutional approach to reflection symmetry detection in 2D.
no code implementations • 26 Jul 2016 • Yoni Kasten, Gil Ben-Artzi, Shmuel Peleg, Michael Werman
Corresponding epipolar lines have similar motion barcodes, and candidate pairs of corresponding epipoar lines are found by the similarity of their motion barcodes.
no code implementations • 17 Apr 2016 • Gil Ben-Artzi, Tavi Halperin, Michael Werman, Shmuel Peleg
This paper proposes a similarity measure between lines that indicates whether two lines are corresponding epipolar lines and enables finding epipolar line correspondences as needed for the computation of epipolar geometry.
no code implementations • CVPR 2016 • Gil Ben-Artzi, Yoni Kasten, Shmuel Peleg, Michael Werman
The use of motion barcodes leads to increased speed, accuracy, and robustness in computing the epipolar geometry.
no code implementations • 29 May 2015 • Yirmeyahu Kaminski, Michael Werman
This paper is a theoretical study of the following Non-Rigid Structure from Motion problem.
no code implementations • 2 Feb 2015 • Marcelo Cicconet, Davi Geiger, Michael Werman
This paper advocates the use of complex variables to represent votes in the Hough transform for circle detection.
no code implementations • 2 Feb 2015 • Marcelo Cicconet, Davi Geiger, Michael Werman
A pair of rooted tangents -- defining a quantum triangle -- with an associated quantum wave of spin 1/2 is proposed as the primitive to represent and compute symmetry.
no code implementations • 3 Dec 2014 • Gil Ben-Artzi, Michael Werman, Shmuel Peleg
We introduce a simple and effective method for retrieval of videos showing a specific event, even when the videos of that event were captured from significantly different viewpoints.
no code implementations • CVPR 2014 • Marcelo Cicconet, Davi Geiger, Kristin C. Gunsalus, Michael Werman
We propose a data structure that captures global geometric properties in images: Histogram of Mirror Symmetry Coefficients.
no code implementations • CVPR 2013 • Elhanan Elboer, Michael Werman, Yacov Hel-Or
The graph Laplacian operator, which originated in spectral graph theory, is commonly used for learning applications such as spectral clustering and embedding.