Shahar Z. Kovalsky

Shahar Z. Kovalsky

Auto-generated profile, based on publicly available information

Shahar Z. Kovalsky

Duke University

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2012
Verified
Conference Paper
Closed access
MAMica Arie-Nachimson
Mica Arie-Nachimson
SKShahar Z. Kovalsky
Shahar Z. Kovalsky
IKIra Kemelmacher-Shlizerman
Ira Kemelmacher-Shlizerman
ASAmit Singer
Amit Singer
RBRonen Basri
Ronen Basri
Multiview structure recovery from a collection of images requires the recovery of the positions and orientations of the cameras relative to a global coordinate system. Our approach recovers camera motion as a sequence of two global optimizations. First, pair wise Essential Matrices are used to recover the global rotations by applying robust optimization using either spectral or semi definite programming relaxations. Then, we directly employ feature correspondences across images to recover the global translation vectors using a linear algorithm based on a novel decomposition of the Essential Matrix. Our method is efficient and, as demonstrated in our experiments, achieves highly accurate results on collections of real images for which ground truth measurements are available.

11 July 2016 in ACM Transactions on Graphics
Verified
Journal Article
Open access
HMHaggai Maron
Haggai Maron
NDNadav Dym
Nadav Dym
IKItay Kezurer
Itay Kezurer
SKShahar Kovalsky
Shahar Kovalsky
YLYaron Lipman
Yaron Lipman
Point cloud registration is a fundamental task in computer graphics, and more specifically, in rigid and non-rigid shape matching. The rigid shape matching problem can be formulated as the problem of simultaneously aligning and labelling two point clouds in 3D so that they are as similar as possible. We name this problem the Procrustes matching (PM) problem. The non-rigid shape matching problem can be formulated as a higher dimensional PM problem using the functional maps method. High dimensional PM problems are difficult non-convex problems which currently can only be solved locally using iterative closest point (ICP) algorithms or similar methods. Good initialization is crucial for obtaining a good solution. We introduce a novel and efficient convex SDP (semidefinite programming) relaxation for the PM problem. The algorithm is guaranteed to return a correct global solution of the problem when matching two isometric shapes which are either asymmetric or bilaterally symmetric. We show our algorithm gives state of the art results on popular shape matching datasets. We also show that our algorithm gives state of the art results for anatomical classification of shapes. Finally we demonstrate the power of our method in aligning shape collections.

20 July 2017 in ACM Transactions on Graphics
Verified
Journal Article
Open access
ASAnna Shtengel
Anna Shtengel
RPRoi Poranne
Roi Poranne
OSOlga Sorkine-Hornung
Olga Sorkine-Hornung
SKShahar Z. Kovalsky
Shahar Z. Kovalsky
YLYaron Lipman
Yaron Lipman
Many algorithms on meshes require the minimization of composite objectives, i.e. , energies that are compositions of simpler parts. Canonical examples include mesh parameterization and deformation. We propose a second order optimization approach that exploits this composite structure to efficiently converge to a local minimum. Our main observation is that a convex-concave decomposition of the energy constituents is simple and readily available in many cases of practical relevance in graphics. We utilize such convex-concave decompositions to define a tight convex majorizer of the energy, which we employ as a convex second order approximation of the objective function. In contrast to existing approaches that largely use only local convexification, our method is able to take advantage of a more global view on the energy landscape. Our experiments on triangular meshes demonstrate that our approach outperforms the state of the art on standard problems in geometry processing, and potentially provide a unified framework for developing efficient geometric optimization algorithms.

3 February 2020 in Cancer Cytopathology
Verified
Journal Article
Closed access
PDF file
DRDanielle D. Elliott Range
Danielle D. Elliott Range
DDDavid Dov
David Dov
SKShahar Z. Kovalsky
Shahar Z. Kovalsky
RHRicardo Henao
Ricardo Henao
LCLarry Carin
Larry Carin
JCJonathan Cohen
Jonathan Cohen

25 September 2020 in Medical Image Analysis
Verified
Journal Article
Closed access
DDDavid Dov
David Dov
SKShahar Z. Kovalsky
Shahar Z. Kovalsky
SASerge Assaad
Serge Assaad
JCJonathan Cohen
Jonathan Cohen
DRDanielle Elliott Range
Danielle Elliott Range
LCLawrence Carin
Lawrence Carin

11 July 2016 in ACM Transactions on Graphics
Verified
Journal Article
Open access
SKShahar Z. Kovalsky
Shahar Z. Kovalsky
MGMeirav Galun
Meirav Galun
YLYaron Lipman
Yaron Lipman
We present the Accelerated Quadratic Proxy (AQP) - a simple first-order algorithm for the optimization of geometric energies defined over triangular and tetrahedral meshes. The main stumbling block of current optimization techniques used to minimize geometric energies over meshes is slow convergence due to ill-conditioning of the energies at their minima. We observe that this ill-conditioning is in large part due to a Laplacian-like term existing in these energies. Consequently, we suggest to locally use a quadratic polynomial proxy, whose Hessian is taken to be the Laplacian, in order to achieve a preconditioning effect. This already improves stability and convergence, but more importantly allows incorporating acceleration in an almost universal way, that is independent of mesh size and of the specific energy considered. Experiments with AQP show it is rather insensitive to mesh resolution and requires a nearly constant number of iterations to converge; this is in strong contrast to other popular optimization techniques used today such as Accelerated Gradient Descent and Quasi-Newton methods, e.g. , L-BFGS. We have tested AQP for mesh deformation in 2D and 3D as well as for surface parameterization, and found it to provide a considerable speedup over common baseline techniques.