• Journal of the Korean Society of Radiology
• /
• v.10 no.6
• /
• pp.443-450
• /
• 2016

In this study, we are using a computer tomography image of the abdomen, as an experimental linear research for the image of the fatty liver patients texture features analysis and computer-aided diagnosis system of implementation using the ROC curve analysis, from the computer tomography image. We tried to provide an objective and reliable diagnostic information of fatty liver to the doctor. Experiments are usually a fatty liver, via the wavelet transform of the abdominal computed tomography images are configured with the experimental image section, shows the results of statistical analysis on six parameters indicating a feature value of the texture. As a result, the entropy, average luminance, strain rate is shown a relatively high recognition rate of 90% or more, the control also, flatness, uniformity showed relatively low recognition rate of about 70%. ROC curve analysis of six parameters are all shown to 0.900 (p = 0.0001) or more, showed meaningful results in the recognition of the disease. Also, to determine the cut-off value for the prediction of disease six parameters. These results are applicable from future abdominal computed tomography images as a preliminary diagnostic article of diseases automatic detection and eventual diagnosis.

• The KIPS Transactions:PartB
• /
• v.18B no.2
• /
• pp.51-56
• /
• 2011

Algorithms for intrinsic images reduce color differences in RGB images caused by the temperature of black-body radiators. Based on the reference light and detecting single invariant direction, these algorithms are weak in real images which can have multiple invariant directions when the scene illuminant is a colored illuminant. To solve these problems, this paper proposes a method of acquiring an intrinsic image by omnidirectional projection of an ROI and a translation of white patch in the ${\chi}$-chromaticity space. Because it is not easy to analyze an image in the three-dimensional RGB space, the ${\chi}$-chromaticity is also employed without the brightness factor in this paper. After the effect of the colored illuminant is decreased by a translation of white patch, an invariant direction is detected by omnidirectional projection of an ROI in this chromaticity space. In case the RGB image has multiple invariant directions, only one ROI is selected with the bin, which has the highest frequency in 3D histogram. And then the two operations, projection and inverse transformation, make intrinsic image acquired. In the experiments, test images were four datasets presented by Ebner and evaluation methods was the follows: standard deviation of the invariant direction, the constancy measure, the color space measure and the color constancy measure. The experimental results showed that the proposed method had lower standard deviation than the entropy, that its performance was two times higher than the compared algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2615-2628
• /
• 1997

In this paper, a new codebook design algorithm is proposed. It uses a DCT map based on two-dimensional discrete cosine of transform (2D DCT) and finite state vector quantizer (FSVQ) when the vector quantizer is designed for image transmission. We make the map by dividing input image according to edge quantity, then by the map, the significant features of training image are extracted by using the 2D DCT. A master codebook of FSVQ is generated by partitioning the training set using binary tree based on tree-structure. The state codebook is constructed from the master codebook, and then the index of input image is searched at not master codebook but state codebook. And, because the coding of index is important part for high speed digital transmission, it converts fixed length codes to variable length codes in terms of entropy coding rule. The huffman coding assigns transmission codes to codes of codebook. This paper proposes single-side growing huffman tree to speed up huffman code generation process of huffman tree. Compared with the pairwise nearest neighbor (PNN) and classified VQ (CVQ) algorithm, about Einstein and Bridge image, the new algorithm shows better picture quality with 2.04 dB and 2.48 dB differences as to PNN, 1.75 dB and 0.99 dB differences as to CVQ respectively.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.4
• /
• pp.9-21
• /
• 2004

In this paper, we proposed the image hiding method which decreases calculation amount by encrypt partial data using discrete wavelet transform and linear scale quantization which were adopted as the main technique for frequency transform in JPEG2000 standard. Also we used the chaotic system which has smaller calculation amount than other encryption algorithms and then dramatically decreased calculation amount. This method operates encryption process between quantization and entropy coding for preserving compression ratio of images and uses the subband selection method and the random changing method using the chaotic system. For ciphering the quantization index we use a novel image encryption algerian of cyclically shifted in the right or left direction and encrypts two quantization assignment method (Top-down/Reflection code), made change of data less. Also, suggested encryption method to JPEG2000 progressive transmission. The experiments have been performed with the proposed methods implemented in software for about 500 images. consequently, we are sure that the proposed are efficient image encryption methods to acquire the high encryption effect with small amount of encryption. It has been shown that there exits a relation of trade-off between the execution time and the effect of the encryption. It means that the proposed methods can be selectively used according to the application areas. Also, because the proposed methods are performed in the application layer, they are expected to be a good solution for the end-to-end security problem, which is appearing as one of the important problems in the networks with both wired and wireless sections.

• Journal of Biosystems Engineering
• /
• v.37 no.4
• /
• pp.271-278
• /
• 2012

