Privacy-preserving nearest neighbor methods: comparing signals without revealing them

Comparing two signals is one of the most essential and prevalent tasks in signal processing. A large number of applications fundamentally rely on determining the answers to the following two questions: 1) How should two signals be compared? 2) Given a set of signals and a query signal, which signals...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE signal processing magazine 2013-03, Vol.30 (2), p.18-28
Hauptverfasser: Rane, S., Boufounos, P. T.
Format: Magazinearticle
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 28
container_issue 2
container_start_page 18
container_title IEEE signal processing magazine
container_volume 30
creator Rane, S.
Boufounos, P. T.
description Comparing two signals is one of the most essential and prevalent tasks in signal processing. A large number of applications fundamentally rely on determining the answers to the following two questions: 1) How should two signals be compared? 2) Given a set of signals and a query signal, which signals are the nearest neighbors (NNs) of the query signal, i.e., which signals in the database are most similar to the query signal? The NN search problem is defined as follows: Given a set S containing points in a metric space M, and a query point x !M, find the point in S that is closest to x. The problem can be extended to K-NN, i.e., determining the K signals nearest to x. In this context, the points in question are signals, such as images, videos, or other waveforms. The qualifier closest refers to a distance metric, such as the Euclidean distance or Manhattan distance between pairs of points in S. Finding the NN of the query point should be at most linear in the database size and is a well-studied problem in conventional NN settings.
doi_str_mv 10.1109/MSP.2012.2230221
format Magazinearticle
fullrecord <record><control><sourceid>crossref_RIE</sourceid><recordid>TN_cdi_ieee_primary_6461631</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6461631</ieee_id><sourcerecordid>10_1109_MSP_2012_2230221</sourcerecordid><originalsourceid>FETCH-LOGICAL-c248t-eb1bcc777c4f95b856a54fb23f21728e3e8891174d26f18ef88e83aea84404d43</originalsourceid><addsrcrecordid>eNo9kEtPwzAQhC0EEqVwR-KSP5Di9SPZcEMVL6mIStBz5Ljr1qhpKjsU9d_jqBWnmdXM7OFj7Bb4BIBX9--f84ngICZCSC4EnLERaI05LytxnjzXMteIeMmuYvzmHBTKasQW8-D3xh7yXaBIYe-3q2xLJh19Ur9aN13IWurX3TI-ZLZrdyYMnehXW7OJ2a9P0U-fBdqT2QxJv6b2ml24lNLNScds8fz0NX3NZx8vb9PHWW6Fwj6nBhpry7K0ylW6QV0YrVwjpBNQCiRJiBVAqZaicIDkEAmlIYNKcbVUcsz48a8NXYyBXL0LvjXhUAOvByx1wlIPWOoTljS5O048Ef3XC1VAIUH-AbhJYB4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>magazinearticle</recordtype></control><display><type>magazinearticle</type><title>Privacy-preserving nearest neighbor methods: comparing signals without revealing them</title><source>IEEE Electronic Library (IEL)</source><creator>Rane, S. ; Boufounos, P. T.</creator><creatorcontrib>Rane, S. ; Boufounos, P. T.</creatorcontrib><description>Comparing two signals is one of the most essential and prevalent tasks in signal processing. A large number of applications fundamentally rely on determining the answers to the following two questions: 1) How should two signals be compared? 2) Given a set of signals and a query signal, which signals are the nearest neighbors (NNs) of the query signal, i.e., which signals in the database are most similar to the query signal? The NN search problem is defined as follows: Given a set S containing points in a metric space M, and a query point x !M, find the point in S that is closest to x. The problem can be extended to K-NN, i.e., determining the K signals nearest to x. In this context, the points in question are signals, such as images, videos, or other waveforms. The qualifier closest refers to a distance metric, such as the Euclidean distance or Manhattan distance between pairs of points in S. Finding the NN of the query point should be at most linear in the database size and is a well-studied problem in conventional NN settings.</description><identifier>ISSN: 1053-5888</identifier><identifier>EISSN: 1558-0792</identifier><identifier>DOI: 10.1109/MSP.2012.2230221</identifier><identifier>CODEN: ISPRE6</identifier><language>eng</language><publisher>IEEE</publisher><subject>Encryption ; Nearest neighbor searches ; Privacy ; Tutorials</subject><ispartof>IEEE signal processing magazine, 2013-03, Vol.30 (2), p.18-28</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c248t-eb1bcc777c4f95b856a54fb23f21728e3e8891174d26f18ef88e83aea84404d43</citedby><cites>FETCH-LOGICAL-c248t-eb1bcc777c4f95b856a54fb23f21728e3e8891174d26f18ef88e83aea84404d43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6461631$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>780,784,796,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6461631$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Rane, S.</creatorcontrib><creatorcontrib>Boufounos, P. T.</creatorcontrib><title>Privacy-preserving nearest neighbor methods: comparing signals without revealing them</title><title>IEEE signal processing magazine</title><addtitle>MSP</addtitle><description>Comparing two signals is one of the most essential and prevalent tasks in signal processing. A large number of applications fundamentally rely on determining the answers to the following two questions: 1) How should two signals be compared? 2) Given a set of signals and a query signal, which signals are the nearest neighbors (NNs) of the query signal, i.e., which signals in the database are most similar to the query signal? The NN search problem is defined as follows: Given a set S containing points in a metric space M, and a query point x !M, find the point in S that is closest to x. The problem can be extended to K-NN, i.e., determining the K signals nearest to x. In this context, the points in question are signals, such as images, videos, or other waveforms. The qualifier closest refers to a distance metric, such as the Euclidean distance or Manhattan distance between pairs of points in S. Finding the NN of the query point should be at most linear in the database size and is a well-studied problem in conventional NN settings.</description><subject>Encryption</subject><subject>Nearest neighbor searches</subject><subject>Privacy</subject><subject>Tutorials</subject><issn>1053-5888</issn><issn>1558-0792</issn><fulltext>true</fulltext><rsrctype>magazinearticle</rsrctype><creationdate>2013</creationdate><recordtype>magazinearticle</recordtype><sourceid>RIE</sourceid><recordid>eNo9kEtPwzAQhC0EEqVwR-KSP5Di9SPZcEMVL6mIStBz5Ljr1qhpKjsU9d_jqBWnmdXM7OFj7Bb4BIBX9--f84ngICZCSC4EnLERaI05LytxnjzXMteIeMmuYvzmHBTKasQW8-D3xh7yXaBIYe-3q2xLJh19Ur9aN13IWurX3TI-ZLZrdyYMnehXW7OJ2a9P0U-fBdqT2QxJv6b2ml24lNLNScds8fz0NX3NZx8vb9PHWW6Fwj6nBhpry7K0ylW6QV0YrVwjpBNQCiRJiBVAqZaicIDkEAmlIYNKcbVUcsz48a8NXYyBXL0LvjXhUAOvByx1wlIPWOoTljS5O048Ef3XC1VAIUH-AbhJYB4</recordid><startdate>201303</startdate><enddate>201303</enddate><creator>Rane, S.</creator><creator>Boufounos, P. T.</creator><general>IEEE</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>201303</creationdate><title>Privacy-preserving nearest neighbor methods: comparing signals without revealing them</title><author>Rane, S. ; Boufounos, P. T.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c248t-eb1bcc777c4f95b856a54fb23f21728e3e8891174d26f18ef88e83aea84404d43</frbrgroupid><rsrctype>magazinearticle</rsrctype><prefilter>magazinearticle</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Encryption</topic><topic>Nearest neighbor searches</topic><topic>Privacy</topic><topic>Tutorials</topic><toplevel>online_resources</toplevel><creatorcontrib>Rane, S.</creatorcontrib><creatorcontrib>Boufounos, P. T.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005–Present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><jtitle>IEEE signal processing magazine</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Rane, S.</au><au>Boufounos, P. T.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Privacy-preserving nearest neighbor methods: comparing signals without revealing them</atitle><jtitle>IEEE signal processing magazine</jtitle><stitle>MSP</stitle><date>2013-03</date><risdate>2013</risdate><volume>30</volume><issue>2</issue><spage>18</spage><epage>28</epage><pages>18-28</pages><issn>1053-5888</issn><eissn>1558-0792</eissn><coden>ISPRE6</coden><abstract>Comparing two signals is one of the most essential and prevalent tasks in signal processing. A large number of applications fundamentally rely on determining the answers to the following two questions: 1) How should two signals be compared? 2) Given a set of signals and a query signal, which signals are the nearest neighbors (NNs) of the query signal, i.e., which signals in the database are most similar to the query signal? The NN search problem is defined as follows: Given a set S containing points in a metric space M, and a query point x !M, find the point in S that is closest to x. The problem can be extended to K-NN, i.e., determining the K signals nearest to x. In this context, the points in question are signals, such as images, videos, or other waveforms. The qualifier closest refers to a distance metric, such as the Euclidean distance or Manhattan distance between pairs of points in S. Finding the NN of the query point should be at most linear in the database size and is a well-studied problem in conventional NN settings.</abstract><pub>IEEE</pub><doi>10.1109/MSP.2012.2230221</doi><tpages>11</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1053-5888
ispartof IEEE signal processing magazine, 2013-03, Vol.30 (2), p.18-28
issn 1053-5888
1558-0792
language eng
recordid cdi_ieee_primary_6461631
source IEEE Electronic Library (IEL)
subjects Encryption
Nearest neighbor searches
Privacy
Tutorials
title Privacy-preserving nearest neighbor methods: comparing signals without revealing them
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T03%3A13%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Privacy-preserving%20nearest%20neighbor%20methods:%20comparing%20signals%20without%20revealing%20them&rft.jtitle=IEEE%20signal%20processing%20magazine&rft.au=Rane,%20S.&rft.date=2013-03&rft.volume=30&rft.issue=2&rft.spage=18&rft.epage=28&rft.pages=18-28&rft.issn=1053-5888&rft.eissn=1558-0792&rft.coden=ISPRE6&rft_id=info:doi/10.1109/MSP.2012.2230221&rft_dat=%3Ccrossref_RIE%3E10_1109_MSP_2012_2230221%3C/crossref_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6461631&rfr_iscdi=true