Title: LEARNING WORD-LIKE UNITS FROM JOINT AUDIO-VISUAL ANALYSIS

Abstract: Given a collection of images and spoken audio captions, we present a method for discovering word-like acoustic units in the continuous speech signal and grounding them to semantically relevant image regions. For example, our model is able to detect spoken instances of the words "lighthouse" within an utterance and associate them with image regions containing lighthouses. We do not use any form of conventional automatic speech recognition, nor do we use any text transcriptions or conventional linguistic annotations. Our model effectively implements a form of spoken language acquisition, in which the computer learns not only to recognize word categories by sound, but also to enrich the words it learns with semantics by grounding them in images.

1. INTRODUCTION 1.PROBLEM STATEMENT AND MOTIVATION:

Automatically discovering words and other elements of linguistic structure from continuous speech has been a longstanding goal in computational linguists, cognitive science, and other speech processing fields. Practically all humans acquire language at a very early age, but this task has proven to be an incredibly difficult problem for computers. While conventional automatic speech recognition (ASR) systems have a long history and have recently made great strides thanks to the revival of deep neural networks (DNNs), their reliance on highly supervised training paradigms has essentially restricted their application to the major languages of the world, accounting for a small fraction of the more than 7,000 human languages spoken worldwide (Lewis et al., 2016) . The main reason for this limitation is the fact that these supervised approaches require enormous amounts of very expensive human transcripts. Moreover, the use of the written word is a convenient but limiting convention, since there are many oral languages which do not even employ a writing system. In constrast, infants learn to communicate verbally before they are capable of reading and writing -so there is no inherent reason why spoken language systems need to be inseparably tied to text.

The key contribution of this paper has two facets. First, we introduce a methodology capable of not only discovering word-like units from continuous speech at the waveform level with no additional text transcriptions or conventional speech recognition apparatus. Instead, we jointly learn the semantics of those units via visual associations. Although we evaluate our algorithm on an English corpus, it could conceivably run on any language without requiring any text or associated ASR capability. Second, from a computational perspective, our method of speech pattern discovery runs in linear time. Previous work has presented algorithms for performing acoustic pattern discovery in continuous speech (Park & Glass, 2008; Jansen et al., 2010; Jansen & Van Durme, 2011) without the use of transcriptions or another modality, but those algorithms are limited in their ability to scale by their inherent O(n 2 ) complexity, since they do an exhaustive comparison of the data against itself. Our method leverages correlated information from a second modality -the visual domain -to guide the discovery of words and phrases. This enables our method to run in O(n) time, and we demonstrate it scalability by discovering acoustic patterns in over 522 hours of audio data.

1.2. PREVIOUS WORK:

A sub-field within speech processing that has garnered much attention recently is unsupervised speech pattern discovery. Segmental Dynamic Time Warping (S-DTW) was introduced by Park & Glass (2008) , which discovers repetitions of the same words and phrases in a collection of untranscribed acoustic data. Many subsequent efforts extended these ideas (Jansen et al., 2010; Jansen & Van Durme, 2011; Dredze et al., 2010; Harwath et al., 2012; Zhang & Glass, 2009) . Alternative approaches based on Bayesian nonparametric modeling (Lee & Glass, 2012; Ondel et al., 2016) employed a generative model to cluster acoustic segments into phoneme-like categories, and related works aimed to segment and cluster either reference or learned phoneme-like tokens into word-like and higher-level units (Johnson, 2008; Goldwater et al., 2009; Lee et al., 2015) .

In parallel, the computer vision and NLP communities have begun to leverage deep learning to create multimodal models of images and text. Many works have focused on generating annotations or text captions for images (Socher & Li, 2010; Frome et al., 2013; Socher et al., 2014; Karpathy et al., 2014; Karpathy & Li, 2015; Vinyals et al., 2015; Fang et al., 2015; Johnson et al., 2016) . One interesting intersection between word induction from phoneme strings and multimodal modeling of images and text is that of Gelderloos & Chrupaa (2016) , who uses images to segment words within captions at the phoneme string level. Several recent papers have taken these ideas beyond text, and attempted to relate images to spoken audio captions directly at the waveform level (Harwath & Glass, 2015; Harwath et al., 2016) .

