|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM259097691 |
| 003 |
DE-627 |
| 005 |
20231224190441.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231224s2016 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TIP.2016.2549362
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0863.xml
|
| 035 |
|
|
|a (DE-627)NLM259097691
|
| 035 |
|
|
|a (NLM)27046898
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Perez-Pellitero, Eduardo
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Antipodally Invariant Metrics for Fast Regression-Based Super-Resolution
|
| 264 |
|
1 |
|c 2016
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 19.05.2017
|
| 500 |
|
|
|a Date Revised 19.05.2017
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Dictionary-based super-resolution (SR) algorithms usually select dictionary atoms based on the distance or similarity metrics. Although the optimal selection of the nearest neighbors is of central importance for such methods, the impact of using proper metrics for SR has been overlooked in literature, mainly due to the vast usage of Euclidean distance. In this paper, we present a very fast regression-based algorithm, which builds on the densely populated anchored neighborhoods and sublinear search structures. We perform a study of the nature of the features commonly used for SR, observing that those features usually lie in the unitary hypersphere, where every point has a diametrically opposite one, i.e., its antipode, with same module and angle, but the opposite direction. Even though, we validate the benefits of using antipodally invariant metrics, most of the binary splits use Euclidean distance, which does not handle antipodes optimally. In order to benefit from both the worlds, we propose a simple yet effective antipodally invariant transform that can be easily included in the Euclidean distance calculation. We modify the original spherical hashing algorithm with this metric in our antipodally invariant spherical hashing scheme, obtaining the same performance as a pure antipodally invariant metric. We round up our contributions with a novel feature transform that obtains a better coarse approximation of the input image thanks to iterative backprojection. The performance of our method, which we named antipodally invariant SR, improves quality (Peak Signal to Noise Ratio) and it is faster than any other state-of-the-art method
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Salvador, Jordi
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Ruiz-Hidalgo, Javier
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Rosenhahn, Bodo
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
|d 1992
|g 25(2016), 6 vom: 04. Juni, Seite 2456-68
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
| 773 |
1 |
8 |
|g volume:25
|g year:2016
|g number:6
|g day:04
|g month:06
|g pages:2456-68
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TIP.2016.2549362
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 25
|j 2016
|e 6
|b 04
|c 06
|h 2456-68
|