• Title/Summary/Keyword: Real-time compression

Search Result 366, Processing Time 0.024 seconds

Multiresolution Watermarking Scheme on DC Image in DCT Compressed Domain (DCT 압축영역에서의 DC 영상 기반 다해상도 워터마킹 기법)

  • Kim, Jung-Youn;Nam, Je-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.4
    • /
    • pp.1-9
    • /
    • 2008
  • This paper presents a rapid watermarking algorithm based on DC image, which provides a resilience to geometric distortion. Our proposed scheme is based on $8{\times}8$ block DCT that is widely used in image/video compression techniques (e.g., JPEG and MPEG). In particular, a DC image is analyzed by DWT to embed a watermark. To overcome a quality degradation caused by a watermark insertion into DC components, we discern carefully the intensity and amount of watermark along the different subbands of DWT. Note that the proposed technique supports a high throughput for a real-time watermark insertion and extraction by relying on a partial decoding (i.e., DC components) on $8{\times}8$ block DCT domain. Experimental result shows that the proposed watermarking scheme significantly reduces computation time of 82% compared with existing DC component based algorithm and yet provides invariant properties against various attacks such as geometric distortion and JPEG compression, etc.

A Study of Efficient Transmission of SVG File using SMETA (SMETA를 이용한 효과적인 SVG 파일 전송에 관한 연구)

  • Yoo, Nam-Hyun;Son, Cheol-Su;Kim, Won-Jung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.1
    • /
    • pp.14-19
    • /
    • 2007
  • As XML is used by standard format for information expression and information exchange in various field, Many Company began to use SVG by user interface or information expression tool of embedded system such as mobile phone based wireless internet. Because SVG has many additional information to keep structure of SVG document exception real data, there is a problem that transfer time of SVG file is so cost for quantity of transmitted data actually. To solve this problem, many researches using compression conception have been conducted for applying to an embedded system. This paper proposes SMETA that can use existing researches using compression concept at once. SMETA divides SVG file to each part that can allocate meaning, and gives semantic metadata to each part without alteration of SVG structure. SMETA can reduce site of transmitted SVG file actually by transmitting specification part of SVG file that metadata does not agree or has unlisted part in an embedded system between an embedded system and server, before transmit whole SVG file. By size of transmitting SVG file is decreasing, transfer time can be shortened accordingly.

Monitoring System for TV Advertisement Using Watermark (워터마크를 이용한 TV방송 광고모니터링 시스템)

  • Shin, Dong-Hwan;Kim, Geung-Sun;Kim, Jong-Weon;Choi, Jong-Uk
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.15-18
    • /
    • 2004
  • In this paper, it is implemented the monitoring system for TV advertisement using video watermark. The functions of an advertisement monitoring system are automatically monitoring for the time, length, and index of the on-air advertisement, saving the log data, and reporting the monitoring result. The performance of the video watermark used in this paper is tested for TV advertisement monitoring. This test includes LAB test and field test. LAB test is done in laboratory environment and field test in actually broadcasting environment. LAB test includes PSNR, distortion measure in image, and the watermark detection rate in the various attack environment such as AD/DA(analog to digital and digital to analog) conversion, noise addition, and MPEG compression The result of LAB test is good for the TV advertisement monitoring. KOBACO and SBS are participated in the field test. The watermark detection rate is 100% in both the real-time processing and the saved file processing. The average deviation of the watermark detection time is 0.2 second, which is good because the permissible average error is 0.5 second.

  • PDF

