User contributions for Admin

15 February 2023

• 10:4110:41, 15 February 2023 diff hist +252‎ N David Mumford and Jayant Shah (1989) ( Image Segmentation) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1989 == Reference ==" current
• 10:4110:41, 15 February 2023 diff hist +252‎ N S.L. Horowitz and T. Pavlidis - directed split and merge ( Image Segmentation) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1974 == Reference ==" current
• 10:4110:41, 15 February 2023 diff hist +252‎ N Chen's lambda-connected segmentation ( Image Segmentation) ‎ Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1991 == Reference =="
• 10:4110:41, 15 February 2023 diff hist +252‎ N Kass; Witkin and Terzopoulos ( Image Segmentation) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1987 == Reference ==" current
• 10:4110:41, 15 February 2023 diff hist +252‎ N R. Nock and F. Nielsen Statistical Region Merging ( Image Segmentation) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2004 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N Dual clustering - Guberman ( Image Segmentation) ‎ Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2012 == Reference =="
• 10:4010:40, 15 February 2023 diff hist +252‎ N Barghout; Lauren Visual Taxometric approach ( Image Segmentation) ‎ Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2014 == Reference =="
• 10:4010:40, 15 February 2023 diff hist +252‎ N Recursive Region Splitting ( Image Segmentation) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1978 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N Linda G. Shapiro and George C. Stockman (2001) ( Image Segmentation) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2001 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +257‎ N Hanrahan–Krueger (Specular Reflection Texture Mapping) ‎ 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:4010:40, 15 February 2023 diff hist +265‎ N Ward anisotropic (Specular Reflection Texture Mapping) ‎ 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:4010:40, 15 February 2023 diff hist +252‎ N Cook–Torrance (microfacets) (Specular Reflection Texture Mapping) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1973 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N Blinn–Phong (Specular Reflection Texture Mapping) ‎ Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1977 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N Phong (Specular Reflection Texture Mapping) ‎ Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1971 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +254‎ N Westin; S. H.; Arvo; J. R.; and Torrance; K. E 1992 (Diffuse Reflection Texture Mapping) ‎ 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 ==" current
• 10:4010:40, 15 February 2023 diff hist +254‎ N Cabral; B.; Max; N.; and Springmeyer; R 1990 (Diffuse Reflection Texture Mapping) ‎ 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 ==" current
• 10:4010:40, 15 February 2023 diff hist +258‎ N Nakamae; E.; Kaneda; K.; Okamoto; T.; and Nishita 1990 (Diffuse Reflection Texture Mapping) ‎ 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 ==" current
• 10:4010:40, 15 February 2023 diff hist +254‎ N Kajiya; J. Anisotropic Reflection Models 1985 (Diffuse Reflection Texture Mapping) ‎ 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 ==" current
• 10:4010:40, 15 February 2023 diff hist +254‎ N He; X. D.; Torrance; K. E.; Sillion; 1991 (Diffuse Reflection Texture Mapping) ‎ 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 ==" current
• 10:4010:40, 15 February 2023 diff hist +254‎ N H.W.Jensen 2001 (Diffuse Reflection Texture Mapping) ‎ 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 ==" current
• 10:4010:40, 15 February 2023 diff hist +254‎ N P.Hanrahan and W.Krueger 1993 (Diffuse Reflection Texture Mapping) ‎ 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 ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N CNN Based Gatys; Leon A 2001 (Texture Synthesis Texture Synthesis) ‎ Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2001 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +303‎ N Kwatra 2003 (Texture Synthesis Texture Synthesis) ‎ 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" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N Contribution Culling (Culling Culling) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1987 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N Occlusion Culling (Culling Culling) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1986 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N Sector-Based Culling (Culling Culling) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1991 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N View frustum culling (Culling Culling) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2008 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N T. Tuytelaars and L. Van Gool 2000 (Blob Detection Feature Detection) ‎ Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2000 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N Local scale-invariant Lowe 1999 (Blob Detection Feature Detection) ‎ Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1999 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +260‎ N Y. Dufournaud; C. Schmid; and R. Horaud 2000 (Blob Detection Feature Detection) ‎ 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:4010:40, 15 February 2023 diff hist +252‎ N A. Baumberg. 2000 (Blob Detection Feature Detection) ‎ Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2000 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +262‎ N Maximally stable extremal regions Matas 2002 (Blob Detection Feature Detection) ‎ 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 ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N Lindeberg's watershed-based grey-level blob detection algorithm 1991 (Blob Detection Feature Detection) ‎ Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1991 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N Spatio-temporal Geert Willems; Tinne Tuytelaars and Luc van Gool (2008) (Blob Detection Feature Detection) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2008 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N Hessian-Laplace Mikolajczyk and Schmid 2004 (Blob Detection Feature Detection) ‎ Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2004 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N SURF Descriptor 2006 (Blob Detection Feature Detection) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2006 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N Hessain Determinant Lindeberg 1998 (Blob Detection Feature Detection) ‎ Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1998 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N Hessain Determinant Lindeberg 1994 (Blob Detection Feature Detection) ‎ Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1994 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N SIFT Algorithm Lowe 2004 (Blob Detection Feature Detection) ‎ Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2004 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N T. Lindeberg DoG 2015 (Blob Detection Feature Detection) ‎ Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2015 == Reference =="
• 10:4010:40, 15 February 2023 diff hist +252‎ N T. Lindeberg DoG 2012 (Blob Detection Feature Detection) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2012 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N Tao Luo, Zaifeng Shi and Pumeng Wang (Corner Detection Feature Detection) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2019 == Reference ==" current
• 10:4010:40, 15 February 2023 diff hist +319‎ N Geert Willems; Tinne Tuytelaars and Luc van Gool (2008) (Corner Detection Feature Detection) ‎ 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" current
• 10:4010:40, 15 February 2023 diff hist +351‎ N Trujillo and Olague 2008 (Corner Detection Feature Detection) ‎ 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&" current
• 10:4010:40, 15 February 2023 diff hist +312‎ N FAST E. Rosten and T. Drummond 2006 (Corner Detection Feature Detection) ‎ 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" current
• 10:4010:40, 15 February 2023 diff hist +262‎ N The Trajkovic and Hedley corner detector 1998 (Corner Detection Feature Detection) ‎ 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 ==" current
• 10:4010:40, 15 February 2023 diff hist +252‎ N The Wang and Brady corner detection algorithm 1995 (Corner Detection Feature Detection) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1995 == Reference ==" current
• 10:3910:39, 15 February 2023 diff hist +252‎ N Lindeberg 2005 (Corner Detection Feature Detection) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2005 == Reference ==" current
• 10:3910:39, 15 February 2023 diff hist +252‎ N T. Lindeberg and J. Garding (1997) (Corner Detection Feature Detection) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1997 == Reference ==" current
• 10:3910:39, 15 February 2023 diff hist +300‎ N Lowe (2004) (Corner Detection Feature Detection) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2004 == Reference == https://www.cs.ubc.ca/~lowe/papers/ijcv04.pdf" current