While supervised object detection is a standard problem in the vision community, several recent works have tackled the problem of weakly-supervised or unsupervised object localization (Bergamo et al., 2014; Cho et al., 2015; Zhou et al., 2015; Cinbis et al., 2016) . Although the focus of this work is discovering acoustic patterns, in the process we jointly associate the acoustic patterns with clusters of image crops, which we demonstrate capture visual patterns as well.

and is always 40 pixels high (corresponding to the 40 Mel filterbanks), but the width of the spectrogram varies depending upon the duration of the spoken caption, with each pixel corresponding to approximately 10 milliseconds worth of audio. The specific network architecture we use is shown below, where C denotes the number of convolutional channels, W is filter width, H is filter height, and S is pooling stride.

1. Convolution with C=128, W=1, H=40, ReLU 2. Convolution with C=256, W=11, H=1, ReLU, maxpool with W=3, H=1, S=2 3. Convolution with C=512, W=17, H=1, ReLU, maxpool with W=3, H=1, S=2 4. Convolution with C=512, W=17, H=1, ReLU, maxpool with W=3, H=1, S=2 5. Convolution with C=1024, W=17, H=1, ReLU 6. Meanpool over entire caption width followed by L2 normalization

In practice during training, we restrict the caption spectrograms to all be 1024 frames wide (i.e., 10sec of speech) by applying truncation or zero padding; this introduces computational savings and was shown in Harwath et al. (2016) to only slightly degrade the performance. Additionally, both the images and spectrograms are mean normalized before training. The overall multimodal network is formed by tying together the image and audio branches with a layer which takes both of their output vectors and computes an inner product between them, representing the similarity score between a given image/caption pair. We train the network to assign high scores to matching image/caption pairs, and lower scores to mismatched pairs. The objective function and training procedure we use is identical to that described in Harwath et al. (2016) , but we briefly describe it here.

Within a minibatch of B image/caption pairs, let S p j , j = 1, . . . , B denote the similarity score of the j th image/caption pair as output by the neural network. Next, for each pair we randomly sample one impostor caption and one impostor image from the same minibatch. Let S i j denote the similarity score between the j th caption and its impostor image, and S c j be the similarity score between the j th image and its impostor caption. The total loss for the entire minibatch is then computed as

L(θ) = B j=1

max(0, S c j -S p j + 1) + max(0, S i j -S p j + 1).

(1)

We train the neural network with 50 epochs of stochastic gradient descent using a batch size B = 128, a momentum of 0.9, and a learning rate of 1e-5 which is set to geometrically decay by a factor between 2 and 5 every 5 to 10 epochs.

4. FINDING AND CLUSTERING AUDIO-VISUAL CAPTION GROUNDINGS:

Although we have trained our multimodal network to compute embeddings at the granularity of entire images and entire caption spectrograms, we can easily apply it in a more localized fashion.

In the case of images, we can simply take any arbitrary crop of an original image and resize it to 224x224 pixels. The audio network is even more trivial to apply locally, because it is entirely convolutional and the final mean pooling layer ensures that the output will be a 1024-dim vector no matter the extent of the input. The bigger question is where to locally apply the networks in order to discover meaningful acoustic and visual patterns.

Given an image and its corresponding spoken audio caption, we use the term grounding to refer to extracting meaningful segments from the caption and associating them with an appropriate subregion of the image. For example, if an image depicted a person eating ice cream and its caption contained the spoken words "A person is enjoying some ice cream," an ideal set of groundings would entail the acoustic segment containing the word "person" linked to a bounding box around the person, and the segment containing the word "ice cream" linked to a box around the ice cream. We use a constrained brute force ranking scheme to evaluate all possible groundings (with a restricted granularity) between an image and its caption. Specifically, we divide the image into a grid, and extract all of the image crops whose boundaries sit on the grid lines. Because we are mainly interested in extracting regions of interest and not high precision object detection boxes, to keep the number of proposal regions under control we impose several restrictions. First, we use a 10x10 grid on each image regardless of its original size. Second, we define minimum and maximum aspect ratios as 2:3 and 3:2 so as not to introduce too much distortion and also to reduce the number of proposal boxes. Third, we define a minimum bounding width as 30% of the original image width, and similarly a minimum height as 30% of the original image height. In practice, this results in a few thousand proposal regions per image.

