Reflectance Hashing for Material Recognition

02/07/2015 ∙ by Hang Zhang, et al. ∙ Drexel University Rutgers University 0

We introduce a novel method for using reflectance to identify materials. Reflectance offers a unique signature of the material but is challenging to measure and use for recognizing materials due to its high-dimensionality. In this work, one-shot reflectance is captured using a unique optical camera measuring reflectance disks where the pixel coordinates correspond to surface viewing angles. The reflectance has class-specific stucture and angular gradients computed in this reflectance space reveal the material class. These reflectance disks encode discriminative information for efficient and accurate material recognition. We introduce a framework called reflectance hashing that models the reflectance disks with dictionary learning and binary hashing. We demonstrate the effectiveness of reflectance hashing for material recognition with a number of real-world materials.



There are no comments yet.


page 1

page 2

page 3

page 6

page 7

page 8

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

Color and geometry are not a full measure of the richness of visual appearance. Material composition of a physical surface point determines the characteristics of light interaction and the reflection to an observer. In the everyday real world there are a vast number of materials that are useful to discern including concrete, metal, plastic, velvet, satin, asphalt, carpet, tile, skin, hair, wood, and marble. A computational method for identifying these materials has important implications in developing new algorithms and new technologies for a broad set of application domains. For example, a mobile robot or autonomous automobile can use material recognition to determine whether the terrain is asphalt, grass, gravel, ice or snow in order to optimize mechanical control. An indoor mobile robot can distinguish among wood, tile, or carpet for cleaning tasks. The material composition of objects can be tagged for an e-commerce inventory or for characterizing multi-composite 3D printed objects. The potential applications are limitless in areas such as robotics, digital architecture, human-computer interaction, intelligent vehicles, and advanced manufacturing. Furthermore, just as computer vision algorithms now use depth sensors directly from RGB-D cameras, material sensors can have foundational importance in nearly all vision algorithms including segmentation, feature matching, scene recognition, image-based rendering, context-based search, object recognition, and motion estimation.

(a) Leather Surface
(b) Reflectance Disk
(c) Texton Map
(d) Auto Paint Surface
(e) Reflectance Disk
(f) Texton Map
Figure 1: Reflectance disks provide a quick snapshot of the intrinsic reflectance of a surface point. Gradients of the reflectance space are captured with textons and provide a signature for material recognition.

Our approach uses reflectance for material recognition because of the advantages of having an intrinsic optical signature for the surface. However, we bypass the use of a gonioreflectometer by using a novel one-shot reflectance camera based on a parabolic mirror design. The output of this camera is a reflectance disk, a dense sampling of the surface reflectance of the material projected into a single image as shown for two example surfaces in Figure 1. Each reflectance disk measures surface properties for a single point and can capture complex appearance such as the iridescence of a peacock feather as illustrated in Figure 2. We then use this convenient reflectance measurement as the discriminative characteristic for recognizing the material class. We address the issue of high dimensionality using a novel application of binary hash codes to encode reflectance information in an efficient yet discriminitve representation. The key idea is to obtain sufficient sampling of the reflectance with enough discriminative power and reduce its representation size so that it can be effectively used for probing the material.

We present a database of reflectance images comprised of twenty different diverse material classes including wood, velvet, ceramic and automotive paint with 10 spot measurements per surface and with three different surface instances per class. Measurements include three on-axis illumination angles () and ten random spot measurements over the surface. Each spot measurement is a reflectance disk composed of a dense sampling of viewing angles totaling thousands of reflectance angles per disk. The database of 3600 images or reflectance disks is made publicly available. For recognition, we combine binary hash coding and texton boosting for a new framework called reflectance hashing for efficient and accurate recognition of materials. We compare reflectance hashing with texton boosting for the task of recognizing materials from reflectance disks.

Figure 2: Reflectance disks provide a snapshot of the reflectance function for spot samples on the surface. For this example of a peacock feather, iridescence causes a large variation of intensity with viewing direction as revealed in the three reflectance disks.

2 Related work

