An editor has performed a search and found that
sufficient sources exist to establish the subject's
notability. (July 2024) |
The Frei-Chen operator, sometimes called Frei and Chen operator, is used in image processing for edge detection. It was proposed by Werner Frei and Chung-Ching Chen, researchers at USC's Image Processing Institute, in 1977 [1]. The idea is to use a set of orthogonal basis vectors related to distinctive image features, which enable the algorithm to extract boundary elements effectively.
The operator uses nine 3x3 kernels which are convolved with the original image to calculate the gradient.
We define the nine kernels as:
Let be the image sub-area, and be the angle (in space), is the number of orthgonal edge basis vectors spanning the edge subspace.
The larger , the poorer the fit between B and an element of the edge subspace.
The strategy is to classify image sub-area as containing and edge element only if is small which is done by thresholding.
The image is convoled with each of the kernel. Thus, 9 results are obtained.
Vectors are used for edge subspace identification. Hence numerator in the formula will be . Similarly, for line subspace identification, the numerator will be .
Using formula, we compute , if it is above a certain threshold , we say that an edge is detected in the image sub-area.
Here, frie-chen operator, along with three different gradient operators is used to detect edges in the test image.
An editor has performed a search and found that
sufficient sources exist to establish the subject's
notability. (July 2024) |
The Frei-Chen operator, sometimes called Frei and Chen operator, is used in image processing for edge detection. It was proposed by Werner Frei and Chung-Ching Chen, researchers at USC's Image Processing Institute, in 1977 [1]. The idea is to use a set of orthogonal basis vectors related to distinctive image features, which enable the algorithm to extract boundary elements effectively.
The operator uses nine 3x3 kernels which are convolved with the original image to calculate the gradient.
We define the nine kernels as:
Let be the image sub-area, and be the angle (in space), is the number of orthgonal edge basis vectors spanning the edge subspace.
The larger , the poorer the fit between B and an element of the edge subspace.
The strategy is to classify image sub-area as containing and edge element only if is small which is done by thresholding.
The image is convoled with each of the kernel. Thus, 9 results are obtained.
Vectors are used for edge subspace identification. Hence numerator in the formula will be . Similarly, for line subspace identification, the numerator will be .
Using formula, we compute , if it is above a certain threshold , we say that an edge is detected in the image sub-area.
Here, frie-chen operator, along with three different gradient operators is used to detect edges in the test image.