H. Fatih Ugurdag

H. Fatih Ugurdag

Auto-generated profile, based on publicly available information

H. Fatih Ugurdag

Department of Electrical and Electronics Engineering, Ozyegin University, Istanbul, Trkiye

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
23 May 2017 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
HUH. Fatih Ugurdag
H. Fatih Ugurdag
FDFlorent de Dinechin
Florent de Dinechin
YGY. Serhan Gener
Y. Serhan Gener
Sezer GorenSezer Goren
Sezer Goren
LDLaurent-Stephane Didier
Laurent-Stephane Didier
This article studies the design of custom circuits for division by a small positive constant. Such circuits can be useful for specific FPGA and ASIC applications. The first problem studied is the Euclidean division of an unsigned integer by a constant, computing a quotient and remainder. Several new solutions are proposed and compared against the state-of-the-art. As the proposed solutions use small look-up tables, they match well with the hardware resources of an FPGA. The article then studies whether the division by the product of two constants is better implemented as two successive dividers or as one atomic divider. It also considers the case when only a quotient or only a remainder is needed. Finally, it addresses the correct rounding of the division of a floating-point number by a small integer constant. All these solutions, and the previous state-of-the-art, are compared in terms of timing, area, and area-timing product. In general, the relevance domains of the various techniques are different on FPGA and on ASIC.

1 February 2013 in Computers and Electrical Engineering
Verified
Journal Article
Closed access
Sezer GorenSezer Goren
Sezer Goren
OOOzgur Ozkurt
Ozgur Ozkurt
AYAbdullah Yildiz
Abdullah Yildiz
HUH. Fatih Ugurdag
H. Fatih Ugurdag
RCRajat S. Chakraborty
Rajat S. Chakraborty
DMDebdeep Mukhopadhyay
Debdeep Mukhopadhyay

5 April 2024 in IEEE Access
Verified
Journal Article
Open access
GGGokce Guven
Gokce Guven
HAHasan Ates
Hasan Ates
HUH. Fatih Ugurdag
H. Fatih Ugurdag
In this work, an innovative approach is proposed for three-dimensional (3D) organ volume reconstruction from a single planar X-ray, namely X2V network. Such capability holds pivotal clinical potential, especially in real-time image-guided radiotherapy, computer-aided surgery, and patient follow-up sessions. Traditional methods for 3D volume reconstruction from X-rays often require the utilization of statistical 3D organ templates, which are employed in 2D/3D registration. However, these methods may not accurately account for the variation in organ shapes across different subjects. Our X2V model overcomes this problem by leveraging neural implicit representation. A vision transformer model is integrated as an encoder network, specifically designed to direct and enhance attention to particular regions within the X-ray image. The reconstructed meshes exhibit a similar topology to the ground truth organ volume, demonstrating the ability of X2V in accurately capturing the 3D structure from a 2D image. The effectiveness of X2V is evaluated on lung X-rays using several metrics, including volumetric Intersection over Union (IoU). X2V outperforms the state-of-the-art method in the literature for lungs (DeepOrganNet) by about 7-9% achieving IoU’s between 0.892-0.942 versus DeepOrganNet’s IoU of 0.815-0.888.

27 December 2021 in IEEE Access
Verified
Journal Article
Open access
HMHakki Motorcu
Hakki Motorcu
HAHasan Ates
Hasan Ates
HUH. Fatih Ugurdag
H. Fatih Ugurdag
BGBahadir K. Gunturk
Bahadir K. Gunturk
Wide Area Motion Imagery (WAMI) yields high resolution images with a large number of extremely small objects. Target objects have large spatial displacements throughout consecutive frames. This nature of WAMI images makes object tracking and detection challenging. In this paper, we present our deep neural network-based combined object detection and tracking model, namely, Heat Map Network (HM-Net). HM-Net is significantly faster than state-of-the-art frame differencing and background subtraction-based methods, without compromising detection and tracking performances. HM-Net follows object center-based joint detection and tracking paradigm. Simple heat map-based predictions support unlimited number of simultaneous detections. The proposed method uses two consecutive frames and the object detection heat map obtained from the previous frame as input, which helps HM-Net monitor spatio-temporal changes between frames and keep track of previously predicted objects. Although reuse of prior object detection heat map acts as a vital feedback-based memory element, it can lead to unintended surge of false positive detections. To increase robustness of the method against false positives and to eliminate low confidence detections, HM-Net employs novel feedback filters and advanced data augmentations. HM-Net outperforms state-of-the-art WAMI moving object detection and tracking methods on WPAFB dataset with its 96.2% F1 and 94.4% mAP detection scores, while achieving 61.8 % mAP tracking score on the same dataset. This performance corresponds to an improvement of 2.1% for F1, 6.1% for mAP scores on detection, and 9.5% for mAP score on tracking over state-of-the-art.

30 November 2021 in Turkish Journal of Electrical Engineering and Computer Sciences
Verified
Journal Article
Closed access
PEPakize Ergül
Pakize Ergül
HUH. Fatih Uğurdağ
H. Fatih Uğurdağ
DDDoğancan DAVUTOĞLU
Doğancan DAVUTOĞLU

21 June 2012 in Electronics Letters
Verified
Journal Article
Closed access
HUH.F. Ugurdag
H.F. Ugurdag
FTF. Temizkan
F. Temizkan
OBO. Baskirt
O. Baskirt
BYB. Yuce
B. Yuce
A regular (one-pick) round-robin arbiter circuit picks one active requester (if any) out of n requesters. A two-pick round-robin arbiter selects up to two requesters. An n2n two-pick round-robin arbiter indicates the picked requests with (at most) two-hot n-bit output. A round-robin arbiter is fair to its requesters and does this by repeatedly moving its highest priority pointer to the position immediately next to the second requester picked. Presented is the circuit architecture and VLSI implementation of a new scalable two-pick round-robin arbiter with low latency, which is compared with previous work based on logic synthesis results.