Filters








347,059 Hits in 3.0 sec

Connection Scan Algorithm [article]

Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner
<span title="2017-03-17">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We introduce the Connection Scan Algorithm (CSA) to efficiently answer queries to timetable information systems.  ...  We present algorithm variants that only optimize the arrival time or additionally optimize the number of transfers in the Pareto sense.  ...  While developing the Connection Scan algorithms, we have discovered a surprisingly easy way to solve this problem. Consider the Connection Scan earliest arrival profile algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1703.05997v1">arXiv:1703.05997v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zpk6yoyringi3diunskgpg5tx4">fatcat:zpk6yoyringi3diunskgpg5tx4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200911174744/https://arxiv.org/pdf/1703.05997v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/84/2c/842c7d892f80ae8ddf32283da18114305bc53a72.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1703.05997v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Efficient scan mask techniques for connected components labeling algorithm

Phaisarn Sutheebanjard, Wichian Premchaiswadi
<span title="2011-10-06">2011</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xas42nwk7zhbnkycpwsnwjm3te" style="color: black;">EURASIP Journal on Image and Video Processing</a> </i> &nbsp;
We propose two new scan masks for connected components labeling, namely, the pixel-based scan mask and the block-based scan mask.  ...  Block-based connected components labeling is by far the fastest algorithm to label the connected components in 2D binary images, especially when the image size is quite large.  ...  We used their source code in the experiment and implemented our own algorithms based on their source code.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/1687-5281-2011-14">doi:10.1186/1687-5281-2011-14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2r3pvpaaifaxrb2j7322kiqmyq">fatcat:2r3pvpaaifaxrb2j7322kiqmyq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20140222142044/http://jivp.eurasipjournals.com/content/pdf/1687-5281-2011-14.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d9/48/d948c4b89553caea7d4e00e8b4523455ea6d82ad.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/1687-5281-2011-14"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> springer.com </button> </a>

A Single-Scan Algorithm for Connected Components Labelling in a Traffic Monitoring Application [chapter]

Alessandro Bevilacqua, Alessandro Lanza, Giorgio Baccarani, Riccardo Rovatti
<span title="">2003</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45103-x_90">doi:10.1007/3-540-45103-x_90</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ylq5lbucorcj7pfgwubmxrcqk4">fatcat:ylq5lbucorcj7pfgwubmxrcqk4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190505043009/https://link.springer.com/content/pdf/10.1007%2F3-540-45103-X_90.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d7/f4/d7f4180c8ab01a71f0def93cf81c8c5d9b9ebe8d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45103-x_90"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Finding connected components on a scan line array processor

Ronald I. Greenberg
<span title="">1995</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tewj77cuufbzbgbk265bb462ga" style="color: black;">Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA &#39;95</a> </i> &nbsp;
This paper provides a new approach to labeling the connected components of an n n image on a scan line array processor (comprised of n processing elements).  ...  Variations of this approach yield an algorithm guaranteed to complete in o(n lg n) time as well as algorithms likely to approach O(n) time for all or most images.  ...  The high-level algorithm This section gives the high-level algorithm for labeling the connected components of an n n image on the SLAP.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/215399.215444">doi:10.1145/215399.215444</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/spaa/Greenberg95.html">dblp:conf/spaa/Greenberg95</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/72cieyoxybb6xoydishokfr6im">fatcat:72cieyoxybb6xoydishokfr6im</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921232159/http://ecommons.luc.edu/cgi/viewcontent.cgi?article=1104&amp;context=cs_facpubs" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f4/0b/f40bfbba7cba34456a543bc8737ae404cc9c07f3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/215399.215444"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A RUN-BASED ONE-AND-A-HALF-SCAN CONNECTED-COMPONENT LABELING ALGORITHM

