gwy_field_normalize()

void
gwy_field_normalize (GwyField *field);

Normalizes data in a data field to range 0.0 to 1.0.

It is equivalent to gwy_field_renormalize(field , 1.0, 0.0);

If field is filled with only one value, it is changed to 0.0.

gwy_field_renormalize()

void
gwy_field_renormalize (GwyField *field,
                       gdouble range,
                       gdouble offset);

Transforms data in a data field with linear function to given range.

When range is positive, the new data range is (offset , offset +range ); when range is negative, the new data range is (offset -range , offset ). In neither case the data are flipped, negative range only means different selection of boundaries.

When range is zero, this method is equivalent to gwy_field_fill(field , offset ).

gwy_field_area_renormalize()

void
gwy_field_area_renormalize (GwyField *field,
                            gint col,
                            gint row,
                            gint width,
                            gint height,
                            gdouble range,
                            gdouble offset);

Transforms data in a part of a data field with linear function to given range.

When range is positive, the new data range is (offset , offset +range ); when range is negative, the new data range is (offset -range , offset ). In neither case the data are flipped, negative range only means different selection of boundaries.

When range is zero, this method is equivalent to gwy_field_fill(field , offset ).

gwy_field_threshold()

gint
gwy_field_threshold (GwyField *field,
                     gdouble threshold,
                     gdouble below,
                     gdouble above);

Tresholds values of a data field.

Values smaller than threshold are set to value below , values higher than threshold or equal to it are set to value above .

gwy_field_area_threshold()

gint
gwy_field_area_threshold (GwyField *field,
                          gint col,
                          gint row,
                          gint width,
                          gint height,
                          gdouble threshold,
                          gdouble below,
                          gdouble above);

Tresholds values of a rectangular part of a data field.

Values smaller than threshold are set to value below , values higher than threshold or equal to it are set to value above

gwy_field_clamp()

gint
gwy_field_clamp (GwyField *field,
                 gdouble bottom,
                 gdouble top);

Limits data field values to a range.

gwy_field_area_clamp()

gint
gwy_field_area_clamp (GwyField *field,
                      gint col,
                      gint row,
                      gint width,
                      gint height,
                      gdouble bottom,
                      gdouble top);

Limits values in a rectangular part of a data field to a range.

gwy_field_area_gather()

void
gwy_field_area_gather (GwyField *field,
                       GwyField *result,
                       GwyField *buffer,
                       gint hsize,
                       gint vsize,
                       gboolean average,
                       gint col,
                       gint row,
                       gint width,
                       gint height);

Sums or averages values in reactangular areas around each sample in a data field.

When the gathered area extends out of calculation area, only samples from their intersection are taken into the local sum (or average).

There are no restrictions on values of hsize and vsize with regard to width and height , but they have to be positive.

The result is calculated by the means of two-dimensional rolling sums. One one hand it means the calculation time depends linearly on (width + hsize )*(height + vsize ) instead of width *hsize *height *vsize . On the other hand it means absolute rounding errors of all output values are given by the largest input values, that is relative precision of results small in absolute value may be poor.

gwy_field_convolve()

void
gwy_field_convolve (GwyField *field,
                    GwyField *kernel_field);

Convolves a data field with given kernel.

Note that the convolution is done by summation and can be slow for large kernels.

gwy_field_area_convolve()

void
gwy_field_area_convolve (GwyField *field,
                         GwyField *kernel_field,
                         gint col,
                         gint row,
                         gint width,
                         gint height);

Convolves a rectangular part of a data field with given kernel.

Note that the convolution is done by summation and can be slow for large kernels.

gwy_field_fft_convolve()

void
gwy_field_fft_convolve (GwyField *field,
                        GwyField *kernel_field);

Convolves a data field with given kernel of the same size using FFT.

This is a simple FFT-based convolution done by multiplication in the frequency domain.

This is a somewhat low-level function. There is no padding or boundary treatment; images are considered periodic. The result is normalised as if the convolution was done by summation and the physical units of field are unchanged.

Also note that in order to obtain unshifted result, the kernel needs to be centered around the top left corner. You can use gwy_field_fft_2d_decenter() to transform a centered kernel.

gwy_field_area_ext_convolve()

void
gwy_field_area_ext_convolve (GwyField *field,
                             guint col,
                             guint row,
                             guint width,
                             guint height,
                             GwyField *target,
                             GwyField *kernel,
                             GwyExteriorType exterior,
                             gdouble fill_value,
                             gboolean as_integral);

