Misha Kilmer

William Walker Professor of Mathematics

Tufts University
Country flagUnited States

Research Interests

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Explore related searches

Articles (3)

We introduce parametric level-set enhanced to improve reconstruction (PaLEnTIR), a significantly enhanced parametric level-set (PaLS) method addressing the restoration and reconstruction of piecewise constant objects. Our key contribution involves a unique PaLS formulation utilizing a single level-set function to restore scenes containing multi-contrast piecewise constant objects without requiring knowledge of the number of objects or their contrasts. Unlike standard PaLS methods employing radial basis functions (RBFs), our model integrates anisotropic basis functions (ABFs), thereby expanding its capacity to represent a wider class of shapes. Furthermore, PaLEnTIR streamlines the model by reducing redundancy and indeterminacy in the parameterization, resulting in improved numerical performance. We compare PaLEnTIR’s performance to state-of-the art alternatives via a diverse collection of experiments encompassing denoising, deconvolution, sparse and limited angle of view x-ray computed tomography (2D and 3D), and nonlinear diffuse optical tomography tasks using both real and simulated data sets.

Year:

2025

The Bhattacharya–Messner (BM) product (Messner and Bhattacharya, Journal of Combinatorial Theory, Series A , 55 (2), 1990) provides a means of constructing arbitrary third order tensors from triplets of lateral, frontal, and horizontal slices, the minimum number of such triples being the BM‐rank of the resulting tensor. Thus, if a given tensor can be represented by a small (relative to the dimensions of the tensor) number of triples, the resulting BM‐decomposition (BMD) offers an implicitly compressed representation of the original. In this article, we first show that grayscale surveillance video can be accurately represented by a low BM‐rank decomposition and give methods for efficiently computing this decomposition. We provide theory connecting rank‐revealing matrix factorizations to the BMD and then present a generative model that illustrates that spatio‐temporal video data can be expected to have low BM‐rank. We combine these observations to derive a regularized alternating least squares (ALS) algorithm to compute an approximate BMD of the video tensor. The algorithm is highly parallelizable requiring the solution of many small, independent linear least squares problems. We provide convergence and computational complexity analysis for the proposed algorithms. Extensive numerical results compared against the state‐of‐the‐art matrix based dynamic mode decomposition methods for surveillance video separation show our algorithms can consistently produce results with superior compression properties while simultaneously providing better separation of stationary and nonstationary features in the data. We then introduce a new type of BM‐product suitable for color video and provide an algorithm that shows an impressive ability to extract important temporal information from color video while simultaneously compressing the data.

Year:

2025

Year:

2024

Collaborators (5)

Arvind Saibaba

Associate Professor

North Carolina State University

UNITED STATES
View details

Eric de Sturler

Professor and Chair

Virginia Tech

UNITED STATES
View details

Scott MacLachlan

Professor

Memorial University of Newfoundland

CANADA
View details

Matthias Bolten

Professor for Scientific Computing and High Performance Computing

Bergische Universität Wuppertal

GERMANY
View details

Eric Miller

Professor, Secondary Appointment

Tufts University

UNITED STATES
View details