Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[HTML][HTML] The connected-component labeling problem: A review of state-of-the-art algorithms
L He, X Ren, Q Gao, X Zhao, B Yao, Y Chao - Pattern Recognition, 2017 - Elsevier
This article addresses the connected-component labeling problem which consists in
assigning a unique label to all pixels of each connected component (ie, each object) in a …
assigning a unique label to all pixels of each connected component (ie, each object) in a …
[PDF][PDF] A threshold selection method from gray-level histograms
N Otsu - Automatica, 1975 - dspace.tul.cz
Summary 16S rRNA-targeted oligonucleotide probes for eubacteria (EUB338), ammonium-
oxidizing bacteria (Nsm156) and nitrite-oxidizing bacteria (Nb1000) were used for the rapid …
oxidizing bacteria (Nsm156) and nitrite-oxidizing bacteria (Nb1000) were used for the rapid …
The watershed transform: Definitions, algorithms and parallelization strategies
The watershed transform is the method of choice for image segmentation in the field of
mathematical morphology. We present a critical review of several definitions of the …
mathematical morphology. We present a critical review of several definitions of the …
[LLIBRE][B] Design for embedded image processing on FPGAs
DG Bailey - 2023 - books.google.com
Design for Embedded Image Processing on FPGAs Bridge the gap between software and
hardware with this foundational design reference Field-programmable gate arrays (FPGAs) …
hardware with this foundational design reference Field-programmable gate arrays (FPGAs) …
Fast connected-component labeling
Labeling of connected components in a binary image is one of the most fundamental
operations in pattern recognition: labeling is required whenever a computer needs to …
operations in pattern recognition: labeling is required whenever a computer needs to …
Linear-time connected-component labeling based on sequential local operations
K Suzuki, I Horiba, N Sugie - Computer Vision and Image Understanding, 2003 - Elsevier
This paper presents a fast algorithm for labeling connected components in binary images
based on sequential local operations. A one-dimensional table, which memorizes label …
based on sequential local operations. A one-dimensional table, which memorizes label …
Optimizing two-pass connected-component labeling algorithms
We present two optimization strategies to improve connected-component labeling
algorithms. Taking together, they form an efficient two-pass labeling algorithm that is fast and …
algorithms. Taking together, they form an efficient two-pass labeling algorithm that is fast and …
A run-based two-scan labeling algorithm
L He, Y Chao, K Suzuki - IEEE transactions on image …, 2008 - ieeexplore.ieee.org
We present an efficient run-based two-scan algorithm for labeling connected components in
a binary image. Unlike conventional label-equivalence-based algorithms, which resolve …
a binary image. Unlike conventional label-equivalence-based algorithms, which resolve …
Parallel computations on reconfigurable meshes
The mesh with reconfigurable bus is presented as a model of computation. The
reconfigurable mesh captures salient features from a variety of sources, including the …
reconfigurable mesh captures salient features from a variety of sources, including the …
A new minimum variance region growing algorithm for image segmentation
Region growing is a very useful technique for image segmentation. Its efficiency mainly
depends on its aggregation criterion. In the present paper, a new algorithm is proposed with …
depends on its aggregation criterion. In the present paper, a new algorithm is proposed with …