Filters








2,564 Hits in 3.3 sec

An Eigenspace Update Algorithm for Image Analysis

S. Chandrasekaran, B.S. Manjunath, Y.F. Wang, J. Winkeler, H. Zhang
1997 Graphical Models and Image Processing  
to be numerivectors and provide an error analysis. cally stable and fast.  ...  However, until recently there was no fast and stable updating algorithm During the past few years several interesting applications of eigenspace representation of images have been proposed.  ...  ACKNOWLEDGMENTS Portions of the research in this paper use the FERET database of facial images collected under the ARPA/ARL FERET program.  ... 
doi:10.1006/gmip.1997.0425 fatcat:utogp34wpfcubkscrligtula5m

An eigenspace update algorithm for image analysis

B.S. Manjunath, S. Chandrasekaran, Y.F. Wang
Proceedings of International Symposium on Computer Vision - ISCV  
to be numerivectors and provide an error analysis. cally stable and fast.  ...  However, until recently there was no fast and stable updating algorithm During the past few years several interesting applications of eigenspace representation of images have been proposed.  ...  ACKNOWLEDGMENTS Portions of the research in this paper use the FERET database of facial images collected under the ARPA/ARL FERET program.  ... 
doi:10.1109/iscv.1995.477059 fatcat:r2asoeb2ffe6pi6zbc5zmwqmpa

Predicting Faces In Video Sequences Using Eigenspace Update Algorithms

