• Title/Summary/Keyword: 복잡한 영상

Search Result 1,870, Processing Time 0.028 seconds

A Wavelet Based Robust Logo Watermarking Algorithm for Digital Content Protection (디지털 콘텐트 보호를 위한 강인한 웨이블릿 기반 로고 워터마킹 알고리즘)

  • Kim, Tae-Jung;Hwang, Jae-Ho;Hong, Choong-Seon
    • Journal of Internet Computing and Services
    • /
    • v.9 no.1
    • /
    • pp.33-41
    • /
    • 2008
  • Due to the advantage of wavelet transform such as the compatibility with JPEG2000, multi-resolution decomposition, and application of HVS(Human Visual System), watermarking algorithm based on wavelet transform (DWT) is recently mast interesting research subject. However, mast of researches are focused on theoretical aspects for the robustness rather than practical usage, and. may be not suitable too much complicated to use in practice. In this paper, robust logo watermarking algorithm based on DWT is proposed for large and huge data processing. The proposed method embeds the logo watermark by mapping of $8{\times}8$ blocks in order of the number of '1' of the original image and the randomized watermark image with LFSR. The original image is transformed by 2 level wavelet. The experimental results shows that the watermark is embedded successfully, and the proposed algorithm has the valuable robustness from the image processing like JPEG compression, low pass filter, high pass filter and changes in brightness and contrast.

  • PDF

VLSI architecture design of CAVLC entropy encoder/decoder for H.264/AVC (H.264/AVC를 위한 CAVLC 엔트로피 부/복호화기의 VLSI 설계)

  • Lee Dae-joon;Jeong Yong-jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5C
    • /
    • pp.371-381
    • /
    • 2005
  • In this paper, we propose an advanced hardware architecture for the CAVLC entropy encoder/decoder engine for real time video compression. The CAVLC (Context-based Adaptive Variable Length Coding) is a lossless compression method in H.264/AVC and it has high compression efficiency but has computational complexity. The reference memory size is optimized using partitioned storing method and memory reuse method which are based on partiality of memory referencing. We choose the hardware architecture which has the most suitable one in several encoder/decoder architectures for the mobile devices and improve its performance using parallel processing. The proposed architecture has been verified by ARM-interfaced emulation board using Altera Excalibur and also synthesized on Samsung 0.18 um CMOS technology. The synthesis result shows that the encoder can process about 300 CIF frames/s at 150MHz and the decoder can process about 250 CIF frames/s at 140Mhz. The hardware architectures are being used as core modules when implementing a complete H.264/AVC video encoder/decoder chip for real-time multimedia application.

Implementation of Matrix Receiving Structure for Versatile Multi-Mission LEO Operations (저궤도 다중위성 운용을 위한 매트릭스 구조의 수신 채널 구현)

  • Park, Durk-Jong;Yeom, Kyung-Whan
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.24 no.10
    • /
    • pp.1001-1007
    • /
    • 2013
  • In the case of multi-mission LEO(Low Earth Orbit) operations, depending on the orbit of each satellite, one ground site is supposed to be communicated with more than two satellites at the same time. On top of that, image data processing system is generally mission-specific and 1:1 backup configuration. For the reason, if ground site has smaller number of antenna than that of satellite, interface with image data processing system would be very complicated. In this paper, considering that two LEO satellites can be operating and image data recording unit in redundancy can be easily plug-in, the implementation of matrix receiving structure is described. This matrix receiving structure has been validated from KOMPSAT-2 and -3(KOrea Multi-Purpose SATellite-2 and -3) since KOMPSAT-3 was launched in May, 2012. This structure will be applied for the KOMPSAT-3A and -5 through its expandability.

Initial QP Modeling for GOP Layer Rate Control (GOP 레이어 비트율 제어를 위한 초기 QP 모델링)

  • Park, Sang-Hyun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.6
    • /
    • pp.1377-1383
    • /
    • 2012
  • The first frame of a GOP is encoded in intra mode which generates a larger number of bits. In addition, the first frame is used for the inter mode encoding of the following frames. Thus the intial QP for the first frame affects the first frame as well as the following frames. Traditionally, the initial QP is determined among four constant values only depending on the bpp. Although this initialization scheme is simple, yet it is not accurate enough. An accurate intial QP prediction scheme should not only depends on bpp but also on the complexity of the video sequence and the output bandwidth. In this paper, we propose a traffic model for finding the optimal initial QP which maximizes the PSNR of the GOP. We also propose a method to find model parameters for real-time video encoding. It is shown by experimental results that the proposed traffic model captures initial QP characteristics effectively and the proposed method for model parameters accurately estimates the real values.

Performance Comparison of Implementation Technologies for Image Quality Enhancement Operations on Android Platforms (Android 플랫폼에서 구현 기술에 따른 화질 개선 연산 성능 비교)

  • Lee, Ju-Ho;Lee, Goo-Yeon;Jeong, Choong-Kyo
    • Journal of Digital Contents Society
    • /
    • v.14 no.1
    • /
    • pp.7-14
    • /
    • 2013
  • As mobiles devices with high-spec camera built in are used widely, the visual quality enhancement of the high-resolution images turns out to be one of the key capabilities of the mobile devices. Due to the limited computational resources of the mobile devices and the size of the high-resolution images, we should choose an image processing algorithm not too complex and use an efficient implementation technology. One of the simple and widely used image quality enhancement algorithms is contrast stretching. Java libraries running on a virtual machine, JNI (Java Native Interface) based native C/C++, and NEONTM SIMD (Single Instruction Multiple Data) are common implementation technologies in the case of Android smartphones. Using these three implementation technologies, we have implemented two image contrast stretching algorithms - linear and equalized, and compared the computation times. The native C/C++ and the NEONTM SIMD outperformed the native C/C++ implementation by 56-78 and 50-76 time faster respectively.

