18 Hits in 6.4 sec

Asymmetric hamming embedding

Mihir Jain, Hervé Jégou, Patrick Gros
2011 Proceedings of the 19th ACM international conference on Multimedia - MM '11  
The comparison of two descriptors relies on an vectorto-binary code comparison, which limits the quantization error associated with the query compared with the original Hamming Embedding method.  ...  This paper proposes an asymmetric Hamming Embedding scheme for large scale image search based on local descriptors.  ...  CONCLUSION This paper shows that a vector-to-binary code comparison significantly improves the state-of-the-art Hamming Embedding technique by reducing the approximation made on the query.  ... 
doi:10.1145/2072298.2072035 dblp:conf/mm/JainJG11 fatcat:rdn3hjids5e4thebeddxcus2yq

Audio Cover Song Identification and Similarity: Background, Approaches, Evaluation, and Beyond [chapter]

Joan Serrà, Emilia Gómez, Perfecto Herrera
2010 Studies in Computational Intelligence  
In [55] , vector quantization is performed by computing binary PCP feature vector components in such a way that, with 12 dimensional feature vectors, a codebook of 2 12 = 4096 symbols is generated (so-called  ...  polyphonic binary feature vectors).  ... 
doi:10.1007/978-3-642-11674-2_14 fatcat:ou4l5a3rc5ehto74hbmcicxxni

Introduction to information retrieval

2009 ChoiceReviews  
It represents each document as a vector with one real-valued component (e.g., a tf-idf weight) for each term.  ...  The tf-idf weighting scheme assigns to term t a weight in document d given by tf-idf t,d = tf t,d × idf t . (6.2) In other words, tf-idf t,d assigns to term t a weight in document d that is 1. highest  ...  First, we use fingerprints to remove all but one copy of identical documents.  ... 
doi:10.5860/choice.46-2715 fatcat:ruwoe46pgzcupjygnwbnit4z3u

Automatic Summarization

Martha Larson
2012 Foundations and Trends in Information Retrieval  
Spoken content retrieval (SCR) requires the combination of audio and speech processing technologies with methods from information retrieval (IR).  ...  It is aimed at researchers with backgrounds in speech technology or IR who are seeking deeper insight on how these fields are integrated to support research and development, thus addressing the core challenges  ...  The tf-idf model used here is a simple linear tf function.  ... 
doi:10.1561/1500000020 fatcat:o424mjxnp5abbexhjsobtom2ry

Report on WEMIS 2009

Nicola Orio, Andreas Rauber, David Rizo
2009 D-Lib Magazine  
We present the results of an online experiment where alternative approaches for matching POIs and music, based on tagging and text matching, have been tested with users. ACKNOWLEDGEMENTS  ...  ACKNOWLEDGEMENTS We would like to thank all the participants in our research for providing us with briefs and being so free with their valuable time.  ...  In such cases LDA algorithm performs better than TF-IDF.  ... 
doi:10.1045/november2009-orio fatcat:zel4p7ushfhc7edqcafbryjlvu

Introduction [chapter]

2016 Music Data Analysis  
of TF-IDF vectors for three Christmas-related pop songs.  ...  We can calculate the Inverse Document Frequency as IDF(i) = log N n(i) (8.2) and the final TF-IDF score as TF-IDF(i,j)= T F(i, j) · IDF(i).  ...  Another commonly applied statistic is TF-IDF, Equations (8.1) and (8.2).  ... 
doi:10.1201/9781315370996-5 fatcat:avooqogcpnbjngqmzuonil3exq

On nonmetric similarity search problems in complex domains

Tomáš Skopal, Benjamin Bustos
2011 ACM Computing Surveys  
However, together with the increasing complexity of data entities across various domains, in recent years there appeared many similarities that were not metrics -we call them nonmetric similarity functions  ...  Second, we review the state-of-the-art techniques for efficient (fast) nonmetric similarity search, concerning both exact and approximate search.  ...  There was a number of techniques proposed for creating the weights, the tf-idf scheme is probably the most popular.  ... 
doi:10.1145/1978802.1978813 fatcat:36ld4nxcm5c6bnu7dtvvhavh4a

Content-based video copy detection

Juan Manuel Barrios
2009 Proceedings of the seventeen ACM international conference on Multimedia - MM '09  
In particular, we propose techniques for the automatic creation of spatio-temporal descriptors using frame-based global descriptors, an acoustic descriptor that can be combined with global descriptors,  ...  We are very pleased with the performance achieved in both evaluations.  ...  However, the quantization error produced by assigning multidimensional vectors to a fixed set of n values may harm the search effectiveness.  ... 
doi:10.1145/1631272.1631539 dblp:conf/mm/Barrios09 fatcat:kpjhi2p3orcsrfi444ewana33i

