DIP Viva
DIP Viva
A graph that shows the distribution of pixel intensities in an image. Darker areas have more pixels at lower values, while
brighter areas have more pixels at higher values.
Histogram Equalization: Makes the histogram of an image more uniform, improving contrast.
o Simple Equalization: Spreads pixel intensities evenly across the entire range.
o Adaptive Equalization: Applies equalization locally in small regions to handle uneven illumination.
Edge Detectors:
o Sobel Filter: Identifies both horizontal and vertical edges.
o Canny Edge Detector: A multi-stage algorithm that detects strong edges and suppresses weak ones.
Morphological Operations:
o Erosion: Shrinks objects in an image by removing pixels at the edges.
o Dilation: Expands objects by adding pixels to the edges.
o Opening: Removes thin protrusions and "cleans" object boundaries (erosion followed by dilation).
o Closing: Fills small holes inside objects (dilation followed by erosion).
o Skeletonization: Reduces objects to their one-pixel-thick "skeletons."
o Convex Hull: Creates the smallest possible convex shape (polygon) that encloses all object pixels.
o Top-Hat Transform: Reveals features brighter (white top-hat) or darker (black top-hat) than the background.
o Boundary Extraction: Extracts the outlines of objects in an image.
Compression:
o Bit-Plane Slicing: Separates an image into its individual bit planes (each bit representing a specific level of
detail).
o Basic Compression: Techniques like Run-Length Encoding (RLE) that reduce redundancy in image data.
o LZW Compression: A dictionary-based compression method that replaces frequently occurring patterns with
codes.
What is compression in image processing?
Compression reduces the size of an image file by removing redundant or less important information. It's important for
saving storage space and speeding up transmission over networks.