Hctor J. Prez-Iglesias, Adriana Dapena
2005 Zenodo  
ACKNOWLEDGMENTS We would like to thank Roger Piqué and Luis Torres for their help with video coding using PCA.  ...  On the contrary, when e > s , the image is coded as an intra-frame and the eigenspace is updated. The parameter s is determined taking into account the desired PSNR (Peak Signal Noise Ratio).  ...  Comparing this results with the obtained for k = 6 (see also Table 1 ), we can say that the LCT algorithm needs to update the eigenspace 9 times more for k = 6 than for k = max (i.e, from k = 1 to k =  ... 
doi:10.5281/zenodo.39033 fatcat:bekrmkishjhurfntafcmn4kknq

Appearance based landmark selection and reliability evaluation for topological navigation

Lorenz Gerstmayr, Alexandre Bernardino, José Santos-Victor
2004 IFAC Proceedings Volumes  
The first algorithm evaluates image similarities between possible landmarks.  ...  The second one, which can also be used for online landmark selection, uses Incremental Principal Component Analysis and a measure of how good a new landmark can be expressed in the existing eigenspace.  ...  The algorithm based on Incremental Principal Component Analysis (IPCA) tries to select images that can not be expressed accurately in the existing eigenspace, and updates the eigenspace with these images  ... 
doi:10.1016/s1474-6670(17)31959-6 fatcat:jcfotqzkkneanai5ynze3oagoq

Evolutionary Eigenspace Learning Using Ccipca And Ipca For Face Recognition

Ghazy M.R. Assassa, Mona F. M. Mursi, Hatim A. Aboalsamh
2009 Zenodo  
Traditional principal components analysis (PCA) techniques for face recognition are based on batch-mode training using a pre-available image set.  ...  would trigger a costly continuous re-computation of the eigen space representation via repeating an entire batch-based training that includes the old and new images.  ...  ACKNOWLEDGEMENT The authors would like to thank engineer Yasser Ali for his preliminary work towards a face recognition system.  ... 
doi:10.5281/zenodo.1078766 fatcat:455mbubbprg2remufc45kpzauu

Eigenspace updating for non-stationary process and its application to face recognition

Xiaoming Liu, Tsuhan Chen, Susan M. Thornton
2003 Pattern Recognition  
Other existing eigenspace updating algorithms can be regarded as special cases of our algorithm.  ...  The updated eigenspace is derived based more on recent samples and less on older samples, controlled by a number of decay parameters.  ...  The authors would like to thank the anonymous reviewers for insightful comments. Thanks to Prof. B.V.K. Vijaya Kumar for fruitful discussion.  ... 
doi:10.1016/s0031-3203(03)00057-8 fatcat:vagu4lj5izgkpkbykye6uebvy4

Online Incremental Face Recognition System Using Eigenface Feature and Neural Classifier [chapter]

Seiichi Ozawa, Shigeo Abe, Shaoning Pang, Nikola Kasabov
2009 State of the Art in Face Recognition  
updating an eigenspace.  ...  To accelerate learning of IPCA, we also proposed an extended algorithm called Chunk IPCA (Ozawa et al., 2008) in which an eigenspace is updated for a chunk of given training examples by solving a single  ...  This book tries to make an effort to reduce the gap between the previous face recognition research state and the future state.  ... 
doi:10.5772/6641 fatcat:p7wxvcfbc5h7pnjjnrqjtom4lq

Developing a Gesture-based Interface

Namita Gupta, Pooja Mittal, Sumantra Dutta Roy, Santanu Chaudhury, Subhashis Banerjee
2002 Journal of the Institution of Electronics and Telecommunication Engineers  
We propose an on-line predictive EigenTracker for the moving hand. Our tracker can learn the eigenspace on the fly.  ...  We propose a new state-based representation scheme for hand gestures, based on the eigenspace reconstruction error. This makes the system independent of the speed of performing the gesture.  ...  Particularly, one needs efficient incremental SVD update algorithms, to update the eigenspace at each frame. For our case, we use a scale-space variant of the algorithm of Chandrasekaran et al.  ... 
doi:10.1080/03772063.2002.11416282 fatcat:6sqte3vxqfcfbhcilvvhfqkedy

Weighted and robust incremental method for subspace learning

Skocaj, Leonardis
2003 Proceedings Ninth IEEE International Conference on Computer Vision  
We present an incremental method, which sequentially updates the principal subspace considering weighted influence of individual images as well as individual pixels within an image.  ...  In this paper we present a method for subspace learning, which takes these considerations into account.  ...  Such an improved outlier-free image is then used for updating the eigenspace.  ... 
doi:10.1109/iccv.2003.1238667 dblp:conf/iccv/SkocajL03 fatcat:uqubdhq64ba2lkvlojdtdbf5ve

Semi-supervised PCA-Based Face Recognition Using Self-training [chapter]

Fabio Roli, Gian Luca Marcialis
2006 Lecture Notes in Computer Science  
In this paper a semi-supervised version, based on the self-training method, of the classical PCA-based face recognition algorithm is proposed to exploit unlabelled data for off-line updating of the eigenspace  ...  Performances of face recognition systems based on principal component analysis can degrade quickly when input images exhibit substantial variations, due for example to changes in illumination or pose,  ...  In our algorithm the templates are simply the "mean" faces, but more sophisticated methods, based, for example, on clustering, could be used for template update [2] .  ... 
doi:10.1007/11815921_61 fatcat:6sqebq3yzre5ffxydbvraybhwi

Incremental Learning for Visual Tracking

Jongwoo Lim, David A. Ross, Ruei-Sung Lin, Ming-Hsuan Yang
2004 Neural Information Processing Systems  
In this paper, we present an efficient and effective online algorithm that incrementally learns and adapts a low dimensional eigenspace representation to reflect appearance changes of the target, thereby  ...  Furthermore, our incremental method correctly updates the sample mean and the eigenbasis, whereas existing incremental subspace update methods ignore the fact the sample mean varies over time.  ...  Therefore it is important to develop an efficient algorithm to update the eigenspace as the tracking task progresses.  ... 
dblp:conf/nips/LimRLY04 fatcat:7kigkiijrjhyffyakbcsxgopbe

Adaptive PCA for Time-Varying Data [article]

Salaheddin Alakkari, John Dingliana
2017 arXiv   pre-print
In this paper, we present an online adaptive PCA algorithm that is able to compute the full dimensional eigenspace per new time-step of sequential data.  ...  The algorithm is based on a one-step update rule that considers all second order correlations between previous samples and the new time-step.  ...  Figure 1 shows the explained variance curves for each dataset. It is very clear that our algorithm provides an excellent approximation to the original full-dimensional eigenspace.  ... 
arXiv:1709.02373v2 fatcat:4rsdjajbpjeuhe4qsn6g2i76pu

One-Pass Incremental Membership Authentication by Face Classification [chapter]

Shaoning Pang, Seiichi Ozawa, Nikola Kasabov
2004 Lecture Notes in Computer Science  
To achieve that, we proposed a novel algorithm which authenticated membership by a one-pass incremental principle component analysis(IPCA) learning.  ...  It is demonstrated that the proposed algorithm involves an useful incremental feature construction in membership authentication, and the incremental learning system works optimally due to its performance  ...  One-pass Incremental Learning Incremental Principal Component Analysis (IPCA) Since the original PCA is not suited for incremental learning purposes, Hall and Martin devised a method to update eigenvectors  ... 
doi:10.1007/978-3-540-25948-0_22 fatcat:4fk233sxwfbdrnc2mbfp4olc4e

Online nonparametric discriminant analysis for incremental subspace learning and recognition

B. Raducanu, J. Vitrià
2008 Pattern Analysis and Applications  
This paper presents a novel approach for online subspace learning based on an incremental version of the nonparametric discriminant analysis (NDA).  ...  On the other hand, Incremental NDA is suitable to update a large knowledge representation eigenspace in real-time. Finally, the use of our method on a real-world application is presented.  ...  We sequentially updated the S b matrix with about 2,200 samples (presented randomly) of dimensionality 100 (corresponding to the projection of an image on the NDA eigenspace).  ... 
doi:10.1007/s10044-008-0131-0 fatcat:b76qmfi3iradtp5vkuarobeuse

Robust foreground segmentation based on two effective background models

Xi Li, Weiming Hu, Zhongfei Zhang, Xiaoqin Zhang
2008 Proceeding of the 1st ACM international conference on Multimedia information retrieval - MIR '08  
These two IRTSA-based background models (i.e., IRTSA-GBM and IRTSA-CBM respectively for grayscale and color images) incrementally learn low-order tensor-based eigenspace representations to fully capture  ...  Foreground segmentation is a common foundation for many computer vision applications such as tracking and behavior analysis.  ...  All of these tensor-based algorithms have the same problem that they are not allowed for incremental subspace analysis for adaptively updating the sample mean and the eigenbasis.  ... 
doi:10.1145/1460096.1460133 dblp:conf/mir/LiHZZ08 fatcat:qjdnaa6mira4nbry5lj4xdirti
« Previous Showing results 1 — 15 out of 2,564 results