Relevant bibliographies by topics / Random-Walker algorithm

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Random-Walker algorithm'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Random-Walker algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Random-Walker algorithm"

1

Qi, Yin Cheng, Ting Li, Ming Xiao Xi, Zhen Bing Zhao, and Yin Ping Cai. "An Image Positioning Method of Automatic Random Walker Based on IFS Edge Detection." Applied Mechanics and Materials 599-601 (August 2014): 802–6. http://dx.doi.org/10.4028/www.scientific.net/amm.599-601.802.

Full text
Abstract:
The segmentation method of classical random walker needs to select seed points artificially, and may cause incomplete or inaccurate segmentation. In view of these problems, this paper presents an image positioning method of automatic random walker based on IFS (Intuitionistic Fuzzy Set). IFS edge detection method is used to get the edge information of image, and then the connected domains are found out in image edge using the morphology method. Select the central pixels of each connected domain as seed points for automatic random walker, and then segment the IFS edge image by random walker. Ex
APA, Harvard, Vancouver, ISO, and other styles
2

Wan, Cong, Yanhui Fang, Cong Wang, Yanxia Lv, Zejie Tian, and Yun Wang. "SignRank: A Novel Random Walking Based Ranking Algorithm in Signed Networks." Wireless Communications and Mobile Computing 2019 (April 9, 2019): 1–8. http://dx.doi.org/10.1155/2019/4813717.

Full text
Abstract:
Social networks have become an indispensable part of modern life. Signed networks, a class of social network with positive and negative edges, are becoming increasingly important. Many social networks have adopted the use of signed networks to model like (trust) or dislike (distrust) relationships. Consequently, how to rank nodes from positive and negative views has become an open issue of social network data mining. Traditional ranking algorithms usually separate the signed network into positive and negative graphs so as to rank positive and negative scores separately. However, much global in
APA, Harvard, Vancouver, ISO, and other styles
3

Soufi, Motahare, Alireza Kamali-Asl, Parham Geramifar, Mehrsima Abdoli, and Arman Rahmim. "Combined fuzzy logic and random walker algorithm for PET image tumor delineation." Nuclear Medicine Communications 37, no. 2 (2016): 171–81. http://dx.doi.org/10.1097/mnm.0000000000000428.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

XU, BAOMIN, TINGLIN XIN, YUNFENG WANG, and YANPIN ZHAO. "LOCAL RANDOM WALK WITH DISTANCE MEASURE." Modern Physics Letters B 27, no. 08 (2013): 1350055. http://dx.doi.org/10.1142/s0217984913500553.

Full text
Abstract:
Link prediction based on random walks has been widely used. The existing random walk algorithms ignore the probability of a walker visit from the initial node to the destination node for the first time, which makes a major contribution to establish links in some networks. To deal with the problem, we develop a link prediction method named Local Random Walk with Distance (LRWD) based on local random walk and the shortest distance of node pairs. In LRWD, walkers walk with their own steps rather than uniform steps. To evaluate the performance of the LRWD algorithm, we present the concept of dista
APA, Harvard, Vancouver, ISO, and other styles
5

Dong, Chunhua, Xiangyan Zeng, Lanfen Lin, et al. "An Improved Random Walker with Bayes Model for Volumetric Medical Image Segmentation." Journal of Healthcare Engineering 2017 (2017): 1–11. http://dx.doi.org/10.1155/2017/6506049.

Full text
Abstract:
Random walk (RW) method has been widely used to segment the organ in the volumetric medical image. However, it leads to a very large-scale graph due to a number of nodes equal to a voxel number and inaccurate segmentation because of the unavailability of appropriate initial seed point setting. In addition, the classical RW algorithm was designed for a user to mark a few pixels with an arbitrary number of labels, regardless of the intensity and shape information of the organ. Hence, we propose a prior knowledge-based Bayes random walk framework to segment the volumetric medical image in a slice
APA, Harvard, Vancouver, ISO, and other styles
6

