1
|
Wang H, Wang J, Yan S, Pan R, Sun M, Yu Q, Chen T, Chen L, Liu Y. Elementary cellular automata realized by stateful three-memristor logic operations. Sci Rep 2024; 14:2677. [PMID: 38302642 PMCID: PMC10834433 DOI: 10.1038/s41598-024-53125-w] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/01/2023] [Accepted: 01/29/2024] [Indexed: 02/03/2024] Open
Abstract
Cellular automata (CA) are computational systems that exhibit complex global behavior arising from simple local rules, making them a fascinating candidate for various research areas. However, challenges such as limited flexibility and efficiency on conventional hardware platforms still exist. In this study, we propose a memristor-based circuit for implementing elementary cellular automata (ECA) by extending the stateful three-memristor logic operations derived from material implication (IMP) logic gates. By leveraging the inherent physical properties of memristors, this approach offers simplicity, minimal operational steps, and high flexibility in implementing ECA rules by adjusting the circuit parameters. The mathematical principles governing circuit parameters are analyzed, and the evolution of multiple ECA rules is successfully demonstrated, showcasing the robustness in handling the stochastic nature of memristors. This approach provides a hardware solution for ECA implementation and opens up new research opportunities in the hardware implementation of CA.
Collapse
Affiliation(s)
- Hongzhe Wang
- State Key Laboratory of Electronic Thin Films and Integrated Devices, University of Electronic Science and Technology of China, Chengdu, 610054, China
| | - Junjie Wang
- State Key Laboratory of Electronic Thin Films and Integrated Devices, University of Electronic Science and Technology of China, Chengdu, 610054, China.
| | - Shiqin Yan
- State Key Laboratory of Electronic Thin Films and Integrated Devices, University of Electronic Science and Technology of China, Chengdu, 610054, China
| | - Ruicheng Pan
- State Key Laboratory of Electronic Thin Films and Integrated Devices, University of Electronic Science and Technology of China, Chengdu, 610054, China
| | - Mingyuan Sun
- China Changfeng Mechanics and Electronics Technology Academy, Beijing, 100039, China
| | - Qi Yu
- State Key Laboratory of Electronic Thin Films and Integrated Devices, University of Electronic Science and Technology of China, Chengdu, 610054, China
| | - Tupei Chen
- School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore, 639798, Singapore
| | - Lei Chen
- Beijing Microelectronics Technology Institute, Beijing, 100076, China
| | - Yang Liu
- State Key Laboratory of Electronic Thin Films and Integrated Devices, University of Electronic Science and Technology of China, Chengdu, 610054, China
| |
Collapse
|
2
|
Liu Y, Tian H, Wu F, Liu A, Li Y, Sun H, Lanza M, Ren TL. Cellular automata imbedded memristor-based recirculated logic in-memory computing. Nat Commun 2023; 14:2695. [PMID: 37165017 PMCID: PMC10172358 DOI: 10.1038/s41467-023-38299-7] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/02/2022] [Accepted: 04/20/2023] [Indexed: 05/12/2023] Open
Abstract
Memristor-based circuits offer low hardware costs and in-memory computing, but full-memristive circuit integration for different algorithm remains limited. Cellular automata (CA) has been noticed for its well-known parallel, bio-inspired, computational characteristics. Running CA on conventional chips suffers from low parallelism and high hardware costs. Establishing dedicated hardware for CA remains elusive. We propose a recirculated logic operation scheme (RLOS) using memristive hardware and 2D transistors for CA evolution, significantly reducing hardware complexity. RLOS's versatility supports multiple CA algorithms on a single circuit, including elementary CA rules and more complex majority classification and edge detection algorithms. Results demonstrate up to a 79-fold reduction in hardware costs compared to FPGA-based approaches. RLOS-based reservoir computing is proposed for edge computing development, boasting the lowest hardware cost (6 components/per cell) among existing implementations. This work advances efficient, low-cost CA hardware and encourages edge computing hardware exploration.
Collapse
Affiliation(s)
- Yanming Liu
- School of Integrated Circuits, Tsinghua University, 100084, Beijing, China
- Beijing National Research Center for Information Science and Technology (BNRist), Tsinghua University, 100084, Beijing, China
| | - He Tian
- School of Integrated Circuits, Tsinghua University, 100084, Beijing, China.
- Beijing National Research Center for Information Science and Technology (BNRist), Tsinghua University, 100084, Beijing, China.
| | - Fan Wu
- School of Integrated Circuits, Tsinghua University, 100084, Beijing, China
- Beijing National Research Center for Information Science and Technology (BNRist), Tsinghua University, 100084, Beijing, China
| | - Anhan Liu
- School of Integrated Circuits, Tsinghua University, 100084, Beijing, China
- Beijing National Research Center for Information Science and Technology (BNRist), Tsinghua University, 100084, Beijing, China
| | - Yihao Li
- Weiyang College, Tsinghua University, 100084, Beijing, China
| | - Hao Sun
- School of Integrated Circuits, Tsinghua University, 100084, Beijing, China
- Beijing National Research Center for Information Science and Technology (BNRist), Tsinghua University, 100084, Beijing, China
| | - Mario Lanza
- Physical Science and Engineering Division, King Abdullah University of Science and Technology (KAUST), Thuwal, Saudi Arabia
| | - Tian-Ling Ren
- School of Integrated Circuits, Tsinghua University, 100084, Beijing, China.
- Beijing National Research Center for Information Science and Technology (BNRist), Tsinghua University, 100084, Beijing, China.
| |
Collapse
|
3
|
PSciLab: An Unified Distributed and Parallel Software Framework for Data Analysis, Simulation and Machine Learning—Design Practice, Software Architecture, and User Experience. APPLIED SCIENCES-BASEL 2022. [DOI: 10.3390/app12062887] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/10/2022]
Abstract
In this paper, a hybrid distributed-parallel cluster software framework for heterogeneous computer networks is introduced that supports simulation, data analysis, and machine learning (ML), using widely available JavaScript virtual machines (VM) and web browsers to accommodate the working load. This work addresses parallelism, primarily on a control-path level and partially on a data-path level, targeting different classes of numerical problems that can be either data-partitioned or replicated. These are composed of a set of interacting worker processes that can be easily parallelized or distributed, e.g., for large-scale multi-element simulation or ML. Their suitability and scalability for static and dynamic problems are experimentally investigated regarding the proposed multi-process and communication architecture, as well as data management using customized SQL databases with network access. The framework consists of a set of tools and libraries, mainly the WorkBook (processed by a web browser) and the WorkShell (processed by node.js). It can be seen that the proposed distributed-parallel multi-process approach, with a dedicated set of inter-process communication methods (message- and shared-memory-based), scales up efficiently according to problem size and the number of processes. Finally, it is demonstrated that this JavaScript-based approach for exploiting parallelism can be used easily by any typical numerical programmer or data analyst and does not require any special knowledge about parallel and distributed systems and their interaction. The study is also focused on VM processing.
Collapse
|
4
|
Singha J, Gupte N. Chimera states in coupled map lattices: Spatiotemporally intermittent behavior and an equivalent cellular automaton. CHAOS (WOODBURY, N.Y.) 2020; 30:113102. [PMID: 33261350 DOI: 10.1063/5.0016056] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Received: 06/10/2020] [Accepted: 10/10/2020] [Indexed: 06/12/2023]
Abstract
We construct an equivalent cellular automaton (CA) for a system of globally coupled sine circle maps with two populations and distinct values for intergroup and intragroup coupling. The phase diagram of the system shows that the coupled map lattice can exhibit chimera states with synchronized and spatiotemporally intermittent subgroups after evolution from random initial conditions in some parameter regimes, as well as to other kinds of solutions in other parameter regimes. The CA constructed by us reflects the global nature and the two population structure of the coupled map lattice and is able to reproduce the phase diagram accurately. The CA depends only on the total number of laminar and burst sites and shows a transition from co-existing deterministic and probabilistic behavior in the chimera region to fully probabilistic behavior at the phase boundaries. This identifies the characteristic signature of the transition of a cellular automaton to a chimera state. We also construct an evolution equation for the average number of laminar/burst sites from the CA, analyze its behavior and solutions, and correlate these with the behavior seen for the coupled map lattice. Our CA and methods of analysis can have relevance in wider contexts.
Collapse
Affiliation(s)
- Joydeep Singha
- Department of Physics, Indian Institute of Technology Madras, Chennai 600036, India
| | - Neelima Gupte
- Department of Physics, Indian Institute of Technology Madras, Chennai 600036, India
| |
Collapse
|
5
|
Ribas LC, Machicao J, Bruno OM. Life-Like Network Automata descriptor based on binary patterns for network classification. Inf Sci (N Y) 2020. [DOI: 10.1016/j.ins.2019.09.063] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/25/2022]
|
6
|
Banda P, Caughman J, Cenek M, Teuscher C. Shift-symmetric configurations in two-dimensional cellular automata: Irreversibility, insolvability, and enumeration. CHAOS (WOODBURY, N.Y.) 2019; 29:063120. [PMID: 31266322 DOI: 10.1063/1.5089889] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 01/23/2019] [Accepted: 05/21/2019] [Indexed: 06/09/2023]
Abstract
The search for symmetry, as an unusual yet profoundly appealing phenomenon, and the origin of regular, repeating configuration patterns have long been a central focus of complexity science and physics. To better grasp and understand symmetry of configurations in decentralized toroidal architectures, we employ group-theoretic methods, which allow us to identify and enumerate these inputs, and argue about irreversible system behaviors with undesired effects on many computational problems. The concept of so-called "configuration shift-symmetry" is applied to two-dimensional cellular automata as an ideal model of computation. Regardless of the transition function, the results show the universal insolvability of crucial distributed tasks, such as leader election, pattern recognition, hashing, and encryption. By using compact enumeration formulas and bounding the number of shift-symmetric configurations for a given lattice size, we efficiently calculate the probability of a configuration being shift-symmetric for a uniform or density-uniform distribution. Further, we devise an algorithm detecting the presence of shift-symmetry in a configuration. Given the resource constraints, the enumeration and probability formulas can directly help to lower the minimal expected error and provide recommendations for system's size and initialization. Besides cellular automata, the shift-symmetry analysis can be used to study the nonlinear behavior in various synchronous rule-based systems that include inference engines, Boolean networks, neural networks, and systolic arrays.
Collapse
Affiliation(s)
- Peter Banda
- Luxembourg Centre For Systems Biomedicine, University of Luxembourg, Esch-sur-Alzette L-4362, Luxembourg
| | - John Caughman
- Department of Mathematics and Statistics, Portland State University, Portland, Oregon 97201, USA
| | - Martin Cenek
- Shiley School of Engineering, University of Portland, Portland, Oregon 97203, USA
| | - Christof Teuscher
- Department of Electrical and Computer Engineering, Portland State University, Portland, Oregon 97201, USA
| |
Collapse
|
7
|
Infrared Dim Target Detection Using Shearlet’s Kurtosis Maximization under Non-Uniform Background. Symmetry (Basel) 2019. [DOI: 10.3390/sym11050723] [Citation(s) in RCA: 17] [Impact Index Per Article: 2.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/16/2022] Open
Abstract
A novel method based on multiscale and multidirectional feature fusion in the shearlet transform domain and kurtosis maximization for detecting the dim target in infrared images with a low signal-to-noise ratio (SNR) and serious interference caused by a cluttered and non-uniform background is presented in this paper. First, an original image is decomposed using the shearlet transform with translation invariance. Second, various directions of high-frequency subbands are fused and the corresponding kurtosis of fused image is computed. The targets can be enhanced by strengthening the column with maximum kurtosis. Then, processed high-frequency subbands on different scales of images are merged. Finally, the dim targets are detected by an adaptive threshold with a maximum contrast criterion (MCC). The experimental results show that the proposed method has good performance for infrared target detection in comparison with the nonsubsampled contourlet transform (NSCT) method.
Collapse
|
8
|
Lehotzky D, Zupanc GKH. Cellular Automata Modeling of Stem-Cell-Driven Development of Tissue in the Nervous System. Dev Neurobiol 2019; 79:497-517. [PMID: 31102334 DOI: 10.1002/dneu.22686] [Citation(s) in RCA: 13] [Impact Index Per Article: 2.2] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/09/2019] [Revised: 04/23/2019] [Accepted: 05/02/2019] [Indexed: 12/12/2022]
Abstract
Mathematical and computational modeling enables biologists to integrate data from observations and experiments into a theoretical framework. In this review, we describe how developmental processes associated with stem-cell-driven growth of tissue in both the embryonic and adult nervous system can be modeled using cellular automata (CA). A cellular automaton is defined by its discrete nature in time, space, and state. The discrete space is represented by a uniform grid or lattice containing agents that interact with other agents within their local neighborhood. This possibility of local interactions of agents makes the cellular automata approach particularly well suited for studying through modeling how complex patterns at the tissue level emerge from fundamental developmental processes (such as proliferation, migration, differentiation, and death) at the single-cell level. As part of this review, we provide a primer for how to define biologically inspired rules governing these processes so that they can be implemented into a CA model. We then demonstrate the power of the CA approach by presenting simulations (in the form of figures and movies) based on building models of three developmental systems: the formation of the enteric nervous system through invasion by neural crest cells; the growth of normal and tumorous neurospheres induced by proliferation of adult neural stem/progenitor cells; and the neural fate specification through lateral inhibition of embryonic stem cells in the neurogenic region of Drosophila.
Collapse
Affiliation(s)
- Dávid Lehotzky
- Laboratory of Neurobiology, Department of Biology, Northeastern University, Boston, Massachusetts
| | - Günther K H Zupanc
- Laboratory of Neurobiology, Department of Biology, Northeastern University, Boston, Massachusetts
| |
Collapse
|
9
|
Lekehali S, Moussaoui A. Quantum Local Binary Pattern for Medical Edge Detection. JOURNAL OF INFORMATION TECHNOLOGY RESEARCH 2019. [DOI: 10.4018/jitr.2019040103] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/08/2022]
Abstract
Edge detection is one of the most important operations for extracting the different objects in medical images because it enables delimitation of the various structures present in the image. Most edge detection algorithms are based on the intensity variations in images. Edge detection is especially difficult when the images are textured, and it is essential to consider the texture in edge detection processes. In this article, the authors propose a new procedure to extract the texture from images, called the Quantum Local Binary Pattern (QuLBP). The authors introduce two applications that use QuLBP to detect edges in magnetic resonance images: a cellular automaton (CA) edge detector algorithm and a combination of the QuLBP and the Deriche-Canny algorithm for salt and pepper noise resistance. The proposed approach to extracting texture is designed for and applied to different gray scale image datasets with real and synthetic magnetic resonance imaging (MRI). The experiments demonstrate that the proposed approach produces good results in both applications, compared to classical algorithms.
Collapse
|
10
|
|
11
|
|
12
|
Adinehvand K, Sardari D, Hosntalab M, Pouladian M. An efficient multistage segmentation method for accurate hard exudates and lesion detection in digital retinal images. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2017. [DOI: 10.3233/jifs-17199] [Citation(s) in RCA: 6] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/15/2022]
Affiliation(s)
- Karim Adinehvand
- Department of Medical Radiation Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran
| | - Dariush Sardari
- Department of Medical Radiation Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran
| | - Mohammad Hosntalab
- Department of Medical Radiation Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran
| | - Majid Pouladian
- Department of Biomedical Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran
| |
Collapse
|
13
|
|
14
|
|
15
|
Han M, Yang X, Jiang E. An Extreme Learning Machine based on Cellular Automata of edge detection for remote sensing images. Neurocomputing 2016. [DOI: 10.1016/j.neucom.2015.08.121] [Citation(s) in RCA: 25] [Impact Index Per Article: 2.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/26/2022]
|
16
|
Maglogiannis I, Georgakopoulos S, Tasoulis S, Plagianakos V. A software tool for the automatic detection and quantification of fibrotic tissues in microscopy images. Inf Sci (N Y) 2015. [DOI: 10.1016/j.ins.2014.10.028] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/18/2022]
|
17
|
Anitha J, Peter JD. Mammogram segmentation using maximal cell strength updation in cellular automata. Med Biol Eng Comput 2015; 53:737-49. [PMID: 25841356 DOI: 10.1007/s11517-015-1280-0] [Citation(s) in RCA: 29] [Impact Index Per Article: 2.9] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/28/2014] [Accepted: 03/16/2015] [Indexed: 11/30/2022]
Abstract
Breast cancer is the most frequently diagnosed type of cancer among women. Mammogram is one of the most effective tools for early detection of the breast cancer. Various computer-aided systems have been introduced to detect the breast cancer from mammogram images. In a computer-aided diagnosis system, detection and segmentation of breast masses from the background tissues is an important issue. In this paper, an automatic segmentation method is proposed to identify and segment the suspicious mass regions of mammogram using a modified transition rule named maximal cell strength updation in cellular automata (CA). In coarse-level segmentation, the proposed method performs an adaptive global thresholding based on the histogram peak analysis to obtain the rough region of interest. An automatic seed point selection is proposed using gray-level co-occurrence matrix-based sum average feature in the coarse segmented image. Finally, the method utilizes CA with the identified initial seed point and the modified transition rule to segment the mass region. The proposed approach is evaluated over the dataset of 70 mammograms with mass from mini-MIAS database. Experimental results show that the proposed approach yields promising results to segment the mass region in the mammograms with the sensitivity of 92.25% and accuracy of 93.48%.
Collapse
Affiliation(s)
- J Anitha
- Department of Computer Science and Engineering, Karunya University, Coimbatore, India
| | | |
Collapse
|
18
|
Senra Filho ACDS, Salmon CEG, Murta Junior LO. Anomalous diffusion process applied to magnetic resonance image enhancement. Phys Med Biol 2015; 60:2355-73. [PMID: 25716129 DOI: 10.1088/0031-9155/60/6/2355] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/12/2022]
Abstract
Diffusion process is widely applied to digital image enhancement both directly introducing diffusion equation as in anisotropic diffusion (AD) filter, and indirectly by convolution as in Gaussian filter. Anomalous diffusion process (ADP), given by a nonlinear relationship in diffusion equation and characterized by an anomalous parameters q, is supposed to be consistent with inhomogeneous media. Although classic diffusion process is widely studied and effective in various image settings, the effectiveness of ADP as an image enhancement is still unknown. In this paper we proposed the anomalous diffusion filters in both isotropic (IAD) and anisotropic (AAD) forms for magnetic resonance imaging (MRI) enhancement. Filters based on discrete implementation of anomalous diffusion were applied to noisy MRI T2w images (brain, chest and abdominal) in order to quantify SNR gains estimating the performance for the proposed anomalous filter when realistic noise is added to those images. Results show that for images containing complex structures, e.g. brain structures, anomalous diffusion presents the highest enhancements when compared to classical diffusion approach. Furthermore, ADP presented a more effective enhancement for images containing Rayleigh and Gaussian noise. Anomalous filters showed an ability to preserve anatomic edges and a SNR improvement of 26% for brain images, compared to classical filter. In addition, AAD and IAD filters showed optimum results for noise distributions that appear on extreme situations on MRI, i.e. in low SNR images with approximate Rayleigh noise distribution, and for high SNR images with Gaussian or non central χ noise distributions. AAD and IAD filter showed the best results for the parametric range 1.2 < q < 1.6, suggesting that the anomalous diffusion regime is more suitable for MRI. This study indicates the proposed anomalous filters as promising approaches in qualitative and quantitative MRI enhancement.
Collapse
Affiliation(s)
- A C da S Senra Filho
- Department of Computing and Mathematics-FFCLRP, University of Sao Paulo, Sao Paulo, SP, Brazil
| | | | | |
Collapse
|
19
|
Díaz-Pernil D, Peña-Cantillana F, Gutiérrez-Naranjo MA. A parallel algorithm for skeletonizing images by using spiking neural P systems. Neurocomputing 2013. [DOI: 10.1016/j.neucom.2012.12.032] [Citation(s) in RCA: 36] [Impact Index Per Article: 3.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/27/2022]
|
20
|
Díaz-Pernil D, Berciano A, Peña-Cantillana F, Gutiérrez-Naranjo MA. Segmenting images with gradient-based edge detection using Membrane Computing. Pattern Recognit Lett 2013. [DOI: 10.1016/j.patrec.2012.10.014] [Citation(s) in RCA: 44] [Impact Index Per Article: 3.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/27/2022]
|
21
|
Sun X, Rosin PL, Martin RR. Fast rule identification and neighborhood selection for cellular automata. IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS. PART B, CYBERNETICS : A PUBLICATION OF THE IEEE SYSTEMS, MAN, AND CYBERNETICS SOCIETY 2010; 41:749-60. [PMID: 21134817 DOI: 10.1109/tsmcb.2010.2091271] [Citation(s) in RCA: 21] [Impact Index Per Article: 1.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/07/2022]
Abstract
Cellular automata (CA) with given evolution rules have been widely investigated, but the inverse problem of extracting CA rules from observed data is less studied. Current CA rule extraction approaches are both time consuming and inefficient when selecting neighborhoods. We give a novel approach to identifying CA rules from observed data and selecting CA neighborhoods based on the identified CA model. Our identification algorithm uses a model linear in its parameters and gives a unified framework for representing the identification problem for both deterministic and probabilistic CA. Parameters are estimated based on a minimum variance criterion. An incremental procedure is applied during CA identification to select an initial coarse neighborhood. Redundant cells in the neighborhood are then removed based on parameter estimates, and the neighborhood size is determined using the Bayesian information criterion. Experimental results show the effectiveness of our algorithm and that it outperforms other leading CA identification algorithms.
Collapse
Affiliation(s)
- Xianfang Sun
- School of Computer Science and Informatics, Cardiff University, Cardiff, UK.
| | | | | |
Collapse
|
22
|
Chen Y, Yan Z, Shi J. Application of Lattice Boltzmann Method to Image Segmentation. ACTA ACUST UNITED AC 2007; 2007:6562-5. [DOI: 10.1109/iembs.2007.4353863] [Citation(s) in RCA: 6] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/06/2022]
|