• 제목/요약/키워드: Shape coding

검색결과 113건 처리시간 0.022초

불규칙 모양 물제의 부호화를 위한 확장-보간/2D-DCT의 성능 분석 및 개성 방안 (Performance Analysis and improvement of Extension-interpolation (EI)/2D-DCT for Coding irregular Shaped object)

  • 조순제;강현수;윤병주;김성대;구본호
    • 한국통신학회논문지
    • /
    • 제25권3B호
    • /
    • pp.541-548
    • /
    • 2000
  • In the MPEG-4 standardization phase, many methods for coding the irregular shaped VOP (video object Plane) have been researched. Texture coding is one of interesting research items in the MPEG-4. There are the Low pass extrapolation (LPE) padding, the shape adaptive DCT (SA-DCT), and the Extension-Interpolation (EI)/2D-DCT proposed in [1] as texture coding methods. the EI/2D-DCT is the method extending and interpolating luminance values from and Arbitrarily Shaped (AS) image segment into an 8 x 8 block and transforming the extended and interpolated luminance values by the 8x8 DCT. although the EI/2D-DCT and the SA-DCT work well in coding the As image segments. they are degraded since they use one-dimensional (1-D) methods such as the 1D-EI and the 1D-DCT in the two-dimensional (2-D) space. in this paper, we analyze the performance of the EI/2D-DCTand propose a new non-symmetric sig-sag scanning method, which non-symmetrically scans the quantized coefficients in the DCT domain to improve the EI/2D-DCT.

  • PDF

Accessory auricle: Classification according to location, protrusion pattern and body shape

  • Hwang, Jungil;Cho, Jaeyoung;Burm, Jin Sik
    • Archives of Plastic Surgery
    • /
    • 제45권5호
    • /
    • pp.411-417
    • /
    • 2018
  • Background Accessory auricles (AAs) are common congenital anomalies. We present a new classification according to location and shape, and propose a system for coding the classifications. Methods This study was conducted by reviewing the records of 502 patients who underwent surgery for AA. AAs were classified into three anatomical types: intraauricular, preauricular, and buccal. Intraauricular AAs were divided into three subtypes: intracrural, intratragal, and intralobal. Preauricular AAs were divided into five subtypes: precrural, superior pretragal, middle pretragal, inferior pretragal, and prelobal. Buccal AAs were divided into two subtypes: anterior buccal and posterior buccal. AAs were also classified according to their protrusion pattern above the surrounding surface: pedunculated, sessile, areolar, remnant, and depressed. Pedunculated and sessile AAs were subclassified as spherical, ovoid, lobed, and nodular, according to their body shape. Cartilage root presence and family history of AA were reviewed. A coding system for these classifications was also proposed. Results The total number of AAs in the 502 patients was 1,003. Among the locations, the superior pretragal subtype (27.6%) was the most common. Among the protrusion patterns and shapes, pedunculated ovoid AAs were the most common in the preauricular (27.8%) and buccal areas (28.0%), and sessile lobed AAs were the most common in the intraauricular area (48.7%). The proportion of AAs with a cartilage root was 78.4%, and 11% of patients had a family history. The most common type of preauricular AA was the superior pretragal pedunculated ovoid AA (13.2%) with a cartilage root. Conclusions This new system will serve as a guideline for classifying and coding AAs.

형태론적 패턴인식 시스템의 개발 - 형상함수를 이용한 형태론적 형상분해 (Development of Morphological Pattern Recognition System - Morphological Shape Decomposition using Shape Function)

  • Jong Ho Choi
    • 전자공학회논문지B
    • /
    • 제32B권8호
    • /
    • pp.1127-1136
    • /
    • 1995
  • In this paper, a morphological shape decomposition method is proposed for the purpose of pattern recognition and image compression. In the method, a structuring element that geometrical characteristics is more similar to the shape function is preselected. The shape is decomposed into the primitive elements corresponding to the structuring element. A gray scale image also is transformed into 8 bit plane images for the hierarchical reconstruction required in image communication systems. The shape in each bitplane is decomposed to the proposed method. Through the experiment. it is proved that the description error is reduced and the coding efficiency is improved.

  • PDF

