Scribd
Upload
6 views20 pages

Illustration of How MSE Changes With DL and RL

The document discusses the relationships between pixels in image processing, focusing on concepts such as adjacency, connectivity, and distance measures. It outlines the definitions of 4-neighbors, 8-neighbors, and various types of adjacency, along with examples to illustrate these concepts. Additionally, it touches on the optimization of Mean Squared Error (MSE) in relation to Deep Learning (DL) and Reinforcement Learning (RL).

Uploaded by

Hritik Anand
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views20 pages

Illustration of How MSE Changes With DL and RL

The document discusses the relationships between pixels in image processing, focusing on concepts such as adjacency, connectivity, and distance measures. It outlines the definitions of 4-neighbors, 8-neighbors, and various types of adjacency, along with examples to illustrate these concepts. Additionally, it touches on the optimization of Mean Squared Error (MSE) in relation to Deep Learning (DL) and Reinforcement Learning (RL).

Uploaded by

Hritik Anand
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 20

Illustration of how MSE changes with DL and RL

See what happens when we optimize

Solution to the Homework problems


#1 SQNR = 48.2dB L = 200 256
#2 SQNR = 12.04 dB; step-size
=0.866,Vmax = 1.732
3
4
Basic Relationships Between Pixels
establishing boundaries of objects and components of regions in an image.

► Neighborhood

► Adjacency Two image subsets S1 and S2 are adjacent if some


pixel in S1 is adjacent to some pixel in S2.

► Connectivity One simple relationship between pixels is


connectivity—which pixels are “next to”
which others? Can you “get to” one pixel
from another? If so, how “far” is it?
► Paths

► Regions and boundaries (we will do later)

5
Basic Relationships Between Pixels

► Neighbors of a pixel p at coordinates (x,y)

 4-neighbors of p, denoted by N4(p)(H/V)


(x-1, y), (x+1, y), (x,y-1), and (x, y+1).

 4 diagonal neighbors of p, denoted by ND(p):


(x-1, y-1), (x+1, y+1), (x+1,y-1), and (x-1, y+1).

 8 neighbors of p, denoted N8(p)


N8(p) = N4(p) U ND(p)

6
7
Similar gray level means that the gray
levels of both pixels belong to set V

Weeks 1 & 2 8
Basic Relationships Between Pixels
Two pixels are adjacent if they are
neighbors and their gray levels are similar
► Adjacency
Let V be the set of intensity values

 4-adjacency: Two pixels p and q with values from V are


4-adjacent if q is in the set N4(p).

 8-adjacency: Two pixels p and q with values from V are


8-adjacent if q is in the set N8(p).

Two image subsets S1 and S2 are adjacent if


some pixel in S1 is adjacent to some pixel in S2.

9
Basic Relationships Between Pixels

► Adjacency
Let V be the set of intensity values

 m-adjacency: Two pixels p and q with values from V are


m-adjacent if

(i) q is in the set N4(p), or

(ii) q is in the set ND(p) and the set N4(p) ∩ N4(p) has no pixels whose
values are from V.

10
Weeks 1 & 2 11
Examples: Adjacency and Path
V = {1, 2}

0 1 1
1,1 1,2 1,3 0 1 1 0 1 1
0 2 0
2,1 2,2 2,3 0 2 0 0 2 0
0 0 1
3,1 3,2 3,3 0 0 1 0 0 1
8-adjacent m-adjacent

The 8-path from (1,3) to (3,3): The m-path from (1,3) to (3,3):
(i) (1,3), (1,2), (2,2), (3,3) (1,3), (1,2), (2,2), (3,3)
(ii) (1,3), (2,2), (3,3)

12
13
14
Basic Relationships Between Pixels

► Connected in S
Let S represent a subset of pixels in an image. Two
pixels p with coordinates (x0, y0) and q with
coordinates (xn, yn) are said to be connected in S
if there exists a path

(x0, y0), (x1, y1), …, (xn, yn)


i,0  i  n,( xi , yi )  S
Where

15
Let S represent a subset of pixels in an image

► For every pixel p in S, the set of pixels in S that are


connected to p is called a connected component of S.

► If S has only one connected component, then S is called


Connected Set.

► We call R a region of the image if R is a connected set

► Two regions, Ri and Rj are said to be adjacent if their union


forms a connected set.
► Regions that are not to be adjacent are said to be disjoint.

16
17
Distance Measures

► Given pixels p, q and z with coordinates (x, y), (s, t),


(u, v) respectively, the distance function D has
following properties:

a. D(p, q) ≥ 0 [D(p, q) = 0, iff p = q]

b. D(p, q) = D(q, p)

c. D(p, z) ≤ D(p, q) + D(q, z)

18
19
Weeks 1 & 2 20

You might also like