• Title/Summary/Keyword: 압축 알고리즘

Search Result 1,337, Processing Time 0.027 seconds

Sample-Adaptive Product Quantization and Design Algorithm (표본 적응 프러덕트 양자화와 설계 알고리즘)

  • 김동식;박섭형
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.12B
    • /
    • pp.2391-2400
    • /
    • 1999
  • Vector quantizer (VQ) is an efficient data compression technique for low bit rate applications. However, the major disadvantage of VQ is its encoding complexity which increases dramatically as the vector dimension and bit rate increase. Even though one can use a modified VQ to reduce the encoding complexity, it is nearly impossible to implement such a VQ at a high bit rate or for a large vector dimension because of the enormously large memory requirement for the codebook and the very large training sequence (TS) size. To overcome this difficulty, in this paper we propose a novel structurally constrained VQ for the high bit rate and the large vector dimension cases in order to obtain VQ-level performance. Furthermore, this VQ can be extended to the low bit rate applications. The proposed quantization scheme has a form of feed-forward adaptive quantizer with a short adaptation period. Hence, we call this quantization scheme sample-adaptive product quantizer (SAPQ). SAPQ can provide a 2 ~3dB improvement over the Lloyd-Max scalar quantizers.

  • PDF

Wavelet based data Watermarking (웨이브릿 기반의 데이터 워터마킹)

  • 김동현
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.6
    • /
    • pp.1224-1228
    • /
    • 2003
  • The use of digital imaging technique and digital contents based on internet has grown rapidly for last several years, and the needs of digital image protection become more important. For the purpose of copyright protection on digital image, the verification of authentication techniques like content authentication, ownership authentication, illegal copy and etc are needs. Digital watermarking, the invisible encryption technique to insert digital watermarking into image, the sophisticated perceptual information should be used for providing transparency and robustness of images on watermarking process. In this paper, we implement the algorithm for preventing forged attack. ownership protection and authentication by transforming the wavelet algorithms in frequency domain in terms of human visual system.

Digital Watermarking Technique in Wavelet Domain for Protecting Copyright of Contents (컨텐츠의 저작권 보호를 위한 DWT영역에서의 디지털 워터마킹 기법)

  • Seo, Young-Ho;Choi, Hyun-Jun;Kim, Dong-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.6
    • /
    • pp.1409-1415
    • /
    • 2010
  • In this paper we proposed the watermarking technique using the markspace which is selected by tree-structure between the subbands in the wavelet domain and feature information in the spatial domain. The watermarking candidate region in the wavelet domain is obtained by the markspace selection algorithm divides the highest frequency subband to several segments and calculates theirs energy and the averages value of the total energy of the subband. Also the markspace of the spatial domain is obtained by the boundary information of a image. The final markspace is selected by the markspaces of the wavelet and spatial domain. The watermark is embedded into the selected markspace using the random addresses by LFSR. Finally the watermarking image is generated using the inverse wavelet transform. The proposed watermarking algorithm shows the robustness against the attacks such as JPEG, blurring, sharpening, and gaussian noise.

Design of High Speed Binary Arithmetic Encoder for CABAC Encoder (CABAC 부호화기를 위한 고속 이진 산술 부호화기의 설계)

  • Park, Seungyong;Jo, Hyungu;Ryoo, Kwangki
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.4
    • /
    • pp.774-780
    • /
    • 2017
  • This paper proposes an efficient binary arithmetic encoder hardware architecture for CABAC encoding, which is an entropy coding method of HEVC. CABAC is an entropy coding method that is used in HEVC standard. Entropy coding removes statistical redundancy and supports a high compression ratio of images. However, the binary arithmetic encoder causes a delay in real time processing and parallel processing is difficult because of the high dependency between data. The operation of the proposed CABAC BAE hardware structure is to separate the renormalization and process the conventional iterative algorithm in parallel. The new scheme was designed as a four-stage pipeline structure that can reduce critical path optimally. The proposed CABAC BAE hardware architecture was designed with Verilog HDL and implemented in 65nm technology. Its gate count is 8.07K and maximum operating speed of 769MHz. It processes the four bin per clock cycle. Maximum processing speed increased by 26% from existing hardware architectures.

MRI Artifact Correction due to Unknown Respiratory Motion (미지 호흡운동에 의한 MRI 아티팩트의 수정)

  • 김응규
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.5
    • /
    • pp.53-62
    • /
    • 2004
  • In this study, an improved post-processing technique for correcting MRI artifact due to the unknown respiratory motion in the imaging plane is presented. Respiratory motion is modeled by a two-Dimensional linear expending-shrinking movement. Assuming that the body tissues are incompressible fluid like materials, the proton density per unit volume of the imaging object is kept constant. According to the introduced model, respiratory motion imposes phase error, non-uniform sampling and amplitude modulation distortions on the acquired MRI data. When the motion parameters are known or can be estimatead a reconstruction algorithm based on biliner superposition method was used to correct the MRI artifact. In the case of motion parameters are unknown, first, the spectrum shift method is applied to find the respiratory fluctuation function, x directional expansion coefficient and x directional expansion center. Next, y directional expansion coefficient and y directional expansion center are estimated by using the minimum energy method. Finally, the validity of this proposed method is shown to be effective by using the simulated motion images.

