• Title/Summary/Keyword: dctA

Search Result 846, Processing Time 0.027 seconds

A Study on the Hierachical Coding of the Angiography by Using the Scalable Structure in the MPACS System (MPACS 시스템에서 Scalable 구조를 이용한 심장 조영상의 계층적 부호화에 관한 연구)

  • Han, Young-Oh;Jung, Jae-Woo;Ahn, Jin-Ho;Park, Jong-Kwan;Shin, Joon-In;Park, Sang-Hui
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1995 no.05
    • /
    • pp.235-238
    • /
    • 1995
  • In this paper, we propose an effective coding method of the angiography by using the scalable structure in the frequency domain for MPACS(Medical Picture Archiving and Communication System). We employed the subband decomposition method and MPEG-2 system which is the international standard coding method of the general moving picture. After the subband decomposition is applied to split an input image into 4 bands in the spatial frequency domain, the motion compensated DPCM coding method of MPEG-2 is carried out for each subband. As a result, an easily controllable coding Structure is accomplished by composing the compound hit stream for each subband group. Follows are the simulation results of the proposed sheme for the angiography. A scalable structure which can be easily controlled for a loss of transmission or the band limit can be accomplisbed in the MPEG-2 stucture by the subband decomposition minimizing the side information. And by reducing the search area of the motion vector between -4 and 3, the processing speed of a codec is enhanced by more than two times without a loss of the picture quality compare with the conventional DCT coefficients decompositon method. And the processing speed is considerably improved in the case of the parallel construction of each subband in the hardware.

  • PDF

Evaluation of usefulness of the Gated Cone-beam CT in Respiratory Gated SBRT (호흡동조 정위체부방사선치료에서 Gated Cone-beam CT의 유용성 평가)

  • Hong sung yun;Lee chung hwan;Park je wan;Song heung kwon;Yoon in ha
    • The Journal of Korean Society for Radiation Therapy
    • /
    • v.34
    • /
    • pp.61-72
    • /
    • 2022
  • Purpose: Conventional CBCT(Cone-beam Computed-tomography) caused an error in the target volume due to organ movement in the area affected by respiratory movement. The purpose of this paper is to evaluate the usefulness of accuracy and time spent using the Gated CBCT function, which reduces errors when performing RGRT(respiratory gated radiation therapy), and to examine the appropriateness of phase. Materials and methods: To evaluate the usefulness of Gated CBCT, the QUASARTM respiratory motion phantom was used in the Truebeam STxTM. Using lead marker inserts, Gated CBCT was scaned 5 times for every 20~80% phase, 30~70% phase, and 40~60% phase to measure the blurring length of the lead marker, and the distance the lead marker moves from the top phase to the end of the phase was measured 5 times. Using Cedar Solid Tumor Inserts, 4DCT was scanned for every phase, 20-80%, 30-70%, and 40-60%, and the target volume was contoured and the length was measured five times in the axial direction (S-I direction). Result: In Gated CBCT scaned using lead marker inserts, the axial moving distance of the lead marker on average was measured to be 4.46cm in the full phase, 3.11cm in the 20-80% phase, 1.94cm in the 30-70% phase, 0.90cm in the 40-60% phase. In Fluoroscopy, the axial moving distance of the lead marker on average was 4.38cm and the distance on average from the top phase to the beam off phase was 3.342cm in the 20-80% phase, 3.342cm in the 30-70% phase, and 0.84cm in the 40-60% phase. Comparing the results, the difference in the full phase was 0.08cm, the 20~80% phase was 0.23cm, the 30~70% phase was 0.10cm, and the 40~60% phase was 0.07cm. The axial lengths of ITV(Internal Target Volume) and PTV(Planning Target Volume) contoured by 4DCT taken using cedar solid tumor inserts were measured to be 6.40cm and 7.40cm in the full phase, 4.96cm and 5.96cm in the 20~80% phase, 4.42cm and 5.42cm in the 30~70% phase, and 2.95cm and 3.95cm in the 40~60% phase. In the Gated CBCT, the axial lengths on average was measured to be 6.35 cm in the full phase, 5.25 cm in the 20-80% phase, 4.04 cm in the 30-70% phase, and 3.08 cm in the 40-60% phase. Comparing the results, it was confirmed that the error was within ±8.5% of ITV Conclusion: Conventional CBCT had a problem that errors occurred due to organ movement in areas affected by respiratory movement, but through this study, obtained an image similar to the target volume of the setting phase using Gated CBCT and verified its usefulness. However, as the setting phase decreases, the scan time was increases. Therefore, considering the scan time and the error in setting phase, It is recommended to apply it to patients with respiratory coordinated stereotactic radiation therapy using a wide phase of 30-70% or more.

