Frame Scaling by Graphs
Ayyanar K, P. Sam Johnson, A. Senthil Thilak

TL;DR
This paper explores how to determine the scalability of frames in Euclidean spaces using graph theory, providing necessary conditions and analyzing special frame classes.
Contribution
It introduces a graph-based approach to test frame scalability and investigates specific classes of frames with this method.
Findings
Graph association helps verify frame scalability.
Necessary conditions for frame scalability are established.
Analysis of special frame classes using graphs.
Abstract
In this paper, we investigate the scalability of a given frame in by using graphs. For each frame in , we associate a simple undirected graph and use it to verify the scalability of . We provide some necessary conditions to test the scalability of a given frame. Finally, we study the scalability of some special classes of frames by using graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsIndustrial Vision Systems and Defect Detection · Manufacturing Process and Optimization · Handwritten Text Recognition Techniques
