Studying for my finals in Image Processing. Trying to solve the following question:
An image processing specialist recommended an algorithm for Edge Detection in a color image RGB. He argued that it was unnecessary to switch to a different color model. You can calculate the gradient in each of the three images R, G and B, and calculate a new vector which is the sum of the gradients. Using the sum of the gradients we find the edges. Why is he wrong?
The solution was:
Consider color of figure $C_{\text{Figure}}^{\text{RGB}}=\left(100,0,0\right)$ and color of background $C_{\text{Background}}^{\text{RGB}}=\left(0,100,0\right)$. The gradient of the red color element will be the same size as that of the green color element but their marks will be opposite so we will get the sum of the gradients to be zero, even though there is an actual edge.
I'm trying to understand the solution. I understand that in theory you will get the same size, but why they are opposite? How do I move from the color into the gradient, mathematically speaking? Is it possible to provide a more "formal" argument?