Clustering appearances of objects under varying illumination...

Image analysis – Pattern recognition – Classification

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C382S118000

Reexamination Certificate

active

07103225

ABSTRACT:
Taking a set of unlabeled images of a collection of objects acquired under different imaging conditions, and decomposing the set into disjoint subsets corresponding to individual objects requires clustering. Appearance-based methods for clustering a set of images of 3-D objects acquired under varying illumination conditions can be based on the concept of illumination cones. A 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, the concept of conic affinity can be used which measures the likelihood of a pair of images belonging to the same underlying polyhedral cone. Other algorithms can be based on affinity measure based on image gradient comparisons operating directly on the image gradients by comparing the magnitudes and orientations of the image gradient.

REFERENCES:
patent: 2002/0097914 (2002-07-01), Yaung
Bellhumeur, P.N. et al., “What is the Set of Images of an Object Under All Possible Lighting Conditions?” Computer Society Conference on Computer Vision and Pattern Recognition. Jun. 18-20, 1996 pp. 270-277.
Adini, Y. et al., “Face Recognition: The Problem of Compensating for Changes in Illumination Direction,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 19, No. 7, Jul. 1997, pp. 721-732.
Basri, R. et al., “Lambertian Reflectance and Linear Subspaces,” Proceedings of the International Conference On Computer Vision, IEEE Computer Society, vol. 2, 2001, pp. 383-390.
Basri, R. et al., “Clustering Appearances of 3D Objects,” Proceedings IEEE Conference on Computer Vision and Pattern Recognition, 1998, pp. 414-420.
Batur, A.U. et al., “Linear Subspaces for Illumination Robust Face Recognition,” Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 2, Dec. 8-14, 2001, pp. 296-301.
Belhumeur, P. et al., “Comparing Images Under Variable Illumination,” Proc. IEEE Conf. CVPR, 1998, 8 pages.
Belhumeur, P.N. et al., “What is the Set of Images of an Object Under All Possible Illumination Conditions?”, Int. Journal of Comp. Vision, vol. 28, No. 3, 1998, pp. 1-16.
Chen, Hansen F. et al., “In Search of Illumination Invariants,” Proc. IEEE Conference on Computer Vision and Pattern Recognition, vol. 1, 2000, pp. 254-261.
Fitzgibbon, A. et al., “On Affine Invariant Clustering and Automatic Cast Listing in Movies,” In Proc. European Conference on Computer Vision, 2002, pp. 304-320.
Gdalyahu, Y. et al., “Self-Organization in Vision: Stochastic Clustering for Image Segmentation, Perceptual Grouping, and Image Database Organization,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 23, No. 10, Oct. 2001, pp. 1053-1074.
Georghiades, A. S. et al. “From Few to Many: Illumination Cone Models for Face Recognition Under Variable Lighting and Pose,” vol. 23, No. 6, Jun. 2001, pp. 643-660.
Jain, A. K. et al., “Data Clustering: A Review,” ACM Computing Surveys, vol. 31, No. 3, Sep. 1999; 264-323.
Lee, D. D. et al., “Learning the Parts of Objects by Non-Negative Matrix Factorization,” Nature, vol. 401, Oct. 21, 1999, pp. 788-791.
Lee, Kuang-Chih et al., “Nine Points of Light: Acquiring Subspaces for Face Recognition Under Variable Lighting,” IEEE Conference on Computer Vision and Pattern Recognition, Dec. 2001, vol. 1, pp. 1-8.
Murase, H. et al. “Visual Learning and Recognition of 3-D Objects From Appearance,” Int'l. J. Computer Vision, vol. 14, 1995, pp. 5-24.
NG, A. Y. et al., “On Spectral Clustering: Analysis and an Algorithm,” Advances.
NG, A. Y. et al., “On Spectral Clustering: Analysis and an Algorithm,” Advances in Neural Information Processing Systems 15, 2002, pp. 849-856.
Polito, M. et al., “Grouping and Dimensionality Reduction by Locally Linear Embedding,” Advances in Neural Information Processing Systems 15, 2002, pp. 1255-1262.
Ramamoorthi, R. et al., “A Signal-Processing Framework for Inverse Rendering,” Proc. Siggraph, 2001, pp. 117-128.
Roweis, S. T. et al., “Nonlinear Dimensionality Reduction by Locally Linear Embedding,” Science, vol. 290, No. 5500, Dec. 22, 2000, pp. 2323-2326.
Shi, J. et al., “Normalized Cuts and Image Segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, No. 8, Aug. 2000, pp. 888-905.
Sim, T. et al., “The CMU Pose, Illumination, and Expression (PIE) Database,” IEEE International Conference on Automatic Face and Gesture Recognition, 2002, pp. 1-6.
Sim, T. et al., “Combining Models and Exemplars for Face Recognition: An Illuminating Example,” CVPR 2001 Workshop on Models versus Exemplars in Computer Vision, 2001, 10 pages.
Weiss, Y. “Segmentation Using Eigenvectors: a Unifying View,” Proceedings International Conference on Computer Vision, vol. 2, 1999, pp. 975-982.
Zheng, Q. et al., “Estimation of Illuminant Direction, Albedo, and Shape from Shading,” IEEE Transactions on Pattern Analysis and Machine Intelligence vol. 13, No. 7, Jul. 1991; pp. 680-702.
PCT International Search Report, International Application No. PCT/US03/35554, Search Report Dated May 18, 2004, 5 pages.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Clustering appearances of objects under varying illumination... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Clustering appearances of objects under varying illumination..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clustering appearances of objects under varying illumination... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3551851

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.