The Design of Parallel Processing S/W Using CUDA for Realtime 3D Laser Ladar Imaging System (실시간 3차원 레이저 레이더 영상 생성을 위한 CUDA 기반 병렬처리 소프트웨어 설계)

  • Cho, Yong Il;Ha, Choong Lim;Yang, Ji Hyeon;Kim, Jae Hyup
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.1
    • /
    • pp.1-10
    • /
    • 2013
  • In this paper, we propose a CUDA(Common Unified Device Architecture) based SW(software) design method for CPU(Central Processing Unit) and GPU(Graphic Processing Unit) parallel structure to implement real-time process in 3D Laser ladar(LADAR) imaging system. LADAR is a complex system to generate 3-dimensional image based on the laser ranging information, and requires massive process resources in each phase. Therefore, designing and implementing parallel structure are crucial to realize a real-time process within limited system resource. As a conclusion, we can meet the speed of required real-time process allocating separable work load to CUDA GPU by analyzing process algorithm in each phase and confirm the process speed increase by 46%.

East Reconstruction of 3D Human Model from Contour Lines (외곽선을 이용한 고속 3차원 인체모델 재구성)

  • Shin Byeong-Seok;Roh Sung;Jung Hoe-Sang;Chung Min Suk;Lee Yong Sook
    • Journal of Biomedical Engineering Research
    • /
    • v.25 no.6
    • /
    • pp.537-543
    • /
    • 2004
  • In order to create three-dimensional model for human body, a method that reconstructs geometric models from contour lines on cross-section images is commonly used. We can get a set of contour lines by acquiring CT or MR images and segmenting anatomical structures. Previously proposed method divides entire contour line into simply matched regions and clefts. Since long processing time is required for reconstructing cleft regions, its performance might be degraded when manipulating complex data such as cross-sections for human body. In this paper, we propose a fast reconstruction method. It generates a triangle strip with single tiling operation for simple region that does not contain branch structures. If there exist branches in contour lines, it partitions the contour line into several sub-contours by considering the number of vertices and their spatial distribution. We implemented an automatic surface reconstruction system by using our method which reconstructs three-dimensional models for anatomical structures.

Image Filter Optimization Method based on common sub-expression elimination for Low Power Image Feature Extraction Hardware Design (저전력 영상 특징 추출 하드웨어 설계를 위한 공통 부분식 제거 기법 기반 이미지 필터 하드웨어 최적화)

  • Kim, WooSuk;Lee, Juseong;An, Ho-Myoung;Kim, Byungcheul
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.10 no.2
    • /
    • pp.192-197
    • /
    • 2017
  • In this paper, image filter optimization method based on common sub-expression elimination is proposed for low-power image feature extraction hardware design. Low power and high performance object recognition hardware is essential for industrial robot which is used for factory automation. However, low area Gaussian gradient filter hardware design is required for object recognition hardware. For the hardware complexity reduction, we adopt the symmetric characteristic of the filter coefficients using the transposed form FIR filter hardware architecture. The proposed hardware architecture can be implemented without degradation of the edge detection data quality since the proposed hardware is implemented with original Gaussian gradient filtering algorithm. The expremental result shows the 50% of multiplier savings compared with previous work.

An Efficient Computation Method of Zernike Moments Using Symmetric Properties of the Basis Function (기저 함수의 대칭성을 이용한 저니키 모멘트의 효율적인 계산 방법)

  • 황선규;김회율
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.5
    • /
    • pp.563-569
    • /
    • 2004
  • A set of Zernike moments has been successfully used for object recognition or content-based image retrieval systems. Real time applications using Zernike moments, however, have been limited due to its complicated definition. Conventional methods to compute Zernike moments fast have focused mainly on the radial components of the moments. In this paper, utilizing symmetric/anti-symmetric properties of Zernike basis functions, we propose a fast and efficient method for Zernike moments. By reducing the number of operations to one quarter of the conventional methods in the proposed method, the computation time to generate Zernike basis functions was reduced to about 20% compared with conventional methods. In addition, the amount of memory required for efficient computation of the moments is also reduced to a quarter. We also showed that the algorithm can be extended to compute the similar classes of rotational moments, such as pseudo-Zernike moments, and ART descriptors in same manner.

An Adaptive Switching Mechanism for Three-Dimensional Hybrid Cameras (하이브리드 입체 카메라의 적응적인 스위칭 메커니즘)

  • Jang, Seok-Woo;Choi, Hyun-Jun;Lee, Suk-Yun;Huh, Moon-Haeng
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.3
    • /
    • pp.1459-1466
    • /
    • 2013
  • Recently, various types of three-dimensional cameras have been used to analyze surrounding environments. In this paper, we suggest a mechanism of adaptively switching active and passive cameras of hybrid cameras, which can extract 3D image information more accurately. The suggested method first obtains brightness and texture features representing the environment from input images. It then adaptively selects active and passive cameras by generating rules that reflect the extracted features. In experimental results, we show that a hybrid 3D camera consisting of passive and active cameras is set up and the proposed method can effectively choose appropriate cameras in the hybrid camera and make it possible to extract three dimensional information more accurately.