• 대한의용생체공학회:의공학회지
• /
• 제28권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.

• 대한자기공명의과학회:학술대회논문집
• /
• 대한자기공명의과학회 2003년도 제8차 학술대회 초록집
• /
• 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)

• 한국통신학회논문지
• /
• 제29권6C호
• /
• pp.785-792
• /
• 2004

본 논문에서는 Sharipo에 의해 소개된 EZW(embedded zerotree wavelet) 알고리즘을 개선하여 실시간 처리가 가능하며 효율이 더 좋은 방법을 제안하였다. 기존의 EZW는 각각의 심벌(symbol)마다 2비트를 할당하는데 이는 각 대역(band)에서 나타날 수 있는 심벌의 수를 고려하지 않고 부호화를 수행하는 것이므로 압축 효율이 떨어지는 단점이 있으며 부호화 과정에서 제로트리 코딩(zerotree coding)을 함으로써 많은 시간이 소요된다. 본 논문에서는 각 역별로 심별마다 가변 비트를 할당하여 압축 효율을 높였다. 그리고 Backscan방식을 사용하여 부호화 시간을 상당히 단축하였고 웨이블릿(wavelet) 변환을 리프팅 구조로 나타내어 전체적인 부호화 시간을 줄였다. 실험 결과 본 논문에서 제안한 방법이 기존의 EZW보다 PSNR은 약 0.3∼l.5［㏈］, 부호화 시간은 2∼10배 이상 향상됨을 확인하였다.

• ETRI Journal
• /
• 제28권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.

• 한국통신학회논문지
• /
• 제22권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• 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.

• 전자공학회논문지C
• /
• 제34C권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.

• 대한의용생체공학회:의공학회지
• /
• 제17권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.

• 한국음향학회지
• /
• 제16권2호
• /
• pp.95-100
• /
• 1997

본 논문에서는 새로운 고속 VQ 부호화 알고리즘을 제안한다. 제안된 알고리즘은 최단거리를 가질 수 없는 코드워드와의 거리계산을 피하기 위해 벡터의 두가지 특성, 평균 및 분산을 이용해서 계산량을 줄이고 있다. 제안된 알고리즘은 코드워드와 입력벡터사이의 거리의 기하학적인 관계를 이용해서 최단거리를 갖을 수 없는 코드워드들과의 거리계산을 피하고 있기 때문에 전체 탐색법과 동일한 결과를 가져다 준다. 실험결과는 제안된 알고리즘이 효과적임을 확인시켜준다.

• 한국통신학회논문지
• /
• 제31권11C호
• /
• pp.1077-1084
• /
• 2006

본 논문에서는 H.264/AVC에서 가장 많은 연산량을 차지하는 인터 예측(inter prediction)을 고속으로 수행할 수 있는 방법을 제안하였다. 제안한 방법은 율-왜곡 최적화 기법(Rate-Distortion Optimization, RDO)이 적용된 JM(Joint Model)의 FME(Fast Motion Estimation)를 대상으로 예측된 움직임 벡터의 방향성을 고려하여 탐색영역을 결정한 후 적응적인 후보 나선형 탐색을 수행한다. 동시에 가변 블록 크기에 대하여 비용함수의 임계값(threshold)을 결정한 후 가변 구간 움직임 탐색을 수행함으로써 인터 예측의 부호화 복잡도를 감소시킨다. 다양한 영상들을 대상으로 실험한 결과 기존의 예측 방식에 최대 80%의 연산량을 줄일 수 있음을 확인하였다. 이에 따른 화질 열화는 평균 $0.05dB{\sim}0.19dB$에 불과하며, 압축률은 평균 0.58%의 미미한 감소를 보임으로써, 제안한 방법이 고속 인터 예측 알고리즘으로 매우 효율적인 방법임을 확인하였다.