I studied your solution and think there will be a very huge array with kronecker operator and generated the planes with a for loop.
And now I have the problem with the max() function for all planes, at which in the resulting plane each pixel should have the max. values of the according pixels of the planes mentioned. max() works of a known number of planes: resu=max(monos (:,:,1),monos (:,:,2),monos (:,:,3)) What is the smartest way to code, if the number of planes can differ? -- View this message in context: http://mailinglists.scilab.org/automatic-traverse-question-tp4036327p4036377.html Sent from the Scilab users - Mailing Lists Archives mailing list archive at Nabble.com. _______________________________________________ users mailing list users@lists.scilab.org http://lists.scilab.org/mailman/listinfo/users
