Getu Tadesse Fellek

Getu Tadesse Fellek

Auto-generated profile, based on publicly available information

Getu Tadesse Fellek

McWilliams School of Biomedical Informatics, UTHealth Houston, Houston, TX, USA

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
16 March 2024
Verified
Conference Paper
Open access
GGGoytom Desta Gebreyesus
Goytom Desta Gebreyesus
GFGetu Tadesse Fellek
Getu Tadesse Fellek
AFAhmed Farid
Ahmed Farid
YQYi Qiang
Yi Qiang
SFShigeru Fujimura
Shigeru Fujimura
OYOSAMU YOSHIE
OSAMU YOSHIE
The job shop scheduling problem (JSSP), a renowned NP-hard combinatorial optimization problem (COP), involves sequencing finite machines for a set of jobs while adhering to defined constraints. Recent advances have seen the rise of reinforcement learning for improving JSSP solutions. This study presents an innovative end-to-end Deep Reinforcement Learning (DRL) framework for tackling the JSSP. Our DRL framework leverages convolution-augmented attention with a gate mechanism to embed the JSSP environment represented as a disjunctive graph. The proposed framework integrates convolution-augmented features for local pattern capture with multi-head self-attention (MHSA) to model global dependencies within the JSSP environment, thereby facilitating the acquisition of comprehensive graph representations. A Gate mechanism modulates feature flow between the convolution and MHSA layers, further enriching the representations. A simple multi-layer perceptron (MLP)-based action selection network generates optimal schedules sequentially. The proposed framework is trained using a proximal policy optimization (PPO) algorithm in an actor-critic framework. Experiments demonstrate the superiority of our proposed framework over existing heuristics and state-of-the-art DRL baselines, underscoring the potential of deep reinforcement learning in complex scheduling problems.

15 January 2026 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
Dejene Mengistu SimeDejene Mengistu Sime
Dejene Mengistu Sime
NONan Ouyang
Nan Ouyang
KSKai Sheng
Kai Sheng
GFGetu T. Fellek
Getu T. Fellek
WWWenkang Wan
Wenkang Wan
SBShehui Bu
Shehui Bu
Weakly supervised learning has emerged as a powerful paradigm for image segmentation, providing a practical solution to reduce the dependence on costly, pixel-level annotated datasets. By leveraging partial annotations, such as image-level tags, this approach significantly reduces the labeling burden while maintaining competitive performance. However, weakly supervised methods inherently face challenges, including overlapping activation regions and insufficient localization due to sparse and noisy signals from image-level tags, often leading to suboptimal segmentation performance. These issues are further exacerbated in industrial defect localization, where datasets present unique complexities, including low-contrast object boundaries, inconsistent shapes, interclass similarities, and substantial intraclass variations. To address these limitations, we introduce a novel saliency-guided transformer attention with contrastive learning framework. The proposed framework leverages Transformer attention to generate localization maps and enhances the learning of challenging foreground and background information through saliency-guided cues. In addition, a pixel-level contrastive learning module is employed to refine feature map representations by bringing positive pairs closer together and pushing negative pairs apart, effectively addressing challenges, such as overlapping activations and ambiguous boundaries. Through extensive experiments and ablation studies, the proposed method demonstrates superior performance compared to state-of-the-art approaches across three defect segmentation datasets. We also evaluated the generalization of our approach on the PASCAL VOC segmentation and MVTec anomaly detection datasets.