Shahram Yousefi

Dr. Shahram Yousefi


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 February 2016 in Remote Sensing
Verified
Journal Article
Open access
PDF file
YSYaser Esmaeili Salehani
Yaser Esmaeili Salehani
SGSaeed Gazor
Saeed Gazor
IKILMIN KIM
ILMIN KIM
SYShahram Yousefi
Shahram Yousefi
The goal of sparse linear hyperspectral unmixing is to determine a scanty subset of spectral signatures of materials contained in each mixed pixel and to estimate their fractional abundances. This turns into an ℓ0 -norm minimization, which is an NP-hard problem. In this paper, we propose a new iterative method, which starts as an ℓ1 -norm optimization that is convex, has a unique solution, converges quickly and iteratively tends to be an ℓ0 -norm problem. More specifically, we employ the arctan function with the parameter σ ≥ 0 in our optimization. This function is Lipschitz continuous and approximates ℓ1 -norm and ℓ0 -norm for small and large values of σ, respectively. We prove that the set of local optima of our problem is continuous versus σ. Thus, by a gradual increase of σ in each iteration, we may avoid being trapped in a suboptimal solution. We propose to use the alternating direction method of multipliers (ADMM) for our minimization problem iteratively while increasing σ exponentially. Our evaluations reveal the superiorities and shortcomings of the proposed method compared to several state-of-the-art methods. We consider such evaluations in different experiments over both synthetic and real hyperspectral data, and the results of our proposed methods reveal the sparsest estimated abundances compared to other competitive algorithms for the subimage of AVIRIS cuprite data.

26 April 2018 in Asian Journal of Control
Verified
Journal Article
Closed access
PDF file
AHAhmed T. Hafez
Ahmed T. Hafez
SGSidney Givigi
Sidney Givigi
SYShahram Yousefi
Shahram Yousefi

1 January 2014 in IFAC Proceedings Volumes
Verified
Journal Article
Open access
AHAhmed Hafez
Ahmed Hafez
MIMohamad Iskandarani
Mohamad Iskandarani
SGSidney Givigi
Sidney Givigi
SYShahram Yousefi
Shahram Yousefi
ABAlain Beaulieu
Alain Beaulieu

14 December 2017 in IEEE Systems Journal
Verified
Journal Article
Closed access
PJPeter Travis Jardine
Peter Travis Jardine
SGSidney Givigi
Sidney Givigi
SYShahram Yousefi
Shahram Yousefi
Michael KorenbergMichael Korenberg
Michael Korenberg
This paper presents a novel application of recursive fast orthogonal search (R-FOS) to produce a time-varying linear state-space system model based on a historical record of input and outputs. The model is integrated into a larger unmanned aerial system to control the altitude of a quadcopter using adaptive model predictive control (MPC). Similar to a dual Kalman filter (KF), R-FOS is also used in conjunction with a KF observer in the form of a dual fast orthogonal Kalman filter to estimate the system states. Four variations of R-FOS are implemented and compared in terms of mean squared error during a number of simulations. The R-FOS adaptive MPC strategy provides better altitude control when executed online than when an offline model is used. Comparable performance is achieved with fewer model terms when the FOS criteria for evaluation of additional terms is considered. Finally, the performance is significantly improved when a forgetting factor is incorporated to give greater weight to more recent observations. These findings demonstrate that by combining R-FOS with adaptive MPC, one can optimally control a system with unknown, time-varying dynamics.

1 June 2007
Verified
Conference Paper
Closed access
JTJean-Pierre Thibault
Jean-Pierre Thibault
SYShahram Yousefi
Shahram Yousefi
WCWai-Yip Chan
Wai-Yip Chan
Using generations to implement random linear network coding garners benefits such as reduced decoding complexity. However, these benefits can come at the expense of throughput. In this paper, we seek to understand and maximize throughput for generation-based network coding (GBNC). Motivated by the application of network coding to scalable multicast, we consider schemes which result in high probability of decoding success with minimal feedback. We show that the throughput performance of GBNC is highly dependent on the choice of coding parameters and that GBNC becomes advantageous only when the number of source packet exceeds a network-dependent threshold. Results for various network topologies lead to the formulation of throughput-motivated guidelines for the adoption of GBNC.

17 January 2023 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
IAI. Zakir Ahmed
I. Zakir Ahmed
HSHamid R. Sadjadpour
Hamid R. Sadjadpour
SYShahram Yousefi
Shahram Yousefi
In this paper, we consider passive RIS-assisted multi-user communication between wireless nodes to improve the blocked line-of-sight (LOS) link performance. The wireless nodes are assumed to be equipped with Massive Multiple-Input Multiple-Output antennas, hybrid precoder, combiner, and low-resolution analog-to-digital converters (ADCs). We first derive the expression for the Cramer-Rao lower bound (CRLB) of the Mean Squared Error (MSE) of the received and combined signal at the intended receiver under interference. By appropriate design of the hybrid precoder, combiner, and RIS phase settings, it can be shown that the MSE achieves the CRLB. We further show that minimizing the MSE w.r.t. the phase settings of the RIS is equivalent to maximizing the throughput and energy efficiency of the system. We then propose a novel Information-Directed Branch-and-Prune (IDBP) algorithm to derive the phase settings of the RIS. We, for the first time in the literature, use an information-theoretic measure to decide on the pruning rules in a tree-search algorithm to arrive at the RIS phase-setting solution, which is vastly different compared to the traditional branch-and-bound algorithm that uses bounds of the cost function to define the pruning rules. In addition, we provide the theoretical guarantees of the near-optimality of the RIS phase-setting solution thus obtained using the Asymptotic Equipartition property. This also ensures near-optimal throughput and MSE performance.