Constraining by a family of strictly nonexpansive idempotent functions with applications in image reconstruction (Q2376863): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Constantin Popa / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Zhi Hua Zhang / rank
Normal rank
 

Revision as of 02:41, 11 February 2024

scientific article
Language Label Description Also known as
English
Constraining by a family of strictly nonexpansive idempotent functions with applications in image reconstruction
scientific article

    Statements

    Constraining by a family of strictly nonexpansive idempotent functions with applications in image reconstruction (English)
    0 references
    0 references
    0 references
    26 June 2013
    0 references
    The authors present the constrained version of the general iterative method which includes the algorithm of Kaczmarz, Cimmino, Jacobi projective and diagonal weighting. As an example, the authors use it to study a particular image reconstruction inverse problem arised from 3D tomographic particle image velocimetry. The idea is to seed the turbulent fluids with particles that follow the flow dynamics in a volume, capture multiple two-dimensional projections and reconstruct the 3D image. The algorithm proposed by the authors can determine in every experiment the correct number of particles and, although there are various displaced points, the obtained image are similar to the original ones.
    0 references
    image reconstruction
    0 references
    projection algorithm
    0 references
    constraining strategy
    0 references
    Kaczmarz algorithm
    0 references
    Cimmino algorithm
    0 references
    Jacobi algorithm
    0 references
    diagonal weighting algorithm
    0 references
    strictly nonexpansive functions
    0 references
    least squares problems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references