Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 12 of 12 for “"Hamming Space"”.

  1. Discretize and Conquer: Scalable Agglomerative Clustering in Hamming Space

    … as the distance between two codes (often the Hamming distance) can be computed quickly using bit-wise operations implemented at the hardware level. Similar to other types of data, the clustering of binary datasets has witnessed considerable research recently. Unfortunately, most of the …

    waterloo Repository record for Discretize and Conquer: Scalable Agglomerative Clustering in Hamming Space (opens in a new tab)

  2. Bounds on the size of codes

    … of codes in three different finite metric spaces, namely the ordered Hamming space, the binary Hamming space, and the Johnson space. The ordered Hamming space is a generalization of the Hamming space that arises in several different problems of coding theory and numerical integration. …

    maryland Repository record for Bounds on the size of codes (opens in a new tab)

  3. WEAK ISOMETRIES OF HAMMING SPACES

    In this thesis we study weak isometries of Hamming spaces. These are permutations of a Hamming space that preserve some but not necessarily all distances. We wish to find conditions under which a weak isometry is in fact an isometry. This type of problem was first posed by Beckman and Quarles for …

    mtu Repository record for WEAK ISOMETRIES OF HAMMING SPACES (opens in a new tab)

  4. Applications of ordered weights in information transmission

    … of linear codes related to a particular metric space that generalizes the Hamming space in that the metric function is defined by a partial order on the set of coordinates of the vector. We begin with developing combinatorial and linear-algebraic aspects of linear ordered codes. In particular, …

    maryland Repository record for Applications of ordered weights in information transmission (opens in a new tab)

  5. Hashing for Multimedia Similarity Modeling and Large-Scale Retrieval

    … temporal changing patterns in certain feature spaces. We propose to use a permutation-based random hashing technique to capture the temporal order dynamics of audio and visual features by hashing them along the temporal axis into a common Hamming space. In this way, the audio-visual correlation …

    ucf Repository record for Hashing for Multimedia Similarity Modeling and Large-Scale Retrieval (opens in a new tab)

  6. Visual Data Association: Tracking, Re-identification and Retrieval

    … optimal classifier can be approximated in a subspace spanned by the selected competitive classifiers. Chapter 4 The second method is to improve the object tracking by exploiting a winner-take-all strategy to select the most suitable trackers. This topic naturally extends the concept of ensemble …

    whiterose Download PDF for Visual Data Association: Tracking, Re-identification and Retrieval (opens in a new tab)

  7. Multimedia copy detection

    … (NN) search algorithm for binary fingerprints (Hamming space). Tested on a very large database of 80 million images, we showed that the proposed algorithm is about 3 times faster than the state-of-the-art while at the same time it is 10 times more accurate.

    ubc Repository record for Multimedia copy detection (opens in a new tab) Download PDF for Multimedia copy detection (opens in a new tab)

  8. Approximate Query Processing with Multiple Similarity Metrics

    … in the thesis is approximate query search in Hamming space, which finds all binary codes whose Hamming distance with the query is no larger than the threshold. The main drawbacks of existing methods are that their bounds are not tight enough, and they cannot solve data skewness. To solve them, …

    unsw Repository record for Approximate Query Processing with Multiple Similarity Metrics (opens in a new tab)

  9. Online hashing for fast similarity search

    … in which the goal is to map the data into the Hamming space where fast search mechanisms exist, while preserving the original neighborhood structure of the data. We first present a novel online hashing algorithm in which the hash mapping is updated in an iterative manner with streaming data. …

    bu Repository record for Online hashing for fast similarity search (opens in a new tab)

  10. Deep Binary Representation Learning for Single/Cross-Modal Data Retrieval

    … search apply. As matching data features in Hamming space is computationally cheaper than in Euclidean space, learning to hash and binary representations are generally appreciated in modern retrieval models. Recent research seeks solutions in deep learning to formulate the hash functions, …

    east-anglia Download PDF for Deep Binary Representation Learning for Single/Cross-Modal Data Retrieval (opens in a new tab)

  11. Learning effective binary representation with deep hashing technique for large-scale multimedia similarity search

    … conducting bitwise operation when computing the Hamming distance. Moreover, less memory space is required to process and store the massive amounts of features for the search engines owing to the nature of compact binary code. These advantages make hashing a competitive option in large-scale …

    lancaster Download PDF for Learning effective binary representation with deep hashing technique for large-scale multimedia similarity search (opens in a new tab)

  12. Proximity problems for high-dimensional data

    … of “low-quality” embeddings for metric spaces. It requires that, for some query point q, there exists an approximate nearest neighbor among the pre-images of the k > 1 approximate nearest neighbors in the target space. Focusing on Euclidean spaces, we employ random projections à la …

    greece Repository record for Proximity problems for high-dimensional data (opens in a new tab)