Severity: Warning
Message: file_get_contents(https://...@pubfacts.com&api_key=b8daa3ad693db53b1410957c26c9a51b4908&a=1): Failed to open stream: HTTP request failed! HTTP/1.1 429 Too Many Requests
Filename: helpers/my_audit_helper.php
Line Number: 176
Backtrace:
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 176
Function: file_get_contents
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 250
Function: simplexml_load_file_from_url
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 1034
Function: getPubMedXML
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 3152
Function: GetPubMedArticleOutput_2016
File: /var/www/html/application/controllers/Detail.php
Line: 575
Function: pubMedSearch_Global
File: /var/www/html/application/controllers/Detail.php
Line: 489
Function: pubMedGetRelatedKeyword
File: /var/www/html/index.php
Line: 316
Function: require_once
Template matching algorithms represent a viable tool to locate particles in optical images. A crucial factor of the performance of these methods is the choice of the similarity measure. Recently, it was shown in [Gao and Helgeson, Opt. Express 22 (2014)] that the correlation coefficient (CC) leads to good results. Here, we introduce the mutual information (MI) as a nonlinear similarity measure and compare the performance of the MI and the CC for different noise scenarios. It turns out that the mutual information leads to superior results in the case of signal dependent noise. We propose a novel approach to estimate the velocity of particles which is applicable in imaging scenarios where the particles appear elongated due to their movement. By designing a bank of anisotropic templates supposed to fit the elongation of the particles we are able to reliably estimate their velocity and direction of motion out of a single image.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1364/OE.24.007987 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!