Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. Artificial Intelligence Lab Publications
  4. AI Memos (1959 - 2004)
  5. Regularization Theory and Shape Constraints

Regularization Theory and Shape Constraints

Thumbnail Image
Download
Name

AIM-916.pdf

Size

1.08 MB

Format

Adobe PDF

Checksum (MD5)

3d4becd017e3338fef17cda9f1e749f7

Thumbnail Image
Download
Name

AIM-916.ps

Size

2.84 MB

Format

PostScript

Checksum (MD5)

742009180f33149c1c6d283f4df14524

Author(s)
Verri, Alessandro
•
Poggio, Tomaso
Date Issued
September 1, 1986
Series/Report no.
AIM-916
Abstract
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.
Subjects
regularization
early vision
constraints
mathematicalsprogramming
Persistent DSpace Link
http://hdl.handle.net/1721.3/5513
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.