To extract proposal segments from the audio caption spectrogram, we similarly define a 1-dim grid along the time axis, and consider all possible start/end points at 10 frame (pixel) intervals. We impose minimum and maximum segment length constraints at 50 and 100 frames (pixels), implying that our discovered acoustic patterns are restricted to fall between 0.5 and 1 second in duration. The number of proposal segments will vary depending on the caption length, and typically number in the several thousands. Note that when learning groundings we consider the entire audio sequence, and do not incorporate the 10sec duration constraint imposed during the first stage of learning. Once we have extracted a set of proposed visual bounding boxes and acoustic segments for a given image/caption pair, we use our multimodal network to compute a similarity score between each unique image crop/acoustic segment pair. Each triplet of an image crop, acoustic segment, and similarity score constitutes a proposed grounding. A naive approach would be to simply keep the top N groundings from this list, but in practice we ran into two problems with this strategy. First, many proposed acoustic segments capture mostly silence due to pauses present in natural speech. We solve this issue by using a simple voice activity detector (VAD) which was trained on the TIMIT corpus (Garofolo et al., 1993) . If the VAD estimates that 40% or more of any proposed acoustic segment is silence, we discard that entire grounding. The second problem we ran into is the fact that the top of the sorted grounding list is dominated by highly overlapping acoustic segments. This makes sense, because highly informative content words will show up in many different groundings with slightly perturbed start or end times. To alleviate this issue, when evaluating a grounding from the top of the proposal list we compare the interval intersection over union (IOU) of its acoustic segment against all acoustic segments already accepted for further consideration. If the IOU exceeds a threshold of 0.1, we discard the new grounding and continue moving down the list. We stop accumulating groundings once the scores fall to below 50% of the top score in the "keep" list, or when 10 groundings have been added to the "keep" list, whichever comes first. Figure 1 displays a pictorial example of our grounding procedure.

Once we have completed the grounding procedure, we are left with a small set of regions of interest in each image and caption spectrogram. We use the respective branches of our multimodal network to compute embedding vectors for each grounding's image crop and acoustic segment. We then employ k-means clustering separately on the collection of image embedding vectors as well as the collection of acoustic embedding vectors. The last step is to establish an affinity score between each image cluster I and each acoustic cluster A; we do so using the equation

EQUATION

where i is an image crop embedding vector, a is an acoustic segment embedding vector, and Pair(i, a) is equal to 1 when i and a belong to the same grounding pair, and 0 otherwise. After clustering, we are left with a set of acoustic pattern clusters, a set of visual pattern clusters, and a set of linkages describing which acoustic clusters are associated with which image clusters. In the next section, we investigate the properties of these clusters in more detail.

5. EXPERIMENTS AND ANALYSIS:

We trained our multimodal network on a set of 214,585 image/caption pairs, and vetted it with an image search (given caption, find image) and annotation (given image, find caption) task similar to the one used in Harwath et al. (2016) ; Karpathy et al. (2014) ; Karpathy & Li (2015) . The image annotation and search recall scores on a 1,000 image/caption pair held-out test set are shown in Table 1 , and are compared against the model architecture used in Harwath et al. (2016) . We then performed the grounding and pattern clustering steps on the entire training dataset. This resulted in a total of 1,161,305 unique grounding pairs.

