2,109 research outputs found
Fast Low-rank Representation based Spatial Pyramid Matching for Image Classification
Spatial Pyramid Matching (SPM) and its variants have achieved a lot of
success in image classification. The main difference among them is their
encoding schemes. For example, ScSPM incorporates Sparse Code (SC) instead of
Vector Quantization (VQ) into the framework of SPM. Although the methods
achieve a higher recognition rate than the traditional SPM, they consume more
time to encode the local descriptors extracted from the image. In this paper,
we propose using Low Rank Representation (LRR) to encode the descriptors under
the framework of SPM. Different from SC, LRR considers the group effect among
data points instead of sparsity. Benefiting from this property, the proposed
method (i.e., LrrSPM) can offer a better performance. To further improve the
generalizability and robustness, we reformulate the rank-minimization problem
as a truncated projection problem. Extensive experimental studies show that
LrrSPM is more efficient than its counterparts (e.g., ScSPM) while achieving
competitive recognition rates on nine image data sets.Comment: accepted into knowledge based systems, 201
Channel Covariance Matrix Estimation via Dimension Reduction for Hybrid MIMO MmWave Communication Systems
Hybrid massive MIMO structures with lower hardware complexity and power
consumption have been considered as a potential candidate for millimeter wave
(mmWave) communications. Channel covariance information can be used for
designing transmitter precoders, receiver combiners, channel estimators, etc.
However, hybrid structures allow only a lower-dimensional signal to be
observed, which adds difficulties for channel covariance matrix estimation. In
this paper, we formulate the channel covariance estimation as a structured
low-rank matrix sensing problem via Kronecker product expansion and use a
low-complexity algorithm to solve this problem. Numerical results with uniform
linear arrays (ULA) and uniform squared planar arrays (USPA) are provided to
demonstrate the effectiveness of our proposed method
Matrix Completion-Based Channel Estimation for MmWave Communication Systems With Array-Inherent Impairments
Hybrid massive MIMO structures with reduced hardware complexity and power
consumption have been widely studied as a potential candidate for millimeter
wave (mmWave) communications. Channel estimators that require knowledge of the
array response, such as those using compressive sensing (CS) methods, may
suffer from performance degradation when array-inherent impairments bring
unknown phase errors and gain errors to the antenna elements. In this paper, we
design matrix completion (MC)-based channel estimation schemes which are robust
against the array-inherent impairments. We first design an open-loop training
scheme that can sample entries from the effective channel matrix randomly and
is compatible with the phase shifter-based hybrid system. Leveraging the
low-rank property of the effective channel matrix, we then design a channel
estimator based on the generalized conditional gradient (GCG) framework and the
alternating minimization (AltMin) approach. The resulting estimator is immune
to array-inherent impairments and can be implemented to systems with any array
shapes for its independence of the array response. In addition, we extend our
design to sample a transformed channel matrix following the concept of
inductive matrix completion (IMC), which can be solved efficiently using our
proposed estimator and achieve similar performance with a lower requirement of
the dynamic range of the transmission power per antenna. Numerical results
demonstrate the advantages of our proposed MC-based channel estimators in terms
of estimation performance, computational complexity and robustness against
array-inherent impairments over the orthogonal matching pursuit (OMP)-based CS
channel estimator.Comment: This work has been submitted to the IEEE for possible publication.
Copyright may be transferred without notice, after which this version may no
longer be accessibl
- …