منابع مشابه
Logo Recognition Using Bundle Min-hashing
• The objective is to identify brand logos from given set of images. The dataset consists of various images of objects bearing the logos. We first look for logo in the image and then try to classify it to a particular brand name. • The technique is invariant to scale and builds an index using min-Hashing on the feature bundles. The feature bundles are formed using the spatial location and the v...
متن کاملVariant tolerant read mapping using min-hashing
DNA read mapping is a ubiquitous task in bioinformatics, and many tools have been developed to solve the read mapping problem. However, there are two trends that are changing the landscape of readmapping: First, new sequencing technologies provide very long reads with high error rates (up to 15%). Second, many genetic variants in the population are known, so the reference genome is not consider...
متن کاملSampled Weighted Min-Hashing for Large-Scale Topic Mining
We present Sampled Weighted Min-Hashing (SWMH), a randomized approach to automatically mine topics from large-scale corpora. SWMH generates multiple random partitions of the corpus vocabulary based on term cooccurrence and agglomerates highly overlapping inter-partition cells to produce the mined topics. While other approaches define a topic as a probabilistic distribution over a vocabulary, SW...
متن کاملAnalysis of Min-Hashing for Variant Tolerant DNA Read Mapping
DNA read mapping has become a ubiquitous task in bioinformatics. New technologies provide ever longer DNA reads (several thousand basepairs), although at comparatively high error rates (up to 15%), and the reference genome is increasingly not considered as a simple string over ACGT anymore, but as a complex object containing known genetic variants in the population. Conventional indexes based o...
متن کاملQuicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence
Randomized algorithms and data structures are often analyzed under the assumption of access to a perfect source of randomness. The most fundamental metric used to measure how “random” a hash function or a random number generator is, is its independence: a sequence of random variables is said to be k-independent if every variable is uniform and every size k subset is independent. In this paper w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Multimedia Information Retrieval
سال: 2013
ISSN: 2192-6611,2192-662X
DOI: 10.1007/s13735-013-0040-x