Title :
Graph theory for the discovery of non-parametric audio objects
Author :
Srinivasa, Christopher ; Bouchard, Martin ; Pichevar, Ramin ; Najaf-Zadeh, Hossein
Author_Institution :
Sch. of EECS, Univ. of Ottawa, Ottawa, ON, Canada
Abstract :
A novel framework based on graph theory for structure discovery is applied to audio to find new types of audio objects which enable the compression of an input signal. It converts the sparse time-frequency representation of an audio signal into a graph by representing each data point as a vertex and the relationship between two vertices as an edge. Each edge is labelled based on a clustering algorithm which preserves a quality guarantee on the clusters. Frequent subgraphs are then extracted from this graph, via a mining algorithm, and recorded as objects. Tests performed using a corpus of audio excerpts show that the framework discovers new types of audio objects which yield an average compression gain of 23.53% while maintaining high audio quality.
Keywords :
audio coding; data compression; data mining; feature extraction; graph theory; pattern clustering; signal representation; time-frequency analysis; audio signal representation; clustering algorithm; data mining algorithm; data point; frequent subgraph extraction; graph theory; input signal compression; nonparametric audio object discovery; sparse time-frequency representation; structure discovery; Cost function; Encoding; Graph theory; Kernel; Matching pursuit algorithms; Time frequency analysis; Vectors; Graph theory; audio objects; compression; sparse representations;
Conference_Titel :
Information Science, Signal Processing and their Applications (ISSPA), 2012 11th International Conference on
Conference_Location :
Montreal, QC
Print_ISBN :
978-1-4673-0381-1
Electronic_ISBN :
978-1-4673-0380-4
DOI :
10.1109/ISSPA.2012.6310498
