no code implementations • 15 Feb 2024 • Sedat Ozer, Alain P. Ndigande
We propose two variants of our approach, where in the first variant (ModelA), we directly predict the new coordinates of only the four corners of the image to be aligned; and in the second one (ModelB), we predict the homography matrix directly.
no code implementations • 23 Nov 2023 • Yigit Gurses, Melisa Taspinar, Mahmut Yurt, Sedat Ozer
On the other hand, our proposed solution, GRJointNet, is an architecture that can perform joint completion and segmentation on point clouds as a successor of GRNet.
2 code implementations • 14 May 2023 • Weiping Hua, Karen Bemis, Dujuan Kang, Sedat Ozer, Deborah Silver
In this paper, we introduce a hybrid eddy detection approach that combines sea surface height (SSH) and velocity fields with geometric criteria defining eddy behavior.
no code implementations • 3 Feb 2023 • Sedat Ozer, Enes Ilhan, Mehmet Akif Ozkanoglu, Hakan Ali Cirpan
However, deep learning based algorithms are susceptible to noise, and a wireless communication system, by its nature, introduces noise to the original signal.
1 code implementation • 23 Dec 2020 • Berat Mert Albaba, Sedat Ozer
Recent advances in camera equipped drone applications and their widespread use increased the demand on vision based object detection algorithms for aerial images.
no code implementations • 2 Jun 2020 • Yasin Yildirim, Sedat Ozer, Hakan Ali Cirpan
In this paper, a deep learning based receiver is proposed for a collection of multi-carrier wave-forms including both current and next-generation wireless communication systems.
no code implementations • 1 Jun 2019 • Sedat Ozer
In this paper, we demonstrate how using SDN can first help us model a pixel-based image in terms of SDs and then demonstrate how those learned SDs can be used to extract the skeleton of a shape.
no code implementations • 8 Apr 2019 • Rodolfo Valiente, Mahdi Zaman, Sedat Ozer, Yaser P. Fallah
A fundamental challenge in autonomous vehicles is adjusting the steering angle at different road conditions.
no code implementations • ICML 2017 • Dan Feldman, Sedat Ozer, Daniela Rus
We provide a deterministic data summarization algorithm that approximates the mean $\bar{p}=\frac{1}{n}\sum_{p\in P} p$ of a set $P$ of $n$ vectors in $\REAL^d$, by a weighted mean $\tilde{p}$ of a \emph{subset} of $O(1/\eps)$ vectors, i. e., independent of both $n$ and $d$.