In order to evaluate the acoustic pattern discovery and clustering, we wish to assign a label to each cluster and cluster member, but this is not completely straightforward since each acoustic segment may capture part of a word, a whole word, multiple words, etc. Our strategy is to force-align the Google recognition hypothesis text to the audio, and then assign a label string to each acoustic segment based upon which words it overlaps in time. The alignments are created with the help of a Kaldi (Povey et al., 2011) speech recognizer based on the standard WSJ recipe and trained using the Google ASR hypothesis as a proxy for the transcriptions. Any word whose duration is overlapped 30% or more by the acoustic segment is included in the label string for the segment. We then employ a majority vote scheme to derive the overall cluster labels. When computing the purity of a cluster, we count a cluster member as matching the cluster label as long as the overall cluster label appears in the member's label string. In other words, an acoustic segment overlapping the words "the lighthouse" would receive credit for matching the overall cluster label "lighthouse". Several example clusters and a breakdown of the labels of their members are shown in Table 2 . We investigated some simple schemes for predicting highly pure clusters, and found that the empirical variance of the cluster members (average squared distance to the cluster centroid) was a good indicator. Figure 2 displays a scatter plot of cluster purity weighted by the natural log of the cluster size against the empirical variance. Large, pure clusters are easily predicted by their low empirical variance, while a high empirical variance is indicative of a garbage cluster.

Ranking a set of k = 500 acoustic clusters by their variance, Table 3 displays some statistics for the 50 lowest-variance clusters. We see that most of the clusters are very large and highly pure, and their labels reflect interesting object categories being identified by the neural network. We additionally compute the coverage of each cluster by counting the total number of instances of the cluster label anywhere in the training data, and then compute what fraction of those instances were captured by the cluster. We notice many examples of high coverage clusters, e.g. the "skyscraper" cluster captures 84% of all occurrences of the word "skyscraper" anywhere in the training data, while the "baseball" cluster captures 86% of all occurrences of the word "baseball". This is quite impressive given the fact that no conventional speech recognition was employed, and neither the multimodal neural network nor the grounding algorithm had access to the text transcripts of the captions.

To get an idea of the impact of the k parameter as well as a variance-based cluster pruning threshold based on Figure 2 , we swept k from 250 to 2000 and computed a set of statistics shown in Table 4 . We compute the standard overall cluster purity evaluation metric in addition to the average coverage across clusters. The table shows the natural tradeoff between cluster purity and redundancy (indicated by the average cluster coverage) as k is increased. In all cases, the variance-based cluster pruning greatly increases both the overall purity and average cluster coverage metrics. We also notice that more unique cluster labels are discovered with a larger k.

Next, we examine the image clusters. Figure 3 displays the 9 most central image crops for a set of 10 different image clusters, along with the majority-vote label of each image cluster's associated audio cluster. In all cases, we see that the image crops are highly relevant to their audio cluster label. We include many more example image clusters in Appendix A.

Finally, we wish to examine the semantic embedding space in more depth. We took the top 150 clusters from the same k = 500 clustering run described in Table 3 and performed t-SNE (van der Maaten & Hinton, 2008) analysis on the cluster centroid vectors. We projected each centroid down to 2 dimensions and plotted their majority-vote labels in Figure 4 . Immediately we see that different clusters which capture the same label closely neighbor one another, indicating that distances in the embedding space do indeed carry information discriminative across word types (and suggesting that a more sophisticated clustering algorithm than k-means would perform better). More interestingly, we see that semantic information is also reflected in these distances. The cluster centroids for "lake," "river," "body," "water," "waterfall," "pond," and "pool" all form a tight meta-cluster, as do "restaurant," "store," "shop," and "shelves," as well as "children," "girl," "woman," and "man." Many other semantic meta-clusters can be seen in Figure 4 , suggesting that the embedding space is capturing information that is highly discriminative both acoustically and semantically.

Table 1 : Results for image search and annotation on the Places audio caption data (214k training pairs, 1k testing pairs). Recall is shown for the top 1, 5, and 10 hits. The model we use in this paper is compared against the meanpool variant of the model architecture presented in Harwath et al. (2016) . For both training and testing, the captions were truncated/zero-padded to 10 seconds.

