Results 11 to 20 of about 650,464 (329)

Hough Transform-Based Angular Features for Learning-Free Handwritten Keyword Spotting

open access: yesSensors, 2021
Handwritten keyword spotting (KWS) is of great interest to the document image research community. In this work, we propose a learning-free keyword spotting method following query by example (QBE) setting for handwritten documents. It consists of four key
Subhranil Kundu   +5 more
doaj   +1 more source

Content-Based Medical Image Retrieval and Intelligent Interactive Visual Browser for Medical Education, Research and Care

open access: yesDiagnostics, 2021
Medical imaging is essential nowadays throughout medical education, research, and care. Accordingly, international efforts have been made to set large-scale image repositories for these purposes.
Camilo G. Sotomayor   +8 more
doaj   +1 more source

Learning Acoustic Word Embeddings With Dynamic Time Warping Triplet Networks

open access: yesIEEE Access, 2020
In the last years, acoustic word embeddings (AWEs) have gained significant interest in the research community. It applies specifically to the application of acoustic embeddings in the Query-by-Example Spoken Term Detection (QbE-STD) search and related ...
Denis Shitov   +3 more
doaj   +1 more source

The Multi-Domain International Search on Speech 2020 ALBAYZIN Evaluation: Overview, Systems, Results, Discussion and Post-Evaluation Analyses

open access: yesApplied Sciences, 2021
The large amount of information stored in audio and video repositories makes search on speech (SoS) a challenging area that is continuously receiving much interest.
Javier Tejedor   +4 more
doaj   +1 more source

Query by Example in Remote Sensing Image Archive Using Enhanced Deep Support Vector Data Description

open access: yesIEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2023
This article studies remote sensing image retrieval using kernel-based support vector data description (SVDD). We exploit deep SVDD, which is a well-known method for one-class classification to recover the most relevant samples from the archive.
Omid Ghozatlou   +2 more
doaj   +1 more source

Research on data query and application of obstacle dataset based on spatio-temporal data model

open access: yesHangkong gongcheng jinzhan, 2023
The obstacle dataset is a kind of aeronautical information dataset based on the aeronautical information exchange model (AIXM) specification proposed by International Civil Aviation Organization (ICAO) under the aviation intelligence management(AIM ...
LAI Xin, LIANG Changsheng, ZHU Meiling
doaj   +1 more source

Analisis Seleksi Citra Mirip dengan Memanfaatkan Konsep CBIR dan Algoritma Threshold

open access: yesComTech, 2011
Content base image retrieval (CBIR) is the concept of image retrieval by comparing the existing image on the sample to that of the database (query by example).
Abdul Haris Rangkuti
doaj   +1 more source

A study of query by semantic example [PDF]

open access: yes2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, 2008
In recent years, query-by-semantic-example (QBSE) has become a popular approach to do content based image retrieval. QBSE extends the well established query-by-example retrieval paradigm to the semantic domain. While various authors have pointed out the benefits of QBSE, there are still various open questions with respect to this paradigm.
Nikhil Rasiwasia, Nuno Vasconcelos
openaire   +1 more source

Fuzzy query by example

open access: yesProceedings of the 33rd Annual ACM Symposium on Applied Computing, 2018
This paper describes Fuzzy Query By Example, an approach helping users retrieve data without any prior knowledge of the database schema or any formal querying language. The user is solicited to evaluate, in a binary way, pre-selected items of the database.
Moreau, Aurélien   +2 more
openaire   +2 more sources

Separations in Query Complexity Based on Pointer Functions [PDF]

open access: yes, 2015
In 1986, Saks and Wigderson conjectured that the largest separation between deterministic and zero-error randomized query complexity for a total boolean function is given by the function $f$ on $n=2^k$ bits defined by a complete binary tree of NAND gates
Ambainis, Andris   +5 more
core   +3 more sources

Home - About - Disclaimer - Privacy