• Title/Summary/Keyword: Depth Video

Search Result 450, Processing Time 0.032 seconds

Fast Coding Unit Decision Algorithm Based on Region of Interest by Motion Vector in HEVC (움직임 벡터에 의한 관심영역 기반의 HEVC 고속 부호화 유닛 결정 방법)

  • Hwang, In Seo;Sunwoo, Myung Hoon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.11
    • /
    • pp.41-47
    • /
    • 2016
  • High efficiency video coding (HEVC) employs a coding tree unit (CTU) to improve the coding efficiency. A CTU consists of coding units (CU), prediction units (PU), and transform units (TU). All possible block partitions should be performed on each depth level to obtain the best combination of CUs, PUs, and TUs. To reduce the complexity of block partitioning process, this paper proposes the PU mode skip algorithm with region of interest (RoI) selection using motion vector. In addition, this paper presents the CU depth level skip algorithm using the co-located block information in the previously encoded frames. First, the RoI selection algorithm distinguishes between dynamic CTUs and static CTUs and then, asymmetric motion partitioning (AMP) blocks are skipped in the static CTUs. Second, the depth level skip algorithm predicts the most probable target depth level from average depth in one CTU. The experimental results show that the proposed fast CU decision algorithm can reduce the total encoding time up to 44.8% compared to the HEVC test model (HM) 14.0 reference software encoder. Moreover, the proposed algorithm shows only 2.5% Bjontegaard delta bit rate (BDBR) loss.

Boundary artifacts reduction for synthesized views in 3D video (3 차원 비디오의 합성영상 경계 잡음 제거)

  • Lee, DoHoon;Yang, Yoonmo;Oh, Byung Tae
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2016.06a
    • /
    • pp.302-305
    • /
    • 2016
  • This paper proposes a boundary artifacts reduction method for synthesized views in 3D video system using Projection onto Convex Sets (POCS). In 3D video system, boundary artifacts are occurred in synthesized views by distorted depth map. In this paper, we analyze boundary artifacts, and show the experimental results by the proposed algorithm on various situations.

  • PDF

3D View Synthesis with Feature-Based Warping

  • Hu, Ningning;Zhao, Yao;Bai, Huihui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5506-5521
    • /
    • 2017
  • Three-dimensional video (3DV), as the new generation of video format standard, can provide the viewers with a vivid screen sense and a realistic stereo impression. Meanwhile the view synthesis has become an important issue for 3DV application. Differently from the conventional methods based on depth, in this paper we propose a new view synthesis algorithm, which can employ the correlation among views and warp in the image domain only. There are mainly two contributions. One is the incorporation of sobel edge points into feature extraction and matching, which can obtain a better stable homography and then a visual comfortable synthesis view compared to SIFT points only. The other is a novel image blending method proposed to obtain a better synthesis image. Experimental results demonstrate that the proposed method can improve the synthesis quality both in subjectivity and objectivity.

Video Index Generation and Search using Trie Structure (Trie 구조를 이용한 비디오 인덱스 생성 및 검색)

  • 현기호;김정엽;박상현
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.7_8
    • /
    • pp.610-617
    • /
    • 2003
  • Similarity matching in video database is of growing importance in many new applications such as video clustering and digital video libraries. In order to provide efficient access to relevant data in large databases, there have been many research efforts in video indexing with diverse spatial and temporal features. however, most of the previous works relied on sequential matching methods or memory-based inverted file techniques, thus making them unsuitable for a large volume of video databases. In order to resolve this problem, this paper proposes an effective and scalable indexing technique using a trie, originally proposed for string matching, as an index structure. For building an index, we convert each frame into a symbol sequence using a window order heuristic and build a disk-resident trie from a set of symbol sequences. For query processing, we perform a depth-first search on the trie and execute a temporal segmentation. To verify the superiority of our approach, we perform several experiments with real and synthetic data sets. The results reveal that our approach consistently outperforms the sequential scan method, and the performance gain is maintained even with a large volume of video databases.

Analysis of Satisfaction of Elementary School Students and Teachers for Software Practice Education in Real-Time Video Classes (실시간 화상 수업 환경에서 소프트웨어 실습 교육에 대한 초등학생 및 교사의 만족도 분석)

  • Kang, Doobong;Park, Hansuk
    • Journal of The Korean Association of Information Education
    • /
    • v.25 no.5
    • /
    • pp.825-834
    • /
    • 2021
  • This study analyzed learners' satisfaction and in-depth interviews with teachers after operating a software practical curriculum as a real-time video class for fifth and sixth graders in elementary school. The correlation between learner's presence, class overall, interaction, and real-time video class satisfaction showed that the positive correlation between presence, class overall, interaction, and satisfaction with real-time video classes was somewhat high. There were some differences in the real-time video class participation environment and real-time video class satisfaction, but it was not found to be statistically significant. In the case of teachers, it was difficult to respond to problems occurring in each student's individual environment, interactions between students, and individual feedback problems for a sluggish student. To solve this problem, opinions such as preliminary guidance and verification of real-time video class connection environment, error support for sluggish students and individual class participation environment, and feedback on individual tasks using LMS were suggested.

