Výsledky vyhľadávania - Connected component based algorithm
-
1
An efficient watershed algorithm based on connected components
ISSN: 0031-3203, 1873-5142Vydavateľské údaje: Elsevier Ltd 01.06.2000Vydané v Pattern recognition (01.06.2000)“… The novelty of the approach is to adapt the connected component operator to solve the watershed segmentation problem…”
Získať plný text
Journal Article -
2
Efficient parallel algorithm for finding strongly connected components based on granulation strategy: Efficient parallel algorithm
ISSN: 0219-1377, 0219-3116Vydavateľské údaje: London Springer London 01.03.2025Vydané v Knowledge and information systems (01.03.2025)“…Strongly connected components (SCCs) are a significant subgraph structure in digraphs…”
Získať plný text
Journal Article -
3
Blindness detection in diabetic retinopathy using Bayesian variant-based connected component algorithm in Keras and TensorFlow
ISSN: 2226-1494, 2500-0373Vydavateľské údaje: ITMO University 01.12.2024Vydané v Nauchno-tekhnicheskiĭ vestnik informat͡s︡ionnykh tekhnologiĭ, mekhaniki i optiki (01.12.2024)“… The proposed modeling consists of three stages: pre-training, fine-tuning and inference. The probabilistic based pixel identification (Bayesian variant…”
Získať plný text
Journal Article -
4
Parallel CPU- and GPU-based connected component algorithms for event building for hybrid pixel detectors
ISSN: 1748-0221Vydavateľské údaje: IOP Publishing 01.01.2025Vydané v Journal of instrumentation (01.01.2025)Získať plný text
Journal Article -
5
Graph-Based Maximum Connected-Component Learning Algorithm for Small Target Detection in Maritime Radars
ISSN: 0018-9251, 1557-9603Vydavateľské údaje: New York IEEE 01.02.2025Vydané v IEEE transactions on aerospace and electronic systems (01.02.2025)“… In low-dimensional feature spaces, by combining training samples with the convexity regularity on decision regions, the convexhull learning algorithm is a technique for designing one-class classifiers…”
Získať plný text
Journal Article -
6
Block-Based Connected-Component Labeling Algorithm Using Binary Decision Trees
ISSN: 1424-8220, 1424-8220Vydavateľské údaje: Switzerland MDPI AG 18.09.2015Vydané v Sensors (Basel, Switzerland) (18.09.2015)“…In this paper, we propose a fast labeling algorithm based on block-based concepts…”
Získať plný text
Journal Article -
7
FPGA-Based Connected Component Algorithm for Vegetation Segmentation
ISSN: 2278-3075, 2278-3075Vydavateľské údaje: 30.01.2020Vydané v International journal of innovative technology and exploring engineering (30.01.2020)“… In the case of remote sensing vegetation, the image usually contains multiple connected areas or overlapped trees…”
Získať plný text
Journal Article -
8
Optimized Block-Based Algorithms to Label Connected Components on GPUs
ISSN: 1045-9219, 1558-2183Vydavateľské údaje: New York IEEE 01.02.2020Vydané v IEEE transactions on parallel and distributed systems (01.02.2020)“…Connected Components Labeling (CCL) is a crucial step of several image processing and computer vision pipelines…”
Získať plný text
Journal Article -
9
Protecting Privacy in Location-Based Services Through Location Anonymization Using Cloaking Algorithms Based on Connected Components
ISSN: 0929-6212, 1572-834XVydavateľské údaje: New York Springer US 01.09.2018Vydané v Wireless personal communications (01.09.2018)“… Specifically to cloak location-contexts a new component based graph model called Cloaked Region Construction Algorithm (CRCA…”
Získať plný text
Journal Article -
10
Two Efficient Label-Equivalence-Based Connected-Component Labeling Algorithms for 3-D Binary Images
ISSN: 1057-7149, 1941-0042, 1941-0042Vydavateľské údaje: New York, NY IEEE 01.08.2011Vydané v IEEE transactions on image processing (01.08.2011)“…) in binary images, labeling is required. This paper presents two efficient label-equivalence-based connected-component labeling algorithms for 3-D binary images…”
Získať plný text
Journal Article -
11
Efficient parallel algorithm for finding strongly connected components based on granulation strategy
ISSN: 0219-1377, 0219-3116Vydavateľské údaje: London Springer Nature B.V 01.03.2025Vydané v Knowledge and information systems (01.03.2025)“…Strongly connected components (SCCs) are a significant subgraph structure in digraphs…”
Získať plný text
Journal Article -
12
Strongly Connected Components Mining Algorithm Based on k-step Search of Vertex Granule and Rough Set Theory
ISSN: 1002-137XVydavateľské údaje: Chongqing Guojia Kexue Jishu Bu 01.08.2022Vydané v Ji suan ji ke xue (01.08.2022)“…Strong connected components(SCCs) mining is one of the classic problems in graph…”
Získať plný text
Journal Article -
13
Block-run-based connected component labelling algorithm for GPGPU using shared memory
ISSN: 0013-5194, 1350-911XVydavateľské údaje: Stevenage Institution of Engineering and Technology 24.11.2011Vydané v Electronics letters (24.11.2011)Získať plný text
Journal Article -
14
Birnbaum importance-based simulated annealing algorithm for solving the component assignment problem of linear connected-(r, s)-out-of-(m, n):F lattice systems
ISSN: 0975-6809, 0976-4348Vydavateľské údaje: New Delhi Springer India 01.04.2024Vydané v International journal of system assurance engineering and management (01.04.2024)“… This paper proposes a Birnbaum importance-based simulated annealing (SA) algorithm for the CAP of linear connected-( r , s )-out-of-( m , n ):F lattice systems…”
Získať plný text
Journal Article -
15
A Granulation Strategy-Based Algorithm for Computing Strongly Connected Components in Parallel
ISSN: 2227-7390, 2227-7390Vydavateľské údaje: Basel MDPI AG 01.06.2024Vydané v Mathematics (Basel) (01.06.2024)“…: granulation and granular-based computing. Strongly connected components (SCCs) are a significant subgraph structure in digraphs…”
Získať plný text
Journal Article -
16
Language-Independent Text-Line Extraction Algorithm for Handwritten Documents
ISSN: 1070-9908, 1558-2361Vydavateľské údaje: New York IEEE 01.09.2014Vydané v IEEE signal processing letters (01.09.2014)“… Our method is based on connected components (CCs), however, unlike conventional methods, we analyze strokes and partition under-segmented CCs into normalized ones…”
Získať plný text
Journal Article -
17
Combining a connected-component labeling algorithm with FILTERSIM to simulate continuous discrete fracture networks
ISSN: 1866-6280, 1866-6299Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2017Vydané v Environmental earth sciences (01.04.2017)“… This paper proposes an improved approach we call CCL-FILTERSIM, which combines FILTERSIM with a run-based, connected-component labeling algorithm to generate more continuous fractures…”
Získať plný text
Journal Article -
18
Block-run-based connected component labelling algorithm for GPGPU using shared memory
ISSN: 0013-5194, 1350-911XVydavateľské údaje: Stevenage John Wiley & Sons, Inc 24.11.2011Vydané v Electronics letters (24.11.2011)“…An efficient two-scan connected component labelling (CCL) algorithm is proposed for a general purpose graphics processing unit (GPGPU…”
Získať plný text
Journal Article -
19
Efficient 2×2 block-based connected components labeling algorithms
Vydavateľské údaje: IEEE 01.09.2015Vydané v 2015 IEEE International Conference on Image Processing (ICIP) (01.09.2015)“…This paper presents three new efficient 2×2 block-based algorithms for connected components labeling…”
Získať plný text
Konferenčný príspevok.. -
20
Fast block-based algorithms for connected components labeling
ISSN: 1520-6149Vydavateľské údaje: IEEE 01.05.2013Vydané v Proceedings of the ... IEEE International Conference on Acoustics, Speech and Signal Processing (1998) (01.05.2013)“…Block-based algorithms are considered the fastest approach to label connected components in binary images…”
Získať plný text
Konferenčný príspevok..