Changeset 12186

Timestamp:

Mar 2, 2007, 11:48:12 AM (19 years ago)

Author:

Paul Price

Message:

The usual way is much faster (factor of 3) for filled kernels. Might
want to count the number of zero pixels in the kernel and use the
result to choose the algorithm.

File:

• trunk/psLib/src/imageops/psImageConvolve.c (modified) (2 diffs)

trunk/psLib/src/imageops/psImageConvolve.c

@@ -7 +7 @@
 /// @author Eugene Magnier, IfA
 ///
-/// @version $Revision: 1.48 $ $Name: not supported by cvs2svn $
-/// @date $Date: 2007-03-02 21:05:52 $
+/// @version $Revision: 1.49 $ $Name: not supported by cvs2svn $
+/// @date $Date: 2007-03-02 21:48:12 $
 ///
 /// Copyright 2004-2007 Institute for Astronomy, University of Hawaii
@@ -215 +215 @@
     psImage *out;                       // Image to be returned
 
-#if 0
+#if 1
 
     // This is the usual way of doing the convolution, but it wastes time if there's a large number of zero