Audio Fingerprint Hashing for Fast Database Lookup

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional fingerprint matching techniques are time-consuming and prone to incorrect matches due to the fuzzy nature of fingerprints, requiring a multitude of searches and often producing false positives.

Innovation Solution

Generating a hash value from a fingerprint using a hash function, which serves as an identifier for the fingerprint, allowing for efficient lookup in a database without interpreting the fingerprint itself, thereby streamlining the matching process.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If conventional fingerprint matching techniques are used to search through a multitude of fingerprints, then a match can be found, but the process is time-consuming

Engineering Contradiction:
Improvematch accuracyVSAvoidsearch time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The fingerprint matching process is segmented into two stages: first, hash value comparison for rapid filtering, and second, detailed fingerprint comparison for verification. This segmentation allows the system to quickly eliminate non-matching fingerprints through hash value comparison before performing time-consuming detailed comparisons, thereby reducing overall search time while maintaining match accuracy.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system transforms the fingerprint data into a different parameter representation (hash value) that enables faster comparison. By converting fingerprints into hash values with specific properties (fixed length, distributed uniformly), the system can perform rapid lookups in database structures like hash tables or Bloom filters, significantly reducing search time compared to direct fingerprint comparison.

Inventive Principle:
Principle #35Parameter changes

2Productivity

If conventional fingerprint matching techniques are used, then fingerprints can be matched, but incorrect matches occur due to the fuzzy nature of fingerprints

Engineering Contradiction:
Improvematching speedVSAvoidmatch accuracy
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

A hash value acts as an intermediary between the query fingerprint and the database fingerprints. The hash value provides a deterministic, non-fuzzy representation that enables accurate filtering. By using this intermediary, the system avoids direct comparison of fuzzy fingerprint data until necessary, thereby reducing incorrect matches while maintaining efficient processing.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The system performs preliminary hashing of fingerprints before detailed matching. This preliminary action creates a stable, non-fuzzy representation that can be used for accurate filtering. By establishing this preliminary hash value comparison step, the system eliminates incorrect matches that would otherwise occur during fuzzy fingerprint comparison, while still enabling rapid processing.

Inventive Principle:
Principle #10Preliminary action

3Quantity of substance

If a multitude of fingerprints are searched using conventional techniques, then a match can be identified, but the process requires extensive computational resources

Engineering Contradiction:
Improvenumber of fingerprints searchedVSAvoidcomputational energy
Core Design Contradiction:
Quantity of substanceVSUse of energy by moving object

Solution Approach 1:

The search process is segmented into a fast filtering phase using hash value comparison and a slower verification phase using detailed fingerprint comparison. This segmentation ensures that computational energy is expended only on promising candidates identified in the first phase, rather than performing exhaustive comparisons across all fingerprints in the database.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Instead of storing and comparing entire fingerprint data structures, the system uses compact hash value representations as copies or proxies for the full fingerprints. These hash copies enable rapid comparison with minimal computational energy, while the full fingerprint data is only retrieved and compared when the hash values indicate a potential match.

Inventive Principle:
Principle #26Copying

Data Source

PatentUS8321394B2Matching a fingerprint
Publication Date: 2012.11.27 ROVI TECHNOLOGIES CORP
  • US8321394B2 patent drawing
  • US8321394B2 patent drawing
  • US8321394B2 patent drawing

AI summary

A method and a system are provided for matching a fingerprint, for example, an audio fingerprint. In one example, the system receives, from a user device, a chapter and a query about the chapter. The chapter includes computer readable data generated from a waveform of an audio signal. The query is a request to receive data related to the chapter. The system generates, at a computer, a fingerprint of the chapter. The fingerprint includes at least a digital measure of certain properties of the waveform of the audio signal. The system generates, at a computer, a hash value of the fingerprint by applying a hash function to at least a portion of the fingerprint of the chapter. The hash value serves as an identifier for the fingerprint. The system looks up, in a database system, a matching hash value for the hash value of the fingerprint.