Hadas Kogan
Hewlett-Packard
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Hadas Kogan.
computer vision and pattern recognition | 2009
Hadas Kogan; Ron Maurer; Renato Keshet
This paper presents a novel self-similarity based approach for the problem of vanishing point estimation in man-made scenes. A vanishing point (VP) is the convergence point of a pencil (a concurrent line set), that is a perspective projection of a corresponding parallel line set in the scene. Unlike traditional VP detection that relies on extraction and grouping of individual straight lines, our approach detects entire pencils based on a property of 1D affine-similarity between parallel cross-sections of a pencil. Our approach is not limited to real pencils. Under some conditions (normally met in man-made scenes), our method can detect pencils made of virtual lines passing through similar image features, and hence can detect VPs from repeating patterns that do not contain straight edges. We demonstrate that detecting entire pencils rather than individual lines improves the detection robustness in that it improves VP detection in challenging conditions, such as very-low resolution or weak edges, and simultaneously reduces VP false-detection rate when only a small number of lines are detectable.
international conference on image processing | 2010
Omer Barkol; Hadas Kogan; Doron Shaked; Mani Fischer
We introduce a new similarity measure that is insensitive to sub-pixel misregistration. The proposed measure is essential in some differences detection scenarios. For example, in a setting where a digital reference is compared to an image, where the imaging process introduces deformations that appear as non constant misregistration between the two images. Our goal is to ignore image differences that result from misregistration and detect only the true, albeit minute, defects. In order to define a misregistration insensitive similarity, we argue that a similarity measure must respect convex combinations. We show that the well known SSIM [1] does not hold this property and propose a modified version of SSIM that respects convex combinations. We then use this measure to define Sub-Pixel misregistration aware SSIM (SPSSIM).
Archive | 2009
Ron Maurer; Hadas Kogan; Renato Keshet
Archive | 2009
Michal Aharon; Hadas Kogan; Eliav Levi
Archive | 2009
Hadas Kogan; Ron Maurer; Renato Keshet
Archive | 2011
Omer Barkol; Hadas Kogan; Doron Shaked; Mani Fischer
Archive | 2011
Hadas Kogan
Archive | 2011
Michal Aharon; Hadas Kogan; Meirav Naaman; Lior Katz
Archive | 2017
Inbal Tadeski; Eli Hayoon; Hadas Kogan
Archive | 2014
Hadas Kogan; Inbal Tadeski