Home
Image Processing and Anal...

Filters

Found 1 Question

Set Default

Exams

GATE GE

Subjects

Image Processing and Analysis

Topics

Pixel Adjacency / m-Adjacency and Connectivity
2D Convolution of Small Kernels
Contrast stretching (radiometric enhancement)
Convolution Theorem (Spatial-Frequency Domain)
DFT-based convolution and aliasing
Digital Image Fundamentals - Grey Levels and Storage
Histogram Equalization
Image resampling (bilinear and cubic convolution)
Intensity transformations (negative, threshold, log, power law)
Linear vs Non-linear Raster/Spatial Operations
Spatial Filtering - Mean Filter
Spatial filtering (Laplacian mask)

List of top Image Processing and Analysis Questions on Pixel Adjacency / m-Adjacency and Connectivity

Consider the following arrangement of pixels P, P₁, P₂, P₃ and P₄ as shown in the figure. Assume that P, P₂ and P₄ have a value of 1, and P₁ and P₃ have a value of 0. If we consider adjacency of pixels as \(V=\{1\}\), what is the length of the shortest m-path between P and P₄?

GATE GE - 2026
GATE GE
Image Processing and Analysis
Pixel Adjacency / m-Adjacency and Connectivity

terms & conditions

Privacy & Policy

© 2026 Patronum Web Private Limited