A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Filters
A Linearly Convergent Algorithm for Distributed Principal Component Analysis
[article]
2021
arXiv
pre-print
Preserved Fulltext
Other Versions
This requires estimating the eigenvectors of the data covariance matrix, as opposed to only estimating the subspace spanned by the eigenvectors, when data is distributed across a network of machines. ...
With an eye towards communications efficiency, this paper introduces a feedforward neural network-based one time-scale distributed PCA algorithm termed Distributed Sanger's Algorithm (DSA) that estimates ...
Many other iterative methods have been proposed over the last few decades that are based on the well-known Hebbian learning rule [15] like Oja's method [9] , generalized Hebbian algorithm [11] , APEX ...
arXiv:2101.01300v3
fatcat:2v5fwhudfrexpfwzwjrmvtvv44
A model-independent algorithm for ionospheric tomography: 1. Theory and tests
1998
Radio Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This algorithm uses the modified (or generalized) SVD, which was briefly discussed in section 3.5.7. ...
In this method, the point that has minimum B-norm is supposed to be the most likely in the apriori sense. ...
Comparison of Ne,max frorn tomography with chirpsounder records shows a mean disagreement of 18% between the methods, that is not all due to tomography. ...
doi:10.1029/97rs03007
fatcat:votnijxpj5gtlazbjpbqc4dmym
Spontaneous Facial Expression Recognition using Sparse Representation
2017
Figshare
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Facial images are represented as a sparse linear combination of prototype atoms via Orthogonal Matching Pursuit algorithm. ...
The effectiveness of the proposed method is evaluated through several experiments on the spontaneous facial expressions DynEmo database. ...
(K-SVD) algorithm (Rubinstein et al., 2008) . ...
doi:10.6084/m9.figshare.5212414
fatcat:utsrz3lkpnb5xeiz2u4cxjzbim
Spontaneous Facial Expression Recognition using Sparse Representation
2017
Proceedings of the 12th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Facial images are represented as a sparse linear combination of prototype atoms via Orthogonal Matching Pursuit algorithm. ...
The effectiveness of the proposed method is evaluated through several experiments on the spontaneous facial expressions DynEmo database. ...
(K-SVD) algorithm (Rubinstein et al., 2008) . ...
doi:10.5220/0006118000640074
dblp:conf/visapp/ChantiC17
fatcat:54kdte3tl5b3fkmkizzn3i76sq
Analyzing trajectories on Grassmann manifold for early emotion detection from depth videos
2015
2015 11th IEEE International Conference and Workshops on Automatic Face and Gesture Recognition (FG)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
(set of k-dimensional linear subspaces). ...
Experimental evaluations conducted on publicly available BU-4DFE, BU4D-Spontaneous and Cam3D Kinect datasets illustrate the effectiveness of these representations and the algorithmic solutions for identity ...
This method is limited mainly by the 636 influence of the accuracy of the apex labeling on the performance. ...
doi:10.1109/fg.2015.7163122
dblp:conf/fgr/AlashkarABD15
fatcat:53lkhk6apzaqndylmu5iphqupe
T-wave width as an index for quantification of ventricular repolarization dispersion: Evaluation in an isolated rabbit heart model
2008
Biomedical Signal Processing and Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
) of the ECG, from which the u PT (angle between the first SVD principal axis and the repolarization axis), T-wave residuum (T WR ), T-wave morphology dispersion (T MD ), unnormalized T MD (UT MD ), and ...
the absolute ECG summation signal, from which we obtained the amplitude and area of the T-wave, and the T-wave width (T W ), which we consider as IVRD indexes, and (b) the Singular Value Decomposition (SVD ...
We showed in Fig. 1 , one likely T-wave generation as a result of combined dispersion between apex-base and Fig. 1 . Example of an increase in T-wave width in a surface ECG. ...
doi:10.1016/j.bspc.2007.10.001
fatcat:t5dd7sn4cja7xpnkbcgsqqlgva
Integrated Approach to Investigating Historic Cemeteries
2020
Remote Sensing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The targets of interest are approximately 20–30 cm higher in elevation if a topographic correction is performed using TLS versus ALS. ...
We use singular value decomposition (SVD) to isolate and remove energy from GPR data. SVD allows one to remove unwanted signals that traditional processing techniques cannot. ...
For example, migration algorithms collapse diffraction events to single points that are positioned at a depth corresponding to the diffraction apex to produce a more realistic representation of the subsurface ...
doi:10.3390/rs12172690
fatcat:esgm7louovabjekivopkpik6pi
Component-Based Recognition of Facesand Facial Expressions
2013
IEEE Transactions on Affective Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Experiments on publicly available expression and face datasets show the effectiveness of our method. ...
The DCS algorithm then uses these dictionaries to decompose an expressive test face into its constituent components. ...
One of the most well-known algorithms for learning such dictionaries is the K-SVD algorithm [48] . The K-SVD algorithm alternates between sparse-coding and dictionary update steps. ...
doi:10.1109/t-affc.2013.28
fatcat:eipwolqppfeazp6jivvcq56oda
Top-k preferences in high dimensions
2014
2014 IEEE 30th International Conference on Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Being multi-dimensional, each subspace covers many possible preferences; furthermore, multiple subspaces can jointly cover a preference, thereby expanding the coverage beyond each subspace's dimensionality ...
These subspaces allow us to index them more effectively than the full-dimensional space. ...
), versus ii) two subspaces for which both preferences have projections of norm 0.5. ...
doi:10.1109/icde.2014.6816697
dblp:conf/icde/YuAY14
fatcat:gojudjqbtzb5vaqoanirogkwnu
SU-EE-A3-06: An Efficient Algorithm for Image-Based Dose Deformation and Accumulation
2005
Medical Physics (Lancaster)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The two methods were compared on 3-D versus 2-D (volume versus planar), dosimetry optimization, and clinical feasibility. ...
For each period within a reasonable range, a subspace of all signals with that period is constructed and the observed breathing trajectory is projected onto that subspace to obtain the closest matching ...
Like functional nuclear medicine images, EPR oxygen images do not depict anatomy directly. ...
doi:10.1118/1.1997464
fatcat:zue2hfmc5ze6ziwu332w3u2lue
Automated interictal spike detection and source localization in magnetoencephalography using independent components analysis and spatio-temporal clustering
2004
Clinical Neurophysiology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Methods: We first use an ICA (Independent Components Analysis) method to decompose the multichannel MEG data and identify those components that exhibit spike-like characteristics. ...
This leads to poor sensitivity versus specificity characteristics. ...
We use the RAP-MUSIC algorithm (Mosher and Leahy, 1999) to localize the equivalent current dipoles from spatio-temporal data over a time window of ±τ , with τ = 16ms, around the apex of each detected ...
doi:10.1016/j.clinph.2003.10.036
pmid:15036046
fatcat:sbxr2sqgofdzfl55x6ixnbrjvy
Biologically Plausible Online Principal Component Analysis Without Recurrent Neural Dynamics
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
., with stochastic gradients), we map our algorithm to a familiar neural network architecture and give numerical results showing that our method converges at a competitive rate. ...
In the offline setting, our algorithm corresponds to a dynamical system, the stability of which we rigorously analyze. ...
These include work by Oja [9] - [11] , the APEX algorithm [12] , Sanger's rule [13] , Földiák's network [14] , and work by Linsker [15] . ...
arXiv:1810.06966v2
fatcat:ul7clkmgtrhxtll7mk4wpcg4gm
Face Recognition by Using 2D Orthogonal Subspace Projections
2021
Traitement du signal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In this paper, the implementations and comparison of some classifiers along with 2D subspace projection approaches have been carried out for the face recognition problem. ...
The uniform eigen-space SVD method was proposed to recognize faces on enhanced images [21] . ...
There are also more efficient linear subspace analysis methods that use null-space face [7] . ...
doi:10.18280/ts.380105
fatcat:irnnpaxzjfgzbppks4qk2huyoq
A machine-vision approach for automated pain measurement at millisecond timescales
[article]
2020
bioRxiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Applied to innocuous and noxious stimuli across six inbred mouse strains, a linear discriminant analysis reveals a two-dimensional subspace that separates painful from non-painful stimuli on one axis, ...
Statistical modeling with linear discriminant analyses separates touch versus pain across six inbred mouse strains We used linear discriminant analysis (LDA) to identify a linear subspace of the quantified ...
Automated behavioral feature selection method using SVD As a point of comparison for the behavioral measures quantified as pre-and post-peak paw features using common measures from the literature, we employed ...
doi:10.1101/2020.02.18.955070
fatcat:clbk4falevbxjo672jevpewepq
Anatomically accurate hard priors for transrectal electrical impedance tomography (TREIT) of the prostate
2012
Physiological Measurement
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Here, a method that extracts the prostate surface from US images and incorporates this surface into the image reconstruction algorithm has been developed to enable estimation of electrical parameters within ...
The developed anatomically accurate hard-prior algorithm demonstrably identifies contrasts within the prostate volume while an algorithm that does not rely on anatomically accurate structural information ...
Acknowledgements We would like to acknowledge support from the NIH grant, NIBIB # RC1EB011000. ...
doi:10.1088/0967-3334/33/5/719
pmid:22532339
pmcid:PMC3375696
fatcat:zdc3kctk3jacnbdd2dmko4ukle
« Previous
Showing results 1 — 15 out of 81 results