1 | initial version |
Try to write algorithm. For a rect I look for extremun in rectangle (or line for cross). I can use previous result for a pixel to calculate new pixel
Now I cannot do like this for MORPH_ELLIPS I have to scan two arrays. I cannot use previous results For each pixel I need to scan all neighbourood
2 | No.2 Revision |
Try to write algorithm. For a rect I look for extremun in rectangle (or line for cross). I can use previous result for a pixel to calculate new pixelpixel. Rect and cross are separable filter
Now I cannot do like this for MORPH_ELLIPS I have to scan two arrays. I cannot use previous results For each pixel I need to scan all neighbourood
3 | No.3 Revision |
Try to write algorithm. For a rect I look for extremun in rectangle (or line for cross). I can use previous result for a pixel to calculate new pixel. Rect and cross are separable filter
Now I cannot do like this for MORPH_ELLIPS I have to scan two arrays. I cannot use previous results For each pixel I need to scan all neighbouroodneighbouhood It is not a separable filter