Clustering appearances of objects under varying illumination conditions

  • Authors:

  • Jeffrey Ho;Ming-Hsuan Yang;Jongwoo Lim;Kuang-Chih Lee;David Kriegman

  • Affiliations:

  • Computer Science & Engineering, University of California at San Diego, La Jolla, CA;Honda Research Institute, Mountain View, CA;Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL;Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL;Computer Science & Engineering, University of California at San Diego, La Jolla, CA

  • Venue:
  • CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce two appearance-based methods for clustering a set of images of 3-D objects, acquired under varying illumination conditions, into disjoint subsets corresponding to individual objects. The first algorithm is based on the concept of illumination cones. According to the theory, the clustering problem is equivalent to finding convex polyhedral cones in the high-dimensional image space. To efficiently determine the conic structures hidden in the image data, we introduce the concept of conic affinity which measures the likelihood of a pair of images belonging to the same underlying polyhedral cone. For the second method, we introduce another affinity measure based on image gradient comparisons. The algorithm operates directly on the image gradients by comparing the magnitudes and orientations of the image gradient at each pixel. Both methods have clear geometric motivations, and they operate directly on the images without the need for feature extraction or computation of pixel statistics. We demonstrate experimentally that both algorithms are surprisingly effective in clustering images acquired under varying illumination conditions with two large, well-known image data sets.