Results 241 to 250 of about 65,471 (302)

YOLO11-SBS: leveraging ACE and ORCM to gauge robust and accurate apple counting in complex orchards. [PDF]

Front Plant Sci
Zhang L, Wang H, Zhang J, Su Y, Yao R, Liu J, Jia A, Liu J, Hu J.   +8 more
europepmc   +1 more source

Sub-mV tunable photonic p-bits for probabilistic computing. [PDF]

Sci Adv
Seo J, Park T, Park JY, Lee HK, Park JY, Shin W, Han JK, Yoo H.   +7 more
europepmc   +1 more source

MscaVPR: Multi-Scale Coordinate Attention Network for Robust Visual Place Recognition. [PDF]

Sensors (Basel)
Gao X, Zhong Z, Tan Y, Jing N, Yang A, Jia Q.   +5 more
europepmc   +1 more source

Multi-Path Interference Challenges and Suggested Solution for Correlation-Assisted Direct Time-of-Flight. [PDF]

Sensors (Basel)
Morsy A, Blinder D, Kuijk M.
europepmc   +1 more source

Biomimetic All-Wood Sponge for the Co-Generation of Adsorption-Based Atmospheric Water Harvesting and Hydrovoltaic Power Generation. [PDF]

Research (Wash D C)
Ma H, Li S, Wang S, Yang W, Han J.
europepmc   +1 more source

DeepLayer-ID: A Lightweight Multi-Domain Forensic Framework for Real-Time Deepfake Detection in Resource-Constrained UAV Sensor Platforms. [PDF]

Sensors (Basel)
Alshammari NH, Alshammari SA.
europepmc   +1 more source

Radiosity and global illumination.

, 1994
Francois Sillion and Claude Puech have provided a superb book on the simulation of global illumination in computer graphics. Specifically, the authors deal with the radiosity method and Monte Carlo techniques. The authors place a far greater emphasis on the radiosity method, devoting just a short portion of the text to Monte Carlo approaches.
Sillion, François X., Puech, Claude
openaire   +3 more sources

Simplification of Global‐Illumination Meshes

Computer Graphics Forum, 1996
AbstractWe present a methodfor simplifying the meshes produced as solutions to global illumination problems, reducing geometric complexity while retaining the perceived imagefidelity. The method has been applied to produce meshes of linearly, quadratically and cubically colour‐interpolated triangles.
Merlin Hughes, Anselmo Lastra, Edward Saxe   +2 more
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Clustering for glossy global illumination

ACM Transactions on Graphics, 1997
We present a new clustering algorithm for global illumination in complex environments. The new algorithm extends provious work on clustering for radiosity to allow for nondiffuse (glossy) reflectors. We represent clusters as points with directional distributions of outgoing and incoming radiance and importance, and we derive an error bound for ...
Dani Lischinski, David H Salesin, Lischinskidani   +2 more
exaly   +2 more sources