Information-Theoretic Refinement Criteria for Image Synthesis : An Intersection between Computer Graphics, Information Theory, and Complexity (2008. 208 S. 220 mm)

個数:

Information-Theoretic Refinement Criteria for Image Synthesis : An Intersection between Computer Graphics, Information Theory, and Complexity (2008. 208 S. 220 mm)

  • オンデマンド(OD/POD)版です。キャンセルは承れません。

  • オンデマンド(OD/POD)版です。キャンセルは承れません。
  • ≪洋書のご注文について≫ 「海外取次在庫あり」「国内在庫僅少」および「国内仕入れ先からお取り寄せいたします」表示の商品でもクリスマス前(12/20~12/25)および年末年始までにお届けできないことがございます。あらかじめご了承ください。

  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Paperback:紙装版/ペーパーバック版/ページ数 208 p.
  • 商品コード 9783836477314

Description


(Text)
This work is framed within the context of computer graphics starting out from the intersection of three fields: rendering, information theory, and complexity.Initially, the concept of scene complexity is analysed from a geometric visibility point of view. Then, the main focus of this dissertation, the development of new refinement criteria for the global illumination problem is presented.Firstly, based on Shannon entropy, a set of pixel measures are defined. They are applied to supersampling in ray-tracing as refinement criteria, obtaining a new entropy-based adaptive sampling algorithm with a high rate quality versus cost. Secondly, based on Harvda-Charvát-Tsallis generalised entropy, new refinement criteria are defined for hierarchical radiosity. Oracles based on transported information, information smoothness, and mutual information are presented, with very significant results for the latter. And finally, three f-divergences are analysed as refinement criteria.These measures give us a rich variety of efficient and highly discriminative measures which are applicable to rendering in its pixel-driven (ray-tracing) and object-space (hierarchical radiosity) approaches.
(Text)
This work is framed within the context of computer graphics starting out from the intersection of three fields: rendering, information theory, and complexity.
Initially, the concept of scene complexity is analysed from a geometric visibility point of view. Then, the main focus of this dissertation, the development of new refinement criteria for the global illumination problem is presented.
Firstly, based on Shannon entropy, a set of pixel measures are defined. They are applied to supersampling in ray-tracing as refinement criteria, obtaining a new entropy-based adaptive sampling algorithm with a high rate quality versus cost. Secondly, based on Harvda-Charvát-Tsallis generalised entropy, new refinement criteria are defined for hierarchical radiosity. Oracles based on transported information, information smoothness, and mutual information are presented, with very significant results for the latter. And finally, three f-divergences are analysed as refinement criteria.
These measures give us a rich variety of efficient and highly discriminative measures which are applicable to rendering in its pixel-driven (ray-tracing) and object-space (hierarchical radiosity) approaches.
(Author portrait)
Jaume Rigau Vilalta Jaume Rigau is associate professor in Computer Science and member of the Graphics and Imaging Laboratory at the University of Girona, Spain. His research is based on the application of information theory to computer graphics and image processing. Rigau received the MS and PhD in Computer Science from the Technical University of Catalonia, Barcelona, Spain.

最近チェックした商品