Search Annotation Model:

R@1 R@5 R@10 R@1 R@5 R@10 

6. CONCLUSIONS AND FUTURE WORK:

In this paper, we have demonstrated that a neural network trained to associate images with the waveforms representing their spoken audio captions can successfully be applied to discover and cluster acoustic patterns representing words or short phrases in untranscribed audio data. An analogous procedure can be applied to visual images to discover visual patterns, and then the two modali- ties can be linked, allowing the network to learn e.g. that spoken instances of the word "train" are associated with image regions containing trains. This is done without the use of a conventional automatic speech recognition system and zero text transcriptions, and therefore is completely agnostic to the language in which the captions are spoken. Further, this is done in O(n) time with respect to the number of image/caption pairs, whereas previous state-of-the-art acoustic pattern discovery algorithms which leveraged acoustic data alone run in O(n 2 ) time. We demonstrate the success of our methodology on a large-scale dataset of over 214,000 image/caption pairs, comprising over 522 hours of spoken audio data. We have shown that the shared multimodal embedding space learned by our model is discriminative not only across visual object categories, but also acoustically and semantically across spoken words. To the best of our knowledge, this paper contains by far the largest scale speech pattern discovery experiment ever performed, as well as the first ever successful effort Under review as a conference paper at ICLR 2017 The future directions in which this research could be taken are incredibly fertile. Because our method creates a segmentation as well as an alignment between images and their spoken captions, a generative model could be trained using these alignments. The model could provide a spoken caption for an arbitrary image, or even synthesize an image given a spoken description. Modeling improvements are also possible, aimed at the goal of incorporating both visual and acoustic localization into the neural network itself. Additionally, by collecting a second dataset of captions for our images in a different language, such as Spanish, our model could be extended to learn the acoustic correspondences for a given object category in both languages. This paves the way for creating a speech-to-speech translation model not only with absolutely zero need for any sort of text transcriptions, but also with zero need for directly parallel linguistic data or manual human translations. 

:

EXPERIMENTAL DATAWe employ a corpus of over 200,000 spoken captions for images taken from the Places205 dataset(Zhou et al., 2014), corresponding to over 522 hours of speech data. The captions were collected using Amazon's Mechanical Turk service, in which workers were shown images and asked to describe them verbally in a free-form manner. Our data collection scheme is described in detail inHarwath et al. (2016), but the experiments in this paper leverage nearly twice the amount of data. For training our multimodal neural network as well as the pattern discovery experiments, we use a subset of 214,585 image/caption pairs, and we hold out a set of 1,000 pairs for evaluating the performance of the multimodal network's retrieval ability. Because we lack ground truth text transcripts for the data, we used Google's Speech Recognition public API to generate proxy transcripts which we use when analyzing our system. Note that the ASR was only used for analysis of the results, and was not involved in any of the learning.

3 AUDIO-VISUAL EMBEDDING NEURAL NETWORKSWe first train a deep multimodal embedding network similar in spirit to the one described inHarwath et al. (2016), but with a more sophisticated architecture. The model is trained to map entire image frames and entire spoken captions into a shared embedding space; however, as we will show, the trained network can then be used to localize patterns corresponding to words and phrases within the spectrogram, as well as visual objects within the image by applying it to small sub-regions of the image and spectrogram. The model is comprised of two branches, one which takes as input images, and the other which takes as input spectrograms. The image network is formed by taking the off-the-shelf VGG 16 layer network(Simonyan & Zisserman, 2014) and replacing the softmax classification layer with a linear transform which

maps the 4096-dimensional activations of the second fully connected layer into our 1024-dimensional multimodal embedding space. In our experiments, the weights of this projection layer are trained, but the layers taken from the VGG network below it are kept fixed. The second branch of our network analyzes speech spectrograms as if they were black and white images. Our spectrograms are computed using 40 log Mel filterbanks with a 25ms Hamming window and a 10ms shift. Therefore, the input to this branch always has 1 color channel