LIFENG HE, YUYAN CHAO, KENJI SUZUKI
<span title="">2010</span> <i title="World Scientific Pub Co Pte Lt"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ctczi3cdmjfarjhjbdobmuwpkm" style="color: black;">International journal of pattern recognition and artificial intelligence</a> </i> &nbsp;
This paper presents a run-and label-equivalence-based one-and-a-half-scan algorithm for labeling connected components in a binary image.  ...  Moreover, our algorithm is directly applicable to run-length-encoded images, and we can obtain contours of connected components e±ciently.  ...  s À N À 1, is connected to rðs; eÞ with eight-connectivity, as shown in Fig. 1 . The previous algorithm is a two-scan algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0218001410008032">doi:10.1142/s0218001410008032</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/s2a2b7kuyzharbrs2zeqvrki4a">fatcat:s2a2b7kuyzharbrs2zeqvrki4a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829223317/http://suzukilab.uchicago.edu/pdfs/coauthor/LHeYChaoKSuzuki_RunOneHalfLabeling_IJPRAI2010.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/60/03/6003714755aef12472dd0d52760f6486a34dbe64.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0218001410008032"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> worldscientific.com </button> </a>

Implementation of connection scan algorithm in tourism intermodal transportation journey planner: a case study

Vertic Eridani Budi Darmawan, Yuh Wen Chen
<span title="2020-12-29">2020</span> <i title="Universitas Serang Raya"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xk3o7e6lordlvf76fsuyyaj7i4" style="color: black;">Jurnal Sistem dan Manajemen Industri</a> </i> &nbsp;
The Connection Scan Algorithm is used to find the earliest arrival time routes at their destinations.  ...  Good linkage of travel information and physical connections with local transportation services for intercity travel can facilitate more people to travel and promote national tourism destinations.  ...  RESEARCH METHODS Connection Scan Algorithm The Connection Scan Algorithm (CSA) was firstly introduced in 2013 [19] and well-proven as an efficient public transportation route planning [22] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.30656/jsmi.v4i2.2772">doi:10.30656/jsmi.v4i2.2772</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wnegyauzpvh6xhm66jixxp545i">fatcat:wnegyauzpvh6xhm66jixxp545i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201231032656/https://e-jurnal.lppmunsera.org/index.php/JSMI/article/download/2772/1541" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/79/77/797727971d397e2536f4bb24e4d5b6613c911af0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.30656/jsmi.v4i2.2772"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Detecting overlapped functional clusters in resting state fMRI with Connected Iterative Scan: A graph theory based clustering algorithm

Xiaodan Yan, Stephen Kelley, Mark Goldberg, Bharat B. Biswal
<span title="">2011</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/huhco7lwxvct3fbbxk44mmpflu" style="color: black;">Journal of Neuroscience Methods</a> </i> &nbsp;
This study investigates a method, Connected Iterative Scan (CIS), for identifying functionally overlapped anatomical groups with resting state fMRI.  ...  The brain is a complex neural network with interleaving functional connectivity among anatomical regions.  ...  This study makes use of a graph-theoretic clustering algorithm, called Connected Iterative Scan (CIS).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jneumeth.2011.05.001">doi:10.1016/j.jneumeth.2011.05.001</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/21565220">pmid:21565220</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iychtchbnbcbzgfnksvzx7rtjq">fatcat:iychtchbnbcbzgfnksvzx7rtjq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706071515/http://www.cs.rpi.edu/%7Egoldberg/publications/brain_2011.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/96/d9/96d95feece195f3cbd217be245babe5d11a1aa65.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jneumeth.2011.05.001"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

WITHDRAWN: Detecting overlapped functional clusters in resting state fMRI with connected iterative scan: A graph theory based clustering algorithm

Xiaodan Yan, Stephen Kelley, Mark Goldberg, Bharat B. Biswal
<span title="">2010</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/huhco7lwxvct3fbbxk44mmpflu" style="color: black;">Journal of Neuroscience Methods</a> </i> &nbsp;
This study investigates a method, Connected Iterative Scan (CIS), for identifying functionally overlapped anatomical groups with resting state fMRI.  ...  The brain is a complex neural network with interleaving functional connectivity among anatomical regions.  ...  This study makes use of a graph-theoretic clustering algorithm, called Connected Iterative Scan (CIS).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jneumeth.2010.12.012">doi:10.1016/j.jneumeth.2010.12.012</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/21163303">pmid:21163303</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bdrhzb66h5bk5nvtai7xqprg2u">fatcat:bdrhzb66h5bk5nvtai7xqprg2u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706071515/http://www.cs.rpi.edu/%7Egoldberg/publications/brain_2011.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/96/d9/96d95feece195f3cbd217be245babe5d11a1aa65.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jneumeth.2010.12.012"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

