• Title/Summary/Keyword: block boundary detection

Search Result 28, Processing Time 0.023 seconds

Shot Boundary Detection Using Relative Difference between Two Frames (프레임간의 상대적인 차이를 이용한 비디오의 셔트 검출 기법)

  • 정인식;권오진
    • Proceedings of the IEEK Conference
    • /
    • 2001.06d
    • /
    • pp.101-104
    • /
    • 2001
  • This paper proposes a unique shot boundary detection algorithm for the video indexing and/or browsing. Conventional methods based on the frame differences and the histogram differences are improved. Instead of using absolute frame differences, block by block based relative frame differences are employed. Frame adaptive thresholding values are also employed for the better detection. for the cases that the frame differences are not enough to detect the shot boundary, histogram differences are selectively applied. Experimental results show that the proposed algorithm reduces both the “false positive” errors and the “false negative” errors especially for the videos of dynamic local and/or global motions

  • PDF

Adaptive Error Detection Using Causal Block Boundary Matching in Block-Coded Video (블록기반 부호화 비디오에서 인과적 블록 경계정합을 이용한 적응적 오류 검출)

  • 주용수;김태식;김남철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.8C
    • /
    • pp.1125-1132
    • /
    • 2004
  • In this Paper, we Propose an effective boundary matching based error detection algorithm using causal neighbor blocks to improve video quality degraded from channel error in block-coded video. The proposed algorithm first calculates boundary mismatch powers between a current block and each of its causal neighbor blocks. It then decides that a current block should be normal if all the mismatch powers are less than an adaptive threshold, which is adaptively determined using the statistics of the two adjacent blocks. In some experiments under the environment of 16bi1s burst error at bit error rates (BERs) of 10$^{-3}$ -10$^{-4}$ , it is shown that the proposed algorithm yields the improvements of maximum 20% in error detection rate and of maximum 3.5㏈ in PSNR of concealed kames, compared with Zeng's error detection algorithm.

Block Boundary Detection Technique for Adaptive Blocking Artifacts Reduction (적응적 블록화 현상 제거를 위한 블록 경계 검출 기법)

  • Kim, Sung-Deuk;Lim, Kyoung-Won
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.2
    • /
    • pp.11-19
    • /
    • 2010
  • Most of deblocking filters assumes that the block boundaries are accurately known and the coding information like quantization parameters are available. In some applications such as commercial television, however, many external video inputs without known block boundary and coding information arc given. If a decompressed video sequence heavily degraded with blocking artifacts is given through the external video port, it is absolutely necessary to detect block boundaries and control the strength of deblocking filtering by analysing the given images. This paper presents an efficient method to find the block boundaries and estimate the strength of the blocking artifacts without the knowledge of coding information. In addition, the confidence of the estimated blocking artifact information is also evaluated to control the adaptive deblocking filter robustly. Experiment results show that the estimated block boundary locations and strength relative strength and confidence information are practically good enough to reduce the blocking artifacts without prior knowledge.

REAL-TIME DETECTION OF MOVING OBJECTS IN A ROTATING AND ZOOMING CAMERA

  • Li, Ying-Bo;Cho, Won-Ho;Hong, Ki-Sang
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.71-75
    • /
    • 2009
  • In this paper, we present a real-time method to detect moving objects in a rotating and zooming camera. It is useful for camera surveillance of fixed but rotating camera, camera on moving car, and so on. We first compensate the global motion, and then exploit the displaced frame difference (DFD) to find the block-wise boundary. For robust detection, we propose a kind of image to combine the detections from consecutive frames. We use the block-wise detection to achieve the real-time speed, except the pixel-wise DFD. In addition, a fast block-matching algorithm is proposed to obtain local motions and then global affine motion. In the experimental results, we demonstrate that our proposed algorithm can handle the real-time detection of common object, small object, multiple objects, the objects in low-contrast environment, and the object in zooming camera.

  • PDF

Video Watermarking Using Shot Detection (프레임간 상대적인 차에 의한 셔트 검출 기법을 이용한 비디오 워터마킹)

  • 정인식;권오진
    • Proceedings of the IEEK Conference
    • /
    • 2002.06d
    • /
    • pp.101-104
    • /
    • 2002
  • This paper proposes a unique data embedding algorithm for the video sequence. It describes two processings: shot boundary detection and robust data embedding. First, for the shot boundary detection, instead of using absolute frame differences, block by block based relative frame differences are employed. Frame adaptive thresholding values are also employed for the better detection. Second, for the robust data embedding, we generate message template and then convolve and correlate it with carrier signal. And then we embed data on the time domain video sequence. By using these two methods, watermarks into randomly selected frames of shots. Watermarks are detected well even if several certain shots are damaged because we embed watermark into each shot equally.

  • PDF

