Filters








431 Hits in 2.5 sec

Rooted Spanning Superpixels

Dengfeng Chai
<span title="2020-07-20">2020</span> <i title="Springer Science and Business Media LLC"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hfdglwo5wbbmta6wop52fam7a4" style="color: black;">International Journal of Computer Vision</a> </i> &nbsp;
This paper proposes a new approach for superpixel segmentation. It is formulated as finding a rooted spanning forest of a graph with respect to some roots and a path-cost function.  ...  closeness between two pixels via a path, and each tree in the spanning forest represents one superpixel.  ...  Rooted Spanning Superpixels This paper formulates superpixel segmentation as finding a rooted spanning forest F of a graph G representing an image I with respect to a set of roots R and a path-cost function  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11263-020-01352-9">doi:10.1007/s11263-020-01352-9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ss7f4nhkxbgyvax7wwy7uxttqe">fatcat:ss7f4nhkxbgyvax7wwy7uxttqe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201108112943/https://link.springer.com/content/pdf/10.1007/s11263-020-01352-9.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/9e/36/9e360de92b35e9f2368e89d043a8527f70bf8e21.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11263-020-01352-9"> <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>

Correction to: Rooted Spanning Superpixels

Dengfeng Chai
<span title="2020-10-16">2020</span> <i title="Springer Science and Business Media LLC"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hfdglwo5wbbmta6wop52fam7a4" style="color: black;">International Journal of Computer Vision</a> </i> &nbsp;
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11263-020-01391-2">doi:10.1007/s11263-020-01391-2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5xjtczcjr5cabb27dx6smp6fbe">fatcat:5xjtczcjr5cabb27dx6smp6fbe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210429102703/https://link.springer.com/content/pdf/10.1007/s11263-020-01391-2.pdf?error=cookies_not_supported&amp;code=6743da35-afd6-4fd8-91cb-4aea02e1690c" 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/a4/8c/a48c55feac71e6b581958f90fd99f45878043f38.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11263-020-01391-2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Supplementary material for: An Iterative Spanning Forest Framework for Superpixel Segmentation

John E. Vargas-Munoz, Ananda S. Chowdhury, Eduardo B. Alexandre, Felipe L. Galvao, Paulo A. Vechiatto Miranda, Alexandre X. Falcao
<span title="">2019</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;
The superpixels in ISF structurally correspond to spanning trees rooted at those seeds. We present five ISF methods to illustrate different choices of its components.  ...  Superpixel segmentation has become an important research problem in image processing.  ...  The resulting superpixels are spanning trees rooted at those seeds. Boundary adherence and superpixel regularity are inversely related properties.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tip.2019.2897941">doi:10.1109/tip.2019.2897941</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xfs3pzjernd4lhdfpok4hi63ky">fatcat:xfs3pzjernd4lhdfpok4hi63ky</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200913225635/https://arxiv.org/pdf/1801.10041v1.pdf" title="fulltext PDF download [not primary version]" 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] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cb/ad/cbad306400f4b5ff70230300b29ff00ccbcb43ea.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tip.2019.2897941"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Superpixel Segmentation using Dynamic and Iterative Spanning Forest [article]

F.C. Belem and S.J.F. Guimaraes and A.X. Falcao
<span title="2020-07-08">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
(b) The seeds compete among themselves, and each seed conquers its most closely connected pixels, resulting in an image partition (spanning forest) with connected superpixels.  ...  We have investigated a solution based on the Iterative Spanning Forest (ISF) framework. In this work, we present Dynamic ISF (DISF) -- a method based on the following steps.  ...  For the given seed set and path-cost function, the Image Foresting Transform (IFT) algorithm [8] computes a spanning forest in the graph such that each tree is a connected superpixel rooted at one seed  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2007.04257v1">arXiv:2007.04257v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gk4rzfltkzh2tm7gvf2w4kqpwa">fatcat:gk4rzfltkzh2tm7gvf2w4kqpwa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200710073345/https://arxiv.org/pdf/2007.04257v1.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] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2007.04257v1" 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>

Boundary-Aware Superpixel Segmentation Based on Minimum Spanning Tree

