[ { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/we23b-y0760", "eprint_id": 73008, "eprint_status": "archive", "datestamp": "2023-08-19 17:10:05", "lastmod": "2023-10-24 14:57:13", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Stumpfel-Jessi", "name": { "family": "Stumpfel", "given": "Jessi" } }, { "id": "Arvo-J-R", "name": { "family": "Arvo", "given": "James" } }, { "id": "Novins-Kevin", "name": { "family": "Novins", "given": "Kevin" } } ] }, "title": "Geometric anticipation: assisting users in 2D layout tasks", "ispublished": "unpub", "full_text_status": "public", "keywords": "Algorithms, Anticipatory interface, computer interface, eager recognition, fluid motion", "note": "Copyright is held by the author/owner.\n\n
Published - p345-stumpfel.pdf
", "abstract": "We describe an experimental interface that anticipates a user's intentions and accommodates predicted changes in advance. Our canonical example is an interactive version of ``magnetic poetry'' in which rectangular blocks containing single words can be juxtaposed to form arbitrary sentences or ``poetry.'' The user can rearrange the blocks at will, forming and dissociating word sequences. A crucial attribute of the blocks in our system is that they anticipate insertions and gracefully rearrange themselves in time to make space for a new word or phrase. The challenges in creating such an interface are three fold: 1) the user's intentions must be inferred from noisy input, 2) arrangements must be altered smoothly and intuitively in response to anticipated changes, and 3) new and changing goals must be handled gracefully at any time, even in mid animation. We describe a general approach for handling the dynamic creation and deletion of organizational goals. Fluid motion is achieved by continually applying and correcting goal-directed forces to the objects. Future applications of this idea include the manipulation of text and graphical elements within documents and the manipulation of symbolic information such as equations.", "date": "2006-01", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "345-347", "id_number": "CaltechAUTHORS:20161220-151809855", "isbn": "1-59593-287-9", "book_title": "IUI '06 Proceedings of the 11th international conference on Intelligent user interfaces", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161220-151809855", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "contributors": { "items": [ { "id": "Edmonds-E", "name": { "family": "Edmonds", "given": "Ernest" } }, { "id": "Riecken-D", "name": { "family": "Riecken", "given": "Doug" } } ] }, "doi": "10.1145/1111449.1111532", "primary_object": { "basename": "p345-stumpfel.pdf", "url": "https://authors.library.caltech.edu/records/we23b-y0760/files/p345-stumpfel.pdf" }, "resource_type": "book_section", "pub_year": "2006", "author_list": "Stumpfel, Jessi; Arvo, James; et el." }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/n5cvt-77741", "eprint_id": 26822, "eprint_status": "archive", "datestamp": "2023-08-19 05:14:42", "lastmod": "2023-10-24 16:37:04", "type": "monograph", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chen-Min", "name": { "family": "Chen", "given": "Min" } }, { "id": "Arvo-J-R", "name": { "family": "Arvo", "given": "James" } } ] }, "title": "Closed-Form Expressions for Irradiance from Non-Uniform Lambertian Luminaires Part I: Linearly-Varying Radiant Exitance", "ispublished": "unpub", "full_text_status": "public", "keywords": "Illumination, Rendering, Radiosity, Solid Angle, Irradiance, Monte Carlo", "note": "\u00a9 2000 California Institute of Technology. \n\nThis work was supported by a Microsoft Research Fellowship and NSF Career Award CCR9876332.\n\nSubmitted - CSTR2000.pdf
Submitted - postscript.ps
", "abstract": "We present a closed-form expression for the irradiance at a point on a surface due to an arbitrary polygonal Lambertian lurninaire with linearly-varying radiant exitance. The solution consists of elementary functions and a single well-behaved special function that can be either approximated directly or computed exactly in terms of classical special functions such as Clausen's integral or the closely related dilogarithm. We first provide a general boundary integral that applies to all planar luminaires and then derive the closed-form expression that applies to arbitrary polygons, which is the result most relevant for global illumination. Our approach is to express the problem as an integral of a simple class of rational functions over regions of the sphere, and to convert the surface integral to a boundary integral using a generalization of irradiance tensors. The result extends the class of available closed-form expressions for computing direct radiative transfer from finite areas to differential areas. We provide an outline of the derivation, a detailed proof of the resulting formula, and complete pseudo-code of the resulting algorithm. Finally, we demonstrate the validity of our algorithm by comparison with Monte Carlo. While there are direct applications of this work, it is primarily of theoretical interest as it introduces much of the machinery needed to derive closed-form solutions for the general case of luminaires with radiance distributions that vary polynomially in both position and direction.", "date": "2001-04-25", "date_type": "published", "publisher": "California Institute of Technology", "id_number": "CaltechCSTR:2000.cs-tr-00-01", "official_url": "https://resolver.caltech.edu/CaltechCSTR:2000.cs-tr-00-01", "rights": "You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.", "funders": { "items": [ { "agency": "Microsoft Research" }, { "agency": "NSF", "grant_number": "CCR-9876332" } ] }, "local_group": { "items": [ { "id": "Computer-Science-Technical-Reports" } ] }, "doi": "10.7907/Z92805MQ", "primary_object": { "basename": "CSTR2000.pdf", "url": "https://authors.library.caltech.edu/records/n5cvt-77741/files/CSTR2000.pdf" }, "related_objects": [ { "basename": "postscript.ps", "url": "https://authors.library.caltech.edu/records/n5cvt-77741/files/postscript.ps" } ], "resource_type": "monograph", "pub_year": "2001", "author_list": "Chen, Min and Arvo, James" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/epsbd-9q996", "eprint_id": 26824, "eprint_status": "archive", "datestamp": "2023-08-19 05:56:54", "lastmod": "2023-10-24 16:37:10", "type": "monograph", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chen-Min", "name": { "family": "Chen", "given": "Min" } }, { "id": "Arvo-J-R", "name": { "family": "Arvo", "given": "James" } } ] }, "title": "Closed-Form Expressions for Irradiance from Non-Uniform Lambertian Luminaires Part II: Polynomially-Varying Radiant Exitance", "ispublished": "unpub", "full_text_status": "public", "keywords": "Illumination, Rendering, Radiosity, Irradiance Tensor, Angular Moment, Spatially Varying Luminaire", "note": "\u00a9 2000 California Institute of Technology. \n\nJune 19, 2000. \n\nThis work was supported by a Microsoft Research Fellowship and NSF Career Award CCR9876332.\n\nSubmitted - CSTR2000.pdf
Submitted - postscript.ps
", "abstract": "We present new analytical techniques for computing illumination from non-uniform luminaires. The methods are based on new closed-form expressions derived by generalizing the concepts of irradiance tensor and angular moment to rational forms and an arbitrary number of directions, known as rational irradiance tensors and rational angular moments, respectively. The techniques apply to any emission, reflection or transmission distribution expressed as a polynomial over a polygonal surface, and provide a powerful mathematical tool to handle more complex BRDF's. We derive closed-form expressions for irradiance due to polygonal luminaires with polynomially varying radiant exitance, which satisfy a recurrence relation that subsumes Lambert's formula for uniform luminaires. Our formulas extend the class of available closed-form expressions for computing direct radiative transfer from planar surfaces to points, and can find many potential applications in simulating non-Lambertian illumination and scattering phenomena", "date": "2001-04-25", "date_type": "published", "publisher": "California Institute of Technology", "id_number": "CaltechCSTR:2000.cs-tr-00-04", "official_url": "https://resolver.caltech.edu/CaltechCSTR:2000.cs-tr-00-04", "rights": "You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.", "funders": { "items": [ { "agency": "Microsoft Research" }, { "agency": "NSF", "grant_number": "CCR-9876332" } ] }, "local_group": { "items": [ { "id": "Computer-Science-Technical-Reports" } ] }, "doi": "10.7907/Z9XG9P5B", "primary_object": { "basename": "CSTR2000.pdf", "url": "https://authors.library.caltech.edu/records/epsbd-9q996/files/CSTR2000.pdf" }, "related_objects": [ { "basename": "postscript.ps", "url": "https://authors.library.caltech.edu/records/epsbd-9q996/files/postscript.ps" } ], "resource_type": "monograph", "pub_year": "2001", "author_list": "Chen, Min and Arvo, James" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/01hkj-34e13", "eprint_id": 20329, "eprint_status": "archive", "datestamp": "2023-08-19 06:56:24", "lastmod": "2024-01-13 00:04:10", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Hirani-A-N", "name": { "family": "Hirani", "given": "Anil N." } }, { "id": "Marsden-J-E", "name": { "family": "Marsden", "given": "Jerrold E." } }, { "id": "Arvo-J-R", "name": { "family": "Arvo", "given": "James" } } ] }, "title": "Averaged Template Matching Equations", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2001 Springer.\n\nWe would like to thank J. Tilak Ratnanather for bringing\nthe TME to our attention in 1999 and keeping us informed of their work since\nthen. We would also like to thank Steve Shkoller, Antonio Hernandez, Sergey\nPekarsky and Banavara Shashikanth for helpful discussions. Comments from\nthe mutual review group in Caltech Computer Science, especially the detailed\nsuggestions from Min Chen were very useful in improving the organization of\nthe paper.\n\nAccepted Version - HiMaAr2001.pdf
", "abstract": "By exploiting an analogy with averaging procedures in fluid\ndynamics, we present a set of averaged template matching equations.\nThese equations are analogs of the exact template matching equations\nthat retain all the geometric properties associated with the diffeomorphismgrou\np, and which are expected to average out small scale features\nand so should, as in hydrodynamics, be more computationally efficient\nfor resolving the larger scale features. Froma geometric point of view,\nthe new equations may be viewed as coming from a change in norm that\nis used to measure the distance between images. The results in this paper\nrepresent first steps in a longer termpro gram: what is here is only\nfor binary images and an algorithm for numerical computation is not\nyet operational. Some suggestions for further steps to develop the results\ngiven in this paper are suggested.", "date": "2001", "date_type": "published", "publisher": "Springer", "place_of_pub": "Berlin", "pagerange": "528-543", "id_number": "CaltechAUTHORS:20101007-085033743", "isbn": "3-540-42523-3", "book_title": "Energy minimization methods in computer vision and pattern recognition", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20101007-085033743", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "contributors": { "items": [ { "id": "Figueiredo-M", "name": { "family": "Figueiredo", "given": "M\u00e1rio" } }, { "id": "Zerubia-J", "name": { "family": "Zerubia", "given": "Josiane" } }, { "id": "Jain-A-K", "name": { "family": "Jain", "given": "Anil K." } } ] }, "doi": "10.1007/3-540-44745-8_35", "primary_object": { "basename": "HiMaAr2001.pdf", "url": "https://authors.library.caltech.edu/records/01hkj-34e13/files/HiMaAr2001.pdf" }, "resource_type": "book_section", "pub_year": "2001", "author_list": "Hirani, Anil N.; Marsden, Jerrold E.; et el." }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/7tnky-8h790", "eprint_id": 66328, "eprint_status": "archive", "datestamp": "2023-08-19 06:29:02", "lastmod": "2023-10-18 17:59:14", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Arvo-J-R", "name": { "family": "Arvo", "given": "James" } }, { "id": "Novins-Kevin", "name": { "family": "Novins", "given": "Kevin" } } ] }, "title": "Fluid Sketches: Continuous Recognition and Morphing of Simple Hand-Drawn Shapes", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "Sketching, recognition, morphing.", "note": "\u00a9 2000 ACM. \n\nThis work was supported by a National Science Foundation Career Award (CCR9876332).", "abstract": "We describe a new sketching interface in which shape recognition and morphing are tightly coupled. Raw input strokes are continuously morphed into ideal geometric shapes, even before the pen is lifted. By means of smooth and continual shape transformations the user is apprised of recognition progress and the appearance of the final shape, yet always retains a sense of control over the process. At each time t the system uses the trajectory traced out thus far by the pen coupled with the current appearance of the time-varying shape to classify the sketch as one of several pre-defined basic shapes. The recognition operation is performed using shape-specific fits based on least-squares or relaxation, which are continuously updated as the user draws. We describe the time-dependent transformation of the sketch, beginning with the raw pen trajectory, using a family of first-order ordinary differential\nequations that depend on time and the current shape\nof the sketch. Using this formalism, we describe several possible behaviors that result by varying the relative significance of new and old portions of a stroke, changing the \"viscosity\" of the morph, and enforcing different end conditions. A preliminary user study suggests that the new interface is particularly effective for rapidly constructing diagrams consisting of simple shapes.", "date": "2000-11", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "73-80", "id_number": "CaltechAUTHORS:20160420-140405722", "isbn": "1-58113-212-3", "book_title": "Proceedings of the 13th annual ACM symposium on User interface software and technology (UIST '00)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160420-140405722", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCR9876332" } ] }, "doi": "10.1145/354401.354413", "resource_type": "book_section", "pub_year": "2000", "author_list": "Arvo, James and Novins, Kevin" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/yet8v-akc20", "eprint_id": 69818, "eprint_status": "archive", "datestamp": "2023-08-19 06:22:30", "lastmod": "2023-10-20 20:39:25", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chen-Min", "name": { "family": "Chen", "given": "Min" } }, { "id": "Arvo-J-R", "name": { "family": "Arvo", "given": "James" } } ] }, "title": "Theory and Application of Specular Path Perturbation", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Algorithms, Performance, Implicit surfaces, optics, perturbation theory, specular reflection, Taylor series", "note": "\u00a9 2000 ACM. \n\nReceived: June 1999; revised: November 2000; accepted: January 2001. \n\nThis work was supported in part by the US National Science Foundation Career Award (CCR9876332), the Army Research Office Young Investigator Program (DAAH04-96-100077), and the Alfred P. Sloan Foundation.", "abstract": "In this paper we apply perturbation methods to the problem of computing specular reflections in curved surfaces. The key idea is to generate families of closely related optical paths by expanding a given path into a high-dimensional Taylor series. Our path perturbation method is based on closed-form expressions for linear and higher-order approximations of ray paths, which are derived using Fermat's Variation Principle and the Implicit Function Theorem (IFT). The perturbation formula presented here holds for general multiple-bounce reflection\npaths and provides a mathematical foundation for exploiting path coherence in ray tracing acceleration techniques and incremental rendering. To illustrate its use, we describe an\nalgorithm for fast approximation of specular reflections on curved surfaces; the resulting images are highly accurate and nearly indistinguishable from ray traced images.", "date": "2000-10", "date_type": "published", "publication": "ACM Transactions on Graphics (TOG)", "volume": "19", "number": "4", "publisher": "ACM", "pagerange": "246-278", "id_number": "CaltechAUTHORS:20160822-152504191", "issn": "0730-0301", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160822-152504191", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCR-9876332" }, { "agency": "Army Research Office (ARO)", "grant_number": "DAAH04-96-100077" }, { "agency": "Alfred P. Sloan Foundation" } ] }, "doi": "10.1145/380666.380670", "resource_type": "article", "pub_year": "2000", "author_list": "Chen, Min and Arvo, James" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/p4qew-app65", "eprint_id": 76310, "eprint_status": "archive", "datestamp": "2023-08-19 06:01:42", "lastmod": "2023-10-25 15:37:52", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chen-Min", "name": { "family": "Chen", "given": "Min" } }, { "id": "Arvo-J-R", "name": { "family": "Arvo", "given": "James" } } ] }, "title": "Perturbation methods for interactive specular reflections", "ispublished": "pub", "full_text_status": "public", "keywords": "animation systems, illumination effects, implicit surfaces, matting and compositing, optics, ray tracing", "note": "\u00a9 2000 IEEE. \n\nThe authors wish to thank Anil Hirani and Al Barr for many valuable discussions, Don Mitchell and Pat Hanrahan for their patience in answering our questions, and Mark Meyer for helpful comments. This work was supported in part by the NSF Science and Technology Center for Computer Graphics and Scientific Visualization, the Army Research Office Young Investigator Program (DAAH04-96-100077), and the Alfred P. Sloan Foundation.\n\nPublished - Perturbation_20Methods_20for_20Interactive_20Specular_20Reflections_20TVCG-2000.pdf
", "abstract": "We describe an approach for interactively approximating specular reflections in arbitrary curved surfaces. The technique is applicable to any smooth implicitly defined reflecting surface that is equipped with a ray intersection procedure; it is also extremely efficient as it employs local perturbations to interpolate point samples analytically. After ray tracing a sparse set of reflection paths with respect to a given vantage point and static reflecting surfaces, the algorithm rapidly approximates reflections of arbitrary points in 3-space by expressing them as perturbations of nearby points with known reflections. The reflection of each new point is approximated to second-order accuracy by applying a closed-form perturbation formula to one or more nearby reflection paths. This formula is derived from the Taylor expansion of a reflection path and is based on first and second-order path derivatives. After preprocessing, the approach is fast enough to compute reflections of tessellated diffuse objects in arbitrary curved surfaces at interactive rates using standard graphics hardware. The resulting images are nearly indistinguishable from ray traced images that take several orders of magnitude longer to generate.", "date": "2000-07", "date_type": "published", "publication": "IEEE Transactions on Visualization and Computer Graphics", "volume": "6", "number": "3", "publisher": "IEEE", "pagerange": "253-264", "id_number": "CaltechAUTHORS:20170408-171427414", "issn": "1077-2626", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170408-171427414", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF" }, { "agency": "Army Research Office (ARO)", "grant_number": "DAAH04-96-100077" }, { "agency": "Alfred P. Sloan Foundation" } ] }, "doi": "10.1109/2945.879786", "primary_object": { "basename": "Perturbation_20Methods_20for_20Interactive_20Specular_20Reflections_20TVCG-2000.pdf", "url": "https://authors.library.caltech.edu/records/p4qew-app65/files/Perturbation_20Methods_20for_20Interactive_20Specular_20Reflections_20TVCG-2000.pdf" }, "resource_type": "article", "pub_year": "2000", "author_list": "Chen, Min and Arvo, James" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/yb316-t0v07", "eprint_id": 72751, "eprint_status": "archive", "datestamp": "2023-08-19 04:35:22", "lastmod": "2023-10-23 22:54:42", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Ramamoorthi-Ravi", "name": { "family": "Ramamoorthi", "given": "Ravi" } }, { "id": "Arvo-J-R", "name": { "family": "Arvo", "given": "James" } } ] }, "title": "Creating generative models from range images", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "Generative Models, Range Images, Curves and Surfaces, Procedural Modeling", "note": "\u00a9 1999 ACM. \n\nSpecial thanks to Jean-Yves Bouguet for reviewing early drafts, and for help with data acquisition. Preliminary discussions with Al Barr were of immense help. We are also grateful to the anonymous Siggraph reviewers (especially #2) and committee for their helpful comments, and to members of the graphics groups at Caltech and Stanford, for their support. \n\nThis work was supported by the NSF Science and Technology Center for Computer Graphics and Scientific Visualization (ASC-8920219), an Army Research Office Young Investigator award (DAAH04-96-100077), the Alfred P. Sloan Foundation, and a Reed-Hodgson Stanford Graduate Fellowship. All opinions, findings, conclusions or recommendations expressed here are those of the authors only and do not necessarily reflect the views of the sponsoring agencies and individuals.", "abstract": "We describe a new approach for creating concise high-level generative models from range images or other approximate representations of real objects. Using data from a variety of acquisition techniques and a user-defined class of models, our method produces a compact object representation that is intuitive and easy to edit. The algorithm has two inter-related phases: recognition, which chooses\nan appropriate model within a user-specified hierarchy, and\nparameter estimation, which adjusts the model to best fit the data. Since the approach is model-based, it is relatively insensitive to noise and missing data. We describe practical heuristics for automatically making tradeoffs between simplicity and accuracy to select the best model in a given hierarchy. We also describe a general and efficient technique for optimizing a model by refining its constituent curves. We demonstrate our approach for model recovery using both real and synthetic data and several generative model hierarchies.", "date": "1999-08", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "195-204", "id_number": "CaltechAUTHORS:20161212-170904309", "isbn": "0-201-48560-5", "book_title": "SIGGRAPH '99 Proceedings of the 26th annual conference on Computer graphics and interactive techniques", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161212-170904309", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "ASC-8920219" }, { "agency": "Army Research Office (ARO)", "grant_number": "DAAH04-96-100077" }, { "agency": "Alfred P. Sloan Foundation" }, { "agency": "Reed-Hodgson Stanford Graduate Fellowship" } ] }, "contributors": { "items": [ { "id": "Waggenspack-W", "name": { "family": "Waggenspack", "given": "Warren" } } ] }, "doi": "10.1145/311535.311557", "resource_type": "book_section", "pub_year": "1999", "author_list": "Ramamoorthi, Ravi and Arvo, James" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/x661y-qc616", "eprint_id": 71555, "eprint_status": "archive", "datestamp": "2023-08-19 01:40:10", "lastmod": "2023-10-23 15:54:25", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Greenberg-D-P", "name": { "family": "Greenberg", "given": "Donald P." } }, { "id": "Torrance-K-E", "name": { "family": "Torrance", "given": "Kenneth E." } }, { "id": "Shirley-Peter", "name": { "family": "Shirley", "given": "Peter" } }, { "id": "Arvo-J-R", "name": { "family": "Arvo", "given": "James" } }, { "id": "Ferwerda-J-A", "name": { "family": "Ferwerda", "given": "James A." } }, { "id": "Pattanaik-S", "name": { "family": "Pattanaik", "given": "Sumanta" } }, { "id": "Lafortune-E", "name": { "family": "Lafortune", "given": "Eric" } }, { "id": "Walter-Bruce", "name": { "family": "Walter", "given": "Bruce" } }, { "id": "Foo-Sing-Choong", "name": { "family": "Foo", "given": "Sing-Choong" } }, { "id": "Trumbore-Ben", "name": { "family": "Trumbore", "given": "Ben" } } ] }, "title": "A Framework for Realistic Image Synthesis", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "Realistic Image Synthesis, Light Reflection, Perception", "note": "\u00a9 1997 ACM. \n\nThis work was supported by National Science Foundation grants ASC-9523483 (Greenberg) and CCR-9401961 (Shirley), as well as by the support of all authors through the NSF Science and Technology Center for Computer Graphics and Scientific Visualization (ASC-8920219). Much of the research was performed on workstations generously provided by the Hewlett Packard Corporation.", "abstract": "Our goal is to develop physically based lighting models and perceptually based rendering procedures for computer graphics that will produce synthetic images that are visually and measurably indistinguishable from real-world images. Fidelity of the physical simulation is of primary concern. Our research framework is subdivided\ninto three sub-sections: the local light reflection model, the energy transport simulation, and the visual display algorithms. The first two subsections are physically based, and the last is perceptually based.\n\nWe emphasize the comparisons between simulations and actual\nmeasurements, the difficulties encountered, and the need to utilize the vast amount of psychophysical research already conducted. Future research directions are enumerated. We hope that results of this research will help establish a more fundamental, scientific approach\nfor future rendering algorithms. This presentation describes a chronology of past research in global illumination and how parts of our\nnew system are currently being developed.", "date": "1997-08", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "477-494", "id_number": "CaltechAUTHORS:20161027-133855466", "isbn": "0-89791-896-7", "book_title": "SIGGRAPH '97 Proceedings of the 24th annual conference on Computer graphics and interactive techniques", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161027-133855466", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "ASC-9523483" }, { "agency": "NSF", "grant_number": "CCR-9401961" }, { "agency": "NSF", "grant_number": "ASC-8920219" }, { "agency": "Hewlett Packard Corporation" } ] }, "collection": "CaltechAUTHORS", "contributors": { "items": [ { "id": "Owen-G-S", "name": { "family": "Owen", "given": "G. Scott" } }, { "id": "Whitted-T", "name": { "family": "Whitted", "given": "Turner" } }, { "id": "Mones-Hattal-B", "name": { "family": "Mones-Hattal", "given": "Barbara" } } ] }, "doi": "10.1145/258734.258914", "resource_type": "book_section", "pub_year": "1997", "author_list": "Greenberg, Donald P.; Torrance, Kenneth E.; et el." }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/a1pnp-wh535", "eprint_id": 72072, "eprint_status": "archive", "datestamp": "2023-08-20 00:12:58", "lastmod": "2023-10-23 17:52:45", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Kirk-David", "name": { "family": "Kirk", "given": "David" } }, { "id": "Arvo-J-R", "name": { "family": "Arvo", "given": "James" } } ] }, "title": "Unbiased sampling techniques for image synthesis", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "Algorithms, Graphics, Adaptive Sampling, Anti-aliasing, Monte Carlo, Statistical Bias", "note": "\u00a9 1991 ACM. \n\nMuch of this research was performed while the authors were employed at Apollo Computer and Hewlett-Packard. The authors also wish to thank the anonymous reviewers for their thoughtful and detailed comments.", "abstract": "We examine a class of adaptive sampling techniques employed in image synthesis and show that those commonly used for efficient anti-aliasing are statistically biased. This bias is dependent upon the image function being sampled as well as the strategy for determining the number of samples to use. It is most prominent in areas of high contrast and is attributable to early stages of sampling systematically favoring one extreme or the other. If the expected outcome of the entire adaptive sampling algorithm is considered, we find that the bias of the early decisions is still present in the final estimator. We propose an alternative strategy for performing adaptive sampling that is unbiased but potentially more costly. We conclude that it may not always be practical to mitigate this source of bias, but as a source of error it should be considered when high accuracy and image fidelity are a central concern.", "date": "1991-07", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "153-156", "id_number": "CaltechAUTHORS:20161116-152325870", "isbn": "0-89791-436-8", "book_title": "SIGGRAPH '91 Proceedings of the 18th annual conference on Computer graphics and interactive techniques", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161116-152325870", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "contributors": { "items": [ { "id": "Sederberg-T-W", "name": { "family": "Sederberg", "given": "Thomas W." } } ] }, "doi": "10.1145/122718.122735", "resource_type": "book_section", "pub_year": "1991", "author_list": "Kirk, David and Arvo, James" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/8sntk-73q87", "eprint_id": 72073, "eprint_status": "archive", "datestamp": "2023-08-20 00:13:07", "lastmod": "2023-10-23 17:53:14", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Kirk-David", "name": { "family": "Kirk", "given": "David" } }, { "id": "Arvo-J-R", "name": { "family": "Arvo", "given": "James" } } ] }, "title": "Unbiased sampling techniques for image synthesis", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Algorithms, Graphics, Adaptive Sampling, Anti-aliasing, Monte Carlo, Statistical Bias", "note": "\u00a9 1991 ACM. \n\nMuch of this research was performed while the authors were employed at Apollo Computer and Hewlett-Packard. The authors also wish to thank the anonymous reviewers for their thoughtful and detailed comments.", "abstract": "We examine a class of adaptive sampling techniques employed in image synthesis and show that those commonly used for efficient anti-aliasing are statistically biased. This bias is dependent upon the image function being sampled as well as the strategy for determining the number of samples to use. It is most prominent in areas of high contrast and is attributable to early stages of sampling systematically favoring one extreme or the other. If the expected outcome of the entire adaptive sampling algorithm is considered, we find that the bias of the early decisions is still present in the final estimator. We propose an alternative strategy for performing adaptive sampling that is unbiased but potentially more costly. We conclude that it may not always be practical to mitigate this source of bias, but as a source of error it should be considered when high accuracy and image fidelity are a central concern.", "date": "1991-07", "date_type": "published", "publication": "ACM SIGGRAPH Computer Graphics", "volume": "25", "number": "4", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "153-156", "id_number": "CaltechAUTHORS:20161116-153206206", "isbn": "0-89791-436-8", "issn": "0097-8930", "book_title": "SIGGRAPH '91 Proceedings of the 18th annual conference on Computer graphics and interactive techniques", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161116-153206206", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "contributors": { "items": [ { "id": "Sederberg-T-W", "name": { "family": "Sederberg", "given": "Thomas W." } } ] }, "doi": "10.1145/127719.122735", "resource_type": "article", "pub_year": "1991", "author_list": "Kirk, David and Arvo, James" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/th00w-eeg35", "eprint_id": 66326, "eprint_status": "archive", "datestamp": "2023-08-19 22:58:15", "lastmod": "2023-10-18 17:59:02", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Arvo-J-R", "name": { "family": "Arvo", "given": "James" } }, { "id": "Kirk-David", "name": { "family": "Kirk", "given": "David" } } ] }, "title": "Particle transport and image synthesis", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "Algorithms, Graphics, Boltzmann equation, Monte Carlo, particle transport, radiosity, ray tracing, rendering equation", "note": "\u00a9 1990 ACM.", "abstract": "The rendering equation is similar to the linear Boltzmann\nequation which has been widely studied in physics and nuclear engineering. Consequently, many of the powerful techniques which have been developed in these fields can be\napplied to problems in image synthesis. In this paper we\nadapt several statistical techniques commonly used in neutron transport to stochastic ray tracing and, more generally, to Monte Carlo solution of the rendering equation. First, we describe a technique known as Russian roulette which can be used to terminate the recursive tracing of rays without introducing statistical bias. We also examine the practice of creating ray trees in classical ray tracing in the light of a\nwell-known technique in particle transport known as splitting. We show that neither ray trees nor paths as described in [10] constitute an optimal sampling plan in themselves and that a hybrid may be more efficient.", "date": "1990-08", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "63-66", "id_number": "CaltechAUTHORS:20160420-134938603", "isbn": "0-89791-344-2", "book_title": "Proceedings of the 17th annual conference on Computer graphics and interactive techniques - SIGGRAPH '90", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160420-134938603", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/97879.97886", "resource_type": "book_section", "pub_year": "1990", "author_list": "Arvo, James and Kirk, David" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/jd7a5-67124", "eprint_id": 66327, "eprint_status": "archive", "datestamp": "2023-08-19 22:58:22", "lastmod": "2023-10-18 17:59:05", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Arvo-J-R", "name": { "family": "Arvo", "given": "James" } }, { "id": "Kirk-David", "name": { "family": "Kirk", "given": "David" } } ] }, "title": "Particle transport and image synthesis", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Algorithms, Graphics, Boltzmann equation, Monte Carlo, particle transport, radiosity, ray tracing, rendering equation", "note": "\u00a9 1990 ACM.", "abstract": "The rendering equation is similar to the linear Boltzmann\nequation which has been widely studied in physics and nuclear engineering. Consequently, many of the powerful techniques which have been developed in these fields can be\napplied to problems in image synthesis. In this paper we\nadapt several statistical techniques commonly used in neutron transport to stochastic ray tracing and, more generally, to Monte Carlo solution of the rendering equation. First, we describe a technique known as Russian roulette which can be used to terminate the recursive tracing of rays without introducing statistical bias. We also examine the practice of creating ray trees in classical ray tracing in the light of a\nwell-known technique in particle transport known as splitting. We show that neither ray trees nor paths as described in [10] constitute an optimal sampling plan in themselves and that a hybrid may be more efficient.", "date": "1990-08", "date_type": "published", "publication": "ACM SIGGRAPH Computer Graphics", "volume": "24", "number": "4", "publisher": "ACM", "pagerange": "63-66", "id_number": "CaltechAUTHORS:20160420-134938858", "issn": "0097-8930", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160420-134938858", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/97880.97886", "resource_type": "article", "pub_year": "1990", "author_list": "Arvo, James and Kirk, David" } ]