An Algorithm, Eliminating the Conflicts by Diagonal Scanning of the Connection Matrix *

Kiril Kolchakov, Hristo Hristov
<span title="">2007</span> <i > 58 PROBLEMS OF ENGINEERING CYBERNETICS AND ROBOTICS </i> &nbsp; <span class="release-stage">unpublished</span>
An algorithm eliminating the conflicts The approach for eliminating the conflicts consists in scanning the matrix of connections by rows until a unit is found, after that diagonal search for units in the  ...  Before accomplishing the next scanning by the connections matrix, already realized connections must be eliminated.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pd4apdetebhzfkcun2v3lsxfcm">fatcat:pd4apdetebhzfkcun2v3lsxfcm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180410050727/http://www.iit.bas.bg/PECR/58/74-78.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/25/98/259801c3ffe31231f72852839c3ae0d7a3c7ddf8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

A Run-Based Two-Scan Labeling Algorithm

Lifeng He, Yuyan Chao, K. Suzuki
<span title="">2008</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dhlhr4jqkbcmdbua2ca45o7kru" style="color: black;">IEEE Transactions on Image Processing</a> </i> &nbsp;
We present an efficient run-based two-scan algorithm for labeling connected components in a binary image.  ...  When the first scan is finished, all provisional labels that were assigned to each connected component in the given image will have a unique representative label.  ...  Fig. 7 . 7 Provisional labels assigned to a connected component after first scan (a) by a conventional two-scan algorithm and (b) by our algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tip.2008.919369">doi:10.1109/tip.2008.919369</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/18390379">pmid:18390379</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/w2xl4wgdnvb5to2vdkk6pxonwi">fatcat:w2xl4wgdnvb5to2vdkk6pxonwi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829203552/http://suzukilab.uchicago.edu/pdfs/coauthor/LHeYChaoKSuzuki_RunBTwoScanLabeling_IEEETIP2008.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d2/94/d2948fa72d16f3ad922a37a334a153eb5712a2a0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tip.2008.919369"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Linear-time connected-component labeling based on sequential local operations

Kenji Suzuki, Isao Horiba, Noboru Sugie
<span title="">2003</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dsarpzh6wfgadnyijwv5l6gh2i" style="color: black;">Computer Vision and Image Understanding</a> </i> &nbsp;
This paper presents a fast algorithm for labeling connected components in binary images based on sequential local operations.  ...  The proposed algorithm has a desirable characteristic: the execution time is directly proportional to the number of pixels in connected components in an image.  ...  Fig. 2 . 2 Labeling of a stair-like connected component using the conventional algorithm: (a) after the first forward scan; (b) after the first backward scan; (c) after the second forward scan; (d) after  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1077-3142(02)00030-9">doi:10.1016/s1077-3142(02)00030-9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/csziuk7tsje47jdadl3lxfnbem">fatcat:csziuk7tsje47jdadl3lxfnbem</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809000606/https://static.aminer.org/pdf/PDF/000/348/847/fast_connected_component_labeling_based_on_sequential_local_operations_in.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b1/ea/b1eaa8652bdc016f5319f38564daa06bd9be001b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1077-3142(02)00030-9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

A New First-Scan Method for Two-Scan Labeling Algorithms

