Browsing by Subject "Nearest neighbor search"

Now showing 1 - 4 of 4

Open Access
Activity recognition invariant to sensor orientation with wearable motion sensors
(MDPI AG, 2017) Yurtman, A.; Barshan, B.
Most activity recognition studies that employ wearable sensors assume that the sensors are attached at pre-determined positions and orientations that do not change over time. Since this is not the case in practice, it is of interest to develop wearable systems that operate invariantly to sensor position and orientation. We focus on invariance to sensor orientation and develop two alternative transformations to remove the effect of absolute sensor orientation from the raw sensor data. We test the proposed methodology in activity recognition with four state-of-the-art classifiers using five publicly available datasets containing various types of human activities acquired by different sensor configurations. While the ordinary activity recognition system cannot handle incorrectly oriented sensors, the proposed transformations allow the sensors to be worn at any orientation at a given position on the body, and achieve nearly the same activity recognition performance as the ordinary system for which the sensor units are not rotatable. The proposed techniques can be applied to existing wearable systems without much effort, by simply transforming the time-domain sensor data at the pre-processing stage. © 2017 by the authors. Licensee MDPI, Basel, Switzerland.
Open Access
Auto-tuning similarity search algorithms on multi-core architectures
(2013) Gedik, B.
In recent times, large high-dimensional datasets have become ubiquitous. Video and image repositories, financial, and sensor data are just a few examples of such datasets in practice. Many applications that use such datasets require the retrieval of data items similar to a given query item, or the nearest neighbors (NN or k -NN) of a given item. Another common query is the retrieval of multiple sets of nearest neighbors, i.e., multi k -NN, for different query items on the same data. With commodity multi-core CPUs becoming more and more widespread at lower costs, developing parallel algorithms for these search problems has become increasingly important. While the core nearest neighbor search problem is relatively easy to parallelize, it is challenging to tune it for optimality. This is due to the fact that the various performance-specific algorithmic parameters, or "tuning knobs", are inter-related and also depend on the data and query workloads. In this paper, we present (1) a detailed study of the various tuning knobs and their contributions on increasing the query throughput for parallelized versions of the two most common classes of high-dimensional multi-NN search algorithms: linear scan and tree traversal, and (2) an offline auto-tuner for setting these knobs by iteratively measuring actual query execution times for a given workload and dataset. We show experimentally that our auto-tuner reaches near-optimal performance and significantly outperforms un-tuned versions of parallel multi-NN algorithms for real video repository data on a variety of multi-core platforms. © 2013 Springer Science+Business Media New York.
Open Access
İki durumlu bir beyin bilgisayar arayüzünde özellik çıkarımı ve sınıflandırma
(IEEE, 2017-10) Altındiş, Fatih; Yılmaz, B.
Beyin bilgisayar arayüzü (BBA) teknolojisi motor nöronlarının özelliğini kaybeden ve hareket kabiliyeti kısıtlanmış ALS ve felçli hastalar gibi birçok kişinin dış dünya ile iletişimini sağlamaya yönelik kullanılmaktadır. Bu çalışmada, Avusturya’daki Graz Üniversitesi’nde alınmış EEG veri seti kullanılarak gerçek zamanlı EEG işleme simülasyonu ile motor hayal etme sınıflandırılması amaçlanmıştır. Bu veri setinde sağ el ya da sol elin hareket ettirilme hayali esnasında 8 kişiden alınmış iki kanallı EEG sinyalleri bulunmaktadır. Her katılımcıdan 60 sağ ve 60 sol olmak üzere toplamda 120 adet yaklaşık 9 saniyelik motor hayal etme deneme sinyali kayıt edilmiştir. Bu sinyaller filtrelemeye tabi tutulmuştur. Yirmi dört, 32 ve 40 elemanlı özellik vektörü bant geçiren filtreler kullanarak elde edilen göreceli güç değişim değerleridir (GGDD). Bu çalışmada, lineer diskriminant analizi (LDA), k en yakın komşular (KNN) ve destek vektör makinaları (SVM) ile sınıflandırma yapılmış, en iyi sınıflandırma performansının 24 değerli özellik vektörüyle ve LDA sınıflandırma yöntemiyle elde edildiği gösterilmiştir.
Open Access
MUCKE participation at retrieving diverse social images task of MediaEval 2013
(CEUR-WS, 2013) Armağan, Anıl; Popescu, A.; Duygulu, Pınar
The Mediaeval 2013 Retrieving Diverse Social Image Task addresses the challenge of improving both relevance and diversity of photos in a retrieval task on Flickr. We propose a clustering based technique that exploits both textual and visual information. We introduce a k-Nearest Neighbor (k-NN) inspired re-ranking algorithm that is applied before clustering to clean the dataset. After the clustering step, we exploit social cues to rank clusters by social relevance. From those ranked clusters images are retrieved according to their distance to cluster centroids.