no code implementations • 30 Jan 2024 • Saqib Qamar, Abu Imran Baba, Stéphane Verger, Magnus Andersson
Conclusion: By leveraging YOLOv8's advances, this work provides a deep learning solution to enable efficient quantification and analysis of wood cells suitable for practical applications.
no code implementations • 2 Mar 2021 • Tobias Dahlberg, Magnus Andersson
We demonstrate a method to double the collection efficiency in Laser Tweezers Raman Spectroscopy (LTRS) by collecting both the forward and back-scattered light in a single-shot multitrack measurement.
Optics Biological Physics Chemical Physics
no code implementations • 8 Jun 2017 • Alvaro Rodriquez, Hanqing Zhang, Jonatan Klaminder, Tomas Brodin, Patrik L. Andersson, Magnus Andersson
The main advantages of ToxTrac are: i) no specific knowledge of the geometry of the tracked bodies is needed; ii) processing speed, ToxTrac can operate at a rate >25 frames per second in HD videos using modern desktop computers; iii) simultaneous tracking of multiple organisms in multiple arenas; iv) integrated distortion correction and camera calibration; v) robust against false positives; vi) preservation of individual identification if crossing occurs; vii) useful statistics and heat maps in real scale are exported in: image, text and excel formats.
no code implementations • 27 Jan 2017 • Hanqing Zhang, Tim Stangner, Krister Wiklund, Alvaro Rodriguez, Magnus Andersson
We present a versatile and fast MATLAB program (UmUTracker) that automatically detects and tracks particles by analyzing video sequences acquired by either light microscopy or digital in-line holographic microscopy.
no code implementations • 11 May 2016 • Alvaro Rodriguez, Hanqing Zhang, Krister Wiklund, Tomas Brodin, Jonatan Klaminder, Patrik Andersson, Magnus Andersson
Particle tracking is common in many biophysical, ecological, and micro-fluidic applications.
no code implementations • 2 Nov 2015 • Hanqing Zhang, Krister Wiklund, Magnus Andersson
Extensive experiments using both synthetic and real images were presented and results were compared to leading state-of-the-art algorithms and showed that the proposed algorithm: are efficient in finding circles with a low number of iterations; has high rejection rate of false-positive circle candidates; and has high robustness against noise, making it adaptive and useful in many vision applications.