Li XU, Bing LUO, Zheng PEI
<span title="2018-06-01">2018</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;
In this paper, we propose a boundary-aware superpixel segmentation method, which could quickly and exactly extract superpixel with a non-iteration framework.  ...  The basic idea is to construct a minimum spanning tree (MST) based on structure edge to measure the local similarity among pixels, and then label each pixel as the index with shortest path seeds.  ...  In this paper, a novel geodesic distance-based superpixel segmentation method is proposed, of which the basic idea is to measure the distance among pixels along minimum spanning tree.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1587/transinf.2017edl8235">doi:10.1587/transinf.2017edl8235</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/f24ihnv2g5gidlbscnl3hlv4mm">fatcat:f24ihnv2g5gidlbscnl3hlv4mm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190504180839/https://www.jstage.jst.go.jp/article/transinf/E101.D/6/E101.D_2017EDL8235/_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/8c/4f/8c4f9c2b97e38a7752201fae463b615e85ed7779.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1587/transinf.2017edl8235"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Augmented tree partitioning for interactive image segmentation

Yangqing Jia, Jingdong Wang, Changshui Zhang, Xian-Sheng Hua
<span title="">2008</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/anlh4tvwprcrtoxv5d4h6a7rye" style="color: black;">2008 15th IEEE International Conference on Image Processing</a> </i> &nbsp;
many existing methods that use a graph structure to model the image, we use a tree-based structure called the augmented tree, which is built up by augmenting several abstract label nodes to the minimum spanning  ...  Int(C) = max (u,v)∈MST (C) g(u, v), (8) where the maximization is done over the edges in the minimum spanning tree MST (C) of the superpixel C.  ...  The graph structure is constructed by setting the superpixels as the nodes and connecting two superpixels iff they are spatial neighbors.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icip.2008.4712249">doi:10.1109/icip.2008.4712249</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icip/JiaWZH08.html">dblp:conf/icip/JiaWZH08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iw33vivzzbghtfgxqqdgokqvcy">fatcat:iw33vivzzbghtfgxqqdgokqvcy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190611075737/http://daggerfs.com/assets/pdf/icip08_atp.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/98/98/989860ee8605c8ae53316959ad4c7d0417fddc1e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icip.2008.4712249"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

IFT-SLIC: A General Framework for Superpixel Generation Based on Simple Linear Iterative Clustering and Image Foresting Transform

Eduardo Barreto Alexandre, Ananda Shankar Chowdhury, Alexandre Xavier Falcao, Paulo A. Vechiatto Miranda
<span title="">2015</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hplpd6af5zbedpxqbmdj3kyssm" style="color: black;">2015 28th SIBGRAPI Conference on Graphics, Patterns and Images</a> </i> &nbsp;
Image representation based on superpixels has become indispensable for improving efficiency in Computer Vision systems.  ...  Experimental results indicate better superpixel extraction using the proposed approach as compared to that of SLIC.  ...  At the end of the assignment step, each cluster/superpixel will be represented by its respective tree in the spanning forest (i.e., the predecessor map P ) computed by the IFT.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/sibgrapi.2015.20">doi:10.1109/sibgrapi.2015.20</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sibgrapi/Barreto-Alexandre15.html">dblp:conf/sibgrapi/Barreto-Alexandre15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zys4ayg57jh2xnhscgasoieiiy">fatcat:zys4ayg57jh2xnhscgasoieiiy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170812080757/http://sibgrapi.sid.inpe.br/col/sid.inpe.br/sibgrapi/2015/06.12.04.07/doc/00078.pdf?metadatarepository=sid.inpe.br/sibgrapi/2015/06.12.04.07.28&amp;mirror=sid.inpe.br/banon/2005/06.06.21.48" 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/f6/c1/f6c1c0f3384ba73731f23c5d310e4931b0aac87f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/sibgrapi.2015.20"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Prime Object Proposals with Randomized Prim's Algorithm

Santiago Manen, Matthieu Guillaumin, Luc Van Gool
<span title="">2013</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/753trptklbb4nj6jquqadzwwdu" style="color: black;">2013 IEEE International Conference on Computer Vision</a> </i> &nbsp;
Using the connectivity graph of an image's superpixels, with weights modelling the probability that neighbouring superpixels belong to the same object, the algorithm generates random partial spanning trees  ...  With proposals bound to superpixel boundaries yet diversified by randomization, it yields very high detection rates and windows that tightly fit objects.  ...  The Randomized Prim's Algorithm We cast the problem of sampling connected groups of superpixels that are likely to contain the same object as that of sampling partial spanning trees of superpixels that  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/iccv.2013.315">doi:10.1109/iccv.2013.315</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/iccv/ManenGG13.html">dblp:conf/iccv/ManenGG13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ch6en4swnrefrdpqo7zgkqltga">fatcat:ch6en4swnrefrdpqo7zgkqltga</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181104075145/https://lirias2repo.kuleuven.be/bitstream/handle/123456789/450464/3716_final_OA.pdf;jsessionid=7C3A59E289DE38691B40FDE9E392D139?sequence=1" 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/52/cc/52cc35a16608640c9136eef059688b851cbd358c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/iccv.2013.315"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Computer-aided detection of pattern changes in longitudinal adaptive optics images of the retinal pigment epithelium

