• Progress in Medical Physics
• /
• v.32 no.1
• /
• pp.1-17
• /
• 2021

The evolution of X-ray computed tomography (CT) has been based on the discovery of X-rays, the inception of the Radon transform, and the development of X-ray digital data acquisition systems and computer technology. Unlike conventional X-ray imaging (general radiography), CT reconstructs cross-sectional anatomical images of the internal structures according to X-ray attenuation coefficients (approximate tissue density) for almost every region in the body. This article reviews the essential physical principles and technical aspects of the CT scanner, including several notable evolutions in CT technology that resulted in the emergence of helical, multidetector, cone beam, portable, dual-energy, and phase-contrast CT, in integrated imaging modalities, such as positron-emission-tomography-CT and single-photon-emission-computed-tomography-CT, and in clinical applications, including image acquisition parameters, CT angiography, image adjustment, versatile image visualizations, volumetric/surface rendering on a computer workstation, radiation treatment planning, and target localization in radiotherapy. The understanding of CT characteristics will provide more effective and accurate patient care in the fields of diagnostics and radiotherapy, and can lead to the improvement of image quality and the optimization of exposure doses.

• Advances in materials Research
• /
• v.13 no.4
• /
• pp.321-334
• /
• 2024

The paper is a study on the biothermoelastic analysis in viscoelastic biological tissues in the presence of thermal relaxation times. Using Laplace transforms and related methodologies, we explore how living tissue responds to an exponentially decaying pulse of heat flux at the boundary. The Laplace transformations are reversed using the numerical method. The Tzuo technique was used to measure the reversal. Temperature, displacement, and stress distributions are affected by single-phase and delay relaxation coefficients as well as volume rheological factors, are provided with numerical findings and graphically depicted. In addition, we carry out a parametric analysis to provide assistance in choosing the design variables that are the most successful, which finally results in an improvement in the accuracy of hyperthermia treatments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1173-1183
• /
• 2006

In this paper, we propose an efficient method for improving visual quality of AR-FGS (Adaptive Reference FGS) which is adopted as a key scheme for SVC (Scalable Video Coding) or H.264 scalable extension. The standard FGS (Fine Granularity Scalability) adopts AR-FGS that introduces temporal prediction into FGS layer by using a high quality reference signal which is constructed by the weighted average between the base layer reconstructed imageand enhancement reference to improve the coding efficiency in the FGS layer. However, when the enhancement stream is truncated at certain bitstream position in transmission, the rest of the data of the FGS layer will not be available at the FGS decoder. Thus the most noticeable problem of using the enhancement layer in prediction is the degraded visual quality caused by drifting because of the mismatch between the reference frame used by the FGS encoder and that by the decoder. To solve this problem, we exploit the principle of cyclical block coding that is used to encode quantized transform coefficients in a cyclical manner in the FGS layer. Encoding block coefficients in a cyclical manner places 'higher-value' bits earlier in the bitstream. The quantized transform coefficients included in the ealry coding cycle of cyclical block coding have higher probability to be correctly received and decoded than the others included in the later cycle of the cyclical block coding. Therefore, we can minimize visual quality degradation caused by bitstream truncation by adjusting weighting factor to control the contribution of the bitstream produced in each coding cycle of cyclical block coding when constructing the enhancement layer reference frame. It is shown by simulations that the improved AR-FGS scheme outperforms the standard AR-FGS by about 1 dB in maximum in the reconstructed visual quality.

• Journal of Internet Computing and Services
• /
• v.11 no.6
• /
• pp.13-20
• /
• 2010

This paper presents a measure to classify healthy persons and Parkinson disease patients from the foot pressure of healthy persons and that of Parkinson disease patients using gait analysis based characteristics extraction and Neural Network with Weighted Fuzzy Membership Functions (NEWFM). To extract the inputs to be used in NEWFM, in the first step, the foot pressure data provided by the PhysioBank and changes in foot pressure over time were used to extract four characteristics respectively. In the second step, wavelet coefficients were extracted from the eight characteristics extracted from the previous stage using the wavelet transform (WT). In the final step, 40 inputs were extracted from the extracted wavelet coefficients using statistical methods including the frequency distribution of signals and the amount of variability in the frequency distribution. NEWFM showed high accuracy in the case of the characteristics obtained using differences between the left foot pressure and the right food pressure and in the case of the characteristics obtained using differences in changes in foot pressure over time when healthy persons and Parkinson disease patients were classified by extracting eight characteristics from foot pressure data. Based on these results, the fact that differences between the left and right foot pressures of Parkinson disease patients who show a characteristic of dragging their feet in gaits were relatively smaller than those of healthy persons could be identified through this experiment.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.2
• /
• pp.111-118
• /
• 2004

Techniques based on thresholding of wavelet coefficients are gaining popularity for denoising data because of the reasonable performance at the low complexity. The VisuShrink which removes the noise with the universal threshold is one of the techniques. The universal threshold is proportional to the noise deviation and the number of data samples. In general, because the noise deviation is not known, one needs to estimate the deviation for determining the value of the universal threshold. But, only for the finest scale wavelet coefficients, it has been known the way of estimating the noise deviation, so the noise in coarse scales cannot be removed with the VisuShrink. We propose here a new denoising method which removes the noise in each scale except the coarsest scale by Visushrink method. The noise deviation at each band is estimated by the monotonic transform and weighted deviation, the product of estimated noise deviation by the weight, is applied to the universal threshold. By making use of the universal threshold and the Soft-Threshold technique, the noise in each band is removed. The denoising characteristics of the proposed method is compared with that of the traditional VisuShrink and SureShrink method. The result showed that the proposed method is effective in denoising on Gaussian noise and quantization noise.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.3
• /
• pp.15-21
• /
• 2009

