1 / 14

Nonlinear Revision Control for Images

This paper presents a novel approach using directed acyclic graphs to manage image revisions effectively. By incorporating visual importance values and content differences, the system provides a meaningful display of revision history and intuitive controls. The algorithms proposed prioritize efficient storage and preserve vital semantic information. The system, integrated into GIMP, offers a specialized tool for managing image revisions with minimal storage consumption. While the focus is on images, the principles are extendable to other binary graphics assets like videos, meshes, and animation data.

ewillson
Download Presentation

Nonlinear Revision Control for Images

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Nonlinear Revision Control for Images SigGraph 2011 Chun-Fa Chang National Taiwan University Li-Yi Wei Microsoft Research Hsiang-Ting Chen National TsingHua University

  2. Outline • Abstract • Directed acyclic graph(DAG) • Algorithms • Result • Conclusion

  3. Abstract • Existing strategies such as storing whole files for individual revisions or simple binary deltas could consume significant storage and obscure vital semantic information. • Provides not only as a meaningful display of the revision history but also an intuitive interface for common revision control operations

  4. Directed Acyclic Graph • A directed acyclic graph is a directed graph with no directed cycles . • The corresponding concept for undirected graphs is a forest , an undirected graph without cycles. Choosing an orientation for a forest produces a special kind of directed acyclic graph called a Polytree.

  5. Algorithms

  6. Algorithms v(n)：Visual importance value v of a DAG node n A(n,m)：Action content I(n,m)： Image content difference m： neighboring node of n in DAG within distance w

  7. Algorithms

  8. Result

  9. Result

  10. Result

  11. Result

  12. Result

  13. Conclusion • Our current implementation is that it is integrated into a single tool (GIMP) instead of a general mechanism that can work with arbitrary image editing softwares. • Our current prototype system is implemented primarily for a single user as it is the predominant usage scenario for current artistic workflows. • In this paper we focused mainly on images, but we believe similarprinciples are applicable to other binary graphics assets, such asvideos, meshes, or animation data.

  14. Thanks for your listen

More Related