Jianfei Liu, HaeWon Jung, Johnny Tam
<span title="">2018</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qcepwfkflvg5toaa6fh2alj3b4" style="color: black;">2018 IEEE 15th International Symposium on Biomedical Imaging (ISBI 2018)</a> </i> &nbsp;
Next, AO-ICG images are decomposed into superpixels, simplified to a pictorial structure, and then matched across visits using tree-based belief propagation.  ...  Additionally, the continuity assumption is often not fulfilled between adjacent superpixels. We reduce the graph structure in Eq. (8) into a minimum-spanning tree [12] (Fig. 2C ).  ...  Superpixel decompositions on the AO-ICG image from the (A) first and (B) second visits; (C) tree structure of superpixels from the first visit (red circle, tree root); (D) superpixel displacements of the  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/isbi.2018.8363517">doi:10.1109/isbi.2018.8363517</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/30416669">pmid:30416669</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC6221457/">pmcid:PMC6221457</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/isbi/LiuJT18.html">dblp:conf/isbi/LiuJT18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nmx6biaaqnck7apswon6berige">fatcat:nmx6biaaqnck7apswon6berige</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200210123344/http://europepmc.org/backend/ptpmcrender.fcgi?accid=PMC6221457&amp;blobtype=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/19/96195bfd35151d692c8e4f853f95204121afbd53.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/isbi.2018.8363517"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6221457" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

Superpixel Segmentation Based on Anisotropic Edge Strength

Gang Wang, Bernard De Baets
<span title="2019-06-05">2019</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/au3ye363lzbdroopx7rzfyv63m" style="color: black;">Journal of Imaging</a> </i> &nbsp;
We incorporate the anisotropic edge strength into the distance measure between neighboring superpixels, thereby improving the performance of an existing graph-based superpixel segmentation method.  ...  Superpixel segmentation can benefit from the use of an appropriate method to measure edge strength.  ...  Then, the superpixels are obtained by finding the minimum spanning tree of the graph. A spanning tree is an undirected, weighted, and acyclic subgraph.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/jimaging5060057">doi:10.3390/jimaging5060057</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/34460495">pmid:34460495</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/y7je74hwp5c7fftjv4bcvy7deu">fatcat:y7je74hwp5c7fftjv4bcvy7deu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200216173315/https://res.mdpi.com/d_attachment/jimaging/jimaging-05-00057/article_deploy/jimaging-05-00057.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/ea/4f/ea4f9b4f06ea9bc3dfcc510f98b388d35e866d33.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/jimaging5060057"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

Superpixels for Video Content Using a Contour-Based EM Optimization [chapter]

Matthias Reso, Jörn Jachalsky, Bodo Rosenhahn, Jörn Ostermann
<span title="">2015</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
A wide variety of computer vision applications rely on superpixel or supervoxel algorithms as a preprocessing step.  ...  In this paper, we propose a novel, contour-based approach that generates temporally consistent superpixels for video content.  ...  The unusual behavior of OnlineVideoSeeds for UE may have its roots in the code provided by the authors.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-16817-3_45">doi:10.1007/978-3-319-16817-3_45</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/btjn3fb3yregjow5ztsztosd4q">fatcat:btjn3fb3yregjow5ztsztosd4q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321055453/http://www.tnt.uni-hannover.de/papers/data/1048/accv2014finalpaper.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/db/d8/dbd821309b0f76692e9137cc913ba6cef2b4ceed.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-16817-3_45"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Cross-trees, edge and superpixel priors-based cost aggregation for stereo matching

