S
Stanley Osher
Researcher at University of California, Los Angeles
Publications - 549
Citations - 112414
Stanley Osher is an academic researcher from University of California, Los Angeles. The author has contributed to research in topics: Level set method & Computer science. The author has an hindex of 114, co-authored 510 publications receiving 104028 citations. Previous affiliations of Stanley Osher include University of Minnesota & University of Innsbruck.
Papers
More filters
Journal ArticleDOI
Geometric surface processing via normal maps
TL;DR: A two-step approach to implementing geometric processing tools for surfaces by operating on the normal map of a surface and manipulating the surface to fit the processed normals, which provides for a wide range of surface processing operations, including edge-preserving smoothing and high-boost filtering.
Proceedings ArticleDOI
L1 unmixing and its application to hyperspectral image enhancement
TL;DR: The L1 unmixing model and fast computational approaches based on Bregman iteration are discussed, which are used to produce a higher resolution hyperspectral image in which each pixel is driven towards a "pure" material.
Journal ArticleDOI
Nonoscillatory high order accurate self-similar maximum principle satisfying shock capturing schemes I
Xu-Dong Liu,Stanley Osher +1 more
TL;DR: In this paper, a self-similar local maximum principle and a non-oscillatory high order accurate high-order accurate selfsimilar local maximization scheme for scalar one-dimensional initial value problems is presented.
Journal ArticleDOI
A level set formulation for the solution of the Dirichlet problem for Hamilton-Jacobi equations
TL;DR: In this paper, a level set formulation for the solution of the Hamilton Jacobi equation was presented, where u is prescribed on a set of closed bounded noncharacteristic curves, and a time dependent Hamilton-Jacobi equation was derived such that the zero level set at various time t of this solution is precisely the set of points for which u(x,y) = t.
Journal ArticleDOI
Fast Sweeping Methods for Static Hamilton--Jacobi Equations
TL;DR: A new sweeping algorithm is proposed which discretizes the Legendre transform of the numerical Hamiltonian using an explicit formula which yields the numerical solution at a grid point using only its immediate neighboring grid values and is easy to implement numerically.