Structure extraction from texture via relative total variation
It is ubiquitous that meaningful structures are formed by or appear over textured surfaces.
Extracting them under the complication of texture patterns, which could be regular, near …
Extracting them under the complication of texture patterns, which could be regular, near …
An efficient algorithm for calculating the exact Hausdorff distance
The Hausdorff distance (HD) between two point sets is a commonly used dissimilarity
measure for comparing point sets and image segmentations. Especially when very large …
measure for comparing point sets and image segmentations. Especially when very large …
[图书][B] Computer vision: algorithms and applications
R Szeliski - 2022 - books.google.com
Humans perceive the three-dimensional structure of the world with apparent ease. However,
despite all of the recent advances in computer vision research, the dream of having a …
despite all of the recent advances in computer vision research, the dream of having a …
Factorized graph matching
F Zhou, F De la Torre - IEEE transactions on pattern analysis …, 2015 - ieeexplore.ieee.org
Graph matching (GM) is a fundamental problem in computer science, and it plays a central
role to solve correspondence problems in computer vision. GM problems that incorporate …
role to solve correspondence problems in computer vision. GM problems that incorporate …
A survey of urban reconstruction
This paper provides a comprehensive overview of urban reconstruction. While there exists a
considerable body of literature, this topic is still under active research. The work reviewed in …
considerable body of literature, this topic is still under active research. The work reviewed in …
Visual place recognition with repetitive structures
Repeated structures such as building facades, fences or road markings often represent a
significant challenge for place recognition. Repeated structures are notoriously hard for …
significant challenge for place recognition. Repeated structures are notoriously hard for …
The generalized patchmatch correspondence algorithm
PatchMatch is a fast algorithm for computing dense approximate nearest neighbor
correspondences between patches of two image regions [1]. This paper generalizes …
correspondences between patches of two image regions [1]. This paper generalizes …
A computational approach for obstruction-free photography
We present a unified computational approach for taking photos through reflecting or
occluding elements such as windows and fences. Rather than capturing a single image, we …
occluding elements such as windows and fences. Rather than capturing a single image, we …
A statistical approach to material classification using image patch exemplars
M Varma, A Zisserman - IEEE transactions on pattern analysis …, 2008 - ieeexplore.ieee.org
In this paper, we investigate material classification from single images obtained under
unknown viewpoint and illumination. It is demonstrated that materials can be classified using …
unknown viewpoint and illumination. It is demonstrated that materials can be classified using …
Bilateral texture filtering
This paper presents a novel structure-preserving image decomposition operator called
bilateral texture filter. As a simple modification of the original bilateral filter [Tomasi and …
bilateral texture filter. As a simple modification of the original bilateral filter [Tomasi and …