G.718 초광대역 코덱의 음질 향상을 위한 개선된 Generic Mode Coding 방법 (Modified Generic Mode Coding Scheme for Enhanced Sound Quality of G.718 SWB)

  • 조근석;정상배
    • 말소리와 음성과학
    • /
    • 제4권3호
    • /
    • pp.119-125
    • /
    • 2012
  • This paper describes a new algorithm for encoding spectral shape and envelope in the generic mode of G.718 super-wide band (SWB). In the G.718 SWB coder, generic mode coding and sinusoidal enhancement are used for the quantization of modified discrete cosine transform (MDCT)-based parameters in the high frequency band. In the generic mode, the high frequency band is divided into sub-bands and for every sub-band the most similar match with the selected similarity criteria is searched from the coded and envelope normalized wideband content. In order to improve the quantization scheme in high frequency region of speech/audio signals, the modified generic mode by the improvement of the generic mode in G.718 SWB is proposed. In the proposed generic mode, perceptual vector quantization of spectral envelopes and the resolution increase for spectral copy are used. The performance of the proposed algorithm is evaluated in terms of objective quality. Experimental results show that the proposed algorithm increases the quality of sounds significantly.

삼각형의 무게 중심을 이용한 새로운 다각 근사화 장점 부호화 기법 (A New Vertex Coding Scheme Using The Center of the Gravity of a Triangle)

  • 윤병주;강현수;조순제;김성대
    • 한국통신학회논문지
    • /
    • 제24권6B호
    • /
    • pp.1174-1182
    • /
    • 1999
  • 최근 MPEG-4 표준화 작업의 마무리와 MPEG-7 표준화 작업이 활발히 진행됨에 따라 영상내의 물체(object)의 모양 정보 부호화의 중요성이 대두되었다. 본 논문에서는 물체의 특징을 표현하기에 적합한 다각형 근사화 정점을 효율적으로 부호화하는 기법에 대해 연구하였다. 제안한 기법에서는 근사 다각형의 정점들을 이용하여 삼각형의 무게 중심들을 구한 후 순차적으로 부호화한다. 무게 중심들의 분포영역이 좁다는 사실을 이용하여 부호화 효율을 얻을 수 있다.

  • PDF

Efficient CT Image Segmentation Algorithm Using both Spatial and Temporal Information

  • Lee, Sang-Bock;Lee, Jun-Haeng;Lee, Samyol
    • 한국콘텐츠학회:학술대회논문집
    • /
    • 한국콘텐츠학회 2004년도 추계 종합학술대회 논문집
    • /
    • pp.505-510
    • /
    • 2004
  • This paper suggests a new CT-image segmentation algorithm. This algorithm uses morphological filters and the watershed algorithms. The proposed CT-image segmentation algorithm consists of six parts: preprocessing, image simplification, feature extraction, decision making, region merging, and postprocessing. By combining spatial and temporal information, we can get more accurate segmentation results. The simulation results illustrate not only the segmentation results of the conventional scheme but also the results of the proposed scheme; this comparison illustrates the efficacy of the proposed technique. Furthermore, we compare the various medical images of the structuring elements. Indeed, to illustrate the improvement of coding efficiency in postprocessing, we use differential chain coding for the shape coding of results.

  • PDF

블록 병합 기법을 이용한 객체 경계 부분 부호화 (Object Boundary Block Coding Using Block Merging Method)

  • 이희습;김정식;김정우;이근영
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1999년도 추계종합학술대회 논문집
    • /
    • pp.577-580
    • /
    • 1999
  • Padding is a technique that enables applying conventional discrete cosine transform to encode boundary blocks of arbitrarily shaped objects by assigning imaginary values to the pixels that are not included in the object. Padding prevents the increase of high frequency DCT coefficients. However, in some boundary blocks, too many padded pixels are coded due to a small portion of object pixels. To reduce the number of padded pixels and to improve coding efficiency, we propose a block merging method for texture coding. The proposed mothed searches the shape information of boundary blocks and excludes the 4$\times$4 pixels of 8$\times$8 blocks if all the 4$\times$4 pixels are in the background region, and merges the remained 4$\times$4 pixels into new 8$\times$8 blocks. Experimental results show that our proposed method yields a rate-distortion gain about 0.5~1.6㏈ compared to conventional padding method, LPE

  • PDF

