• Title/Summary/Keyword: Mpeg-4

Search Result 1,150, Processing Time 0.023 seconds

Analysis of Camera Rotation Using Three Symmetric Motion Vectors in Video Sequence (동영상에서의 세 대칭적 움직임벡터를 이용한 카메라 회전각 분석)

  • 문성헌;박영민;윤영우
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.3 no.2
    • /
    • pp.7-14
    • /
    • 2002
  • This paper proposes a camera motion estimation technique using special relations of motion vectors of geometrically symmetrical triple points of two consecutive views of single camera. The proposed technique uses camera-induced motion vectors and their relations other than feature points and epioplar constraints. As contrast to the time consuming iterations or numerical methods in the calculation of E-matrix or F-matrix induced by epipolar constraints, the proposed technique calculates camera motion parameters such as panning, tilting, rolling, and zooming at once by applying the proposed linear equation sets to the motion vectors. And by devised background discriminants, it effectively reflects only the background region into the calculation of motion parameters, thus making the calculation more accurate and fast enough to accommodate MPEG-4 requirements. Experimental results on various types of sequences show the validity and the broad applicability of the proposed technique.

  • PDF

Automatic RTP Time-stamping Method for SVC Video Transmission (SVC 비디오 전송을 위한 RTP 타임스탬프 자동 생성 방법)

  • Seo, Kwang-Deok;Jung, Soon-Heung;Kim, Jae-Gon;Yoo, Jeong-Ju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.6C
    • /
    • pp.471-479
    • /
    • 2008
  • In this paper, we propose a novel algorithm to automatically generate an RTP timestamp value that is required for the RTP packetization in order to transmit SVC video over various If networks such as Internet. Unlike the conventional single layer coding algorithms such as H.263, MPEG-4 and H.264, SVC generates a multi-layered single bitstream which is composed of a base layer and one or more enhancement layers in order to simultaneously provide temporal, spatial, and SNR scalability. Especially, in order to provide temporal scalability based on hierarchical B-picture prediction structure, the encoding (or transmission) and display order of pictures in SVC coding is completely decoupled. Thus, the timestamp value to be specified at the header of each RTP packet in video transmission does not increase monotonically according to the display time instant of each picture. Until now, no method for automatically generating an RTP timestamp when SVC video is loaded in a RTP packet has teen introduced. In this paper, a novel automatic RTP timestamp generation method exploiting the TID (temporal ID) field of the SVC NAL unit header is proposed to accommodate the SVC video transmission.

An Image Segmentation Algorithm using the Shape Space Model (모양공간 모델을 이용한 영상분할 알고리즘)

  • 김대희;안충현;호요성
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.2
    • /
    • pp.41-50
    • /
    • 2004
  • Since the MPEG-4 visual standard enables content-based functionalities, it is necessary to extract video objects from video sequences. Segmentation algorithms can largely be classified into two different categories: automatic segmentation and user-assisted segmentation. In this paper, we propose a new user-assisted image segmentation method based on the active contour. If we define a shape space as a set of all possible variations from the initial curve and we assume that the shape space is linear, it can be decomposed into the column space and the left null space of the shape matrix. In the proposed method, the shape space vector in the column space describes changes from the initial curve to the imaginary feature curve, and a dynamic graph search algorithm describes the detailed shape of the object in the left null space. Since we employ the shape matrix and the SUSAN operator to outline object boundaries, the proposed algorithm can ignore unwanted feature points generated by low-level image processing operations and is, therefore, applicable to images of complex background. We can also compensate for limitations of the shape matrix with a dynamic graph search algorithm.

Automatic Generation of the Personal 3D Face Model (3차원 개인 얼굴 모델 자동 생성)

  • Ham, Sang-Jin;Kim, Hyoung-Gon
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.1
    • /
    • pp.104-114
    • /
    • 1999
  • This paper proposes an efficient method for the automatic generation of personalized 3D face model from color image sequence. To detect a robust facial region in a complex background, moving color detection technique based on he facial color distribution has been suggested. Color distribution and edge position information in the detected face region are used to extract the exact 31 facial feature points of the facial description parameter(FDP) proposed by MPEG-4 SNHC(Synthetic-Natural Hybrid Coding) adhoc group. Extracted feature points are then applied to the corresponding vertex points of the 3D generic face model composed of 1038 triangular mesh points. The personalized 3D face model can be generated automatically in less then 2 seconds on Pentium PC.

  • PDF

Novel IME Instructions and their Hardware Architecture for Fast Search Algorithm (고속 탐색 알고리즘에 적합한 움직임 추정 전용 명령어 및 구조 설계)

  • Bang, Ho-Il;SunWoo, Myung-Hoon
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.48 no.12
    • /
    • pp.58-65
    • /
    • 2011
  • This paper presents an ASIP (Application-specific Instruction Processor) for motion estimation that employs specific IME instructions and its programmable and reconfigurable hardware architecture for various video codecs, such as H.264/AVC, MPEG4, etc. With the proposed specific instructions and variable point 2D SAD hardware accelerator, it can handle the real-time processing requirement of High Definition (HD) video. With the SAD unit and its parallel operations using pattern information, the proposed IME instructions support not only full search algorithms but also other fast search algorithms. The hardware size is 25.5K gates for each Processing Element Group (PEG) which has 128 SAD Processor Elements (PEs). The proposed ASIP has been verified by the Synopsys Processor Designer and implemented by the Design Compiler using the IBM 90nm process technology. The hardware size is 453K gates for the IME unit and the operating frequency is 188MHz for 1080p@30 frame in real time. The proposed ASIP can reduce the hardware size about 26% and the number of operation cycles about 18%.

