paper-with-me

Papers

BoundaryNet: An Attentive Deep Network with Fast Marching Distance Maps for Semi-automatic Layout Annotation

2021-08-21 · Abhishek Trivedi, Ravi Kiran Sarvadevabhatla

Precise boundary annotations of image regions can be crucial for downstream applications which rely on region-class semantics. Some document collections contain densely laid out, highly irregular and overlapping multi-class region instances with large range in aspect ratio. Fully automatic boundary estimation approaches tend to be data intensive, cannot handle variable-sized images and produce sub-optimal results for aforementioned images. To address these issues, we propose BoundaryNet, a novel resizing-free approach for high-precision semi-automatic layout annotation. The variable-sized user selected region of interest is first processed by an attention-guided skip network. The network optimization is guided via Fast Marching distance maps to obtain a good quality initial boundary estimate and an associated feature representation. These outputs are processed by a Residual Graph Convolution Network optimized using Hausdorff loss to obtain the final region boundary. Results on a challenging image manuscript dataset demonstrate that BoundaryNet outperforms strong baselines and produces high-quality semantic region boundaries. Qualitatively, our approach generalizes across multiple document image datasets containing different script systems and layouts, all without additional fine-tuning. We integrate BoundaryNet into a document annotation system and show that it provides high annotation throughput compared to manual and fully automatic alternatives.

📄 PDF Abstract BibTeX arXiv:2108.09433

Code (1)

ihdia/BoundaryNet 공식 구현 pytorch

Methods 이 논문이 사용한 방법론

BoundaryNet 설명 없음
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…

Similar Papers 제목 키워드 기반

MeshUDF: Fast and Differentiable Meshing of Unsigned Distance Field Networks

2021-11-29 · Benoit Guillard, Federico Stella, Pascal Fua

Unsigned Distance Fields (UDFs) can be used to represent non-watertight surfaces. However, current approaches to converting them into explicit meshes tend to either be expensive or to degrade the accuracy. Here, we exten…

Theoretical and Empirical Analysis of a Fast Algorithm for Extracting Polygons from Signed Distance Bounds

2021-11-10 · Nenad Markuš, Mirko Sužnjević

Recently there has been renewed interest in signed distance bound representations due to their unique properties for 3D shape modelling. This is especially the case for deep learning-based bounds. However, it is benefici…

SuperNormal: Neural Surface Reconstruction via Multi-View Normal Integration

2023-12-08 · CVPR 2024 1 · Xu Cao, Takafumi Taketomi

We present SuperNormal, a fast, high-fidelity approach to multi-view 3D reconstruction using surface normal maps. With a few minutes, SuperNormal produces detailed surfaces on par with 3D scanners. We harness volume rend…

3D ReconstructionMulti-View 3D ReconstructionSurface Reconstruction

Distance Marching for Generative Modeling

2026-02-03 · Zimo Wang, Ishit Mehta, Haolin Lu, Chung-En Sun 외 arxiv

Time-unconditional generative models learn time-independent denoising vector fields. But without time conditioning, the same noisy input may correspond to multiple noise levels and different denoising directions, which i…

SurfCut: Surfaces of Minimal Paths From Topological Structures

2017-04-30 · Marei Algarni, Ganesh Sundaramoorthi

We present SurfCut, an algorithm for extracting a smooth, simple surface with an unknown 3D curve boundary from a noisy 3D image and a seed point. Our method is built on the novel observation that certain ridge curves of…