The depth quality enhancement algorithm for Autostereoscopic 3D Monitor (무안경 3D 모니터를 위한 Depth 화질 향상 Algorithm)

  • Song, Sung-Ho;Lee, Kyoung-Il;Lee, Dong-Ha;Park, Jong-Cheol;Lee, Jea-Jun;Kim, Young-Kil
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.133-136
    • /
    • 2012
  • In this paper, we found the many effective ways and apply for improve the 3D quality of Autostereoscopic 3D display products. Autostereoscopic products compared to traditional 3D glasses, the disadvantage is the poor depth of 3D picture quality and it only can see the fixed distance and position. So, for the compensate this disadvantage, we use the Head tracking technology and video placement algorithms and several techniques. In this paper, the will report on how to improve the Parallax Barrier Autostereoscopic 3D quality through the Head tracking of the user identification, video replacement algorithms and crosstalk improving method.

  • PDF

Motion Estimation Method by Using Depth Camera (깊이 카메라를 이용한 움직임 추정 방법)

  • Kwon, Soon-Kak;Kim, Seong-Woo
    • Journal of Broadcast Engineering
    • /
    • v.17 no.4
    • /
    • pp.676-683
    • /
    • 2012
  • Motion estimation in video coding greatly affects implementation complexity. In this paper, a reducing method of the complexity in motion estimation is proposed by using both the depth and color cameras. We obtain object information with video sequence from distance information calculated by depth camera, then perform labeling for grouping pixels within similar distances as the same object. Three search regions (background, inside-object, boundary) are determined adaptively for each of motion estimation blocks within current and reference pictures. If a current block is the inside-object region, then motion is searched within the inside-object region of reference picture. Also if a current block is the background region, then motion is searched within the background region of reference picture. From simulation results, we can see that the proposed method compared to the full search method remains the almost same as the motion estimated difference signal and significantly reduces the searching complexity.

Depth Boundary Sharpening for Improved 3D View Synthesis (3차원 합성영상의 화질 개선을 위한 깊이 경계 선명화)

  • Song, Yunseok;Lee, Cheon;Ho, Yo-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.9
    • /
    • pp.786-791
    • /
    • 2012
  • This paper presents a depth boundary sharpening method for improved view synthesis in 3D video. In depth coding, distortion occurs around object boundaries, degrading the quality of synthesized images. In order to encounter this problem, the proposed method estimates an edge map for each frame to filter only the boundary regions. In particular, a window-based filter is employed to choose the most reliable pixel as the replacement considering three factors: frequency, similarity and closeness. The proposed method was implemented as post-processing of the deblocking filter in JMVC 8.3.Compared to the conventional methods, the proposed method generated 0.49 dB PSNR increase and 16.58% bitrate decrease on average. The improved portions were subjectively confirmed as well.

H.264 Encoding Technique of Multi-view Image expressed by Layered Depth Image (계층적 깊이 영상으로 표현된 다시점 영상에 대한 H.264 부호화 기술)

  • Kim, Min-Tae;Jee, Inn-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.1
    • /
    • pp.81-90
    • /
    • 2010
  • This paper presents H.264 coding schemes for multi-view video using the concept of layered depth image(LDI) representation and efficient compression technique for LDI. After converting those data to the proposed representation, we encode color, depth, and auxiliary data representing the hierarchical structure, respectively, Two kinds of preprocessing approaches are proposed for multiple color and depth components. In order to compress auxiliary data, we have employed a near lossless coding method. Finally, we have reconstructed the original viewpoints successfully from the decoded approach that is useful for dealing with multiple color and depth data simultaneously.

Intermediate View Synthesis Method using Kinect Depth Camera (Kinect 깊이 카메라를 이용한 가상시점 영상생성 기술)

  • Lee, Sang-Beom;Ho, Yo-Sung
    • Smart Media Journal
    • /
    • v.1 no.3
    • /
    • pp.29-35
    • /
    • 2012
  • A depth image-based rendering (DIBR) technique is one of the rendering processes of virtual views with a color image and the corresponding depth map. The most important issue of DIBR is that the virtual view has no information at newly exposed areas, so called dis-occlusion. In this paper, we propose an intermediate view generation algorithm using the Kinect depth camera that utilizes the infrared structured light. After we capture a color image and its corresponding depth map, we pre-process the depth map. The pre-processed depth map is warped to the virtual viewpoint and filtered by median filtering to reduce the truncation error. Then, the color image is back-projected to the virtual viewpoint using the warped depth map. In order to fill out the remaining holes caused by dis-occlusion, we perform a background-based image in-painting operation. Finally, we obtain the synthesized image without any dis-occlusion. From experimental results, we have shown that the proposed algorithm generated very natural images in real-time.

  • PDF