Prior methods for material recognition use two distinct approaches. One approach assesses material identity using reflectance as an intrinsic property of the surface [26, 5, 19, 17, 13]. Another main approach identifies material labels using the appearance of the surface within the real world scene [34, 23, 21]. Using reflectance instead of scene appearance has the advantage that reflectance is a direct measurement of the material characteristics, instead of its phenomenological appearance [1]. Reflectance is mostly unique to the material, whereas the appearance is the convoluted end result of the interaction of all the intrinsic and extrinsic factors and thus more difficult to decipher.

Figure 3: Schematic of the mirror-based camera. Reflectance disks are obtained by viewing a single point under multiple viewing directions using a concave parabolic mirror viewed by a telecentric lens.
Figure 4: Gradients on the Reflectance Disk Extracted with Textons: Images are filtered by a filter bank comprised of Gaussian, Laplacian and oriented gradient filters. The

responses vectors are clustered to form visual words or textons. A random subsampling of rectangular subregions of the reflectance space defines regions of interest

. The feature of interest is , the count of pixels identified as texton in region .

A challenge in using reflectance for material recognition is that measurements are typically difficult and cumbersome. For example, most methods require knowledge of the scene like geometry [26, 27] or illumination [31, 30]. Other methods require lab-based measurements of the BRDF (bidirectional reflectance distribution function) or BRDF slices such as light domes for illumination patterns [22]. Acquiring full BRDF requires gonioreflectometers that are comprised of multiple cameras and light sources covering the hemisphere of possible directions using geodesic domes or robotics as in [9, 43, 20, 8, 28, 29, 42]. Surface appearance in terms of relief texture is captured by the GelSight camera [15] using three-color photometric stereo by imprinting the surface geometry on an elastomer surface with Lambertian skin. With this device very fine geometric texture can be recovered but surface appearance is lost. An additional challenge of using reflectance for measurements is the high dimensionality, reflectance as a function of illumination and viewing direction especially if densely sampled can lead to thousands or more samples per surface point.

Specialized cameras have been developed in prior research to obtain reflectance measurements of surfaces efficiently. The mirror-based camera illustrated in Figure 7 is one such a device [8, 6]. This camera views an image of a single surface point by using a concave parabolic mirror with the focus coincident with the target point. In this manner, the camera records a multiview image of a surface point where each pixel records a different angle. Multiple views from mirror-based optics is also achieved with a kaleidoscope-like configuration [14]. However, the viewing angles captured in this device are discrete and sparse. Because our approach relies uses gradients in angular space a dense sampling of reflectance is needed and we use the parabolic mirror-based camera as a reflectance sensor.

In prior work, recognition of standard scene images is typically accomplished using image features that capture the spatial variation of image intensity. For example, image filtering with a set of filter banks followed by grouping the outputs into characteristic textons has been used for image texture [19, 4, 40], object recognition [35, 36] and image segmentation [18]. Similarly, we encode the discriminative optical characteristics of materials captured in the reflectance disks with a texton-based representation. Texton methods for the general problem of scene and image recognition have been improved significantly by incorporating boosting as in Texton-boost [36] and Joint-boost [38]. We incorporate the utility of boosting to identify a discriminitive and compact representation.

The goal of efficient recognition of images for large scale search has led to numerous methods for binary hash codes [16, 2, 41, 24, 25]. A common approach in recent work [44, 37, 16, 33] is learning binary codes where the Hamming distance approximates the kernel distance between appearance descriptors. This method is used when the kernel distance is known to give good performance but is expensive to compute and store. Inspired by the work in image search, we develop reflectance hashing with binary codes that allow matching of measured reflectance disks with those in the labeled training set. The binary codes are learned using the match metric obtained from the texton-based descriptor we present in Section 3. We use a suite of state-of-the-art hashing techniques applied to our measured reflectance disk dataset to evaluate recognition performance in terms of speed and recognition accuracy.

3 Methods

3.1 Reflectance Disk Measurements

We use the texture camera approach introduced in [7, 6] for measuring reflectance of surface points, The measurement camera mainly consists of a parabolic mirror, a CCD camera, a movable aperture and a beam splitter. The imaging components and their arrangement are illustrated in Figure 3. A parabolic mirror section is fixed so that its focus is at the surface point to be measured. The illumination source is a collimated beam of light parallel to the global plane of the surface and passing through a movable aperture. The angle of the incident ray reaching the surface is determined by the intersection point with the mirror. Therefore, the illumination direction is determined by the aperture position. Light reflected from the surface point is reflected by the mirror to a set of parallel rays directed through a beam splitter to the camera. Each pixel of this camera image corresponds to a viewing direction of the surface point. Therefore, the recorded image is an observation of a single point on the surface but from a dense sampling of viewing directions. Multiple illumination directions can be measured by planar motions of the illumination aperture. A key advantage of this approach is the potential for a handheld reflectance sensor where the mirror and light source are attached to a handheld camera.

