Assessments of the mouse visual system based on spatial frequency analysis imply that its visual capacity is low, with few neurons responding to spatial frequencies greater than 0.5 cycles/degree. However, visuallymediated behaviors, such as prey capture, suggest that the mouse visual system is more precise. We introduce a new stimulus class-visual flow patterns-that is more like what the mouse would encounter in the natural world than are sine-wave gratings but is more tractable for analysis than are natural images. We used 128-site silicon microelectrodes to measure the simultaneous responses of single neurons in the primary visual cortex (V1) of alert mice. While holding temporal-frequency content fixed, we explored a class of drifting patterns of black or white dots that have energy only at higher spatial frequencies. These flow stimuli evoke strong visually-mediated responses well beyond those predicted by spatial frequency analysis. Flow responses predominate in higher spatial-frequency ranges (0.15-1.6 cycles/degree); many are orientation-or direction-selective; and flow responses of many neurons depend strongly on sign of contrast. Many cells exhibit distributed responses across our stimulus ensemble. Together, these results challenge conventional linear approaches to visual processing and expand our understanding of the mouse's visual capacity to behaviorally-relevant ranges.Significance Statement The visual system of the mouse is now widely studied as a model for development and disease in humans. Studies of its primary visual cortex (V1) using conventional grating stimuli to construct linear-nonlinear receptive fields suggest that the mouse must have very poor vision. Using novel stimuli resembling the flow of images across the retina as the mouse moves through the grass, we find that most V1 neurons respond reliably to very much finer details of the visual scene than previously believed. Our findings suggest that the conventional notion of a unique receptive field does not capture the operation of the neural network in mouse V1.

Assessments of the mouse visual system based on spatial-frequency analysis imply that its visual capacity is low, with few neurons responding to spatial frequencies greater than 0.5 cycles per degree. However, visually mediated behaviors, such as prey capture, suggest that the mouse visual system is more precise. We introduce a stimulus class—visual flow patterns—that is more like what the mouse would encounter in the natural world than are sine-wave gratings but is more tractable for analysis than are natural images. We used 128-site silicon microelectrodes to measure the simultaneous responses of single neurons in the primary visual cortex (V1) of alert mice. While holding temporal-frequency content fixed, we explored a class of drifting patterns of black or white dots that have energy only at higher spatial frequencies. These flow stimuli evoke strong visually mediated responses well beyond those predicted by spatial-frequency analysis. Flow responses predominate in higher spatial-frequency ranges (0.15–1.6 cycles per degree), many are orientation or direction selective, and flow responses of many neurons depend strongly on sign of contrast. Many cells exhibit distributed responses across our stimulus ensemble. Together, these results challenge conventional linear approaches to visual processing and expand our understanding of the mouse’s visual capacity to behaviorally relevant ranges.

The retina and primary visual cortex (V1) both exhibit diverse neural populations sensitive to diverse visual features. Yet it remains unclear how neural populations in each area partition stimulus space to span these features. One possibility is that neural populations are organized into discrete groups of neurons, with each group signaling a particular constellation of features. Alternatively, neurons could be continuously distributed across feature-encoding space. To distinguish these possibilities, we presented a battery of visual stimuli to mouse retina and V1 while measuring neural responses with multi-electrode arrays. Using machine learning approaches, we developed a manifold embedding technique that captures how neural populations partition feature space and how visual responses correlate with physiological and anatomical properties of individual neurons. We show that retinal populations discretely encode features, while V1 populations provide a more continuous representation. Applying the same analysis approach to convolutional neural networks that model visual processing, we demonstrate that they partition features much more similarly to the retina, indicating they are more like big retinas than little brains.

Over the past years, network science has proven invaluable as a means to better understand many of the processes taking place in the brain. Recently, interareal connectivity data of the macaque cortex was made available with great richness of detail. We explore new aspects of this dataset, such as a correlation between connection weights and cortical hierarchy. We also look at the link-community structure that emerges from the data to uncover the major communication pathways in the network, and moreover investigate its reciprocal connections, showing that they share similar properties.

Invoking the manifold assumption in machine learning requires knowledge of the manifold's geometry and dimension, and theory dictates how many samples are required. However, in most applications, the data are limited, sampling may not be uniform, and the manifold's properties are unknown; this implies that neighborhoods must adapt to the local structure. We introduce an algorithm for inferring adaptive neighborhoods for data given by a similarity kernel. Starting with a locally conservative neighborhood (Gabriel) graph, we sparsify it iteratively according to a weighted counterpart. In each step, a linear program yields minimal neighborhoods globally, and a volumetric statistic reveals neighbor outliers likely to violate manifold geometry. We apply our adaptive neighborhoods to nonlinear dimensionality reduction, geodesic computation, and dimension estimation. A comparison against standard algorithms using, for example, k-nearest neighbors, demonstrates the usefulness of our approach.