Convolve a field with a two-dimensional kernel.

Pixel dimensions of target may match either field or just the rectangular area. In the former case the result is written in the same rectangular area; in the latter case the result fills the entire target .

The convolution is performed with the kernel centred on the respective field pixels. For directions in which the kernel has an odd size this holds precisely. For an even-sized kernel this means the kernel centre is placed 0.5 pixel left or up (towards lower indices) from the respective field pixel.

See gwy_field_extend() for what constitutes the exterior and how it is handled.

If as_integral is FALSE the function performs a simple discrete convolution sum and the value units of target are set to product of field and kernel units.

If as_integral is TRUE the function approximates a convolution integral. In this case kernel should be a sampled continuous transfer function. The units of value target are set to product of field and kernel value units and field lateral units squared. Furthermore, the discrete sum is multiplied by the pixel size (i.e. dx dy in the integral).

In either case, the lateral units and pixel size of kernel are assumed to be the same as for field (albeit not checked), because the convolution does not make sense otherwise.

gwy_field_convolve_1d()

void
gwy_field_convolve_1d (GwyField *field,
                       GwyLine *kernel_line,
                       GwyOrientation orientation);

Convolves a data field with given linear kernel.

gwy_field_area_convolve_1d()

void
gwy_field_area_convolve_1d (GwyField *field,
                            GwyLine *kernel_line,
                            GwyOrientation orientation,
                            gint col,
                            gint row,
                            gint width,
                            gint height);

Convolves a rectangular part of a data field with given linear kernel.

For large separable kernels it can be more efficient to use a sequence of horizontal and vertical convolutions instead one 2D convolution.

gwy_field_area_ext_row_convolve()

void
gwy_field_area_ext_row_convolve (GwyField *field,
                                 guint col,
                                 guint row,
                                 guint width,
                                 guint height,
                                 GwyField *target,
                                 GwyLine *kernel,
                                 GwyExteriorType exterior,
                                 gdouble fill_value,
                                 gboolean as_integral);

Convolve a field row-wise with a one-dimensional kernel.

Pixel dimensions of target may match either field or just the rectangular area. In the former case the result is written in the same rectangular area; in the latter case the result fills the entire target .

The convolution is performed with the kernel centred on the respective field pixels. For an odd-sized kernel this holds precisely. For an even-sized kernel this means the kernel centre is placed 0.5 pixel to the left (towards lower column indices) from the respective field pixel.

See gwy_field_extend() for what constitutes the exterior and how it is handled.

If as_integral is FALSE the function performs a simple discrete convolution sum and the value units of target are set to product of field and kernel units.

If as_integral is TRUE the function approximates a convolution integral. In this case kernel should be a sampled continuous transfer function. The units of value target are set to product of field and kernel value units and field lateral units. Furthermore, the discrete sum is multiplied by the pixel size (i.e. dx in the integral).

In either case, the lateral units and pixel size of kernel are assumed to be the same as for a field 's row (albeit not checked), because the convolution does not make sense otherwise.

gwy_field_filter_median()

void
gwy_field_filter_median (GwyField *field,
                         gint size);

Filters a data field with median filter.

This method uses a simple square kernel. Use the general function gwy_field_area_filter_kth_rank() to perform filtering with a different kernel, for instance circular.

gwy_field_area_filter_median()

void
gwy_field_area_filter_median (GwyField *field,
                              gint size,
                              gint col,
                              gint row,
                              gint width,
                              gint height);

Filters a rectangular part of a data field with median filter.

This method uses a simple square kernel. Use the general function gwy_field_area_filter_kth_rank() to perform filtering with a different kernel, for instance circular.

gwy_field_filter_mean()

void
gwy_field_filter_mean (GwyField *field,
                       gint size);

Filters a data field with mean filter of size size .

This method is a simple gwy_field_area_gather() wrapper, so the kernel is square. Use convolution gwy_field_area_ext_convolve() to perform a mean filter with different, for instance circular, kernel.

gwy_field_area_filter_mean()

void
gwy_field_area_filter_mean (GwyField *field,
                            gint size,
                            gint col,
                            gint row,
                            gint width,
                            gint height);

Filters a rectangular part of a data field with mean filter of size size .

This method is a simple gwy_field_area_gather() wrapper, so the kernel is square. Use convolution gwy_field_area_ext_convolve() to perform a mean filter with different, for instance circular, kernel.

