A General Ambiguity Model for Binary Edge Images with Edge Tracing and its Implementation
원문 초록
We present a general and intuitive ambiguity model for intersections, junctions and other structures in binary edge images. The model is combined with edge tracing, where edges are ordered sequences of connected pixels. The objective is to provide a versatile preprocessing method for tasks such as figure-ground segmentation, object recognition, topological analysis, etc. By using only a small set of straightforward principles, the results are intuitive to describe. This helps to implement subsequent processing steps, such as resolving ambiguous edge connections at junctions. By using an augmented edge map, neighboring edges can be directly accessed using quick local search operations. The edge tracing uses recursion, which leads to compact programming code. We explain our algorithm using pseudocode, compare it with related methods, and show how simple modular postprocessing steps can be used to optimize the results. The complete algorithm, including all data structures, requires less than 50 lines of pseudocode. We also provide a C++ implementation of our method.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
SASep: Saliency-Aware Structured Separation of Geometry and Feature for Open Set Learning on Point Clouds
STSBench: A Spatio-temporal Scenario Benchmark for Multi-modal Large Language Models in Autonomous Driving
InstructSAM: A Training-Free Framework for Instruction-Oriented Remote Sensing Object Recognition
Improving Unsupervised Task-driven Models of Ventral Visual Stream via Relative Position Predictivity
Topology-Guided Knowledge Distillation for Efficient Point Cloud Processing
Naturally Computed Scale Invariance in the Residual Stream of ResNet18
토론
이 논문과 연결된 포럼 글이 아직 없습니다.