Greedy algorithms for image approximation from scattered Radon data

نویسندگان

چکیده

Positive definite kernels are powerful tools for multivariate approximation from scattered data. This contribution discusses kernel-based image Radon To this end, we use weighted the reconstruction. Moreover, propose greedy algorithms, which used to adaptively select suitable spaces. reduces complexity of resulting reconstruction method and, moreover, it improves numerical stability quite significantly.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kernel-based Image Reconstruction from Scattered Radon Data

Computerized tomography requires suitable numerical methods for the approximation of a bivariate function f from a finite set of discrete Radon data, each of whose data samples represents one line integral of f . In standard reconstruction methods, specific assumptions concerning the geometry of the Radon lines are usually made. In relevant applications of image reconstruction, however, such as...

متن کامل

Scattered data approximation of fully fuzzy data by quasi-interpolation

Fuzzy quasi-interpolations help to reduce the complexity of solving a linear system of equations compared with fuzzy interpolations. Almost all fuzzy quasi-interpolations are focused on the form of $widetilde{f}^{*}:mathbb{R}rightarrow F(mathbb{R})$ or $widetilde{f}^{*}:F(mathbb{R})rightarrow mathbb{R}$.  In this paper, we intend to offer a novel fuzzy radial basis function by the concept of so...

متن کامل

Greedy in Approximation Algorithms

The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k-extendible systems, a natural generalization of matroids, and show that a greedy algorithm is a 1 k -factor approximation for these systems. Many seemly unrelated problems fit in our framework, e.g.: b-matching, maxi...

متن کامل

Efficient approximation algorithms. Part I: approximation of unknown fault lines from scattered data

A method for the detection of fault lines of a surface only known at scattered data is presented. In particular, we use a technique for the detection of fault points, picking out and collecting in a set all the data points close to fault lines. To select these points we use a cardinal radial basis interpolation formula. Then, applying a powerful refinement technique, we discuss different method...

متن کامل

TVL1 Shape Approximation from Scattered 3D Data

With the emergence in 3D sensors such as laser scanners and 3D reconstruction from cameras, large 3D point clouds can now be sampled from physical objects within a scene. The raw 3D samples delivered by these sensors however, contain only a limite d degree of information about the environment the objects exist in, which means that further geometrical high-level modelling is essential. In additi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings in applied mathematics & mechanics

سال: 2021

ISSN: ['1617-7061']

DOI: https://doi.org/10.1002/pamm.202100223