Saratov Fall Meeting 2017: Laser Physics and Photonics XVIII; And Computational Biophysics and Analysis of Biomedical Data IV 2018
DOI: 10.1117/12.2315189
|View full text |Cite
|
Sign up to set email alerts
|

MATLAB for laser speckle contrast analysis (LASCA): a practice-based approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 8 publications
0
4
0
Order By: Relevance
“…Note, our results do not call for a complete refusal of the conventional block‐partition stLASCA algorithm since the latter gives a straightforward interpretation when its user operates with a well defined spatial localization, when the target boxes are well coordinated with positions of sufficiently wide vessels. In addition, the conventional algorithm is very fast for properly chosen program realization, see for review that may be crucial for stream processing of very massive data. On the other hand, the approach proposed in this work is more flexible in the sense of larger uncertainty of target and fluctuational patterns and is better adjusted to further investigations of properties of interest in the spectral domain.…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…Note, our results do not call for a complete refusal of the conventional block‐partition stLASCA algorithm since the latter gives a straightforward interpretation when its user operates with a well defined spatial localization, when the target boxes are well coordinated with positions of sufficiently wide vessels. In addition, the conventional algorithm is very fast for properly chosen program realization, see for review that may be crucial for stream processing of very massive data. On the other hand, the approach proposed in this work is more flexible in the sense of larger uncertainty of target and fluctuational patterns and is better adjusted to further investigations of properties of interest in the spectral domain.…”
Section: Resultsmentioning
confidence: 99%
“…Computationally, such representation has some advantages for the processing two‐dimensional spatial slices to due to the availability of robust algorithms of the 2D fast Fourier transform, which may act slower that the vectorized Gaussian discrete filter but provide better accuracy. We refer to a set of tests, which compares the computational efficiency of different pure spatial filtering algorithms in Cheng et al In turn, the temporal sliding averaging is better to proceed using the direct discretization of the Gaussian filter g ( t n ) with a proper small number of nodes since such discretization does not require keeping a full 2D matrix of data in computer's RAM. Instead, one needs the number of slices equal to the length of this filter.…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations