• Title/Summary/Keyword: Mapping sequence

Search Result 352, Processing Time 0.025 seconds

T2 Relaxographic Mapping using 8-echo CPMG MRI Pulse Sequence

  • E-K. Jeong;Lee, S-H.;J-S. Suh;Y-Y wak;S-A. Shin;Y-K. Kwon;Y. Huh
    • Journal of the Korean Magnetic Resonance Society
    • /
    • v.1 no.1
    • /
    • pp.7-20
    • /
    • 1997
  • The mapping of the spin-spin relaxation time T2 in pixed-by-pixel was suggested as a quantitative diagnostic tool in medicine. Although the CPMG pulse sequence has been known to be the best pulse sequence for T2 measurement in physics NMR, the supplied pulse sequence by the manufacture of MRI system was able to obtain the maximum of 4 CPMG images. Eight or more images with different echo time TEs are required to construct a reliable T2 map, so that two or more acquisitions were required, which easily took more than 10 minutes. 4-echo CPMG imaging pulse sequence was modified to generate the maximum of 8 MR images with evenly spaced echo time TEs. In human MR imaging, since patients tend to move at least several pixels between the different acquisitions, 8-echo CPMG imaging sequence reduces the acquisition time and may remove any misregistration of each pixel's signal for the fitting T2. The resultant T2 maps using the theoretically simulated images and using the MR images of the human brain suggested that 8 echo CPMG sequence with short echo spacing such as 17∼20 msec can give the reliable T2 map.

  • PDF

AN ITERATIVE METHOD FOR EQUILIBRIUM PROBLEMS, VARIATIONAL INEQUALITY PROBLEMS AND FIXED POINT PROBLEMS

  • Shang, Meijuan;Su, Yongfu
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.1_2
    • /
    • pp.161-173
    • /
    • 2009
  • In this paper, we introduce an iterative scheme for finding a common element of the set of fixed points of a nonexpansive mapping, the set of solutions of the variational inequality for an inverse-strongly monotone mapping and the set of solutions of an equilibrium problem in a Hilbert space. We show that the iterative sequence converges strongly to a common element of the three sets. The results of this paper extend and improve the corresponding results announced by many others.

  • PDF

STRONG CONVERGENCE THEOREMS FOR ASYMPTOTICALLY QUASI-NONEXPANSIVE MAPPINGS AND INVERSE-STRONGLY MONOTONE MAPPINGS

  • He, Xin-Feng;Xu, Yong-Chun;He, Zhen
    • East Asian mathematical journal
    • /
    • v.27 no.1
    • /
    • pp.1-9
    • /
    • 2011
  • In this paper, we consider an iterative scheme for finding a common element of the set of fixed points of a asymptotically quasi nonexpansive mapping and the set of solutions of the variational inequality for an inverse strongly monotone mapping in a Hilbert space. Then we show that the sequence converges strongly to a common element of two sets. Using this result, we consider the problem of finding a common fixed point of a asymptotically quasi-nonexpansive mapping and strictly pseudocontractive mapping and the problem of finding a common element of the set of fixed points of a asymptotically quasi-nonexpansive mapping and the set of zeros of an inverse-strongly monotone mapping.

A fractal coding technique for color image sequence employing non-contractive interframe mapping (비축소 프레임간 변환을 이용한 컬러 동영상 프랙탈 부호화 기법)

  • 김창수;김인철;이상욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.8
    • /
    • pp.1707-1714
    • /
    • 1997
  • This paper proposes a novel algorithm for fractal coding of image sequence, based on the CPM (Circular Prediction Mapping) and the NCIM (Non Contractive Interframe Mapping). In the CPM and the NCIM, each range block is approximated by a domain block in the adjacent frame, which is of the same size as the range block. Also, in this paepr, we propose a coding scheme of color components and an algorithm for controlling the bit rate, resepectively, for practical implementation of the fractal coder. The computer simulation results on real image sequences demonstrate that the proposed algorithm provides very promising performance at low bit-rate, below 256 Kbps.

  • PDF

FRACTAL CODING OF VIDEO SEQUENCE USING CPM AND NCIM

  • Kim, Chang-Su;Kim, Rin-Chul;Lee, Sang-Uk
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1996.06b
    • /
    • pp.72-76
    • /
    • 1996
  • We propose a novel algorithm for fractal video sequence coding, based on the circular prediction mapping (CPM), in which each range block is approximated by a domain block in the circularly previous frame. In our approach, the size of the domain block is set to be same as that of the range block for exploiting the high temporal correlation between the adjacent frames, while most other fractal coders use the domain block larger than the range block. Therefore the domain-range mapping in the CPM is similar to the block matching algorithm in the motion compensation techniques, and the advantages of this similarity are discussed. Also we show that the CPM can be combined with non-contractive inter-frame mapping (NCIM), improving the performance of the fractal sequence coder further. The computer simulation results on real image sequences demonstrate that the proposed algorithm provides very promising performance at low bit-rate, ranging from 40 Kbps to 250 Kbps.

  • PDF

On the Phase Sequence Set of SLM Scheme for Crest Factor Reduction in OFDM System (OFDM 시스템의 Crest 값을 감소하기 위한 SLM 기법의 위상 시퀀스에 관한 연구)

  • Lim Dae-Woon;Heo Seok-Joong;No Jong-Seon;Chung Ha-Bong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9C
    • /
    • pp.889-896
    • /
    • 2006
  • The crest factor distribution of orthogonal frequency division multiplexing (OFDM) symbol sequences is evaluated and it is shown that OFDM symbol sequences with a short period are expected to have a high crest factor. The crest factor relationship between two input symbol sequences, Hamming distance D apart is also derived. Using these two results, we propose two criteria for a phase sequence set of the selected mapping (SLM) scheme and suggest the rows of the cyclic Hadamard matrix constructed from an m-sequence as the near optimal phase sequence set of the SLM scheme.

SSFP Interferometry (SSFPI) Technique Applied to functional MRI - A Fast and Direct Measurement of Magnetic Susceptibility Effect (SSFPI 기법을 이용한 MR 뇌기능 영상 -고 속의 자화율 효과의 직접적인 측정)

  • 정준영
    • Journal of Biomedical Engineering Research
    • /
    • v.17 no.4
    • /
    • pp.525-534
    • /
    • 1996
  • We have developed a fast steady state free precession interferometry (SSFPI) technique which is useful for the fMRl (functional Magnetic Resonance Imaging). As is known, SSFP sequence with a suitable adjustment of Vadient (readeut) allows us to measure precession angle 6 which in tw relates to the field inhomogeneity. Combining the two pulses (known as FID and Echo) in FADE (Fast Acquisition Double Echo) sequence, for example, one can obtain the interference term which is directly related to the precession angle It has been known that a fast high resolution magnetic field mapping is possible by use of the modified FADE sequence or SSFPI, and we have attempted to use the SSFPI technique for the susceptibility-induced fMRl. When the method is applied to the susceptibility effect based functional magnetic resonance imaging (fMRl), it was found that the direct susceptibility effect measurement was possible without perturbations such as the backgrounds and inflow effect. In this paper, simulation results and experimental results obtained with 2.0 Tesla MRI system are presented.

  • PDF

The Generalized Instantaneous Power Theory Using Mapping Matrices (맵핑 매트릭스를 사용한 일반화 순시전력 이론)

  • Kim, Hyo-Sung;Choi, Jae-Ho
    • Proceedings of the KIEE Conference
    • /
    • 1997.07f
    • /
    • pp.1930-1932
    • /
    • 1997
  • Instantaneous active/reactive powers are defined in three phase four wire systems. The definition can be generally applicable to any source conditions and load conditions including nonlinear circuits. The zero-sequence power resulted from the zero-sequence voltage and zero-sequence current between two sub-systems affects both to the instantaneous active and reactive powers. The zero-sequence current can be controlled by compensation of the reactive power without power storage elements.

  • PDF

BOEHMIANS ON THE TORUS

  • Nemzer, Dennis
    • Bulletin of the Korean Mathematical Society
    • /
    • v.43 no.4
    • /
    • pp.831-839
    • /
    • 2006
  • By relaxing the requirements for a sequence of functions to be a delta sequence, a space of Boehmians on the torus ${\beta}(T^d)$ is constructed and studied. The space ${\beta}(T^d)$ contains the space of distributions as well as the space of hyperfunctions on the torus. The Fourier transform is a continuous mapping from ${\beta}(T^d)$ onto a subspace of Schwartz distributions. The range of the Fourier transform is characterized. A necessary and sufficient condition for a sequence of Boehmians to converge is that the corresponding sequence of Fourier transforms converges in $D'({\mathbb{R}}^d)$.

On the Fine Spectrum of the Lower Triangular Matrix B(r, s) over the Hahn Sequence Space

  • Das, Rituparna
    • Kyungpook Mathematical Journal
    • /
    • v.57 no.3
    • /
    • pp.441-455
    • /
    • 2017
  • In this article we have determined the spectrum and fine spectrum of the lower triangular matrix B(r, s) on the Hahn sequence space h. We have also determined the approximate point spectrum, the defect spectrum and the compression spectrum of the operator B(r, s) on the sequence space h.