We refer to the camera’s output images as reflectance disks since they depict circular regions from on-axis projections of a paraboloid. Examples of these reflectance disks are shown in Figure 1 for two surfaces. These examples show the variation of the surface reflectance with viewing angle. Reflectance disks have an intensity variation that corresponds to angular change with the viewing direction instead of spatial change on the surface. However, the reflectance disks can be interpreted as images and filtered to find characteristic gradients. This approach of using angular gradients in reflectance space is a novel contribution of our work. Our goal is to represent the measurements in an efficient and meaningful way that supports material recognition.

3.2 Textons on the Reflectance Disk

Figure 5: Gradients on the reflectance disk are computed using image filtering. However, the angular resolution varies over the surface as shown above. The angle at is different from . Therefore differences (or filtering) computed with a uniform spacing on the reflectance disk have a non-uniform mapping to angles.

We find characteristic patterns of intensity in a reflectance disk by computing spatial change in the reflectance disk via image filtering. Since spatial coordinates of the reflectance disk map to angular coordinates of reflectance, filtering is a convenient way to compute angular gradients of the reflectance. A common method of quantifying intensity patterns is using textons. Textons are computed by first filtering the image with a set of gradient filters at different orientations and scales. We employ the same filter banks as in [19], comprised of Gaussian low-pass filters at four scales, Laplacian filters at four scales and eight gradient filters at different orientations and scales for a total of 24 filters. The resulting responses at each pixel are clustered using -means clustering and a dictionary of visual words called textons is created. The underlying assumption is that the local intensity variation can be captured with the finite set of characteristic filter responses that are the centers of each of the clusters.

We use textons as a reflectance feature to provide a dense, per-pixel description of reflectance variation. Methods to detect key-points are useful for scene images, but reflectance disks do not typically have specific key-points of interest.

For texton computation, we use gradient filters that approximate the derivative operator with a discrete spatial difference filter. This discrete approximation of the gradient computes change over a non-infinitesimal distance, typically the difference of neighboring pixels. The distance between these neighboring pixels is constant over the reflectance disk, i.e. the same gradient filter is applied over the entire disk image. However, because of the mapping from spatial coordinates to angular coordinates by the parabolic mirror, the angular distance is not constant. This situation is illustrated in Figure 5 where the cone angle at the surface is shown for two different locations on the parabolic mirror. A constant distance on the projected disk leads to two different cone angles. Consequently, the resolution for the angular gradient varies as a function of disk coordinates.

The equation of the parabolic mirror surface is given by,


where the -axis is the optical axis of the mirror aligned with the camera optical axis, the plane is aligned with the disk-shaped projection of the mirror surface on camera’s image plane, and is the mirror focal length (12.7 mm). Define the cone angle as the set of angles subtended by arc or in Figure 5, where is taken as 2 pixel units. From this equation, the variation of the cone angle as a function of the vertical spatial coordinate on the reflectance disk is derived in [6] as


Since the geometry of the mirror is known, the spatial filters can be adaptive to ensure a uniform cone angle over the disk. However, the spatially invariant gradient filter provides a discriminitive representation and uniformity of angular resolution is not required.

Reflectance-Layout Filter

Textons are a local measure of image structure, and texton histograms are used to represent a region. The histogram representation has the advantage of invariance to shifts of structures. Reflectance disks show the structure of the reflectance field, but often the distribution within that structure is the characteristic property. Histogram representations have the drawback that crucial spatial information is lost. We follow the texton boost framework [35, 36, 38] to encode the characteristic spatial structure of the reflectance disk by defining a set of randomly shaped rectangular regions over the disk. For a given texton and region , is the count of pixels labelled with texton that are located within region as illustrated in Figure 4. We use this response as a key feature for describing the reflectance disks. This response is referred to as the texture-layout filter response when applied to ordinary images [36]. For material recognition using reflectance disks, we use the term reflectance-layout filter to indicate that the representation captures the angular layout of reflectance gradients. For computing reflectance-layout filter responses, the number of particular textons in a region, the texton count is calculated using a soft-weighting for the 8 nearest cluster centers. Soft-weighted textons as in [39, 36, 18] allows each pixel to be associated with 8 nearest clusters instead of a single texton label. This method alleviates the problem of two similar responses assigned to different texton labels.