In this paper, we proposed an iterative digital image watermarking technique using encrypted binary phase computer generated hologram in the discrete cosine transform(OCT) domain. For the embedding process of watermark, using simulated annealing algorithm, we would generate a binary phase computer generated hologram(BPCGH) which can reconstruct hidden image perfectly instead of hidden image and repeat the hologram and encrypt it through the XOR operation with key image that is ramdomly generated binary phase components. We multiply the encrypted watermark by the weight function and embed it into the DC coefficients in the DCT domain of host image and an inverse DCT is performed. For the extracting process of watermark, we compare the DC coefficients of watermarked image and original host image in the DCT domain and dividing it by the weight function and decrypt it using XOR operation with key image. And we recover the hidden image by inverse Fourier transforming the decrypted watermark. Finally, we compute the correlation between the original hidden image and recovered hidden image to determine if a watermark exits in the host image. The proposed watermarking technique use the hologram information of hidden image which consist of binary values and encryption technique so it is very secure and robust to the external attacks such as compression, noises and cropping. We confirmed the advantages of the proposed watermarking technique through the computer simulations.

• Journal of Korean Society for Geospatial Information Science
• /
• v.16 no.3
• /
• pp.79-85
• /
• 2008

This study aims to derive a practical coordinate transformation method for the existing geographic information database. After analyzing the status and problems of existing 1/1,000 digital base map and GIS application database, the transformation parameters are estimated and the accuracy of the transformation is determined based on the transformed coordinates. We analyzed the accuracy of a transformation using the published national transformation coefficients as well as the estimated local transformation coefficients using national and urban control points in a study area. In addition, the 1/1,000 digital base map from aerial triangulation is compared with respect to the coordinates of urban control points. Based on the comparison, the biases on the national control points which were used at the time of digital map generation was analyzed. Then, the accuracy of transformed coordinates based on the world geodetic system using local transformation coefficients estimated from urban control points are determined. We also analyzed the transformation accuracy of underground infrastructure database using the same transformation method as the case of 1/1,000 digital base map. Through this study, it was found that the estimation of transformation coefficients by Molodensky-Badekas using urban control points was suitable for a local government. Furthermore, it was obvious that the accuracy of a 2-dimensional affine transformation was comparable to that of 7 parameter transformation for a local area. Applying the coordinate transformation and bias correction, we could transform GIS application database which was built by an offset surveying based on digital base map within the transformation accuracy of 10 cm. Therefore, it was judged that there will not be a big problem on the transformation of the GIS DB to the world geodetic system.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.1
• /
• pp.1-7
• /
• 2005

We propose an effective Landsat TM image compression method using the classified bidirectional prediction (CBP), the classified KLT and the SPIHT. The SPIHT is used to exploit the spatial redundancy of feature bands selected in the visible range and the infrared range separately. Regions of the prediction bands are classified into three classes in the wavelet domain, and then the CBP is performed to exploit the spectral redundancy. Residual bands that consist of difference values between the original band and the predicted band are decorrelated by the spectral KLT Finally, the three dimensional (3-D) SPIHT is used to encode the decorrelated coefficients. Experiment results show that the proposed method reconstructs higher quality Landsat TM image than conventional methods at the same bit rate.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.1
• /
• pp.91-96
• /
• 2015

In this study, we introduce robust face recognition system with illumination variation realized with the aid of CT preprocessing method. As preprocessing algorithm, Census Transform(CT) algorithm is used to extract locally facial features under unilluminated condition. The dimension reduction of the preprocessed data is carried out by using $(2D)^2$PCA which is the extended type of PCA. Feature data extracted through dimension algorithm is used as the inputs of proposed radial basis function neural networks. The hidden layer of the radial basis function neural networks(RBFNN) is built up by fuzzy c-means(FCM) clustering algorithm and the connection weights of the networks are described as the coefficients of linear polynomial function. The essential design parameters (including the number of inputs and fuzzification coefficient) of the proposed networks are optimized by means of artificial bee colony(ABC) algorithm. This study is experimented with both Yale Face database B and CMU PIE database to evaluate the performance of the proposed system.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.11
• /
• pp.789-794
• /
• 2013

A vehicle tracking system makes it possible to induce the vehicle movement path for avoiding traffic congestion and to prevent traffic accidents in advance by recognizing traffic flow, monitoring vehicles, and detecting road accidents. To track the vehicles effectively, those which appear in a sequence of video frames need to identified by extracting the features of each object in the frames. Next, the identical vehicles over the continuous frames need to be recognized through the matching among the objects' feature values. In this paper, we identify objects by binarizing the difference image between a target and a referential image, and the labelling technique. As feature values, we use the center coordinate of the minimum bounding rectangle(MBR) of the identified object and the averages of 1D FFT(fast Fourier transform) coefficients with respect to the horizontal and vertical direction of the MBR. A vehicle is tracked in such a way that the pair of objects that have the highest similarity among objects in two continuous images are regarded as an identical object. The experimental result shows that the proposed method outperforms the existing methods that use geometrical features in tracking accuracy.