1-3hit |
Shin'ya YOSHINO Akira KOBAYASHI Takashi YAHAGI Hiroyuki FUKUDA Masaaki EBARA Masao OHTO
We have classified parenchymal echo patterns of cirrhotic liver into 3 types, according to the size of hypoechoic nodular lesions. We have been studying an ultrasonic image diagnosis system using the three–layer back–propagation neural network. In this paper, we will describe the applications of the neural network techniques for recognizing and classifying chronic liver disease, which use the nodular lesions in the Proton density and T2–weighed magnetic resonance images on the gray level of the pixels in the region of interest.
Shin-ya YOSHINO Akira KOBAYASHI Takashi YAHAGI Hiroyuki FUKUDA Masaaki EBARA Masao OHTO
We have calssified parenchymal echo patterns of cirrhotic liver into four types, according to the size of hypoechoic nodular lesions. Neural network technique has been applied to the characterization of hepatic parenchymal diseases in ultrasonic B-scan texture. We employed a multi-layer feedforward neural network utilizing the back-propagation algorithm. We carried out four kinds of pre-processings for liver parenchymal pattern in the images. We describe the examination of each performance by these pre-processing techniques. We show four results using (1) only magnitudes of FFT pre-processing, (2) both magnitudes and phase angles, (3) data normalized by the maximum value in the dataset, and (4) data normalized by variance of the dataset. Among the 4 pre-processing data treatments studied, the process combining FFT phase angles and magnitudes of FFT is found to be the most efficient.
Ruck THAWONMAS Norio SHIRATORI Shoichi NOGUCHI
This paper describes a neural network scheduler for scheduling independent and nonpreemptable tasks with deadlines and resource requirements in critical real-time applications, in which a schedule is to be obtained within a short time span. The proposed neural network scheduler is an integrate model of two Hopfield-Tank neural network medels. To cope with deadlines, a heuristic policy which is modified from the earliest deadling policy is embodied into the proposed model. Computer simulations show that the proposed neural network scheduler has a promising performance, with regard to the probability of generating a feasible schedule, compared with a scheduler that executes a conventional algorithm performing the earliest deadline policy.