Abstract

A (unit norm) frame is scalable if its vectors can be rescaled so as to result into a tight frame. Tight frames can be considered optimally conditioned because the condition number of their frame operators is unity. In this paper we reformulate the scalability problem as a convex optimization question. In particular, we present examples of various formulations of the problem along with numerical results obtained by using our methods on randomly generated frames.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call