A Study on the design of Video Watermarking System for TV Advertisement Monitoring (TV광고 모니터링을 위한 비디오 워터마킹 시스템의 설계에 관한 연구)

  • Shin, Dong-Hwan;Kim, Sung-Hwan
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.1
    • /
    • pp.206-213
    • /
    • 2007
  • In this paper, The monitoring system for TV advertisement is implemented using video watermark. The functions of the advertisement monitoring system are monitoring the time, length, and index of the on-air advertisement, saving the log data, and reporting the monitoring result. The performance of the video watermark used in this paper is tested for TV advertisement monitoring. This test includes LAB test and field test. LAB test is done in laboratory environment and field test in actually broadcasting environment. LAB test includes PSNR, distortion measure in image, and the watermark detection rate in the various attack environment such as AD/DA(analog to digital and digital to analog) conversion, noise addition, and MPEG compression. The result of LAB test is good for the TV advertisement monitoring. KOBACO and SBS are participated in the field test. The watermark detection rate is 100% in both the real-time processing and the saved the processing. The average deviation of the watermark detection time is 0.2 second, which is good because the permissible average error is 0.5 second.

Utilization of the Route Table for the Agent's Move in the Game Map (게임지도에서 에이젼트 이동을 위한 경로표 활용)

  • Shim, Dong-Hee;Kang, Hyuk
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.10
    • /
    • pp.3164-3170
    • /
    • 2000
  • The use of the A' for the path search of the agent in the game map give the overhead of computing time in real time game processing. The other heuristic search algorithms do not guarantee the optical path. The route table of which the row is defined by current position, goal position, visiting position is presented in this paper. This route table is made in the game development phase and tilized in game playing. The visiting position which is contatined in the optimal path to the goal position from the current position can guarantee the optical path, and this mothod has no overhead on computing time. But the memory space is requred too much. This problem can also be solved using the data compression by skipping the duplicated route table.

  • PDF

Real-Time Video Quality Assessment of Video Communication Systems (비디오 통신 시스템의 실시간 비디오 품질 측정 방법)

  • Kim, Byoung-Yong;Lee, Seon-Oh;Jung, Kwang-Su;Sim, Dong-Gyu;Lee, Soo-Youn
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.3
    • /
    • pp.75-88
    • /
    • 2009
  • This paper presents a video quality assessment method based on quality degradation factors of real-time multimedia streaming services. The video quality degradation is caused by video source compression and network states. In this paper, we propose a blocky metric on an image domain to measure quality degradation by video compression. In this paper, the proposed boundary strength index for the blocky metric is defined by ratio of the variation of two pixel values adjacent to $8{\times}8$ block boundary and the average variation at several pixels adjacent to the two boundary pixels. On the other hand, unnatural image movement caused by network performance deterioration such as jitter and delay factors can be observed. In this paper, a temporal-Jerkiness measurement method is proposed by computing statistics of luminance differences between consecutive frames and play-time intervals between frames. The proposed final Perceptual Video Quality Metric (PVQM) is proposed by consolidating both blocking strength and temporal-jerkiness. To evaluate performance of the proposed algorithm, the accuracy of the proposed algorithm is compared with Difference of Mean Opinion Score (DMOS) based on human visual system.

The Design of Repeated Motion on Adaptive Block Matching Algorithm in Real-Time Image (실시간 영상에서 반복적인 움직임에 적응한 블록정합 알고리즘 설계)

  • Kim Jang-Hyung;Kang Jin-Suk
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.3
    • /
    • pp.345-354
    • /
    • 2005
  • Since motion estimation and motion compensation methods remove the redundant data to employ the temporal redundancy in images, it plays an important role in digital video compression. Because of its high computational complexity, however, it is difficult to apply to high-resolution applications in real time environments. If we have a priori knowledge about the motion of an image block before the motion estimation, the location of a better starting point for the search of an exact motion vector can be determined to expedite the searching process. In this paper presents the motion detection algorithm that can run robustly about recusive motion. The motion detection compares and analyzes two frames each other, motion of whether happened judge. Through experiments, we show significant improvements in the reduction of the computational time in terms of the number of search steps without much quality degradation in the predicted image.

  • PDF