GUSATTO, ÉDER, JOSÉ C. M. MOMBACH, FERNANDO P. CERCATO, and GERSON H. CAVALHEIRO. "AN EFFICIENT PARALLEL ALGORITHM TO EVOLVE SIMULATIONS OF THE CELLULAR POTTS MODEL." Parallel Processing Letters 15, no. 01n02 (2005): 199–208. http://dx.doi.org/10.1142/s0129626405002155.

Full text
Abstract:
Applications of the cellular Potts model to investigate cellular structures are becoming widely spread in the scientific literature. Despite its realism and generality, the standard Monte Carlo algorithm used to evolve this model in the scientific literature lacks computational efficiency. As an alternative we introduce the Random Walker algorithm that is a modified Monte Carlo procedure of simpler parallelization. We test it in cell sorting and foam coarsening simulations obtaining velocity increase factors of 10 and 3 times, respectively, in relation to the standard algorithm. The results ob
APA, Harvard, Vancouver, ISO, and other styles
7

Stevenson, Gordon N., Sally L. Collins, Jane Ding, Lawrence Impey, and J. Alison Noble. "3-D Ultrasound Segmentation of the Placenta Using the Random Walker Algorithm: Reliability and Agreement." Ultrasound in Medicine & Biology 41, no. 12 (2015): 3182–93. http://dx.doi.org/10.1016/j.ultrasmedbio.2015.07.021.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Xiao, Y., L. H. Zhou, and X. Zhen. "FISER: Feature Image Space Enhanced Random Walker Algorithm for Brain Tumor Segmentation in Multimodal MR Images." Journal of Medical Imaging and Health Informatics 5, no. 8 (2015): 1977–81. http://dx.doi.org/10.1166/jmihi.2015.1681.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

He, Yong, Yunlong Meng, Hui Gong, et al. "An Automated Three-Dimensional Detection and Segmentation Method for Touching Cells by Integrating Concave Points Clustering and Random Walker Algorithm." PLoS ONE 9, no. 8 (2014): e104437. http://dx.doi.org/10.1371/journal.pone.0104437.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Menzl, Georg, Andreas Singraber, and Christoph Dellago. "S-shooting: a Bennett–Chandler-like method for the computation of rate constants from committor trajectories." Faraday Discussions 195 (2016): 345–64. http://dx.doi.org/10.1039/c6fd00124f.

Full text
Abstract:
Mechanisms of rare transitions between long-lived stable states are often analyzed in terms of commitment probabilities, determined from swarms of short molecular dynamics trajectories. Here, we present a computer simulation method to determine rate constants from such short trajectories combined with free energy calculations. The method, akin to the Bennett–Chandler approach for the calculation of reaction rate constants, requires the definition of a valid reaction coordinate and can be applied to both under- and overdamped dynamics. We verify the correctness of the algorithm using a one-dime
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Random-Walker algorithm"

1

Μαστρογιάννη, Αικατερίνη. "Εντοπισμός θέσης υπομικροσυστοιχιών και spots σε ψηφιακές εικόνες μικροσυστοιχιών". Thesis, 2010. http://nemertes.lis.upatras.gr/jspui/handle/10889/4004.

Full text
Abstract:
Η τεχνολογία των DNA μικροσυστοιχιών είναι μια υψηλής απόδοσης τεχνική που καθορίζει το κατά πόσο ένα κύτταρο μπορεί να ελέγξει, ταυτόχρονα, την έκφραση ενός πολύ μεγάλου αριθμού γονιδίων. Οι DNA μικροσυστοιχίες χρησιμοποιούνται για την παρακολούθηση και τον έλεγχο των αλλαγών που υφίστανται τα επίπεδα της γονιδιακής έκφρασης λόγω περιβαλλοντικών συνθηκών ή των αλλαγών που λαμβάνουν χώρα σε ασθενή κύτταρα σε σχέση με τα υγιή, χρησιμοποιώντας εξελιγμένες μεθόδους επεξεργασίας πληροφοριών. Εξαιτίας του τρόπου με τον οποίον παράγονται οι μικροσυστοιχίες, κατά την πειραματική επεξεργασία τους, εμφ
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Random-Walker algorithm"

1

Gocławski, Jarosław, Tomasz Węgliński, and Anna Fabijańska. "Accelerating the 3D Random Walker Image Segmentation Algorithm by Image Graph Reduction and GPU Computing." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-10662-5_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Random-Walker algorithm"

1

Artan, Yusuf, and Imam Samil Yetik. "Improved random walker algorithm for image segmentation." In 2010 IEEE Southwest Symposium on Image Analysis & Interpretation (SSIAI). IEEE, 2010. http://dx.doi.org/10.1109/ssiai.2010.5483910.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wang, Xin, Tobias Heimann, Arne Naegel, Gabriel Wittum, and Hans-Peter Meinzer. "Efficient multigrid solver for the 3D random walker algorithm." In SPIE Medical Imaging, edited by Josien P. W. Pluim and Benoit M. Dawant. SPIE, 2009. http://dx.doi.org/10.1117/12.812821.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bampis, Christos G., Georgia D. Koutsouri, Elias Berdouses, et al. "Occlusal caries detection using random walker algorithm: A graph approach." In 2014 36th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC). IEEE, 2014. http://dx.doi.org/10.1109/embc.2014.6943989.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yufeng, Yi, Gao Yang, Li Wenna, and Gao Liqun. "Improved random walker interactive image segmentation algorithm for texture image segmentation." In 2011 23rd Chinese Control and Decision Conference (CCDC). IEEE, 2011. http://dx.doi.org/10.1109/ccdc.2011.5968956.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bampis, Christos G., and Petros Maragos. "Unifying the random walker algorithm and the SIR model for graph clustering and image segmentation." In 2015 IEEE International Conference on Image Processing (ICIP). IEEE, 2015. http://dx.doi.org/10.1109/icip.2015.7351205.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sinop, Ali Kemal, and Leo Grady. "A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm." In 2007 IEEE 11th International Conference on Computer Vision. IEEE, 2007. http://dx.doi.org/10.1109/iccv.2007.4408927.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Fallah, Faezeh, Bin Yang, and Fabian Bamberg. "Automatic atlas-guided constrained random Walker algorithm for 3D segmentation of muscles on water magnetic resonance images." In 2017 25th European Signal Processing Conference (EUSIPCO). IEEE, 2017. http://dx.doi.org/10.23919/eusipco.2017.8081207.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Andrade, Matheus Guedes de, Franklin De Lima Marquezino, and Daniel Ratton Figueiredo. "Characterizing the Relationship Between Unitary Quantum Walks and Non-Homogeneous Random Walks." In Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação, 2021. http://dx.doi.org/10.5753/ctd.2021.15756.

Full text
Abstract:
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the relationship between quantum and random walks has been recently discussed in specific scenarios, this work establishes a formal equivalence between the two processes on arbitrary finite graphs and general conditions for shift and coin operators. It requires empowering random walks with time heterogeneity, where the transition probability of the walker is non-uniform a
APA, Harvard, Vancouver, ISO, and other styles
9

Gonzalez, Andres, Zoya Heidari, and Olivier Lopez. "Electrical, Diffusional, and Hydraulic Tortuosity Anisotropy Quantification Using 3D CT-Scan Image Data." In SPE Annual Technical Conference and Exhibition. SPE, 2021. http://dx.doi.org/10.2118/206109-ms.

Full text
Abstract:
Abstract Depositional mechanisms of sediments and post-depositional process often cause spatial variation and heterogeneity in rock fabric, which can impact the directional dependency of petrophysical, electrical, and mechanical properties. Quantification of the directional dependency of the aforementioned properties is fundamental for the appropriate characterization of hydrocarbon-bearing reservoirs. Anisotropy quantification can be accomplished through numerical simulations of physical phenomena such as fluid flow, gas diffusion, and electric current conduction in porous media using multi-s
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Random-Walker algorithm' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography