Scribd
Upload
14 views

Digital Image Processing

DISTANCE MEASURES IN DIGITAL IMAGE PROCESSING: Euclidean, CITY-BLOCK, AND CHESSBOARD DISTANCES

Uploaded by

aniketkrishna007
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
14 views

Digital Image Processing

DISTANCE MEASURES IN DIGITAL IMAGE PROCESSING: Euclidean, CITY-BLOCK, AND CHESSBOARD DISTANCES

Uploaded by

aniketkrishna007
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

DISTANCE MEASURES IN DIGITAL IMAGE

PROCESSING: EUCLIDEAN, CITY-BLOCK,


AND CHESSBOARD DISTANCES

• NAME: ANIKET KRISHNA


• ROLL NO: 32
• DEPT: EE
• UNIVERSITY ROLL NO.: 12201621035
• SUBJECT NAME: DIGITAL IMAGE PROCESSECING
• SUBJECT CODE: OE-EE-702B
CONTENT:

1. Introduction
2. Importance in Digital Image Processing
3. DEFINITION OF DISTANCE MEASURES
4. EUCLIDEAN DISTANCE
5. City-Block Distance
6. Chessboard Distance
7. Comparative Analysis
8. Conclusion

2
INTRODUCTION

• Importance in Digital Image Processing


• Quantification of Similarity/Dissimilarity
• Distance measures provide a mathematical way to quantify how similar or
different two points, pixels, or regions are in an image.
• Essential for various processing tasks where comparing or matching features is
necessary.
• Foundation for Various Algorithms
• Many image processing algorithms rely on distance metrics to function
effectively.
• Examples include clustering algorithms like k-means and various image
segmentation techniques.
DISTANCE MEASURES OVERVIEW
• DEFINITION OF DISTANCE MEASURES
• PURPOSE:

• Distance measures quantify the similarity or dissimilarity


between points or regions in an image.
• These metrics help in various image processing tasks by
providing a way to evaluate how close or far apart different
features or objects are.

• TYPES COVERED:
• Euclidean Distance
• City-Block Distance
• Chessboard Distance
EUCLIDEAN DISTANCE
• DEFINITION:
EUCLIDEAN DISTANCE:
• MEASURES THE STRAIGHT-LINE DISTANCE
BETWEEN TWO POINTS IN A TWO-DIMENSIONAL OR
MULTI-DIMENSIONAL SPACE.
• IT REPRESENTS THE SHORTEST PATH BETWEEN THE
POINTS, AKIN TO THE DISTANCE YOU WOULD
TRAVEL IN A STRAIGHT LINE.

FORMULA:
FOR TWO POINTS (X1,Y1) AND (X2,Y2) IN A 2D
PLANE, THE EUCLIDEAN DISTANCE 'D' IS
CALCULATED AS:
D = √(X1-X2)^2 + (Y1-Y2)^2
• Definition:
City-Block Distance, also known as Manhattan Distance,
measures the distance between two points by summing the
absolute differences of their coordinates along the axes at right
angles.
City-Block It is akin to the distance you would travel if you were restricted
to moving along grid lines, such as navigating through city
Distance streets arranged in a grid pattern.

(Manhattan • Formula:
Distance) For two points (x1,y1) and (x2,y2) in a 2D plane, the City-Block
distance D is calculated as:
d = |x2 - x1| + |y2 - y1|

6
Chessboard Distance (Chebyshev Distance)
Definition:
• Chessboard Distance, also known as Chebyshev Distance, measures the distance
between two points by considering the maximum of the absolute differences along each
dimension.
• It reflects the distance on a grid where movement is allowed in all directions equally,
similar to the movement of a king on a chessboard which can move any number of
squares horizontally, vertically, or diagonally.
Formula:
• For two points (x1,y1)(x_1, y_1)(x1 ,y1 ) and (x2,y2)(x_2, y_2)(x2 ,y2 ) in a 2D plane,
the Chessboard distance d is calculated as:
d = max⁡ (∣x2−x1∣,∣y2−y1∣)
Comparative Analysis
Euclidean Distance vs. City-Block Distance vs. Chessboard Distance
Comparative Summary Table:

City-Block Distance Chessboard Distance


Feature Euclidean Distance
(Manhattan) (Chebyshev)

Maximum coordinate
Definition Straight-line distance Grid-based distance
difference

D = √(X1-X2)^2 + (Y1-
Formula d = |x2 - x1| + |y2 - y1| d = max⁡
(∣x2−x1∣,∣y2−y1∣)
Y2)^2

Direct (diagonal and Grid-based


Movement Type All directions equally (grid)
straight) (horizontal/vertical)
Image recognition, feature Image segmentation, Pathfinding, object
Typical Applications
matching clustering recognition
Generally more complex Simpler (linear in
Computational Complexity Simple (max operation)
due to square root complexity)
8
Conclusion
In digital image processing, selecting the appropriate distance measure is crucial for achieving
accurate results in various applications.
• Euclidean Distance provides a true geometric measure and is suitable for tasks requiring precise
spatial calculations.
• City-Block Distance is ideal for scenarios that limit movement to horizontal and vertical paths,
such as grid-based environments.
• Chessboard Distance offers an efficient metric when diagonal movements are allowed and have
the same cost as orthogonal movements.
Each distance metric offers unique advantages tailored to specific tasks, such as image
segmentation, pattern recognition, and pathfinding. Understanding these distance measures enables
more effective and targeted solutions in image processing applications, optimizing performance
9
based on the task requirements.
THANK YOU

10

You might also like