DSpace Repository

Regularization Theory and Shape Constraints

Show simple item record

dc.creator Verri, Alessandro
dc.creator Poggio, Tomaso
dc.date 2004-08-31T18:12:08Z
dc.date 2004-08-31T18:12:08Z
dc.date 1986-09-01
dc.date.accessioned 2013-10-09T02:39:54Z
dc.date.available 2013-10-09T02:39:54Z
dc.date.issued 2013-10-09
dc.identifier AIM-916
dc.identifier http://hdl.handle.net/1721.3/5513
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description Many problems of early vision are ill-posed; to recover unique stable solutions regularization techniques can be used. These techniques lead to meaningful results, provided that solutions belong to suitable compact sets. Often some additional constraints on the shape or the behavior of the possible solutions are available. This note discusses which of these constraints can be embedded in the classic theory of regularization and how, in order to improve the quality of the recovered solution. Connections with mathematical programming techniques are also discussed. As a conclusion, regularization of early vision problems may be improved by the use of some constraints on the shape of the solution (such as monotonicity and upper and lower bounds), when available.
dc.format 23 p.
dc.format 2974510 bytes
dc.format 1134203 bytes
dc.format application/postscript
dc.format application/pdf
dc.language en_US
dc.relation AIM-916
dc.subject regularization
dc.subject early vision
dc.subject constraints
dc.subject mathematicalsprogramming
dc.title Regularization Theory and Shape Constraints


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account