Lifeng HE, Yuyan CHAO, Kenji SUZUKI
<span title="">2012</span> <i title="Institute of Electronics, Information and Communications Engineers (IEICE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xosmgvetnbf4zpplikelekmdqe" style="color: black;">IEICE transactions on information and systems</a> </i> &nbsp;
This paper proposes a new first-scan method for two-scan labeling algorithms.  ...  In the first scan, our proposed method first scans every fourth image line, and processes the scan line and its two neighbor lines.  ...  There are multi-scan algorithms [17] and two-scan algorithms [7] - [12] , and one-and-a-half scan algorithm [13] ; (2) Label propagation algorithms.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1587/transinf.e95.d.2142">doi:10.1587/transinf.e95.d.2142</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ni55bh6vfzgilhb6b5uoxijzt4">fatcat:ni55bh6vfzgilhb6b5uoxijzt4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170923193716/https://www.jstage.jst.go.jp/article/transinf/E95.D/8/E95.D_2142/_pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/94/9a/949ac7a56e59d10b90d585c2874aa49679e42bae.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1587/transinf.e95.d.2142"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Connected Component Labeling Using Components Neighbors-Scan Labeling Approach

Rakhmadi
<span title="2010-10-01">2010</span> <i title="Science Publications"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wake4w3hqzd4ndiy2zowpciv64" style="color: black;">Journal of Computer Science</a> </i> &nbsp;
This algorithm required scanning through an image only once to label connected components.  ...  Approach: A computational approach, called components neighbors-scan labeling algorithm for connected component labeling was presented in this study.  ...  In this study, we describe a Components Neighbors-Scan algorithm to label connected components.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3844/jcssp.2010.1099.1107">doi:10.3844/jcssp.2010.1099.1107</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5o7b66mfzvge7fjdu6fgfkrpzm">fatcat:5o7b66mfzvge7fjdu6fgfkrpzm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170815041033/http://thescipub.com/PDF/jcssp.2010.1099.1107.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d8/b4/d8b4595a7038af79835c19edac86508766bda583.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3844/jcssp.2010.1099.1107"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Slice-Connection Clustering Algorithm for Tree Roots Recognition in Noisy 3D GPR Data [article]

Wenhao Luo, Yee Hui Lee, Lai Fern Ow, Mohamed Lokman Mohd Yusof, Abdulkadir C. Yucel
<span title="2022-03-08">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
A Slice-Connection Clustering Algorithm (SCC) is applied to separate the regions of interest from each other in a reconstructed 3D image.  ...  Slice-Connection Clustering Algorithm After an input C-scan matrix was generated with multiple Bscans after pre-processing, the SCC algorithm was applied to separate the selected regions into different  ...  The C-scan then went through the proposed SCC algorithm. B.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2203.03830v1">arXiv:2203.03830v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/j3r2rvgafrgphnool2tayglqmi">fatcat:j3r2rvgafrgphnool2tayglqmi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220309034233/https://arxiv.org/ftp/arxiv/papers/2203/2203.03830.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/44/1b/441b0be04ee66fcb3ee0b21f3bce8d3bc3f613c4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2203.03830v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

A Linear-Time Two-Scan Labeling Algorithm

Lifeng He, Yuyan Chao, Kenji Suzuki
<span title="">2007</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/anlh4tvwprcrtoxv5d4h6a7rye" style="color: black;">2007 IEEE International Conference on Image Processing</a> </i> &nbsp;
This paper presents a fast linear-time two-scan algorithm for labeling connected components in binary images.  ...  In the first scan, provisional labels are assigned to object pixels in the same way as do most conventional labeling algorithms.  ...  Experiments showed that four-scan was efficient for completed labeling. (4) Contour-tracing algorithm [7] : This algorithm avoids analysis of label equivalences by tracing the contours of objects (connected  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icip.2007.4379810">doi:10.1109/icip.2007.4379810</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icip/HeCS07.html">dblp:conf/icip/HeCS07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/q3lrqx32cbellofmqjx6lrpyle">fatcat:q3lrqx32cbellofmqjx6lrpyle</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170812124333/http://vigir.missouri.edu/~gdesouza/Research/Conference_CDs/IEEE_ICIP_2007/pdfs/0500241.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9c/e3/9ce3f4e9f2eebdf2ce6711a24f76aae0af85f119.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icip.2007.4379810"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 347,059 results