19 citations · 54 across the 25 of their papers we have counts for
5 papers · 1 filter
Structured Sampling for Robust Euclidean Distance Geometry
Chandra Kundu, Abiy Tasissa, HanQin Cai
This paper addresses the problem of estimating the positions of points from distance measurements corrupted by sparse outliers. Specifically, we consider a setting with two types o…
Sample-Efficient Geometry Reconstruction from Euclidean Distances using Non-Convex Optimization
Ipsita Ghosh, Abiy Tasissa, Christian Kümmerle
The problem of finding suitable point embedding or geometric configurations given only Euclidean distance information of point pairs arises both as a core task and as a sub-problem…
Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees
Chandler Smith, HanQin Cai, Abiy Tasissa
The problem of determining the configuration of points from partial distance information, known as the Euclidean Distance Geometry (EDG) problem, is fundamental to many tasks in th…
Locality Regularized Reconstruction: Structured Sparsity and Delaunay Triangulations
Marshall Mueller, James M. Murphy, Abiy Tasissa
Linear representation learning is widely studied due to its conceptual simplicity and empirical utility in tasks such as compression, classification, and feature extraction. Given…
Clustering Inductive Biases with Unrolled Networks
Jonathan Huml, Abiy Tasissa, Demba Ba
The classical sparse coding (SC) model represents visual stimuli as a linear combination of a handful of learned basis functions that are Gabor-like when trained on natural image d…