Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Sounds like you're not looking to spend a lot of time delving into audio processing/engineering, and hence you want something you can quickly understand and just works. If you're willing to go with something more complex see <a href="http://www.codeproject.com/Articles/206507/Duplicates-detector-via-audio-fingerprinting" rel="nofollow">here</a> for a very good reference.</p> <p>That being the case, I'd expect simple loudness and <a href="http://en.wikipedia.org/wiki/Zero_crossing" rel="nofollow">zero crossing</a> measures would be sufficient to identify portions of sound. This is great because you can use <a href="http://en.wikipedia.org/wiki/Rsync#Algorithm" rel="nofollow">techniques similar to rsync</a>.</p> <p>Choose some number of samples as a chunk size and march through your reference audio data at a regular interval. (Let's call it 'chunk size'.) Calculate the zero-crossing measure (you likely want a logarithm (or a fast approximation) of a simple zero-crossing count). Store the chunks in a 2D spatial structure based on time and the zero-crossing measure.</p> <p>Then march through your actual audio data a much finer step at a time. (Probably doesn't need to be as small as one sample.) Note that you don't have to recompute the measures for the entire chunk size -- just subtract out the zero-crossings no longer in the chunk and add in the new ones that are. (You'll still need to compute the logarithm or approximation thereof.)</p> <p>Look for the 'next' chunk with a close enough frequency. Note that since what you're looking for is in order from start to finish, there's no reason to look at -all- chunks. In fact, we don't want to since we're far more likely to get false positives.</p> <p>If the chunk matches well enough, see if it matches all the way out to silence.</p> <p>The only concerning point is the 2D spatial structure, but honestly this can be made much easier if you're willing to forgive a strict window of approximation. Then you can just have overlapping bins. That way all you need to do is check two bins for all the values after a certain time -- essentially two binary searches through a search structure.</p> <p>The disadvantage to all of this is it may require some tweaking to get right and isn't a proven method.</p>
    singulars
    1. This table or related slice is empty.
    1. POFuzzy matching/chunking algorithm
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USKaganar
    1. USKaganar
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COThat first link, http://www.codeproject.com/Articles/206507/Duplicates-detector-via-audio-fingerprinting , is the single best explanatory tutorial article i've ever read.
      singulars
      1. PO
      1. USMax
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload