🇮🇳 GATE Geomatics Engineering · subject

GATE Geomatics Engineering Section II Syllabus

The Section II syllabus for GATE Geomatics Engineering in full: 6 chapters and 15 topics, every one listed below, plus 60 Section II flashcards with answers.

6Chapters
15Topics
60Flashcards

Section II syllabus: all 6 chapters

Expand any chapter to see its topics and sub-topics.

  1. Data Quantization and Processing

    4 topics
    • Sampling and quantization theory
    • Principle of Linear System
    • Convolution
    • Continuous and Discrete Fourier Transform
  2. Digital Image Processing

    3 topics
    • Digital image characteristics: image histogram and scattergram and their significance
    • Variance-Covariance matrix
    • Correlation matrix and their significance
  3. Radiometric and Geometric Corrections

    1 topic
    • Registration and Resampling techniques
  4. Image Enhancement

    2 topics
    • Contrast Enhancement: Linear and Non-linear methods
    • Spatial Enhancement: Noise and Spatial filters
  5. Image Transformation

    4 topics
    • Principal Component Analysis (PCA)
    • Discriminant Analysis
    • Color transformations (RGB - IHS, CMYK)
    • Indices (Ratios, NDVI, NDWI)
  6. Image Segmentation and Classification

    1 topic
    • Simple techniques

GATE Geomatics Engineering Section II flashcards — 60 questions with answers

  1. What is sampling in the context of digital image acquisition?

    Sampling is the process of discretizing the spatial coordinates of a continuous image, i.e., measuring the image at a finite grid of points (pixels). It converts continuous spatial variables $(x,y)$ into discrete locations.

  2. What is quantization in digital image formation?

    Quantization is the process of discretizing the amplitude (brightness/grey-level) values of the sampled image into a finite set of levels. For a $k$-bit image the number of grey levels is $L = 2^{k}$.

  3. State the Nyquist sampling theorem.

    To reconstruct a signal without aliasing, the sampling frequency must be at least twice the highest frequency present: $f_{s} \geq 2 f_{max}$. The threshold $f_{s} = 2 f_{max}$ is the Nyquist rate.

  4. What is aliasing and how is it avoided?

    Aliasing is the distortion (false low-frequency artefacts) that occurs when a signal is sampled below the Nyquist rate, causing high frequencies to masquerade as low frequencies. It is avoided by low-pass (anti-aliasing) filtering before sampling or by increasing the sampling rate.

  5. How many bits are needed to store an image of size $M \times N$ with $L = 2^{k}$ grey levels?

    The number of bits is $b = M \times N \times k$, where $k = \log_{2} L$.

  6. Define a linear system in terms of its response properties.

    A system is linear if it satisfies superposition: additivity and homogeneity. For inputs $f_{1}, f_{2}$ and scalars $a, b$, $H\{a f_{1} + b f_{2}\} = a\,H\{f_{1}\} + b\,H\{f_{2}\}$.

  7. What additional property defines a Linear Shift-Invariant (LSI) system?

    Shift (position) invariance: a spatial shift of the input produces an identical shift of the output. If $H\{f(x,y)\} = g(x,y)$, then $H\{f(x-x_{0}, y-y_{0})\} = g(x-x_{0}, y-y_{0})$.

  8. What characterizes an LSI system completely, and what is the output expressed as?

    An LSI system is completely characterized by its impulse response (point spread function) $h$. The output is the convolution of the input with $h$: $g = f * h$.

  9. Write the definition of 1-D continuous convolution.

    $$ (f * h)(x) = \int_{-\infty}^{\infty} f(\tau)\, h(x - \tau)\, d\tau $$

  10. Write the definition of 2-D discrete convolution for image processing.

    $$ g(x,y) = \sum_{s=-a}^{a} \sum_{t=-b}^{b} f(x-s,\, y-t)\, h(s,t) $$ where $h$ is the kernel (mask).

  11. State the convolution theorem relating spatial and frequency domains.

    Convolution in the spatial domain equals multiplication in the frequency domain (and vice versa): $f * h \;\Leftrightarrow\; F \cdot H$, and $f \cdot h \;\Leftrightarrow\; F * H$.

  12. List the commutative, associative, and distributive properties of convolution.

    Commutative: $f * h = h * f$. Associative: $(f * h) * g = f * (h * g)$. Distributive: $f * (h + g) = f * h + f * g$.

  13. Write the 1-D Continuous Fourier Transform and its inverse.

    Forward: $$ F(u) = \int_{-\infty}^{\infty} f(x)\, e^{-j 2\pi u x}\, dx $$ Inverse: $$ f(x) = \int_{-\infty}^{\infty} F(u)\, e^{\, j 2\pi u x}\, du $$

  14. Write the 1-D Discrete Fourier Transform (DFT) for a sequence of length $N$.

    $$ F(u) = \sum_{x=0}^{N-1} f(x)\, e^{-j 2\pi u x / N}, \quad u = 0,1,\dots,N-1 $$

  15. Write the 2-D Discrete Fourier Transform of an $M \times N$ image.

    $$ F(u,v) = \sum_{x=0}^{M-1} \sum_{y=0}^{N-1} f(x,y)\, e^{-j 2\pi \left( \frac{ux}{M} + \frac{vy}{N} \right)} $$

  16. What does the value $F(0,0)$ of the 2-D DFT represent?

    $F(0,0)$ is the DC component, proportional to the average grey level of the image: $F(0,0) = \sum_{x}\sum_{y} f(x,y) = MN \cdot \bar{f}$ (the sum / mean intensity).

  17. What is the separability property of the 2-D DFT and its computational benefit?

    The 2-D DFT can be computed as two successive 1-D DFTs (along rows then columns) because the kernel is separable. This reduces complexity and allows use of the FFT, lowering cost from $O(N^{2})$ to $O(N \log N)$ per dimension.

  18. What is an image histogram?

    An image histogram is a graph/discrete function $h(r_{k}) = n_{k}$ giving the number of pixels $n_{k}$ having each grey level $r_{k}$. It shows the frequency distribution of brightness values but contains no spatial information.

  19. What does the shape of a histogram tell you about image contrast?

    A histogram spread across the full range indicates high contrast; one concentrated in a narrow range indicates low contrast. Clustering at the low end means a dark image; at the high end, a bright image.

  20. What is a scattergram (scatterplot / feature-space plot) in multispectral image analysis?

    A scattergram is a 2-D (or n-D) plot of pixel grey values in one band against another band, where each axis is a band. It reveals the correlation/relationship between bands and the clustering of land-cover classes in feature space.

