• Title/Summary/Keyword: Shape coding

Search Result 114, Processing Time 0.02 seconds

Distribution of Target Bits based on Size, Motion and Distortion (크기, 움직임 및 왜곡 정보에 의한 목표비트 분배)

  • 지석상;황재정;이문호
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.4 no.5
    • /
    • pp.1085-1093
    • /
    • 2000
  • An efficient bit rate distribution technique that distributes available bits for multiple objects based on motion vector magnitude, size of object shape, and coding distortion is presented. This coding concept using the three parameters was exploited in MPEG-4 multiple object coding. But the scheme is likely to produce poor results such as allocating more bits to less important objects and degrading picture quality, due to the lack of analysis and research in view of human visual aspect. In this paper importance of each object is represented by the three parameters and visually analyzed. Target bits are distributed according to coding distortion using the pre-assigned shape and motion information.

  • PDF

Efficient Vertex-based Shape Coding using One-dimensional Vertex and Vertex Reordering (1차원 정점과 정점 재배열 이용한 효율적 정점기반 모양정보 부호화)

  • 정재원;문주희;김재균
    • Journal of Broadcast Engineering
    • /
    • v.2 no.2
    • /
    • pp.94-104
    • /
    • 1997
  • This paper presents a new vertex-based binary shape coding scheme using one-dimensional vertex selection/encoding and vertex reordering. In compared with the conventional object-adaptive vertex encoding(OA VEL the extracted vertices are, firstly, classified into one-dimensional(lD) vertices and two-dimensional (2D) vertices in the proposed method. For lD vertices, new coding method proposed in this paper is performed. For 2D vertices, the vertex reordering and OA VE are carried out. Experimental results show that the proposed vertex-based coding scheme red.uces coding bits up to 12 % compared with the conventional one and its coding gain depends on the characteristics of contour.

  • PDF

A Vertex Based Coding Technique Adaptive to Object's Shape (객체 적응적인 정점 기반 윤곽선 부호화 기법)

  • 조성중;홍민철;한헌수
    • Proceedings of the IEEK Conference
    • /
    • 2000.11d
    • /
    • pp.97-100
    • /
    • 2000
  • This paper presents a new approach to the vertex based shape coding technique. The conventional approaches encode objects using a spline method with the same distortion coefficients. The proposed approach, however, classifies the objects based on the object's features, and then applies different distortion values depending on the classified object types. Using this pre-classifying technique, this paper reduces the bit rate and the computational complexity necessary for the encoding process. The performance of the proposed method has been proved by experiments on the various sample Images.

  • PDF

The Shape Optimization of Cable Dome Using Real Coding Genetic Algorithm (실수코팅 유전알고리즘을 이용한 케이블 돔의 형상 최적 설계)

  • 한상을;조남철;김종범
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2003.04a
    • /
    • pp.177-184
    • /
    • 2003
  • The purposes of this study are to develop the real coding genetic algorithm and to obtain the shape optimization of a cable domes by using this scheme. Generally, the structural performance of the cable dome is influenced very sensitively by prestress, geometry and length of the mast because of flexible structures. So, it is very important to decide the optimum shape to get maximum stiffness of cable domes. We use the two models to verify the usefulness of this algorithm for shape optimization and analyze the roof system of Seoul olympic gymnastic arena as one analytical model of practical structures

  • PDF

Content Based Image Retrieval Using Combined Features of Shape, Color and Relevance Feedback

  • Mussarat, Yasmin;Muhammad, Sharif;Sajjad, Mohsin;Isma, Irum
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.12
    • /
    • pp.3149-3165
    • /
    • 2013
  • Content based image retrieval is increasingly gaining popularity among image repository systems as images are a big source of digital communication and information sharing. Identification of image content is done through feature extraction which is the key operation for a successful content based image retrieval system. In this paper content based image retrieval system has been developed by adopting a strategy of combining multiple features of shape, color and relevance feedback. Shape is served as a primary operation to identify images whereas color and relevance feedback have been used as supporting features to make the system more efficient and accurate. Shape features are estimated through second derivative, least square polynomial and shapes coding methods. Color is estimated through max-min mean of neighborhood intensities. A new technique has been introduced for relevance feedback without bothering the user.

Method for Applying Wavefront Parallel Processing on Cubemap Video (큐브맵 영상에 Wavefront 병렬 처리를 적용하는 방법)

  • Hong, Seok Jong;Park, Gwang Hoon
    • Journal of Broadcast Engineering
    • /
    • v.22 no.3
    • /
    • pp.401-404
    • /
    • 2017
  • The 360 VR video has a format of a stereoscopic shape such as an isometric shape or a cubic shape or a cubic shape. Although these formats have different characteristics, they have in common that the resolution is higher than that of a normal 2D video. Therefore, it takes much longer time to perform coding/decoding on 360 VR video than 2D Video, so parallel processing techniques are essential when it comes to coding 360 VR video. HEVC, the state of art 2D video codec, uses Wavefront Parallel Processing (WPP) technology as a standard for parallelization. This technique is optimized for 2D videos and does not show optimal performance when used in 3D videos. Therefore, a suitable method for WPP is required for 3D video. In this paper, we propose WPP coding/decoding method which improves WPP performance on cube map format 3D video. The experiment was applied to the HEVC reference software HM 12.0. The experimental results show that there is no significant loss of PSNR compared with the existing WPP, and the coding complexity of 15% to 20% is further reduced. The proposed method is expected to be included in the future 3D VR video codecs.

Optimal Facial Emotion Feature Analysis Method based on ASM-LK Optical Flow (ASM-LK Optical Flow 기반 최적 얼굴정서 특징분석 기법)

  • Ko, Kwang-Eun;Park, Seung-Min;Park, Jun-Heong;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.4
    • /
    • pp.512-517
    • /
    • 2011
  • In this paper, we propose an Active Shape Model (ASM) and Lucas-Kanade (LK) optical flow-based feature extraction and analysis method for analyzing the emotional features from facial images. Considering the facial emotion feature regions are described by Facial Action Coding System, we construct the feature-related shape models based on the combination of landmarks and extract the LK optical flow vectors at each landmarks based on the centre pixels of motion vector window. The facial emotion features are modelled by the combination of the optical flow vectors and the emotional states of facial image can be estimated by the probabilistic estimation technique, such as Bayesian classifier. Also, we extract the optimal emotional features that are considered the high correlation between feature points and emotional states by using common spatial pattern (CSP) analysis in order to improvise the operational efficiency and accuracy of emotional feature extraction process.

Vertex-based shape coding based on the inter-segment distance (블록간 상대거리에 의한 정점기반 모양정보 부호화 기법)

  • 이진학;정재원;문주희;김재균
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.7A
    • /
    • pp.1017-1027
    • /
    • 2000
  • In this paper, we propose a new coding method based on the distance between vertex segments for vertex positions in the vertex-based shape coding. The pixel lines are divided into the segments of a fixed length, and the segments that have vertex pixels are called vertex segments. We analyze the probability distribution of the relative distance between vertex segments and prove that it depends only on the ratio between the number of vertices and the number of segments. Considering the coding efficiency and implementation complexity, we choose a particular ratio to make a code table. For each input image, the segment size is chosen according tothe ratio, and the relative segment distances are entropy coded. It is shown that the proposed method is efficient for the images with many vertices.

  • PDF

Distribution Approximation of the Two Dimensional Discrete Cosine Transform Coefficients of Image (영상신호 2차원 코사인 변환계수의 분포근사화)

  • 심영석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.10 no.3
    • /
    • pp.130-134
    • /
    • 1985
  • In two-dimensional discrete cosine transform(DCT) coding, the measurements of the distributions of the transform coefficients are important because a better approximation yields a smaller mean square distorition. This paper presents the results of distribution tests which indicate that the statistics of the AC coefficients are well approximated to a generalized Gaussian distribution whose shape parameter is 0.6. Furthermore, from a simulation of the DCT coding, it was shown that the above approximation yields a higher experimental SNR and a better agreement between theory and simulation than the Gaussian or Laplacian assumptions.

  • PDF

Segmentation-based tnage Coding Method without Need for Transmission of Contour Information (윤곽선 정보의 전송이 불필요한 분할기반 영상 부호화 방법)

  • Choi Jae Gark;Kang Hyun-Soo;Koh Chang-Rim;Kwon Oh-Jun;Lee Jong-Keuk
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.5
    • /
    • pp.187-195
    • /
    • 2005
  • A new segmentation-based image coding method which no needs transmission of contour data is proposed. The shape information acts as bottleneck in the segmentation-based video coding because it has much portion of transmission data. The proposed method segments a previous decoded frame, instead of a current frame. As a result, there is no need for transmission of contour information to a decoder. Therefore, the saved bits can be assigned to encode other information such as error signals. As shown in experiment results, if data rate is very highly increased due to abrupt motion under very low bit rate coding having limited transmission bits, PSNR of conventional block-based method go down about 20dB, while the proposed method shows a good reconstruction quality without rapid PSNR drop.