Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaboud F. Kaloorazi
Person information
- affiliation: Northwestern Polytechinical University, School of Marine Science and Technology, Xi'an, China
- affiliation (PhD 2018): Pontifical Catholic University of Rio de Janeiro (PUC-Rio), Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j11]Maboud F. Kaloorazi
, Kai Liu, Jie Chen, Rodrigo C. de Lamare, Susanto Rahardja:
Randomized Rank-Revealing QLP for Low-Rank Matrix Decomposition. IEEE Access 11: 63650-63666 (2023)- [j10]Maboud F. Kaloorazi, Kai Liu, Jie Chen, Rodrigo C. de Lamare:
An efficient randomized QLP algorithm for approximating the singular value decomposition. Inf. Sci. 648: 119464 (2023) - [j9]Haoyuan Cai, Maboud F. Kaloorazi, Jie Chen, Wei Chen, Cédric Richard:
Online Dominant Generalized Eigenvectors Extraction via a Randomized Algorithm. IEEE Trans. Veh. Technol. 72(6): 7597-7612 (2023) - 2022
- [i8]Maboud F. Kaloorazi, Kai Liu, Jie Chen, Rodrigo C. de Lamare, Susanto Rahardja:
Randomized Rank-Revealing QLP for Low-Rank Matrix Decomposition. CoRR abs/2209.12464 (2022) - 2021
- [j8]Haoyuan Cai, Yingke Zhao, Jie Chen, Wei Chen, Maboud F. Kaloorazi:
Online Construction of Variable Span Linear Filters Using a Fixed-Point Approach. IEEE Signal Process. Lett. 28: 404-408 (2021) - [j7]Maboud F. Kaloorazi, Jie Chen:
Projection-Based QLP Algorithm for Efficiently Computing Low-Rank Approximation of Matrices. IEEE Trans. Signal Process. 69: 2218-2232 (2021) - [j6]Haoyuan Cai, Maboud Farzaneh Kaloorazi, Jie Chen:
Online Generalized Eigenvectors Extraction Via a Fixed-Point Approach. IEEE Trans. Signal Process. 69: 2435-2451 (2021) - [c9]Maboud F. Kaloorazi, Jie Chen, Fei Li, Dan Wu:
An Efficient Randomized Low-Rank Matrix Factorization with Application to Robust PCA. ICSPCC 2021: 1-5 - [i7]Maboud F. Kaloorazi, Jie Chen:
Projection-based QLP Algorithm for Efficiently Computing Low-Rank Approximation of Matrices. CoRR abs/2103.07245 (2021) - [i6]Maboud F. Kaloorazi, Jie Chen, Rodrigo C. de Lamare:
A QLP Decomposition via Randomization. CoRR abs/2110.01011 (2021) - 2020
- [j5]Longbin Yan, Xiuheng Wang, Min Zhao, Maboud F. Kaloorazi, Jie Chen, Susanto Rahardja:
Reconstruction of Hyperspectral Data From RGB Images With Prior Category Information. IEEE Trans. Computational Imaging 6: 1070-1081 (2020) - [j4]Maboud F. Kaloorazi, Jie Chen:
Efficient Low-Rank Approximation of Matrices Based on Randomized Pivoted Decomposition. IEEE Trans. Signal Process. 68: 3575-3589 (2020) - [c8]Haoyuan Cai, Maboud F. Kaloorazi, Jie Chen, Wei Chen, Cédric Richard:
Online Dominant Generalized Eigenvectors Extraction Via A Randomized Method. EUSIPCO 2020: 2353-2357 - [c7]Maboud Farzaneh Kaloorazi, Jie Chen:
Low-Rank Approximation of Matrices Via A Rank-Revealing Factorization with Randomization. ICASSP 2020: 5815-5819
2010 – 2019
- 2019
- [j3]Maboud Farzaneh Kaloorazi, Jie Chen:
Randomized Truncated Pivoted QLP Factorization for Low-Rank Matrix Recovery. IEEE Signal Process. Lett. 26(7): 1075-1079 (2019) - [c6]Maboud F. Kaloorazi, Jie Chen:
Low-rank Matrix Approximation Based on Intermingled Randomized Decomposition. ICASSP 2019: 7475-7479 - [c5]Maboud F. Kaloorazi, Rodrigo C. de Lamare:
Compressed Randomized Utv Decompositions for Low-rank Matrix Approximations in Data Science. ICASSP 2019: 7510-7514 - [i5]Maboud F. Kaloorazi, Rodrigo C. de Lamare:
Study of Compressed Randomized UTV Decompositions for Low-Rank Matrix Approximations in Data Science. CoRR abs/1906.04572 (2019) - 2018
- [j2]Maboud F. Kaloorazi, Rodrigo C. de Lamare:
Compressed Randomized UTV Decompositions for Low-Rank Matrix Approximations. IEEE J. Sel. Top. Signal Process. 12(6): 1155-1169 (2018) - [j1]Maboud Farzaneh Kaloorazi, Rodrigo C. de Lamare:
Subspace-Orbit Randomized Decomposition for Low-Rank Matrix Approximations. IEEE Trans. Signal Process. 66(16): 4409-4424 (2018) - [c4]Maboud F. Kaloorazi, Rodrigo C. de Lamare:
Subspace-Orbit Randomized - Based Decomposition for Low-Rank Matrix Approximations. EUSIPCO 2018: 2618-2622 - [i4]Maboud F. Kaloorazi, Rodrigo C. de Lamare:
Subspace-Orbit Randomized Decomposition for Low-rank Matrix Approximation. CoRR abs/1804.00462 (2018) - [i3]Maboud F. Kaloorazi, Rodrigo C. de Lamare:
Compressed Randomized UTV Decompositions for Low-Rank Approximations and Big Data Applications. CoRR abs/1810.07323 (2018) - [i2]Maboud F. Kaloorazi, Rodrigo C. de Lamare:
Randomized Rank-Revealing UZV Decomposition for Low-Rank Approximation of Matrices. CoRR abs/1811.08597 (2018) - 2017
- [c3]Maboud F. Kaloorazi, Rodrigo C. de Lamare:
Anomaly detection in IP networks based on randomized subspace methods. ICASSP 2017: 4222-4226 - [c2]Maboud F. Kaloorazi, Rodrigo C. de Lamare:
Low-rank and sparse matrix recovery based on a randomized rank-revealing decomposition. DSP 2017: 1-5 - [i1]Maboud F. Kaloorazi, Rodrigo C. de Lamare:
Study of Anomaly Detection Based on Randomized Subspace Methods in IP Networks. CoRR abs/1704.05741 (2017) - 2016
- [c1]Maboud F. Kaloorazi, Rodrigo C. de Lamare:
Switched-randomized robust PCA for foreground and background separation in video surveillance. SAM 2016: 1-5
Coauthor Index
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 2023-09-27 22:43 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:
