iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.uni-trier.de/pid/51/3888.rss
dblp: Massoud Babaie-Zadeh https://dblp.org/pid/51/3888.html dblp person page RSS feed Fri, 04 Oct 2024 21:00:20 +0200 en-US daily 1 released under the CC0 1.0 license dblp@dagstuhl.de (dblp team) dblp@dagstuhl.de (dblp team) Computers/Computer_Science/Publications/Bibliographies http://www.rssboard.org/rss-specification https://dblp.org/img/logo.144x51.pngdblp: Massoud Babaie-Zadehhttps://dblp.org/pid/51/3888.html14451 Enhancing source separation quality via optimal sensor placement in noisy environments.https://doi.org/10.1016/j.sigpro.2024.109659, , :
Enhancing source separation quality via optimal sensor placement in noisy environments. Signal Process. 226: 109659 ()]]>https://dblp.org/rec/journals/sigpro/SadeghiRB25Wed, 01 Jan 2025 00:00:00 +0100 A New Approach for Graph Signal Separation Based on Smoothness.https://doi.org/10.1109/TSP.2024.3361712, :
A New Approach for Graph Signal Separation Based on Smoothness. IEEE Trans. Signal Process. 72: 972-981 ()]]>https://dblp.org/rec/journals/tsp/YarandiB24Mon, 01 Jan 2024 00:00:00 +0100 An outlier-robust smoothness-based graph learning approach.https://doi.org/10.1016/j.sigpro.2023.108927, :
An outlier-robust smoothness-based graph learning approach. Signal Process. 206: 108927 ()]]>https://dblp.org/rec/journals/sigpro/AraghiB23Mon, 01 May 2023 01:00:00 +0200 A fast dictionary-learning-based classification scheme using undercomplete dictionaries.https://doi.org/10.1016/j.sigpro.2023.109124, :
A fast dictionary-learning-based classification scheme using undercomplete dictionaries. Signal Process. 212: 109124 ()]]>https://dblp.org/rec/journals/sigpro/MohseniSehdehB23Wed, 01 Nov 2023 00:00:00 +0100 Graph Signal Separation Based on Smoothness or Sparsity in the Frequency Domain.https://doi.org/10.1109/TSIPN.2023.3254443, , :
Graph Signal Separation Based on Smoothness or Sparsity in the Frequency Domain. IEEE Trans. Signal Inf. Process. over Networks 9: 152-161 ()]]>https://dblp.org/rec/journals/tsipn/MohammadiBT23Sun, 01 Jan 2023 00:00:00 +0100 A Closed-Form Solution for Graph Signal Separation Based on Smoothness.https://doi.org/10.1109/TSIPN.2023.3335615, :
A Closed-Form Solution for Graph Signal Separation Based on Smoothness. IEEE Trans. Signal Inf. Process. over Networks 9: 823-824 ()]]>https://dblp.org/rec/journals/tsipn/YarandiB23Sun, 01 Jan 2023 00:00:00 +0100 An Improved GraDe Method for Blind Separation of Graph Signals.https://doi.org/10.1109/TSP.2023.3331264, :
An Improved GraDe Method for Blind Separation of Graph Signals. IEEE Trans. Signal Process. 71: 4382-4391 ()]]>https://dblp.org/rec/journals/tsp/SadeghiB23Sun, 01 Jan 2023 00:00:00 +0100 Optimal Sensor Placement for Source Separation with Noisy Measurements.https://doi.org/10.23919/EUSIPCO58844.2023.10289756, , :
Optimal Sensor Placement for Source Separation with Noisy Measurements. EUSIPCO : 1664-1668]]>https://dblp.org/rec/conf/eusipco/SadeghiRB23Sun, 01 Jan 2023 00:00:00 +0100 CorrIndex: A permutation invariant performance index.https://doi.org/10.1016/j.sigpro.2022.108457, , , :
CorrIndex: A permutation invariant performance index. Signal Process. 195: 108457 ()]]>https://dblp.org/rec/journals/sigpro/SobhaniCJB22Sat, 01 Jan 2022 00:00:00 +0100 A part-level learning strategy for JPEG image recompression detection.https://doi.org/10.1007/s11042-020-10200-4, , , , :
A part-level learning strategy for JPEG image recompression detection. Multim. Tools Appl. 80(8): 12235-12247 ()]]>https://dblp.org/rec/journals/mta/TaimoriRBAB21Fri, 01 Jan 2021 00:00:00 +0100 Dictionary learning with low mutual coherence constraint.https://doi.org/10.1016/j.neucom.2020.04.135, :
Dictionary learning with low mutual coherence constraint. Neurocomputing 407: 163-174 ()]]>https://dblp.org/rec/journals/ijon/SadeghiB20Wed, 01 Jan 2020 00:00:00 +0100 New Dictionary Learning Methods for Two-Dimensional Signals.https://doi.org/10.23919/Eusipco47968.2020.9287479, , , :
New Dictionary Learning Methods for Two-Dimensional Signals. EUSIPCO : 2021-2025]]>https://dblp.org/rec/conf/eusipco/Shahriari-MehrP20Wed, 01 Jan 2020 00:00:00 +0100 Dynamic K-Graphs: an Algorithm for Dynamic Graph Learning and Temporal Graph Signal Clustering.https://doi.org/10.23919/Eusipco47968.2020.9287661, , :
Dynamic K-Graphs: an Algorithm for Dynamic Graph Learning and Temporal Graph Signal Clustering. EUSIPCO : 2195-2199]]>https://dblp.org/rec/conf/eusipco/AraghiBA20Wed, 01 Jan 2020 00:00:00 +0100 Low Mutual and Average Coherence Dictionary Learning Using Convex Approximation.https://doi.org/10.1109/ICASSP40776.2020.9052901, , , :
Low Mutual and Average Coherence Dictionary Learning Using Convex Approximation. ICASSP : 3417-3421]]>https://dblp.org/rec/conf/icassp/ParsaSBJ20Wed, 01 Jan 2020 00:00:00 +0100 A Novel Pruning Approach for Bagging Ensemble Regression Based on Sparse Representation.https://doi.org/10.1109/ICASSP40776.2020.9053835, , :
A Novel Pruning Approach for Bagging Ensemble Regression Based on Sparse Representation. ICASSP : 4032-4036]]>https://dblp.org/rec/conf/icassp/Khorashadi-Zadeh20Wed, 01 Jan 2020 00:00:00 +0100 K-Graphs: An Algorithm for Graph Signal Clustering and Multiple Graph Learning.https://doi.org/10.1109/LSP.2019.2936665, , :
K-Graphs: An Algorithm for Graph Signal Clustering and Multiple Graph Learning. IEEE Signal Process. Lett. 26(10): 1486-1490 ()]]>https://dblp.org/rec/journals/spl/AraghiSB19Tue, 01 Jan 2019 00:00:00 +0100 A New Algorithm for Dictionary Learning Based on Convex Approximation.https://doi.org/10.23919/EUSIPCO.2019.8903051, , , :
A New Algorithm for Dictionary Learning Based on Convex Approximation. EUSIPCO : 1-5]]>https://dblp.org/rec/conf/eusipco/ParsaSBJ19Tue, 01 Jan 2019 00:00:00 +0100 LOSoft: ℓ0 Minimization via Soft Thresholding.https://doi.org/10.23919/EUSIPCO.2019.8903024, , , , , :
LOSoft: ℓ0 Minimization via Soft Thresholding. EUSIPCO : 1-5]]>https://dblp.org/rec/conf/eusipco/SadeghiGBCSJ19Tue, 01 Jan 2019 00:00:00 +0100 Text Mining with Constrained Tensor Decomposition.https://doi.org/10.1007/978-3-030-37599-7_19, , , :
Text Mining with Constrained Tensor Decomposition. LOD : 219-231]]>https://dblp.org/rec/conf/mod/SobhaniCJB19Tue, 01 Jan 2019 00:00:00 +0100 Sparse Signal Recovery Using Iterative Proximal Projection.https://doi.org/10.1109/TSP.2017.2778695, , , , , :
Sparse Signal Recovery Using Iterative Proximal Projection. IEEE Trans. Signal Process. 66(4): 879-894 ()]]>https://dblp.org/rec/journals/tsp/GhayemSBCSJ18Mon, 01 Jan 2018 00:00:00 +0100 Joint Low Mutual and Average Coherence Dictionary Learning.https://doi.org/10.23919/EUSIPCO.2018.8553417, , , :
Joint Low Mutual and Average Coherence Dictionary Learning. EUSIPCO : 1725-1729]]>https://dblp.org/rec/conf/eusipco/ParsaSBJ18Mon, 01 Jan 2018 00:00:00 +0100 Learning Overcomplete Dictionaries from Markovian Data.https://doi.org/10.1109/SAM.2018.8448625, , , :
Learning Overcomplete Dictionaries from Markovian Data. SAM : 218-222]]>https://dblp.org/rec/conf/ieeesam/AkhavanEBS18Mon, 01 Jan 2018 00:00:00 +0100 A novel forensic image analysis tool for discovering double JPEG compression clues.https://doi.org/10.1007/s11042-016-3409-z, , , , :
A novel forensic image analysis tool for discovering double JPEG compression clues. Multim. Tools Appl. 76(6): 7749-7783 ()]]>https://dblp.org/rec/journals/mta/TaimoriRBAB17Sun, 01 Jan 2017 00:00:00 +0100 Compressive detection of sparse signals in additive white Gaussian noise without signal reconstruction.https://doi.org/10.1016/j.sigpro.2016.08.020, :
Compressive detection of sparse signals in additive white Gaussian noise without signal reconstruction. Signal Process. 131: 376-385 ()]]>https://dblp.org/rec/journals/sigpro/HaririB17Sun, 01 Jan 2017 00:00:00 +0100 Incoherent Unit-Norm Frame Design via an Alternating Minimization Penalty Method.https://doi.org/10.1109/LSP.2016.2632199, :
Incoherent Unit-Norm Frame Design via an Alternating Minimization Penalty Method. IEEE Signal Process. Lett. 24(1): 32-36 ()]]>https://dblp.org/rec/journals/spl/SadeghiB17Sun, 01 Jan 2017 00:00:00 +0100 Relationships Between Nonlinear and Space-Variant Linear Models in Hyperspectral Image Unmixing.https://doi.org/10.1109/LSP.2017.2747478, , , , , :
Relationships Between Nonlinear and Space-Variant Linear Models in Hyperspectral Image Unmixing. IEEE Signal Process. Lett. 24(10): 1567-1571 ()]]>https://dblp.org/rec/journals/spl/DrumetzECRBJ17Sun, 01 Jan 2017 00:00:00 +0100 Invariancy of Sparse Recovery Algorithms.https://doi.org/10.1109/TIT.2017.2686428, , :
Invariancy of Sparse Recovery Algorithms. IEEE Trans. Inf. Theory 63(6): 3333-3347 ()]]>https://dblp.org/rec/journals/tit/KharratzadehSB17Sun, 01 Jan 2017 00:00:00 +0100 Multimodal Soft Nonnegative Matrix Co-Factorization for Convolutive Source Separation.https://doi.org/10.1109/TSP.2017.2679692, , , :
Multimodal Soft Nonnegative Matrix Co-Factorization for Convolutive Source Separation. IEEE Trans. Signal Process. 65(12): 3179-3190 ()]]>https://dblp.org/rec/journals/tsp/SedighinBRJ17Sun, 01 Jan 2017 00:00:00 +0100 Blind Source Separation in Nonlinear Mixtures: Separability and a Basic Algorithm.https://doi.org/10.1109/TSP.2017.2708025, , , :
Blind Source Separation in Nonlinear Mixtures: Separability and a Basic Algorithm. IEEE Trans. Signal Process. 65(16): 4339-4352 ()]]>https://dblp.org/rec/journals/tsp/EhsandoustBRJ17Sun, 01 Jan 2017 00:00:00 +0100 A robust ellipse fitting algorithm based on sparsity of outliers.https://doi.org/10.23919/EUSIPCO.2017.8081397, , , :
A robust ellipse fitting algorithm based on sparsity of outliers. EUSIPCO : 1195-1199]]>https://dblp.org/rec/conf/eusipco/SobhaniSBJ17Sun, 01 Jan 2017 00:00:00 +0100 A new algorithm for training sparse autoencoders.https://doi.org/10.23919/EUSIPCO.2017.8081588, , , , :
A new algorithm for training sparse autoencoders. EUSIPCO : 2141-2145]]>https://dblp.org/rec/conf/eusipco/ShamsabadiBSRJ17Sun, 01 Jan 2017 00:00:00 +0100 A generalization of weighted sparse decomposition to negative weights.https://doi.org/10.23919/EUSIPCO.2017.8081589, , , , :
A generalization of weighted sparse decomposition to negative weights. EUSIPCO : 2146-2150]]>https://dblp.org/rec/conf/eusipco/DelfiAABJ17Sun, 01 Jan 2017 00:00:00 +0100 A New Algorithm for Multimodal Soft Coupling.https://doi.org/10.1007/978-3-319-53547-0_16, , , :
A New Algorithm for Multimodal Soft Coupling. LVA/ICA : 162-171]]>https://dblp.org/rec/conf/ica/SedighinBRJ17Sun, 01 Jan 2017 00:00:00 +0100 Accelerated Dictionary Learning for Sparse Signal Representation.https://doi.org/10.1007/978-3-319-53547-0_50, , , :
Accelerated Dictionary Learning for Sparse Signal Representation. LVA/ICA : 531-541]]>https://dblp.org/rec/conf/ica/GhayemSBJ17Sun, 01 Jan 2017 00:00:00 +0100 Blind compensation of polynomial mixtures of Gaussian signals with application in nonlinear blind source separation.https://doi.org/10.1109/ICASSP.2017.7953044, , , :
Blind compensation of polynomial mixtures of Gaussian signals with application in nonlinear blind source separation. ICASSP : 4681-4685]]>https://dblp.org/rec/conf/icassp/EhsandoustRBJ17Sun, 01 Jan 2017 00:00:00 +0100 Latent Variable Analysis and Signal Separation - 13th International Conference, LVA/ICA 2017, Grenoble, France, February 21-23, 2017, Proceedings.https://doi.org/10.1007/978-3-319-53547-0, , , :
Latent Variable Analysis and Signal Separation - 13th International Conference, LVA/ICA 2017, Grenoble, France, February 21-23, 2017, Proceedings. Lecture Notes in Computer Science 10169, , ISBN 978-3-319-53546-3 [contents]]]>https://dblp.org/rec/conf/ica/2017Sun, 01 Jan 2017 00:00:00 +0100 Quantization-Unaware Double JPEG Compression Detection.https://doi.org/10.1007/s10851-015-0602-z, , , , :
Quantization-Unaware Double JPEG Compression Detection. J. Math. Imaging Vis. 54(3): 269-286 ()]]>https://dblp.org/rec/journals/jmiv/TaimoriRBAB16Fri, 01 Jan 2016 00:00:00 +0100 Upper bounds on the error of sparse vector and low-rank matrix recovery.https://doi.org/10.1016/j.sigpro.2015.09.003, , , :
Upper bounds on the error of sparse vector and low-rank matrix recovery. Signal Process. 120: 249-254 ()]]>https://dblp.org/rec/journals/sigpro/Malek-Mohammadi16Fri, 01 Jan 2016 00:00:00 +0100 Iterative Sparsification-Projection: Fast and Robust Sparse Signal Approximation.https://doi.org/10.1109/TSP.2016.2585123, :
Iterative Sparsification-Projection: Fast and Robust Sparse Signal Approximation. IEEE Trans. Signal Process. 64(21): 5536-5548 ()]]>https://dblp.org/rec/journals/tsp/SadeghiB16Fri, 01 Jan 2016 00:00:00 +0100 Successive Concave Sparsity Approximation for Compressed Sensing.https://doi.org/10.1109/TSP.2016.2585096, , , , :
Successive Concave Sparsity Approximation for Compressed Sensing. IEEE Trans. Signal Process. 64(21): 5657-5671 ()]]>https://dblp.org/rec/journals/tsp/Malek-Mohammadi16Fri, 01 Jan 2016 00:00:00 +0100 Two multimodal approaches for single microphone source separation.https://doi.org/10.1109/EUSIPCO.2016.7760220, , , :
Two multimodal approaches for single microphone source separation. EUSIPCO : 110-114]]>https://dblp.org/rec/conf/eusipco/SedighinBRJ16Fri, 01 Jan 2016 00:00:00 +0100 Regularized low-coherence overcomplete dictionary learning for sparse signal decomposition.https://doi.org/10.1109/EUSIPCO.2016.7760272, , :
Regularized low-coherence overcomplete dictionary learning for sparse signal decomposition. EUSIPCO : 369-373]]>https://dblp.org/rec/conf/eusipco/SadeghiBJ16Fri, 01 Jan 2016 00:00:00 +0100 Nonlinear blind source separation for sparse sources.https://doi.org/10.1109/EUSIPCO.2016.7760515, , , :
Nonlinear blind source separation for sparse sources. EUSIPCO : 1583-1587]]>https://dblp.org/rec/conf/eusipco/EhsandoustRJB16Fri, 01 Jan 2016 00:00:00 +0100 Multi-antenna assisted spectrum sensing in spatially correlated noise environments.https://doi.org/10.1016/j.sigpro.2014.08.032, , , :
Multi-antenna assisted spectrum sensing in spatially correlated noise environments. Signal Process. 108: 69-76 ()]]>https://dblp.org/rec/journals/sigpro/KoochakzadehMBS15Thu, 01 Jan 2015 00:00:00 +0100 Performance guarantees for Schatten-p quasi-norm minimization in recovery of low-rank matrices.https://doi.org/10.1016/j.sigpro.2015.02.025, , :
Performance guarantees for Schatten-p quasi-norm minimization in recovery of low-rank matrices. Signal Process. 114: 225-230 ()]]>https://dblp.org/rec/journals/sigpro/Malek-Mohammadi15Thu, 01 Jan 2015 00:00:00 +0100 Image Restoration Using Gaussian Mixture Models With Spatially Constrained Patch Clustering.https://doi.org/10.1109/TIP.2015.2447836, , :
Image Restoration Using Gaussian Mixture Models With Spatially Constrained Patch Clustering. IEEE Trans. Image Process. 24(11): 3624-3636 ()]]>https://dblp.org/rec/journals/tip/NiknejadRB15Thu, 01 Jan 2015 00:00:00 +0100 Blind Source Separation in Nonlinear Mixture for Colored Sources Using Signal Derivatives.https://doi.org/10.1007/978-3-319-22482-4_22, , :
Blind Source Separation in Nonlinear Mixture for Colored Sources Using Signal Derivatives. LVA/ICA : 193-200]]>https://dblp.org/rec/conf/ica/EhsandoustBJ15Thu, 01 Jan 2015 00:00:00 +0100 A Dictionary Learning Method for Sparse Representation Using a Homotopy Approach.https://doi.org/10.1007/978-3-319-22482-4_31, , , , :
A Dictionary Learning Method for Sparse Representation Using a Homotopy Approach. LVA/ICA : 271-278]]>https://dblp.org/rec/conf/ica/NiknejadSBRJ15Thu, 01 Jan 2015 00:00:00 +0100 A MAP-Based Order Estimation Procedure for Sparse Channel Estimation.https://doi.org/10.1007/978-3-319-22482-4_40, , :
A MAP-Based Order Estimation Procedure for Sparse Channel Estimation. LVA/ICA : 344-351]]>https://dblp.org/rec/conf/ica/DaeiBJ15Thu, 01 Jan 2015 00:00:00 +0100 Image interpolation using Gaussian Mixture Models with spatially constrained patch clustering.https://doi.org/10.1109/ICASSP.2015.7178243, , , :
Image interpolation using Gaussian Mixture Models with spatially constrained patch clustering. ICASSP : 1613-1617]]>https://dblp.org/rec/conf/icassp/NiknejadRBJ15Thu, 01 Jan 2015 00:00:00 +0100 Iterative Concave Rank Approximation for Recovering Low-Rank Matrices.http://arxiv.org/abs/1504.01158, , :
Iterative Concave Rank Approximation for Recovering Low-Rank Matrices. CoRR abs/1504.01158 ()]]>https://dblp.org/rec/journals/corr/Malek-Mohammadi15Thu, 01 Jan 2015 00:00:00 +0100 Upper Bounds on the Error of Sparse Vector and Low-Rank Matrix Recovery.http://arxiv.org/abs/1504.03195, , , :
Upper Bounds on the Error of Sparse Vector and Low-Rank Matrix Recovery. CoRR abs/1504.03195 ()]]>https://dblp.org/rec/journals/corr/Malek-Mohammadi15aThu, 01 Jan 2015 00:00:00 +0100 Successive Concave Sparsity Approximation: Near-Oracle Performance in a Wide Range of Sparsity Levels.http://arxiv.org/abs/1505.06841, , , , :
Successive Concave Sparsity Approximation: Near-Oracle Performance in a Wide Range of Sparsity Levels. CoRR abs/1505.06841 ()]]>https://dblp.org/rec/journals/corr/Malek-Mohammadi15bThu, 01 Jan 2015 00:00:00 +0100 SR-NBS: A fast sparse representation based N-best class selector for robust phoneme classification.https://doi.org/10.1016/j.engappai.2013.11.016, , :
SR-NBS: A fast sparse representation based N-best class selector for robust phoneme classification. Eng. Appl. Artif. Intell. 28: 155-164 ()]]>https://dblp.org/rec/journals/eaai/SaebRB14Wed, 01 Jan 2014 00:00:00 +0100 Corrigendum to "ISI sparse channel estimation based on SL0 and its application in ML sequence-by-sequence equalization" [Signal Processing 92 (2012) 1875-1885].https://doi.org/10.1016/j.sigpro.2013.06.022, , , :
Corrigendum to "ISI sparse channel estimation based on SL0 and its application in ML sequence-by-sequence equalization" [Signal Processing 92 (2012) 1875-1885]. Signal Process. 94: 703 ()]]>https://dblp.org/rec/journals/sigpro/NiazadehGBJ14Wed, 01 Jan 2014 00:00:00 +0100 Learning Overcomplete Dictionaries Based on Atom-by-Atom Updating.https://doi.org/10.1109/TSP.2013.2295062, , :
Learning Overcomplete Dictionaries Based on Atom-by-Atom Updating. IEEE Trans. Signal Process. 62(4): 883-891 ()]]>https://dblp.org/rec/journals/tsp/SadeghiBJ14Wed, 01 Jan 2014 00:00:00 +0100 Recovery of Low-Rank Matrices Under Affine Constraints via a Smoothed Rank Function.https://doi.org/10.1109/TSP.2013.2295557, , , :
Recovery of Low-Rank Matrices Under Affine Constraints via a Smoothed Rank Function. IEEE Trans. Signal Process. 62(4): 981-992 ()]]>https://dblp.org/rec/journals/tsp/Malek-MohammadiBAJ14Wed, 01 Jan 2014 00:00:00 +0100 Iterative Concave Rank Approximation for Recovering Low-Rank Matrices.https://doi.org/10.1109/TSP.2014.2340820, , :
Iterative Concave Rank Approximation for Recovering Low-Rank Matrices. IEEE Trans. Signal Process. 62(20): 5213-5226 ()]]>https://dblp.org/rec/journals/tsp/Malek-MohammadiBS14Wed, 01 Jan 2014 00:00:00 +0100 Scale Invariant Feature Transform using oriented pattern.https://doi.org/10.1109/CCECE.2014.6900952, , :
Scale Invariant Feature Transform using oriented pattern. CCECE : 1-5]]>https://dblp.org/rec/conf/ccece/DaneshvarBG14Wed, 01 Jan 2014 00:00:00 +0100 K-LDA: An algorithm for learning jointly overcomplete and discriminative dictionaries.https://ieeexplore.ieee.org/document/6952254/, , , , :
K-LDA: An algorithm for learning jointly overcomplete and discriminative dictionaries. EUSIPCO : 775-779]]>https://dblp.org/rec/conf/eusipco/GolmohammadyJSBJ14Wed, 01 Jan 2014 00:00:00 +0100 A study on clustering-based image denoising: From global clustering to local grouping.https://ieeexplore.ieee.org/document/6952591/, , , , :
A study on clustering-based image denoising: From global clustering to local grouping. EUSIPCO : 1657-1661]]>https://dblp.org/rec/conf/eusipco/JoneidiSSBJ14Wed, 01 Jan 2014 00:00:00 +0100 A fast phoneme recognition system based on sparse representation of test utterances.https://doi.org/10.1109/HSCMA.2014.6843246, , :
A fast phoneme recognition system based on sparse representation of test utterances. HSCMA : 32-36]]>https://dblp.org/rec/conf/hscma/SaebRB14Wed, 01 Jan 2014 00:00:00 +0100 DOA estimation in partially correlated noise using low-rank/sparse matrix decomposition.https://doi.org/10.1109/SAM.2014.6882419, , , , :
DOA estimation in partially correlated noise using low-rank/sparse matrix decomposition. SAM : 373-376]]>https://dblp.org/rec/conf/ieeesam/Malek-MohammadiJOKB14Wed, 01 Jan 2014 00:00:00 +0100 Outlier-aware dictionary learning for sparse representation.https://doi.org/10.1109/MLSP.2014.6958854, , , , :
Outlier-aware dictionary learning for sparse representation. MLSP : 1-6]]>https://dblp.org/rec/conf/mlsp/AminiSJBJ14Wed, 01 Jan 2014 00:00:00 +0100 DOA Estimation in Partially Correlated Noise Using Low-Rank/Sparse Matrix Decomposition.http://arxiv.org/abs/1405.0674, , , , :
DOA Estimation in Partially Correlated Noise Using Low-Rank/Sparse Matrix Decomposition. CoRR abs/1405.0674 ()]]>https://dblp.org/rec/journals/corr/Malek-MohammadiJOKB14Wed, 01 Jan 2014 00:00:00 +0100 Performance Guarantees for Schatten-$p$ Quasi-Norm Minimization in Recovery of Low-Rank Matrices.http://arxiv.org/abs/1407.3716, , :
Performance Guarantees for Schatten-$p$ Quasi-Norm Minimization in Recovery of Low-Rank Matrices. CoRR abs/1407.3716 ()]]>https://dblp.org/rec/journals/corr/Malek-MohammadiBS14Wed, 01 Jan 2014 00:00:00 +0100 Approximated Cramér-Rao bound for estimating the mixing matrix in the two-sensor noisy Sparse Component Analysis (SCA).https://doi.org/10.1016/j.dsp.2012.12.016, :
Approximated Cramér-Rao bound for estimating the mixing matrix in the two-sensor noisy Sparse Component Analysis (SCA). Digit. Signal Process. 23(3): 771-779 ()]]>https://dblp.org/rec/journals/dsp/ZayyaniB13Tue, 01 Jan 2013 00:00:00 +0100 Dictionary Learning for Sparse Representation: A Novel Approach.https://doi.org/10.1109/LSP.2013.2285218, , :
Dictionary Learning for Sparse Representation: A Novel Approach. IEEE Signal Process. Lett. 20(12): 1195-1198 ()]]>https://dblp.org/rec/journals/spl/SadeghiBJ13Tue, 01 Jan 2013 00:00:00 +0100 A new algorithm for learning overcomplete dictionaries.https://ieeexplore.ieee.org/document/6811748/, , :
A new algorithm for learning overcomplete dictionaries. EUSIPCO : 1-4]]>https://dblp.org/rec/conf/eusipco/SadeghiBJ13Tue, 01 Jan 2013 00:00:00 +0100 Sequential subspace finding: A new algorithm for learning low-dimensional linear subspaces.https://ieeexplore.ieee.org/document/6811755/, , , :
Sequential subspace finding: A new algorithm for learning low-dimensional linear subspaces. EUSIPCO : 1-5]]>https://dblp.org/rec/conf/eusipco/SadeghiJBJ13Tue, 01 Jan 2013 00:00:00 +0100 Dictionary learning for sparse decomposition: A new criterion and algorithm.https://doi.org/10.1109/ICASSP.2013.6638787, , :
Dictionary learning for sparse decomposition: A new criterion and algorithm. ICASSP : 5855-5859]]>https://dblp.org/rec/conf/icassp/SadeghipoorBJ13Tue, 01 Jan 2013 00:00:00 +0100 Learning overcomplete dictionaries based on parallel atom-updating.https://doi.org/10.1109/MLSP.2013.6661975, , :
Learning overcomplete dictionaries based on parallel atom-updating. MLSP : 1-5]]>https://dblp.org/rec/conf/mlsp/SadeghiBJ13Tue, 01 Jan 2013 00:00:00 +0100 Recovery of Low Rank Matrices Under Affine Constraints via a Smoothed Rank Function.http://arxiv.org/abs/1308.2293, , , :
Recovery of Low Rank Matrices Under Affine Constraints via a Smoothed Rank Function. CoRR abs/1308.2293 ()]]>https://dblp.org/rec/journals/corr/Malek-MohammadiBAJ13Tue, 01 Jan 2013 00:00:00 +0100 Sparse Channel Estimation by Factor Graphs.http://arxiv.org/abs/1308.5597, , :
Sparse Channel Estimation by Factor Graphs. CoRR abs/1308.5597 ()]]>https://dblp.org/rec/journals/corr/NiazadehBJ13Tue, 01 Jan 2013 00:00:00 +0100 ISI sparse channel estimation based on SL0 and its application in ML sequence-by-sequence equalization.https://doi.org/10.1016/j.sigpro.2011.09.035, , , :
ISI sparse channel estimation based on SL0 and its application in ML sequence-by-sequence equalization. Signal Process. 92(8): 1875-1885 ()]]>https://dblp.org/rec/journals/sigpro/NiazadehGBJ12Sun, 01 Jan 2012 00:00:00 +0100 On the Achievability of Cramér-Rao Bound in Noisy Compressed Sensing.https://doi.org/10.1109/TSP.2011.2171953, , :
On the Achievability of Cramér-Rao Bound in Noisy Compressed Sensing. IEEE Trans. Signal Process. 60(1): 518-526 ()]]>https://dblp.org/rec/journals/tsp/NiazadehBJ12Sun, 01 Jan 2012 00:00:00 +0100 How to use real-valued sparse recovery algorithms for complex-valued sparse recovery?https://ieeexplore.ieee.org/document/6333971/, , , :
How to use real-valued sparse recovery algorithms for complex-valued sparse recovery? EUSIPCO : 849-853]]>https://dblp.org/rec/conf/eusipco/Sharif-NassabKBJ12Sun, 01 Jan 2012 00:00:00 +0100 A projected gradient-based algorithm to unmix hyperspectral data.https://ieeexplore.ieee.org/document/6334063/, , :
A projected gradient-based algorithm to unmix hyperspectral data. EUSIPCO : 2482-2486]]>https://dblp.org/rec/conf/eusipco/ZandifarBJ12Sun, 01 Jan 2012 00:00:00 +0100 Weighted sparse signal decomposition.https://doi.org/10.1109/ICASSP.2012.6288652, , :
Weighted sparse signal decomposition. ICASSP : 3425-3428]]>https://dblp.org/rec/conf/icassp/Babaie-ZadehMG12Sun, 01 Jan 2012 00:00:00 +0100 A proper transform for satisfying Benford's Law and its application to double JPEG image forensics.https://doi.org/10.1109/ISSPIT.2012.6621294, , , , :
A proper transform for satisfying Benford's Law and its application to double JPEG image forensics. ISSPIT : 240-244]]>https://dblp.org/rec/conf/isspit/TaimoriRBAB12Sun, 01 Jan 2012 00:00:00 +0100 Linear-quadratic blind source separating structure for removing show-through in scanned documents.https://doi.org/10.1007/s10032-010-0131-7, , :
Linear-quadratic blind source separating structure for removing show-through in scanned documents. Int. J. Document Anal. Recognit. 14(4): 319-333 ()]]>https://dblp.org/rec/journals/ijdar/Merrikh-BayatBJ11Sat, 01 Jan 2011 00:00:00 +0100 Two-dimensional random projection.https://doi.org/10.1016/j.sigpro.2011.01.002, , :
Two-dimensional random projection. Signal Process. 91(7): 1589-1603 ()]]>https://dblp.org/rec/journals/sigpro/EftekhariBM11Sat, 01 Jan 2011 00:00:00 +0100 On the Error of Estimating the Sparsest Solution of Underdetermined Linear Systems.https://doi.org/10.1109/TIT.2011.2170129, , :
On the Error of Estimating the Sparsest Solution of Underdetermined Linear Systems. IEEE Trans. Inf. Theory 57(12): 7840-7855 ()]]>https://dblp.org/rec/journals/tit/Babaie-ZadehJM11Sat, 01 Jan 2011 00:00:00 +0100 Corrections to "On the Stable Recovery of the Sparsest Overcomplete Representations in Presence of Noise" [Oct 10 5396-5400].https://doi.org/10.1109/TSP.2011.2116310, :
Corrections to "On the Stable Recovery of the Sparsest Overcomplete Representations in Presence of Noise" [Oct 10 5396-5400]. IEEE Trans. Signal Process. 59(4): 1913 ()]]>https://dblp.org/rec/journals/tsp/Babaie-ZadehJ11Sat, 01 Jan 2011 00:00:00 +0100 SRF: Matrix completion based on smoothed rank function.https://doi.org/10.1109/ICASSP.2011.5947147, , , :
SRF: Matrix completion based on smoothed rank function. ICASSP : 3672-3675]]>https://dblp.org/rec/conf/icassp/GhasemiMBJ11Sat, 01 Jan 2011 00:00:00 +0100 Watermarking Based on Independent Component Analysis in Spatial Domain.https://doi.org/10.1109/UKSIM.2011.63, , :
Watermarking Based on Independent Component Analysis in Spatial Domain. UKSim : 299-303]]>https://dblp.org/rec/conf/uksim/HajisamiRB11Sat, 01 Jan 2011 00:00:00 +0100 On the error of estimating the sparsest solution of underdetermined linear systems.http://arxiv.org/abs/1112.0789, , :
On the error of estimating the sparsest solution of underdetermined linear systems. CoRR abs/1112.0789 ()]]>https://dblp.org/rec/journals/corr/abs-1112-0789Sat, 01 Jan 2011 00:00:00 +0100 On the stable recovery of the sparsest overcomplete representations in presence of noise.https://doi.org/10.1109/TSP.2010.2052357, :
On the stable recovery of the sparsest overcomplete representations in presence of noise. IEEE Trans. Signal Process. 58(10): 5396-5400 ()]]>https://dblp.org/rec/journals/tsp/Babaie-ZadehJ10Fri, 01 Jan 2010 00:00:00 +0100 An Alternating Minimization Method for Sparse Channel Estimation.https://doi.org/10.1007/978-3-642-15995-4_40, , :
An Alternating Minimization Method for Sparse Channel Estimation. LVA/ICA : 319-327]]>https://dblp.org/rec/conf/ica/NiazadehBJ10Fri, 01 Jan 2010 00:00:00 +0100 Fast Block-Sparse Decomposition Based on SL0.https://doi.org/10.1007/978-3-642-15995-4_53, , :
Fast Block-Sparse Decomposition Based on SL0. LVA/ICA : 426-433]]>https://dblp.org/rec/conf/ica/GhalehjeghBJ10Fri, 01 Jan 2010 00:00:00 +0100 Using Non-Negative Matrix Factorization for Removing Show-Through.https://doi.org/10.1007/978-3-642-15995-4_60, , :
Using Non-Negative Matrix Factorization for Removing Show-Through. LVA/ICA : 482-489]]>https://dblp.org/rec/conf/ica/Merrikh-BayatBJ10Fri, 01 Jan 2010 00:00:00 +0100 Adaptive and Non-adaptive ISI Sparse Channel Estimation Based on SL0 and Its Application in ML Sequence-by-Sequence Equalization.https://doi.org/10.1007/978-3-642-15995-4_72, , , :
Adaptive and Non-adaptive ISI Sparse Channel Estimation Based on SL0 and Its Application in ML Sequence-by-Sequence Equalization. LVA/ICA : 579-587]]>https://dblp.org/rec/conf/ica/NiazadehGBJ10Fri, 01 Jan 2010 00:00:00 +0100 Parametric dictionary learning using steepest descent.https://doi.org/10.1109/ICASSP.2010.5495278, , , :
Parametric dictionary learning using steepest descent. ICASSP : 1978-1981]]>https://dblp.org/rec/conf/icassp/AtaeeZBJ10Fri, 01 Jan 2010 00:00:00 +0100 An entropy based method for activation detection of functional MRI data using Independent Component Analysis.https://doi.org/10.1109/ICASSP.2010.5494915, , , :
An entropy based method for activation detection of functional MRI data using Independent Component Analysis. ICASSP : 2014-2017]]>https://dblp.org/rec/conf/icassp/AkhbariBFJ10Fri, 01 Jan 2010 00:00:00 +0100 Sparse Recovery using Smoothed ℓ0 (SL0): Convergence Analysis.http://arxiv.org/abs/1001.5073, , , :
Sparse Recovery using Smoothed ℓ0 (SL0): Convergence Analysis. CoRR abs/1001.5073 ()]]>https://dblp.org/rec/journals/corr/abs-1001-5073Fri, 01 Jan 2010 00:00:00 +0100 Bayesian Cramér-Rao Bound for Noisy Non-Blind and Blind Compressed Sensing.http://arxiv.org/abs/1005.4316, , :
Bayesian Cramér-Rao Bound for Noisy Non-Blind and Blind Compressed Sensing. CoRR abs/1005.4316 ()]]>https://dblp.org/rec/journals/corr/abs-1005-4316Fri, 01 Jan 2010 00:00:00 +0100 On the stable recovery of the sparsest overcomplete representations in presence of noise.http://arxiv.org/abs/1006.0304, :
On the stable recovery of the sparsest overcomplete representations in presence of noise. CoRR abs/1006.0304 ()]]>https://dblp.org/rec/journals/corr/abs-1006-0304Fri, 01 Jan 2010 00:00:00 +0100 On the Achievability of Cramér-Rao Bound In Noisy Compressed Sensing.http://arxiv.org/abs/1006.2513, , :
On the Achievability of Cramér-Rao Bound In Noisy Compressed Sensing. CoRR abs/1006.2513 ()]]>https://dblp.org/rec/journals/corr/abs-1006-2513Fri, 01 Jan 2010 00:00:00 +0100 Bayesian Hypothesis Testing for Sparse Representation.http://arxiv.org/abs/1008.3618, , :
Bayesian Hypothesis Testing for Sparse Representation. CoRR abs/1008.3618 ()]]>https://dblp.org/rec/journals/corr/abs-1008-3618Fri, 01 Jan 2010 00:00:00 +0100 A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed ell 0 Norm.https://doi.org/10.1109/TSP.2008.2007606, , :
A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed ell 0 Norm. IEEE Trans. Signal Process. 57(1): 289-301 ()]]>https://dblp.org/rec/journals/tsp/MohimaniBJ09Thu, 01 Jan 2009 00:00:00 +0100 An iterative Bayesian algorithm for sparse component analysis in presence of noise.https://doi.org/10.1109/TSP.2009.2025154, , :
An iterative Bayesian algorithm for sparse component analysis in presence of noise. IEEE Trans. Signal Process. 57(11): 4378-4390 ()]]>https://dblp.org/rec/journals/tsp/ZayyaniBJ09Thu, 01 Jan 2009 00:00:00 +0100 k/K-Nearest Neighborhood Criterion for Improving Locally Linear Embedding.https://doi.org/10.1109/CGIV.2009.81, , :
k/K-Nearest Neighborhood Criterion for Improving Locally Linear Embedding. CGIV : 392-397]]>https://dblp.org/rec/conf/IEEEcgiv/EftekhariMB09Thu, 01 Jan 2009 00:00:00 +0100 Two Dimensional Compressive Classifier for Sparse Images.https://doi.org/10.1109/CGIV.2009.68, , :
Two Dimensional Compressive Classifier for Sparse Images. CGIV : 402-405]]>https://dblp.org/rec/conf/IEEEcgiv/EftekhariMB09aThu, 01 Jan 2009 00:00:00 +0100 k/K-Nearest Neighborhood Criterion for Improvement of Locally Linear Embedding.https://doi.org/10.1007/978-3-642-03767-2_98, , :
k/K-Nearest Neighborhood Criterion for Improvement of Locally Linear Embedding. CAIP : 808-815]]>https://dblp.org/rec/conf/caip/EftekhariMB09Thu, 01 Jan 2009 00:00:00 +0100 Bayesian Pursuit algorithm for sparse representation.https://doi.org/10.1109/ICASSP.2009.4959892, , :
Bayesian Pursuit algorithm for sparse representation. ICASSP : 1549-1552]]>https://dblp.org/rec/conf/icassp/ZayyaniBJ09Thu, 01 Jan 2009 00:00:00 +0100 Thresholded smoothed-l0(SL0) dictionary learning for sparse representations.https://doi.org/10.1109/ICASSP.2009.4959961, :
Thresholded smoothed-l0(SL0) dictionary learning for sparse representations. ICASSP : 1825-1828]]>https://dblp.org/rec/conf/icassp/ZayyaniB09Thu, 01 Jan 2009 00:00:00 +0100 Sparse Decomposition over non-full-rank dictionaries.https://doi.org/10.1109/ICASSP.2009.4960243, , :
Sparse Decomposition over non-full-rank dictionaries. ICASSP : 2953-2956]]>https://dblp.org/rec/conf/icassp/Babaie-ZadehVJ09Thu, 01 Jan 2009 00:00:00 +0100 Inflating compressed samples: A joint source-channel coding approach for noise-resistant compressed sensing.https://doi.org/10.1109/ICASSP.2009.4960244, , :
Inflating compressed samples: A joint source-channel coding approach for noise-resistant compressed sensing. ICASSP : 2957-2960]]>https://dblp.org/rec/conf/icassp/HesamMohseniBJ09Thu, 01 Jan 2009 00:00:00 +0100 Sparse decomposition of two dimensional signals.https://doi.org/10.1109/ICASSP.2009.4960294, , :
Sparse decomposition of two dimensional signals. ICASSP : 3157-3160]]>https://dblp.org/rec/conf/icassp/GhafariBJ09Thu, 01 Jan 2009 00:00:00 +0100 Robust-SL0 for stable sparse representation in noisy settings.https://doi.org/10.1109/ICASSP.2009.4960363, , , :
Robust-SL0 for stable sparse representation in noisy settings. ICASSP : 3433-3436]]>https://dblp.org/rec/conf/icassp/EftekhariBJM09Thu, 01 Jan 2009 00:00:00 +0100 Two dimensional compressive classifier for sparse images.https://doi.org/10.1109/ICIP.2009.5414298, , , :
Two dimensional compressive classifier for sparse images. ICIP : 2137-2140]]>https://dblp.org/rec/conf/icip/EftekhariMBM09Thu, 01 Jan 2009 00:00:00 +0100 Image Coding and Compression with Sparse 3D Discrete Cosine Transform.https://doi.org/10.1007/978-3-642-00599-2_67, , , :
Image Coding and Compression with Sparse 3D Discrete Cosine Transform. ICA : 532-539]]>https://dblp.org/rec/conf/ida/PalangiGBJ09Thu, 01 Jan 2009 00:00:00 +0100 Image Denoising Using Sparse Representations.https://doi.org/10.1007/978-3-642-00599-2_70, , , :
Image Denoising Using Sparse Representations. ICA : 557-564]]>https://dblp.org/rec/conf/ida/ValiollahzadehFBJ09Thu, 01 Jan 2009 00:00:00 +0100 Estimating the mixing matrix in Sparse Component Analysis (SCA) based on partial k-dimensional subspace clustering.https://doi.org/10.1016/j.neucom.2007.07.035, , , :
Estimating the mixing matrix in Sparse Component Analysis (SCA) based on partial k-dimensional subspace clustering. Neurocomputing 71(10-12): 2330-2343 ()]]>https://dblp.org/rec/journals/ijon/NainiMBJ08Tue, 01 Jan 2008 00:00:00 +0100 On the Cramér-Rao Bound for Estimating the Mixing Matrix in Noisy Sparse Component Analysis.https://doi.org/10.1109/LSP.2008.2003989, , , :
On the Cramér-Rao Bound for Estimating the Mixing Matrix in Noisy Sparse Component Analysis. IEEE Signal Process. Lett. 15: 609-612 ()]]>https://dblp.org/rec/journals/spl/ZayyaniBHJ08Tue, 01 Jan 2008 00:00:00 +0100 Estimating the mixing matrix in underdetermined Sparse Component Analysis (SCA) using consecutive independent component analysis (ICA).https://ieeexplore.ieee.org/document/7080499/, , , :
Estimating the mixing matrix in underdetermined Sparse Component Analysis (SCA) using consecutive independent component analysis (ICA). EUSIPCO : 1-5]]>https://dblp.org/rec/conf/eusipco/JavanmardPBJ08Tue, 01 Jan 2008 00:00:00 +0100 A nonlinear blind source separation solution for removing the show-through effect in the scanned documents.https://ieeexplore.ieee.org/document/7080643/, , :
A nonlinear blind source separation solution for removing the show-through effect in the scanned documents. EUSIPCO : 1-5]]>https://dblp.org/rec/conf/eusipco/Merrikh-BayatBJ08Tue, 01 Jan 2008 00:00:00 +0100 Estimating the mixing matrix in Sparse Component Analysis (SCA) using EM algorithm and iterative Bayesian clustering.https://ieeexplore.ieee.org/document/7080331/, , :
Estimating the mixing matrix in Sparse Component Analysis (SCA) using EM algorithm and iterative Bayesian clustering. EUSIPCO : 1-5]]>https://dblp.org/rec/conf/eusipco/ZayyaniBJ08Tue, 01 Jan 2008 00:00:00 +0100 A first step to convolutive sparse representation.https://doi.org/10.1109/ICASSP.2008.4518011, , , :
A first step to convolutive sparse representation. ICASSP : 1921-1924]]>https://dblp.org/rec/conf/icassp/FirouziBSJ08Tue, 01 Jan 2008 00:00:00 +0100 Decoding real-field codes by an iterative Expectation-Maximization (EM) algorithm.https://doi.org/10.1109/ICASSP.2008.4518323, , :
Decoding real-field codes by an iterative Expectation-Maximization (EM) algorithm. ICASSP : 3169-3172]]>https://dblp.org/rec/conf/icassp/ZayyaniBJ08Tue, 01 Jan 2008 00:00:00 +0100 Complex-valued sparse representation based on smoothed l0 norm.https://doi.org/10.1109/ICASSP.2008.4518501, , :
Complex-valued sparse representation based on smoothed l0 norm. ICASSP : 3881-3884]]>https://dblp.org/rec/conf/icassp/MohimaniBJ08Tue, 01 Jan 2008 00:00:00 +0100 A fast approach for overcomplete sparse decomposition based on smoothed L0 norm.http://arxiv.org/abs/0809.2508, , :
A fast approach for overcomplete sparse decomposition based on smoothed L0 norm. CoRR abs/0809.2508 ()]]>https://dblp.org/rec/journals/corr/abs-0809-2508Tue, 01 Jan 2008 00:00:00 +0100 A First Step to Convolutive Sparse Representation.http://arxiv.org/abs/0809.3485, , , :
A First Step to Convolutive Sparse Representation. CoRR abs/0809.3485 ()]]>https://dblp.org/rec/journals/corr/abs-0809-3485Tue, 01 Jan 2008 00:00:00 +0100 Approximate Sparse Decomposition Based on Smoothed L0-Norm.http://arxiv.org/abs/0811.2868, , , :
Approximate Sparse Decomposition Based on Smoothed L0-Norm. CoRR abs/0811.2868 ()]]>https://dblp.org/rec/journals/corr/abs-0811-2868Tue, 01 Jan 2008 00:00:00 +0100 A New Trend in Optimization on Multi Overcomplete Dictionary toward Inpainting.http://arxiv.org/abs/0812.2405, , , :
A New Trend in Optimization on Multi Overcomplete Dictionary toward Inpainting. CoRR abs/0812.2405 ()]]>https://dblp.org/rec/journals/corr/abs-0812-2405Tue, 01 Jan 2008 00:00:00 +0100 Sparse Component Analysis (SCA) in Random-valued and Salt and Pepper Noise Removal.http://arxiv.org/abs/0812.2892, , :
Sparse Component Analysis (SCA) in Random-valued and Salt and Pepper Noise Removal. CoRR abs/0812.2892 ()]]>https://dblp.org/rec/journals/corr/abs-0812-2892Tue, 01 Jan 2008 00:00:00 +0100 Fast Sparse Representation Based on Smoothed l0 Norm.https://doi.org/10.1007/978-3-540-74494-8_49, , :
Fast Sparse Representation Based on Smoothed l0 Norm. ICA : 389-396]]>https://dblp.org/rec/conf/ica/MohimaniBJ07Mon, 01 Jan 2007 00:00:00 +0100 Estimating the Mixing Matrix in Sparse Component Analysis Based on Converting a Multiple Dominant to a Single Dominant Problem.https://doi.org/10.1007/978-3-540-74494-8_50, , :
Estimating the Mixing Matrix in Sparse Component Analysis Based on Converting a Multiple Dominant to a Single Dominant Problem. ICA : 397-405]]>https://dblp.org/rec/conf/ica/NoorshamsBJ07Mon, 01 Jan 2007 00:00:00 +0100 Sparse Component Analysis in Presence of Noise Using an Iterative EM-MAP Algorithm.https://doi.org/10.1007/978-3-540-74494-8_55, , , :
Sparse Component Analysis in Presence of Noise Using an Iterative EM-MAP Algorithm. ICA : 438-445]]>https://dblp.org/rec/conf/ica/ZayyaniBMJ07Mon, 01 Jan 2007 00:00:00 +0100 Source Estimation in Noisy Sparse Component Analysis.https://doi.org/10.1109/ICDSP.2007.4288558, , :
Source Estimation in Noisy Sparse Component Analysis. DSP : 219-222]]>https://dblp.org/rec/conf/icdsp/ZayyaniBJ07Mon, 01 Jan 2007 00:00:00 +0100 Quasi-optimal EASI algorithm based on the Score Function Difference (SFD).https://doi.org/10.1016/j.neucom.2005.12.019, , :
Quasi-optimal EASI algorithm based on the Score Function Difference (SFD). Neurocomputing 69(13-15): 1415-1424 ()]]>https://dblp.org/rec/journals/ijon/SamadiBJ06Sun, 01 Jan 2006 00:00:00 +0100 Sparse ICA via cluster-wise PCA.https://doi.org/10.1016/j.neucom.2005.12.022, , :
Sparse ICA via cluster-wise PCA. Neurocomputing 69(13-15): 1458-1466 ()]]>https://dblp.org/rec/journals/ijon/Babaie-ZadehJM06Sun, 01 Jan 2006 00:00:00 +0100 Semi-Blind Approaches for Source Separation and Independent component Analysis.https://www.esann.org/sites/default/files/proceedings/legacy/es2006-2.pdf, :
Semi-Blind Approaches for Source Separation and Independent component Analysis. ESANN : 301-312]]>https://dblp.org/rec/conf/esann/Babaie-ZadehJ06Sun, 01 Jan 2006 00:00:00 +0100 A new approach for sparse decomposition and sparse source separation.https://ieeexplore.ieee.org/document/7071611/, , :
A new approach for sparse decomposition and sparse source separation. EUSIPCO : 1-5]]>https://dblp.org/rec/conf/eusipco/AminiBJ06Sun, 01 Jan 2006 00:00:00 +0100 A general approach for mutual information minimization and its application to blind source separation.https://doi.org/10.1016/j.sigpro.2004.11.021, :
A general approach for mutual information minimization and its application to blind source separation. Signal Process. 85(5): 975-995 ()]]>https://dblp.org/rec/journals/sigpro/Babaie-ZadehJ05Sat, 01 Jan 2005 00:00:00 +0100 ICA by mutual information minimization: An approach for avoiding local minima.https://ieeexplore.ieee.org/document/7077932/, , :
ICA by mutual information minimization: An approach for avoiding local minima. EUSIPCO : 1-4]]>https://dblp.org/rec/conf/eusipco/Babaie-ZadehBJ05Sat, 01 Jan 2005 00:00:00 +0100 A new method for estimating score function difference (SFD) and its application to Blind Source Separation.https://ieeexplore.ieee.org/document/7078256/, , :
A new method for estimating score function difference (SFD) and its application to Blind Source Separation. EUSIPCO : 1-4]]>https://dblp.org/rec/conf/eusipco/BahmaniBJ05Sat, 01 Jan 2005 00:00:00 +0100 A new method for separation of speech signals in convolutive mixtures.https://ieeexplore.ieee.org/document/7078439/, , :
A new method for separation of speech signals in convolutive mixtures. EUSIPCO : 1-4]]>https://dblp.org/rec/conf/eusipco/NaeinyBM05Sat, 01 Jan 2005 00:00:00 +0100 Three easy ways for separating nonlinear mixtures?https://doi.org/10.1016/j.sigpro.2003.10.011, , :
Three easy ways for separating nonlinear mixtures? Signal Process. 84(2): 217-229 ()]]>https://dblp.org/rec/journals/sigpro/JuttenBH04Thu, 01 Jan 2004 00:00:00 +0100 Differential of the mutual information.https://doi.org/10.1109/LSP.2003.819344, , :
Differential of the mutual information. IEEE Signal Process. Lett. 11(1): 48-51 ()]]>https://dblp.org/rec/journals/spl/Babaie-ZadehJN04Thu, 01 Jan 2004 00:00:00 +0100 Blind Source Separation by Adaptive Estimation of Score Function Difference.https://doi.org/10.1007/978-3-540-30110-3_2, , , :
Blind Source Separation by Adaptive Estimation of Score Function Difference. ICA : 9-17]]>https://dblp.org/rec/conf/ica/SamadiBJN04Thu, 01 Jan 2004 00:00:00 +0100 A Geometric Approach for Separating Several Speech Signals.https://doi.org/10.1007/978-3-540-30110-3_101, , , :
A Geometric Approach for Separating Several Speech Signals. ICA : 798-806]]>https://dblp.org/rec/conf/ica/Babaie-ZadehMJM04Thu, 01 Jan 2004 00:00:00 +0100 A minimization-projection (MP) approach for blind separating convolutive mixtures.https://doi.org/10.1109/ICASSP.2004.1327165, , :
A minimization-projection (MP) approach for blind separating convolutive mixtures. ICASSP (5) : 533-536]]>https://dblp.org/rec/conf/icassp/Babaie-ZadehJN04Thu, 01 Jan 2004 00:00:00 +0100 A geometric approach for separating post non-linear mixtures.https://ieeexplore.ieee.org/document/7072228/, , :
A geometric approach for separating post non-linear mixtures. EUSIPCO : 1-4]]>https://dblp.org/rec/conf/eusipco/Babaie-ZadehJN02Tue, 01 Jan 2002 00:00:00 +0100 Separating Convolutive Mixtures by Mutual Information Minimization.https://doi.org/10.1007/3-540-45723-2_101, , :
Separating Convolutive Mixtures by Mutual Information Minimization. IWANN (2) : 834-842]]>https://dblp.org/rec/conf/iwann/Babaie-ZadehJN01Mon, 01 Jan 2001 00:00:00 +0100