Sparsity promoting super-resolution coverage segmentation by linear unmixing in presence of blur and noise

We present a segmentation method that estimates the relative coverage of each pixel in a sensed image by each image component. The proposed super-resolution blur-aware model (utilizes a priori knowledge of the image blur) for linear unmixing of image intensities relies on a sparsity promoting approach expressed by two main requirements: (i) minimization of Huberized total variation, providing smooth object boundaries and noise removal, and (ii) minimization of nonedge image fuzziness, responding to an assumption that imaged objects are crisp and that fuzziness is mainly due to the imaging and digitization process. Edge fuzziness due to partial coverage is allowed, enabling subpixel precise feature estimates. The segmentation is formulated as an energy minimization problem and solved by the spectral projected gradient method, utilizing a graduated nonconvexity scheme. Quantitative and qualitative evaluation on synthetic and real multichannel images confirms good performance, particularly relevant when subpixel precision in segmentation and subsequent analysis is a requirement. (C) 2019 SPIE and IS&T

Lindblad, JoakimUppsala universitet,Bildanalys och människa-datorinteraktion,Avdelningen för visuell information och interaktion,Serbian Acad Arts & Sci, Math Inst, Belgrade, Serbia(Swepub:uu)joali534 (författare)
Sladoje, NatasaUppsala universitet,Bildanalys och människa-datorinteraktion,Avdelningen för visuell information och interaktion,Serbian Acad Arts & Sci, Math Inst, Belgrade, Serbia(Swepub:uu)namat934 (författare)
Univ Novi Sad, Fac Tech Sci, Novi Sad, SerbiaBildanalys och människa-datorinteraktion (creator_code:org_t)

Om ämnet

NATURVETENSKAP: NATURVETENSKAP; och Data och informa ...; och Datorseende och ...

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.