Worldwide trends in animal welfare have resulted in an increased interest in individual management of sows housed in groups within hog barns. Estrus detection has been shown to be one of the greatest determinants of sow productivity. Purpose: We conducted this study to develop a method that can automatically detect the estrus state of a sow by selecting optimal texture parameters from images of a sow's pudendum and by optimizing the number of neurons in the hidden layer of an artificial neural network. Methods: Texture parameters were analyzed according to changes in a sow's pudendum in estrus such as mucus secretion and expansion. Of the texture parameters, eight gray level co-occurrence matrix (GLCM) parameters were used for image analysis. The image states were classified into ten grades for each GLCM parameter, and an artificial neural network was formed using the values for each grade as inputs to discriminate the estrus state of sows. The number of hidden layer neurons in the artificial neural network is an important parameter in neural network design. Therefore, we determined the optimal number of hidden layer units using a trial and error method while increasing the number of neurons. Results: Fifteen hidden layers were determined to be optimal for use in the artificial neural network designed in this study. Thirty images of 10 sows were used for learning, and then 30 different images of 10 sows were used for verification. Conclusions: For learning, the back propagation neural network (BPN) algorithm was used to successful estimate six texture parameters (homogeneity, angular second moment, energy, maximum probability, entropy, and GLCM correlation). Based on the verification results, homogeneity was determined to be the most important texture parameter, and resulted in an estrus detection rate of 70%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5C
• /
• pp.382-390
• /
• 2005

Huffman codes are widely used for image and video data transmission. As the increase of real-time data, a lot of studies on effective decoding algorithms and architectures have been done. In this paper, we proposed a balanced binary search tree for Huffman decoding and compared the performance of the proposed architecture with that of previous works. Based on definitions of the comparison of codewords with different lengths, the proposed architecture constructs a balanced binary tree which does not include empty internal nodes, and hence it is very efficient in the memory requirement. Performance evaluation results using actual image data show that the proposed architecture requires small number of table entries, and the decoding time is 1, 5, and 2.41 memory accesses in minimum, maximum, and average, respectively.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.139-145
• /
• 2006

Feature extraction technique in digital images has many applications such as robot vision, medical diagnostic system, and motion video transmission, etc. There are several methods for extracting features in digital images for example nonlinear gradient, nonlinear laplacian, and entropy convolutional filter. However, conventional convolutional filters are usually not efficient to extract features in an image because image feature formation in eyes is more sensitive to dark regions than to bright regions. A few nonlinear filters using difference between arithmetic mean and harmonic mean in a window for extracting sketch features are described in this paper They have some advantages, for example simple computation, dependence on local intensities and less sensitive to small intensity changes in very dark regions. Experimental results demonstrate more successful features extraction than other conventional filters over a wide variety of intensity variations.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.4
• /
• pp.47-54
• /
• 2010

We propose a smart human-computer interface replacing conventional mouse interface. The interface is able to control cursor and command action with only hand performing without object. Four finger motions(left click, right click, hold, drag) for command action are enough to express all mouse function. Also we materialize cursor movement control using image processing. The measure what we use for inference is entropy of EMG signal, gaussian modeling and maximum likelihood estimation. In image processing for cursor control, we use color recognition to get the center point of finger tip from marker, and map the point onto cursor. Accuracy of finger movement inference is over 95% and cursor control works naturally without delay. we materialize whole system to check its performance and utility.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.2 no.1
• /
• pp.32-44
• /
• 1999

Texture features can be incorporated in classification procedure to resolve class confusions. However, there have been few application-oriented studies made to evaluate the relative powers of texture analysis methods in a particular environment. This study evaluates the increases in the land-cover classification accuracy of the SPOT HRV multispectral data of Pusan Metropolitan area from texture processing. Twenty-four texture measures were derived from the SPOT HRV band 3 image. Each of these features were used in combination with the three spectral images in the classification of 10 land-cover classes. Supervised training and a Gaussian maximum likelihood classifier were used in the classification. It was found that while entropy produces the best empirical results in terms of the overall classification, other texture features can also largely improve the classification accuracies obtained by the use of the spectral images only. With the inclusion of texture, the classification for each category improves. Specially, urban built-up areas had much increase in accuracy. The results indicate that texture size 5 by 5 and 7 by 7 may be suitable at land cover classification of Pusan Metropolitan area.

• Korean Journal of Remote Sensing
• /
• v.22 no.4
• /
• pp.275-284
• /
• 2006

The noise sources of a Hyperion image are mainly due to the atmospheric effects, the sensor's instrumental errors, and A/D conversion. Though uncalibrated, overlapping, and all deep water absorption bands generally are removed, there still exist noisy bands. The visual inspection for selecting clean and stable processing bands is a simple practice, but is a manual, inefficient, and subjective process. In this paper, we propose that the extrema ratio be used for noise estimation and unsupervised band selection. The extrema ratio was compared with existing SNR and entropy measures. First, Gaussian, salt and pepper, and Speckle noises were added to ALI (Advanced Land Imager) images with relatively low noises, and the relation of noise level and those measures was explored. Second, the unsupervised band selection was performed through the EM (Expectation-Maximization) algorithm of the measures which were extracted from a Hyperion images. The Hyperion data were classified into 5 categories according to the image quality by visual inspection, and used as the reference data. The experimental result showed that the extrema ratio could be used effectively for band selection of Hyperion images.