Bilgisayar Mühendisliği Bölümü Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.11779/1940

Browse

Now showing 1 - 7 of 7

Citation - WoS: 2
Citation - Scopus: 1
A Benchmark Dataset for Turkish Data-To Generation
(Elsevier, 2022) Demir, Şeniz; Öktem, Seza
In the last decades, data-to-text (D2T) systems that directly learn from data have gained a lot of attention in natural language generation. These systems need data with high quality and large volume, but unfortunately some natural languages suffer from the lack of readily available generation datasets. This article describes our efforts to create a new Turkish dataset (Tr-D2T) that consists of meaning representation and reference sentence pairs without fine-grained word alignments. We utilize Turkish web resources and existing datasets in other languages for producing meaning representations and collect reference sentences by crowdsourcing native speakers. We particularly focus on the generation of single-sentence biographies and dining venue descriptions. In order to motivate future Turkish D2T studies, we present detailed benchmarking results of different sequence-to-sequence neural models trained on this dataset. To the best of our knowledge, this work is the first of its kind that provides preliminary findings and lessons learned from the creation of a new Turkish D2T dataset. Moreover, our work is the first extensive study that presents generation performances of transformer and recurrent neural network models from meaning representations in this morphologically-rich language.
A New Benchmark Dataset for P300 Erp-Based Bci Applications
(Academic Press Inc Elsevier Science, 2023) Çakar, Tuna; Özkan, Hüseyin; Musellim, Serkan; Arslan, Suayb S.; Yağan, Mehmet; Çakar, Tuna; Alp, Nihan
Because of its non-invasive nature, one of the most commonly used event-related potentials in brain -computer interface (BCI) system designs is the P300 electroencephalogram (EEG) signal. The fact that the P300 response can easily be stimulated and measured is particularly important for participants with severe motor disabilities. In order to train and test P300-based BCI speller systems in more realistic high-speed settings, there is a pressing need for a large and challenging benchmark dataset. Various datasets already exist in the literature but most of them are not publicly available, and they either have a limited number of participants or utilize relatively long stimulus duration (SD) and inter-stimulus intervals (ISI). They are also typically based on a 36 target (6 x 6) character matrix. The use of long ISI, in particular, not only reduces the speed and the information transfer rates (ITRs) but also oversimplifies the P300 detection. This leaves a limited challenge to state-of-the-art machine learning and signal processing algorithms. In fact, near-perfect P300 classification accuracies are reported with the existing datasets. Therefore, one certainly needs a large-scale dataset with challenging settings to fully exploit the recent advancements in algorithm design (machine learning and signal processing) and achieve high-performance speller results. To this end, in this article we introduce a new freely-and publicly-accessible P300 dataset obtained using 32-channel EEG, in the hope that it will lead to new research findings and eventually more efficient BCI designs. The introduced dataset comprises 18 participants performing a 40 -target (5 x 8) cued-spelling task, with reduced SD (66.6 ms) and ISI (33.3 ms) for fast spelling. We have also processed, analyzed, and character-classified the introduced dataset and we presented the accuracy and ITR results as a benchmark. The introduced dataset and the codes of our experiments are publicly accessible at https://data .mendeley.com /datasets /vyczny2r4w.(c) 2023 Elsevier Inc. All rights reserved.
Citation - WoS: 29
Citation - Scopus: 38
An Efficient Framework for Visible-Infrared Cross Modality Person Re-Identification
(Elsevier, 2020) Gökmen, Muhittin; Başaran, Emrah; Kamasak, Mustafa E.
Visible-infrared cross-modality person re-identification (VI-ReId) is an essential task for video surveillance in poorly illuminated or dark environments. Despite many recent studies on person re-identification in the visible domain (ReId), there are few studies dealing specifically with VI-ReId. Besides challenges that are common for both ReId and VI-ReId such as pose/illumination variations, background clutter and occlusion, VI-ReId has additional challenges as color information is not available in infrared images. As a result, the performance of VI-ReId systems is typically lower than that of ReId systems. In this work, we propose a four-stream framework to improve VI-ReId performance. We train a separate deep convolutional neural network in each stream using different representations of input images. We expect that different and complementary features can be learned from each stream. In our framework, grayscale and infrared input images are used to train the ResNet in the first stream. In the second stream, RGB and three-channel infrared images (created by repeating the infrared channel) are used. In the remaining two streams, we use local pattern maps as input images. These maps are generated utilizing local Zernike moments transformation. Local pattern maps are obtained from grayscale and infrared images in the third stream and from RGB and three-channel infrared images in the last stream. We improve the performance of the proposed framework by employing a re-ranking algorithm for post-processing. Our results indicate that the proposed framework outperforms current state-of-the-art with a large margin by improving Rank-1/mAP by 29.79%/30.91% on SYSU-MM01 dataset, and by 9.73%/16.36% on RegDB dataset.
Citation - WoS: 3
Citation - Scopus: 3
Exact Construction of Bs-Assisted Mscr Codes With Link Constraints
(IEEE Communications Letters, 2021) Arslan, Şuayb Şefik
It is clear that 5G network resources would be consumed by heavy data traffic owing to increased mobility, slicing, and layered/distributed storage system architecture. The problem is elevated when multiple node failures are repaired to address service quality requirements. Typical approaches include individual or cooperative data regeneration to efficiently utilize the available bandwidth. It is observed that storage systems of 5G and beyond technologies shall have a multi–layer architecture in which base stations (BS) would be present. Moreover, communication with each layer would be subject to various communication costs and link constraints. Under limited BS assistance and cooperation, the trade-off between storage per node and communication bandwidth has been established. In this trade–off, two operating points, namely minimum storage, and bandwidth regeneration are particularly important. In this study, we first identify the optimal number of BS use at the minimum storage regeneration point. An explicit code construction is provided subsequently for the exact minimum storage regeneration whereby each layer may help the repair process subject to a communication link constraint.
Citation - WoS: 12
Citation - Scopus: 15
Face Recognition With Patch-Based Local Walsh Transform
(Elsevier, 2018) Uzun-Per, Meryem; Gökmen, Muhittin
In this paper, we present a novel dense local image representation method called Local Walsh Transform (LWT)by applying the well-known Walsh Transform (WT) to each pixel of an image. The LWT decomposes an image into multiple components, and produces LWT complex images by using the symmetrical relationship between them. Cascaded LWT (CLWT) is also a dense local image representation obtained by applying the LWT again to real and imaginary parts of LWT complex images. Applying the LWT once more to real and imaginary parts of LWT complex images increases the success rate especially on low resolution images. In order to combine the advantages of sparse and dense local image representations, we present Patch-based LWT (PLWT) and Patch-based CLWT (PCLWT) by applying the LWT and CLWT, respectively, to patches extracted around landmarks of multi-scaled face images. The extracted high dimensional features of the patches are reduced through the application of the Whitened Principal Component Analysis (WPCA). Experimental results show that both thePLWT and PCLWT are robust to illumination and expression changes, occlusion and low resolution. The state-of-the-art performance is achieved on the FERET and SCface databases, and the second best unsupervised category result is achieved on the LFW database.
Citation - WoS: 5
Citation - Scopus: 7
Founsure 1.0: an Erasure Code Library With Efficient Repair and Update Features
(Elsevier, 2021) Arslan, Şuayb Şefik
Founsure is an open-source software library that implements a multi-dimensional graph-based erasure coding entirely based on fast exclusive OR (XOR) logic. Its implementation utilizes compiler optimizations and multi-threading to generate the right assembly code for the given multi-core CPU architecture with vector processing capabilities. Founsure possesses important features that shall find various applications in modern data storage, communication, and networked computer systems, in which the data needs protection against device, hardware, and node failures. As data size reached unprecedented levels, these systems have become hungry for network bandwidth, computational resources, and average consumed power. To address that, the proposed library provides a three-dimensional design space that trades off the computational complexity, coding overhead, and data/node repair bandwidth to meet different requirements of modern distributed data storage and processing systems. Founsure library enables efficient encoding, decoding, repairs/rebuilds, and updates while all the required data storage and computations are distributed across the network nodes.
Citation - WoS: 27
Citation - Scopus: 30
Service-Aware Multi-Resource Allocation in Software-Defined Next Generation Cellular Networks
(2018) Arslan, Şuayb Şefik; Zeydan, Engin; Narmanloğlu, Ömer
Network slicing is one of the major solutions needed to meet the requirements of next generation cellular networks, under one common network infrastructure, in supporting multiple vertical services provided by mobile network operators. Network slicing makes one shared physical network infrastructure appear as multiple logically isolated virtual networks dedicated to different service types where each Network Slice (NS) benefits from on-demand allocated resources. Typically, the available resources distributed among NSs are correlated and one needs to allocate them judiciously in order to guarantee the service, MNO, and overall system qualities. In this paper, we consider a joint resource allocation strategy that weights the significance of the resources per a given NS by leveraging the correlation structure of different quality-of-service (QoS) requirements of the services. After defining the joint resource allocation problem including the correlation structure, we propose three novel scheduling mechanisms that allocate available network resources to the generated NSs based on different type of services with different QoS requirements. Performance of the proposed schedulers are then investigated through Monte-Carlo simulations and compared with each other as well as against a traditional max-min fairness algorithm benchmark. The results reveal that our schedulers, which have different complexities, outperform the benchmark traditional method in terms of service-based and overall satisfaction ratios, while achieving different fairness index levels.

Browse

Browsing Bilgisayar Mühendisliği Bölümü Koleksiyonu by WoS Q "Q2"