4 accepted papers
Sparse coding strategies have been lauded for their parsimonious representations of data that leverage low dimensional structure. However, inference of these codes typically relies on an optimization procedure with poor computational scaling in high-dimensional problems. For example, sparse inferenc…
We develop a framework for localizing an unknown point w using paired comparisons of the form "w is closer to point x <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</sub> than to x <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http…
Tracking time-varying signals is an important task for practical systems working with large discretized domains. Under such settings, sparsity-based approaches improve tracking accuracy since typically few targets appear in the scene (i.e. few locations in the discretized space are occupied). Discre…
One method of patch clamping on brain tissue slices in vitro requires a human operator to visually track a cell's boundary and delicately make contact with a cell's membrane using a micropipette's tip. This type of patch clamping may be automated with computer vision methods; yet this is challenging…