Blob Detection (Feature Detection)

From Algorithm Wiki
Revision as of 10:24, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Blob Detection (Feature Detection)}} == Description == The regions or points which have noticeable difference with their surroundings is called blob. Blob detection is the problem of detecting such blobs in a given image. == Related Problems == Related: Corner Detection == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! App...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Description

The regions or points which have noticeable difference with their surroundings is called blob. Blob detection is the problem of detecting such blobs in a given image.

Related Problems

Related: Corner Detection

Parameters

No parameters found.

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
T. Lindeberg DoG 2012 $O(n^{2})$ Deterministic
T. Lindeberg DoG 2015 $O(nlogn)$ Deterministic
SIFT Algorithm Lowe 2004 $O(n^{3})$ Deterministic
Hessain Determinant Lindeberg 1994 $O(n^{3})$ Deterministic
Hessain Determinant Lindeberg 1998 $O(n^{3})$ Deterministic
SURF Descriptor 2006 $O(n^{2})$ Deterministic
Hessian-Laplace Mikolajczyk and Schmid 2004 $O(n^{3})$ Deterministic
Spatio-temporal Geert Willems; Tinne Tuytelaars and Luc van Gool () 2008 $O(n^{2})$ Deterministic
Lindeberg's watershed-based grey-level blob detection algorithm 1991 $O(n^{3})$ Deterministic
Maximally stable extremal regions Matas 2002 $O(n^{2} log^{3} n)$ Deterministic
A. Baumberg. 2000 $O(n^{3})$ Deterministic
Y. Dufournaud; C. Schmid; and R. Horaud 2000 $O(n^{2} loglogn)$ Deterministic
local scale-invariant Lowe 1999 $O(n^{3})$ Deterministic
T. Tuytelaars and L. Van Gool 2000 $O(n^{3})$ Deterministic