Changes between Version 1 and Version 2 of barSoftwareGapFillDetails


Ignore:
Timestamp:
07/25/11 11:11:08 (13 years ago)
Author:
pmajka
Comment:

--

Legend:

Unmodified
Added
Removed
Modified

  • barSoftwareGapFillDetails

    v1 v2  
    1 = 3d Brain Atlas Reconstructor on-line service = 
     1= 3d Brain Atlas Reconstructor = 
    22 
    33 
    44=== Detailed description of gap-filling algorithm === 
    55 
    6 The most common defect are gaps in structures' outlines. It commonly happens when two contour lines which should touch are drawn so that they leave a little space in between. Such an arrangement may not be visible in a printed atlas but it greatly disturbs tracing process where every pixel may influence the results. In this case the structure being traced overtakes the space of its neighbour through the broken contour which we call leaking of the structure.  
     6The most common defect encountered digital versions of published PDF atlases are gaps in structures' outlines. It commonly happens when two contour lines which should touch are drawn so that they leave a little space in between. Such an arrangement may not be visible in a printed atlas but it greatly disturbs tracing process where every pixel may influence the results. In this case the structure being traced overtakes the space of its neighbour through the broken contour which we call leaking of the structure.  
    77 
    8 `Figure` example of leaking structure` 
     8`Figure example of leaking structure` 
    99 
    10 Leaking structures are handled in 3dBAR by gap filling algorithm, which is an extension of the basic tracing procedure. The algorithm requires single input parameter – `MaxGrowLevel` describing maximal size of the gaps that will be closed during tracing of a particular area. The algorithm creates multiple (`n=MaxGrowLevel`) copies of initial input bitmap, each with the contours expanded using the [http://en.wikipedia.org/wiki/Dilation_%28morphology%29 dilation filter]  approximately by one pixel. 
     10Leaking structures are handled in 3dBAR by gap filling algorithm, an extension of the basic tracing procedure. The algorithm requires single input parameter – `MaxGrowLevel` describing maximal size of the gaps that will be closed during tracing of a particular area. The algorithm creates multiple (`n=MaxGrowLevel`) copies of initial input bitmap, each with the contours expanded using the [http://en.wikipedia.org/wiki/Dilation_%28morphology%29 dilation filter]  approximately by one pixel. 
    1111 
    1212`Figure - consecutive application of dilation filter` 
friendster counter