All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Multiple importance sampling revisited: breaking the bounds

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F18%3A00320743" target="_blank" >RIV/68407700:21230/18:00320743 - isvavai.cz</a>

  • Result on the web

    <a href="https://link.springer.com/article/10.1186/s13634-018-0531-2" target="_blank" >https://link.springer.com/article/10.1186/s13634-018-0531-2</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1186/s13634-018-0531-2" target="_blank" >10.1186/s13634-018-0531-2</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Multiple importance sampling revisited: breaking the bounds

  • Original language description

    We revisit the multiple importance sampling (MIS) estimator and investigate the bound on the efficiency improvement over balance heuristic estimator with equal count of samples established in Veach's thesis. We revise the proof for this and come to the conclusion that there is no such bound and henceforth it makes sense to look for new estimators that improve on balance heuristic estimator with equal count of samples. Next, we examine a recently introduced non-balance heuristic MIS estimator that is provably better than balance heuristic with equal count of samples, and we improve it both in variance and efficiency. We then obtain an equally provably better one-sample balance heuristic estimator, and finally, we introduce a heuristic for the count of samples that can be used when the individual techniques are biased. All in all, we present three new sampling strategies to improve on both variance and efficiency on the balance heuristic using non-equal count of samples.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA14-19213S" target="_blank" >GA14-19213S: On-site acquisition, compression and rendering of spatially varying surface reflectances</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2018

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    EURASIP Journal on Advances in Signal Processing

  • ISSN

    1687-6180

  • e-ISSN

    1687-6180

  • Volume of the periodical

    2018

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    CH - SWITZERLAND

  • Number of pages

    12

  • Pages from-to

    7373-7384

  • UT code for WoS article

    000426480300002

  • EID of the result in the Scopus database

    2-s2.0-85042676784