Introduction to statistical pattern recognition (2nd ed.)
Introduction to statistical pattern recognition (2nd ed.)
Statistical Pattern Recognition: A Review
IEEE Transactions on Pattern Analysis and Machine Intelligence
Real-time texture synthesis by patch-based sampling
ACM Transactions on Graphics (TOG)
Example-Based Super-Resolution
IEEE Computer Graphics and Applications
A Non-Local Algorithm for Image Denoising
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Parallel controllable texture synthesis
ACM SIGGRAPH 2005 Papers
Texture optimization for example-based synthesis
ACM SIGGRAPH 2005 Papers
Iterative Kernel Principal Component Analysis for Image Modeling
IEEE Transactions on Pattern Analysis and Machine Intelligence
Patch Based Blind Image Super Resolution
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Appearance-space texture synthesis
ACM SIGGRAPH 2006 Papers
Gaussian KD-trees for fast high-dimensional filtering
ACM SIGGRAPH 2009 papers
A prediction error compression method with tensor-PCA in video coding
MCAM'07 Proceedings of the 2007 international conference on Multimedia content analysis and mining
PCA-SIFT: a more distinctive representation for local image descriptors
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
PCA-Based recognition for efficient inpainting
ACCV'06 Proceedings of the 7th Asian conference on Computer Vision - Volume Part I
Region filling and object removal by exemplar-based image inpainting
IEEE Transactions on Image Processing
Hi-index | 0.00 |
This paper presents algorithms for efficiently computing the covariance matrix for features that form sub-windows in a large multidimensional image. For example, several image processing applications, e.g. texture analysis/synthesis, image retrieval, and compression, operate upon patches within an image. These patches are usually projected onto a low-dimensional feature space using dimensionality reduction techniques such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA), which in-turn requires computation of the covariance matrix from a set of features. Covariance computation is usually the bottleneck during PCA or LDA (O(nd2) where n is the number of pixels in the image and d is the dimensionality of the vector). Our approach reduces the complexity of covariance computation by exploiting the redundancy between feature vectors corresponding to overlapping patches. Specifically, we show that the covariance between two feature components can be reduced to a function of the relative displacement between those components in patch space. One can then employ a lookup table to store covariance values by relative displacement. By operating in the frequency domain, this lookup table can be computed in O(n log n) time. We allow the patches to sub-sample the image, which is useful for hierarchical processing and also enables working with filtered responses over these patches, such as local gist features. We also propose a method for fast projection of sub-window patches onto the low-dimensional space.