Search Results for author:
Found 7 papers, 5 papers with code
Holistically-Attracted Wireframe Parsing: From Supervised to Self-Supervised Learning
This article presents Holistically-Attracted Wireframe Parsing (HAWP), a method for geometric analysis of 2D images containing wireframes formed by line segments and junctions.
Zero-Assignment Constraint for Graph Matching with Outliers
Graph matching (GM), as a longstanding problem in computer vision and pattern recognition, still suffers from numerous cluttered outliers in practical applications.
Holistically-Attracted Wireframe Parsing
For computing line segment proposals, a novel exact dual representation is proposed which exploits a parsimonious geometric reparameterization for line segments and forms a holistic 4-dimensional attraction field map for an input image.
Ranked #4 on
Line Segment Detection
on wireframe dataset
Learning Regional Attraction for Line Segment Detection
Given a line segment map, the proposed regional attraction first establishes the relationship between line segments and regions in the image lattice.
A Functional Representation for Graph Matching
In this paper, we present a functional representation for graph matching (FRGM) that aims to provide more geometric insights on the problem and reduce the space and time complexities of corresponding algorithms.
Learning Attraction Field Representation for Robust Line Segment Detection
In experiments, our method is tested on the WireFrame dataset and the YorkUrban dataset with state-of-the-art performance obtained.
Adaptively Transforming Graph Matching
Due to an efficient Frank-Wolfe method-based optimization strategy, we can handle graphs with hundreds and thousands of nodes within an acceptable amount of time.