Error Concealment Method for MPEG-4 Video in Wireless Environment (무선환경에서 MPEG-4 영상의 오류은닉 방법)

  • Park, Sun-Young;Song, Joon-Ho;Moon, Joo-Hee
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.6
    • /
    • pp.641-651
    • /
    • 2002
  • Recently, many advanced video application services over the mobile wireless networks have required a transcoder which can efficiently reduce the size of compressed video bitstreams. The transcoder can be worked in either the spatial domain or the DCT domain. In this paper, we propose a new fast hybrid-type transcoder which can efficiently reduce the frame size with keeping the visual quality. The proposed scheme consists of two major processes: a transform domain process and a spatial domain process. We also propose a scheme for coding mode selection and motion vector refinement. Experimental results show that our approach can reduce the computational complexity more than any other conventional spatial-domain transcoder with keeping the visual quality.

Digital Image Watermarking using Inner Product and Adaptive Quantization (내적과 적응성 양자화를 이용한 디지털 영상의 워터마킹 방법)

  • 이승욱;김진호;호요성
    • Journal of Broadcast Engineering
    • /
    • v.6 no.1
    • /
    • pp.50-57
    • /
    • 2001
  • A digital watermarking is a newly developed scheme to embed invisible or inaudible information Into the host data in order to insist the copyright of the owner or the creator. This paper describes a robust data embedding scheme that employs inner product and adaptive quantization. Compared to the previous works for digital watermarking, our proposed scheme can embed relatively large amount of Information, since a secrete key Is not directly relaxed to the watermark data. A secret key is used for the design of random direction vectors. which are taken Inner product with the DCT transformed feature set data. In odder to achieve robustness against malicious attacks. we exploit the Properties of human visual system In designing the random direction vectors which behave as embedded noises. Experimental results show that we can recover the embedded information without utilizing the original host data. We also demonstrate that the ownership assertion is possible even though The watermarked data may undergo common signal processing operations, such as JPEG compression. clopping. and filtering.

  • PDF

Improvement of performance for the LBG algorithm by the decision of initial codevectors (초기 코드백터 결정에 의한 LBG 알고리즘의 성능 개선)

  • Hong, Chi-Hwun;Ch0, Che-Hwang
    • The Journal of the Acoustical Society of Korea
    • /
    • v.14 no.2
    • /
    • pp.16-29
    • /
    • 1995
  • Choosing initial codevectors in the LBG algorithm controls the performance of a codebook, because it only guarantees a locally optimal codebook. In this paper, we propose the decision method of initial codevectors by a decision radius which takes for feature vectors DC, low frequency, medium frequency and high frequency terms generated by a DCT. The more the decision radius is increased in order to decide initial codevectors, the more the number of membership vectors and the standard deviation for distance among the initial codevectors are increased. To obtain improved performance for a codebook, the decision radius for DC term is required above 0.9 of the membership rate and those for low frequency, medium frequency and high frequency terms under 0.6 of it.

  • PDF

Development of Hospital Image Management and Communication System (의료용 화상정보 처리 시스템 개발)

  • 이준하;이상학;신현진
    • Progress in Medical Physics
    • /
    • v.4 no.2
    • /
    • pp.59-67
    • /
    • 1993
  • In this paper, we present a result of our study on how to construct a HIMCS(hospital image management and communication system) based on Windows system. The proposed HIMCS is composed of image acquisition units, image archiving and processing units, display units, and all units are interfaced with LAN. We construct high speed image transmission system for distributed database and retrieval of various medical pictures in ward through image transmission system and realize integrated image diagnosis. Hospital image management and communication systems(HIMCS) have been proposed as a way to meet the challenge presented by the growing volume of medical imaging data. These systems are based on the concept of handing images in digital form, there by marking use of advances in computer-based technology. A HIMCS offers a wide spectrum of advantages over filmbased imaging. Digital acquisition of images eliminates the need for film processing and associated costs in both time and materials.

  • PDF

