Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Joab R. Winkler"'
Publikováno v:
Applied Numerical Mathematics. 166:348-368
This paper considers the computation of the greatest common divisor (GCD) d t 1 , t 2 ( x , y ) of three bivariate Bernstein polynomials that are defined in a rectangular domain, where t 1 ( t 2 ) is the degree of d t 1 , t 2 ( x , y ) when it is wri
The aim of variable selection is the identification of the most important predictors that define the response of a linear system. Many techniques for variable selection use a constrained least squares ( LS ) formulation in which the constraint is imp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::799e11f86bc9850970a2d56cbe590058
https://eprints.whiterose.ac.uk/179180/1/RevisedWMK.pdf
https://eprints.whiterose.ac.uk/179180/1/RevisedWMK.pdf
Autor:
Hanan Halawani, Joab R. Winkler
Publikováno v:
Journal of Mathematical Imaging and Vision. 60:1284-1305
Blind image deconvolution ( $$\text {BID}$$ ) is one of the most important problems in image processing, and it requires the determination of an exact image $$\mathcal {F}$$ from a degraded form of it $$\mathcal {G}$$ when little or no information ab
Publikováno v:
Journal of Computational and Applied Mathematics. 320:221-241
This paper describes a non-linear structure-preserving ma\ud trix method for the com-\ud putation of the coefficients of an approximate greatest commo\ud n divisor (AGCD) of\ud degree\ud t\ud of two Bernstein polynomials\ud f\ud (\ud y\ud ) and\ud g\
Publikováno v:
Journal of Computational and Applied Mathematics. 390:113381
This paper considers an approximate factorisation of three bivariate Bernstein basis polynomials that are defined in a triangular domain. This problem is important for the computation of the intersection points of curves in computer-aided design syst
The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
Publikováno v:
Applied Numerical Mathematics. 111:17-35
This paper considers the computation of the degree t of an approximate greatest common divisor d ( y ) of two Bernstein polynomials f ( y ) and g ( y ) , which are of degrees m and n respectively. The value of t is computed from the QR decomposition
Publikováno v:
Linear Algebra and its Applications. 502:1-4
Autor:
Joab R. Winkler
Publikováno v:
Linear Algebra and its Applications. 502:77-103
This paper considers the problem of blind image deconvolution (BID) when the blur arises from a spatially invariant point spread function (PSF) H, which implies that a blurred image G is formed by the convolution of H and the exact form F of G. Since
Autor:
Joab R. Winkler, Marilena Mitrouli
Publikováno v:
Journal of Computational and Applied Mathematics. 373:112212
Regression and feature selection require the minimisation of X β − y 2 with respect to β , where X ∈ R n × p , n p in feature selection and n ≥ p in regression. The vector β contains the coefficients of the basis functions in regression, an
Publikováno v:
Journal of Computational and Applied Mathematics. 373:112373
This paper considers the application of the Sylvester resultant matrix to the computation of the degree of the greatest common divisor ( GCD ) of three Bernstein basis polynomials f ( y ) , g ( y ) and h ( y ) . It is shown that the governing equatio