File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Efficient video retrieval by locality sensitive hashing

TitleEfficient video retrieval by locality sensitive hashing
Authors
Issue Date2005
Citation
ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, 2005, v. II, article no. 1415438 How to Cite?
AbstractIn this paper, a new scheme for fast video retrieval is proposed. In the scheme, a video is represented by a set of feature vectors which are computed using the robust Alpha-trimmed average color histogram. To efficiently retrieve videos, the locality sensitive hashing technique, which involves a uniform distance shrinking projection, is applied. Such a technique does not suffer from the notorious "curse of dimensionality" problem in handling high-dimensional data point set and guarantees that geometrically close vectors are hashed to the same bucket with high probability. In addition, unlike the conventional techniques, the involved similarity measure incorporates temporal order of video sequences. The experimental results demonstrate that the proposed scheme outperforms the conventional approaches in accuracy and efficiency. © 2005 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/336028
ISSN

 

DC FieldValueLanguage
dc.contributor.authorHu, Shiyan-
dc.date.accessioned2024-01-15T08:22:09Z-
dc.date.available2024-01-15T08:22:09Z-
dc.date.issued2005-
dc.identifier.citationICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, 2005, v. II, article no. 1415438-
dc.identifier.issn1520-6149-
dc.identifier.urihttp://hdl.handle.net/10722/336028-
dc.description.abstractIn this paper, a new scheme for fast video retrieval is proposed. In the scheme, a video is represented by a set of feature vectors which are computed using the robust Alpha-trimmed average color histogram. To efficiently retrieve videos, the locality sensitive hashing technique, which involves a uniform distance shrinking projection, is applied. Such a technique does not suffer from the notorious "curse of dimensionality" problem in handling high-dimensional data point set and guarantees that geometrically close vectors are hashed to the same bucket with high probability. In addition, unlike the conventional techniques, the involved similarity measure incorporates temporal order of video sequences. The experimental results demonstrate that the proposed scheme outperforms the conventional approaches in accuracy and efficiency. © 2005 IEEE.-
dc.languageeng-
dc.relation.ispartofICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings-
dc.titleEfficient video retrieval by locality sensitive hashing-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ICASSP.2005.1415438-
dc.identifier.scopuseid_2-s2.0-33646778510-
dc.identifier.volumeII-
dc.identifier.spagearticle no. 1415438-
dc.identifier.epagearticle no. 1415438-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats