arXiv (All)
open access
Blind Deconvolution with Non-smooth Regularization via Bregman Proximal DCAs
Blind deconvolution is a technique to recover an original signal without knowing a convolving filter. It is naturally formulated as a minimization of a quartic objective function under some assumption. Because its differentiable part does not have a Lipschitz continuous gradient, existing first-orde
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Convolution Regularization Preserves the $L^2$-Estimate Property for $(1,n)$-Forms#1035298
- Sequential Detection-Based Iterative Blind Separation for Single-Channel Co-Frequency Signals#998820
- RESTORE: REal-time Steerable Music resTORation and bandwidth Extension via stem disentanglement#1076339
- Entangled measurements are necessary for optimal tomography of mixed fermionic Gaussian states and of bosonic Gaussian states near the vacuum#1048933
- Is blindsight possible under signal detection theory? Comment on Phillips (2021)#753453
Record · ID 1128476
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive