Privacy preserving identification using sparse approximation with ambiguization
暂无分享,去创建一个
[1] Laurent Amsaleg,et al. Secure and efficient approximate nearest neighbors search , 2013, IH&MMSec '13.
[2] Dimche Kostadinov,et al. Sparse ternary codes for similarity search have higher coding gain than dense binary codes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[3] Shantanu Rane,et al. An attribute-based framework for privacy preserving image querying , 2012, 2012 19th IEEE International Conference on Image Processing.
[4] Teddy Furon,et al. Group Testing for Identification with Privacy , 2016, IH&MMSec.
[5] Yoram Bresler,et al. Learning Sparsifying Transforms , 2013, IEEE Transactions on Signal Processing.
[6] Yoram Bresler,et al. Closed-form solutions within sparsifying transform learning , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.
[7] P. Schönemann,et al. A generalized solution of the orthogonal procrustes problem , 1966 .
[8] Florent Perronnin,et al. Fisher Kernels on Visual Vocabularies for Image Categorization , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.
[9] David Stutz,et al. Neural Codes for Image Retrieval , 2015 .
[10] Cordelia Schmid,et al. Aggregating local descriptors into a compact image representation , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[11] E. Kreyszig. Introductory Functional Analysis With Applications , 1978 .
[12] C. Schmid,et al. On the burstiness of visual elements , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.
[13] Dimche Kostadinov,et al. Fast content identification in high-dimensional feature spaces using Sparse Ternary Codes , 2016, 2016 IEEE International Workshop on Information Forensics and Security (WIFS).
[14] Petros Boufounos,et al. Secure binary embeddings for privacy preserving nearest neighbors , 2011, 2011 IEEE International Workshop on Information Forensics and Security.