Each reflectance layout filter characterizes a specific region in reflectance space where the change of reflectance as a function of viewing angle is a descriptive feature for the material. There are many possible combinations of as illustrated in Figure 4 and we want to choose the ones that are most discriminitave. The boosting approach in [35, 38] is used to identify the most discriminitive combinations. After boosting, the typical numbers of reflectance layout filters is approximately 700.

3.3 Boosting

The algorithm for Joint Boosting [38]

provides feature selection where the feature is the reflectance-layout filter

specified by a particular pair that indicates the number of times texton occurs in region

. The approach builds a strong learner iteratively by adding a strongest weak learner which is the selected feature in each iteration, allowing the weak learner to help classify a subset of classes. At each step

, the method maximally reduces the weighted squared error by choosing a strongest weak learner , updating strong learner as: , where is the input image and is the class. The weighted square error is given by


where is number of classes, and is the number of training samples, defines the weights for class and sample that emphasize the incorrectly classified samples for that iteration, is the membership label for class . The optimal solution that gives the selected feature at step has the form


with the parameters given by the minimization of Equation 3, is indicator function (0 or 1), is the count or texton in region , is the class subset that share this feature. For the classes sharing the feature , the weak learner gives determined by the comparison of reflectance-layout filter response with the threshold . For the classes not sharing the feature, there is a constant different for each class that avoids the asymmetry caused by the number of positive and negative samples for each class.

This method chooses a dominant feature at each iteration to minimize the error function. For each selected feature, finding the class subset that maximally reduces the error on weighted training set is expensive. Instead of searching all possible

combinations, a greedy search heuristic

[38] is used to reduce the complexity to . We first find the best feature for each single class, and pick the class that has the best error reduction. Then we add the class that has best joint error reduction until we go through all the classes. Finally, we select the set that provides the largest overall error reduction. It is also time consuming to go through all the features at each iteration, so only a fraction reflectance-layout filters are examined, randomly chosen in each iteration.

3.4 From Textons to Binary Material Codes

Boosting allows the selection of features that specify (region, texton) pairs of interest. The selected features can simply be viewed as the input feature vector for a basic nearest neighbor classification. Nearest neighbors in high dimensions is problematic, but the computational tools of binary hash codes enables efficient and accurate representation. We use the reflectance layout filters directly in a concatenated feature vector with component where each component is a region-texton pair that is known to be useful in material recognition. There is likely to be redundancy in the combinations so the number of components in the feature vector may be reduced accordingly. This high dimensional feature vector is used directly for fast computation by employing binary coding. This efficiency is highly desirable for the embedded hardware implementation.

We use a suite of state-of-the-art approaches for forming binary code words including circulant binary embedding (CBE) [45], bilinear embedding [10], iterative quantization (ITQ) [12], angular quantization-based binary codes(AQBC) [11], locality sensitive hash(LSH) [3], and locality-sensitive binary codes from shift-invariant kernels (SKLSH) [32].

(a) cloth
(b) feather
(c) glossy metal
(d) paper
(e) sponge
(f) wax paper
(g) wood
(h) wood
Figure 6: Visualizing the reflectance-layout filters.The first row shows the reflectance disks for different materials. The second row shows the corresponding texton maps. The third row shows three of the dominant region-texton () combinations chosen for each class.

4 Experiments

Reflectance Disk Database To evaluate the performance of our reflectance hashing framework, a database of 3600 reflectance images is collected consisting of the following 20 surface classes: cardboard, CD, cloth, feather, textured rubber, glossy ceramic, glossy metal, leather, linen, mattel metal, automotive painting, non-ferrous metal, paper, plastic, rock, rubber, sponge, velvet, glossy paper and wood. The measurement camera shown in Figure 7 is arranged as in Figure 3 with a video camera, telecentric lens, light source, beam splitter and parabolic mirror. The database includes 3 instances per class, i.e. three different example surfaces per class, 10 spot samples per surface with 3 illumination directions where is frontal illumination aligned with the surface normal. Additionally, two exposure settings are collected for each reflectance disk. Therefore, the dataset consists of 180 reflectance disk images per class, for a total dataset of 3600 reflectance disk images each of size . This reflectance dataset is made publicly available (link provided in final publication).

