D ISENTANGLING NEURAL MECHANISMS FOR PERCEPTUAL GROUPING
Anonymous authors
Paper under double-blind review
A BSTRACT
Forming perceptual groups and individuating objects in visual scenes is an essential step towards visual intelligence.
This ability is thought to arise in the brain from computations implemented by bottom-up, horizontal, and top-down connections between neurons.
However, the relative contributions of these connections to perceptual grouping are poorly understood.
We address this question by systematically evaluating neural network architectures featuring combinations of these connections on two synthetic visual tasks, which stress low-level “Gestalt” vs. high-level object cues for perceptual grouping.
We show that increasing the difﬁculty of either task strains learning for networks that rely solely on bottom-up processing.
Horizontal connections resolve this limitation on tasks with Gestalt cues by supporting incremental spatial propagation of activities, whereas top-down connections rescue learning on tasks with high-level object cues by modifying coarse predictions about the position of the target object.
Our ﬁndings dissociate the computational roles of bottom-up, horizontal and top-down connectivity, and demonstrate how a model featuring all of these interactions can more ﬂexibly learn to form perceptual groups.
I NTRODUCTION
The ability to form perceptual groups and segment scenes into a discrete set of object-based representations constitutes a fundamental component of visual intelligence.
Decades of research in biological vision have suggested a coarse dichotomy between perceptual grouping tasks that can be solved by feedforward (or bottom-up) processes vs. those that require feedback (or recurrent) processes (Roelfsema, 2006; Roelfsema & Houtkamp, 2011; Wyatte et al., 2014).
Feedforward processes group scenes by encoding increasingly more complex feature conjunctions through a cascade of ﬁltering, rectiﬁcation and normalization operations.
As shown in Fig.
1a, this visual strategy can be sufﬁcient to detect and localize objects in scenes with little or no background clutter, or when an object “pops out” because of color, contrast, etc.
(Nothdurft, 1991).
However, as illustrated in Fig.
1b, visual scenes are usually complex and contain objects interposed in background clutter.
When this is the case, feedforward processes alone are often insufﬁcient for perceptual grouping (Herzog & Clarke, 2014; Pelli et al., 2004;
Freeman et al., 2012; Freeman & Pelli, 2010), and it has been suggested that our visual system leverages feedback mechanisms to reﬁne an initially coarse scene segmentation (Ullman, 1984; Roelfsema & Houtkamp, 2011; Treisman & Gelade, 1980; Lamme & Roelfsema, 2000).
Extant theory suggests that there are two distinct types of feedback strategies.
One strategy involves grouping low-level visual features with their neighbors according to Gestalt laws like similarity, good continuation, etc.
(Fig.
1b, top; Jolicoeur et al., 1986; 1991; Pringle & Egeth, 1988; Roelfsema et al., 1999; Houtkamp & Roelfsema, 2010; Houtkamp et al., 2003; Roelfsema et al., 2002).
Another strategy is object-based and mediated by high-level expectations about the shape and structure of perceptual objects.
In this strategy, feedback reﬁnes a coarse initial feedforward analysis of a scene with high-level hypotheses about the objects it contains (Fig.
1b, bottom; Vecera & Farah, 1997;
Vecera & O’Reilly, 1998; Vecera, 1993; Zemel et al., 2002).
Both of these feedback strategies are iterative and rely on recurrent computations.
What are the neural circuits that implement Gestalt vs. object-based strategies for perceptual grouping?
Visual neuroscience studies have suggested that these strategies emerge from speciﬁc types of neural
[Figure]
Hard
Biological vs. artiﬁcial
[Figure]
The Pathﬁnder challenge (reproduced with permission from Linsley et al. (2018b) and inspired by Houtkamp & Roelfsema 2010) involves answering a connected by a path
This can be solved we introduce a novel challenge asks the on interactions: (i) horizontal connections between neurons within an area, spanning spatial locations and potentially feature selectivities (Stettler et al., 2002; Gilbert & Wiesel, 1989; McManus et al., 2011; Bosking et al., 1997; Schmidt et al., 1997; Wannig et al., 2011), and (ii) descending top-down connections from neurons in higher-to-lower areas (Ko & von der Heydt, 2018; Gilbert & Li, 2013;
Tang et al., 2018;
Lamme et al., 1998; Murray et al., 2004; 2002).
The anatomical and functional properties of these feedback connections have been well-documented (see Gilbert & Li 2013 for a review), but the relative contributions of horizontal vs. top-down connections for perceptual grouping remains an open question.
Contributions Here we investigate the function of horizontal vs. top-down connections during perceptual grouping.
We evaluate each network on two perceptual grouping “challenges” that are designed to be solved by either Gestalt or object-based visual strategies.
Our contributions are:
• We introduce a biologically-inspired deep recurrent neural network (RNN) architecture featuring feedforward and feedback connections (the TD+H-CNN).
We develop a range of lesioned variants of this network for measuring the relative contributions of feedforward and feedback processing by selectively disabling either horizontal (TD-CNN), top-down (H-CNN), or both types of connections (BU-CNN).
• We introduce the cluttered ABC challenge (cABC), a synthetic visual reasoning challenge that requires object-based grouping strategies (Fig. 1c, bottom-right).
We pair this dataset with the Pathﬁnder challenge (Linsley et al.
2018b, Fig.
1c, top-right) which features low- level Gestalt cues.
Both challenges allow for a parametric control over image variability.
With these challenges, we investigate whether each of our models can learn to leverage either object-level of Gestalt cues for grouping.
• We ﬁnd that top-down connections are key for grouping objects when semantic cues are present, whereas horizontal connections support grouping when they are not.
Of the network models tested (which included ResNets and U-Nets), only our recurrent model with the full array of connections (the TD+H-CNN) solves both tasks across levels of difﬁculty.
• We compare model predictions to human psychophysics data on the same visual tasks and show that human judgements are signiﬁcantly more consistent with image predictions from our TD+H-CNN than ResNet and U-Net models.
This indicates that the strategies used by the human visual system on difﬁcult segmentation tasks are best matched by a highly-recurrent model with bottom-up, horizontal, and top-down connections.
R ELATED W ORK
Recurrent neural networks Recurrent neural networks (RNNs) are a class of models that can be trained with gradient descent to approximate discrete-time dynamical systems.
RNNs are classically featured in sequence learning, but have also begun to show promise in computer vision tasks.
One example of this includes autoregressive RNNs that learn the statistical relationship between neighboring pixels for image generation (Van Den Oord et al., 2016).
Another approach, successfully applied to object recognition and super-resolution tasks, is to incorporate convolutional kernels into
RNNs (O’Reilly et al., 2013; Liang & Hu, 2015; Liao & Poggio, 2016; Kim et al., 2016; Zamir et al., 2017).
These convolutional RNNs share kernels across processing timesteps, allowing them to achieve processing depth with a fraction of the parameters needed for a CNN of equivalent depth.
Such convolutional RNN models have also been used by multiple groups as a foundation for vision models with biologically-inspired feedback mechanisms (Lotter et al., 2016;
Spoerer et al., 2017;
Kietzmann et al., 2019; Wen et al., 2018; Linsley et al., 2018b; Nayebi et al., 2018a; Kar et al., 2019).
Here, we combine convolutional-RNN models with the feedback gated recurrent unit (fGRU) proposed by ?
(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)
Linsley et al.
(2018a).
The fGRU extends the horizontal gated recurrent unit (hGRU, Linsley et al. 2018b), to model (i) horizontal connections between units in a processing layer separated by spatial location and/or feature channel, and (ii) top-down connections from units in higher-to-lower network layers.
The fGRU was applied to contour detection in natural and electron microscopy images, where it was shown to be more sample efﬁcient than state-of-the-art models.
We leverage a modiﬁed version of this architecture to study the relative contributions of horizontal and top-down interactions for perceptual grouping.
Synthetic visual tasks There is a long history of using synthetic visual recognition challenges for evaluating computer vision algorithms (Ullman, 1996; Fleuret et al., 2011).
There is a popular dataset of simple geometric shapes used to evaluate instance segmentation algorithms (featured in Reichert & Serre 2014; Greff et al. 2016), and variants of the cluttered MNIST dataset and CAPTCHA datasets have been helpful for testing model tolerance to visual clutter (e.g., Gregor et al. 2015; Sabbah et al.
; Spoerer et al.
; George et al.
2017a; Jaderberg et al. 2015; Sabour et al. 2017).
Recent synthetic challenges have sought to signiﬁcantly ramp up task difﬁculty (Michaelis et al., 2018), and/or to parameterically control intra-class image variability (Kim et al., 2018;
Linsley et al., 2018b).
The current work follows this trend of developing novel synthetic stimuli that are tightly controlled for low-level biases (unlike e.g., MNIST), and to design parametric controls (e.g., intra-class variability) for task difﬁculty to try to strain network models.
In the current study, we begin with the “Pathﬁnder” challenge (Linsley et al., 2018b), which consists of images with two white markers that may – or may not – be connected by a long path (Fig. 2).
The challenge illustrated how a shallow network with horizontal connections could recognize a connected path by learning an efﬁcient incremental grouping strategy, while feedforward architectures (CNNs) with orders of magnitude more free parameters struggled to learn the same task.
Our novel “cluttered
ABC” (cABC) challenge complements the Pathﬁnder challenge by posing the same task on images that feature semantic objects rather than curves.
Thus, cABC may be difﬁcult to solve using the same incremental grouping strategy as Pathﬁnder, which could capture both objects in a single group (Fig. 2).
S YNTHETIC PERCEPTUAL GROUPING CHALLENGES
Pathﬁnder and cABC challenges share a key similarity in their stimulus design: white shapes are placed on a black background along with two circular and white “markers” (Fig. 2).
These markers are either placed on two different objects or the same object, and the task posed in both datasets is to discriminate between these two alternatives.
The two challenges depict different types of objects.
Images in the Pathﬁnder challenge contain two ﬂexible curves, whereas the cABC challenge uses overlapping English-alphabet characters that are transformed in appearance and position.
Local vs. object-level cues for perceptual grouping Differences in the types of shapes used in the two challenges make them ideally suited for different feedback grouping strategies.
The Pathﬁnder challenge features smooth and ﬂexible curves, making it well suited for an incremental Gestalt-based grouping strategy (Linsley et al., 2018b).
Conversely, the English-alphabet characters in the cABC challenge make it a good match for a grouping strategy that relies on object-level, semantic cues.
The two synthetic challenges are designed to cause a high computational burden in models that rely on sub-optimal grouping strategies.
For instance, cluttered, ﬂexible curves in the Pathﬁnder challenge are well-characterized by local continuity but have no set “global shape” or any semantic-level cues.
This makes the task difﬁcult for feedforward models like ResNets because the number of ﬁxed templates that they must learn to solve it increases with the number of possible shapes the ﬂexible paths may take.
In contrast, letters in cABC images are globally stable but locally degenerate (due to warping and pixelation; see Appendix A for details of its design.), and letters may overlap with each other.
Because the strokes of overlapping letters form arbitrary conjunctions, a feedforward network needs to learn a large number of templates to discriminate real from spurious stroke conjunctions.
Overall, we consider these challenges two extremes on a continuum of perceptual grouping cues found in nature.
On one hand, Pathﬁnder curves provide reliable Gestalt cues without any semantic information.
On the other hand, cABC letters are semantic but do not have local grouping cues.
As we describe in the following sections, human observers easily solve both challenges with minimal training, indicating that biological vision is capable of relying on a single cue for perceptual grouping.
Parameterization of image variability It is difﬁcult to disentangle visual strategies of neural network architecture choices using standard computer vision datasets.
For instance, the relative advantages of visual strategies implemented by horizontal vs. top-down connections can be washed out by neural networks latching onto trivial dataset biases.
More importantly, the typical training regime for deep learning involves big datasets, and in this regime, the ability of neural networks to act as universal function approximators can make inductive biases less important.
We overcome these limitations with our synthetic challenges.
Each challenge consists of three limited-size datasets of different task difﬁculties (easy, intermediate and hard; characterized by increasing levels of intra-class variability).
We train and test network architectures on each of the three datasets and measure how accuracy changes when the need for stronger generalization capabilities arises as difﬁculty increases.
This method, called “straining” (Kim et al., 2018; Linsley et al., 2018b), dissociates an architecture’s expressiveness from other incidental factors tied to a particular image domain.
Architectures with appropriate inductive biases are more likely to generalize as difﬁculty/intra-class variability increases compared to architectures that rely on low-bias strategies that can resemble “rote memorization” (Zhang et al., 2016).
Difﬁculty of Pathﬁnder challenge is parameterized by the length of target curves in the images (6-, 9-, or 14-length; Linsley et al. 2018b).
cABC challenge difﬁculty is controlled in two ways: ﬁrst, by increasing the number of possible relative positional arrangements between the two letters.
Second, by decreasing the correlation between random transformation parameters (rotation, scale and shear) applied to each letter in an image.
For instance, on the “Easy” difﬁculty dataset, letter transformations are correlated: the centers of two letters are displaced by a distance uniformly sampled in an interval between 25 and 30 pixels, and the same afﬁne transformation is applied to both letters.
In contrast, letter transformations are independent: letters are randomly separated by 15 to 40 pixels, and random afﬁne transformations are independently sampled and applied to each.
We balance the variation of these random transformation parameters across the three difﬁculty levels so that the total variability of individual letter shape remains constant (i.e., the number of transformations applied to each letter in a dataset is the same across difﬁculty levels).
Harder cABC datasets lead to increasingly varied conjunctions between the strokes of overlapping letters, making them well suited for models that can iteratively process semantic groups instead of learning ﬁxed feature templates.
See Appendix A for more details about cABC generation.
N ETWORK ARCHITECTURES
We test the role of horizontal vs. top-down connections for perceptual grouping using different conﬁgurations of the same recurrent CNN architecture (Fig. 3b).
This model is equipped with recurrent modules called fGRUs
(Linsley et al., 2018b; ? ) (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) (Linsley et al., 2018a), which can implement top-down and/or horizontal feedback (Fig. 3b).
By selectively disabling top-down connections, horizontal connections, or both types of feedback, we directly compared the relative contributions of these connections for solving Pathﬁnder and cABC tasks over a basic deep convolutional network “backbone” capable of only feedforward computations.
As an additional reference, we test representative feedforward architectures for computer vision: residual networks (He et al., 2016) and a U-Net (Ronneberger et al., 2015).
The fGRU module The fGRU is a recurrent computational module that can model either horizontal or top-down feedback.
The fGRU takes input from two unit populations: an external drive, X , and an internal state, H .
The fGRU integrates these two inputs to get an updated state for a given processing timestep H [ t ] , which is passed to the next layer at every timestep of processing.
When applied to static images, timesteps of processing allow feedback connections to spread and evolve, allowing units in different spatial positions and layers to interact with each other.
This iterative spread of activity is critical for implementing dynamic grouping strategies.
On the ﬁnal timestep of processing, the fGRU hidden state H closest to image resolution is sent to a readout module to compute a binary category prediction.
In our recurrent architecture (the TD+H-CNN), an fGRU module implements either horizontal or top-down feedback.
When implementing horizontal feedback, an fGRU takes as external drive ( X ) the activities from a preceding convolutional layer and iteratively updates its evolving hidden state H using spatial (horizontal) kernels (Fig.
3b, green fGRU).
In an alternative conﬁguration, an fGRU can implement top-down feedback by taking as input two evolving state activities from other two fGRUs, one from a lower layer and the other from a high layer (Fig.
3b, red fGRU).
This top-down fGRU uses a local ( 1 × 1 ) kernel to ﬁrst suppress the low-level H ( (cid:96) )
[ t ] with the activity in H ( (cid:96) +1)
[ t ] , then a separate kernel to “facilitate” the residual activity, supporting operations like sharpening or “ﬁlling-in”.
Additional details regarding the fGRU module are in Appendix C.
[Figure]
Recurrent networks with feedback Our full model architecture, which we call TD+H-CNN (Fig. 3b), introduces three fGRU modules into a CNN to implement top-down (TD) and horizontal (H) feedback.
The architecture consists of a downsampling (Conv-pool) pathway and an upsampling (Transpose Conv) pathway as in the U-Net (Ronneberger et al., 2015), and processes images in a bottom-up to top-down loop through its entire architecture at every timestep.
The downsampling pathway lets the model implement feedforward and horizontal connections, and the upsampling pathway lets it implement top-down interactions (conceptualized in Fig.
3b, red fGRU).
The ﬁrst two fGRUs in the model learn horizontal connections at the lowest- and highest-level feature processing layers, whereas the third fGRU learns top-down interactions between these two fGRUs.
We deﬁne three variants of the TD+H-CNN by lesioning fGRU modules for horizontal and/or topdown connections: a top-down-only architecture (TD-CNN); a horizontal-only architecture (H-CNN); and a feedforward-only architecture (“bottom-up” BU-CNN; see Appendix C for details).
Reference networks We also measure the performance of popular neural network architectures on
Pathﬁnder and cABC.
We tested three “Residual Network” (ResNets, He et al. 2016) with 18, 50, and 152 layers and a “U-Net” (Ronneberger et al., 2015) which uses a VGG16 encoder.
Both model types utilize skip connections to mix information between processing layers.
However, the U-Net uses skip connections to pass activities between layers of a downsampling encoder and an upsampling decoder.
This pattern of residual connections effectively makes the U-Net equivalent to a network with top-down feedback that is simulated for one timestep.
E XPERIMENTS
Training In initial pilot experiments we calibrated the difﬁculty of Pathﬁnder and cABC challenges by identifying the smallest easy-difﬁculty dataset size for which all models exceeded 90% validation accuracy.
For Pathﬁnder this was 60K images and for cABC this was 45K
and we used these image budgets for all difﬁculty levels of the respective challenges (with 10% held out for evaluation).
Our objective was to understand whether models could learn these challenges on their image budgets.
We were interested in evaluating model sample efﬁciency , not absolute accuracy on a single dataset nor speed of training.
Thus, we adopted early stopping criteria during training: training continued until 10 straight epochs had passed without a reduction in validation loss or if 48 epochs of training had elapsed.
Models were trained with batches of 32 images and the Adam optimizer.
We trained each model with ﬁve random weight initializations and searched over learning rates [ 1 e − 3 , 1 e − 4 , 1 e − 5 , 1 e − 6 ].
We report the best performance achieved by each model (according to validation accuracy) out of the 20 training runs.
Screening feedback computations Our study revealed three main ﬁndings.
First, we found that human participants performed well on both Pathﬁnder and cABC challenges with no signiﬁcant drop in accuracy as difﬁculty increased (Fig. 4a).
The fact that each challenge has been designed to lack a particular grouping cue (e.g., global semantics for Pathﬁnder and local Gestalt for cABC) suggests that human participants were able to utilize a different grouping strategy effective for each challenge.
Second, the pattern of accuracies from our recurrent architectures reveal complementary contributions of horizontal vs. top-down feedback (Fig. 4b).
The H-CNN solved the Pathﬁnder challenge with minimal straining as difﬁculty increased, but it struggled on the easy cABC challenge.
On the other hand, the TD-CNN performed well on the cABC challenge but struggled on the Pathﬁnder challenge as difﬁculty increased.
Together, these results suggest that top-down interactions (from higher-tolower layers) help process object-level grouping cues, whereas horizontal feedback (between units in different feature columns/spatial locations in a layer) help process local Gestalt grouping cues.
Our recurrent architecture which possessed both types of feedback, the TD+H-CNN, was able to solve both challenges at all levels of difﬁculties, roughly matching human performance.
We repeated these experiments on (cid:58)(cid:58)(cid:58) All (cid:58)(cid:58)(cid:58)(cid:58) three (cid:58)(cid:58) of (cid:58)(cid:58)(cid:58)(cid:58)(cid:58) these (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) recurrent (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) models (cid:58)(cid:58)(cid:58)(cid:58)(cid:58) relied (cid:58)(cid:58) on (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) recurrence (cid:58)(cid:58) to (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) achieve (cid:58)(cid:58)(cid:58)(cid:58) their (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) performance (cid:58)(cid:58)(cid:58) on (cid:58)(cid:58)(cid:58)(cid:58)(cid:58) these (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) datasets. (cid:58)(cid:58)(cid:58) In (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) particular, (cid:58)(cid:58) an (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) H-CNN (cid:58)(cid:58)(cid:58)(cid:58) with (cid:58)(cid:58)(cid:58)(cid:58) one (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) processing (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) timestep (cid:58)(cid:58)(cid:58)(cid:58)(cid:58) could (cid:58)(cid:58)(cid:58) not (cid:58)(cid:58)(cid:58)(cid:58) solve (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)
Pathﬁnder, (cid:58)(cid:58)(cid:58)(cid:58) and (cid:58) a (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) TD-CNN (cid:58)(cid:58)(cid:58)(cid:58) with (cid:58)(cid:58)(cid:58)(cid:58) one (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) processing (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) timestep (cid:58)(cid:58)(cid:58)(cid:58)(cid:58) could (cid:58)(cid:58)(cid:58) not (cid:58)(cid:58)(cid:58)(cid:58)(cid:58) solve (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) cABC (cid:58)(cid:58)(cid:58)(cid:58) (Fig. (cid:58)(cid:58)(cid:58)(cid:58) S7). (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)
Separately, (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) performance (cid:58)(cid:58) of (cid:58)(cid:58)(cid:58) the (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) TD+H-CNN (cid:58)(cid:58)(cid:58) was (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) relatively (cid:58)(cid:58)(cid:58)(cid:58)(cid:58) robust (cid:58)(cid:58) to (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) different (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) conﬁgurations, (cid:58)(cid:58)(cid:58) as (cid:58) it (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) performed (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) similarly (cid:58)(cid:58)(cid:58)(cid:58) well (cid:58)(cid:58) on (cid:58)(cid:58)(cid:58)(cid:58) both (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) challenges (cid:58)(cid:58)(cid:58)(cid:58) with (cid:58)(cid:58)(cid:58)(cid:58)(cid:58) more (cid:58)(cid:58)(cid:58)(cid:58)(cid:58) depth (cid:58)(cid:58)(cid:58)(cid:58) (Fig. (cid:58)(cid:58)(cid:58)(cid:58) S8).
(cid:58) (cid:58)(cid:58)(cid:58) We (cid:58)(cid:58)(cid:58) also (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) tested (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) models (cid:58)(cid:58) on (cid:58) two controlled variants of the cABC challenge: one where the two letters never touch or overlap (“position control”) and another where the two letters are rendered in different pixel intensities (“luminance control”).
No signiﬁcant straining was found on these tasks for any of our networks, conﬁrming our initial hypothesis that local ambiguities and occlusion between the letters makes top-down feedback important for grouping on cABC images (Fig. S5).
In contrast to our recurrent architectures, its strictly-feedforward variant, the BU-CNN, struggled on both challenges, demonstrating the importance of feedback for perceptual grouping (Fig. 5a).
Of the deep feedforward networks we tested, only the ResNet-152 and ResNet-50 were able to solve the entire Pathﬁnder challenge, but these same architectures failed to solve cABC.
In contrast, the ResNet-18 and U-Net solved the cABC challenge, but strained on difﬁcult Pathﬁnder datasets.
Overall, no feedforward architecture was general enough to learn both types of grouping strategies efﬁciently, suggesting that these networks face a trade-off between Pathﬁnder vs. cABC performance.
For ResNets, this tradeoff likely reﬂects the relatively small number of samples in each dataset . Pathﬁnder strains the capacity of the
[Table] increasing (cid:58)(cid:58)(cid:58) its (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) capacity. (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)
Indeed, (cid:58)(cid:58)(cid:58) we (cid:58)(cid:58)(cid:58)(cid:58)(cid:58) found (cid:58)(cid:58)(cid:58)(cid:58) that (cid:58) a (cid:58)(cid:58)(cid:58)(cid:58) wide (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) ResNet-18, whereas (cid:58)(cid:58)(cid:58)(cid:58) with (cid:58) a (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) similar (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) number (cid:58)(cid:58) of (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) parameters (cid:58)(cid:58) as (cid:58) a (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) ResNet-50, (cid:58)(cid:58)(cid:58)(cid:58) was (cid:58)(cid:58)(cid:58) [Table]
Modeling biological feedback Only the H+TD-CNN and human observers solved all levels of the
Pathﬁnder and cABC challenges.
To what extent do the visual strategies learned by the H+TD-CNN and other reference models in our experiments match those of humans for solving these tasks?
We investigated this with a large-scale psychophysics study [Table] in which human participants categorized exemplars from Pathﬁnder or cABC that were also viewed by the models (see Appendix D for experiment details).
We recruited 648 participants on Amazon Mechanical Turk to complete a web-based psychophysics experiments.
Participants were given between 800ms-1300ms to categorize each image in Pathﬁnder, and 800ms-1600ms to categorize each image in cABC (324 per challenge).
Each participant viewed a subset of the images in a challenge, which spanned all three levels of difﬁculty.
The experiment took approximately 2 minutes, and no participant viewed images from more than one challenge.
We gathered 20 human decisions for every image in the Pathﬁnder and cABC challenges, and measured human performance on each image as a logit of the average accuracy across participants (using average accuracy as a stand-in for “human conﬁdence”).
Focusing on the hard-difﬁculty dataset, we used a two-step procedure to measure how much human decision variance each model explained.
First, we estimated a ceiling for human inter-rater reliability.
We randomly (without replacement) split participants for every image into half, recorded per-image accuracy for each group, then recorded the correlation between groups.
This correlation was then corrected for the split-half procedure using a spearman-brown correction (Spearman, 1910).
Repeating this procedure 1,000 × built up a distribution of inter-rater correlations.
We took the 95 th percentile score of this distribution to represent the ceiling for inter-rater reliability.
Second, we recorded the correlation between each model’s logits and human logits, and calculated explained variance of human decisions as model human ceiling .
Both the TD+H-CNN and the H-CNN explained a signiﬁcantly greater fraction of human decision variance on Pathﬁnder images than the 50- and 152-layer ResNets, which were also able to solve this challenge (Fig. 5c; H-CNN > ResNet 152: p < 0.001; H-CNN > ResNet 50: p < 0.001; TD+H-CNN > ResNet 152: p < 0.01; TD+H-CNN > ResNet 50: p < 0.001; p-values derived from a bootstrap test,
Edgington 1964).
We also computed partial correlations between human and model scores on every image, which controlled for model accuracy in the measured association.
These partial correlations also indicated that human decisions were signiﬁcantly more correlated with the TD+H-CNN and
H-CNN than they were with either ResNet model ( Explained variance/Partial correlation ; H-CNN: 0.721/0.487; TD+H-CNN: 0.618/0.425; ResNet-152: 0.426/0.290; ResNet-50: 0.234/0.159).
We repeated this analysis for the cABC challenge.
Once again, the recurrent models explained a signiﬁcantly greater fraction of human decisions than either the feedforward U-Net or ResNet 18 that also solved the challenge (Fig. 5c; TD-CNN > U-Net: p < 0.01; TD-CNN > ResNet-18: p < 0.001;
TD+H-CNN > U-Net: p < 0.001; TD+H-CNN > ResNet-18: p < 0.001).
Partial correlations also reﬂected a similar pattern of associations ( Explained variance/Partial correlation ; TD+H-CNN: 0.633/0.437; TD-CNN: 0.538/0.376; U-Net: 0.324/0.190; ResNet-18: 0.249/0.176).
D ISCUSSION
Perceptual grouping is essential for reasoning about the visual world.
Although it is known that bottom-up, horizontal and top-down interaction contribute to perceptual grouping, their relative contributions are not well understood.
We directly tested a long-held theory related to the role of horizontal vs. top-down connections for perceptual grouping by screening neural network architectures on controlled synthetic visual tasks.
Without specifying any role for feedback connections a priori , we found a dissociation between horizontal vs. top-down feedback connections which emerged from training network architectures for classiﬁcation.
Our study provides direct computational evidence for the distinct roles played by these cortical mechanisms.
Our study also demonstrates a clear limitation of network models that rely solely on feedforward processing, including ResNets of arbitrary depths, which are strained by perceptual grouping tasks that involve cluttered visual stimuli.
Deep ResNets performed better on the Pathﬁnder challenge, whereas the shallower ResNet-18 performed better on the cABC challenge. [Table]
With [Table] more [Table]
We take this pattern of results as evidence of the importance of parameterization and architectural constraints for
[Table] models [Table] that
[Table] must [Table] on complex visual tasks.
Because Pathﬁnder does not have semantic cues, it presents a greater computational burden for feedforward models than cABC; and because cABC was limited in exemplars, [Table] has [Table]
relatively
[Table]
datasets, deeper ResNets were quicker to overﬁt. The highly-recurrent TD+H-CNN was far more ﬂexible and efﬁcient than the other reference [Table] feedforward models, and made decisions on Pathﬁnder and cABC images that were signiﬁcantly more similar to those of human observers.
Our study thus adds to a growing body of literature (George et al., 2017b;
Nayebi et al., 2018b; Linsley et al., 2018b; ? ; Kar et al., 2019) [Table] (George et al., 2017b; Nayebi et al., 2018b; Linsley et al., 2018b;a; Kar et al., 2019) which suggests that recurrent circuits are necessary to explain complex visual recognition processes.
We will release our code and datasets upon publication to encourage progress in modeling perceptual grouping in biological vision.
A C LUTTERED ABC
The goal of the cluttered ABC challenge is to test the ability of models and humans to make perceptual grouping judgements based solely on object-level semantic cues.
Each image in the challenge dataset contains a pair of letters sufﬁciently close to each other to ensure frequent overlap.
To further minimize local image cues which might permit trivial solutions to the problem, we use fonts as letter images that contain uniform and regular strokes with no distinct decorations.
Two publicly available fonts are chosen from the website https://www.dafont.com :
“Futurist ﬁxed-width” and “Instruction”.
Random transformations including afﬁne transformations, geometric distortions, and pixelation are applied before placing each letter on the image to further eliminate local category cues.
Positioning and transformations of letters are applied randomly, and their variances are used to control image variability in each difﬁculty level of the challenge.
Letter transformations Although each letter in the cABC challenge is sampled from just two different fonts, we ensure that each letter appear in sufﬁciently varied forms by applying random linear transformations to each letter.
We use three different linear transformations in our challenge: rotation, scaling, and shearing.
In each type of transformation applied to each letter is repeated twice, using three different sets of parameters per image: two sets that are sampled and applied separately to each letter, and the remaining one that is sampled once commonly applied to both letters.
We call the ﬁrst type of transformation parameters “letter-wise” and the other as “common” transformation parameters.
For example, rotations applied to the ﬁrst and the second letter are each described by the sum of letter-wise and common rotational parameters, φ 1 + φ c and φ 2 + φ c , respectively.
Scaling is described by the product of letter-wise and common scale parameters, S 1 S c and S 2 S c .
Shearing is described by the sum of letter-wise and common shear parameters, E 1 + E c and E 2 + E c .
Each shear parameter speciﬁes the value of the off-diagonal shear matrix applied to each letter image.
Either vertical or horizontal shear is applied to both letters in each image with shear axis randomly chosen with equal probability.
The random transformation procedure is visually detailed in Fig.
S1.
We decompose each transformation to letter-wise and common transformation to independently increase variability at the level of an image while keeping letter-wise variability constant.
This is achieved by gradually increasing variance of the letter-wise transformation parameters while decreasing variance of the common parameters.
See S1 for a summary of the distributions of random transformation parameters used in the three levels of difﬁculty.
We apply additional, nonlinear transformations to letter images.
First, geometric warping is applied independently to each afﬁne-transformed letter image by computing a “warp template” for each image.
A warp template is an image in same dimensions as each letter image, consisting of 10 randomly placed Gaussians with sigma (width) of 20 pixels.
Each pixel in a letter image is translated by a displacement proportional to the gradient of the warp template in the corresponding location.
This process is depicted in Fig. S2.
Second, the resulting letter image is “pixelated” by ﬁrst partitioning the letter image into a grid of 5 × 5 pixels.
Each grid is ﬁlled with 255s (white) if and only if more than 30 % of the pixels are white, resulting in a binary letter image in 15 of the original resolution.
The squares then undergo random translation with displacement independently sampled for each axis.
We use normal distribution with standard deviation of 2 pixels truncated at two standard deviations.
Letter positioning We sample the positions of letters by ﬁrst deﬁning an invisible circle of radius r placed at the center of the image.
Two additional random variables, θ and ∆ θ , are sampled to specify two angular positions of the letters on the circle, θ and θ + ∆ θ .
r , θ and ∆ θ are sampled from uniform distributions whose ranges increases with difﬁculty level (Table S1).
By sampling these parameters from increasingly larger intervals, we increases relative positional variability of letters in harder datasets.
In easy difﬁculty, we choose r ∼ U (50 , 60) .
In intermediate and hard difﬁculties, we choose R ∼ U (40 , 70) and R ∼ U (30 , 80) , respectively.
For θ and ∆ θ , we chose θ 1 ∼ U ( − 30 , 30) and ∆ θ ∼ U (170 , 190) for the easy difﬁculty, θ 1 ∼ U ( − 60 , 60) and ∆ θ ∼ U (110 , 250) for the intermediate difﬁculty, and θ 1 ∼ U ( − 90 , 90) and ∆ θ ∼ U (70 , 290) for the hard difﬁculty.
Letter images are placed on the sampled positions by aligning the positions of each letter’s “center of mass”, which is deﬁned by the average (x, y) coordinate of all the foreground pixels in each letter image, with each of the sampled coordinates in an image.
[Figure] [Figure]
[Table]
[Figure] [Figure]
B A DDITIONAL EXPERIMENTS
Control cABC challenges To further validate our implementation of the cABC, we added two control cABC challenges in our study (Fig. S3).
In the “luminance control” challenge, two letters are rendered with a pair of uniformly sampled random pixel intensity values that are greater than 128 but always differ by at least 40 between the two letters.
In the “positional control” challenge, the letters are disallowed from touching or overlapping.
Relative to the original challenge, the two controls provide additional local grouping cues with which to determine the extent of each letter.
The luminance control challenge permits additional pixel-level cue with which a model can infer image category by comparing the values of letter pixels surrounding two markers.
Positional control challenge provides unambiguous local Gestalt cue to solve the task.
Ensuring that the two letters are spatially separated has an additional effect of minimizing the amount of clutter to interfere the feature extraction process in each letter.
In both control challenges, we found no straining effect in any of the models we tested.
This strengthens our initial assumption behind the design of cABC that the only way to efﬁciently solve the default cABC challenge is to employ object-based grouping strategy.
Because all networks successfully solved the control challenges, the relative difﬁculty suffered by the H-CNN or reference recurrent (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) hierarchical (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) architectures (cid:58)(cid:58)(cid:58)(cid:58)(cid:58) were (cid:58)(cid:58)(cid:58)(cid:58)(cid:58) better (cid:58)(cid:58)(cid:58)(cid:58) able (cid:58)(cid:58)(cid:58) to (cid:58)(cid:58)(cid:58)(cid:58)(cid:58) learn (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) Pathﬁnder (cid:58)(cid:58)(cid:58)(cid:58) and (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) cABC (cid:58)(cid:58)(cid:58)(cid:58)(cid:58) tasks (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) when (cid:58)(cid:58)(cid:58)(cid:58) they (cid:58)(cid:58)(cid:58)(cid:58)(cid:58) used (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) fGRUs (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) instead [Table]
either
[Table]
Hochreiter & Schmidhuber,
[Table]
(Cho et al., 2014a).
feedforward networks on the original cABC couldn’t have been caused by idiosyncracies of image features we used such as the average size of letters.
These networks lack the mechanisms to separate the mutually occluding letter strokes according to high-level hypothesis about the categories of letters present in each image.
Segmentation challenges To further understand and visualize the nature of computations employed by our recurrent architectures when solving the Pathﬁnder and the cABC challenge, we construct a variant of each dataset where we pose a segmentation problem.
Here, we modify each dataset by placing only one marker per image instead of two.
The task is to output a per-pixel prediction of the object tagged by the marker (Figure S4).
We train each model using 10 thousand images of the cABC challenge and 40 thousand images of the Pathﬁnder challenge and validate using 400 images in both challenges.
We only use hard difﬁculty in each challenge.
We use only the TD- and H-CNN in this experiment.
We replace the readout module in each of our recurrent architecture by two 1 × 1 convolution layers with bias and rectiﬁcation after each layer.
We also include the “reference” recurrent architectures in which the fGRU modules have been replaced by either LSTM Hochreiter &
Schmidhuber (1997) or GRU Cho et al.
(2014a).
Because the U-Net is a dense prediction architecture by design, we simply remove the readout block that we used in the main categorization challenge. [Figure] [Figure] [Table]
[Figure]
cABC.
(cid:58)(cid:58) (a) (cid:58)(cid:58)
We (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) compared (cid:58)(cid:58)(cid:58)(cid:58) the (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) original (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) H+TD-CNN (cid:58)(cid:58) to (cid:58)(cid:58) a (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) deeper (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) version (cid:58)(cid:58) ( (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) instead (cid:58)(cid:58) of (cid:58)(cid:58) 3 (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) convolutional (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) blocks (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) between (cid:58)(cid:58) its (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)
[Table]
also (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) tested (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) whether (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) widening (cid:58)(cid:58)(cid:58) the
[Table]
ResNet-
[Table]
could (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)
[Table]
its
[Table]
performance
[Table]
on
[Table]
Pathﬁnder [Table] Indeed, [Table]
the
[Table]
wider
[Table]
[Table]
(matched (cid:58)(cid:58) in (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) number (cid:58)(cid:58) of (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) parameters (cid:58)(cid:58) to (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) ResNet-50) (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) performed (cid:58)(cid:58)(cid:58) far (cid:58)(cid:58)(cid:58)(cid:58)(cid:58) better (cid:58)(cid:58)(cid:58) on (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)
Pathﬁnder (cid:58)(cid:58)(cid:58)(cid:58) than (cid:58)(cid:58)(cid:58) the (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) original (cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58) version, (cid:58)(cid:58)(cid:58) but (cid:58)(cid:58)(cid:58) was (cid:58)(cid:58)(cid:58)(cid:58)
[Table]
[Table]
[Table]
[Table]
[Table] [Table] [Table] We found that the target curves in the Pathﬁnder challenge is best segmented by H-CNN (0.79 f score) followed by H-CNN with GRU (0.72) and H-CNN with LSTM (0.69).
No top-down-only architecture was able to successfully solve this challenge (we set a cutoff of greater than 0.6 f1).
The cABC challenge is best segmented by the TD-CNN (0.83), followed by TD-CNN with LSTM (0.64) and TD-CNN with GRU (0.62).
Consistent with the main challenge, no purely horizontal architecture was able to successfully solve this challenge.
In short, we were able to reproduce the dissociation in performance we found between and top connections in other recurrent (LSTM and GRU) as well, although these recurrent modules were less successful than the fGRU.
We visualize the internal update performed by our recurrent networks by plotting the difference of norm of each per-pixel feature vector at every timestep in the low-level recurrent state, H (1) , vs. its immediately preceding timestep.
Of course, this method does not reveal the full extent of the computations taking place in the fGRU, but it at least serves as a proxy for inferring the spatial layout of how activities evolve over timesteps (4b).
More examples of both sucessful and mistaken segmentations and the temporal evolution of internal activities of H-CNN (on the Pathﬁnder challenge) TD-CNN (on the cABC challenge) are shown in Fig.
S10 and Fig.
S
Using conventional recurrent layers We tested the performance of modiﬁcations of TD+H-CNN by replacing the fGRU modules with conventional recurrent modules – LSTMs (Hochreiter &
Schmidhuber, 1997) and GRUs (Cho et al., 2014a).
We found that neither of these architectures matched the performance of our fGRU-based architecture on either grouping challenges S6.
The degradation of performance was most pronounced in Pathﬁnder.
Similar to the ﬁndings in Linsley et al.
(2018b), we believe that the use of both multiplicative and additive interactions as well as the separation of the suppressive and facilitatory stages in fGRU are critical for learning stable transitive grouping in Pathﬁnder.
C N ETWORK ARCHITECTURES C. T HE F GRU MODULE
At timestep t , the fGRU module takes two inputs, an instantaneous external drive X ∈ R H
× W × K and a persistent recurrent state H
[ t − 1] ∈
R H
× W × K and produces as output an updated recurrent state
H [ t ] .
Detailed description of its internal operation over a single iteration from [ t − 1] to [ t ] is deﬁned by the following formulae.
For clarity, tensors are bolded but kernels and parameters are not:
[Equation]
where BN
[Equation]
Var[ r ] + η
[Equation]
[Equation]
The evolution of the recurrent state H can be broadly described by two discrete stages.
During the ﬁrst stage, H is combined with an extrinsic drive X .
Interactions between units in the hidden state are computed in C I by convolving H [ t − 1] with a kernel W I .
These interactions are next linearly and multiplicatively combined with H
[ t − 1] via the k -dimensional learnable coefﬁcients µ and α to compute the intermediate “suppressed“ activity, Z .
The second stage involves updating H with a transformation of the intermediate activity Z .
Here,
Z is convolved with the kernel W E to compute C E .
A candidate output ˜ H [ t ] is calculated via the k -dimensional learnable coefﬁcients κ and ω , which control the linear and multiplicative terms of self-interactions between C E and Z .
Two gates modulate the dynamics of both of these stages: the “gain” G I [ t ] , which modulates channels in H [ t − 1] during the ﬁrst stage, and the “mix” G E [ t ] , which mixes a candidate ˜ H [ t ] with the persistent H [ t − 1] during the second stage.
Both the gain and mix are transformed into the range [0 , 1] by a sigmoid nonlinearity.
This two-stage computational structure in the fGRU captures complex nonlinear interactions between units in X and H .
Brackets [ . ] denote linear rectiﬁcation.
Separate applications of batch-norm are used on every timestep, where r ∈ R d is the vector of activations that will be normalized.
The parameters δ , ν ∈ R d control the scale and bias of normalized activities, η is a regularization hyperparameter, and (cid:12) is elementwise multiplication.
Learnable gates, like those in the fGRU, support RNN training.
But there are multiple other heuristics that also help optimize performance.
We use several heuristics to train our models, including Chronos initialization of fGRU gate biases (Tallec & Ollivier, 2018).
We also initialized the learnable scale parameter δ of fGRU normalizations to 0.1, since values near 0 optimize the dynamic range of gradients passing through its sigmoidal gates (Cooijmans et al., 2017).
Similarly, fGRU parameters for learning additive suppression/facilitation ( µ, κ ) were initialized to 0, and parameters for learning multiplicative suppression/facilitation ( α, ω ) were initialized to 0.1.
Finally, when implementing topdown connections, we incorporated an extra learnable gate, which we found improved the stability of training.
Consider the horizontal activities in two layers, H ( l ) , H (2) , and the function fGRU, which implements top down connections.
The introduction of this extra gate means that top-down connections are learned as: H ( l ) =
(1 − sigmoid ( β ))
fGRU
( H ( l ) , H ( l +1) )
+ sigmoid ( β ) H ( l ) , where β ∈ R K is initialized to 0 and learns how to incorporate/ignore top-down connections.
The broad structure of the fGRU is related to the Gated Recurrent Unit (GRU, (Cho et al., 2014b)).
Nevertheless, one of the main aspects in which the fGRU diverges from the GRU is that its state update is carried out via two discrete steps of processing instead of one.
This is inspired by a computational neuroscience model of contextual effects in visual cortex (see (Mély et al., 2018) for details).
Unlike that model, the fGRU allows for both additive and multiplicative combinations following each step of convolution, which potentially encourages a more diverse range of nonlinear computations to be learned (Linsley et al., 2018b; ? )
(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)(cid:58)
(Linsley et al., 2018b;a).
C. A RCHITECTURE DETAILS
Using the fGRU module, we constrcut three recurrent convolutional architectures as well as one feedforward variant.
First, the H+TD-CNN (Fig.
S9a) is equipped with both top-down and horizontal connections.
The TD-CNN (Fig.
S9b) is constructed by selectively lesioning the horizontal connections in the H+TD-CNN.
The H-CNN (Fig.
S9c) is constructed by selectively lesioning the top-down connections in the H+TD-CNN, essentially making recurrence only take place within the low-level fGRU.
Lastly the BU-CNN (Fig.
S9d) is constructed by disabling both types of recurrence, turning our recurrent archecture into a feedforward encoder-decoder network.
All experiments were run with
NVIDIA Titan X GPUs.
TD+H-CNN Our main recurrent network architecture, TD+H-CNN, is built on a convolutional and transpose-convolutional “backbone”.
An input image X is ﬁrst processed by a “Conv” block which consists of two convolutional layers of 7 × 7 kernels with 20 output channels and a ReLU activation applied between.
The resulting feature activity is sent to the ﬁrst fGRU module (fGRU (1) ), which is equipped with 15 × 15 kernels with 20 output channels to carry out horizontal interactions.
fGRU (1) iteratively updates its recurrent state, H (1) .
The output undergoes a batch normalization and a pooling layer with a 2 × 2 pool kernel with 2 × 2 strides which then passes through the downsampling block consisting of two convolutional “stacks” (Fig.
S9a, The gray box named “DS”).
Each stack consists of three convolutional layers with 3 × 3 kernels, each followed by a ReLU activations and a batch normalization layer.
The convolutional stacks increase the number of output channels from 20 to 32 to 128, respectively, while they progressively downsample the activity via a 2 × 2 pool-stride layer after each stack.
The resulting activity is fed to another fGRU module in the top layer, fGRU (2) , where it is integrated with the higher-level recurrent state, H (2) .
The kernels in fGRU (2) , unlike fGRU (1) , is strictly local with 1 × 1 ﬁlter size.
This essentially makes fGRU (2) a persistent memory module without performing any spatial integration over timesteps.
The output of this fGRU module then passes through the “upsampling” block which consists of two transpose convolutional stacks (Fig.
S9a,
The gray box named “US”),.
Each stack consists of one transpose convolutional layer of 4 × 4 kernels.
Each stack also reduces the number of output channels from 128 to 32 to 12, respectively, while it progressively upsamples the activity via a 2 × 2 stride.
Each transpose convolutional layer is followed by a ReLU activations and a batch normalization layer.
The resulting activity, which now has the same shape as the output of the initial fGRU, is sent to the third fGRU module (fGRU (3) ) where it is integrated with the recurrent state of fGRU (1) , H (1) .
This module plays the role of integrating top-down activity (originating form “US”) and bottom-up activity (originating from fGRU (1) ) via 1 × 1 kernels. To summarize, fGRU (1) in our architecture implements horizontal feedback in the ﬁrst layer while the fGRU (3) implements top-down feedback.
The above steps repeat over 8 timesteps, and in the 8 th timestep, the ﬁnal recurrent activity from fGRU (1) , H (1) , is extracted from the network and passed through batch normalization.
The resulting activity is processed by the “Readout” block which consists of two convolutional layers of 1 ×kernels with a global max-pooling layer between.
Each convolutional layer has one output channel and uses ReLU activations.
Lesioned architectures Our top-down-only architecture, the TD-CNN, is identical to the TD+HCNN, but its horizontal connections have been disabled by replacing the spatial kernel of fGRU (1) with a 1 × 1 kernel, thereby preventing spatial propagation of activities within the fGRU altogether.
Thus, its recurrent updates in the low-level layer are only driven by top-down feedback (in fGRU (3) ).
The H-CNN is implemented by disabling fGRU (3) .
This effectively lesions both the downsampling and upsampling pathways entirely from contributing to the ﬁnal output.
As a result, its ﬁnal category decision is determined entirely by low-level horizontal propagation of activities in the netwrok.
Lastly, we construct the purely feedforward architecture, called the BU-CNN, by lesioning both horizontal and top-down feedback.
It replaces the spatial kernel in fGRU (1) by a 1 × 1 kernel and disables fGRU (3) .
By running for only one timestep, the BU-CNN is equivalent to a deep convolutional encoder-decoder network.
Feedforward reference networks Because U-Nets (Ronneberger et al., 2015) are designed for dense image predictions, we attach the same readout block that we use to decode fGRU activities ( H (1) ) to the output layer of a U-Net, which pairs a VGG16 as its downsampling architecture, with upsampling + convolutional layers to transform its encodings into the same resolution as the input image.
D H UMAN EXPERIMENTS
We devised psychophysics categorization experiments to understand the visual processes underlying the ability to solve tasks that encourage perceptual grouping.
These visual categorization experiments adopted a paradigm similar to Eberhardt et al.
(2016), where stimuli were ﬂashed quickly and participants had to respond within a ﬁxed period of time.
We conducted separate experiments for the “Pathﬁnder” and the “cluttered ABC” challenge datasets.
Participants had several possible response time (RT) widows for responding to stimuli in each dataset.
For “Pathﬁnder”, we considered { 800 , 1050 , 1300 } ms RT windows, while for the “cluttered ABC”, we consider { 800 , 1200 , 1600 } ms.
We recruited 324 participants for each experiment ( 648 overall) from Amazon Mechanical Turk ( www.mturk.com ).
The “Pathﬁnder” and the “cluttered ABC” are binary categorization challenges with “Same” and “Different” as the possible responses.
For both experiments, we present 90 stimuli to each participant and assign a single RT to that participant.
These 90 stimuli consist of three sets of 30 , corresponding to the three level of difﬁculties present in the challenge datasets.
We randomize the order of the three difﬁculties (sets of 30 stimuli) across participants as well as the assignment of keys to class “Same” and “Different”.
The performance results (in terms of accuracy) of the human participants that we obtained are shown in Fig.
Stimulus generation We generated a short video for each stimuli image from the challenge dataset based on the response time allowed from the onset of stimuli.
We generated three stimulus videos for each challenge image, correponding to the three different response times chosen.
In each stimulus video, we included an image of a cross (black plus sign overlaid on a white background) for 1000 ms before the onset of stimulus that is shown for RT ms.
The stimuli were stored as .webm videos and fGRU (1)
X
Conv t =t
= 1, 2, 3, … t =fGRU (1) fGRU
Readout
Y …
X
Conv
X
Conv fGRU (1)
X
DS
Conv fGRU (2) fGRU (3)
US t =t
= 1, 2, 3, … t =fGRU (1)
DS fGRU (2) fGRU (3)
US fGRU (1)
DS fGRU (2) fGRU (3)
US
Readout
Y … …
X
Cons
X
Conv (c) H-CNN (b) TD-CNN fGRU (1)
DS fGRU (2)
US
Readout
Y
X
Conv (d) BU-CNN fGRU (1)
X
Conv-pool
Conv fGRU (2) fGRU (3)
Transpose Conv t =t = 1, 2, 3, … t =fGRU (1) fGRU (2) fGRU (3) fGRU (1) fGRU (2) fGRU (3)
Readout
Y X
Conv
X
Conv … …
Conv-pool
Transpose Conv
Conv-pool
Transpose Conv [Figure] presented for 1000 +RT ms during the experiments. We created a video so that the cross image and the stimulus image are seamlessly combined and shown without delays, which would otherwise be caused by loading their separate images in the browser, which introduces noise in stimulus timing.
We selected a set of 200 images per difﬁculty in both challenges ( 600 /challenge).
Each participant responded to 30 images from each difﬁculty.
We collected responses to the 600 images in each challenge from 18 different participants.
Psychophysics experiment We conducted separate experiments for: (1) Pathﬁnder and (2) cABC images.
The image dataset used for each experiment consisted of three difﬁculties - easy, intermediate and hard.
Participants were assigned three blocks of trials, each having stimuli from a single difﬁculty level.
The order of these three blocks is randomized and balanced across participants.
The keys for
Each experiment began with a training phase, where participants responded to 6 trials at their own leisure.
This is to make sure that participants understood the task and the type of image stimuli.
After this, participants went through 15 trials, 5 from each difﬁculty level, where they responded by pressing + or - within a limited response period.
For this set of images, participants were given feedback on whether their response was correct or incorrect.
We call this the training block of trials.
After training, each participant completed 90 trials and responded with either “Same” or “Different” in the stipulated amount of response time, without feedback on their performance.
After everytrials, participants were given time to rest and the difﬁculty level of the viewed images changed.
Before starting the block of trials for any difﬁculty, a representative image from that difﬁcuty level was shown and instructions were given to respond as quickly as possible.
These experiments were implemented using jsPsych and custom javascript functions.
We used the .webm format as it is a HTML5-compliant video format to ensure fast loading times for the web browsers.
The challenge images used to generate the stimuli videos are converted to 256 ×to ensure consistent sized images across the trials.
The conﬁguration variables for each of the assignments were stored in a MySQL database and fetched by the server for loading the assignment with the required trails.
The conﬁguration variables included ﬁnger assignment ID , difﬁculty ordering
ID , trials list , assignment ID and response time .
The trials list is stored as a comma-separated values (csv) ﬁle, where each line has the path to a generated stimulus video.
Processing Responses To generate the ﬁnal results from human responses on the two categorization tasks, ﬁltered responses rendered in less than 450 ms, which we deem unreliable responses following the criteria of Eberhardt et al.
We next calculated the accuracy across participants for the three difﬁculty levels, and used a bootstrapping procedure to determine standard error.
Successful
Mistakes
Image
Label
Predicted
Recurrent activities t= t=3 t= t= t= t= t=
[Figure]
Image
Label
Predicted
Recurrent activities t= t=3 t= t= t= t= t=
Successful Mistakes
[Figure]