Please use this identifier to cite or link to this item:
|Title:||THE CONVEX GEOMETRY OF ALIGNMENT PROBLEMS||Authors:||CHEN JUNYU||ORCID iD:||orcid.org/0000-0001-8828-2716||Keywords:||Alignment Problems, Recovery Conditions||Issue Date:||21-Apr-2022||Citation:||CHEN JUNYU (2022-04-21). THE CONVEX GEOMETRY OF ALIGNMENT PROBLEMS. ScholarBank@NUS Repository.||Abstract:||The alignment problem, which aims at finding the correspondence between two signals, appears in applications in various disciplines. In our work, we propose a new two-stage method to solve the problems of this type. We provide the convex formulation of the general alignment problem and study the theoretical guarantee for the exact and approximate recovery.||URI:||https://scholarbank.nus.edu.sg/handle/10635/230687|
|Appears in Collections:||Master's Theses (Open)|
Show full item record
Files in This Item:
|ChenJY.pdf||1.06 MB||Adobe PDF|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.