Digital Circlism as Algorithmic Art

详细信息    查看全文

• 作者：Sourav De ; Partha Bhowmick
• 关键词：Algorithmic art ; circle packing ; digital art ; digital circlism ; stylized rendition
• 刊名：Lecture Notes in Computer Science
• 出版年：2013
• 出版时间：2013
• 年：2013
• 卷：8033
• 期：1
• 页码：79-86
• 全文大小：2050KB
• 参考文献：1. Chipp, H.B.: Theories of Modern Art (A Source Book by Artists and Critics). California Studies in the History of Art (1996)
  2. http://www.circlism.com
  3. http://benheine.deviantart.com/gallery/30782139/
  4. http://www.flickr.com/photos/benheine/sets/72157623553428960
  5. http://www.trendhunter.com/trends/ben-heine1
  6. Comaniciu, D., Meer, P.: Mean shift: A robust approach toward feature space analysis. IEEE Trans. PAMI?24, 603-19 (2002) CrossRef
  7. Fairchild, M.D.: Color Appearance Models. Addison-Wesley (1998)
  8. Tao, W., Jin, H., Zhang, Y.: Color image segmentation based on mean shift and normalized cuts. IEEE Trans. SMC, Part B?37, 1382-389 (2007)
  9. Demaine, E.D., Fekete, S.P., Lang, R.J.: Circle packing for origami design is hard, 1-7 (2010), http://arxiv.org/abs/1008.1224
  10. Melissen, J.: Packing 16, 17 or 18 circles in an equilateral triangle. Discrete Mathematics?145, 333-42 (1995) CrossRef
  11. http://paulbourke.net/texture_colour/randomtile
  12. Jain, A.: Fundamentals of Digital Image Processing. Prentice-Hall,
  13. Shallit, J.: What this country needs is an 18c piece. Mathematical Intelligencer?25, 20-3 (2003) CrossRef
  14. McCamy, C.S., Marcus, H., Davidson, J.G.: A color-rendition chart. Journal of Applied Photographic Engineering?2, 95-9 (1976)
  
• 作者单位：Sourav De (28)
  Partha Bhowmick (28)
  
  28. Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India
  
• ISSN：1611-3349

文摘

We present here an algorithmic solution to digital circlism, which is a contemporary rendition style in the media of digital art. The algorithmic artwork is processed within a few minutes by our algorithm, which makes it computationally attractive in comparison with its manual counterpart that requires tremendous diligence and apt craftsmanship throughout its hour-long processing. We show how the problem is mapped to circle packing in discrete space, once the segmentation is done. A greedy technique similar to the dynamic programming approach for solving the coin denomination problem is used to achieve the packing result. To aid the greedy technique, progressive Euclidean distance transform is resorted?to. Variability of the denomination set and color rendition based on mapping the original color range to Macbeth color chart add to its further appeal. Results on different kinds of images speak about further possibilities of this new style of algorithmic art.