Design of a Dynamically Reconfigurable Switch for Hybrid Network-on-Chip Systems (Hybrid Noc 시스템을 위한 재구성 가능한 스위치 설계)

  • Lee, Dong-Yeol;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.8B
    • /
    • pp.812-821
    • /
    • 2009
  • This paper proposes a novel dynamically reconfigurable switch for various multimedia applications in hybrid NoC systems. Current NoC systems, which adopt hybrid NoC structure with fixed switch and job distribution algorithms, require designers to precisely predict the property of applications to be processed. This paper proposes a reconfigurable switch which minimizes buffer overflow in various multimedia applications running on an NoC system. To verify the performance of the proposed system, we performed experiments on various multimedia applications running on embedded systems, such as MPEG4 and MP3 decoder, GPS positioning system, and OFDM demodulator. Experimental results show that buffer overflow has been decreased by 41.8% and 29.0%, respectively, when compared with NoC systems having sub-clusters with mesh or star topology. Power usage has been increased by 2.3% compared with hybrid NoC systems using fixed switches, and chip area has been increased from -0.6% to 5.7% depending on sub-cluster topology.

A Multiresolution Image Segmentation Method using Stabilized Inverse Diffusion Equation (안정화된 역 확산 방정식을 사용한 다중해상도 영상 분할 기법)

  • Lee Woong-Hee;Kim Tae-Hee;Jeong Dong-Seok
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.1
    • /
    • pp.38-46
    • /
    • 2004
  • Image segmentation is the task which partitions the image into meaningful regions and considered to be one of the most important steps in computer vision and image processing. Image segmentation is also widely used in object-based video compression such as MPEG-4 to extract out the object regions from the given frame. Watershed algorithm is frequently used to obtain the more accurate region boundaries. But, it is well known that the watershed algorithm is extremely sensitive to gradient noise and usually results in oversegmentation. To solve such a problem, we propose an image segmentation method which is robust to noise by using stabilized inverse diffusion equation (SIDE) and is more efficient in segmentation by employing multiresolution approach. In this paper, we apply both the region projection method using labels of adjacent regions and the region merging method based on region adjacency graph (RAG). Experimental results on noisy image show that the oversegmenation is reduced and segmentation efficiency is increased.

A Study on Video Object Segmentation using Nonlinear Multiscale Filtering (비선형 다중스케일 필터링을 사용한 비디오 객체 분할에 관한 연구)

  • 이웅희;김태희;이규동;정동석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.10C
    • /
    • pp.1023-1032
    • /
    • 2003
  • Object-based coding, such as MPEG-4, enables various content-based functionalities for multimedia applications. In order to support such functionalities, as well as to improve coding efficiency, each frame of video sequences should be segmented into video objects. In this paper. we propose an effective video object segmentation method using nonlinear multiscale filtering and spatio-temporal information. Proposed method performs a spatial segmentation using a nonlinear multiscale filtering based on the stabilized inverse diffusion equation(SIDE). And, the segmented regions are merged using region adjacency graph(RAG). In this paper, we use a statistical significance test and a time-variant memory as temporal segmentation methods. By combining of extracted spatial and temporal segmentations, we can segment the video objects effectively. Proposed method is more robust to noise than the existing watershed algorithm. Experimental result shows that the proposed method improves a boundary accuracy ratio by 43% on "Akiyo" and by 29% on "Claire" than A. Neri's Method does.

Automatic Moving Object Segmentation using Robust Edge Linking for Content-based Coding (내용 기반 코딩을 위한 강력한 에지 연결에 의한 움직임 객체 자동 분할)

  • 김준기;이호석
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.5_6
    • /
    • pp.305-320
    • /
    • 2004
  • Moving object segmentation is a fundamental function for content-based application. Moving object edges are produced by matching the detected moving edges with the current frame edges. But we can often experience the object edge disconnectedness due to coincidence of similarity between the object and background colors or the decrease of movement of moving object. The edge disconnectedness is a serious problem because it degrades the object visual quality so conspicuously That it sometimes makes it inadequate to perform content-based coding. We have solved this problem by developing a robust and comprehensive edge linking algorithm. And we also developed an automatic moving object segmentation algorithm. These algorithms can produce the completely linked moving object edge boundary and the accurate moving object segmentation. These algorithms can process CIF 30 frames/sec in a PC. These algorithms can be used for the MPEG-4 content-based coding.

Low-Energy Intra-Task Voltage Scheduling using Static Timing Analysis (정적 시간 분석을 이용한 저전력 태스크내 전압 스케줄링)

  • Sin, Dong-Gun;Kim, Ji-Hong;Lee, Seong-Su
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.28 no.11
    • /
    • pp.561-572
    • /
    • 2001
  • Since energy consumption of CMOS circuits has a quadratic dependency on the supply voltage, lowering the supply voltage is the most effective way of reducing energy consumption. We propose an intra-task voltage scheduling algorithm for low-energy hard real-time applications. Based on a static timing analysis technique, the proposed algorithm controls the supply voltage within an individual task boundary. By fully exploiting all the slack times, as scheduled program by the proposed algorithm always complete its execution near the deadline, thus achieving a high energy reduction ratio. In order to validate the effectiveness of the proposed algorithm, we built a software tool that automatically converts a DVS-unaware program into an equivalent low-energy program. Experimental results show that the low-energy version of an MPEG-4 encoder/decoder (converted by the software tool) consumes less than 7~25% of the original program running on a fixed-voltage system with a power-down mode.

  • PDF