A Study on the New Binary Block Matching Algorithm for Motion Estimation of Real time Video Coding (실시간 비디오 압축의 움직임 추정을 위한 새로운 이진 블록 정합 알고리즘에 관한 연구)

  • 이완범;김환용
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.5 no.2
    • /
    • pp.126-131
    • /
    • 2004
  • Full search algorithm(FA) provides the best performance but this is usually impractical because of the large number of computations required for large search region. Fast search and conventional Boolean matching algorithms reduce computational complexity and data processing time but this algorithms have disadvantages that is difficult of implementation of hardware because of high control overhead and that is less performance than FA. This paper presents new Boolean matching algorithm, called BCBM(Bit Converted Boolean Matching). Proposed algorithm has performance closed to the FA by Boolean only block matching that may be very efficiently implemented in hardware for real time video communication. Simulation results show that the PSNR of the proposed algorithm is about 0.08㏈ loss than FA but is about 0.96∼2.02㏈ gain than fast search algorithm and conventional Boolean matching algorithm.

  • PDF

Pancreatic Compression during Lymph Node Dissection in Laparoscopic Gastrectomy: Possible Cause of Pancreatic Leakage

  • Ida, Satoshi;Hiki, Naoki;Ishizawa, Takeaki;Kuriki, Yugo;Kamiya, Mako;Urano, Yasuteru;Nakamura, Takuro;Tsuda, Yasuo;Kano, Yosuke;Kumagai, Koshi;Nunobe, Souya;Ohashi, Manabu;Sano, Takeshi
    • Journal of Gastric Cancer
    • /
    • v.18 no.2
    • /
    • pp.134-141
    • /
    • 2018
  • Purpose: Postoperative pancreatic fistula is a serious and fatal complication of gastrectomy for gastric cancer. Blunt trauma to the parenchyma of the pancreas can result from an assistant's forceps compressing and retracting the pancreas, which in turn may result in pancreatic juice leakage. However, no published studies have focused on blunt trauma to the pancreas during laparoscopic surgery. Our aim was to investigate the relationship between compression of the pancreas and pancreatic juice leakage in a swine model. Materials and Methods: Three female pigs were used in this study. The pancreas was gently compressed dorsally for 15 minutes laparoscopically with gauze grasped with forceps. Pancreatic juice leakage was visualized by fluorescence imaging after topical administration of chymotrypsin-activatable fluorophore in real time. Amylase concentrations in ascites collected at specified times was measured. In addition, pancreatic tissue was fixed with formalin, and the histology of the compressed sites was evaluated. Results: Fluorescence imaging enabled visualization of pancreatic juice leaking into ascites around the pancreas. Median concentrations of pancreatic amylase in ascites increased from 46 U/L preoperatively to 12,509 U/L 4 hours after compression. Histological examination of tissues obtained 4 hours after compression revealed necrotic pancreatic acinar cells extending from the surface to deep within the pancreas and infiltration of inflammatory cells. Conclusions: Pancreatic compression by the assistant's forceps can contribute to pancreatic juice leakage. These findings will help to improve the procedure for lymph node dissection around the pancreas during laparoscopic gastrectomy.

Developing Mobile GIS Spatial Data Compression Method for Forest Fire Extinguishment Information Management (산불진화정보 관리를 위한 Mobile GIS 공간 데이터 압축기법 개발)

  • Jo, Myung-Hee;Lee, Myung-Bo;Lee, Si-Young;Kim, Joon-Bum;Kwon, Bong-Kyum;Heo, Young-Jin
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.7 no.2
    • /
    • pp.78-86
    • /
    • 2004
  • Recently GPS and mobile GIS technologies based on LBS(location based service) have played an important role as DSS(decision supporting system) for domestic forest fire extinguishment policies. In this study forest fire extinguishments information management system based on mobile GIS technique was designed to seize the exact location on wireless network so that it helps to guide the safe and efficient extinguishments affairs and provide the extinguishments environment toward ground fighting teams and the central forest government in real time. Moreover, possibly to operate this system, the foundation technologies by the name of '.gci' such as the spatial data compression method, the spatial data transmission method over wireless network and the spatial analysis interface on PDA should be mainly considered. Especially, in this study the spatial data compression method having high compression rate from 51% to 62% for each polygon, line, and point data, without the loss of data was developed.

  • PDF