Regression on manifolds using data‐dependent regularization with applications in computer vision. (2nd May 2013)

• Record Type: Journal Article
• Authors: Shaw, David A.; Chellappa, Rama
• Is Part Of: Statistical analysis and data mining. Volume 6:Number 6(2013)
• Page Start: 519
• Page End: 528
• Publication Date: 2013-05-02
• Subjects: Data mining -- Statistical methods -- Periodicals; 006.312
• DOI: 10.1002/sam.11190
• Languages: English
• ISSNs: 1932-1864

Abstract

<abstract abstract-type="main" xml:lang="en"> <title>Abstract</title> <p>Various issues arise in performing regression and classification when one uses images as predictors, chief among them high dimensionality. Considering a naïve approach in which each pixel is entered into the model as a separate predictor, the analysis quickly becomes unwieldy, since modern cameras can output pictures with pixels numbering on the order of millions. However, images are highly constrained; the intrinsic dimension of an image is often far less than its ambient dimension. Moreover, various techniques to obtain new predictors (e.g., via feature extraction or by considering sets of predefined salient points in each image as variables in a regression model) can further reduce the dimension of the predictors, giving rise to an inherent lower‐dimensional, manifold structure. We show that, for some regression problems in computer vision, using a data‐dependent regularization that implicitly considers this manifold structure yields improvements over numerous alternatives. We extend this method to cases in which the structure is known <italic>a priori</italic>, in which it outperforms alternative methods, including those which explicitly take the known structure into account. © 2013 Wiley Periodicals, Inc. Statistical Analysis and Data Mining, 2013</p> </abstract>