Figures and Tables:

Figure 1: An example of our grounding method. The left image displays a grid defining the allowed start and end coordinates for the bounding box proposals. The bottom spectrogram displays several audio region proposals drawn as the families of stacked red line segments. The image on the right and spectrogram on the top display the final output of the grounding algorithm. The top spectrogram also displays the time-aligned text transcript of the caption, so as to demonstrate which words were captured by the groundings. In this example, the top 3 groundings have been kept, with the colors indicating the audio segment which is grounded to each bounding box.

Figure 2: Scatter plot of audio cluster purity weighted by log cluster size against cluster variance for k = 500 (least-squares line superimposed).

Figure 3: The 9 most central image crops from several image clusters, along with the majority-vote label of their most associated acoustic pattern cluster

Figure 4: t-SNE analysis of the 150 lowest-variance audio pattern cluster centroids for k = 500. Displayed is the majority-vote transcription of the each audio cluster. All clusters shown contained a minimum of 583 members and an average of 2482, with an average purity of .668.

Examples of the breakdown of word/phrase identities of several acoustic clusters

Table content: <table><tr><td>Word</td><td>Count</td><td>Word</td><td>Count</td></tr><tr><td>ocean</td><td>2150</td><td>castle</td><td>766</td></tr><tr><td>(silence)</td><td>127</td><td>(silence)</td><td>70</td></tr><tr><td>the ocean</td><td>72</td><td>capital</td><td>39</td></tr><tr><td>blue ocean</td><td>29</td><td>large castle</td><td>24</td></tr><tr><td>body ocean</td><td>22</td><td>castles</td><td>23</td></tr><tr><td>oceans</td><td>16</td><td>(noise)</td><td>21</td></tr><tr><td>ocean water</td><td>16</td><td>council</td><td>13</td></tr><tr><td>(noise)</td><td>15</td><td>stone castle</td><td>12</td></tr><tr><td>of ocean</td><td>14</td><td>capitol</td><td>10</td></tr><tr><td>oceanside</td><td>14</td><td>old castle</td><td>10</td></tr></table>

Top 50 clusters with k = 500 sorted by increasing variance. Legend: |C c | is acoustic cluster size, |C i | is associated image cluster size, Pur. is acoustic cluster purity, σ 2 is acoustic cluster variance, and Cov. is acoustic cluster coverage. A dash (-) indicates a cluster whose majority label is silence.

