Search Results for author: Michael Lindenbaum

Found 18 papers, 6 papers with code

Assessing hierarchies by their consistent segmentations

1 code implementation11 Apr 2022 Zeev Gutman, Ritvik Vij, Laurent Najman, Michael Lindenbaum

We found that the obtainable segmentation quality varies significantly depending on the way that the segments are specified by the hierarchy elements, and that representing a segmentation with only a few hierarchy elements is often possible.

Math Segmentation

On the Minimal Recognizable Image Patch

no code implementations12 Oct 2020 Mark Fonaryov, Michael Lindenbaum

In contrast to human vision, common recognition algorithms often fail on partially occluded images.

Learning Pixel Representations for Generic Segmentation

no code implementations25 Sep 2019 Oran Shayer, Michael Lindenbaum

Our main contribution is a new method for learning a pixel-wise representation that reflects segment relatedness.

Edge Detection Segmentation +1

Seeing Things in Random-Dot Videos

no code implementations29 Jul 2019 Thomas Dagès, Michael Lindenbaum, Alfred M. Bruckstein

Humans possess an intricate and powerful visual system in order to perceive and understand the environing world.

Increasing CNN Robustness to Occlusions by Reducing Filter Support

no code implementations ICCV 2017 Elad Osherov, Michael Lindenbaum

A straightforward way to improve classification under occlusion conditions is to train the classifier using partially occluded object examples.

General Classification Object

Graph Based Over-Segmentation Methods for 3D Point Clouds

no code implementations14 Feb 2017 Yizhak Ben-Shabat, Tamar Avraham, Michael Lindenbaum, Anath Fischer

This 3D information introduces a new conceptual change that can be utilized to improve the results of over-segmentation, which uses mainly color information, and to generate clusters of points we call super-points.

Segmentation

Local Variation as a Statistical Hypothesis Test

no code implementations24 Apr 2015 Michael Baltaxe, Peter Meer, Michael Lindenbaum

The goal of image oversegmentation is to divide an image into several pieces, each of which should ideally be part of an object.

Two-sample testing

Approximating Hierarchical MV-sets for Hierarchical Clustering

no code implementations NeurIPS 2014 Assaf Glazer, Omer Weissbrod, Michael Lindenbaum, Shaul Markovitch

The goal of hierarchical clustering is to construct a cluster tree, which can be viewed as the modal structure of a density.

Clustering Density Estimation

q-OCSVM: A q-Quantile Estimator for High-Dimensional Distributions

no code implementations NeurIPS 2013 Assaf Glazer, Michael Lindenbaum, Shaul Markovitch

In this paper we introduce a novel method that can efficiently estimate a family of hierarchical dense sets in high-dimensional distributions.

Vocal Bursts Intensity Prediction

Learning High-Density Regions for a Generalized Kolmogorov-Smirnov Test in High-Dimensional Data

no code implementations NeurIPS 2012 Assaf Glazer, Michael Lindenbaum, Shaul Markovitch

We propose an efficient, generalized, nonparametric, statistical Kolmogorov-Smirnov test for detecting distributional change in high-dimensional data.

Vocal Bursts Intensity Prediction

Cannot find the paper you are looking for? You can Submit a new open access paper.