• Keine Ergebnisse gefunden

Digital Image Processing

N/A
N/A
Protected

Academic year: 2021

Aktie "Digital Image Processing"

Copied!
4
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Examination Computer vision &

Remote Sensing

Digital Image Processing Prof. Olaf Hellwich Name: ... Student ID: ...

Duration: 1 hour Auxiliary material: None

Berlin, July 13, 2010

1

(2)

1 Interest Points (15P)

a) The detection of so-called interest points in grey scale images begins with the computation of partial derivatives

∂x

and

∂y

of the image intensity. Give a detailed, step-by-step description of an algorithm to carry out this computation. Assume that convolutions are to be carried out in the frequency domain and define any filter kernels required.

(6P)

b) The resulting gradient vector associated with each pixel of an image has a direction as well as a length (magnitude). Give an interpretation of both of these quantities and state how the gradient magnitude is computed from the partial derivatives

∂x

and

∂y

.

(3P)

c) Interest point detectors generally analyse the distribution of gradients in the neighbourhood of each pixel in a given image. Figures 1 and 2 above show plots of this distribution for two particular pixels: each point represents the gradient vector associated with a pixel in the neigh- bourhood. The gradient magnitudes can, in both cases shown, be considered large. State what type of image structure each neighbourhood corresponds to and sketch a neighbour- hood (in terms of image intensities) that could have given rise to each gradient distribution.

Your sketches should indicate the x and y axes and their direction as well as which parts of the neighbourhood are bright (large intensity) and which are dark (small intensity).

(6P)

2

(3)

2 Segmentation and Morphology (13P)

A hospital intends to automate certain diagnostic procedures that are currently carried out manually and are therefore time consuming and ultimately expensive. The most important of these procedures is the discrimination of certain tissue samples into the classes healthy and pathological. In the particular case considered, the diagnosis depends strongly on the spacing of cell kernels: a significantly large distance between neighbouring cell kernels indicates a potentially fatal medical condition. An example histological sample is shown in the figure below. The chemical markers used in this type of sample make cell kernels appear as dark spots.

a) The first step in the automated analysis is to accurately segment the cell kernels (dark regions). Due to suboptimal illumination conditions during image acquisition, sample images frequently exhibit a pronounced intensity modulation (an intensity gradient from the top left to the bottom right in the example shown above). Explain why a histogram based segmentation algorithm will often fail to accurately segment cell kernels in these circumstances.

(2P)

b) Suggest a region growing segmentation algorithm based on the gradient magnitudes in the input image. Give a step-by-step description of the proposed algorithm and explain why it is more likely to provide acceptable results. The result of the proposed algorithm should consist of one segment per cell kernel (foreground segments) and a single, large segment encompassing the surrounding tissue (the background).

(5P)

c) The distance transform is a morphological operator frequently applied in the analysis of binary images. What does it compute?

(2P)

d) Suggest an algorithm that uses the distance transform to estimate the average separation of cell kernels in a given histological sample. The input to this algorithm is a binary image in which values 1 and 0 indicate pixels in cell kernels (foreground) and tissue regions (back- ground), respectively. The output is a single number that roughly corresponds to the average distance, in pixels, from the edge of one cell kernel to the edges of its closest neighbours.

Provide a sketch to clarify your description if necessary.

(4P)

3

(4)

3 Super-Resolution (5P)

Super-resolution algorithms combine several low-resolution images of the same scene to produce a single high-resolution image.

a) Briefly outline the three processing steps involved in most super-resolution algorithms. (3P) b) Give an intuitively appealing explanation as to why the input low-resolution images must be

aliased (i.e. why the sampling theorem must be violated during their acquisition).

(2P)

A total of 33 Points is to be attained.

Good Luck!

1

1We hope you will not need it.

4

Referenzen

ÄHNLICHE DOKUMENTE

If a high amount of ferrite is ob- tained (i.e. low carbon contents), a lot of ferrite grains can be found in the micrograph therefore the contrast differences between grain

When then equation above describes Kummer surface (Fig. 4.5) - the surface what is known as quartic Calabi-Yau surface in the complex three dimensional projective space

The Frontend is designed to give the best possible command specification response to the user by breaking the command recognition functions away from the

This paper argues that what Weigel identifies as the current European crisis of civilizational morale is ultimately a product of turning away from the rhetoric that made

That is, we emphasized power projection forces that appeared to be the most viable in denied areas to be able to hold out the prospect of prompt, high-volume

It is important to consider how the provisions of KORUS, effective in March 2012, intersect with broader components of Korea’s innovation ecosystem, and ways that

France is running on fumes, while the UK is choosing to be less engaged suffering from a justified “Bruxelles fatigue.” And the Mediterranean countries

The study investigated ex- amples of new production technologies and processes, new materials applications in the fields of electronics and information technology, construction