Return
Image superresolution using support vector regression
DOI:10.1109/TIP.2007.896644.png)
Abstract
En 中文
A thorough investigation of the application of support vector regression (SVR) to the superresolution problem is conducted through various frameworks. Prior to the study, the SVR problem is enhanced by finding the optimal kernel. This is done by formulating the kernel learning problem in SVR form as a convex optimization problem, specifically a semi-definite programming (SDP) problem. An additional constraint is added to reduce the SDP to a quadratically constrained quadratic programming (QCQP) problem. After this optimization, investigation of the relevancy of SVR to superresolution proceeds with the possibility of using a single and general support vector regression for all image content, and the results are impressive for small training sets. This idea is improved upon by observing structural properties in the discrete cosine transform (DCT) domain to aid in learning the regression. Further improvement involves a combination of classification and SVR-based techniques, extending works in resolution synthesis. This method, termed kernel resolution synthesis, uses specific regressors for isolated image content to describe the domain through a partitioned look of the vector space, thereby yielding good results.
Keywords:
kernel matrix
nonlinear regression
resolution synthesis
superresolution
support vector regression (SVR)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.7
Papers:
1.0W
Citations:
8.4W
Organization
No organization information available
Cited Papers
ISOLATION OF AMYLOID P COMPONENT (PROTEIN AP) FROM NORMAL SERUM AS A CALCIUM-DEPENDENT BINDING PROTEIN
The Lancet
IF0
Solution structure of 5-keto-D-fructose: relevance to the specificity of hexose kinases
Biochemistry
IF0

