Efficient two stage decoding scheme to achieve content identification capacity

F. Farhadzadeh; K. Sun; S. Fredowsi

doi:10.1109/ICASSP.2014.6854315

Efficient two stage decoding scheme to achieve content identification capacity

F. Farhadzadeh, K. Sun, S. Fredowsi

Signal Processing Systems

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

1 Citation (Scopus)

Abstract

We introduce a scheme to address the trade-off between the identification rate, search and memory complexities in large-scale identification systems. We use a special database organization by assigning database entries to a set of possibly overlapping clusters. The clusters are generated based on statistics of both database entries and queries. The decoding procedure is accomplished in two stages. First, a list of clusters related to the query is detected. Then, refinement checks are performed on members of the detected clusters to produce a unique index. We investigate the minimum achievable search complexity for binary symmetric sources.

Original language	English
Title of host publication	Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 4-9 May 2014, Florence, Italy
Place of Publication	Piscataway
Publisher	Institute of Electrical and Electronics Engineers
Pages	3814-3818
ISBN (Print)	978-1-4799-2892-7
DOIs	https://doi.org/10.1109/ICASSP.2014.6854315
Publication status	Published - 2014

Access to Document

10.1109/ICASSP.2014.6854315

Cite this

Farhadzadeh, F., Sun, K., & Fredowsi, S. (2014). Efficient two stage decoding scheme to achieve content identification capacity. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 4-9 May 2014, Florence, Italy (pp. 3814-3818). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ICASSP.2014.6854315

@inproceedings{53dbff0c866f436eb84c69f51f3d48ca,

title = "Efficient two stage decoding scheme to achieve content identification capacity",

abstract = "We introduce a scheme to address the trade-off between the identification rate, search and memory complexities in large-scale identification systems. We use a special database organization by assigning database entries to a set of possibly overlapping clusters. The clusters are generated based on statistics of both database entries and queries. The decoding procedure is accomplished in two stages. First, a list of clusters related to the query is detected. Then, refinement checks are performed on members of the detected clusters to produce a unique index. We investigate the minimum achievable search complexity for binary symmetric sources.",

author = "F. Farhadzadeh and K. Sun and S. Fredowsi",

year = "2014",

doi = "10.1109/ICASSP.2014.6854315",

language = "English",

isbn = "978-1-4799-2892-7",

pages = "3814--3818",

booktitle = "Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 4-9 May 2014, Florence, Italy",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

}

Farhadzadeh, F, Sun, K & Fredowsi, S 2014, Efficient two stage decoding scheme to achieve content identification capacity. in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 4-9 May 2014, Florence, Italy. Institute of Electrical and Electronics Engineers, Piscataway, pp. 3814-3818. https://doi.org/10.1109/ICASSP.2014.6854315

Efficient two stage decoding scheme to achieve content identification capacity. / Farhadzadeh, F.; Sun, K.; Fredowsi, S.
Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 4-9 May 2014, Florence, Italy. Piscataway: Institute of Electrical and Electronics Engineers, 2014. p. 3814-3818.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Efficient two stage decoding scheme to achieve content identification capacity

AU - Farhadzadeh, F.

AU - Sun, K.

AU - Fredowsi, S.

PY - 2014

Y1 - 2014

N2 - We introduce a scheme to address the trade-off between the identification rate, search and memory complexities in large-scale identification systems. We use a special database organization by assigning database entries to a set of possibly overlapping clusters. The clusters are generated based on statistics of both database entries and queries. The decoding procedure is accomplished in two stages. First, a list of clusters related to the query is detected. Then, refinement checks are performed on members of the detected clusters to produce a unique index. We investigate the minimum achievable search complexity for binary symmetric sources.

AB - We introduce a scheme to address the trade-off between the identification rate, search and memory complexities in large-scale identification systems. We use a special database organization by assigning database entries to a set of possibly overlapping clusters. The clusters are generated based on statistics of both database entries and queries. The decoding procedure is accomplished in two stages. First, a list of clusters related to the query is detected. Then, refinement checks are performed on members of the detected clusters to produce a unique index. We investigate the minimum achievable search complexity for binary symmetric sources.

U2 - 10.1109/ICASSP.2014.6854315

DO - 10.1109/ICASSP.2014.6854315

M3 - Conference contribution

SN - 978-1-4799-2892-7

SP - 3814

EP - 3818

BT - Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 4-9 May 2014, Florence, Italy

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

ER -

Efficient two stage decoding scheme to achieve content identification capacity

Abstract

Access to Document

Fingerprint

Cite this