Andrew G. Klein
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Andrew G. Klein has a total of 93 co-authors. Here are the top co-authors by number of shared publications:
D. Richard Brown
Department of Electrical and Computer Engineering, Worcester Polytechnic Institute, Worcester, USA
9 shared publicationsC.R. Johnson
School of Electrical & Computer Engineering, Cornell University, Ithaca, NY 14853, USA
7 shared publicationsXinming Huang
Department of Electrical and Computer Engineering, Worcester Polytechnic Institute, MA 01609, USA
6 shared publicationsYanjie Peng
Department of Electrical and Computer Engineering, Worcester Polytechnic Institute, MA 01609, USA
6 shared publicationsJill Davishahl
Western Washington University
4 shared publicationsP. Duhamel
Laboratoire des Signaux et Systèmes/Supélec/CNRS, 3 rue Joliot-Curie, F-91190 Gif-sur-Yvette, France
4 shared publications
Latest Publications
- 8 September 2020
- Published by American Society for Engineering Education
S-STEM Becoming Engaged Engineering Scholars (BEES): Insights from Year 1
- 8 September 2020
- Published by American Society for Engineering Education
S-STEM Becoming Engaged Engineering Scholars (BEES): Insights from Year 1
- 26 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 9 (8) , 1164-1168
Average Age of Information in Update Systems With Active Sources and Packet Delivery Errors
This letter studies the “age of information” (AoI) in a multi-source status update system where N active sources each send updates of their time-varying process to a monitor through a server with packet delivery errors. We analyze the average AoI for stationary randomized and round-robin scheduling policies. For both of these scheduling policies, we further analyze the effect of packet retransmission policies, i.e., retransmission without resampling, retransmission with resampling, or no retransmission, when errors occur. Expressions for the average AoI are derived for each case. It is shown that the round-robin schedule policy in conjunction with retransmission with resampling when errors occur achieves the lowest average AoI among the considered cases. For stationary randomized schedules with equiprobable source selection, it is further shown that the average AoI gap to round-robin schedules with the same packet management policy scales as O(N ). Finally, for stationary randomized policies, the optimal source selection probabilities that minimize a weighted sum average AoI metric are derived.
- 26 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 9 (8) , 1164-1168
Average Age of Information in Update Systems With Active Sources and Packet Delivery Errors
This letter studies the “age of information” (AoI) in a multi-source status update system where N active sources each send updates of their time-varying process to a monitor through a server with packet delivery errors. We analyze the average AoI for stationary randomized and round-robin scheduling policies. For both of these scheduling policies, we further analyze the effect of packet retransmission policies, i.e., retransmission without resampling, retransmission with resampling, or no retransmission, when errors occur. Expressions for the average AoI are derived for each case. It is shown that the round-robin schedule policy in conjunction with retransmission with resampling when errors occur achieves the lowest average AoI among the considered cases. For stationary randomized schedules with equiprobable source selection, it is further shown that the average AoI gap to round-robin schedules with the same packet management policy scales as O(N ). Finally, for stationary randomized policies, the optimal source selection probabilities that minimize a weighted sum average AoI metric are derived.
- 1 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 96-101
Fundamental Bounds on the Age of Information in General Multi-Hop Interference Networks
This paper studies the “age of information” of status updates in a general multi-source multi-hop wireless network with time slotted transmissions and general interference constraints. Specifically, the scenario considered in this paper assumes that each node in the network is both a source and a monitor of information and that all nodes wish to receive fresh status updates from all other nodes in the network. Lower bounds for the instantaneous peak and average age of information are derived for three interference models using properties of each interference model's family of feasible activation sets. These bounds generalize prior results derived for the “global” interference model where only one node transmits in each time slot. Achievability results are presented through the development of explicit schedules for ring networks in three specific interference models: (i) global interference, (ii) interference free, i.e., all nodes can transmit simultaneously without interference, and (iii) topologically-dependent interference where multiple nodes transmit simultaneously if they share no one-hop neighbors. Numerical examples are presented to quantify the gap between the achieved age and the bounds.
- 1 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 96-101
Fundamental Bounds on the Age of Information in General Multi-Hop Interference Networks
This paper studies the “age of information” of status updates in a general multi-source multi-hop wireless network with time slotted transmissions and general interference constraints. Specifically, the scenario considered in this paper assumes that each node in the network is both a source and a monitor of information and that all nodes wish to receive fresh status updates from all other nodes in the network. Lower bounds for the instantaneous peak and average age of information are derived for three interference models using properties of each interference model's family of feasible activation sets. These bounds generalize prior results derived for the “global” interference model where only one node transmits in each time slot. Achievability results are presented through the development of explicit schedules for ring networks in three specific interference models: (i) global interference, (ii) interference free, i.e., all nodes can transmit simultaneously without interference, and (iii) topologically-dependent interference where multiple nodes transmit simultaneously if they share no one-hop neighbors. Numerical examples are presented to quantify the gap between the achieved age and the bounds.
- Open Access
Build-A-FLAIR: Synthetic T2-FLAIR Contrast Generation through Physics Informed Deep Learning
Purpose: Magnetic resonance imaging (MRI) exams include multiple series with varying contrast and redundant information. For instance, T2-FLAIR contrast is based upon tissue T2 decay and the presence of water, also present in T2- and diffusion-weighted contrasts. T2-FLAIR contrast can be hypothetically modeled through deep learning models trained with diffusion- and T2-weighted acquisitions. Methods: Diffusion-, T2-, T2-FLAIR-, and T1-weighted brain images were acquired in 15 individuals. A convolutional neural network was developed to generate a T2-FLAIR image from other contrasts. Two datasets were withheld from training for validation. Results: Inputs with physical relationships to T2-FLAIR contrast most significantly impacted performance. The best model yielded results similar to acquired T2-FLAIR images, with a structural similarity index of 0.909, and reproduced pathology excluded from training. Synthetic images qualitatively exhibited lower noise and increased smoothness compared to acquired images. Conclusion: This suggests that with optimal inputs, deep learning based contrast generation performs well with creating synthetic T2-FLAIR images. Feature engineering on neural network inputs, based upon the physical basis of contrast, impacts the generation of synthetic contrast images. A larger, prospective clinical study is needed.
Open AccessBuild-A-FLAIR: Synthetic T2-FLAIR Contrast Generation through Physics Informed Deep Learning
Purpose: Magnetic resonance imaging (MRI) exams include multiple series with varying contrast and redundant information. For instance, T2-FLAIR contrast is based upon tissue T2 decay and the presence of water, also present in T2- and diffusion-weighted contrasts. T2-FLAIR contrast can be hypothetically modeled through deep learning models trained with diffusion- and T2-weighted acquisitions. Methods: Diffusion-, T2-, T2-FLAIR-, and T1-weighted brain images were acquired in 15 individuals. A convolutional neural network was developed to generate a T2-FLAIR image from other contrasts. Two datasets were withheld from training for validation. Results: Inputs with physical relationships to T2-FLAIR contrast most significantly impacted performance. The best model yielded results similar to acquired T2-FLAIR images, with a structural similarity index of 0.909, and reproduced pathology excluded from training. Synthetic images qualitatively exhibited lower noise and increased smoothness compared to acquired images. Conclusion: This suggests that with optimal inputs, deep learning based contrast generation performs well with creating synthetic T2-FLAIR images. Feature engineering on neural network inputs, based upon the physical basis of contrast, impacts the generation of synthetic contrast images. A larger, prospective clinical study is needed.
- Open Access
- 16 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 16 (9) , 5732-5746
Staleness Bounds and Efficient Protocols for Dissemination of Global Channel State Information
This paper considers the problem of achieving global channel knowledge throughout a fully connected packetized wireless network with time-varying channels. While the value of channel state information at the transmitter (CSIT) is now well known, there are many scenarios in which it is helpful to have additional channel knowledge beyond conventional CSIT, e.g., cooperative communication systems. The overhead required for global CSI knowledge can be significant, particularly in time-varying channels where the quality of channel estimates is dominated by the “staleness” of the CSI. Nevertheless, the fundamental limits and feasibility of tracking global CSI throughout a network have not been sufficiently studied. This paper presents a framework for analyzing the staleness of protocols that estimate and disseminate CSI to all nodes in a fully connected network. Fundamental bounds on achievable staleness are derived, and efficient dissemination protocols are developed, which achieve these limits. The results provide engineering guidelines on the feasibility of tracking global CSI as a function of network size, the size and composition of the packets, packet error rate, and channel coherence time.
- 16 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 16 (9) , 5732-5746
Open AccessStaleness Bounds and Efficient Protocols for Dissemination of Global Channel State Information
This paper considers the problem of achieving global channel knowledge throughout a fully connected packetized wireless network with time-varying channels. While the value of channel state information at the transmitter (CSIT) is now well known, there are many scenarios in which it is helpful to have additional channel knowledge beyond conventional CSIT, e.g., cooperative communication systems. The overhead required for global CSI knowledge can be significant, particularly in time-varying channels where the quality of channel estimates is dominated by the “staleness” of the CSI. Nevertheless, the fundamental limits and feasibility of tracking global CSI throughout a network have not been sufficiently studied. This paper presents a framework for analyzing the staleness of protocols that estimate and disseminate CSI to all nodes in a fully connected network. Fundamental bounds on achievable staleness are derived, and efficient dissemination protocols are developed, which achieve these limits. The results provide engineering guidelines on the feasibility of tracking global CSI as a function of network size, the size and composition of the packets, packet error rate, and channel coherence time.
- Open Access
- 1 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 144-148
Wove paper analysis through texture similarities
Wove paper, made on a papermaking screen or mold having a surface of smooth tightly woven wires, was the predominant paper type used for printing in the twentieth century. To aid in the study and classification of fine art prints on wove paper, the present work compares the results of five different image processing approaches for characterizing surface texture. Using a collection of popular wove papers, a reference dataset of raking light close-up images was assembled. Five research teams undertook their own processing strategies to detect affinities among the paper samples. Their success in identifying similarity groupings are reported.
- 1 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 144-148
Open AccessWove paper analysis through texture similarities
Wove paper, made on a papermaking screen or mold having a surface of smooth tightly woven wires, was the predominant paper type used for printing in the twentieth century. To aid in the study and classification of fine art prints on wove paper, the present work compares the results of five different image processing approaches for characterizing surface texture. Using a collection of popular wove papers, a reference dataset of raking light close-up images was assembled. Five research teams undertook their own processing strategies to detect affinities among the paper samples. Their success in identifying similarity groupings are reported.