Change search
ReferencesLink to record
Permanent link

Direct link
Implementing Efficient iterative 3D Deconvolution for Microscopy
Blekinge Institute of Technology, School of Engineering, Department of Signal Processing.
2009 (English)Independent thesis Advanced level (degree of Master (One Year))Student thesisAlternative title
Implementering av effektiv iterativ 3D-avfaltning för mikroskopi (Swedish)
Abstract [en]

Both Gauss-Seidel Iterative 3D deconvolution and Richardson-Lucy like algorithms are used due to their stability and high quality results in high noise microscopic medical image processing. An approach to determine the difference between these two algorithms is presented in this paper. It is shown that the convergence rate and the quality of these two algorithms are influenced by the size of the point spread function (PSF). Larger PSF sizes causes faster convergence but this effect falls off for larger sizes . It is furthermore shown that the relaxation factor and the number of iterations are influencing the convergence rate of the two algorithms. It has been found that increasing relaxation factor and number of iterations improve convergence and can reduce the error of the deblurred image. It also found that overrelaxation converges faster than underrelaxation for small number of iterations. However, it can be achieved smaller final error with under-relaxation. The choice of underrelaxation factor and overrelaxation factor value are highly problem specific and different from one type of images. In addition, when it comes to 3D iterative deconvolution, the influence of boundary conditions for these two algorithms is discussed. Implementation aspects are discussed and it is concluded that cache memory is vital for achieving a fast implementation of iterative 3D deconvolution. A mix of the two algorithms have been developed and compared with the previously mentioned Gauss-Seidel and the Richardson-Lucy-like algorithms. The experiments indicate that, if the value of the relaxation parameter is optimized, then the Richardson-Lucy-like algorithm has the best performance for 3D iterative deconvolution.

Abstract [sv]

Upplösningen på bilder tagna med mikroskop är idag begränsad av diffraktion. För att komma runt detta förbättras bilden digitalt utifrån en matematisk modell av den fysiska processen. Den här avhandlingen jämför två algoritmer för att lösa ekvationerna: Richardson-Lucy och Gauss-Seidel. Vidare studeras effekten av parametrar såsom utbredningen av ljusspridfunktionen och regularisering av ekvationslösaren.

Place, publisher, year, edition, pages
2009. , 89 p.
Keyword [en]
Iterative 3D deconvolution, Convergence rate, Boundary conditions, Point Spread function, Relaxation factor
National Category
Mathematics Signal Processing Telecommunications
URN: urn:nbn:se:bth-4233Local ID: diva2:831562
Physics, Chemistry, Mathematics
Mobile: (0046)762778136Available from: 2015-04-22 Created: 2009-06-23 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(2447 kB)45 downloads
File information
File name FULLTEXT01.pdfFile size 2447 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
Department of Signal Processing
MathematicsSignal ProcessingTelecommunications

Search outside of DiVA

GoogleGoogle Scholar
Total: 45 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 167 hits
ReferencesLink to record
Permanent link

Direct link