Range Walk Compensated Squint Cross-Range Doppler Processing in Bistatic Radar (바이스태틱 레이더에서 Range Walk이 보상된 Squint Cross-Range 도플러 프로세싱)

  • Youn, Jae-Hyuk;Kim, Kwan-Soo;Yang, Hoon-Gee;Chung, Yong-Seek;Lee, Won-Woo;Bae, Kyung-Bin
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.22 no.11
    • /
    • pp.1141-1144
    • /
    • 2011
  • Range walk has been a major problem in achieving correct Doppler processing. This frequently occurs when range variation is severe just like in a bistatic radar or in high speed target scenario. This paper presents a range walk compensated range-Doppler processing algorithm applicable to the bistatic radar. In order for the compensation, a range-domain interpolation is applied for range compressed signal so that Doppler processing is performed along the evenly time-spaced range bins that contain target returns. Under a bistatic radar scenario, the proposed algorithm including a range domain pulse compression is mathematically described. Finally, the validity of the algorithm is demonstrated by simulation results showing the superiority of a SCDP(Squint Cross-range Doppler Processing) over an uncompensated Doppler processing.

Object Tracking in HEVC Bitstreams (HEVC 스트림 상에서의 객체 추적 방법)

  • Park, Dongmin;Lee, Dongkyu;Oh, Seoung-Jun
    • Journal of Broadcast Engineering
    • /
    • v.20 no.3
    • /
    • pp.449-463
    • /
    • 2015
  • Video object tracking is important for variety of applications, such as security, video indexing and retrieval, video surveillance, communication, and compression. This paper proposes an object tracking method in HEVC bitstreams. Without pixel reconstruction, motion vector (MV) and size of prediction unit in the bitstream are employed in an Spatio-Temporal Markov Random Fields (ST-MRF) model which represents the spatial and temporal aspects of the object's motion. Coefficient-based object shape adjustment is proposed to solve the over-segmentation and the error propagation problems caused in other methods. In the experimental results, the proposed method provides on average precision of 86.4%, recall of 79.8% and F-measure of 81.1%. The proposed method achieves an F-measure improvement of up to 9% for over-segmented results in the other method even though it provides only average F-measure improvement of 0.2% with respect to the other method. The total processing time is 5.4ms per frame, allowing the algorithm to be applied in real-time applications.

Real-Time Implementation of Medical Ultrasound Strain Imaging System (의료용 초음파 스트레인 영상 시스템의 실시간 구현)

  • Jeong, Mok-Kun;Kwon, Sung-Jae;Bae, Moo-Ho
    • Journal of the Korean Society for Nondestructive Testing
    • /
    • v.28 no.2
    • /
    • pp.101-111
    • /
    • 2008
  • Strain imaging in a medical ultrasound imaging system can differentiate the cancer or tumor in a lesion that is stiffer than the surrounding tissue. In this paper, a strain imaging technique using quasistatic compression is implemented that estimates the displacement between pre- and postcompression ultrasound echoes and obtains strain by differentiating it in the spatial direction. Displacements are computed from the phase difference of complex baseband signals obtained using their autocorrelation, and errors associated with converting the phase difference into time or distance are compensated for by taking into the center frequency variation. Also, to reduce the effect of operator's hand motion, the displacements of all scanlines are normalized with the result that satisfactory strain image quality has been obtained. These techniques have been incorporated into implementing a medical ultrasound strain imaging system that operates in real time.

Digital Image Watermarking using Subband Correlation Wavelet Domain (웨이블릿 영역의 부대역 상관도를 이용한 디지털 영상 워터마킹)

  • 서영호;박진영;김동욱
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.6
    • /
    • pp.51-60
    • /
    • 2003
  • The watermarking is the technique that embeds or extracts the certain data without the change of the original data for the copyright protection of the multimedia contents. Watermark-embedded contents must not be distinguished by human's eye and must be robust to the various image processing and the intentional distortions. In this paper, we propose a new watermarking technique applied in the wavelet domain which has both the spatial and frequency information of a image. For both the robustness and the invisibility, the positions for embedding the watermark is selected with the multi-threshold. We search the similarity between highly correlated coefficients in the each subband and decide the mark space after verifying the significance in the specified subband. The similarity is represented by the coefficient difference between the subbands and its distribution is used in the watermark embedding and extracting. The embedded watermark can be extracted without the original image using the relationship of the subbands. By these properties the proposed watermarking algorithm has the invisibility and the robustness to the attacks such as JPEG compression and the general image processing.

Modified 3-step Search Motion Estimation Algorithm for Effective Early Termination (효과적인 조기 중단 기법을 위한 변형된 3단계 탐색 움직임 추정 알고리즘)

  • Yang, Hyeon-Cheol;Lee, Seong-Soo
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.47 no.7
    • /
    • pp.70-77
    • /
    • 2010
  • Motion estimation occupies most of the required computation in video compression, and many fast search algorithms were propsoed to reduce huge computation. SAD (sum-of-absolute difference) calculation is the most computation-intensive process in the motion estimation. Early termination is widely used in SAD calculation, where SAD calculation is terminated and it proceeds to next search position if partial SAD during SAD calculation exceeds current minimum SAD. In this paper, we proposed a modified 3-step search algorithm for effective early termination where only search order of search positions are adaptive rearranged. Simulation results show that the proposed motion estimation algorithm reduces computation by 17~30% over conventional 3-step search algorithm without extra computation, while maintaining same performance.