gwy_field_filter_conservative()

void
gwy_field_filter_conservative (GwyField *field,
                               gint size);

Filters a data field with conservative denoise filter.

gwy_field_area_filter_conservative()

void
gwy_field_area_filter_conservative (GwyField *field,
                                    gint size,
                                    gint col,
                                    gint row,
                                    gint width,
                                    gint height);

Filters a rectangular part of a data field with conservative denoise filter.

gwy_field_filter_laplacian()

void
gwy_field_filter_laplacian (GwyField *field);

Filters a data field with Laplacian filter.

gwy_field_area_filter_laplacian()

void
gwy_field_area_filter_laplacian (GwyField *field,
                                 gint col,
                                 gint row,
                                 gint width,
                                 gint height);

Filters a rectangular part of a data field with Laplacian filter.

gwy_field_filter_laplacian_of_gaussians()

void
gwy_field_filter_laplacian_of_gaussians
                               (GwyField *field);

Filters a data field with Laplacian of Gaussians filter.

gwy_field_area_filter_laplacian_of_gaussians()

void
gwy_field_area_filter_laplacian_of_gaussians
                               (GwyField *field,
                                gint col,
                                gint row,
                                gint width,
                                gint height);

Filters a rectangular part of a data field with Laplacian of Gaussians filter.

gwy_field_filter_sobel()

void
gwy_field_filter_sobel (GwyField *field,
                        GwyOrientation orientation);

Filters a data field with a directional Sobel filter.

gwy_field_area_filter_sobel()

void
gwy_field_area_filter_sobel (GwyField *field,
                             GwyOrientation orientation,
                             gint col,
                             gint row,
                             gint width,
                             gint height);

Filters a rectangular part of a data field with a directional Sobel filter.

gwy_field_filter_sobel_total()

void
gwy_field_filter_sobel_total (GwyField *field);

Filters a data field with total Sobel filter.

gwy_field_filter_prewitt()

void
gwy_field_filter_prewitt (GwyField *field,
                          GwyOrientation orientation);

Filters a data field with Prewitt filter.

gwy_field_area_filter_prewitt()

void
gwy_field_area_filter_prewitt (GwyField *field,
                               GwyOrientation orientation,
                               gint col,
                               gint row,
                               gint width,
                               gint height);

Filters a rectangular part of a data field with a directional Prewitt filter.

gwy_field_filter_prewitt_total()

void
gwy_field_filter_prewitt_total (GwyField *field);

Filters a data field with total Prewitt filter.

gwy_field_filter_slope()

void
gwy_field_filter_slope (GwyField *field,
                        GwyField *xder,
                        GwyField *yder);

Calculates x and y derivaties for an entire field.

The derivatives are in physical units (not pixel-wise) and calculated from simple symmetrical differences, except at the edges where the differences are one-sided.

gwy_field_filter_gauss_step()

void
gwy_field_filter_gauss_step (GwyField *field,
                             gdouble sigma);

Processes a data field with Gaussian step detection filter.

The filter is a multi-directional combination of convolutions with Gaussian multiplied by a signed step function.

The resulting values correspond roughly to the step height around the pixel.

gwy_field_filter_dechecker()

void
gwy_field_filter_dechecker (GwyField *field);

Filters a data field with 5x5 checker pattern removal filter.

gwy_field_area_filter_dechecker()

void
gwy_field_area_filter_dechecker (GwyField *field,
                                 gint col,
                                 gint row,
                                 gint width,
                                 gint height);

Filters a rectangular part of a data field with 5x5 checker pattern removal filter.

gwy_field_filter_gaussian()

void
gwy_field_filter_gaussian (GwyField *field,
                           gdouble sigma);

Filters a data field with a Gaussian filter.

gwy_field_area_filter_gaussian()

void
gwy_field_area_filter_gaussian (GwyField *field,
                                gdouble sigma,
                                gint col,
                                gint row,
                                gint width,
                                gint height);

Filters a rectangular part of a data field with a Gaussian filter.

The Gausian is normalized, i.e. it is sum-preserving.

gwy_field_row_gaussian()

void
gwy_field_row_gaussian (GwyField *field,
                        gdouble sigma);

Filters a data field with a Gaussian filter in horizontal direction.

The Gausian is normalized, i.e. it is sum-preserving.

gwy_field_column_gaussian()

void
gwy_field_column_gaussian (GwyField *field,
                           gdouble sigma);

