Shadow mapping is known for its comparability with rendering hardware, low implementation complexity and ability to handle any kind of geometry. However, aliasing is also a very common problem in shadow mapping.
Projection and perspective aliasing are the two main discontinuity types which deteriorate projected shadow quality. Since the introduction of shadow mapping, many clever algorithms have been developed to reduce or even completely remove shadow map aliasing. Algorithms which are targeted to remove aliasing completely are unfortunately not compatible with current GPU architecture to run in real-time and usually serve as hardware change proposals (LogPSM, Irregular Z-Buffer Technique). Some algorithms which run in real-time are focused on optimal sample re-distribution (PSM, TSM, LiSPSM, CSM) and others are serve as filtering techniques (VSM, PCF, BFSM).
Shadow Map Silhouette Revectorization (SMSR) is a filtering technique which re-approximates shadow silhouette based on MLAA implementation. SMSR consists of two main passes and a final merge pass (in total three passes). First pass searches for discontinuity information. Second pass determines discontinuity length and orientation where its translated into normalized xy-space. The xy-space is used to perform a simple linear line interpolation which eventually determines the new edge. The third and final pass merges new edges on top of the regular shadow map, resulting in a smoother shadow.
**Figure 1:** From left to right, revectorization process.
[subheading]First pass[/subheading]
**Figure 2:** Compressed silhouette discontinuity.
Inside the projected shadow map, we find shadow discontinuity by offsetting projected coordinates by one shadow map sample in all 4 directions (left, top, right, bottom). The discontinuity is compressed into a single value per axis (red channel for horizontal and green channel for vertical discontinuity) which then is used in the second pass.
Compression layout:
0.0 = no discontinuity
0.5 = depending on which axis, to left or to bottom
0.75 = discontinuity in on both directions.
1.0 = depending on which axis, to right or to top
Fragment Shader - First pass:
```
struct FBO_FORWARD_IN
{
float4 color0 : COLOR0;
};
float Visible(sampler2D inShadowMap, float inShadowMapXY, float4 inProjectedCoordinate, int2 inOffset)
{
return tex2Dproj( inShadowMap, inProjectedCoordinate + float4(inOffset,0,0) * (1.0f/inShadowMapXY) ).r;
}
float2 Disc(sampler2D inShadowMap, float inShadowMapXY, float4 inProjectedCoordinate)
{
float center = Visible(inShadowMap, inShadowMapXY, inProjectedCoordinate, float2(0,0));
float right = abs(Visible(inShadowMap, inShadowMapXY, inProjectedCoordinate, int2(1,0)) - center) * center;
float left = abs(Visible(inShadowMap, inShadowMapXY, inProjectedCoordinate, int2(-1,0))- center) * center;
float top = abs(Visible(inShadowMap, inShadowMapXY, inProjectedCoordinate, int2(0,-1))- center) * center;
float bottom = abs(Visible(inShadowMap, inShadowMapXY, inProjectedCoordinate, int2(0,1)) - center) * center;
float4 disc = float4(left, right, bottom, top);
/*
Compress results:
0.0f = no discontinuity
0.5f = depending on which axis, to left or to bottom
0.75f = discontinuity to on both sides.
1.0f = depending on which axis, to right or to top
*/
float2 dxdy = 0.75f + (-disc.xz + disc.yw) * 0.25f;
// Step filters out axis where no discontinuities are found
return dxdy * step(1.0f, float2(dot(disc.xy, 1.0f), dot(disc.zw, 1.0f)));
}
FBO_FORWARD_IN main(float4 inPos : POSITION,
uniform sampler2D inSampler1 : TEXUNIT1, // In Shadow Map
uniform sampler2D inTexPosition : TEXUNIT2, // Buffer containing from camera-space world coordinates
float2 inUV : TEXCOORD0, // Current fragment
uniform float4x4 inMatrixShadowLightProjectionBias, // Light View Matrix
uniform float inConst0, // Bias
uniform float inConst1 // Shadow-map width & height
)
{
FBO_FORWARD_IN outFBO;
float4 color = float4(0,0,0,0);
float3 pos = tex2D(inTexPosition, inUV).xyz; // World position. Can be reconstructed from depth and inverse camera-projection-matrix
// Projected depth-map coordinates, between 0 and 1
float4 biasOffset = float4(0,0, inConst0, 0);
float4 projectedCoordinate = mul(inMatrixShadowLightProjectionBias, float4(pos, 1.0f)) + biasOffset;
// Clip everything outside shadow map rectangle
// How is this performance wise? can we optimize it.
if( projectedCoordinate.x >= 0.0f ||
projectedCoordinate.y >= 0.0f ||
projectedCoordinate.x <= 1.0f ||
projectedCoordinate.y <= 1.0f)
{
color.rg = Disc(inSampler1, inConst1, projectedCoordinate);
}
outFBO.color0 = color;
return outFBO;
}
```