비트평면 기반 무손실 깊이정보 맵 부호화 방법 (Bit-plane based Lossless Depth Map Coding Method)

  • 김경용;박광훈;서덕영
    • 방송공학회논문지
    • /
    • 제14권5호
    • /
    • pp.551-560
    • /
    • 2009
  • 본 논문에서는 MPEG 3차원 비디오 표준 깊이정보 맵에 대한 효율적인 무손실 압축 방법을 제안한다. 일반적으로 깊이정보 맵을 부호화할 때 자연영상에 적용되는 H.264 등의 동영상 부호화 방법을 그대로 사용하고 있는데, 이러한 부호화 방법은 깊이정보 맵의 영상특성을 고려하지 않은 방법이다. 본 논문에서는 깊이정보 맵의 무손실 압축 방법으로 MPEG-4 Part-2 Visual의 이진 형상 부호화를 이용한 비트평면 부호화 방법을 제안하였다. 실험결과로서 제안하는 방법이 28.91:1의 압축률을 실현하였고, 화면 내 예측만을 수행한 경우에 JPEG-LS보다 24.84%, JPEG-2000보다 39.35%, H.264 (CAVLC 적용)보다 30.30% 그리고 H.264 (CABAC 적용)보다 16.65% 정도의 비트량 절감을 실현하였고, 또한 화면 내 예측뿐만 아니라 화면 간 예측을 모두 수행한 경우에 H.264 (CAVLC 적용)보다 36.22% 그리고 H.264 (CABAC 적용)보다 23.71% 정도의 비트량 절감을 실현할 수 있었다.

문서의 효율적 영역 분할과 JBIG2 CODEC의 구현 (Implementation of JBIG2 CODEC with Effective Document Segmentation)

  • 백옥규;김현민;고형화
    • 한국통신학회논문지
    • /
    • 제27권6A호
    • /
    • pp.575-583
    • /
    • 2002
  • JBIG2는 2진 영상과 문서 압축을 위한 국제 표준이다. JBIG2 표준은 2진 영상과 문서를 고압축으로 부호화하기 위해 영역 특징에 따라 세 가지 부호화 모드를 제공한다. MMR이나 산술 부호화를 이용하여 비트맵(bitmap)의 부호화를 위한 제너릭 영역(Generic region) 부호화를 한다. 그리고, 텍스트 영역의 부호화를 위해 패턴 매칭(Pattern Matching) 부호화를 하고, 하프톤 영역(Halftone region) 부호화를 위해 하프톤 패턴 부호화(Halftone Pattern Coding)를 한다. 본 논문에서는 JBIG2 부호화를 위해 문서를 라인아트, 하프톤, 텍스트 영역으로 분할한 후 각 영역에 제너릭 영역 부호화, 심벌 매칭 부호화, 하프톤 패턴 부호화를 하는 JBIG2 CODEC을 구현하였다. 문서의 효율적 영역 분할을 위해 윤곽선 추출법을 이용한 영역분할 방법과 웨이브릿 계수분표를 이용한 영역 분할 방법을 함께 적용하여 facsimile 테스트 영상(IEEE-167a)의 경우 2% 정도의 압축률 개선과 주관적 화질의 향상을 얻었다. 또한 임의 모양 하프톤 영역의 부호화를 제안하여 기존 영역 분할 방법에서 인지할 수 없는 임의 모양 하프톤 영역 주변 텍스트의 주관적 화질을 개선하였다.

Depth Map Coding Using Histogram-Based Segmentation and Depth Range Updating

  • Lin, Chunyu;Zhao, Yao;Xiao, Jimin;Tillo, Tammam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권3호
    • /
    • pp.1121-1139
    • /
    • 2015
  • In texture-plus-depth format, depth map compression is an important task. Different from normal texture images, depth maps have less texture information, while contain many homogeneous regions separated by sharp edges. This feature will be employed to form an efficient depth map coding scheme in this paper. Firstly, the histogram of the depth map will be analyzed to find an appropriate threshold that segments the depth map into the foreground and background regions, allowing the edge between these two kinds of regions to be obtained. Secondly, the two regions will be encoded through rate distortion optimization with a shape adaptive wavelet transform, while the edges are lossless encoded with JBIG2. Finally, a depth-updating algorithm based on the threshold and the depth range is applied to enhance the quality of the decoded depth maps. Experimental results demonstrate the effective performance on both the depth map quality and the synthesized view quality.