Filters a data field with a Gaussian filter in vertical direction.

The Gausian is normalized, i.e. it is sum-preserving.

gwy_field_filter_minimum()

void
gwy_field_filter_minimum (GwyField *field,
                          gint size);

Filters a data field with minimum filter.

This method uses a simple square kernel. Use the general function gwy_field_area_filter_min_max() to perform filtering with a different kernel, for instance circular.

gwy_field_area_filter_minimum()

void
gwy_field_area_filter_minimum (GwyField *field,
                               gint size,
                               gint col,
                               gint row,
                               gint width,
                               gint height);

Filters a rectangular part of a data field with minimum filter.

This operation is often called erosion filter.

This method uses a simple square kernel. Use the general function gwy_field_area_filter_min_max() to perform filtering with a different kernel, for instance circular.

Another difference is that this function filters the rectangular area as an independent data field. Meaning, only values inside the rectangle influence the result.

gwy_field_filter_maximum()

void
gwy_field_filter_maximum (GwyField *field,
                          gint size);

Filters a data field with maximum filter.

This method uses a simple square kernel. Use the general function gwy_field_area_filter_min_max() to perform filtering with a different kernel, for instance circular.

gwy_field_area_filter_maximum()

void
gwy_field_area_filter_maximum (GwyField *field,
                               gint size,
                               gint col,
                               gint row,
                               gint width,
                               gint height);

Filters a rectangular part of a data field with maximum filter.

This operation is often called dilation filter.

This method uses a simple square kernel. Use the general function gwy_field_area_filter_min_max() to perform filtering with a different kernel, for instance circular.

Another difference is that this function filters the rectangular area as an independent data field. Meaning, only values inside the rectangle influence the result.

gwy_field_filter_min_max()

void
gwy_field_filter_min_max (GwyField *field,
                          GwyNield *kernel,
                          GwyMinMaxFilterType filtertype);

Applies a morphological operation with a flat structuring element to a data field.

See gwy_field_area_filter_min_max() for description. This function simply applies the operation the entire field.

gwy_field_area_filter_min_max()

void
gwy_field_area_filter_min_max (GwyField *field,
                               GwyNield *kernel,
                               GwyMinMaxFilterType filtertype,
                               gint col,
                               gint row,
                               gint width,
                               gint height);

Applies a morphological operation with a flat structuring element to a part of a data field.

Morphological operations with flat structuring elements can be expressed using minimum (erosion) and maximum (dilation) filters that are the basic operations this function can perform.

The kernel field is a mask that defines the shape of the flat structuring element. It is reflected for all maximum operations (dilation). For symmetrical kernels this does not matter. You can use gwy_field_elliptic_area_fill() to create a true circular (or elliptical) kernel.

The kernel is implicitly centered, i.e. it will be applied symmetrically to avoid unexpected data movement. Even-sized kernels (generally not recommended) will extend farther towards the top left image corner for minimum (erosion) and towards the bottom right corner for maximum (dilation) operations due to the reflection. If you need off-center structuring elements you can add empty rows or columns to one side of the kernel to counteract the symmetrisation.

The operation is linear-time in kernel size for any convex kernel. Note gwy_field_area_filter_minimum() and gwy_field_area_filter_maximum(), which are limited to square structuring elements, are much faster for large sizes of the squares.

The exterior is always handled as GWY_EXTERIOR_BORDER. For most reasonable kernels, it makes no difference, and the result is the same as if there was no exterior. However, for odd-shaped, non-convex kernels, there is a difference. For example, near image boundaries, such kernel can intersect with the image in such a way that all its pixels lie outside the image. The exterior then still gives a well-defined value.

gwy_field_area_filter_disc_asf()

void
gwy_field_area_filter_disc_asf (GwyField *field,
                                gint radius,
                                gboolean closing,
                                gint col,
                                gint row,
                                gint width,
                                gint height);

Applies an alternating sequential morphological filter with a flat disc structuring element to a part of a data field.

Alternating sequential filter is a filter consisting of repeated opening and closing (or closing and opening) with progressively larger structuring elements. This function performs such filtering for sequence of structuring elements consisting of true Euclidean discs with increasing radii. The largest disc in the sequence fits into a (2size  + 1) × (2size  + 1) square.

gwy_nield_filter_min_max()

void
gwy_nield_filter_min_max (GwyNield *nield,
                          GwyNield *kernel,
                          GwyMinMaxFilterType filtertype);

