Midterm Flashcards
(109 cards)
Define image processing
Image Processing is manipulating an image to improve its quality, extract information, or enable further analysis
Define feature
A distinctive attribute or description used to label or differentiate objects in images
Feature extraction involves two things. What are they?
Detection (finding features) and Description (quantifying features)
What are invariant and covariant features?
Invariant features: Values remain unchanged under specific transformations (e.g., rotation, scaling)
Covariant features: Values change predictably under transformations (e.g., scaling affects area proportionally)
What are local and global features?
Local features: Apply to individual image regions (e.g., corners, edges)
Global features: Describe entire images (e.g., colour histogram)
The purpose of preprocessing techniques is to…
Prepare images for further analysis by reducing noise, enhancing features, and normalizing data
Define boundary analysis
An analysis of the edges or outlines of objects to aid in object shape identification
Define region analysis
An analysis of the areas or segments within an image to support texture and pattern recognition
What is boundary following/tracing
A technique to identify the boundary of an object in a binary image
What are the requirements for boundary following/tracing?
- Must be a binary image
- Image padded with a border of 0’s
- Single connected region
What are chain codes?
Chain codes represent the boundary of an object as a sequence of connected line segments. These segments are described using directional numbers based on connectivity
What are the different connectivity types?
4-Connectivity: Segments connect pixels in horizontal and vertical directions
8-Connectivity: Segments connect pixels in horizontal, vertical, and diagonal directions (finer boundary representation than 4-C)
What are the two types of chain codes?
Freeman chain codes and slope chain codes
Define freeman chain codes
A boundary chain code that assigns a directional number (e.g., 0 for right, 1 for top-right, etc.) to each segment between consecutive boundary pixels (e.g., 0766666453321212)
What is a strategy that could reduce the length of a boundary chain?
Resample fine-grained grid to a coarser grid spacing. This also helps with reducing sensitivity to noise or segmentation errors
What are some normalization techniques for chain codes?
Rotation normalization and starting point normalization
What is rotation normalization
uses the difference between consecutive directions instead of absolute directions
What is starting point normalization
A normalization technique for chain codes that treats the chain code as circular and shifts it to start with the smallest sequence
Define slope chain codes (SCCs)
A chain code for boundary analysis that uses slope changes between contiguous line segments to represent a boundary
How do you normalize a slope chain code?
Positive and zero slope changes are normalized to [0, 1), negative slope changes are normalized to (-1, 0)
What are the advantages of SCCs over Freeman codes?
- Provide finer granularity by utilizing a continuous slope range (-1, 1)
- Better representation under rotation
- Simpler process as SCCs do not require defining a grid
Define boundary approximation using minimum-perimeter polygons (MPP)
Boundary approximation using polygons to minimize the total perimeter while maintaining the shape’s integrity, provides a compact/simplified representation of object boundaries
What are the advantages of boundary approximation using MPP?
- Reduces computational complexity
- Simplifies boundary representation for storage and analysis
- Useful in applications like shape matching and object recognition
Define scale-invariant feature transform (SIFT)
SIFT extracts features that are invariant to scale, rotation, and certain changes in illumination