# US 2018/0025535 A1 · Hölder Adaptive Image Synthesis

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2018/0025535 A1
- Document ID: US20180025535A1
- Status: Published application
- Kind: A1
- Application number: 15/658,358
- Filed: 2017-07-24
- Published: 2018-01-25
- Earliest claimed: 2016-07-25
- Assignees: Technische UniversitäT Berlin; University of Toronto
- Applicants: Technische Universitat Berlin
- Inventors: Christian Lessig; Eugene Fiume
- Web page: https://patentgrep.com/patent/US20180025535A1

## CPC

- G06T 15/506: {Illumination models}
- A63F 13/52: involving aspects of the displayed game scene
- G06T 2215/16: Using real world measurements to influence rendering
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- A63F: CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR

## Abstract

Computer implemented method for rendering an image of a three-dimensional scene on an image plane by encoding at least a luminosity in the image plane by a luminosity function. The value of the luminosity can be computed at substantially each point of the image plane by using a set of stored input data describing the scene. The method includes constructing the luminosity function as equivalent to a first linear combination involving the functions of a first set of functions, and computing at least the value of the coefficients of the first linear combination, by solving a first linear system, obtained by using at least the functions of the first linear combination, at least a subset of the first subset of the image plane, and the luminosity at the points of said subset. The method further includes storing the value of the coefficients of the first linear combination and at least the information needed to associate each coefficient to the function multiplying said coefficient in the first linear combination. The first set of functions comprises each function of a second set of functions satisfying a selection condition, which depends at least on the set of stored input data. Moreover, the points of the first subset are distributed according to a first distribution criterion, which depends on the location of the support of at least a function of the first set of functions.

## Claims

### Claim 1

A computer-implemented method for rendering at least partially an image of a three-dimensional scene on an image plane (I) by encoding at least a luminosity in the image plane (I) by a luminosity function (FL) defined on the image plane (I), wherein the value of the luminosity can be computed at substantially each point of the image plane (I) by using a set of stored input data describing the scene at least in part, said method comprising:
a) constructing the luminosity function (FL) in at least a region of the image plane (I) as equivalent to a first linear combination involving the functions of at least a subset of a first set (B1) of functions defined on the image plane (I);
b) computing the value of the coefficients of the first linear combination, by solving a first linear system obtained by imposing the value of a second linear combination at each point of at least a subset of the first subset of the image plane (I) to be substantially equal to the value of the luminosity at said point, wherein the second linear combination involves at least the terms of the first linear combination;
c) storing the value of the coefficients of the second linear combination, which are comprised in the first linear combination and at least the information needed to associate each coefficient of the first linear combination to a corresponding function of the first set (B1) of functions, which is the function multiplying said coefficient in the first linear combination,
wherein the first set (B1) comprises each function of a second set of functions satisfying a selection condition associated to said function, wherein the selection condition associated to said function depends at least on said function and on the set of stored input data; and
wherein the points of the first subset are distributed according to a first distribution criterion, wherein the first distribution criterion depends on at least the location of the support of at least some of the elements of the first set (B1) of functions on the image plane (I).

### Claim 2 (depends on 1)

The method according to claim 1, wherein for at least a function of the second set of functions the selection condition associated to said function depends on the value of the luminosity at at least one point of the support of said function.

### Claim 3 (depends on 1)

The method according to claim 1, wherein the image plane (I) is tiled by a given first set of tiles, and wherein the first distribution criterion comprises at least the requirement that for at least a first tile of the first set of tiles the number of points of the first subset belonging to said tile depends on the number of functions of the first set (B1) of functions, the support of which overlaps said tile.

### Claim 4 (depends on 3)

The method according to claim 3, wherein substantially each function of the first set (B1) of functions is associated to a weight factor, and optionally wherein the first distribution criterion comprises at least the requirement that the number of points of the first subset belonging to the first tile is greater than or equal to a first total weight factor and/or is greater than or equal to the product between a first factor and the first total weight factor, wherein the first total weight factor is the sum of the weight factors of the functions of the first set (B1) of functions, the support of which overlaps the first tile.

### Claim 5 (depends on 1)

The method according to claim 1, wherein the value of the luminosity can be computed at substantially each point of the image plane (I) via a rendering equation based on at least a part of the set of stored input data describing at least partially the scene.

### Claim 6 (depends on 1)

