The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Recovery of graph signals from a limited number of sampled components is investigated. An iterative recovery algorithm is motivated and derived, including an analytic upper bound for the error. Simulation results are also presented.
This paper examines the nonconvex quadratically constrained quadratic programming (QCQP) problems using a decomposition method. It is well known that a QCQP can be transformed into a rank-one constrained optimization problem. Finding a rank-one matrix is computationally complicated, especially for large scale QCQPs. A decomposition method is applied to decompose the single rank-one constraint on original...
In this paper we propose a novel algorithm to compute the joint eigenvalue decomposition of a set of squares matrices. This problem is at the heart of recent direct canonical polyadic decomposition algorithms. Contrary to the existing approaches the proposed algorithm can deal equally with real or complex-valued matrices without any modifications. The algorithm is based on the algebraic polar decomposition...
This work focuses on the folding and rank issues for the denumerable infinite vector foldings to denumerable semi infinite matrices. The vector to be folded is assumed to have denumerably infinite number of elements while the produced matrix is assumed to be composed of a finite number of rows and denumerably infinite number of columns as we have done in some other works of us. The vector folding...
We derive the exact cumulative distribution function (c.d.f.) of the minimum eigenvalue of a correlated complex non-central Wishart matrix. This result is in the form of a simple infinite series with fast convergence, and applies for the important case where the non-centrality matrix has rank one. Simplified asymptotic expressions for the c.d.f. are given for large matrix dimensions, as well as first-order...
This paper prepares a review of ICA based approaches that are used for separation of components in functional MRI sequences. In previous works, the FastICA and the Infomax algorithms are investigated in more details; therefore, in this paper we focus on methods such as "radical ICA", "SDD ICA", "Erica" and "Evd" for separation purposes. This comparative study...
A new technique for the reconstruction of a smooth surface from a set of 3D data points is presented. The reconstructed surface is represented by an everywhere C1-continuous subdivision surface which interpolates all the given data points. The new technique consists of two major steps. First, an efficient surface reconstruction method is applied to produce a polyhedral approximation to the given data...
We characterize the total generalized squared correlation (TGSC) for a given signature sequence set used in uplink synchronous code division multiple access (S-CDMA) when channel state information is known perfectly at both transmitter and receiver. We give a definition of the TGSC based on the eigenvalues of Gram matrix associated to signature sequences set for multipath channels in the presence...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.