Show the other 40 Section II flashcards
  1. What does the spread and orientation of a scattergram indicate?

    A tight, elongated diagonal cloud indicates high correlation (redundancy) between the two bands; a circular/diffuse spread indicates low correlation. Distinct clusters correspond to separable spectral classes.

  2. Define the variance of a single image band with mean $\mu$ and $N$ pixels.

    $$ \sigma^{2} = \frac{1}{N} \sum_{i=1}^{N} (x_{i} - \mu)^{2} $$ It measures the spread/contrast of grey values about the mean.

  3. Write the covariance between two bands $X$ and $Y$.

    $$ \operatorname{cov}(X,Y) = \frac{1}{N} \sum_{i=1}^{N} (x_{i} - \mu_{X})(y_{i} - \mu_{Y}) $$

  4. What is the variance-covariance matrix for a multiband image and what are its diagonal/off-diagonal entries?

    It is a symmetric $n \times n$ matrix $\Sigma$ where $n$ is the number of bands. Diagonal entries are band variances $\sigma_{ii}^{2}$; off-diagonal entries are covariances $\sigma_{ij} = \operatorname{cov}(i,j)$ between band pairs.

  5. Why is the variance-covariance matrix significant in image processing?

    It quantifies the variability within each band and the statistical dependence between bands. It is the foundation for PCA (its eigen-decomposition), for measuring band redundancy, and for many classification statistics.

  6. Write the correlation coefficient between two bands in terms of covariance and standard deviations.

    $$ \rho_{ij} = \frac{\operatorname{cov}(i,j)}{\sigma_{i}\,\sigma_{j}} $$ with $-1 \leq \rho_{ij} \leq 1$.

  7. What is the correlation matrix and how does it differ from the covariance matrix?

    The correlation matrix is a symmetric $n \times n$ matrix of correlation coefficients $\rho_{ij}$ with 1's on the diagonal. It is the normalized (scale-independent, dimensionless) version of the covariance matrix, with values bounded in $[-1, 1]$.

  8. What is the significance of the correlation matrix for selecting bands?

    High correlation between bands indicates redundant information; selecting weakly correlated bands maximizes the information content of a band combination. It also guides whether PCA will yield strong dimensionality reduction (high inter-band correlation favours PCA).

  9. What is image registration?

    Image registration is the process of geometrically aligning two or more images of the same scene (taken at different times, sensors, or viewpoints) into a common coordinate system, by establishing a geometric transformation between them.

  10. What are Ground Control Points (GCPs) and their role in registration?

    GCPs are clearly identifiable features whose coordinates are known in both the input image and the reference (map/image) system. They are used to compute the coefficients of the geometric transformation (e.g., polynomial warp) used for rectification/registration.

  11. What is resampling and when is it required?

    Resampling is the process of computing new pixel values for the output grid after a geometric transformation, because transformed coordinates rarely fall exactly on integer pixel positions. It is needed in rectification, registration, and reprojection.

  12. Name three common resampling interpolation methods.

    Nearest-neighbour, bilinear interpolation, and cubic convolution (bicubic).

  13. Compare nearest-neighbour and bilinear resampling.

    Nearest-neighbour assigns the value of the closest pixel: fast, preserves original DN values (good for thematic/classified data), but produces blocky/disjointed edges. Bilinear uses a weighted average of the 4 nearest pixels: smoother output, alters original DN values, mild smoothing/blurring.

  14. What are the characteristics of cubic convolution resampling?

    Cubic convolution uses the 16 nearest ($4\times4$) pixels with a weighted average. It produces the sharpest, smoothest result with the least blurring, but is the most computationally expensive and alters the original DN values.

  15. What is contrast enhancement?

    Contrast enhancement (contrast stretching) is the modification of the range/distribution of grey values to improve the visual distinction between features, expanding a narrow input range to use the full available display range.

  16. Write the formula for a linear (min-max) contrast stretch.

    $$ DN_{out} = \left( \frac{DN_{in} - DN_{min}}{DN_{max} - DN_{min}} \right) \times (L - 1) $$ where $L$ is the number of output levels (e.g., 256).

  17. What is a percentage / saturation linear stretch and why is it used?

    A percentage (saturation) linear stretch clips a small percentage of extreme pixels (e.g., 2% at each tail) and stretches the remaining values linearly. It prevents outliers from compressing the stretch, giving better contrast for the bulk of pixels.

  18. Name three non-linear contrast enhancement methods.

    Histogram equalization, logarithmic (and exponential) stretch, and Gaussian stretch. (Piecewise-linear is intermediate.)

  19. What is histogram equalization and its effect?

    Histogram equalization is a non-linear stretch that redistributes pixel values so the output histogram is approximately uniform, using the cumulative distribution function as the transformation. It assigns more display range to the most frequently occurring grey levels, maximizing global contrast.

  20. In histogram equalization, what transformation function is applied to grey level $r$?

    The CDF-based transformation: $$ s = T(r) = (L-1) \int_{0}^{r} p_{r}(w)\, dw $$ (continuous), or $s_{k} = (L-1)\sum_{j=0}^{k} \frac{n_{j}}{N}$ (discrete).

  21. What is spatial (spatial-domain) enhancement and what image property does it operate on?

    Spatial enhancement modifies pixel values based on the values of neighbouring pixels (using filters/convolution kernels). It operates on spatial frequency — the rate of change of brightness over distance — rather than on individual pixel statistics.

  22. What is a low-pass (smoothing) spatial filter and its effect?

    A low-pass filter averages or weights neighbourhood pixels (e.g., a mean filter) to attenuate high spatial frequencies. It smooths the image, reduces noise, but blurs edges and fine detail.

  23. Write a $3\times3$ mean (box) smoothing kernel.

    $$ \frac{1}{9} \begin{pmatrix} 1 & 1 & 1 \\ 1 & 1 & 1 \\ 1 & 1 & 1 \end{pmatrix} $$

  24. What is a median filter and what type of noise is it best at removing?

    A median filter is a non-linear filter that replaces each pixel with the median of its neighbourhood values. It is highly effective at removing salt-and-pepper (impulse) noise while preserving edges better than a mean filter.

  25. What is a high-pass (sharpening) spatial filter and its effect?

    A high-pass filter emphasizes high spatial frequencies (edges, fine detail) by subtracting a smoothed version or using a kernel with a positive centre and negative surround. It sharpens/enhances edges but also amplifies noise.

  26. Name common types of image noise.

    Gaussian (additive) noise, salt-and-pepper (impulse) noise, speckle (multiplicative, common in radar), and periodic noise.

  27. What is Principal Component Analysis (PCA) in remote sensing?

    PCA is a linear transformation that converts correlated multispectral bands into a new set of uncorrelated variables (principal components), ordered by decreasing variance. It concentrates information into fewer bands and is used for dimensionality reduction and decorrelation.

  28. How are the principal components mathematically derived?

    PCs are obtained from the eigenvalues and eigenvectors of the variance-covariance (or correlation) matrix $\Sigma$. The eigenvectors give the transformation axes (loadings) and the eigenvalues give the variance carried by each component; the PC with the largest eigenvalue holds the most variance.

  29. What is the variance and correlation structure of the principal components produced by PCA?

    The principal components are mutually uncorrelated (orthogonal), so the covariance matrix of the PCs is diagonal. The variance of the $i$-th PC equals the $i$-th eigenvalue $\lambda_{i}$, with $\lambda_{1} \geq \lambda_{2} \geq \dots$

  30. What is Discriminant Analysis and how does its objective differ from PCA?

    Discriminant analysis (e.g., Fisher's LDA) finds linear combinations of variables that best separate predefined classes. Unlike PCA (unsupervised, maximizes total variance), LDA is supervised and maximizes between-class separation relative to within-class scatter.

  31. What criterion does Fisher's Linear Discriminant maximize?

    It maximizes the ratio of between-class scatter to within-class scatter: $$ J(w) = \frac{w^{T} S_{B}\, w}{w^{T} S_{W}\, w} $$ where $S_{B}$ is the between-class and $S_{W}$ the within-class scatter matrix.

  32. What is the RGB to IHS colour transformation used for?

    It converts the Red-Green-Blue colour space into Intensity, Hue, and Saturation components. It is used for colour enhancement and especially for image (data) fusion — e.g., replacing intensity with a high-resolution panchromatic band, then transforming back (pan-sharpening).

  33. Define the Intensity, Hue, and Saturation components in the IHS model.

    Intensity = overall brightness (total energy), e.g., $I = \frac{R+G+B}{3}$. Hue = dominant wavelength / pure colour (the attribute we name a colour). Saturation = purity or amount of white light mixed with the hue (how vivid vs. pastel).

  34. What does the CMYK colour model represent and how does it relate to RGB?

    CMYK (Cyan, Magenta, Yellow, blacK) is a subtractive model used in colour printing; inks subtract light from white. Its primaries are the complements of the additive RGB primaries: cyan = white $-$ red, magenta = white $-$ green, yellow = white $-$ blue.

  35. What is a band ratio and one benefit of using it?

    A band ratio divides the DN of one band by another, pixel by pixel: $R = \frac{DN_{i}}{DN_{j}}$. It enhances spectral differences (slopes), suppresses topographic/illumination effects, and highlights specific materials.

  36. Write the formula and value range for NDVI.

    $$ NDVI = \frac{NIR - Red}{NIR + Red} $$ Range is $-1$ to $+1$; high positive values ($\approx 0.6$–$0.9$) indicate dense healthy vegetation.

  37. Why is NDVI a normalized index rather than a simple ratio, and what does it exploit about vegetation?

    Normalization to $[-1,1]$ reduces sensor/illumination/topographic effects and bounds the values. It exploits that healthy vegetation strongly reflects NIR (high) and strongly absorbs red light (low) due to chlorophyll, giving a large difference.

  38. Write the formula for NDWI (McFeeters, water-detection form).

    $$ NDWI = \frac{Green - NIR}{Green + NIR} $$ Positive values indicate water bodies (water reflects green, absorbs NIR); vegetation and soil give negative values.

  39. In a typical NDVI image, what values do water, bare soil, and clouds/snow tend to show?

    Water and clouds/snow give negative or near-zero NDVI (sometimes negative), bare soil gives small positive values (~0.1–0.2), and dense vegetation gives high positive values (~0.6–0.9).

  40. What is the key difference between point operations and neighbourhood (spatial) operations in image enhancement?

    Point operations (e.g., contrast stretch, histogram equalization) compute each output pixel from the single corresponding input pixel value only. Neighbourhood (spatial) operations (e.g., smoothing, sharpening filters) compute each output pixel from a window of surrounding input pixels.

GATE Geomatics Engineering Section II FAQ

What is in the GATE Geomatics Engineering Section II syllabus?

GATE Geomatics Engineering Section II is split into 6 chapters: Data Quantization and Processing, Digital Image Processing, Radiometric and Geometric Corrections, Image Enhancement, Image Transformation and Image Segmentation and Classification. Together they contain 15 topics.

How many chapters are in GATE Geomatics Engineering Section II?

6 chapters, containing 15 topics. The largest chapter is Data Quantization and Processing, with 4 topics.

Are there flashcards for GATE Geomatics Engineering Section II?

Yes — a 60-card Section II deck, printed in full in the flashcards section of this page and available in the Examius app with spaced repetition. The free plan covers one exam of your choice, including its flashcards; Examius Pro, a one-time purchase, unlocks every other exam and deck.