[subheading]Second pass[/subheading]
The second is the most important and demanding pass. It determines discontinuity length, orientation and fragment position which is translated into orientated normalized discontinuity (xy-coordinate) space. The normalized space is then used to perform linear line interpolation which determines the new silhouette edge.
The main challenge is to correctly approximate discontinuity length from the screen-space in projected light-space. In order to approximate the discontinuity length, we have to determine how many screen-space pixels we have to offset from original screen-space position to where neighboring axis-aligned shadow-map sample can be found on the screen-space. The new screen-space position is determined by taking current fragment world-space into projected light space, applying offset, fetching and combining correct depth and then projecting it back onto the screen-space. This is the most demanding step, and perhaps performance-wise also the most expensive.
After we know where our neighboring shadow-map sample is located on the screen-space, we step until we find a break in discontinuity. The discontinuity break can be initiated by exceeding delta-depth threshold, by reaching maximum search distance or by reaching a non-discontinuity sample on opposite axis. By performing this iteration in screen-space, we can approximate the discontinuity length of projected shadow.
**Figure 3:** Orientated Normalized Discontinuity Space.
Knowing the discontinuity length and the discontinuity-begin, we can determine orientated normalized discontinuity space position. Once we have that information, we can fill or clip away a new shadow silhouette.
**Figure 4:** Clipped Area from Orientated Normalized Discontinuity Space.
On low sample density area, merging new silhouette information with lighting or image buffer will result in a smoother shadow edge.
**Figure 5:** Red indicates new shadow silhouette.
Fragment Shader - Second pass:
```
struct FBO_FORWARD_IN
{
float4 color0 : COLOR0;
};
#define MAX_SEARCH 8
float IsBegin(float2 inDisc)
{
float2 d = (inDisc - 0.75f) * 4.0f;
if(inDisc.x == 0.0f)
d.x = 0.0f;
if(inDisc.y == 0.0f)
d.y = 0.0f;
return saturate(step(1.0f, dot(abs(d), 1.0f) * 0.5f));
}
float Search( sampler2D inTexPosition,
sampler2D inTexDisc,
sampler2D inShadowMap,
float inShadowMapXY,
float4x4 inLight,
float4x4 inCamera,
float4x4 inProjection,
float2 inCurrScrCoord,
float2 inInitialDisc,
int2 inDir)
{
float dist = 1.0f;
float finalDist = 0.0f;
float2 currScrCoord = inCurrScrCoord;
float2 disc = tex2D(inTexDisc, currScrCoord).xy;
float foundBeginEdge = IsBegin(disc);
float initialDisc = dot(inInitialDisc.yx*abs(inDir), 1.0f);
float invShadowMapXY = 1.0f / inShadowMapXY;
for(int i=0; i
```

[subheading]Results[/subheading]
The algorithm performs very well in areas with low shadow map sampling rates. It interpolates new edges, which increase final visual quality of projected shadow. However, the algorithm is not perfect, some edges are not as smooth as a high-res shadow map projection. See future research on how the visual quality could be improved even further.
**Figure 6:** Left no SMSR, right with SMSR. 256x256 Shadow Map.
**Figure 7:** Left no SMSR, right with SMSR. 256x256 Shadow Map.
**Figure 8:** Left no SMSR, right with SMSR. 256x256 Shadow Map.
**Figure 9:** Left no SMSR, right with SMSR. 256x256 Shadow Map.

#
Shadow Map Silhouette Revectorization (SMSR)

Report Article

## Create an account or sign in to comment

You need to be a member in order to leave a comment

## Create an account

Sign up for a new account in our community. It's easy!

Register a new account## Sign in

Already have an account? Sign in here.

Sign In Now