Feiyang Cheng, Hong Zhang, Mingui Sun, Ding Yuan
<span title="">2015</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jm6w2xclfzguxnhmnmq5omebpi" style="color: black;">Pattern Recognition</a> </i> &nbsp;
Additionally, two different priors: edge prior and superpixel prior, are proposed to tackle the false cost aggregations which cross the depth boundaries.  ...  Compared to other spanning trees, the significant superiorities of the cross-trees are that the trees' constructions are efficient and the trees are exactly unique since the constructions are independent  ...  Yang constructed a MST which has the minimum sum of the edge weights among all the spanning trees of G [16] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.patcog.2015.01.002">doi:10.1016/j.patcog.2015.01.002</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/26034314">pmid:26034314</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC4448781/">pmcid:PMC4448781</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/63fhzegjirex7ldg4epgoftbnu">fatcat:63fhzegjirex7ldg4epgoftbnu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200209072753/http://europepmc.org/backend/ptpmcrender.fcgi?accid=PMC4448781&amp;blobtype=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/e2/44/e2445605b9c5d94d97f5dcf73488aee63acf6384.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.patcog.2015.01.002"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4448781" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

SuperDepthTransfer: Depth Extraction from Image Using Instance-Based Learning with Superpixels

<span title="2017-10-31">2017</span> <i title="Korean Society for Internet Information (KSII)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hupfbobgkvepdnt5g32qxkypsy" style="color: black;">KSII Transactions on Internet and Information Systems</a> </i> &nbsp;
Our technique, which is fundamentally based on a preexisting DepthTransfer algorithm, transfers depth information at the level of superpixels.  ...  conducted using the Make3D Range Image Dataset and vividly demonstrate that this depth estimation method outperforms state-of-the-art methods for the correlation coefficient metric, mean log10 error and root  ...  Let be t-th edge connecting and in the ordering, i.e., = ( , ). and denote the maximum edge in the Minimum Spanning Tree (MST) of −1 and −1 separately.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3837/tiis.2017.10.015">doi:10.3837/tiis.2017.10.015</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2gnzpyjlqzecdhkom6gtxv6a2y">fatcat:2gnzpyjlqzecdhkom6gtxv6a2y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210715064802/http://itiis.org/digital-library/manuscript/file/21579/TIISVol11No10-15.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/5f/e7/5fe77b26d5e11d9ed0011ab88253e8d75ed34bca.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3837/tiis.2017.10.015"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Efficient spectral endmember detection onboard the EO-1 spacecraft

Ben Bornstein, David R. Thompson, Daniel Tran, Brian Bue, Steve Chien, Rebecca Castano
<span title="">2011</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ao54s6nulvbsdnbbncuz4yl4gi" style="color: black;">2011 3rd Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing (WHISPERS)</a> </i> &nbsp;
Here an efficient superpixel endmember detection algorithm keeps to the limited computational constraints of the flight processor.  ...  Specifically, the largest segment weight of the minimum tree spanning the two clusters cannot be significantly larger than the maximum segment of either component's individual spanning tree.  ...  For instance, when computing Euclidean distance, the final square root computation is omitted; for spectral angle distance, only the dot product projection is computed, the inverse cosine is dropped.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/whispers.2011.6080886">doi:10.1109/whispers.2011.6080886</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/whispers/BornsteinTTBCC11.html">dblp:conf/whispers/BornsteinTTBCC11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sbxb2phfynbe5i4wq52xjuwjx4">fatcat:sbxb2phfynbe5i4wq52xjuwjx4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160829121959/http://davidraythompson.com//publications/2011_WHISPERS_ThompsonB.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/58/78/5878f2a8c3ab26d1f01274c78aae7f577bb41fad.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/whispers.2011.6080886"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Superpixel Estimation for Hyperspectral Imagery

Pegah Massoudifar, Anand Rangarajan, Paul Gader
<span title="">2014</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ilwxppn4d5hizekyd3ndvy2mii" style="color: black;">2014 IEEE Conference on Computer Vision and Pattern Recognition Workshops</a> </i> &nbsp;
Here, we present an approach to superpixel estimation in hyperspectral images by adapting the well known UCM approach to hyperspectral volumes.  ...  Furthermore, superpixel estimation performed on the compact hyperspectral representation outperforms the same when executed on the entire volume.  ...  Some methods have exploited the correlation between spatial and spectral neighbors and used support vector machine (SVM) training [4] , minimum spanning forests [15] , classification using the watershed  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/cvprw.2014.51">doi:10.1109/cvprw.2014.51</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/cvpr/MassoudifarRG14.html">dblp:conf/cvpr/MassoudifarRG14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hgfaezkyerfaxdnsmfufwqgjym">fatcat:hgfaezkyerfaxdnsmfufwqgjym</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808024558/https://www.cise.ufl.edu/~anand/pdf/pbvs_cvpr2014_pegah_webversion.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/cc/6f/cc6ff4bf976d2a3a0ef7184edc606400a979f4aa.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/cvprw.2014.51"> <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 431 results