Figure 7: Prototype of the camera for reflectance disk capture. The components follow the arrangement in Figure 3.
Figure 8: Recognition rate as a function of training set size for both boosting and reflectance hashing. Notice the performance of reflectance hashing is high even when the training set number is low.

Material Recognition We compare the performance of texton boosting with reflectance hashing for material classification. We compared the classification result with a training set of random selected images for both methods, and test the classification accuracy on a test set of random selected images. We vary from 360 to 1500. For the large set of training images, both methods perform well; however, the recognition rate of joint boosting decreases significantly, when decreasing the size of training set. Reflectance hashing gives a more stable recognition rate as a function of the training set size as shown in Figure 8.

Figure 9

shows the confusion matrix from

classification with joint boosting with 700 iterations in the training stage, and mean recognition rate of . The parameter settings were textons and 200 subwindows or regions, with the random feature selection fraction . Figure 10 shows the confusion matrix obtained by our method of reflectance hashing, with the features selected in 700 iterations, and using iterative quantization [12] as the binary embedding method. The overall recognition rate is , and several individual class recognition rates are significantly higher than the boosting method of Figure 9. For both methods, 5-fold cross validation was performed.

We also make a baseline comparison with texton histogram classification where no boosting is done and no region subwindows are used. The histogram is computed over the entire reflectance disk. The recognition rate with 1500 training images is 79.53% with a max rate of 100% (plastic, glossy paper) and a minimum of 45.6% (sponge) The recognition rate with 360 training images is 41.94% with a max rate of 89.2% (cardboard) and a minimum of 18.3% (linen).

From the empirical results, we see that reflectance hashing provides reliable recognition even for a small training set. This result has important implications for real time material recognition since the approach may support online training with compact training sets.

Figure 9: Joint Boosting Classification Results. Confusion matrix with percentages row-normalized. Overall accuracy is 84.38%.
Figure 10: Reflectance Hashing Classification Results. Confusion matrix with percentages row-normalized. Overall accuracy is 92.3%.

Evaluation of Hash Codes We compare the performance of recent binary code methods for use in reflectance hashing. These codes are use to represent the response from the reflectance-layout filters as described in Section 3.4. We test the following binary embedding methods: randomized (CBE-rand) and learned (CBE-opt) versions of circulant binary embedding (CBE) [45], randomized (BITQ-rand) and learned (BITQ-opt) versions of bilinear embedding [10], iterative quantization (ITQ) [12], angular quantization-based binary codes(AQBC) [11], locality-sensitive binary codes from shift-invariant kernels (SKLSH) [32], and a baseline method locality sensitive hash (LSH) [3]. We used the publicly available software implementation for these binary embedding methods [45]. Recognition is accomplished using a nearest neighbor search of binary codes with a Hamming distance metric and ten nearest neighbors. From Figure 11, we can see the binary embedding recognition rate reaches around , when using 128 or 256 bits of binary codes. The method of ITQ gives the best results for this material recognition task, and we use this binary code. The CBE-opt and BITQ-opt do not work well at low dimensional case, but the recognition rate increases quickly with the number of bits in the code.

(a) Nearest neighbor search precision
(b) Recognition Rate
Figure 11: Accuracy of nearest neighbor search and recognition rate as a function of the number of code bits for the binary embedding with 10 nearest neighbors.

5 Summary and Conclusion