In-network Distributed Event Boundary Computation in Wireless Sensor Networks: Challenges, State of the art and Future Directions

  • Jabeen, Farhana;Nawaz, Sarfraz
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2804-2823
    • /
    • 2013
  • Wireless sensor network (WSN) is a promising technology for monitoring physical phenomena at fine-grained spatial and temporal resolution. However, the typical approach of sending each sensed measurement out of the network for detailed spatial analysis of transient physical phenomena may not be an efficient or scalable solution. This paper focuses on in-network physical phenomena detection schemes, particularly the distributed computation of the boundary of physical phenomena (i.e. event), to support energy efficient spatial analysis in wireless sensor networks. In-network processing approach reduces the amount of network traffic and thus achieves network scalability and lifetime longevity. This study investigates the recent advances in distributed event detection based on in-network processing and includes a concise comparison of various existing schemes. These boundary detection schemes identify not only those sensor nodes that lie on the boundary of the physical phenomena but also the interior nodes. This constitutes an event geometry which is a basic building block of many spatial queries. In this paper, we introduce the challenges and opportunities for research in the field of in-network distributed event geometry boundary detection as well as illustrate the current status of research in this field. We also present new areas where the event geometry boundary detection can be of significant importance.

A Study on Motion Detection of Object Using Active Block Matching Algorithm (능동적 블록정합기법을 이용한 객체의 움직임 검출에 관한 연구)

  • Lee Chang-Soo;Park Mi-Og;Lee Kyung-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4C
    • /
    • pp.407-416
    • /
    • 2006
  • It is difficult for the movement detection of an object through a camera to detect exact movement because of unnecessary noises and changes of the light. It can be recognized as a background, when there is no movement after the inflow of an object. Therefore, It is necessary to fast search algorithm for tracking and extract of object that is realtime image. In this thesis, we evaluate the difference of the input vision based on initial image and replace some pixels in process of time. When there is a big difference between background image and input image, we decide it is the point of the time of the object input and then extract boundary point of it. The extracted boundary point detects precise movement of the object by creating minimum block of it and searching block that maintaining distance. The designed and embodied system shows more than 95% accuracy in the performance test.

Post-Processing for Reducing Corner Outliers (Corner outlier 제거를 위한 후처리 기법)

  • 홍윤표;전병우
    • Proceedings of the IEEK Conference
    • /
    • 2003.11a
    • /
    • pp.11-14
    • /
    • 2003
  • In block-based lossy video compression, severe quantization causes discontinuities along block boundaries so that annoying blocking artifacts are visible in decoded video imases. These blocking artifacts significantly decrease the subjective image quality. In order to reduce the blocking artifacts in decoded images, many algorithms have been proposed However studies on so called, corner outliers, have been very limited. Corner outliers make image edges look disconnected from those of neighboring blocks at cross block boundary. In order to solve this problem, we propose a corner outlier detection and compensation algorithm as post-processing in spatial domain The experiment results show that the proposed method provides much improved subjective image quality.

  • PDF

A New Error Concealment Based on Edge Detection (에지검출을 기반으로 한 새로운 에러 은닉 기법)

  • Yang, Yo-Jin;Son, Nam-Rye;Lee, Guee-Sang
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.6
    • /
    • pp.623-629
    • /
    • 2002
  • In transmitting compressed video bit-stream over Internet, packet losses cause error propagations in both spatial and temporal domains, which in turn leads to severe degradation I image quality. In this paper, a new error concealment algorithm, called EBMA(Edge Detection based Boundary Matching Algorithm), is proposed to repair damaged portions of the video frames in the receiver. Conventional BMA(Boundary Matching Algorithm) assumes that the pixels on the boundary of the missing block and its neighboring blocks are very similar, but has no consideration of edges across the boundary. In our approach, the edges are detected across the boundary of the lost or erroneous block. Once the orientation of each edge is found, only the pixel difference along the expected edges across the boundary is measured instead of the calculation of difference along the expected edges across the boundary is measured instead of the calculation of differences between all adjacent pixels on the boundary Therefore, the proposed approach needs very few computations and the experiment shows and improvement of the performance over the conventional BMA in terms of both subjective and objective quality of video sequences.

Feature Extraction for Scene Change Detection in an MPEG Video Sequence (장면 전환 검출을 위한 MPEG 비디오 시퀀스로부터 특징 요소 추출)

  • 최윤석;곽영경;고성제
    • Journal of Broadcast Engineering
    • /
    • v.3 no.2
    • /
    • pp.127-137
    • /
    • 1998
  • In this paper, we propose the method of extracting edge information from MPEG video sequences for the detection of scene changes. In a the proposed method, five significant AC coefficients of each MPEG block are utilized to obtain edge images from the MPEG video. AC edge images obtained by the proposed scheme not only produce better object boundary information than conventional methods using only DC coefficients, but also can reduce the boundary effects produced by DC-based. Since the AC edge image contains the content information of each frame, it can be effectively utilized for the detection of scene change as well as the content-based video query. Experimental results show that the proposed method can be effectively utilized for the detection of scene changes.

  • PDF