Applies a morphological operation with a flat structuring element to a number field.

See gwy_field_area_filter_min_max() for more details on kernels and exterior handling.

The minimum and maximum filters are executed on the nield content as-is. Although it can be occasionaly useful to do so with number fields containing aribrary integers, the typical use of this function is as a binary image morphological operation. In such case first flatten the input to 0 and 1 with gwy_nield_flatten().

gwy_nield_area_filter_min_max()

void
gwy_nield_area_filter_min_max (GwyNield *nield,
                               GwyNield *kernel,
                               GwyMinMaxFilterType filtertype,
                               gint col,
                               gint row,
                               gint width,
                               gint height);

Applies a morphological operation with a flat structuring element to a part of a number field.

See gwy_field_area_filter_min_max() for more details on kernels and exterior handling.

The minimum and maximum filters are executed on the nield content as-is. Although it can be occasionaly useful to do so with number fields containing aribrary integers, the typical use of this function is as a binary image morphological operation. In such case first flatten the input to 0 and 1 with gwy_nield_flatten().

gwy_nield_area_filter_disc_asf()

void
gwy_nield_area_filter_disc_asf (GwyNield *nield,
                                gint radius,
                                gboolean closing,
                                gint col,
                                gint row,
                                gint width,
                                gint height);

Applies an alternating sequential morphological filter with a flat disc structuring element to a part of a number field.

Alternating sequential filter is a filter consisting of repeated opening and closing (or closing and opening) with progressively larger structuring elements. This function performs such filtering for sequence of structuring elements consisting of true Euclidean discs with increasing radii. The largest disc in the sequence fits into a (2size  + 1) × (2size  + 1) square.

The opening and closing filters are executed on the nield content as-is. Although it can be occasionaly useful to do so with number fields containing aribrary integers, the typical use of this function is as a binary image morphological operation. In such case first flatten the input to 0 and 1 with gwy_nield_flatten().

gwy_field_area_filter_kth_rank()

gboolean
gwy_field_area_filter_kth_rank (GwyField *field,
                                GwyNield *kernel,
                                gint col,
                                gint row,
                                gint width,
                                gint height,
                                gint k,
                                GwySetFractionFunc set_fraction);

Applies a k -th rank filter to a part of a data field.

Pass half the number of non-zero values in kernel as k for a median filter.

The kernel field is a mask that defines the shape of the kernel. You can use gwy_nield_elliptic_area_fill() to create a true circular (or elliptical) kernel. The kernel field must contain at least k +1 pixels with positive values.

The kernel is implicitly centered, i.e. it will be applied symmetrically to avoid unexpected data movement.

The exterior is always handled as GWY_EXTERIOR_BORDER. Considering exterior pixels ensures that even close to image edges, there are always the same number of values for the k -th rank calculation. It also makes the result well-defined for odd-shaped, non-convex kernels, which can intersect with the image in such a way that all its pixels lie outside the image. However, it increases the weight of boundary values close to image edges.

If the operation is aborted the contents of field is untouched.

gwy_line_part_filter_kth_rank()

void
gwy_line_part_filter_kth_rank (GwyLine *line,
                               gint klen,
                               gint pos,
                               gint len,
                               gint k);

Applies a k -th rank filter to a part of a data line.

The exterior is always handled as GWY_EXTERIOR_BORDER.

gwy_field_area_filter_trimmed_mean()

gboolean
gwy_field_area_filter_trimmed_mean (GwyField *field,
                                    GwyNield *kernel,
                                    gint col,
                                    gint row,
                                    gint width,
                                    gint height,
                                    gint nlowest,
                                    gint nhighest,
                                    GwySetFractionFunc set_fraction);

Applies a trimmed mean filter to a part of a data field.

At least one value must remain after the trimming, i.e. nlowest + nhighest must be smaller than the number of non-zero values in kernel . Usually one passes the same number as both nlowest and nhighest , but it is not a requirement.

The kernel field is a mask that defines the shape of the kernel. You can use gwy_field_elliptic_area_fill() to create a true circular (or elliptical) kernel. The kernel field must contain at least nlowest +nhighest +1 pixels with positive values.

The kernel is implicitly centered, i.e. it will be applied symmetrically to avoid unexpected data movement. Even-sized kernels (generally not recommended) will extend farther towards the top left image corner for minimum (erosion) and towards the bottom right corner for maximum (dilation) operations due to the reflection. If you need off-center structuring elements you can add empty rows or columns to one side of the kernel to counteract the symmetrisation.