Table content: <table><tr><td>Trans</td><td>|Cc|</td><td>|Ci|</td><td>Pur.</td><td>σ 2</td><td>Cov.</td><td>Trans</td><td>|Cc|</td><td>|Ci|</td><td>Pur.</td><td>σ 2</td><td>Cov.</td></tr><tr><td>-</td><td>1059</td><td>3480</td><td>0.70</td><td>0.26</td><td>-</td><td>snow</td><td>4331</td><td>3480</td><td>0.85</td><td>0.26</td><td>0.45</td></tr><tr><td>desert</td><td>1936</td><td>2896</td><td>0.82</td><td>0.27</td><td>0.67</td><td>kitchen</td><td>3200</td><td>2990</td><td>0.88</td><td>0.28</td><td>0.76</td></tr><tr><td>restaurant</td><td>1921</td><td>2536</td><td>0.89</td><td>0.29</td><td>0.71</td><td>mountain</td><td>4571</td><td>2768</td><td>0.86</td><td>0.30</td><td>0.38</td></tr><tr><td>black</td><td>4369</td><td>2387</td><td>0.64</td><td>0.30</td><td>0.17</td><td>skyscraper</td><td>843</td><td>3205</td><td>0.84</td><td>0.30</td><td>0.84</td></tr><tr><td>bridge</td><td>1654</td><td>2025</td><td>0.84</td><td>0.30</td><td>0.25</td><td>tree</td><td>5303</td><td>3758</td><td>0.90</td><td>0.30</td><td>0.16</td></tr><tr><td>castle</td><td>1298</td><td>2887</td><td>0.72</td><td>0.31</td><td>0.74</td><td>bridge</td><td>2779</td><td>2025</td><td>0.81</td><td>0.32</td><td>0.41</td></tr><tr><td>-</td><td>2349</td><td>2165</td><td>0.31</td><td>0.33</td><td>-</td><td>ocean</td><td>2913</td><td>3505</td><td>0.87</td><td>0.33</td><td>0.71</td></tr><tr><td>table</td><td>3765</td><td>2165</td><td>0.94</td><td>0.33</td><td>0.23</td><td>windmill</td><td>1458</td><td>3752</td><td>0.71</td><td>0.33</td><td>0.76</td></tr><tr><td>window</td><td>1890</td><td>2795</td><td>0.85</td><td>0.34</td><td>0.21</td><td>river</td><td>2643</td><td>3204</td><td>0.76</td><td>0.35</td><td>0.62</td></tr><tr><td>water</td><td>5868</td><td>3204</td><td>0.90</td><td>0.35</td><td>0.27</td><td>beach</td><td>1897</td><td>2964</td><td>0.79</td><td>0.35</td><td>0.64</td></tr><tr><td>flower</td><td>3906</td><td>2587</td><td>0.92</td><td>0.35</td><td>0.67</td><td>wall</td><td>3158</td><td>3636</td><td>0.84</td><td>0.35</td><td>0.23</td></tr><tr><td>sky</td><td>4306</td><td>6055</td><td>0.76</td><td>0.36</td><td>0.34</td><td>street</td><td>2602</td><td>2385</td><td>0.86</td><td>0.36</td><td>0.49</td></tr><tr><td>golf course</td><td>1678</td><td>3864</td><td>0.44</td><td>0.36</td><td>0.63</td><td>field</td><td>3896</td><td>3261</td><td>0.74</td><td>0.36</td><td>0.37</td></tr><tr><td>tree</td><td>4098</td><td>3758</td><td>0.89</td><td>0.36</td><td>0.13</td><td>lighthouse</td><td>1254</td><td>1518</td><td>0.61</td><td>0.36</td><td>0.83</td></tr><tr><td>forest</td><td>1752</td><td>3431</td><td>0.80</td><td>0.37</td><td>0.56</td><td>church</td><td>2503</td><td>3140</td><td>0.86</td><td>0.37</td><td>0.72</td></tr><tr><td>people</td><td>3624</td><td>2275</td><td>0.91</td><td>0.37</td><td>0.14</td><td>baseball</td><td>2777</td><td>1929</td><td>0.66</td><td>0.37</td><td>0.86</td></tr><tr><td>field</td><td>2603</td><td>3922</td><td>0.74</td><td>0.37</td><td>0.25</td><td>car</td><td>3442</td><td>2118</td><td>0.79</td><td>0.38</td><td>0.27</td></tr><tr><td>people</td><td>4074</td><td>2286</td><td>0.92</td><td>0.38</td><td>0.17</td><td>shower</td><td>1271</td><td>2206</td><td>0.74</td><td>0.38</td><td>0.82</td></tr><tr><td>people walking</td><td>918</td><td>2224</td><td>0.63</td><td>0.38</td><td>0.25</td><td>wooden</td><td>3095</td><td>2723</td><td>0.63</td><td>0.38</td><td>0.28</td></tr><tr><td>mountain</td><td>3464</td><td>3239</td><td>0.88</td><td>0.38</td><td>0.29</td><td>tree</td><td>3676</td><td>2393</td><td>0.89</td><td>0.39</td><td>0.11</td></tr><tr><td>-</td><td>1976</td><td>3158</td><td>0.28</td><td>0.39</td><td>-</td><td>snow</td><td>2521</td><td>3480</td><td>0.79</td><td>0.39</td><td>0.24</td></tr><tr><td>water</td><td>3102</td><td>2948</td><td>0.90</td><td>0.39</td><td>0.14</td><td>rock</td><td>2897</td><td>2967</td><td>0.76</td><td>0.39</td><td>0.26</td></tr><tr><td>-</td><td>2918</td><td>3459</td><td>0.08</td><td>0.39</td><td>-</td><td>night</td><td>3027</td><td>3185</td><td>0.44</td><td>0.39</td><td>0.59</td></tr><tr><td>station</td><td>2063</td><td>2083</td><td>0.85</td><td>0.39</td><td>0.62</td><td>chair</td><td>2589</td><td>2288</td><td>0.89</td><td>0.39</td><td>0.22</td></tr><tr><td>building</td><td>6791</td><td>3450</td><td>0.89</td><td>0.40</td><td>0.21</td><td>city</td><td>2951</td><td>3190</td><td>0.67</td><td>0.40</td><td>0.50</td></tr></table>

