Search Results for author:
Found 3 papers, 0 papers with code
Bi-traceable graphs, the intersection of three longest paths and Hippchen's conjecture
We use the results for all the possible configurations of the intersection points when $\#V(P)\cap V(Q)\le 5$ in order to prove that if the intersection of three longest paths $P, Q, R$ is empty, then $\#(V(P)\cap V(Q))\ge 6$.
Combinatorics 05C38 (primary) 05C45 (secondary)
Image Denoising with Kernels based on Natural Image Relations
In this paper, we propose an alternative non-explicit way to take into account the relations among natural image wavelet coefficients for denoising: we use support vector regression (SVR) in the wavelet domain to enforce these relations in the estimated signal.
On the Suitable Domain for SVM Training in Image Coding
We analytically demonstrate that no linear domain fulfills this condition because of the statistical and perceptual inter-coefficient relations that exist in these domains.
