Abstract
The results from applying two constrained nonlinear image restoration algorithms to 3D optical microscopy data are presented. Both algorithms are iterative and use a priori knowledge to impose constraints on the solutions. The first algorithm uses the positivity constraint, while the second algorithm is a combination of least-squares and the method of projection onto convex sets (POCS). The positivity and a bound on the noise level are incorporated as constraints in the latter algorithm. Both algorithms give similar results but require different numbers of iterations, the latter converging much faster. Details of computation time and convergence properties are given, along with typical images processes by both algorithms for comparison. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