Clustering statistics of the acoustic clusters for various values of k and different settings of the variance-based cluster pruning threshold. Legend: |C| = number of clusters remaining after pruning, |X | = number of datapoints after pruning, Pur = purity, |L| = number of unique cluster labels, AC = average cluster coverage .364 149 .423 128 548866 .575 108 .463 500 499 1097225 .396 242 .332 278 623159 .591 196 .375 750 749 1101151 .409 308 .406 434 668771 .585 255 .450 1000 999 1103391 .411 373 .336 622 710081 .568 318 .382 1500 1496 1104631 .429 464 .316 971 750162 .566 413 .366 2000 1992 1106418 .431 540 .237 1354 790492 .546 484 .271

Table content: <table><tr><td/><td/><td colspan="2">σ 2 &lt; 0.9</td><td/><td/><td/><td colspan="2">σ 2 &lt; 0.65</td><td/><td/></tr><tr><td>k</td><td>|C|</td><td>|X |</td><td>Pur</td><td>|L|</td><td>AC</td><td>|C|</td><td>|X |</td><td>Pur</td><td>|L|</td><td>AC</td></tr><tr><td>250</td><td colspan="2">249 1081514</td><td/><td/><td/><td/><td/><td/><td/><td/></tr></table>

A APPENDIX: ADDITIONAL VISUALIZATIONS OF IMAGE PATTERN CLUSTERS

Table content: <table><tr><td>beach</td><td>cliff</td><td>pool</td><td>desert</td><td>field</td></tr><tr><td>chair</td><td>table</td><td>staircase</td><td>statue</td><td>stone</td></tr><tr><td>church</td><td>forest</td><td>mountain</td><td>skyscraper</td><td>trees</td></tr><tr><td>waterfall</td><td>windmills</td><td>window</td><td>city</td><td>bridge</td></tr><tr><td>flowers</td><td>man</td><td>wall</td><td>archway</td><td>baseball</td></tr><tr><td>boat</td><td>shelves</td><td>cockpit</td><td>girl</td><td>children</td></tr><tr><td>building</td><td>rock</td><td>kitchen</td><td>plant</td><td>hallway</td></tr></table>

Peer review (iclr2017):
This work proposes a joint classification of images and audio captions for the task of word like discovery of acoustic units that correlate to semantically visual objects. The general this is a very interesting direction of research as it allows for a richer representation of data: regularizing visual signal with audio and visa versa. This allows for training of visual models from video, etc. A major concern is the amount of novelty between this work and the author*s previous publication at NIPs 2016. The authors claim a more sophisticated architecture and indeed show an improvement in recall. However, the improvements are marginal, and the added complexity to the architecture is a bit ad hoc. Clustering and grouping in section 4, is hacky. Instead of gridding the image, the authors could actually use an object detector (SSD, Yolo, FasterRCNN, etc.) to estimate accurate object proposals; rather than using k-means, a spectral clustering approach would alleviate the gaussian assumption of the distributions. In assigning visual hypotheses with acoustic segments, some form of bi-partite matching should be used. Overall, I really like this direction of research, and encourage the authors to continue developing algorithms that can train from such multimodal datasets. However, the work isn*t quite novel enough from NIPs 2016.