<p> Many problems in image and video processing may be formulated in the language of constrained optimization. Algorithms for solving general constrained optimization problems may not guarantee solutions or be computationally efficient, particularly if the problem is nonlinear or non-convex. Oftentimes these constrained optimization problems may be relaxed into the form of a convex problem. This allows for the use of convex solvers such as the Augmented Lagrangian method and the Split Bregman iteration. In this thesis, we will study the advantages of incorporating convexity into constrained optimization problems. These problems will be motivated from the standpoint of hyperspectral image processing, particularly the detection and identification of airborne chemicals in gas cloud releases. </p>
| Identifer | oai:union.ndltd.org:PROQUEST/oai:pqdtoai.proquest.com:1527552 |
| Date | 23 April 2014 |
| Creators | Gerhart, Torin |
| Publisher | California State University, Long Beach |
| Source Sets | ProQuest.com |
| Language | English |
| Detected Language | English |
| Type | thesis |
Page generated in 0.0059 seconds