Hierarchical Fuzzy Feature Similarity Combination for Presentation Slide Retrieval

A. Kushki, M. Ajmal, K. N. Plataniotis
2009 EURASIP Journal on Advances in Signal Processing  
Various fusion operators and their properties are examined with respect to their effect on retrieval performance.  ...  This paper proposes a novel XML-based system for retrieval of presentation slides to address the growing data mining needs in presentation archives for educational and scholarly settings.  ...  In text-based approaches, the vector space model [11, 12] is utilized to compute such a relevance score.  ... 
doi:10.1155/2008/547923 fatcat:isvtxjpwofhmbgcc5qggcoawru

Music Retrieval: A Tutorial and Review

Nicola Orio
2006 Foundations and Trends in Information Retrieval  
To fulfil these needs a number of approaches are discussed, from direct search to information filtering and clustering of music documents.  ...  A number of issues, which are peculiar to the music language, are described-including forms, formats, and dimensions of music-together with the typologies of users and their information needs.  ...  Indexing and retrieval are then usually carried out using well-known techniques developed for textual IR, such as the Vector Space Model using the tf · idf weighting scheme.  ... 
doi:10.1561/1500000002 fatcat:l34nymgv7rbmfbvb3pt2kwtyoe

Cross-Covariance Models [chapter]

2017 Encyclopedia of GIS  
Efficient tools for extracting information from geo-spatial data are crucial to organizations which make decisions based on large spatial datasets, including the National Aeronautics and Space Administration  ...  factorization, etc.), dimensionality reduction (Lanczos, stochastic, principle component analysis), natural language processing (latent Dirichlet allocation, TF-IDF vectors), and clustering (k-means algorithm  ...  Unlike multipath-based ranging error, UDP-based ranging error typically cannot be reduced by increasing the bandwidth.  ... 
doi:10.1007/978-3-319-17885-1_100240 fatcat:2ojzb7es7rhofinw4abol6dgc4

Efficient in-hardware compression of on-chip data

Amin Ghasemazar
Similar trends exist in special-purpose computing systems, with only up to tens of megabytes of on-chip memory available in most recent AI accelerators.  ...  Leveraging the observed similarity among activation channels, Channeleon first forms clusters of similar activation channels, and then quantizes activations within each cluster.  ...  To reduce the resulting LSH fingerprints from many bytes to a small number of bits, we combine this with another refinement: the idea that each component of the LSH fingerprint vector can be replaced with  ... 
doi:10.14288/1.0404515 fatcat:nxtj5xz4yffm7inyjyp7k6caem

Unleashing the power of semantic text analysis: a complex systems approach

Andrea Martini
For each of them we consider the rankings based on TF, IDF, TF-IDF and S d respectively. Next, we order concepts from the most generic to the least one according to the four rankings.  ...  We rank concepts using: residual entropy S d , inverse document frequency IDF, term-frequency TF and TF-IDF. Concepts indicated as common by SW are marked with an asterisk.  ... 
doi:10.5075/epfl-thesis-8473 fatcat:lw4fclsi4rfhhiwuawytxwx6sy

Visual recognition systems in a car passenger compartment with the focus on facial driver identification [article]

Andrey Makrushin, Universitäts- Und Landesbibliothek Sachsen-Anhalt, Martin-Luther Universität, Jana Dittmann
It is interesting to note that the same machine learning approach applied to classification of documents using tf * idf vectors is referred to as the Rocchio classifier [163] .  ...  Since x is a binary vector, the computation of the sum can be interpreted as the search in the lookup table for features that are presented in the vector x.  ... 
doi:10.25673/4084 fatcat:3sbc4yg7tfgirgismiytdlqrri

Multiple Classifier Systems in Adversarial Environments: "Challenges and Solutions"

Francesco Gargiulo
Similar problems arise in web search (web spam) and malware analysis (obfuscation and polymorphism).  ...  This consideration arise with the problem to define a general framework to prevents this kind of evasions. In this thesis we propose some techniques to approach with the "adversarial" environments.  ...  quantization neural networks (LVQ)); • rule-forming (binary decision trees, rule-based systems).  ... 
doi:10.6092/unina/fedoa/3894 fatcat:iodckromnremdjfdzpmvyi5swq
« Previous Showing results 1 — 15 out of 18 results