Minimum error bounded efficient ℓ1 tracker with occlusion detection

CVPR 2011 ◽  
2011 ◽  
Author(s):  
Xue Mei ◽  
Haibin Ling ◽  
Yi Wu ◽  
Erik Blasch ◽  
Li Bai
Keyword(s):  
Occlusion Detection ◽  
Minimum Error

Efficient Minimum Error Bounded Particle Resampling L1 Tracker With Occlusion Detection

2013 ◽  
Vol 22 (7) ◽  
pp. 2661-2675 ◽  
Author(s):  
Xue Mei ◽  
Haibin Ling ◽  
Yi Wu ◽  
E. P. Blasch ◽  
Li Bai
Keyword(s):  
Occlusion Detection ◽  
Minimum Error ◽  
Bounded Particle

Artificial Intelligence Based Branch Retinal Vein Occlusion Detection

2019 ◽  
Vol 7 (4) ◽  
pp. 692-698
Author(s):  
Jecko Anto Kattampally ◽  
Koshy C Oommen ◽  
Vaibhavi Patil ◽  
Pranali Choudhari
Keyword(s):  
Artificial Intelligence ◽  
Retinal Vein Occlusion ◽  
Branch Retinal Vein Occlusion ◽  
Occlusion Detection ◽  
Vein Occlusion

Prospective Evaluation of a Two-Scale Protocol for Prehospital Large Vessel Occlusion Detection

2021 ◽  
pp. 1-13
Author(s):  
Ahmad Nehme ◽  
Samantha Rivet ◽  
Thérésa J. Choisi ◽  
Mathieu Dallaire ◽  
Luc de Montigny ◽  
...  
Keyword(s):  
Large Vessel ◽  
Occlusion Detection ◽  
Prospective Evaluation ◽  
Large Vessel Occlusion ◽  
Vessel Occlusion

scholarly journals Approximated least-squares solutions of a generalized Sylvester-transpose matrix equation via gradient-descent iterative algorithm

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Adisorn Kittisopaporn ◽  
Pattrawut Chansangiam
Keyword(s):  
Least Squares ◽  
Iterative Algorithm ◽  
Gradient Descent ◽  
Main Idea ◽  
Full Column Rank ◽  
Minimum Error ◽  
Matrix Coefficients ◽  
Special Cases ◽  
Efficiency And Effectiveness ◽  
Associated Matrix

AbstractThis paper proposes an effective gradient-descent iterative algorithm for solving a generalized Sylvester-transpose equation with rectangular matrix coefficients. The algorithm is applicable for the equation and its interesting special cases when the associated matrix has full column-rank. The main idea of the algorithm is to have a minimum error at each iteration. The algorithm produces a sequence of approximated solutions converging to either the unique solution, or the unique least-squares solution when the problem has no solution. The convergence analysis points out that the algorithm converges fast for a small condition number of the associated matrix. Numerical examples demonstrate the efficiency and effectiveness of the algorithm compared to renowned and recent iterative methods.

Internal Carotid Occlusion: Detection by Direct Doppler Examination

1980 ◽  
Vol 145 (4) ◽  
pp. 239-242
Author(s):  
Paul T. McDonald ◽  
John T. Collins ◽  
Norman M. Rich ◽  
Louis Kozloff ◽  
George J. Collins ◽  
...  
Keyword(s):  
Internal Carotid ◽  
Carotid Occlusion ◽  
Occlusion Detection ◽  
Doppler Examination ◽  
Internal Carotid Occlusion
Sign in / Sign up

Export Citation Format

Share Document