Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Syed Azer Reza

dblp:196/7086 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0001-5932-7313ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
2 papers
Computational photography and imaging · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational photography and imaging
image acquisition
0.412019
Coding Scheme Optimization for Fast Fluorescence Lifetime Imaging · ACM Trans. Graph. 2019
Computational photography and imaging
time-of-flight imaging
0.412019
Practical Coding Function Design for Time-Of-Flight Imaging · CVPR 2019
Mathematical optimization › least squares
alternating least squares
0.412019
Practical Coding Function Design for Time-Of-Flight Imaging · CVPR 2019
Mathematical optimization
constrained optimization
0.412019
Practical Coding Function Design for Time-Of-Flight Imaging · CVPR 2019

Methods — techniques the papers use, named apart from their topics

convex relaxation · 0.8surrogate objective optimization · 0.4geometric noise analysis · 0.4alternating least-squares · 0.4alternating least squares · 0.4
YearPublicationVenuePosition
2019 Practical Coding Function Design for Time-Of-Flight Imaging
abstract
The depth resolution of a continuous-wave time-of-flight (CW-ToF) imaging system is determined by its coding functions. Recently, there has been growing interest in the design of new high-performance CW-ToF coding functions. However, these functions are typically designed in a hardware agnostic manner, i.e., without considering the practical device limitations, such as bandwidth, source power, digital (binary) function generation. Therefore, despite theoretical improvements, practical implementation of these functions remains a challenge. We present a constrained optimization approach for designing practical coding functions that adhere to hardware constraints. The optimization problem is non-convex with a large search space and no known globally optimal solutions. To make the problem tractable, we design an iterative, alternating least-squares algorithm, along with convex relaxation of the constraints. Using this approach, we design high-performance coding functions that can be implemented on existing hardware with minimal modifications. We demonstrate the performance benefits of the resulting functions via extensive simulations and a hardware prototype.
Felipe Gutierrez-Barragan, Syed Azer Reza, Andreas Velten, Mohit Gupta 0001
CVPR2
2019 Coding Scheme Optimization for Fast Fluorescence Lifetime Imaging
abstract
Fluorescence lifetime imaging (FLIM) is used for measuring material properties in a wide range of applications, including biology, medical imaging, chemistry, and material science. In frequency-domain FLIM (FD-FLIM), the object of interest is illuminated with a temporally modulated light source. The fluorescence lifetime is measured by computing the correlations of the emitted light with a demodulation function at the sensor. The signal-to-noise ratio (SNR) and the acquisition time of a FD-FLIM system is determined by the coding scheme (modulation and demodulation functions). In this article, we develop theory and algorithms for designing high-performance FD-FLIM coding schemes that can achieve high SNR and short acquisition time, given a fixed source power budget. Based on a geometric analysis of the image formation and noise model, we propose a novel surrogate objective for the performance of a given coding scheme. The surrogate objective is extremely fast to compute, and can be used to efficiently explore the entire space of coding schemes. Based on this objective, we design novel, high-performance coding schemes that achieve up to an order of magnitude shorter acquisition time as compared to existing approaches. We demonstrate the performance advantage of the proposed schemes in a variety of imaging conditions, using a modular hardware prototype that can implement various coding schemes.
Jongho Lee 0004, Jenu Varghese Chacko, Bing Dai, Syed Azer Reza, Abdul Kader Sagar, Kevin W. Eliceiri, Andreas Velten, Mohit Gupta 0001
ACM Trans. Graph.4