AI帮你理解科学
An Iterated L1 Algorithm for Non-smooth Non-convex Optimization in Computer Vision
Computer Vision and Pattern Recognition, no. 1 (2013): 1759-1766
EI WOS
摘要
Natural image statistics indicate that we should use non-convex norms for most regularization tasks in image processing and computer vision. Still, they are rarely used in practice due to the challenge to optimize them. Recently, iteratively reweighed ℓ1 minimization has been proposed as a way to tackle a class of non-convex functions by ...更多
代码:
数据:
标签
评论
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn