-
521
Hyperspectral Imagery Super-Resolution by Compressive Sensing Inspired Dictionary Learning and Spatial-Spectral Regularization
Published 2015-01-01“…Thus, a sparsity and incoherence restricted dictionary learning method is proposed to achieve higher efficiency sparse representation. …”
Get full text
Article -
522
EP‐LSTM: Novel prediction algorithm for moving object destination
Published 2021-02-01“…At present, there are problems such as data sparsity and long‐term dependence based on historical trajectory prediction methods, which affect the accuracy of prediction. …”
Get full text
Article -
523
Doppler and Channel Estimation Using Superimposed Linear Frequency Modulation Preamble Signal for Underwater Acoustic Communication
Published 2024-02-01“…Compared with the original OMP algorithm with known channel sparsity, the proposed CPS-IOMP algorithm achieves a similar estimation accuracy with a smaller computational complexity, as well as requiring no prior knowledge about the channel sparsity.…”
Get full text
Article -
524
SRI3D: Two‐stream inflated 3D ConvNet based on sparse regularization for action recognition
Published 2023-04-01“…However, as far as is known, no one has studied the influence of the sparsity of network output on the output of deep learning‐based action recognition models. …”
Get full text
Article -
525
Block Sparse Compressed Sensing of Electroencephalogram (EEG) Signals by Exploiting Linear and Non-Linear Dependencies
Published 2016-02-01“…This method exploits the block sparsity and the intra-correlation (i.e., the linear dependency) within the measurement vector of a single channel. …”
Get full text
Article -
526
Sampling great circles at their rate of innovation
Published 2014Get full text
Get full text
Conference Paper -
527
Context-Aware Collaborative Filtering Using Context Similarity: An Empirical Comparison
Published 2022-01-01“…However, it suffers from the sparsity problem since users may not rate items in various context situations. …”
Get full text
Article -
528
Corrected rank residual constraint model for image denoising
Published 2022-11-01“…The studies show that the adaptive correction term can not only improve the sparsity of the rank residual but also overcome the over‐shrinkage of large singular values. …”
Get full text
Article -
529
Error Estimations for Total Variation Type Regularization
Published 2021-06-01“…Furthermore, an improved convergence rate is given based on the sparsity assumption. The problem under the condition of non-sparsity, which is common in practice, is also discussed; the results of the corresponding convergence rate are also presented under certain mild conditions.…”
Get full text
Article -
530
Decomposition and completion of sum-of-squares matrices
Published 2018“…We show that a subset of sparse SOS matrices with chordal sparsity patterns can be equivalently decomposed into a sum of multiple SOS matrices that are nonzero only on a principal submatrix. …”
Journal article -
531
A New Framework of Smoothed Location Model with Multiple Correspondence Analysis
Published 2015“…We refer this sitnation as large sparsity pmblem. When large sparsity of midhomial d s occurs, the smoothed estimators of location model will be greatly biased, hence creating ffmtmting performance. …”
Get full text
Conference or Workshop Item -
532
A Novel Beam Alignment Scheme for Mobile Millimeter-Wave Communications Based on Compressed Sensing Aided-Kalman Filter
Published 2022-01-01“…Since the CS performance is heavily dependent on the sparsity level, the proposed method increases the signal sparsity level by applying adaptive CS on the observation residual computed from the previous estimate of the support to predict the angles of the dominant paths, while the corresponding path gains are tracked by the reduced-order KF. …”
Get full text
Article -
533
Phase Transition of Total Variation Based on Approximate Message Passing Algorithm
Published 2022-08-01“…In compressed sensing (CS), one seeks to down-sample some high-dimensional signals and recover them accurately by exploiting the sparsity of the signals. However, the traditional sparsity assumption cannot be directly satisfied in most practical applications. …”
Get full text
Article -
534
Adaptive Estimation of Spatial Clutter Measurement Density Using Clutter Measurement Probability for Enhanced Multi-Target Tracking
Published 2019-12-01“…The clutter measurement density estimation performance and target tracking performance are also analyzed for various sparsity orders.…”
Get full text
Article -
535
Shrink and Eliminate: A Study of Post-Training Quantization and Repeated Operations Elimination in RNN Models
Published 2022-03-01“…In addition, we show that the quantization of activation vectors in RNNs to integer precision leads to considerable sparsity if the delta networks method is applied. Then, we propose a method for increasing the sparsity in the activation vectors while minimizing the error and maximizing the percentage of eliminated computations. …”
Get full text
Article -
536
A Service Recommendation System Based on Dynamic User Groups and Reinforcement Learning
Published 2023-12-01“…Nevertheless, the cold-start problem and data sparsity continue to impede the development of these recommendation systems. …”
Get full text
Article -
537
Broadband Cooperative Spectrum Sensing Based on Distributed Modulated Wideband Converter
Published 2016-09-01“…Besides, it is very hard to adjust the number of sampling channels when the sparsity changes, because its undersampling board is designed by a given sparsity. …”
Get full text
Article -
538
Short Texts Feautre Enrichment Method Based on Heterogeneous Information Network
Published 2022-09-01“…With the deep integration of computer technology into social life,more and more short text messages are spreaded all over the web platform.Aiming at the problem of data sparsity of short texts,a robust heterogeneous information network framework(HTE) for modeling short texts,which can integrate any type of additional information and capture the relationship between them to solve the data sparsity problem,is constructed.Based on this framework,six short text expansion methods are designed using different external knowledge,and the short text features are enriched by introducing entity information such as entities,entity categories,inter-entity relationships and textual information such as text topics from Wikipedia and Freebase knowledge bases.Finally,the similarity measurement result is used to verify the experimental effect.By comparing the six text expansion me-thods with the traditional three similarity measures on two short text datasets and the current mainstream short text matching algorithms,the results of the proposed six text expansion methods are improved.Compared with BERT,the similarity measurement results of the best method improves by 5.97%.The proposed framework is robust and can include any type of external know-ledge,and the proposed method can overcome the data sparsity problem of short texts and can perform similarity metrics on short texts with high accuracy in an unsupervised manner.…”
Get full text
Article -
539
Multi‐view registration based on weighted LRS matrix decomposition of motions
Published 2019-06-01“…On the basis of the inverse symmetry property of relative motions, it first proposes a completion method to reduce the sparsity of the reconstructed matrix. The reduced sparsity of the reconstructed matrix can improve the robustness and efficiency of LRS matrix decomposition. …”
Get full text
Article -
540
Data-Driven Regularization Parameter Selection in Dynamic MRI
Published 2021-02-01“…We propose a data-driven approach for the total variation regularization parameter selection, where reconstructions yield expected sparsity levels in the regularization domains. The expected sparsity levels are obtained from the measurement data for temporal regularization and from a reference image for spatial regularization. …”
Get full text
Article