The method according to claim 1, wherein the second set of functions is at least a subset, in particular a finite subset, of a basis and/or of a frame of an inner product space, in particular of a Hilbert space, wherein said inner product space comprises functions defined on the image plane (I), and, optionally, wherein the basis and/or the frame is selected from a list comprising a set of wavelets, a set of shearlets, a set of curvelets, or combinations thereof.

### Claim 7 (depends on 6)

The method according to claim 6, wherein the value of the coefficients of the first linear combination is computed by means of the reproducing kernel technique, the reproducing kernel technique optionally performed with at least a first local set of functions of the first set (B1) of functions, at least the points of a first local subset of the first subset of the image plane (I) and at least the value of the luminosity at the points of the first local subset of the first subset.

### Claim 8 (depends on 6)

The method according to claim 6, wherein the elements of the second set of functions can be grouped into a first collection of mutually disjoint levels, wherein the elements of the set of the first collection can be associated to a level parameter, and wherein there is at least a decreasing bound function of the level parameter, wherein for at least a function of the second set of functions the absolute value of the scalar product between the luminosity function (FL) and said function of the second set of functions is smaller than or equal to the value of the bound function evaluated at the value of the level parameter associated to the level, to which said function of the second set of functions belongs.

### Claim 9 (depends on 1)

The method according to claim 1, wherein at least the selection condition associated to a first function of the second set comprises at least the requirement that at least an element of a comparison set is smaller than or equal to a given threshold value associated to the first function, wherein the comparison set comprises at least the values of a first parameter function (FP1) at at least a comparison subset (SC2) of points of the support of the first function, wherein the first parameter function (FP1) is defined on the image plane (I) and describes the variation of the value of a comparison parameter (PC) in the image plane (I), and, optionally,
wherein for at least a decreasing threshold function of the level parameter the threshold value of the first function is the value of said threshold function evaluated at the value of the level parameter associated to the level, to which said function belongs.

### Claim 10 (depends on 9)

The method according to claim 9 further comprising the step of:
d) computing the first parameter function (FP1) by using the values of the comparison parameter (PC) evaluated at the points of a second subset of the image plane (I),
wherein the value of the comparison parameter (PC) at substantially each point of the image plane (I) is obtained by using a given second parameter function.

### Claim 11 (depends on 10)

The method according to claim 10, wherein the given second parameter function is the Hölder function.

### Claim 12 (depends on 10)

The method according to claim 10, wherein at least a first subset of the first set (B1) of functions and a first subset of the first subset of the image plane (I) are set to be respectively the first and the second output of a second construction method (M2) associated to a second level of the first collection and to a first input subset of the image plane (I), wherein
the second construction method (M2) associated to a given level of the first collection and to a given input subset of points of the image plane (I) uses the given input subset to obtain a first output and a second output, wherein the first output is a second output set (BO2) of functions and the second output is a first output subset (SO1) of the image plane (I), and wherein
the second construction method (M2) comprises at least the steps of:
constructing the first parameter function (FP1) by using at least the values of the comparison parameter (PC) evaluated at the points of the given input subset and by using the second parameter function;
constructing the second output set (BO2) of functions by selecting each function of the second set of functions satisfying the selection condition associated to said function and such that said function belongs to the given level;
constructing the first output subset (SO1) by sampling the image plane (I) according to a fourth distribution criterion, wherein the fourth distribution criterion depends on at least the location of the support of the elements of the second output set (BO2) of functions on the image plane (I),
wherein optionally the fourth distribution criterion comprises at least the requirement that for at least a tile of the first set of tiles the number of points of the first output subset (SO1) belonging to said tile is greater than or equal to a fourth total weight factor, and/or is greater than or equal to the product between a fourth factor and the fourth total weight factor, wherein the fourth total weight factor is the sum of the weight factors of the functions of the second output set (BO2) of functions, the support of which overlaps said tile.

### Claim 13 (depends on 1)

The method according to claim 1, wherein the image plane (I) is tiled by a second set (A2) of tiles comprising the region as a tile, and wherein said method further comprises the step of:
e) storing the information needed to describe each tile of at least a first plurality of tiles of the second set (A2) of tiles.

### Claim 14 (depends on 1)

A device rendering at least partially an image of a three-dimensional scene on an image plane (I), said device including storage means, and a processor connected to said storage means, said processor being programmed to implement the steps of the method according to claim 1.

### Claim 15 (depends on 1)

A computer program product comprising instruction modules which, when executed by a processor of a computer, causes the computer to implement the steps of the method according to claim 1.
