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. A simulation from public publication records: the people listed were not invited and did not agree to review.

Atreyee Saha

dblp:263/5022 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
2since 2021 · last 2025
—ORCID · unresolved

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

Artificial intelligence and machine learning · 2 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021

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.

Artificial intelligence
1 paper
Deep learning architectures and training · 100%
Computer graphics and multimedia
1 paper
Computational photography and imaging · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
physics-informed neural network
0.612022
LWGNet - Learned Wirtinger Gradients for Fourier Ptychographic Phase Retrieval · ECCV (7) 2022
Computational photography and imaging
phase retrieval
0.612022
LWGNet - Learned Wirtinger Gradients for Fourier Ptychographic Phase Retrieval · ECCV (7) 2022

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

wirtinger gradients · 1.1learned gradients · 1.1
YearPublicationVenuePosition
2025 Programmable Congestion Generator for Evaluating FPGA Interconnect Robustness
abstract
The interconnect (INT) micro-architecture of field programmable gate arrays (FPGAs) is critical for routability and performance of designs. Traditional method to evaluate robustness of INT involves comparing congestion of real or synthetic design implementations on competing INT architectures. This method conflates routing challenges with placement quality, floorplan constraints, and device utilization. To address this limitation, we propose a methodology, programmable congestion generator (PCG), that generates netlists with placement constraints to achieve targeted congestion stress, isolating directional or wirelength biases for architectural evaluation. Examples in this paper demonstrate the ability to induce congestion with precision, providing architects a direct means to validate hypotheses about routing resources. This work bridges the gap between existing benchmark-generation techniques and the practical requirements of INT design, offering a systematic framework to stress-test architectural innovations under quantifiable routing constraints.
Atreyee Saha, Sandesh Goyal, Aashish Tripathi
FPL1
2022 LWGNet - Learned Wirtinger Gradients for Fourier Ptychographic Phase Retrieval
Atreyee Saha, Salman Siddique Khan, Sagar Sehrawat, Sanjana S. Prabhu, Shanti Bhattacharya, Kaushik Mitra
ECCV (7)1
2019 Low Resource Automatic Intonation Classification Using Gated Recurrent Unit (GRU) Networks Pre-Trained with Synthesized Pitch Patterns
abstract
Second language learners of British English (BE) are typically trained to learn four intonation classes - Glide-up, Glide-down, Dive and Take-off. We predict the intonation class in a learner's utterance by modeling the temporal dependencies in the pitch patterns with gated recurrent unit (GRU) networks. For these, we pre-train the GRU network using a set of synthesized pitch patterns representing each intonation class. For the synthesis, we propose to obtain pitch patterns from the tone sequences representing each intonation class obtained from domain knowledge. Experiments are conducted on speech data collected from experts in a spoken English training material for teaching BE intonation. The absolute improvements in the unweighted average recall (UAR) using the proposed scheme with pre-training are found to be 4.14 and 6.01 respectively over the proposed approach without pre-training and the baseline scheme that uses hidden Markov models (HMMs).
Atreyee Saha, Chiranjeevi Yarra, Prasanta Kumar Ghosh
INTERSPEECH1