Fast Local Laplacian Filters
نویسندگان
چکیده
منابع مشابه
Graph Filters and the Z-Laplacian
In network science, the interplay between dynamical processes and the underlying topologies of complex systems has led to a diverse family of models with different interpretations. In graph signal processing, this is manifested in the form of different graph shifts and their induced algebraic systems. In this paper, we propose the unifying Z-Laplacian framework, whose instances can act as graph...
متن کاملLocal Parametrizations via Laplacian Eigenfunctions
Eigenfunction methods for mapping high dimensional data sets into lower dimensional spaces are useful in a broad range of applications. In particular, a recent paper by Jones et al [2] shows that eigenfunctions of the Laplacian operator give a good local coordinate system under very general conditions. Here I outline the proof of the theorem and explore its use in cryo-electron microscopy.
متن کاملLocal smoothing effects, positivity, and Harnack inequalities for the fast p -Laplacian equation
We study qualitative and quantitative properties of local weak solutions of the fast p-Laplacian equation, ∂tu = ∆pu, with 1 < p < 2. Our main results are quantitative positivity and boundedness estimates for locally defined solutions in domains of R× [0, T ]. We combine these lower and upper bounds in different forms of intrinsic Harnack inequalities, which are new in the very fast diffusion r...
متن کاملRegularized Laplacian Estimation and Fast Eigenvector Approximation
Recently, Mahoney and Orecchia demonstrated that popular diffusion-based procedures to compute a quick approximation to the first nontrivial eigenvector of a data graph Laplacian exactly solve certain regularized Semi-Definite Programs (SDPs). In this paper, we extend that result by providing a statistical interpretation of their approximation procedure. Our interpretation will be analogous to ...
متن کاملFast Image Deconvolution using Hyper-Laplacian Priors
The heavy-tailed distribution of gradients in natural scenes have proven effective priors for a range of problems such as denoising, deblurring and super-resolution. These distributions are well modeled by a hyper-Laplacian ( p(x) ∝ e−k|x|α ) , typically with 0.5 ≤ α ≤ 0.8. However, the use of sparse distributions makes the problem non-convex and impractically slow to solve for multi-megapixel ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Graphics
سال: 2014
ISSN: 0730-0301,1557-7368
DOI: 10.1145/2629645