default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikael Sørensen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c17]Mikael Sørensen, Nicholas D. Sidiropoulos
:
Radio-Astronomy Imaging and Interference Excision Using Tensor Decomposition and Canonical Correlation Analysis. ICASSP 2023: 1-5- [c16]Stijn Hendrikx, Mikael Sørensen, Lieven De Lathauwer:
Multilinear singular value decomposition of a tensor with fibers observed along one mode*. SSP 2023: 566-570 - 2022
- [j17]Mikael Sørensen, Nicholas D. Sidiropoulos, Ananthram Swami:
Overlapping Community Detection via Semi-Binary Matrix Factorization: Identifiability and Algorithms. IEEE Trans. Signal Process. 70: 4321-4336 (2022) - [c15]Nicholas D. Sidiropoulos, Mikael Sørensen:
Canonical Identification of Autoregressive Nonlinear Systems. IEEECONF 2022: 1021-1025 - [c14]Mikael Sørensen, Nicholas D. Sidiropoulos:
Identifiability Results for Nonuniform Linear and Rectangular Sensor Arrays. EUSIPCO 2022: 1736-1740 - 2021
- [j16]Mikael Sørensen, Charilaos I. Kanatsoulis, Nicholas D. Sidiropoulos:
Generalized Canonical Correlation Analysis: A Subspace Intersection Approach. IEEE Trans. Signal Process. 69: 2452-2467 (2021) - [i2]Zack W. Almquist, Tri Duc Nguyen, Mikael Sørensen, Xiao Fu, Nicholas D. Sidiropoulos:
Uncovering migration systems through spatio-temporal tensor co-clustering. CoRR abs/2112.15296 (2021) - 2020
- [j15]Mikael Sørensen, Nicholas D. Sidiropoulos:
Multi-Set Low-Rank Factorizations With Shared and Unshared Components. IEEE Trans. Signal Process. 68: 5122-5137 (2020) - [i1]Mikael Sørensen, Charilaos I. Kanatsoulis, Nicholas D. Sidiropoulos:
Generalized Canonical Correlation Analysis: A Subspace Intersection Approach. CoRR abs/2003.11205 (2020)
2010 – 2019
- 2019
- [j14]Mikael Sørensen, Lieven De Lathauwer:
Fiber Sampling Approach to Canonical Polyadic Decomposition and Application to Tensor Completion. SIAM J. Matrix Anal. Appl. 40(3): 888-917 (2019) - [c13]Mikael Sørensen, Nikolaos D. Sidiropoulos:
Joint Low-Rank Factorizations with Shared and Unshared Components: Identifiability and Algorithms. EUSIPCO 2019: 1-5 - [c12]Mikael Sørensen, Nicholas D. Sidiropoulos, Lieven De Lathauwer:
Canonical Polyadic Decomposition of a Tensor That Has Missing Fibers: A Monomial Factorization Approach. ICASSP 2019: 7490-7494 - 2018
- [j13]Mikael Sørensen, Ignat Domanov, Lieven De Lathauwer:
Coupled Canonical Polyadic Decompositions and Multiple Shift Invariance in Array Processing. IEEE Trans. Signal Process. 66(14): 3665-3680 (2018) - 2017
- [j12]Steven Delrue, Vladislav Aleshin, Mikael Sørensen, Lieven De Lathauwer:
Simulation Study of the Localization of a Near-Surface Crack Using an Air-Coupled Ultrasonic Sensor Array. Sensors 17(4): 930 (2017) - [j11]Mikael Sørensen, Lieven De Lathauwer:
Multidimensional Harmonic Retrieval via Coupled Canonical Polyadic Decomposition - Part I: Model and Identifiability. IEEE Trans. Signal Process. 65(2): 517-527 (2017) - [j10]Mikael Sørensen, Lieven De Lathauwer:
Multidimensional Harmonic Retrieval via Coupled Canonical Polyadic Decomposition - Part II: Algorithm and Multirate Sampling. IEEE Trans. Signal Process. 65(2): 528-539 (2017) - [j9]Frederik Van Eeghem, Mikael Sørensen, Lieven De Lathauwer:
Tensor Decompositions With Several Block-Hankel Factors and Application in Blind System Identification. IEEE Trans. Signal Process. 65(15): 4090-4101 (2017) - [j8]Mikael Sørensen, Frederik Van Eeghem, Lieven De Lathauwer:
Blind Multichannel Deconvolution and Convolutive Extensions of Canonical Polyadic and Block Term Decompositions. IEEE Trans. Signal Process. 65(15): 4132-4145 (2017) - 2016
- [j7]Mikael Sørensen, Lieven De Lathauwer:
Multiple Invariance ESPRIT for Nonuniform Linear Arrays: A Coupled Canonical Polyadic Decomposition Approach. IEEE Trans. Signal Process. 64(14): 3693-3704 (2016) - [c11]Mikael Sørensen, Lieven De Lathauwer:
Shift invariance, incomplete arrays and coupled CPD: A case study. SAM 2016: 1-5 - 2015
- [j6]Mikael Sørensen, Lieven De Lathauwer:
Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank-(Lr, n, Lr, n, 1) Terms - Part I: Uniqueness. SIAM J. Matrix Anal. Appl. 36(2): 496-522 (2015) - [j5]Mikael Sørensen, Ignat Domanov, Lieven De Lathauwer:
Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank- (Lr, n, Lr, n, 1) Terms - Part II: Algorithms. SIAM J. Matrix Anal. Appl. 36(3): 1015-1045 (2015) - [j4]Mikael Sørensen, Lieven De Lathauwer:
New Uniqueness Conditions for the Canonical Polyadic Decomposition of Third-Order Tensors. SIAM J. Matrix Anal. Appl. 36(4): 1381-1403 (2015) - 2014
- [c10]Mikael Sørensen, Lieven De Lathauwer:
Multidimensional ESPRIT: A coupled canonical polyadic decomposition approach. SAM 2014: 441-444 - 2013
- [j3]Mikael Sørensen, Lieven De Lathauwer:
Blind Signal Separation via Tensor Decomposition With Vandermonde Factor: Canonical Polyadic Decomposition. IEEE Trans. Signal Process. 61(22): 5507-5519 (2013) - [c9]Mikael Sørensen, Lieven De Lathauwer:
Coupled tensor decompositions for applications in array signal processing. CAMSAP 2013: 228-231 - 2012
- [j2]Mikael Sørensen, Lieven De Lathauwer, Pierre Comon, Sylvie Icart, Luc Deneire:
Canonical Polyadic Decomposition with a Columnwise Orthonormal Factor Matrix. SIAM J. Matrix Anal. Appl. 33(4): 1190-1213 (2012) - [j1]Mikael Sørensen, Lieven De Lathauwer, Sylvie Icart, Luc Deneire:
On Jacobi-type methods for blind equalization of paraunitary channels. Signal Process. 92(3): 617-624 (2012) - [c8]Mikael Sørensen, Lieven De Lathauwer:
Tensor decompositions with Vandermonde factor and applications in signal processing. ACSCC 2012: 890-894 - 2011
- [c7]Mikael Sørensen, Lieven De Lathauwer:
Tensor decompositions with block-Toeplitz structure and applications in signal processing. ACSCC 2011: 454-458 - 2010
- [c6]Pierre Comon, Mikael Sørensen, Elias P. Tsigaridas:
Decomposing tensors with structured matrix factors reduces to rank-1 approximations. ICASSP 2010: 3858-3861 - [c5]Mikael Sørensen, Lieven De Lathauwer, Luc Deneire:
Parafac with orthogonality in one mode and applications in DS-CDMA systems. ICASSP 2010: 4142-4145
2000 – 2009
- 2009
- [c4]Mikael Sørensen, Pierre Comon, Sylvie Icart, Luc Deneire:
Approximate tensor diagonalization by invertible transforms. EUSIPCO 2009: 500-504 - [c3]Mikael Sørensen, Lieven De Lathauwer, Luc Deneire:
An efficient Jacobi-type algorithm for blind equalization of paraunitary channels. EUSIPCO 2009: 510-514 - [c2]Mikael Sørensen, Pierre Comon, Sylvie Icart, Luc Deneire:
PARAFAC2 Receivers for Orthogonal Space-Time Block Codes. ICC 2009: 1-5 - 2008
- [c1]Mikael Sørensen, Sylvie Icart, Pierre Comon, Luc Deneire:
Gradient based Approximate Joint Diagonalization by orthogonal transforms. EUSIPCO 2008: 1-5
Coauthor Index
aka: Nikolaos D. Sidiropoulos
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
