Two dimensional(2 D) entropy method has to pay the price of time when applied to image segmentation. So the genetic algorithm is introduced to improve the computational efficiency of the 2 D entropy method. The pro...Two dimensional(2 D) entropy method has to pay the price of time when applied to image segmentation. So the genetic algorithm is introduced to improve the computational efficiency of the 2 D entropy method. The proposed method uses both the gray value of a pixel and the local average gray value of an image. At the same time, the simple genetic algorithm is improved by using better reproduction and crossover operators. Thus the proposed method makes up the 2 D entropy method’s drawback of being time consuming, and yields satisfactory segmentation results. Experimental results show that the proposed method can save computational time when it provides good quality segmentation.展开更多
Currently, the processing speed of exist-ing autormtic liver segmentation for Magnetic Res-onance Imaging （MRI） images is rehtively slow. An automatic liver segmentation scheme for MRI irmges based on Cellular Neura...Currently, the processing speed of exist-ing autormtic liver segmentation for Magnetic Res-onance Imaging （MRI） images is rehtively slow. An automatic liver segmentation scheme for MRI irmges based on Cellular Neural Networks （CNN） is presented in this paper. It ensures the validity of this scheme and at the same time completes the im-age segmentation faster to accurately calculate the liver volume by using parallel computing in real time. In order to facilitate the CNN irmge process-hag, firstly, three-dimensional liver MRI images should be transformed into binary images; second- ly, an appropriate template parameter of the Global Connectivity Detection CNN （GCD CNN） shall be selected to probe the connectivity of the liver to extract the entire liver; and then the Hole-Filler CNN （HF CNN） are used to repair the entire extracting liver and improve the accuracy of fiver segmentation; final-ly, the liver volume is obtained. Results show that the scheme can ensure the accuracy of the automatic seg-mentation of the liver, and it can also improve the processing speed at the same time. The liver volume calculated is in line with the clinical diagnosis.展开更多
Derived from a proposed universal mathematical expression, this paper investigates a novel algo-rithm for parallel Cyclic Redundancy Check (CRC) computation, which is an iterative algorithm to update the check-bit seq...Derived from a proposed universal mathematical expression, this paper investigates a novel algo-rithm for parallel Cyclic Redundancy Check (CRC) computation, which is an iterative algorithm to update the check-bit sequence step by step and suits to various argument selections of CRC computation. The algorithm proposed is quite suitable for hardware implementation. The simulation implementation and performance analysis suggest that it could efficiently speed up the computation compared with the conventional ones. The algorithm is implemented in hardware at as high as 21Gbps, and its usefulness in high-speed CRC computa-tions is implied, such as Asynchronous Transfer Mode (ATM) networks and 10G Ethernet.展开更多
This paper is based on two existing theories about automatic indexing of thematic knowledge concept. The prohibit-word table with position information has been designed. The improved Maximum Matching-Minimum Backtrack...This paper is based on two existing theories about automatic indexing of thematic knowledge concept. The prohibit-word table with position information has been designed. The improved Maximum Matching-Minimum Backtracking method has been researched. Moreover it has been studied on improved indexing algorithm and application technology based on rules and thematic concept word table.展开更多
文摘Two dimensional(2 D) entropy method has to pay the price of time when applied to image segmentation. So the genetic algorithm is introduced to improve the computational efficiency of the 2 D entropy method. The proposed method uses both the gray value of a pixel and the local average gray value of an image. At the same time, the simple genetic algorithm is improved by using better reproduction and crossover operators. Thus the proposed method makes up the 2 D entropy method’s drawback of being time consuming, and yields satisfactory segmentation results. Experimental results show that the proposed method can save computational time when it provides good quality segmentation.
基金supported by the National Natural Science Foundation of China under Grant No. 61074192the Funds of the USTB under Grants No. YJ2010-019,No.06108104
文摘Currently, the processing speed of exist-ing autormtic liver segmentation for Magnetic Res-onance Imaging （MRI） images is rehtively slow. An automatic liver segmentation scheme for MRI irmges based on Cellular Neural Networks （CNN） is presented in this paper. It ensures the validity of this scheme and at the same time completes the im-age segmentation faster to accurately calculate the liver volume by using parallel computing in real time. In order to facilitate the CNN irmge process-hag, firstly, three-dimensional liver MRI images should be transformed into binary images; second- ly, an appropriate template parameter of the Global Connectivity Detection CNN （GCD CNN） shall be selected to probe the connectivity of the liver to extract the entire liver; and then the Hole-Filler CNN （HF CNN） are used to repair the entire extracting liver and improve the accuracy of fiver segmentation; final-ly, the liver volume is obtained. Results show that the scheme can ensure the accuracy of the automatic seg-mentation of the liver, and it can also improve the processing speed at the same time. The liver volume calculated is in line with the clinical diagnosis.
基金Supported by the National Natural Science Foundation of China (No.60172029) and the Natural Science Foun-dation of Shaanxi Province (No.2004F04).
文摘Derived from a proposed universal mathematical expression, this paper investigates a novel algo-rithm for parallel Cyclic Redundancy Check (CRC) computation, which is an iterative algorithm to update the check-bit sequence step by step and suits to various argument selections of CRC computation. The algorithm proposed is quite suitable for hardware implementation. The simulation implementation and performance analysis suggest that it could efficiently speed up the computation compared with the conventional ones. The algorithm is implemented in hardware at as high as 21Gbps, and its usefulness in high-speed CRC computa-tions is implied, such as Asynchronous Transfer Mode (ATM) networks and 10G Ethernet.
基金the Science Foundation of Shanghai Archive Bureau (0215)
文摘This paper is based on two existing theories about automatic indexing of thematic knowledge concept. The prohibit-word table with position information has been designed. The improved Maximum Matching-Minimum Backtracking method has been researched. Moreover it has been studied on improved indexing algorithm and application technology based on rules and thematic concept word table.
