Erratum: The uncrowded window of object recognition
نویسندگان
چکیده
منابع مشابه
Hand movements: a window into haptic object recognition.
Two experiments establish links between desired knowledge about objects and hand movements during haptic object exploration. Experiment 1 used a matchto-sample task, in which blindfolded subjects were directed to match objects on a particular dimension (e.g., texture). Hand movements during object exploration were reliably classified as “exploratory procedures,” each procedure defined by its in...
متن کاملThe Algorithmic Aspects of Uncrowded Hypergraphs yClaudia
We consider the problem of nding deterministically a large independent set of guaranteed size in a hypergraph on n vertices and with m edges. With respect to the Turr an bound, the quality of our solutions is for hypergraphs with not too many small cycles by a logarithmic factor in the input size better. The algorithms are fast; they often have a running time of O(m) + o(n 3). Indeed, the dense...
متن کاملObject Recognition based on Local Steering Kernel and SVM
The proposed method is to recognize objects based on application of Local Steering Kernels (LSK) as Descriptors to the image patches. In order to represent the local properties of the images, patch is to be extracted where the variations occur in an image. To find the interest point, Wavelet based Salient Point detector is used. Local Steering Kernel is then applied to the resultant pixels, in ...
متن کاملThe Algorithmic Aspects of Uncrowded Hypergraphs y
We consider the problem of nding deterministically a large independent set of guaranteed size in a hypergraph on n vertices and with m edges. With respect to the Tur an bound, the quality of our solutions is for hypergraphs with not too many small cycles by a logarithmic factor in the input size better. The algorithms are fast; they often have a running time of O(m) + o(n). Indeed, the denser t...
متن کاملExtremal Uncrowded Hypergraphs
Let G be a graph with n vertices and average valence t. Turan’s theorem implies a(G) > n/(t + 1). (See Section 1 for notation.) Fix k > 1. Let G be a (k + 1)-graph with n vertices and average valence tk(k4 t + n). It is known that a(G) 2 en/t. A hypergraph is called uncrowded if it contains no cycles of length 2, 3, or 4. We prove that if G is an uncrowded (k + 1)-graph with n vertices and aver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Neuroscience
سال: 2008
ISSN: 1097-6256,1546-1726
DOI: 10.1038/nn1208-1463b