Inverting and Visualizing Features for Object Detection

12/11/2012 ∙ by Carl Vondrick, et al. ∙ MIT 0

We introduce algorithms to visualize feature spaces used by object detectors. The tools in this paper allow a human to put on `HOG goggles' and perceive the visual world as a HOG based object detector sees it. We found that these visualizations allow us to analyze object detection systems in new ways and gain new insight into the detector's failures. For example, when we visualize the features for high scoring false alarms, we discovered that, although they are clearly wrong in image space, they do look deceptively similar to true positives in feature space. This result suggests that many of these false alarms are caused by our choice of feature space, and indicates that creating a better learning algorithm or building bigger datasets is unlikely to correct these errors. By visualizing feature spaces, we can gain a more intuitive understanding of our detection systems.



There are no comments yet.


page 1

page 2

page 4

page 5

page 6

page 8

page 9

Code Repositories


A tool to visualize feature spaces commonly used in object detection.

view repo


A tool to visualize feature spaces commonly used in object detection.

view repo


A tool to visualize feature spaces commonly used in object detection.

view repo
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

Figure 2

shows a high scoring detection from an object detector with HOG features and a linear SVM classifier trained on PASCAL. Despite our field’s incredible progress in object recognition over the last decade,

why do our detectors still think that lakes look like cars?

Figure 1: An image from PASCAL and a high scoring car detection from DPM [7]. Why did the detector fail?
Figure 2: We show the crop for the false car detection from Figure 2. On the right, we show our visualization of the HOG features for the same patch. Our visualization reveals that this false alarm actually looks like a car in HOG space.
Figure 1: An image from PASCAL and a high scoring car detection from DPM [7]. Why did the detector fail?
Figure 3: We visualize some high scoring detections from the deformable parts model [7] for person (top left), chair (top right), and car (bottom). Can you guess which are false alarms? Take a minute to study this figure, then see Figure 14 for the corresponding RGB patches.

Unfortunately, computer vision researchers are often unable to explain the failures of object detection systems. Some researchers blame the features, others the training set, and even more the learning algorithm. Yet, if we wish to build the next generation of object detectors, it seems crucial to understand the failures of our current detectors.

In this paper, we introduce tools to explain many of the failures of object detection systems.111Code is available online at We present algorithms to visualize the feature spaces of object detectors. Since features are too high dimensional for humans to directly inspect, our visualization algorithms work by inverting features back to natural images. We found that these inversions provide an intuitive and accurate visualization of the feature spaces used by object detectors.

Figure 2 shows the output from our visualization on the features for the false car detection. This visualization reveals that, while there are clearly no cars in the original image, there is a car hiding in the HOG descriptor. HOG features see a slightly different visual world than what we see, and by visualizing this space, we can gain a more intuitive understanding of our object detectors.

Figure 3 inverts more top detections on PASCAL for a few categories. Can you guess which are false alarms? Take a minute to study the figure since the next sentence might ruin the surprise. Although every visualization looks like a true positive, all of these detections are actually false alarms. Consequently, we can conclude that, even with a better learning algorithm or more data, these false alarms will likely persist. In other words, the features are to blame.

Figure 4: Examples of our HOG feature visualization.

The principle contribution of this paper is the presentation of algorithms for visualizing features used in object detection. To this end, we present four algorithms to invert object detection features to natural images. Although we focus on HOG features in this paper, our approach is general and can be applied to other features as well. We evaluate our inversions with both automatic benchmarks and a large human study, and we found our visualizations are perceptually more accurate at representing the content of a HOG feature than existing methods; see Figure 4 for a comparison between our visualization and HOG glyphs. We then use our visualizations to inspect the behaviors of object detection systems and analyze their features. Since we hope our visualizations will be useful to other researchers, our final contribution is a public feature visualization toolbox.

2 Related Work

Our visualization algorithms extend an actively growing body of work in feature inversion. Torralba and Oliva, in early work [21], described a simple iterative procedure to recover images only given gist descriptors [17]. Weinzaepfel et al. [23] were the first to reconstruct an image given its keypoint SIFT descriptors [13]. Their approach obtains compelling reconstructions using a nearest neighbor based approach on a massive database. d’Angelo et al. [3] then developed an algorithm to reconstruct images given only LBP features [2, 1]. Their method analytically solves for the inverse image and does not require a dataset.

While [23, 3, 21]

do a good job at reconstructing images from SIFT, LBP, and gist features, our visualization algorithms have several advantages. Firstly, while existing methods are designed for specific features, our visualization algorithms we propose are feature independent. Since we cast feature inversion as a machine learning problem, our algorithms can be used to visualize any feature. In this paper, we focus on features for object detection, the most popular of which is HOG. Secondly, our algorithms are fast: our best algorithm can invert features in under a second on a desktop computer, enabling interactive visualization. Finally, to our knowledge, this paper is the first to invert HOG.

Our visualizations enable analysis that complement a recent line of papers that provide tools to diagnose object recognition systems, which we briefly review here. Parikh and Zitnick [18, 19] introduced a new paradigm for human debugging of object detectors, an idea that we adopt in our experiments. Hoiem et al. [10] performed a large study analyzing the errors that object detectors make. Divvala et al. [5] analyze part-based detectors to determine which components of object detection systems have the most impact on performance. Tatu et al. [20] explored the set of images that generate identical HOG descriptors. Liu and Wang [12] designed algorithms to highlight which image regions contribute the most to a classifier’s confidence. Zhu et al. [25] try to determine whether we have reached Bayes risk for HOG. The tools in this paper enable an alternative mode to analyze object detectors through visualizations. By putting on ‘HOG glasses’ and visualizing the world according to the features, we are able to gain a better understanding of the failures and behaviors of our object detection systems.

3 Feature Visualization Algorithms

We pose the feature visualization problem as one of feature inversion, i.e. recovering the natural image that generated a feature vector. Let

be an image and be the corresponding HOG feature descriptor. Since is a many-to-one function, no analytic inverse exists. Hence, we seek an image that, when we compute HOG on it, closely matches the original descriptor :


Optimizing Eqn.1 is challenging. Although Eqn.1 is not convex, we tried gradient-descent strategies by numerically evaluating the derivative in image space with Newton’s method. Unfortunately, we observed poor results, likely because HOG is both highly sensitive to noise and Eqn.1 has frequent local minima.

In the rest of this section, we present four algorithms for inverting HOG features. Since, to our knowledge, no algorithms to invert HOG have yet been developed, we first describe three simple baselines for HOG inversion. In the last section, we present our main inversion algorithm.

3.1 Baseline A: Exemplar LDA (ELDA)

Figure 5: We found that averaging the images of top detections from an exemplar LDA detector provide one method to invert HOG features.

Consider the top detections for the exemplar object detector [9, 15] for a few images shown in Figure 5. Although all top detections are false positives, notice that each detection captures some statistics about the query. Even though the detections are wrong, if we squint, we can see parts of the original object appear in each detection.

We use this simple observation to produce our first inversion baseline. Suppose we wish to invert HOG feature . We first train an exemplar LDA detector [9] for this query, . We score against every sliding window on a large database. The HOG inverse is then the average of the top detections in RGB space: where is an image of a top detection.

This method, although simple, produces surprisingly accurate reconstructions, even when the database does not contain the category of the HOG template. However, it is computationally expensive since it requires running an object detector across a large database. We also point out that a similar nearest neighbor method is used in brain research to visualize what a person might be seeing [16].

3.2 Baseline B: Ridge Regression

We present a fast, parametric inversion baseline based off ridge regression. Let

be a random variable representing a gray scale image and

be a random variable of its corresponding HOG point. We define these random variables to be normally distributed on a

-variate Gaussian with parameters and . In order to invert a HOG feature

, we calculate the most likely image from the conditional Gaussian distribution



It is well known that Gaussians have a closed form conditional mode:


Under this inversion algorithm, any HOG point can be inverted by a single matrix multiplication, allowing for inversion in under a second.

We estimate

and on a large database. In practice, is not positive definite; we add a small uniform prior (i.e., ) so can be inverted. Since we wish to invert any HOG point, we assume that is stationary [9], allowing us to efficiently learn the covariance across massive datasets. We invert an arbitrary dimensional HOG point by marginalizing out unused dimensions.

We found that ridge regression yields blurred inversions. Intuitively, since HOG is invariant to shifts up to its bin size, there are many images that map to the same HOG point. Ridge regression is reporting the statistically most likely image, which is the average over all shifts. This causes ridge regression to only recover the low frequencies of the original image.

3.3 Baseline C: Direct Optimization

We now provide a baseline that attempts to find images that, when we compute HOG on it, sufficiently match the original descriptor. In order to do this efficiently, we only consider images that span a natural image basis. Let be the natural image basis. We found using the first eigenvectors of worked well for this basis. Any image can be encoded by coefficients in this basis: . We wish to minimize:


Empirically we found success optimizing Eqn.4 using coordinate descent on with random restarts. We use an over-complete basis corresponding to sparse Gabor-like filters for . We compute the eigenvectors of across different scales and translate smaller eigenvectors to form .

3.4 Algorithm D: Paired Dictionary Learning

Figure 6: Inverting HOG using paired dictionary learning. We first project the HOG vector on to a HOG basis. By jointly learning a coupled basis of HOG features and natural images, we then transfer the coefficients to the image basis to recover the natural image.
Figure 7: Some pairs of dictionaries for and . The left of every pair is the gray scale dictionary element and the right is the positive components elements in the HOG dictionary. Notice the correlation between dictionaries.

In this section, we present our main inversion algorithm. Let be an image and be its HOG descriptor. Suppose we write and in terms of bases and respectively, but with shared coefficients :


The key observation is that inversion can be obtained by first projecting the HOG features onto the HOG basis , then projecting into the natural image basis :


See Figure 6 for a graphical representation of the paired dictionaries. Since efficient solvers for Eqn.6 exist [14, 11], we can invert features in under two seconds on a 4 core CPU.

Paired dictionaries require finding appropriate bases and such that Eqn.5

holds. To do this, we solve a paired dictionary learning problem, inspired by recent super resolution sparse coding work

[24, 22]:


After a few algebraic manipulations, the above objective simplifies to a standard sparse coding and dictionary learning problem with concatenated dictionaries, which we optimize using SPAMS [14]. Optimization typically took a few hours on medium sized problems. We estimate and with a dictionary size and training samples from a large database. See Figure 7 for a visualization of the learned dictionary pairs.

Unfortunately, the paired dictionary learning formulation suffers on problems of nontrivial scale. In practice, we only learn dictionaries for HOG templates. In order to invert a HOG template , we invert every subpatch inside and average overlapping patches in the final reconstruction. We found that this approximation works well in practice.

4 Evaluation of Visualizations

We evaluate our inversion algorithms using both qualitative and quantitative measures. We use PASCAL VOC 2011 [6] as our dataset and we invert patches corresponding to objects. Any algorithm that required training could only access the training set. During evaluation, only images from the validation set are examined. The database for exemplar LDA excluded the category of the patch we were inverting to reduce the potential effect of dataset biases.

(a) Original
(b) ELDA
(c) Ridge
(d) Direct
(e) PairDict
Figure 8: We show the results for all four of our inversion algorithms on held out image patches on similar dimensions common for object detection.

We show our inversions in Figure 8 for a few object categories. Exemplar LDA and ridge regression tend to produce blurred visualizations. Direct optimization recovers high frequency details at the expense of extra noise. Paired dictionary learning tends to produce the best visualization for HOG descriptors. By learning a dictionary over the visual world and the correlation between HOG and natural images, paired dictionary learning recovered high frequencies without introducing significant noise.

We discovered that the paired dictionary is able to recover color from HOG descriptors. Figure 9 shows the result of training a paired dictionary to estimate RGB images instead of grayscale images. While the paired dictionary assigns arbitrary colors to man-made objects and in-door scenes, it frequently colors natural objects correctly, such as grass or the sky, likely because those categories are strongly correlated to HOG descriptors. We focus on grayscale visualizations in this paper because we found those to be more intuitive for humans to understand.

Figure 9: We show results where our paired dictionary algorithm is trained to recover RGB images instead of only grayscale images. The right shows the original image and the left shows the inverse.

Our HOG inversions are sensitive to the dimension of their templates. For medium () to large templates (), we obtain reasonable performance. But, for small templates () the inversion is blurred. Fig.10 shows examples as the HOG descriptor dimension changes.

In the remainder of this section, we evaluate our algorithms under two benchmarks. Firstly, we evaluate against an automatic inversion metric that measures how well our inversions reconstruct the original images. Secondly, we conducted a large visualization challenge with human subjects on Amazon Mechanical Turk (MTurk), which is designed to determine how well people can infer the original category from the inverse. The first experiment measures the algorithm’s reconstruction error, while the second experiment analyzes the people’s ability to recover high level semantics from our visualizations.

4.1 Inversion Benchmark

We consider the inversion performance of our algorithm: given a HOG feature , how well does our inverse reconstruct the original pixels for each algorithm? Since HOG is invariant up to a constant shift and scale, we score each inversion against the original image with normalized cross correlation. Our results are shown in Table 1. Overall, exemplar LDA does the best at pixel level reconstruction.

Category ELDA Ridge Direct PairDict
bicycle 0.452 0.577 0.513 0.561
bottle 0.697 0.683 0.660 0.671
car 0.668 0.677 0.652 0.639
cat 0.749 0.712 0.687 0.705
chair 0.660 0.621 0.604 0.617
table 0.656 0.617 0.582 0.614
horse 0.686 0.633 0.586 0.635
motorbike 0.573 0.617 0.549 0.592
person 0.696 0.667 0.646 0.646
Mean 0.671 0.656 0.620 0.637
Table 1: We evaluate the performance of our inversion algorithm by comparing the inverse to the ground truth image using the mean normalized cross correlation. Higher is better; a score of 1 is perfect.
Category ELDA Ridge Direct PairDict Glyph Expert
bicycle 0.327 0.127 0.362 0.307 0.405 0.438
bottle 0.269 0.282 0.283 0.446 0.312 0.222
car 0.397 0.457 0.617 0.585 0.359 0.389
cat 0.219 0.178 0.381 0.199 0.139 0.286
chair 0.099 0.239 0.223 0.386 0.119 0.167
table 0.152 0.064 0.162 0.237 0.071 0.125
horse 0.260 0.290 0.354 0.446 0.144 0.150
motorbike 0.221 0.232 0.396 0.224 0.298 0.350
person 0.458 0.546 0.502 0.676 0.301 0.375
Mean 0.282 0.258 0.355 0.383 0.191 0.233
Table 2: We evaluate visualization performance across twenty PASCAL VOC categories by asking MTurk workers to classify our inversions. Numbers are percent classified correctly; higher is better. Chance is . Glyph refers to the standard black-and-white HOG diagram popularized by [4]. Paired dictionary learning provides the best visualizations for humans. Expert refers to PhD students in computer vision performing the same visualization challenge with HOG glyphs.
Figure 10: Our inversion algorithms are sensitive to the HOG template size. Larger templates are easier to invert since they are less invariant. We show how performance degrades as the template becomes smaller. Dimensions in HOG space shown: , , , and .

4.2 Visualization Benchmark

While the inversion benchmark evaluates how well the inversions reconstruct the original image, it does not capture the high level content of the inverse: is the inverse of a sheep still a sheep? To evaluate this, we conducted a study on MTurk. We sampled 2,000 windows corresponding to objects in PASCAL VOC 2011. We then showed participants an inversion from one of our algorithms and asked users to classify it into one of the 20 categories. Each window was shown to three different users. Users were required to pass a training course and qualification exam before participating in order to guarantee users understood the task. Users could optionally select that they were not confident in their answer. We also compared our algorithms against the standard black-and-white HOG glyph popularized by [4].

Our results in Table 2 show that paired dictionary learning and direct optimization provide the best visualization of HOG descriptors for humans. Ridge regression and exemplar LDA performs better than the glyph, but they suffer from blurred inversions. Human performance on the HOG glyph is generally poor, and participants were even the slowest at completing that study. Interestingly, the glyph does the best job at visualizing bicycles, likely due to their unique circular gradients. Our results overall suggest that visualizing HOG with the glyph is misleading, and richer visualizations from our paired dictionary are useful for interpreting HOG vectors.

There is strong correlation with the accuracy of humans classifying the HOG inversions with the performance of HOG based object detectors. We found human classification accuracy on inversions and the state-of-the-art object detection AP scores from [8] are correlated with a Spearman’s rank correlation coefficient of 0.77. This result suggests that humans can predict the performance of object detectors by only looking at HOG visualizations.

We also asked computer vision PhD students to classify HOG glyphs in order to compare MTurk workers with experts in HOG. Our results are summarized in the last column of Table 2. HOG experts performed slightly better than non-experts on the glyph challenge, but experts on glyphs did not beat non-experts on other visualizations. This result suggests that our algorithms produce more intuitive visualizations even for object detection researchers.

5 Understanding Object Detectors

(a) Human Vision
(b) HOG Vision
Figure 11: HOG inversion reveals the world that object detectors see. The left shows a man standing in a dark room. If we compute HOG on this image and invert it, the previously dark scene behind the man emerges. Notice the wall structure, the lamp post, and the chair in the bottom right hand corner.

We have so far presented four algorithms to visualize object detection features. We evaluated the visualizations with a large human study, and we found that paired dictionary learning provides the most intuitive visualization of HOG features. In this section, we will use this visualization to inspect the behavior of object detection systems.

5.1 HOG Goggles

Our visualizations reveal that the world that features see is slightly different from the world that the human eye perceives. Figure (a)a shows a normal photograph of a man standing in a dark room, but Figure (b)b shows how HOG features see the same man. Since HOG is invariant to illumination changes and amplifies gradients, the background of the scene, normally invisible to the human eye, materializes in our visualization.

In order to understand how this clutter affects object detection, we visualized the features of some of the top false alarms from the Felzenszwalb et al. object detection system [7] when applied to the PASCAL VOC 2007 test set. Figure 3 shows our visualizations of the features of the top false alarms. Notice how the false alarms look very similar to true positives. This result suggests that these failures are due to limitations of HOG, and consequently, even if we develop better learning algorithms or use larger datasets, these will false alarms will likely persist.

Figure 14 shows the corresponding RGB image patches for the false positives discussed above. Notice how when we view these detections in image space, all of the false alarms are difficult to explain. Why do chair detectors fire on buses, or people detectors on cherries? Instead, by visualizing the detections in feature space, we discovered that the learning algorithm actually made reasonable failures since the features are deceptively similar to true positives.

5.2 Human+HOG Detectors

Although HOG features are designed for machines, how well do humans see in HOG space? If we could quantify human vision on the HOG feature space, we could get insights into the performance of HOG with a perfect learning algorithm (people). Inspired by Parikh and Zitnick’s methodology [18, 19], we conducted a large human study where we had Amazon Mechanical Turk workers act as sliding window HOG based object detectors.

We built an online interface for humans to look at HOG visualizations of window patches at the same resolution as DPM. We instructed workers to either classify a HOG visualization as a positive example or a negative example for a category. By averaging over multiple people (we used 25 people per window), we obtain a real value score for a HOG patch. To build our dataset, we sampled top detections222Note that recall will now go to in these experiments because we only consider windows that DPM detects. Consequently, this experiment can only give us relative orderings of detectors. Unfortunately, computing full precision-recall curves is cost prohibitive. from DPM on the PASCAL VOC 2007 dataset for a few categories. Our dataset consisted of around windows per category and around were true positives.

Figure 12: By instructing multiple human subjects to classify the visualizations, we show performance results with an ideal learning algorithm (i.e., humans) on the HOG feature space. Please see text for details.

Figure 12 shows precision recall curves for the Human+HOG based object detector. In most cases, human subjects classifying HOG visualizations were able to rank sliding windows with either the same accuracy or better than DPM. Humans tied DPM for recognizing cars, suggesting that performance may be saturated for car detection on HOG. Humans were slightly superior to DPM for chairs, although performance might be nearing saturation soon. There appears to be the most potential for improvement for detecting cats with HOG. Subjects performed slightly worst than DPM for detecting people, but we believe this is the case because humans tend to be good at fabricating people in abstract drawings.

We then repeated the same experiment as above on chairs except we instructed users to classify the original RGB patch instead of the HOG visualization. As expected, humans achieved near perfect accuracy at detecting chairs with RGB sliding windows. The performance gap between the Human+HOG detector and Human+RGB detector demonstrates the amount of information that HOG features discard.

Our experiments suggest that there is still some performance left to be squeezed out of HOG. However, DPM is likely operating very close to the performance limit of HOG. Since humans are the ideal learning agent and they still had trouble detecting objects in HOG space, HOG may be too lossy of a descriptor for high performance object detection. If we wish to significantly advance the state-of-the-art in recognition, we suspect focusing effort on building better features that capture finer details as well as higher level information will lead to substantial performance improvements in object detection.

5.3 Model Visualization

We found our algorithms are also useful for visualizing the learned models of an object detector. Figure 13 visualizes the root templates and the parts from [7] by inverting the positive components of the learned weights. These visualizations provide hints on which gradients the learning found discriminative. Notice the detailed structure that emerges from our visualization that is not apparent in the HOG glyph. In most cases, one can recognize the category of the detector by only looking at the visualizations.

Figure 13: We visualize a few deformable parts models trained with [7]. Notice the structure that emerges with our visualization. First row: car, person, bottle, bicycle, motorbike, potted plant. Second row: train, bus, horse, television, chair. For the right most visualizations, we also included the HOG glyph. Our visualizations tend to reveal more detail than the glyph.
Figure 14: We show the original RGB patches that correspond to the visualizations from Figure 3. We print the original patches on a separate page to highlight how the inverses of false positives look like true positives. We recommend comparing this figure side-by-side with Figure 3. Top left: person detections, top right: chair detections, bottom: car detections.

6 Conclusion

We believe visualizations can be a powerful tool for understanding object detection systems and advancing research in computer vision. To this end, this paper presented and evaluated four algorithms to visualize object detection features. Since object detection researchers analyze HOG glyphs everyday and nearly every recent object detection paper includes HOG visualizations, we hope more intuitive visualizations will prove useful for the community.


We thank Hamed Pirsiavash, Joseph Lim, the MIT CSAIL vision group, and anonymous reviewers. Funding for this research was provided by a NSF GRFP to CV, a Facebook fellowship to AK, and a Google research award, ONR MURI N000141010933 and NSF Career Award No. 0747120 to AT.


  • [1] A. Alahi, R. Ortiz, and P. Vandergheynst (2012) FREAK: fast retina keypoint. In CVPR, Cited by: §2.
  • [2] M. Calonder, V. Lepetit, C. Strecha, and P. Fua (2010) Brief: binary robust independent elementary features. ECCV. Cited by: §2.
  • [3] E. d’Angelo, A. Alahi, and P. Vandergheynst (2012) Beyond bits: reconstructing images from local binary descriptors. ICPR. Cited by: §2, §2.
  • [4] N. Dalal and B. Triggs (2005) Histograms of oriented gradients for human detection. In CVPR, Cited by: §4.2, Table 2.
  • [5] S.K. Divvala, A.A. Efros, and M. Hebert (2012) How important are deformable parts in the deformable parts model?. Technical Report. Cited by: §2.
  • [6] M. Everingham, L. Van Gool, C. K. I. Williams, J. Winn, and A. Zisserman (2010) The pascal visual object classes (voc) challenge. IJCV. Cited by: §4.
  • [7] P.F. Felzenszwalb, R.B. Girshick, D. McAllester, and D. Ramanan (2010) Object detection with discriminatively trained part-based models. PAMI. Cited by: Figure 2, Figure 3, Figure 13, §5.1, §5.3.
  • [8] P.F. Felzenszwalb, R.B. Girshick, and D. McAllester (2010) Cascade object detection with deformable part models. In CVPR, Cited by: §4.2.
  • [9] B. Hariharan, J. Malik, and D. Ramanan (2012) Discriminative decorrelation for clustering and classification. ECCV. Cited by: §3.1, §3.1, §3.2.
  • [10] D. Hoiem, Y. Chodpathumwan, and Q. Dai (2012) Diagnosing error in object detectors. ECCV. Cited by: §2.
  • [11] H. Lee, A. Battle, R. Raina, and A.Y. Ng (2007) Efficient sparse coding algorithms. NIPS. Cited by: §3.4.
  • [12] L. Liu and L. Wang (2012) What has my classifier learned? visualizing the classification rules of bag-of-feature model by support region detection. In CVPR, Cited by: §2.
  • [13] D.G. Lowe (1999) Object recognition from local scale-invariant features. In ICCV, Cited by: §2.
  • [14] J. Mairal, F. Bach, J. Ponce, and G. Sapiro (2009) Online dictionary learning for sparse coding. In ICML, Cited by: §3.4, §3.4.
  • [15] T. Malisiewicz, A. Gupta, and A.A. Efros (2011) Ensemble of exemplar-svms for object detection and beyond. In ICCV, Cited by: §3.1.
  • [16] S. Nishimoto, A.T. Vu, T. Naselaris, Y. Benjamini, B. Yu, and J.L. Gallant (2011) Reconstructing visual experiences from brain activity evoked by natural movies. Current Biology. Cited by: §3.1.
  • [17] A. Oliva, A. Torralba, et al. (2006) Building the gist of a scene: the role of global image features in recognition. Progress in Brain Research. Cited by: §2.
  • [18] D. Parikh and C.L. Zitnick (2011) Human-debugging of machines. In Workshop on Computational Social Science and the Wisdom of Crowds, NIPS, Cited by: §2, §5.2.
  • [19] D. Parikh and C. L. Zitnick (2010) The role of features, algorithms and data in visual recognition. In CVPR, Cited by: §2, §5.2.
  • [20] A. Tatu, F. Lauze, M. Nielsen, and B. Kimia (2011) Exploring the representation capabilities of the hog descriptor. In ICCV Workshops, Cited by: §2.
  • [21] A. Torralba and A. Oliva (2002) Depth estimation from image structure. PAMI. Cited by: §2, §2.
  • [22] S. Wang, L. Zhang, Y. Liang, and Q. Pan (2012) Semi-coupled dictionary learning with applications to image super-resolution and photo-sketch synthesis. In CVPR, Cited by: §3.4.
  • [23] P. Weinzaepfel, H. Jégou, and P. Pérez (2011) Reconstructing an image from its local descriptors. In CVPR, Cited by: §2, §2.
  • [24] J. Yang, J. Wright, T.S. Huang, and Y. Ma (2010) Image super-resolution via sparse representation. Transactions on Image Processing. Cited by: §3.4.
  • [25] X. Zhu, C. Vondrick, D. Ramanan, and C.C. Fowlkes (2012) Do we need more training data or better models for object detection?. BMVC. Cited by: §2.

Appendix A Full Evaluation Tables

We provide the full inversion benchmark with normalized cross correlation:

Category ELDA Ridge Direct PairDict
aeroplane 0.634 0.633 0.596 0.609
bicycle 0.452 0.577 0.513 0.561
bird 0.680 0.650 0.618 0.638
boat 0.697 0.678 0.631 0.629
bottle 0.697 0.683 0.660 0.671
bus 0.627 0.632 0.587 0.585
car 0.668 0.677 0.652 0.639
cat 0.749 0.712 0.687 0.705
chair 0.660 0.621 0.604 0.617
cow 0.720 0.663 0.632 0.650
table 0.656 0.617 0.582 0.614
dog 0.717 0.676 0.638 0.667
horse 0.686 0.633 0.586 0.635
motorbike 0.573 0.617 0.549 0.592
person 0.696 0.667 0.646 0.646
pottedplant 0.674 0.679 0.629 0.649
sheep 0.743 0.731 0.692 0.695
sofa 0.691 0.657 0.633 0.657
train 0.697 0.684 0.634 0.645
tvmonitor 0.711 0.640 0.638 0.629
Mean 0.671 0.656 0.620 0.637

We provide the full visualization benchmark with human subjects:

Category ELDA Ridge Direct PairDict Glyph Expert
aeroplane 0.433 0.391 0.568 0.645 0.297 0.333
bicycle 0.327 0.127 0.362 0.307 0.405 0.438
bird 0.364 0.263 0.378 0.372 0.193 0.059
boat 0.292 0.182 0.255 0.329 0.119 0.352
bottle 0.269 0.282 0.283 0.446 0.312 0.222
bus 0.473 0.395 0.541 0.549 0.122 0.118
car 0.397 0.457 0.617 0.585 0.359 0.389
cat 0.219 0.178 0.381 0.199 0.139 0.286
chair 0.099 0.239 0.223 0.386 0.119 0.167
cow 0.133 0.103 0.230 0.197 0.072 0.214
table 0.152 0.064 0.162 0.237 0.071 0.125
dog 0.222 0.316 0.351 0.343 0.107 0.150
horse 0.260 0.290 0.354 0.446 0.144 0.150
motorbike 0.221 0.232 0.396 0.224 0.298 0.350
person 0.458 0.546 0.502 0.676 0.301 0.375
pottedplant 0.112 0.109 0.203 0.091 0.080 0.136
sheep 0.227 0.194 0.368 0.253 0.041 0.000
sofa 0.138 0.100 0.162 0.293 0.104 0.000
train 0.311 0.244 0.316 0.404 0.173 0.133
tvmonitor 0.537 0.439 0.449 0.682 0.354 0.666
Mean 0.282 0.258 0.355 0.383 0.191 0.233

Appendix B Visualization Class Confusions

We show the confusion matrices for humans classifying our HOG inversions for various algorithms:

Appendix C Additional Color Inversions

On the left, we show the color inverse. On the right, we show the original image.