Computer Vision – ACCV 2007
DOI: 10.1007/978-3-540-76390-1_9
|View full text |Cite
|
Sign up to set email alerts
|

Super Resolution of Images of 3D Scenecs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0
1

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(15 citation statements)
references
References 9 publications
0
14
0
1
Order By: Relevance
“…If it is nonconvex, the time consuming simulated annealing can be used [5] (1987), [6], [135], [241], [483], or else Graduated Non-Convexity [95], [293], [496] (with normalized convolution for obtaining an initial good approximation), [540], EM [113], [181], [288], [454], Genetic Algorithm [174], Markov Chain Monte Carlo using Gibbs Sampler [209], [214], [234], [241], [254], [612], Energy Minimization using Graph-Cuts [248], [279], [305], [535], Bregman Iteration [353], [590], proximal iteration [357], (Regularized) Orthogonal Matching Pursuit [390], [464], and Particle Swarm Optimization [448] might be used. [109], [118], [133], [172], [181], [184], [197], [199], [204], [216], [218], [221], [223], [226], [229], [251]…”
Section: Cost Functions and Optimization Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…If it is nonconvex, the time consuming simulated annealing can be used [5] (1987), [6], [135], [241], [483], or else Graduated Non-Convexity [95], [293], [496] (with normalized convolution for obtaining an initial good approximation), [540], EM [113], [181], [288], [454], Genetic Algorithm [174], Markov Chain Monte Carlo using Gibbs Sampler [209], [214], [234], [241], [254], [612], Energy Minimization using Graph-Cuts [248], [279], [305], [535], Bregman Iteration [353], [590], proximal iteration [357], (Regularized) Orthogonal Matching Pursuit [390], [464], and Particle Swarm Optimization [448] might be used. [109], [118], [133], [172], [181], [184], [197], [199], [204], [216], [218], [221], [223], [226], [229], [251]…”
Section: Cost Functions and Optimization Methodsmentioning
confidence: 99%
“…In [606] the TV terms are weighted with an adaptive spatial algorithm based on differences in the curvature. Table 8), which is used to approximate TV, is defined by: [123], [277], [328], [363], [365], [368], [388], [414], [500], [547], [551], [ [123], [133], [149], [253], [260], [272], [276], [282], [313], [314], [328], [375], [428], [452], [588] GMRF [123], [129], [163], [181], [209], [276], [282], [305], [496], [535], [555], [574], [575], [598] TV [73], [84], [124], [157], [245], …”
Section: Markov Random Fields (Mrf)mentioning
confidence: 99%
“…This technology has been an active area of research [1], [2], [3], [4], [5] because it can provide realistic 3-D visual experiences by enabling users to select viewpoints freely and interactively.…”
Section: Introductionmentioning
confidence: 99%
“…In [1,9,14,5], the close relationship between superresolution and 3D scene structure is pointed out and their cooperative solution is studied. In [9], the super-resolution is formulated with the calibrated 3D geometry and solved using the MAP-MRF framework.…”
Section: D Reconstruction and Image Super Resolutionmentioning
confidence: 99%
“…In [9], the super-resolution is formulated with the calibrated 3D geometry and solved using the MAP-MRF framework. Occlusions are effectively handled in their super-resolution method using depth information, but super-resolution does not contribute to depth map estimation in this method.…”
Section: D Reconstruction and Image Super Resolutionmentioning
confidence: 99%