Block Histogram Compression Method for Selectivity Estimation in High-dimensions (고차원에서 선택율 추정을 위한 블록 히스토그램 압축방법)

  • Lee, Ju-Hong;Jeon, Seok-Ju;Park, Seon
    • The KIPS Transactions:PartD
    • /
    • v.10D no.6
    • /
    • pp.927-934
    • /
    • 2003
  • Database query optimates the selectivety of a query to find the most efficient access plan. Multi-dimensional selectivity estimation technique is required for a query with multiple attributes because the attributes are not independent each other. Histogram is practically used in most commercial database products because it approximates data distributions with small overhead and small error rates. However, histogram is inadequate for a query with multiple attributes because it incurs high storage overhead and high error rates. In this paper, we propose a novel method for multi-dimentional selectivity estimation. Compressed information from a large number of small-sized histogram buckets is maintained using the discrete cosine transform. This enables low error rates and low storage overheads even in high dimensions. Extensive experimental results show adventages of the proposed approach.

A Novel RGB Image Steganography Using Simulated Annealing and LCG via LSB

  • Bawaneh, Mohammed J.;Al-Shalabi, Emad Fawzi;Al-Hazaimeh, Obaida M.
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.1
    • /
    • pp.143-151
    • /
    • 2021
  • The enormous prevalence of transferring official confidential digital documents via the Internet shows the urgent need to deliver confidential messages to the recipient without letting any unauthorized person to know contents of the secret messages or detect there existence . Several Steganography techniques such as the least significant Bit (LSB), Secure Cover Selection (SCS), Discrete Cosine Transform (DCT) and Palette Based (PB) were applied to prevent any intruder from analyzing and getting the secret transferred message. The utilized steganography methods should defiance the challenges of Steganalysis techniques in term of analysis and detection. This paper presents a novel and robust framework for color image steganography that combines Linear Congruential Generator (LCG), simulated annealing (SA), Cesar cryptography and LSB substitution method in one system in order to reduce the objection of Steganalysis and deliver data securely to their destination. SA with the support of LCG finds out the optimal minimum sniffing path inside a cover color image (RGB) then the confidential message will be encrypt and embedded within the RGB image path as a host medium by using Cesar and LSB procedures. Embedding and extraction processes of secret message require a common knowledge between sender and receiver; that knowledge are represented by SA initialization parameters, LCG seed, Cesar key agreement and secret message length. Steganalysis intruder will not understand or detect the secret message inside the host image without the correct knowledge about the manipulation process. The constructed system satisfies the main requirements of image steganography in term of robustness against confidential message extraction, high quality visual appearance, little mean square error (MSE) and high peak signal noise ratio (PSNR).

A Fast Inter Mode Decision Algorithm Considering Quantization Parameter in H.264 (H.264 표준에서 양자화 계수를 고려한 고속 인터모드 결정 방법)

  • Kim, Geun-Yong;Ho, Yo-Sung
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.6 s.312
    • /
    • pp.11-19
    • /
    • 2006
  • The recent video coding standard H.264 employs the rate-distortion optimization (RDO) method for choosing the best coding mode; however, it causes a large amount of encoding time. Thus, in order to reduce the encoding time, we need a fast mode decision algorithm. In this paper, we propose a fast inter mode decision algorithm considering quantization parameter (QP). The occurrence of best modes depends on QP. In order to reflect these characteristics, we consider the coded block pattern (CBP) which has 0 value when all quantized discrete cosine transform (DCT) coefficients are zero. We also use the early SKIP mode decision and early $16{\times}16$ mode decision methods. By computer simulations, we have verified that the proposed algorithm requires less encoding time than the fast inter mode decision method of the H.264 reference software for the Baseline and Main profiles by 19.6% and 18.8%, respectively.

A Design of high throughput IDCT processor in Distrited Arithmetic Method (처리율을 개선시킨 분산연산 방식의 IDCT 프로세서 설계)

  • 김병민;배현덕;조태원
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.40 no.6
    • /
    • pp.48-57
    • /
    • 2003
  • In this paper, An 8${\times}$l ID-IDCT processor with adder-based distributed arithmetic(DA) and bit-serial method Is presented. To reduce hardware cost and to improve operating speed, the proposed 8${\times}$1 ID-IDCT used the bit-serial method and DA method. The transform of coefficient equation results in reduction in hardware cost and has a regularity in implementation. The sign extension computation method reduces operation clock. As a result of logic synthesis, The gate count of designed 8${\times}$1 1D-IDCT is 17,504. The sign extension processing block has gate count of 3,620. That is 20% of total 8${\times}$1 ID-IDCT architecture. But the sign extension processing block improves more than twice in throughput. The designed IDCT processes 50Mpixels per second and at a clock frequency of 100MHz.