New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 10:41, 15 February 2023 Geman and Geman Markov random fields ( Image Segmentation) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1984 == Reference ==")
- 10:41, 15 February 2023 David Mumford and Jayant Shah (1989) ( Image Segmentation) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1989 == Reference ==")
- 10:41, 15 February 2023 S.L. Horowitz and T. Pavlidis - directed split and merge ( Image Segmentation) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1974 == Reference ==")
- 10:41, 15 February 2023 Chen's lambda-connected segmentation ( Image Segmentation) (hist | edit) [255 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1991 == Reference ==")
- 10:41, 15 February 2023 Kass; Witkin and Terzopoulos ( Image Segmentation) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1987 == Reference ==")
- 10:41, 15 February 2023 R. Nock and F. Nielsen Statistical Region Merging ( Image Segmentation) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2004 == Reference ==")
- 10:40, 15 February 2023 Dual clustering - Guberman ( Image Segmentation) (hist | edit) [255 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2012 == Reference ==")
- 10:40, 15 February 2023 Barghout; Lauren Visual Taxometric approach ( Image Segmentation) (hist | edit) [255 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2014 == Reference ==")
- 10:40, 15 February 2023 Recursive Region Splitting ( Image Segmentation) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1978 == Reference ==")
- 10:40, 15 February 2023 Linda G. Shapiro and George C. Stockman (2001) ( Image Segmentation) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2001 == Reference ==")
- 10:40, 15 February 2023 Hanrahan–Krueger (Specular Reflection Texture Mapping) (hist | edit) [259 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2} logn)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1995 == Reference ==")
- 10:40, 15 February 2023 Ward anisotropic (Specular Reflection Texture Mapping) (hist | edit) [268 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{1.67} log^{2} n)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1989 == Reference ==")
- 10:40, 15 February 2023 Cook–Torrance (microfacets) (Specular Reflection Texture Mapping) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1973 == Reference ==")
- 10:40, 15 February 2023 Blinn–Phong (Specular Reflection Texture Mapping) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1977 == Reference ==")
- 10:40, 15 February 2023 Phong (Specular Reflection Texture Mapping) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1971 == Reference ==")
- 10:40, 15 February 2023 Westin; S. H.; Arvo; J. R.; and Torrance; K. E 1992 (Diffuse Reflection Texture Mapping) (hist | edit) [254 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(k n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1992 == Reference ==")
- 10:40, 15 February 2023 Cabral; B.; Max; N.; and Springmeyer; R 1990 (Diffuse Reflection Texture Mapping) (hist | edit) [254 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(k n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1990 == Reference ==")
- 10:40, 15 February 2023 Nakamae; E.; Kaneda; K.; Okamoto; T.; and Nishita 1990 (Diffuse Reflection Texture Mapping) (hist | edit) [258 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(k^{3} n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1990 == Reference ==")
- 10:40, 15 February 2023 Kajiya; J. Anisotropic Reflection Models 1985 (Diffuse Reflection Texture Mapping) (hist | edit) [254 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(k n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1985 == Reference ==")
- 10:40, 15 February 2023 He; X. D.; Torrance; K. E.; Sillion; 1991 (Diffuse Reflection Texture Mapping) (hist | edit) [254 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(k n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1991 == Reference ==")
- 10:40, 15 February 2023 H.W.Jensen 2001 (Diffuse Reflection Texture Mapping) (hist | edit) [254 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(k^{3} n)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2001 == Reference ==")
- 10:40, 15 February 2023 P.Hanrahan and W.Krueger 1993 (Diffuse Reflection Texture Mapping) (hist | edit) [254 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(k n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1993 == Reference ==")
- 10:40, 15 February 2023 CNN Based Gatys; Leon A 2001 (Texture Synthesis Texture Synthesis) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2001 == Reference ==")
- 10:40, 15 February 2023 Kwatra 2003 (Texture Synthesis Texture Synthesis) (hist | edit) [303 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2003 == Reference == https://dl.acm.org/doi/abs/10.1145/882262.882264")
- 10:40, 15 February 2023 Contribution Culling (Culling Culling) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1987 == Reference ==")
- 10:40, 15 February 2023 Occlusion Culling (Culling Culling) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1986 == Reference ==")
- 10:40, 15 February 2023 Sector-Based Culling (Culling Culling) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1991 == Reference ==")
- 10:40, 15 February 2023 View frustum culling (Culling Culling) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2008 == Reference ==")
- 10:40, 15 February 2023 T. Tuytelaars and L. Van Gool 2000 (Blob Detection Feature Detection) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2000 == Reference ==")
- 10:40, 15 February 2023 Local scale-invariant Lowe 1999 (Blob Detection Feature Detection) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1999 == Reference ==")
- 10:40, 15 February 2023 Y. Dufournaud; C. Schmid; and R. Horaud 2000 (Blob Detection Feature Detection) (hist | edit) [263 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2} loglogn)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2000 == Reference ==")
- 10:40, 15 February 2023 A. Baumberg. 2000 (Blob Detection Feature Detection) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2000 == Reference ==")
- 10:40, 15 February 2023 Maximally stable extremal regions Matas 2002 (Blob Detection Feature Detection) (hist | edit) [262 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2} log^{3} n)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2002 == Reference ==")
- 10:40, 15 February 2023 Lindeberg's watershed-based grey-level blob detection algorithm 1991 (Blob Detection Feature Detection) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1991 == Reference ==")
- 10:40, 15 February 2023 Spatio-temporal Geert Willems; Tinne Tuytelaars and Luc van Gool (2008) (Blob Detection Feature Detection) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2008 == Reference ==")
- 10:40, 15 February 2023 Hessian-Laplace Mikolajczyk and Schmid 2004 (Blob Detection Feature Detection) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2004 == Reference ==")
- 10:40, 15 February 2023 SURF Descriptor 2006 (Blob Detection Feature Detection) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2006 == Reference ==")
- 10:40, 15 February 2023 Hessain Determinant Lindeberg 1998 (Blob Detection Feature Detection) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1998 == Reference ==")
- 10:40, 15 February 2023 Hessain Determinant Lindeberg 1994 (Blob Detection Feature Detection) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1994 == Reference ==")
- 10:40, 15 February 2023 SIFT Algorithm Lowe 2004 (Blob Detection Feature Detection) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2004 == Reference ==")
- 10:40, 15 February 2023 T. Lindeberg DoG 2015 (Blob Detection Feature Detection) (hist | edit) [255 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2015 == Reference ==")
- 10:40, 15 February 2023 T. Lindeberg DoG 2012 (Blob Detection Feature Detection) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2012 == Reference ==")
- 10:40, 15 February 2023 Tao Luo, Zaifeng Shi and Pumeng Wang (Corner Detection Feature Detection) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2019 == Reference ==")
- 10:40, 15 February 2023 Geert Willems; Tinne Tuytelaars and Luc van Gool (2008) (Corner Detection Feature Detection) (hist | edit) [319 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2008 == Reference == http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.471.6845")
- 10:40, 15 February 2023 Trujillo and Olague 2008 (Corner Detection Feature Detection) (hist | edit) [351 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2008 == Reference == https://www.mitpressjournals.org/doi/abs/10.1162/evco.2008.16.4.483?journalCode=evco&mobileUi=0&")
- 10:40, 15 February 2023 FAST E. Rosten and T. Drummond 2006 (Corner Detection Feature Detection) (hist | edit) [312 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2006 == Reference == https://www.edwardrosten.com/work/rosten_2006_machine.pdf")
- 10:40, 15 February 2023 The Trajkovic and Hedley corner detector 1998 (Corner Detection Feature Detection) (hist | edit) [262 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2} log^{2} n)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1998 == Reference ==")
- 10:40, 15 February 2023 The Wang and Brady corner detection algorithm 1995 (Corner Detection Feature Detection) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1995 == Reference ==")
- 10:39, 15 February 2023 Lindeberg 2005 (Corner Detection Feature Detection) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2005 == Reference ==")
- 10:39, 15 February 2023 T. Lindeberg and J. Garding (1997) (Corner Detection Feature Detection) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1997 == Reference ==")