default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Moulin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j70]Yuanyuan Qing
, Tao Bai, Zhuotao Liu, Pierre Moulin, Bihan Wen:
Detection of Adversarial Attacks via Disentangling Natural Images and Perturbations. IEEE Trans. Inf. Forensics Secur. 19: 2814-2825 (2024)- 2023
- [j69]Xi Yu, Niklas Smedemark-Margulies, Shuchin Aeron, Toshiaki Koike-Akino, Pierre Moulin, Matthew Brand, Kieran Parsons, Ye Wang:
Improving adversarial robustness by learning shared information. Pattern Recognit. 134: 109054 (2023) - [j68]Furen Zhuang, Pierre Moulin:
Label-Consistent Generalizable Hash Codes. IEEE Trans. Inf. Forensics Secur. 18: 4075-4085 (2023) - [c151]Furen Zhuang, Pierre Moulin:
Deep Semi-Supervised Metric Learning with Mixed Label Propagation. CVPR 2023: 3429-3438 - 2022
- [j67]Amish Goel, Pierre Moulin:
Fast Locally Optimal Detection of Targeted Universal Adversarial Perturbations. IEEE Trans. Inf. Forensics Secur. 17: 1757-1770 (2022) - 2021
- [c150]Furen Zhuang, Pierre Moulin:
Deep Semi-Supervised Metric Learning Via Identification of Manifold Memberships. ICASSP 2021: 1755-1759 - [c149]Amish Goel, Pierre Moulin:
Locally Optimal Detection of Stochastic Targeted Universal Adversarial Perturbations. ICASSP 2021: 5025-5029 - [c148]Ye Wang, Shuchin Aeron, Adnan Siraj Rakin, Toshiaki Koike-Akino, Pierre Moulin:
Robust Machine Learning via Privacy/ Rate-Distortion Theory. ISIT 2021: 1320-1325 - [c147]Adnan Siraj Rakin, Ye Wang, Shuchin Aeron, Toshiaki Koike-Akino, Pierre Moulin, Kieran Parsons:
Towards Universal Adversarial Examples and Defenses. ITW 2021: 1-6 - 2020
- [j66]Patrick R. Johnstone, Pierre Moulin:
Faster subgradient methods for functions with Hölderian growth. Math. Program. 180(1): 417-450 (2020) - [c146]Furen Zhuang, Pierre Moulin:
A New Variational Method for Deep Supervised Semantic Image Hashing. ICASSP 2020: 4532-4536 - [c145]Tejas Jayashankar, Jonathan Le Roux, Pierre Moulin:
Detecting Audio Attacks on ASR Systems with Dropout Uncertainty. INTERSPEECH 2020: 4671-4675 - [i20]Tejas Jayashankar, Jonathan Le Roux, Pierre Moulin:
Detecting Audio Attacks on ASR Systems with Dropout Uncertainty. CoRR abs/2006.01906 (2020) - [i19]Ye Wang, Shuchin Aeron, Adnan Siraj Rakin, Toshiaki Koike-Akino, Pierre Moulin:
Robust Machine Learning via Privacy/Rate-Distortion Theory. CoRR abs/2007.11693 (2020) - [i18]Amish Goel, Pierre Moulin:
Locally optimal detection of stochastic targeted universal adversarial perturbations. CoRR abs/2012.04692 (2020)
2010 – 2019
- 2019
- [j65]Raymond W. Yeung, Ali Al-Bashabsheh, Chao Chen, Qi Chen, Pierre Moulin:
On Information-Theoretic Characterizations of Markov Random Fields and Subfields. IEEE Trans. Inf. Theory 65(3): 1493-1511 (2019) - [j64]Rim Trabelsi, Jagannadan Varadarajan, Le Zhang, Issam Jabri, Yong Pei, Fethi Smach, Ammar Bouallegue, Pierre Moulin:
Understanding the Dynamics of Social Interactions: A Multi-Modal Multi-View Approach. ACM Trans. Multim. Comput. Commun. Appl. 15(1s): 15:1-15:16 (2019) - [c144]Tejas Jayashankar, Pierre Moulin, Thierry Blu, Christopher Gilliam:
Lap-Based Video Frame Interpolation. ICIP 2019: 4195-4199 - 2018
- [c143]Amish Goel, Pierre Moulin:
Random Ensemble of Locally Optimum Detectors for Detection of Adversarial Examples. GlobalSIP 2018: 1189-1193 - [c142]K. Wasif Mohiuddin, Jagannadan Varadarajan, Rémi Emonet, Jean-Marc Odobez, Pierre Moulin:
GPU Accelerated Probabilistic Latent Sequential Motifs for Activity Analysis. VISIGRAPP (5: VISAPP) 2018: 409-418 - 2017
- [j63]Patrick R. Johnstone, Pierre Moulin:
Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions. Comput. Optim. Appl. 67(2): 259-292 (2017) - [j62]Pierre Moulin:
The Log-Volume of Optimal Codes for Memoryless Channels, Asymptotically Within a Few Nats. IEEE Trans. Inf. Theory 63(4): 2278-2313 (2017) - [c141]Le Zhang, Jagannadan Varadarajan, Ponnuthurai Nagaratnam Suganthan, Narendra Ahuja, Pierre Moulin:
Robust Visual Tracking Using Oblique Random Forests. CVPR 2017: 5825-5834 - [c140]Patrick R. Johnstone, Pierre Moulin:
Convergence rates of inertial splitting schemes for nonconvex composite optimization. ICASSP 2017: 4716-4720 - [c139]Pierre Moulin, Amish Goel:
Locally optimal detection of adversarial inputs to image classifiers. ICME Workshops 2017: 459-464 - [c138]Rim Trabelsi, Jagannadan Varadarajan, Yong Pei, Le Zhang, Issam Jabri, Ammar Bouallegue, Pierre Moulin:
Multi-modal social interaction recognition using view-invariant features. ISIAA@ICMI 2017: 47-48 - [c137]Raymond W. Yeung, Ali Al-Bashabsheh, Chao Chen, Qi Chen, Pierre Moulin:
Information-theoretic characterizations of Markov random fields and subfields. ISIT 2017: 3040-3044 - [c136]Pierre Moulin:
Source coding with distortion profile constraints. ISIT 2017: 3215-3219 - [c135]Pierre Moulin:
Lower bounds on rate of fixed-length source codes under average- and 6-fidelity constraints. ISIT 2017: 3220-3224 - [c134]Rim Trabelsi, Jagannadan Varadarajan, Yong Pei, Le Zhang, Issam Jabri, Ammar Bouallegue, Pierre Moulin:
Robust Multi-Modal Cues for Dyadic Human Interaction Recognition. MUSA2@MM 2017: 47-53 - [c133]Jagannadan Varadarajan, Ramanathan Subramanian, Narendra Ahuja, Pierre Moulin, Jean-Marc Odobez:
Active Online Anomaly Detection Using Dirichlet Process Mixture Model and Gaussian Process Classification. WACV 2017: 615-623 - [i17]Patrick R. Johnstone, Pierre Moulin:
Faster Subgradient Methods for Functions with Hölderian Growth. CoRR abs/1704.00196 (2017) - 2016
- [j61]Bingbing Ni, Vignesh R. Paramathayalan, Teng Li, Pierre Moulin:
Multiple Granularity Modeling: A Coarse-to-Fine Framework for Fine-grained Action Analysis. Int. J. Comput. Vis. 120(1): 28-43 (2016) - [j60]Jiwen Lu, Gang Wang, Pierre Moulin:
Localized Multifeature Metric Learning for Image-Set-Based Face Recognition. IEEE Trans. Circuits Syst. Video Technol. 26(3): 529-540 (2016) - [c132]Pierre Moulin:
Asymptotically achievable error probabilities for multiple hypothesis testing. ISIT 2016: 1541-1545 - [i16]Patrick R. Johnstone, Pierre Moulin:
Local and Global Convergence of a General Inertial Proximal Splitting Scheme. CoRR abs/1602.02726 (2016) - [i15]Honghai Yu, Pierre Moulin, Hong Wei Ng, Xiaoli Li:
Variable-Length Hashing. CoRR abs/1603.05414 (2016) - [i14]Raymond W. Yeung, Ali Al-Bashabsheh, Chao Chen, Qi Chen, Pierre Moulin:
On Characterizations of Markov Random Fields and Subfields. CoRR abs/1608.03697 (2016) - 2015
- [j59]Bingbing Ni, Pierre Moulin, Shuicheng Yan:
Pose Adaptive Motion Feature Pooling for Human Action Analysis. Int. J. Comput. Vis. 111(2): 229-248 (2015) - [j58]Bingbing Ni, Pierre Moulin, Shuicheng Yan:
Order Preserving Sparse Coding. IEEE Trans. Pattern Anal. Mach. Intell. 37(8): 1615-1628 (2015) - [j57]Jiwen Lu, Venice Erin Liong, Gang Wang, Pierre Moulin:
Joint Feature Learning for Face Recognition. IEEE Trans. Inf. Forensics Secur. 10(7): 1371-1383 (2015) - [j56]Honghai Yu, Pierre Moulin:
SNR Maximization Hashing. IEEE Trans. Inf. Forensics Secur. 10(9): 1927-1938 (2015) - [c131]Jiwen Lu, Gang Wang, Weihong Deng, Pierre Moulin, Jie Zhou:
Multi-manifold deep metric learning for image set classification. CVPR 2015: 1137-1145 - [c130]Venice Erin Liong, Jiwen Lu, Gang Wang, Pierre Moulin, Jie Zhou:
Deep hashing for compact binary codes learning. CVPR 2015: 2475-2483 - [c129]Bingbing Ni, Pierre Moulin, Xiaokang Yang, Shuicheng Yan:
Motion Part Regularization: Improving action recognition via trajectory group selection. CVPR 2015: 3698-3706 - [c128]Honghai Yu, Pierre Moulin:
SNR maximization hashing for learning compact binary codes. ICASSP 2015: 1692-1696 - [c127]Patrick R. Johnstone, Pierre Moulin:
Convergence of an inertial proximal method for l1-regularized least-squares. ICASSP 2015: 3566-3570 - [c126]Thierry Blu, Pierre Moulin, Christopher Gilliam:
Approximationorder of the lap optical flow algorithm. ICIP 2015: 48-52 - [c125]Honghai Yu, Pierre Moulin:
Multi-feature hashing based on SNR maximization. ICIP 2015: 1815-1819 - [c124]Pierre Moulin, Patrick R. Johnstone:
Strong large deviations for Rao test score and GLRT in exponential families. ISIT 2015: 779-783 - [c123]Jaeho Lee, Maxim Raginsky, Pierre Moulin:
On MMSE estimation from quantized observations in the nonasymptotic regime. ISIT 2015: 2924-2928 - [i13]Patrick R. Johnstone, Pierre Moulin:
A Lyapunov Analysis of FISTA with Local Linear Convergence for Sparse Optimization. CoRR abs/1502.02281 (2015) - [i12]Jaeho Lee, Maxim Raginsky, Pierre Moulin:
On MMSE estimation from quantized observations in the nonasymptotic regime. CoRR abs/1504.06029 (2015) - 2014
- [j55]Jiwen Lu, Gang Wang, Pierre Moulin:
Human Identity and Gender Recognition From Gait Sequences With Arbitrary Walking Directions. IEEE Trans. Inf. Forensics Secur. 9(1): 51-61 (2014) - [j54]Yen-Wei Huang, Pierre Moulin:
On the Fingerprinting Capacity Games for Arbitrary Alphabets and Their Asymptotics. IEEE Trans. Inf. Forensics Secur. 9(9): 1477-1490 (2014) - [j53]Honghai Yu, Pierre Moulin:
Regularized Adaboost Learning for Identification of Time-Varying Content. IEEE Trans. Inf. Forensics Secur. 9(10): 1606-1616 (2014) - [c122]Scott Deeann Chen, Pierre Moulin:
A classification centric quantizer for efficient encoding of predictive feature errors. ACSSC 2014: 2098-2102 - [c121]Bingbing Ni, Vignesh R. Paramathayalan, Pierre Moulin:
Multiple Granularity Analysis for Fine-Grained Action Detection. CVPR 2014: 756-763 - [c120]Bingbing Ni, Teng Li, Pierre Moulin:
Beta Process Multiple Kernel Learning. CVPR 2014: 963-970 - [c119]Jiwen Lu, Gang Wang, Weihong Deng, Pierre Moulin:
Simultaneous Feature and Dictionary Learning for Image Set Based Face Recognition. ECCV (1) 2014: 265-280 - [c118]Yang Zhou, Bingbing Ni, Shuicheng Yan, Pierre Moulin, Qi Tian:
Pipelining Localized Semantic Features for Fine-Grained Action Recognition. ECCV (4) 2014: 481-496 - [c117]Scott Deeann Chen, Pierre Moulin:
A two-part predictive coder for multitask signal compression. ICASSP 2014: 2035-2039 - [c116]Rohit Naini, Pierre Moulin:
Fingerprint information maximization for content identification. ICASSP 2014: 3809-3813 - [c115]Yen-Wei Huang, Pierre Moulin:
Strong large deviations for composite hypothesis testing. ISIT 2014: 556-560 - [c114]Vincent Y. F. Tan, Pierre Moulin:
Second-order capacities of erasure and list decoding. ISIT 2014: 1887-1891 - [i11]Vincent Y. F. Tan, Pierre Moulin:
Second- and Higher-Order Asymptotics For Erasure and List Decoding. CoRR abs/1402.4881 (2014) - 2013
- [j52]Bingbing Ni, Yong Pei, Pierre Moulin, Shuicheng Yan:
Multilevel Depth and Image Fusion for Human Activity Detection. IEEE Trans. Cybern. 43(5): 1383-1394 (2013) - [c113]Bingbing Ni, Yong Pei, Zhujin Liang, Liang Lin, Pierre Moulin:
Integrating multi-stage depth-induced contextual information for human action recognition and localization. FG 2013: 1-8 - [c112]Diana Sungatullina, Jiwen Lu, Gang Wang, Pierre Moulin:
Multiview discriminative learning for age-invariant face recognition. FG 2013: 1-6 - [c111]Honghai Yu, Pierre Moulin:
Regularized Adaboost for content identification. ICASSP 2013: 3078-3082 - [c110]Honghai Yu, Pierre Moulin, Sujoy Roy:
RGB-D video content identification. ICASSP 2013: 3776-3780 - [c109]Jiwen Lu, Gang Wang, Pierre Moulin:
Image Set Classification Using Holistic Multiple Order Statistics Features and Localized Multi-kernel Metric Learning. ICCV 2013: 329-336 - [c108]Bingbing Ni, Pierre Moulin:
Manipulation Pattern Discovery: A Nonparametric Bayesian Approach. ICCV 2013: 1361-1368 - [c107]Scott Deeann Chen, Ying-Yu Chen, Jiawei Han, Pierre Moulin:
A Feature-Enhanced Ranking-Based Classifier for Multimodal Data and Heterogeneous Information Networks. ICDM 2013: 997-1002 - [c106]Pierre Moulin:
Keynote speaker III: Information embedding: From theory to practice. ICSIPA 2013: 1 - [c105]Pierre Moulin:
Asymptotic Neyman-Pearson games for converse to the channel coding theorem. ISIT 2013: 1541-1545 - [c104]Pierre Moulin:
A new metaconverse and outer region for finite-blocklength MACs. ITA 2013: 1-8 - [p1]Bingbing Ni, Gang Wang, Pierre Moulin:
RGBD-HuDaAct: A Color-Depth Video Database for Human Daily Activity Recognition. Consumer Depth Cameras for Computer Vision 2013: 193-208 - [i10]Pierre Moulin:
The Log-Volume of Optimal Codes for Memoryless Channels, Within A Few Nats. CoRR abs/1311.0181 (2013) - 2012
- [j51]Yen-Wei Huang, Pierre Moulin:
On the Saddle-Point Solution and the Large-Coalition Asymptotics of Fingerprinting Games. IEEE Trans. Inf. Forensics Secur. 7(1): 160-175 (2012) - [c103]Bingbing Ni, Mengdi Xu, Jinhui Tang, Shuicheng Yan, Pierre Moulin:
Omni-range spatial contexts for visual classification. CVPR 2012: 3514-3521 - [c102]Bingbing Ni, Pierre Moulin, Shuicheng Yan:
Order-Preserving Sparse Coding for Sequence Classification. ECCV (2) 2012: 173-187 - [c101]Bingbing Ni, Nguyen Chi Dat, Pierre Moulin:
RGBD-camera based get-up event detection for hospital fall prevention. ICASSP 2012: 1405-1408 - [c100]Rohit Naini, Pierre Moulin:
Model-based decoding metrics for content identification. ICASSP 2012: 1829-1832 - [c99]Rachit Dubey, Bingbing Ni, Pierre Moulin:
A Depth Camera Based Fall Recognition System for the Elderly. ICIAR (2) 2012: 106-113 - [c98]Pierre Moulin:
The log-volume of optimal constant-composition codes for memoryless channels, within O(1) bits. ISIT 2012: 826-830 - [c97]Yen-Wei Huang, Pierre Moulin:
Finite blocklength coding for multiple access channels. ISIT 2012: 831-835 - [c96]Yen-Wei Huang, Pierre Moulin:
On fingerprinting capacity games for arbitrary alphabets and their asymptotics. ISIT 2012: 2571-2575 - [c95]Abhishek Singh, Narendra Ahuja, Pierre Moulin:
Online learning with kernels: Overcoming the growing sum problem. MLSP 2012: 1-6 - [c94]Rohit Naini, Pierre Moulin:
Real Adaboost for content identification. SSP 2012: 756-759 - [i9]Guo-Jun Qi, Charu C. Aggarwal, Pierre Moulin, Thomas S. Huang:
Learning from Collective Intelligence in Groups. CoRR abs/1210.0954 (2012) - 2011
- [j50]Shankar Sadasivam, Pierre Moulin, Todd P. Coleman:
A Message-Passing Approach to Combating Desynchronization Attacks. IEEE Trans. Inf. Forensics Secur. 6(3-2): 894-905 (2011) - [c93]Bingbing Ni, Gang Wang, Pierre Moulin:
RGBD-HuDaAct: A color-depth video database for human daily activity recognition. ICCV Workshops 2011: 1147-1153 - 2010
- [c92]Guillaume Gigaud, Pierre Moulin:
Traitor-tracing aided by compressed SURF image features. CISS 2010: 1-6 - [c91]Guillaume Gigaud, Pierre Moulin:
A geometrically-resilient surf-based image fingerprinting scheme. ICIP 2010: 3669-3672 - [c90]Pierre Moulin:
Statistical modeling and analysis of content identification. ITA 2010: 329-333 - [c89]Yen-Wei Huang, Pierre Moulin:
Maximin optimality of the arcsine fingerprinting distribution and the interleaving attack for large coalitions. WIFS 2010: 1-6 - [c88]Shankar Sadasivam, Pierre Moulin, Sean P. Meyn:
A universal divergence-rate estimator for steganalysis in timing channels. WIFS 2010: 1-6 - [i8]Yen-Wei Huang, Pierre Moulin:
On the Saddle-point Solution and the Large-Coalition Behavior of Fingerprinting Games. CoRR abs/1011.1261 (2010)
2000 – 2009
- 2009
- [j49]Maha El Choubassi, Pierre Moulin:
On reliability and security of randomized detectors against sensitivity analysis attacks. IEEE Trans. Inf. Forensics Secur. 4(3): 273-283 (2009) - [j48]Shankar Sadasivam, Pierre Moulin:
On estimation accuracy of desynchronization attack channel parameters. IEEE Trans. Inf. Forensics Secur. 4(3): 284-292 (2009) - [j47]Negar Kiyavash, Pierre Moulin:
Performance of orthogonal fingerprinting codes under worst-case noise. IEEE Trans. Inf. Forensics Secur. 4(3): 293-301 (2009) - [j46]Negar Kiyavash, Pierre Moulin, Ton Kalker:
Regular simplex fingerprints and their optimality properties. IEEE Trans. Inf. Forensics Secur. 4(3): 318-329 (2009) - [j45]Jean-François Jourdas, Pierre Moulin:
High-rate random-like spherical fingerprinting codes with linear decoding complexity. IEEE Trans. Inf. Forensics Secur. 4(4): 768-780 (2009) - [j44]Pierre Moulin:
A Neyman-Pearson approach to universal erasure and list decoding. IEEE Trans. Inf. Theory 55(10): 4462-4478 (2009) - [c87]Pierre Moulin:
Optimal Gaussian fingeprint decoders. ICASSP 2009: 1425-1428 - [c86]Shankar Sadasivam, Pierre Moulin:
Combating desynchronization attacks on blind watermarking systems: A message passing approach. ICIP 2009: 3641-3644 - [c85]Pierre Moulin:
Strong converse for Gel'fand-Pinsker channel. ISIT 2009: 1958-1962 - [c84]Yen-Wei Huang, Pierre Moulin:
Saddle-point solution of the fingerprinting capacity game under the marking assumption. ISIT 2009: 2256-2260 - [c83]Maha El Choubassi, Pierre Moulin:
Joint detection-estimation games for sensitivity analysis attacks. Media Forensics and Security 2009: 72540F - [c82]Scott Deeann Chen, Vishal Monga, Pierre Moulin:
Meta-classifiers for multimodal document classification. MMSP 2009: 1-6 - [c81]Yen-Wei Huang, Pierre Moulin:
Capacity-achieving fingerprint decoding. WIFS 2009: 51-55 - [i7]Yen-Wei Huang, Pierre Moulin:
Saddle-point Solution of the Fingerprinting Capacity Game Under the Marking Assumption. CoRR abs/0905.1375 (2009) - 2008
- [j43]Ying Wang, Pierre Moulin:
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions. IEEE Trans. Inf. Theory 54(6): 2706-2722 (2008) - [c80]Jean-François Jourdas, Pierre Moulin:
Towards optimal design of signal fingerprinting codes. ICASSP 2008: 1649-1652 - [c79]Pierre Moulin:
A Neyman-Pearson approach to universal erasure and list decoding. ISIT 2008: 61-65 - [c78]Pierre Moulin:
Universal fingerprinting: Capacity and random-coding exponents. ISIT 2008: 220-224 - [c77]Jean-François Jourdas, Pierre Moulin:
A high-rate fingerprinting code. Security, Forensics, Steganography, and Watermarking of Multimedia Contents 2008: 68190A - [c76]Jean-François Jourdas, Pierre Moulin:
A low-rate fingerprinting code and its application to blind image fingerprinting. Security, Forensics, Steganography, and Watermarking of Multimedia Contents 2008: 681907 - [i6]Pierre Moulin:
Universal Fingerprinting: Capacity and Random-Coding Exponents. CoRR abs/0801.3837 (2008) - [i5]Pierre Moulin:
A Neyman-Pearson Approach to Universal Erasure and List Decoding. CoRR abs/0801.4544 (2008) - [i4]Ying Wang, Pierre Moulin:
Blind Fingerprinting. CoRR abs/0803.0265 (2008) - 2007
- [j42]Pierre Moulin:
Signal Transmission with Known-Interference Cancellation [Lecture Notes]. IEEE Signal Process. Mag. 24(1): 134-136 (2007) - [j41]Ying Wang, Pierre Moulin:
Optimized Feature Extraction for Learning-Based Image Steganalysis. IEEE Trans. Inf. Forensics Secur. 2(1): 31-45 (2007) - [j40]Maha El Choubassi, Pierre Moulin:
Noniterative Algorithms for Sensitivity Analysis Attacks. IEEE Trans. Inf. Forensics Secur. 2(2): 113-126 (2007) - [j39]Pierre Moulin, Ying Wang:
Capacity and Random-Coding Exponents for Channel Coding With Side Information. IEEE Trans. Inf. Theory 53(4): 1326-1347 (2007) - [c75]Pierre Moulin, Negar Kiyavash:
Performance of Random Fingerprinting Codes Under Arbitrary Nonlinear Attacks. ICASSP (2) 2007: 157-160 - [c74]Maha El Choubassi, Pierre Moulin:
Sensitivity Analysis Attacks Against Randomized Detectors. ICIP (2) 2007: 129-132 - [c73]Shankar Sadasivam, Pierre Moulin, Ralf Koetter:
Graphical Models for Desynchronization-Resilient Watermark Decoding. ICIP (5) 2007: 477-480 - [c72]Pierre Moulin, Negar Kiyavash:
Expurgated Gaussian Fingerprinting Codes. ISIT 2007: 711-715 - [c71]Negar Kiyavash, Pierre Moulin:
Sphere packing lower bound on fingerprinting error probability. Security, Steganography, and Watermarking of Multimedia Contents 2007: 65050K - [c70]Luis Pérez-Freire, Pierre Moulin, Fernando Pérez-González:
Security of spread-spectrum-based data hiding. Security, Steganography, and Watermarking of Multimedia Contents 2007: 65050F - [c69]Shankar Sadasivam, Pierre Moulin:
Cramer-Rao bound on watermark desynchronization parameter estimation accuracy. Security, Steganography, and Watermarking of Multimedia Contents 2007: 65050H - [c68]Ying Wang, Pierre Moulin:
Capacity and optimal collusion attack channels for Gaussian fingerprinting games. Security, Steganography, and Watermarking of Multimedia Contents 2007: 65050J - [i3]Ying Wang, Pierre Moulin:
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions. CoRR abs/cs/0702161 (2007) - 2006
- [j38]Pierre Moulin, Anil Kumar Goteti:
Block QIM watermarking games. IEEE Trans. Inf. Forensics Secur. 1(3): 293-310 (2006) - [j37]Jong Chul Ye, Pierre Moulin, Yoram Bresler:
Asymptotic Global Confidence Regions for 3-D Parametric Shape Estimation in Inverse Problems. IEEE Trans. Image Process. 15(10): 2904-2919 (2006) - [j36]Tie Liu, Pierre Moulin, Ralf Koetter:
On error exponents of modulo lattice additive noise channels. IEEE Trans. Inf. Theory 52(2): 454-471 (2006) - [j35]Soumya Jana, Pierre Moulin:
Optimality of KLT for High-Rate Transform Coding of Gaussian Vector-Scale Mixtures: Application to Reconstruction, Estimation, and Classification. IEEE Trans. Inf. Theory 52(9): 4049-4067 (2006) - [c67]Negar Kiyavash, Pierre Moulin:
A Framework for Optimizing Nonlinear Collusion Attacks on Fingerprinting Systems. CISS 2006: 1170-1175 - [c66]Ying Wang, Pierre Moulin:
On Discrimination between Photorealistic and Photographic Images. ICASSP (2) 2006: 161-164 - [c65]Negar Kiyavash, Pierre Moulin:
On Optimal Collusion Strategies for Fingerprinting. ICASSP (5) 2006: 405-408 - [c64]Pierre Moulin:
On the Optimal Structure of Watermark Decoders Under Desynchronization Attacks. ICIP 2006: 2589-2592 - [c63]Ying Wang, Pierre Moulin:
Capacity and Random-Coding Error Exponent for Public Fingerprinting Game. ISIT 2006: 1174-1178 - [c62]Pierre Moulin:
Universal Decoding of Watermarks Under Geometric Attacks. ISIT 2006: 2353-2357 - [c61]Siddharth Ray, Pierre Moulin, Muriel Médard:
On Jamming in the Wideband Regime. ISIT 2006: 2574-2577 - [c60]Pierre Moulin:
Discreet Signaling: From the Chinese Emperors to the Internet. MRCS 2006: 42 - [c59]Maha El Choubassi, Pierre Moulin:
On the fundamental tradeoff between watermark detection performance and robustness against sensitivity analysis attacks. Security, Steganography, and Watermarking of Multimedia Contents 2006: 60721I - [c58]Pierre Moulin, Ralf Koetter:
A framework for the design of good watermark identification codes. Security, Steganography, and Watermarking of Multimedia Contents 2006: 60721H - [c57]Ying Wang, Pierre Moulin:
Statistical modelling and steganalysis of DFT-based image steganography. Security, Steganography, and Watermarking of Multimedia Contents 2006: 607202 - 2005
- [j34]Pierre Moulin, Ralf Koetter:
Data-Hiding Codes. Proc. IEEE 93(12): 2083-2126 (2005) - [j33]Prakash Ishwar, Pierre Moulin:
On the Existence and Characterization of the Maxent Distribution Under General Moment Inequality Constraints. IEEE Trans. Inf. Theory 51(9): 3322-3333 (2005) - [c56]Pierre Moulin:
The method of types and its application to information hiding. EUSIPCO 2005: 1 - [c55]Pierre Moulin, Anil Kumar Goteti:
Minmax strategies for QIM watermarking subject to attacks with memory. ICIP (1) 2005: 985-988 - [c54]Negar Kiyavash, Pierre Moulin:
Regular Simplex Fingerprints and Their Optimality Properties. IWDW 2005: 97-109 - [c53]Pierre Moulin, Ying Wang:
Improved QIM Strategies for Gaussian Watermarking. IWDW 2005: 372-386 - [c52]Pierre Moulin, Ying Wang:
On achievable error exponents for watermarking. Security, Steganography, and Watermarking of Multimedia Contents 2005: 308-317 - [c51]Maha El Choubassi, Pierre Moulin:
New sensitivity analysis attack. Security, Steganography, and Watermarking of Multimedia Contents 2005: 734-745 - [i2]Prakash Ishwar, Pierre Moulin:
On the existence and characterization of the maxent distribution under general moment inequality constraints. CoRR abs/cs/0506013 (2005) - 2004
- [j32]Jillian Cannons, Pierre Moulin:
Design and statistical analysis of a hash-aided image watermarking system. IEEE Trans. Image Process. 13(10): 1393-1408 (2004) - [j31]Pierre Moulin, Mehmet Kivanç Mihçak:
The parallel-Gaussian watermarking game. IEEE Trans. Inf. Theory 50(2): 272-289 (2004) - [j30]Pierre Moulin, Ton Kalker, Ingemar J. Cox, Jana Dittmann, Pierre Duhamel, Avinash Jain, Stefan Katzenbeisser, Reginald L. Lagendijk:
Guest Editorial: Supplement on Secure Media - I. IEEE Trans. Signal Process. 52(10): 2954 (2004) - [c50]Pierre Moulin, Anil Kumar Goteti, Ralf Koetter:
Optimal sparse-QIM codes for zero-rate blind watermarking. ICASSP (3) 2004: 73-76 - [c49]Anil Kumar Goteti, Pierre Moulin:
Two private, perceptual data-hiding games. ICASSP (3) 2004: 373-376 - [c48]Anil Kumar Goteti, Pierre Moulin:
QIM watermarking games. ICIP 2004: 717-720 - [c47]Pierre Moulin, Alexia Briassouli:
A stochastic qim algorithm for robust, undetectable image watermarking. ICIP 2004: 1173-1176 - [c46]Tie Liu, Pierre Moulin, Ralf Koetter:
On error exponents of nested lattice codes for the AWGN channel. ITW 2004: 348-352 - [c45]Pierre Moulin, Ying Wang:
Error exponents for channel coding with side information. ITW 2004: 353-358 - [c44]Ying Wang, Pierre Moulin:
Steganalysis of block-structured stegotext. Security, Steganography, and Watermarking of Multimedia Contents 2004: 477-488 - [i1]Pierre Moulin, Ying Wang:
Error Exponents for Channel Coding with Side Information. CoRR cs.IT/0410003 (2004) - 2003
- [j29]Jong Chul Ye, Yoram Bresler, Pierre Moulin:
Cramer-Rao bounds for parametric shape estimation in inverse problems. IEEE Trans. Image Process. 12(1): 71-84 (2003) - [j28]Pierre Moulin, Joseph A. O'Sullivan:
Information-theoretic analysis of information hiding. IEEE Trans. Inf. Theory 49(3): 563-593 (2003) - [j27]Prakash Ishwar, Pierre Moulin:
On the equivalence of set-theoretic and maxent MAP estimation. IEEE Trans. Signal Process. 51(3): 698-713 (2003) - [j26]Ali N. Akansu, Edward J. Delp, Ton Kalker, Bede Liu, Nasir D. Memon, Pierre Moulin, Ahmed H. Tewfik:
Guest editorial special issue on signal processing for data hiding in digital media and secure content delivery. IEEE Trans. Signal Process. 51(4): 897 (2003) - [j25]Pierre Moulin, Aleksandar Ivanovic:
The zero-rate spread-spectrum watermarking game. IEEE Trans. Signal Process. 51(4): 1098-1117 (2003) - [c43]Soumya Jana, Pierre Moulin:
Optimal Transform Coding of Gaussian Mixtures for Joint Classification/Reconstruction. DCC 2003: 313-322 - [c42]Alexia Briassouli, Pierre Moulin:
Detection-theoretic analysis of warping attacks in spread-spectrum watermarking. ICASSP (3) 2003: 53-56 - [c41]Tie Liu, Pierre Moulin:
Error exponents for one-bit watermarking. ICASSP (3) 2003: 65-68 - 2002
- [j24]Jong Chul Ye, Yoram Bresler, Pierre Moulin:
A Self-Referencing Level-Set Method for Image Reconstruction from Sparse Fourier Samples. Int. J. Comput. Vis. 50(3): 253-270 (2002) - [j23]Avinash Jain, Pierre Moulin, Michael I. Miller, Kannan Ramchandran:
Information-Theoretic Bounds on Target Recognition Performance Based on Degraded Image Data. IEEE Trans. Pattern Anal. Mach. Intell. 24(9): 1153-1166 (2002) - [j22]Pierre Moulin, Mehmet Kivanç Mihçak:
A framework for evaluating the data-hiding capacity of image sources. IEEE Trans. Image Process. 11(9): 1029-1042 (2002) - [c40]Pierre Moulin, Michael T. Orchard:
Undergraduate education in image and video processing. ICASSP 2002: 4157-4158 - [c39]Pierre Moulin, Alexia Briassouli, Henrique S. Malvar:
Detection-theoretic analysis of desynchronization attacks in watermarking. DSP 2002: 77-84 - [c38]Mehmet Kivanç Mihçak, Pierre Moulin:
Information embedding codes matched to locally stationary Gaussian image models. ICIP (2) 2002: 137-140 - [c37]Natalia A. Schmid, Yoram Bresler, Pierre Moulin:
Complexity regularized shape estimation from noisy Fourier data. ICIP (2) 2002: 453-456 - [c36]Pierre Moulin, Aleksandar Ivanovic:
Nonadditive Gaussian watermarking and its application to wavelet-based image watermarking. ICIP (3) 2002: 473-476 - [c35]Jong Chul Ye, Yoram Bresler, Pierre Moulin:
Cramer-Rao bounds for parametric shape estimation. ICIP (2) 2002: 473-476 - [c34]Pierre Moulin:
Information-Hiding Games. IWDW 2002: 1-12 - 2001
- [j21]Pierre Moulin:
The role of information theory in watermarking and its application to image watermarking. Signal Process. 81(6): 1121-1139 (2001) - [j20]Juan Liu, Pierre Moulin:
Complexity-regularized image denoising. IEEE Trans. Image Process. 10(6): 841-851 (2001) - [j19]Juan Liu, Pierre Moulin:
Information-theoretic analysis of interscale and intrascale dependencies between image wavelet coefficients. IEEE Trans. Image Process. 10(11): 1647-1658 (2001) - [j18]Mehmet Kivanç Mihçak, Pierre Moulin, Mihai Anitescu, Kannan Ramchandran:
Rate-distortion-optimal subband coding without perfect-reconstruction constraints. IEEE Trans. Signal Process. 49(3): 542-557 (2001) - [c33]Juan Liu, Pierre Moulin:
Statistical image restoration based on adaptive wavelet models. ICIP (2) 2001: 21-24 - [c32]Jong Chul Ye, Yoram Bresler, Pierre Moulin:
A self-referencing level-set method for image reconstruction from sparse Fourier samples. ICIP (2) 2001: 33-36 - [c31]Pierre Moulin, Aleksandar Ivanovic:
The Fisher information game for optimal design of synchronization patterns in blind watermarking. ICIP (2) 2001: 550-553 - [c30]Juan Liu, Pierre Moulin:
Approximation-theoretic analysis of translation invariant wavelet expansions. ICIP (1) 2001: 622-625 - [c29]Pierre Moulin, Aleksandar Ivanovic:
Game-theoretic analysis of watermark detection. ICIP (3) 2001: 975-978 - 2000
- [j17]Prakash Ishwar, Pierre Moulin:
On spatial adaptation of motion-field smoothness in video coding. IEEE Trans. Circuits Syst. Video Technol. 10(6): 980-989 (2000) - [j16]Donald L. Snyder, Alfred O. Hero III, Pierre Moulin, José M. F. Moura, Joseph A. O'Sullivan:
Introduction to the special issue on information-theoretic imaging. IEEE Trans. Inf. Theory 46(5): 1709-1713 (2000) - [j15]Pierre Moulin, Juan Liu:
Statistical imaging and complexity regularization. IEEE Trans. Inf. Theory 46(5): 1762-1777 (2000) - [j14]Jong Chul Ye, Yoram Bresler, Pierre Moulin:
Asymptotic global confidence regions in parametric shape estimation problems. IEEE Trans. Inf. Theory 46(5): 1881-1895 (2000) - [j13]Pierre Moulin, Mihai Anitescu, Kannan Ramchandran:
Theory of rate-distortion-optimal, constrained filterbanks-application to IIR and FIR biorthogonal designs. IEEE Trans. Signal Process. 48(4): 1120-1132 (2000) - [c28]Prakash Ishwar, Pierre Moulin:
Fundamental equivalences between set-theoretic and maximum-entropy methods in multiple-domain image restoration. ICASSP 2000: 161-164 - [c27]Jong Chul Ye, Yoram Bresler, Pierre Moulin:
Global confidence regions in parametric shape estimation. ICASSP 2000: 3180-3183 - [c26]Pierre Moulin, Joseph A. O'Sullivan:
Information-theoretic analysis of watermarking. ICASSP 2000: 3630-3633 - [c25]Juan Liu, Pierre Moulin:
Complexity-Regularized Denoising of Poisson-Corrupted Data. ICIP 2000: 254-257 - [c24]Prakash Ishwar, Pierre Moulin:
Shift Invariant Restoration - an Overcomplete Maxent Map Framework. ICIP 2000: 270-272 - [c23]Mehmet Kivanç Mihçak, Anthony F. Docimo, Pierre Moulin, Kannan Ramchandran:
Design and Analysis of a Forward-Adaptive Wavelet Image Coder. ICIP 2000: 649-652 - [c22]Ramarathnam Venkatesan, S.-M. Koon, Mariusz H. Jakubowski, Pierre Moulin:
Robust Image Hashing. ICIP 2000: 664-666 - [c21]Pierre Moulin, Mehmet Kivanç Mihçak, Gen-Iu. Lin:
An Information-Theoretic Model for Image Watermarking and Data Hiding. ICIP 2000: 667-670 - [c20]Juan Liu, Pierre Moulin:
Analysis of Interscale and Intrascale Dependencies between Image Wavelet Coefficients. ICIP 2000: 669-672 - [c19]Soumya Jana, Pierre Moulin:
Optimal Design of Transform Coders and Quantizers for Image Classification. ICIP 2000: 841-844
1990 – 1999
- 1999
- [j12]Mehmet Kivanç Mihçak, Igor Kozintsev, Kannan Ramchandran, Pierre Moulin:
Low-complexity image denoising based on statistical modeling of wavelet coefficients. IEEE Signal Process. Lett. 6(12): 300-303 (1999) - [j11]Ravi Krishnamurthy, John W. Woods, Pierre Moulin:
Frame interpolation and bidirectional prediction of video using compactly encoded optical-flow fields and label fields. IEEE Trans. Circuits Syst. Video Technol. 9(5): 713-726 (1999) - [j10]Pierre Moulin, Juan Liu:
Analysis of Multiresolution Image Denoising Schemes Using Generalized Gaussian and Complexity Priors. IEEE Trans. Inf. Theory 45(3): 909-919 (1999) - [j9]Vladimir Pavlovic, Pierre Moulin, Kannan Ramchandran:
An integrated framework for adaptive subband image coding. IEEE Trans. Signal Process. 47(4): 1024-1038 (1999) - [c18]Prakash Ishwar, Pierre Moulin:
Multiple-Domain Image Modeling and Restoration. ICIP (1) 1999: 362-366 - [c17]Juan Liu, Pierre Moulin:
Image Denoising Based on Scale-Space Mixture Modeling of Wavelet Coefficients. ICIP (1) 1999: 386-390 - 1998
- [j8]Pierre Moulin, Mehmet Kivanç Mihçak:
Theory and design of signal-adapted FIR paraunitary filter banks. IEEE Trans. Signal Process. 46(4): 920-929 (1998) - [c16]Prakash Ishwar, Krishna Ratakonda, Pierre Moulin, Narendra Ahuja:
Image denoising using multiple compaction domains. ICASSP 1998: 1889-1892 - [c15]Mehmet Kivanç Mihçak, Kannan Ramchandran, Pierre Moulin:
Adaptive Wavelet Packet Image Coding using an Estimation-Quantization Framework. ICIP (1) 1998: 92-96 - [c14]Juan Liu, Pierre Moulin:
Complexity-Regularized Image Restoration. ICIP (1) 1998: 555-559 - 1997
- [j7]Pierre Moulin, Ravi Krishnamurthy, John W. Woods:
Multiscale modeling and estimation of motion fields for video coding. IEEE Trans. Image Process. 6(12): 1606-1620 (1997) - [j6]Pierre Moulin, Mihai Anitescu, Kenneth O. Kortanek, Florian A. Potra:
The role of linear semi-infinite programming in signal-adapted QMF bank design. IEEE Trans. Signal Process. 45(9): 2160-2174 (1997) - [c13]Juan Liu, Pierre Moulin:
Complexity-Regularized Image Denoising. ICIP (2) 1997: 370-373 - [c12]Prakash Ishwar, Pierre Moulin:
Switched control grid interpolation for motion compensated video coding. ICIP (3) 1997: 650-653 - 1996
- [c11]Pierre Moulin, Mihai Anitescu, Kenneth O. Kortanek, Florian A. Potra:
Design of signal-adapted FIR paraunitary filter banks. ICASSP 1996: 1519-1522 - [c10]Pierre Moulin, Kannan Ramchandran, Vladimir Pavlovic:
Transform image coding based on joint adaptation of filter banks and tree structures. ICIP (2) 1996: 369-372 - [c9]Ravi Krishnamurthy, Pierre Moulin, John W. Woods:
Multiscale motion estimation for scalable video coding. ICIP (1) 1996: 965-968 - 1995
- [j5]Pierre Moulin:
A multiscale relaxation algorithm for SNR maximization in nonorthogonal subband coding. IEEE Trans. Image Process. 4(9): 1269-1281 (1995) - [c8]Pierre Moulin:
A new look at signal-adapted QMF bank design. ICASSP 1995: 1312-1315 - [c7]Ravi Krishnamurthy, Pierre Moulin, John W. Woods:
Optical flow techniques applied to video coding. ICIP 1995: 570-573 - 1994
- [j4]Pierre Moulin:
Wavelet thresholding techniques for power spectrum estimation. IEEE Trans. Signal Process. 42(11): 3126-3136 (1994) - [c6]Pierre Moulin:
A Relaxation Algorithm for Minimizing the L2 Reconstruction Error in 2-D Nonorthogonal Subband Coding. ICIP (2) 1994: 908-912 - 1993
- [j3]Pierre Moulin:
A wavelet regularization method for diffuse radar-target imaging and speckle-noise reduction. J. Math. Imaging Vis. 3(1): 123-134 (1993) - [c5]Pierre Moulin:
Optimal L2 approximation of images in nonorthogonal multiresolution bases. ICASSP (5) 1993: 189-192 - [c4]Pierre Moulin, Alexander C. Loui:
Application of a multiresolution optical-flow-based method for motion estimation to video coding. ISCAS 1993: 1-4 - 1992
- [j2]Joseph A. O'Sullivan, Donald L. Snyder, Donald G. Porter, Pierre Moulin:
An application of splines to maximum likelihood radar imaging. Int. J. Imaging Syst. Technol. 4(4): 256-264 (1992) - [j1]Pierre Moulin, Joseph A. O'Sullivan, Donald L. Snyder:
A method of sieves for multiresolution spectrum estimation and radar imaging. IEEE Trans. Inf. Theory 38(2): 801-813 (1992) - [c3]Pierre Moulin:
An adaptive spline method for signal restoration. ICASSP 1992: 169-172 - [c2]Pierre Moulin:
An adaptive finite-element method for image representation. ICPR (3) 1992: 70-74
1980 – 1989
- 1989
- [c1]Joseph A. O'Sullivan, Donald L. Snyder, Pierre Moulin:
The role of spectrum estimation in forming high-resolution radar images. ICASSP 1989: 2365-2367
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
