Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: wyszukiwanie najbliższego sąsiada

Sortuj według:

Ogranicz wyniki do:

An improved facial image retrieval using hybrid cheetah optimization algorithm

Balasubramanian C., Raja Sekar J.

Bulletin of the Polish Academy of Sciences. Technical Sciences

2024

Vol. 72, nr 2

art. no. e148942

With the advent of social media, the volume of photographs uploaded on the internet has increased exponentially. The task of efficiently recognizing and retrieving human facial images is inevitable and essential at this time. In this work, a feature selection approach for recognizing and retrieving human face images using hybrid cheetah optimization algorithm is proposed. The deep feature extraction from the images is done using deep convolutional neural networks. Hybrid cheetah optimization algorithm, an improvised version of cheetah optimization algorithm fused with genetic algorithm is used, to choose optimum features from the extracted deep features. The chosen features are used for finding the best-matching images from the image database. The image matching is performed by approximate nearest neighbor search for the query image over the image database and similar images are retrieved. By constructing a k-NN graph for the images, the efficiency of image retrieval is enhanced. The proposed system performance is evaluated against benchmark datasets such as LFW, MultiePie, ColorFERET, DigiFace-1M and CelebA. The evaluation results show that the proposed methodology is superior to various existing methodologies.

Efficient astronomical data condensation using approximate nearest neighbors

Łukasik Szymon, Lalik Konrad, Sarna Piotr, Kowalski Piotr A., Charytanowicz Małgorzata, Kulczycki Piotr

International Journal of Applied Mathematics and Computer Science

2019

Vol. 29, no. 3

467--476

Extracting useful information from astronomical observations represents one of the most challenging tasks of data exploration. This is largely due to the volume of the data acquired using advanced observational tools. While other challenges typical for the class of big data problems (like data variety) are also present, the size of datasets represents the most significant obstacle in visualization and subsequent analysis. This paper studies an efficient data condensation algorithm aimed at providing its compact representation. It is based on fast nearest neighbor calculation using tree structures and parallel processing. In addition to that, the possibility of using approximate identification of neighbors, to even further improve the algorithm time performance, is also evaluated. The properties of the proposed approach, both in terms of performance and condensation quality, are experimentally assessed on astronomical datasets related to the GAIA mission. It is concluded that the introduced technique might serve as a scalable method of alleviating the problem of the dataset size.