The exterior is always handled as GWY_EXTERIOR_BORDER. Considering exterior pixels ensures that even close to image edges, there are always the same number of values for the omission of nlowest and nhighest . It also makes the result well-defined for odd-shaped, non-convex kernels, which can intersect with the image in such a way that all its pixels lie outside the image. However, it increases the weight of boundary values close to image edges.

If the operation is aborted the contents of field is untouched.

gwy_field_filter_rms()

void
gwy_field_filter_rms (GwyField *field,
                      gint size);

Filters a data field with RMS filter.

gwy_field_area_filter_rms()

void
gwy_field_area_filter_rms (GwyField *field,
                           gint size,
                           gint col,
                           gint row,
                           gint width,
                           gint height);

Filters a rectangular part of a data field with RMS filter of size size .

RMS filter computes root mean square in given area.

gwy_field_filter_kuwahara()

void
gwy_field_filter_kuwahara (GwyField *field);

Filters a data field with Kuwahara filter.

gwy_field_area_filter_kuwahara()

void
gwy_field_area_filter_kuwahara (GwyField *field,
                                gint col,
                                gint row,
                                gint width,
                                gint height);

Filters a rectangular part of a data field with a Kuwahara (edge-preserving smoothing) filter.

gwy_field_filter_canny()

void
gwy_field_filter_canny (GwyField *field,
                        gdouble threshold);

Filters a rectangular part of a data field with canny edge detector filter.

gwy_field_shade()

void
gwy_field_shade (GwyField *field,
                 GwyField *target_field,
                 gdouble theta,
                 gdouble phi);

Shades a data field.

gwy_field_filter_harris()

void
gwy_field_filter_harris (GwyField *x_gradient,
                         GwyField *y_gradient,
                         GwyField *result,
                         gint neighbourhood,
                         gdouble alpha);

Applies Harris corner detection filter to a pair of gradient data fields.

All passed data field must have the same size.

gwy_field_deconvolve_regularized()

void
gwy_field_deconvolve_regularized (GwyField *field,
                                  GwyField *operand,
                                  GwyField *out,
                                  gdouble sigma);

Performs deconvolution of a data field using a simple regularization.

The operation can be used to deblur an image or conversely recover the point spread function from ideal response image.

Convolving the result with the operand using gwy_field_area_ext_convolve() with as_integral =TRUE will recover (approximately) the image. This means the deconvolution assumes continous convolution, not discrete sums. Note that for the latter case this means the point spread function will be centered in out .

For recovery of transfer function, field and operand should be windowed beforehand if they are not periodic.

gwy_field_deconvolve_psf_leastsq()

void
gwy_field_deconvolve_psf_leastsq (GwyField *field,
                                  GwyField *operand,
                                  GwyField *out,
                                  gdouble sigma,
                                  gint border);

Performs reconstruction of transfer function from convolved and ideal sharp images.

The transfer function is reconstructed by solving the corresponding least squares problem. This method is suitable when the dimensions of out are much smaller than the images.

Since the method accumulates errors close to edges, they can be removed within the procedure by reconstructing a slightly larger transfer function and then cutting the result. The extension is given by border , typical suitable values are 2 or 3.

Convolving the result with the operand using gwy_field_area_ext_convolve() with as_integral =TRUE will recover (approximately) the image. This means the deconvolution assumes continous convolution, not discrete sums. Note that for the latter case this means the point spread function will be centered in out .

Fields field and operand should be windowed beforehand if they are not periodic.

gwy_field_find_regularization_sigma_for_psf()

gdouble
gwy_field_find_regularization_sigma_for_psf
                               (GwyField *field,
                                GwyField *ideal);

Finds regularization parameter for point spread function calculation using regularized deconvolution.

The estimated value should be suitable for reconstruction of the point spread function using gwy_field_deconvolve_regularized(). The estimate is only suitable for PSF, it does not work for image sharpening using a known PSF.

gwy_field_find_regularization_sigma_leastsq()

gdouble
gwy_field_find_regularization_sigma_leastsq
                               (GwyField *field,
                                GwyField *ideal,
                                gint width,
                                gint height,
                                gint border);

Finds regularization parameter for point spread function calculation using least squares method.

The estimated value should be suitable for reconstruction of the point spread function using gwy_field_deconvolve_psf_leastsq().

enum GwyMinMaxFilterType

Type of operation based on morphological filters with flat structuring elements.