We have introduced a novel framework for measurement and recognition of material classes. The approach encodes high dimensional reflectance with a compact binary code. We have compared several existing binary code methods to choose the most appropriate for this material recognition aproach. The coding supports discrimination among the classes and can be realized in embedded vision implementations. Our method of reflectance hashing is compared to two popular baseline texton-based methods, boosting and texton histograms for material recognition. The results show excellent performance even for small training sets and provide a novel method based on reflectance for fast sensing and recognition of real-world materials.


  • [1] E. H. Adelson. On seeing stuff: the perception of materials by humans and machines. In Photonics West 2001-Electronic Imaging, pages 1–12. International Society for Optics and Photonics, 2001.
  • [2] A. Bergamo, L. Torresani, and A. Fitzgibbon. Picodes: Learning a compact code for novel-category recognition. Advances in Neural Information Processing Systems 24, pages 2088–2096, 2011.
  • [3] M. S. Charikar. Similarity estimation techniques from rounding algorithms. In

    Proceedings of the thiry-fourth annual ACM symposium on Theory of computing

    , pages 380–388. ACM, 2002.
  • [4] O. G. Cula and K. J. Dana. Recognition methods for 3d textured surfaces. Proceedings of SPIE Conference on Human Vision and Electronic Imaging VI, 4299:209–220, January 2001.
  • [5] O. G. Cula and K. J. Dana. 3D texture recognition using bidirectional feature histograms. International Journal of Computer Vision, 59(1):33–60, August 2004.
  • [6] K. Dana and J. Wang. Device for convenient measurement of spatially varying bidirectional reflectance. Journal of the Optical Society of America A, 21:pp. 1–12, January 2004.
  • [7] K. J. Dana. Brdf/btf measurement device. International Conference on Computer Vision, 2:460–6, July 2001.
  • [8] K. J. Dana, B. van Ginneken, S. K. Nayar, and J. J. Koenderink. Reflectance and texture of real world surfaces. ACM Trans. Gr., 18(1):1–34, January 1999.
  • [9] S.-C. Foo. A gonioreflectometer for measuring the bidirectional reflectance of material for use in illumination computation. Master’s thesis, Cornell University, 1996.
  • [10] Y. Gong, S. Kumar, H. A. Rowley, and S. Lazebnik.

    Learning binary codes for high-dimensional data using bilinear projections.

    IEEE Conference on Computer Vision and Pattern Recognition

    , pages 484–491, 2013.
  • [11] Y. Gong, S. Kumar, V. Verma, and S. Lazebnik. Angular quantization-based binary codes for fast similarity search. In Advances in Neural Information Processing Systems, pages 1196–1204, 2012.
  • [12] Y. Gong, S. Lazebnik, A. Gordo, and F. Perronnin.

    Iterative quantization: A procrustean approach to learning binary codes for large-scale image retrieval.

    Pattern Analysis and Machine Intelligence, IEEE Transactions on, 35(12):2916–2929, 2013.
  • [13] J. Gu and C. Liu. Discriminative illumination: Per-pixel classification of raw materials based on optimal projections of spectral brdf. In Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on, pages 797–804. IEEE, 2012.
  • [14] J. Y. Han and K. Perlin. Measuring bidirectional texture reflectance with a kaleidoscope. ACM Trans. Graph., 22(3):741–748, July 2003.
  • [15] M. Johnson and E. Adelson. Retrographic sensing for the measurement of surface texture and shape. In Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on, pages 1070–1077, 2009.
  • [16] B. Kulis and T. Darrell. Learning to hash with binary reconstructive embeddings. In Advances in Neural Information Processing Systems (NIPS), pages 1042–1050, 2009.
  • [17] R. Kumar, M. Jones, and T. Marks.

    Morphable reflectance fields for enhancing face recognition.

    In Computer Vision and Pattern Recognition (CVPR), 2010 IEEE Conference on, pages 2606–2613, 2010.
  • [18] L. Ladicky, J. Shi, and M. Pollefeys. Pulling things out of perspective. In Computer Vision and Pattern Recognition (CVPR), 2014 IEEE Conference on, pages 89–96, June 2014.
  • [19] T. Leung and J. Malik. Representing and recognizing the visual appearance of materials using three-dimensional textons. International Journal of Computer Vision, 43(1):29–44, 2001.
  • [20] M. Levoy and P. Hanrahan. Light field rendering. In Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH ’96, pages 31–42, New York, NY, USA, 1996. ACM.
  • [21] W. Li and M. Fritz. Recognizing materials from virtual examples. In Computer Vision–ECCV 2012, pages 345–358. Springer, 2012.
  • [22] C. Liu and J. Gu. Discriminative illumination: Per-pixel classification of raw materials based on optimal projections of spectral brdf. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 36(1):86–98, 2014.
  • [23] C. Liu, L. Sharan, E. Adelson, and R. Rosenholtz. Exploring features in a bayesian framework for material recognition. In Computer Vision and Pattern Recognition (CVPR), 2010 IEEE Conference on, pages 239–246, 2010.
  • [24] W. Liu, J. Wang, and S. fu Chang. Hashing with graphs. In

    IInternational Conference on Machine Learning (ICML)

    , 2011.
  • [25] W. Liu, J. Wang, R. Ji, Y.-G. Jiang, and S.-F. Chang. Supervised hashing with kernels. In Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on, pages 2074–2081, 2012.
  • [26] S. Lombardi and K. Nishino. Reflectance and Natural Illumination from A Single Image. In European Conference on Computer Vision, volume VI, pages 582–595, 2012.
  • [27] S. Lombardi and K. Nishino. Single Image Multimaterial Estimation. In IEEE Conference on Computer Vision and Pattern Recognition, pages 238–245, 2012.
  • [28] W. Matusik, H. Pfister, M. Brand, and L. McMillan. A Data-Driven Reflectance Model. ACM Trans. on Graphics, 22(3):759–769, 2003.
  • [29] W. Matusik, H. Pfister, M. Brand, and L. McMillan. Efficient Isotropic BRDF Measurement. In Proc. of Eurographics Symposium on Rendering, 2003.
  • [30] G. Oxholm and K. Nishino. Shape and reflectance from natural illumination. European Conference on Computer Vision, pages 528–541, 2012.
  • [31] G. Oxholm and K. Nishino. Multiview shape and reflectance from natural illumination. IEEE Conference on Computer Vision and Pattern Recognition, 2014.
  • [32] M. Raginsky and S. Lazebnik. Locality-sensitive binary codes from shift-invariant kernels. In Advances in neural information processing systems, pages 1509–1517, 2009.
  • [33] M. Raginsky and S. Lazebnik. Locality-sensitive binary codes from shift-invariant kernels. Advances in Neural Information Processing Systems (NIPS), pages pp. 1509–1517, 2010.
  • [34] L. Sharan, C. Liu, R. Rosenholtz, and E. Adelson. Recognizing materials using perceptually inspired features. International Journal of Computer Vision, 103(3):348–371, 2013.
  • [35] J. Shotton, J. Winn, C. Rother, and A. Criminisi. Textonboost: Joint appearance, shape and context modeling for multi-class object recognition and segmentation. In Proceedings of the 9th European Conference on Computer Vision - Volume Part I, ECCV’06, pages 1–15, Berlin, Heidelberg, 2006. Springer-Verlag.
  • [36] J. Shotton, J. Winn, C. Rother, and A. Criminisi. Textonboost for image understanding: Multi-class object recognition and segmentation by jointly modeling texture, layout, and context. Int. J. Comput. Vision, 81(1):2–23, Jan. 2009.
  • [37] A. Torralba, R. Fergus, and Y. Weiss. Small codes and large image databases for recognition. In Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on, pages 1–8, 2008.
  • [38] A. Torralba, K. P. Murphy, and W. T. Freeman. Sharing visual features for multiclass and multiview object detection. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 29(5):854–869, 2007.
  • [39] J. C. van Gemert, J.-M. Geusebroek, C. J. Veenman, and A. W. M. Smeulders. Kernel codebooks for scene categorization. In ECCV 2008, PART III. LNCS, pages 696–709. Springer, 2008.
  • [40] M. Varma and A. Zisserman. A statistical approach to material classification using image patch exemplars. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(11):2032–2047, 2009.
  • [41] J. Wang and S. fu Chang. Sequential projection learning for hashing with compact codes, 2010.
  • [42] O. Wang, P. Gunawardane, S. Scher, and J. Davis. Material classification using brdf slices. In IEEE Conf. on Computer Vision and Pattern Recognition, pages 2805–2811, 2009.
  • [43] G. Ward. Measuring and modeling anisotropic reflection. In ACM SIGGRAPH 92, pages 265–272, 1992.
  • [44] Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. Advances in Neural Information Processing Systems (NIPS), pages 1753–1760, 2008.
  • [45] F. X. Yu, S. Kumar, Y. Gong, and S.-F. Chang. Circulant binary embedding. In International Conference on Machine Learning, 2014.