• Journal of Biomedical Engineering Research
• /
• v.28 no.1
• /
• pp.24-28
• /
• 2007

Presuming that firing neurons have motions inside the MRI magnet due to the interaction between the neuronal magnetic field and the main magnetic field, we applied motion encoding gradients to dissected snail ganglia to observe faster responding MRI signal than the BOLD signal. To activate the snail ganglia in synchronization with the MRI pulse sequence, we used electrical stimulation with the frequency of 30 Hz and the pulse width of 2s. To observe the fast responding signal, we used the volume selected MRI sequence. The magnetic resonance signal intensity, measured with 8 ms long motion encoding gradient with a 20mT/m gradient strength, decreased about $3.46{\pm}1.48%$ when the ganglia were activated by the electrical stimulation.

• Proceedings of the KSMRM Conference
• /
• 2003.10a
• /
• pp.71-71
• /
• 2003

For fast MRI, the number of phase encoding steps has to be reduced. However, the reconstructed image is aliased if the phase encoding steps don't satisfy Nyquist sampling theory. SENSE is used in order to eliminate the aliasing effect as well as to reduce imaging time. SENSE is a linear algebraic technique applied to the multiple receiver data. In this study, we implement a tool to reconstruct the original image (SENSE image) with Sensitivity Encoding (SENSE)

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.785-792
• /
• 2004

In this paper, we propose a fast and efficient method that improves the performance of embedded zerotree wavelet(EZW) algorithm introduced by Sharipo． In the EZW algorithm, two bits are allocated for a symbol, but it is inefficient for compression and the zerotree coding wastes much time at encoding. In this paper, in order to increase the efficiency of compression, it will be allocated a variable bit for a symbol at each subband. To reduce the encoding time, we use a backscan method and lifting scheme instead of filter bank in wavelet transform. Experimental result are shown that the algorithm suggested in this paper has a better performance about 0.3∼1.5㏈ PSNR while the encoding time was speeded up more than 2-10 times compared with the EZW algorithm.

• ETRI Journal
• /
• v.28 no.6
• /
• pp.721-731
• /
• 2006

A fast intra skip detection algorithm based on the ratedistortion (RD) cost for an inter frame (P-slices) is proposed for H.264/AVC video encoding. In the H.264/AVC coding standard, a robust rate-distortion optimization technique is used to select the best coding mode and reference frame for each macroblock (MB). There are three types of intra predictions according to profiles. These are $16{\times}16$ and $4{\times}4$ intra predictions for luminance and an $8{\times}8$ intra prediction for chroma. For the high profile, an $8{\times}8$ intra prediction has been added for luminance. The $4{\times}4$ prediction mode has 9 prediction directions with 4 directions for $16{\times}16$ and $8{\times}8$ luma, and $8{\times}8$ chrominance. In addition to the inter mode search procedure, an intra mode search causes a significant increase in the complexity and computational load for an inter frame. To reduce the computational load of the intra mode search at the inter frame, the RD costs of the neighborhood MBs for the current MB are used and we propose an adaptive thresholding scheme for the intra skip extraction. We verified the performance of the proposed scheme through comparative analysis of experimental results using joint model reference software. The overall encoding time was reduced up to 32% for the IPPP sequence type and 35% for the IBBPBBP sequence type.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1279-1288
• /
• 1997

In this paper, we propose a fast fractal coding method based on LMSE analysis and subblock feature. In the proposed method, scaling paarameter is calculated and whether search for each domain block should be done or not is determined based on the LMSE analysis of fractal approximation, and isometry parameter is chosen based on subblock feature. To investigate the efficiency of the proposed method, we compared it with Jacquin's method on image quality and encoding time. Experimental results show the proposed method yields nearly the same performance as that of Jacquin method in PSNR, and its encoding time is reduced by about 1/7 times.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.669-672
• /
• 1998

In this paper, w epropose a fast fractal coding method based on correlation coefficients of subblocks in input image. In the proposed method, domain pool is selected based on correlation analysis of input image and the isometry transform for each block is chosen based on the IFS method. To investigate the performance of the proposed method, we compared image quality and encoding time with full search PIFS method and jacquin's PIFS method. Experimental results show that proposed method yields nearly the same performance in PSNR, and its encoding time is reduced for images size of 512*512 compared with full search PIFS method and jacquin's PIFS method.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.10
• /
• pp.27-35
• /
• 1997

In this paper, we propose a new scheme for the generation of partial products for VLSI fast parallel multiplier. It adopts a new encoding method which halves the number of partial products using 2x2 submultipliers and rearrangement of primitive partial products. The true 4-input CSA can be achieved with appropriate rearrangement of primitive partial products out of 2x2 submultipliers using the newly proposed theorem on binary number system. A 16bit x 16bit multiplier has been desinged using the proposed method and simulated to prove that the method has comparable speed and area compared to booth's encoding method. Much smaller and faster multiplier could be obtained with far optimization. The proposed scheme can be easily extended to multipliers with inputs of higher resolutions.

• Journal of Biomedical Engineering Research
• /
• v.17 no.1
• /
• pp.93-98
• /
• 1996

The purpose of this paper is to propose a new localized imaging method of reduced imaging time luting a locally-linear gradient. Since most fast MR(Magnetic Resonance) imaging methods need the whole $\kappa$-space(Spatial frequency space) data corresponding to the whole imaging area, there are limitstions in reducing the minimum imaging time. The imaging method proposed in this paper uses a specially-made gradient coil generating a local ramp-shape field and uniform field outside of the imaging areal Conventional imaging sequences can be used without any RF/gradient pulse sequence modifiestions except the change in the number of encoding steps and the field of view.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.2
• /
• pp.95-100
• /
• 1997

In this paper, we present a new fast VQ encoding algorithm. The proposed algorithm facilitates two characteristics of a vector, i.e., mean and variance to reject many unlikely codewords and save a lot of computation time. Since the proposed algorithm, which is based upon geometric considerations, rejects those codewords that are impossible to be the closest codeword, it provides the same results as a conventional exhaustive(or full) search algorithm. The simulation results confirm the effectiveness of the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11C
• /
• pp.1077-1084
• /
• 2006

This paper proposed a fast algorithm to reduce the amount of calculation for inter prediction which takes a great deal of the operational time in H.264/AVC. This algorithm decides a search range according to the direction of predicted motion vector, and then performs an adaptive spiral search for the candidates with JM(Joint Model) FME(Fast Motion Estimation) which employs the rate-distortion optimization(RDO) method. Simultaneously, it decides a threshold cost value for each of the variable block sizes and performs the motion estimation for the variable search ranges with the threshold. These activities reduce the great amount of the complexity in inter prediction encoding. Experimental results by applying the proposed method .to various video sequences showed that the process time was decreased up to 80% comparing to the previous prediction methods. The degradation of video quality was only from 0.05dB to 0.19dB and the compression ratio decreased as small as 0.58% in average. Therefore, we are sure that the proposed method is an efficient method for the fast inter prediction.