A binary shape coding method using modified MMR

Yamaguchi, Nobuhiko; Ida, Takashi; Watanabe, Toshiaki

doi:10.1109/icip.1997.647960

Cited by 36 publications

(31 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As stated, for a meaningful performance comparison the case of "shape coding" must deserve a special attention. In this case experimental results show that the proposed technique is at the same level of the best techniques reported in scientific literature [2][3][4][5] (none of which is progressive). For generic contour map coding the only comparison reference we found was lossless coding solutions.…”

Section: Introductionsupporting

confidence: 57%

“…For shape coding performance evaluation, results are compared to those obtained by state-of-art techniques: the line-based methods "baseline-based" [2] and "vertexbased" [3] and the bitmap-based methods MMR (Modified Modified Read) [4] and CAE (Context-Based Arithmetic Encoding) [5]. In particular CAE was adopted by the MPEG-4 standard.…”

Section: Shape Coding Resultsmentioning

confidence: 99%

“…Moreover its coding performances are not competitive with respect to the state-of-art of shape coding. Currently, the best performing techniques work in the data domain and can be subdivided into two families: line-based methods [2,3] and bitmap-based methods [4,5]. The wavelet transform has not yet been used for coding any kind of contour map.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Progressive Contour Coding in the Wavelet Domain

Adami

Gallina

Leonardi

et al. 2006

Visual Content Processing and Representation

View full text Add to dashboard Cite

This paper presents a new wavelet-based image contour coding technique, suitable for representing either shapes or generic contour maps. Starting from a contour map (e.g. a segmentation map or the result of a contour extraction operator), this is first converted in a onedimensional signal. Coordinate jumps among different contour extremities are converted, if under a suitable threshold, into signal discontinuities which can be compactly represented in the wavelet domain. Otherwise, the exceeding discontinuities are coded as side information. This side information is minimized by an optimized contour segment sequencing. The obtained 1D signal is decomposed and coded in the wavelet domain by using a 1D version of an improved implementation of the SPIHT algorithm. This technique can efficiently code every kind of 2D contour map, from one to many unconnected contour segments. It guarantees a fully embedded progressive coding, state-of-art coding performance, good approximation capabilities for both open and closed contours, and visually graceful degradation at low bitrates.

show abstract

Section: Introductionsupporting

confidence: 57%

Section: Shape Coding Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Progressive Contour Coding in the Wavelet Domain

Adami

Gallina

Leonardi

et al. 2006

Visual Content Processing and Representation

View full text Add to dashboard Cite

show abstract

“…Bitmap-based techniques directly encode the shape pixels as belonging to the object or to the background. Two main methods have been presented in this area: the modi"ed modi"ed Reed [19] and context-based arithmetic encoding [2]. Contour-based techniques represent the shape by its boundary.…”

Section: Introductionmentioning

confidence: 99%

A contour-based approach to binary shape coding using a multiple grid chain code

Nunes

Marqués

Pereira

et al. 2000

Signal Processing: Image Communication

View full text Add to dashboard Cite

This paper presents a contour-based approach to e$ciently code binary shape information in the context of object-based video coding. This approach meets some of the most important requirements identi"ed for the MPEG-4 standard, notably e$cient coding and low delay. The proposed methods support both object-based lossless and quasi-lossless coding modes. For the cases where low delay is a primary requirement, a macroblock-based coding mode is proposed which can take advantage of inter-frame coding to improve the coding e$ciency. The approach presented here relies on a grid di!erent from that used for the pixels to represent the shape } the hexagonal grid } which simpli"es the task of contour coding. Using this grid, an appraoch based on a di!erential chain code (DCC) is proposed for the lossless mode while, for the quasi-lossless case, an approach based on the multiple grid chain code (MGCC) principle is proposed. The MGCC combines both contour simpli"cation and contour prediction to reduce the number of bits needed to code the shapes. Results for alpha plane coding of MPEG-4 video test sequences are presented in order to illustrate the performance of the several modes of operation, and a comparison is made with the shape-coding tool chosen by MPEG-4.

show abstract

“…The resulting binary mask then can be treated as an independent "texture" and encoded as usual. Exploiting the bi-values of the mask, special encoding methods are dedicated to pixel-based presentation of shape information, such as context-based arithmetic encoder (CAE) in [5], modified modified-read (MMR) in [6]. Contour-based: only those pixels, which lie on the boundary of VOs become targets of shape encoder.…”

Section: Introductionmentioning

confidence: 99%

Deployment of Constrained Delaunay Mesh in Vop Shape Coding

Tran

Konyha

Enyedi

et al. 2002

Recent Trends in Multimedia Information Processing

View full text Add to dashboard Cite

The work presents an alternative method for encoding shape-information of video objects, which is a new requirement in the recent revolution of video codec scheme: compressing and transmitting object-based video streams. The proposed method takes the advantage of the latest development in the video encoding -motion compensation on the base of mesh presentation of frame -to complete its target. The so-called constrained Delaunay mesh is deployed to represent video objects, which are detected from a previous video object detector (in a consistent case of scene, detector can simply function like a segmenting phase of video frame). This special mesh structure in one hand constructs the base for successive motion compensation taking root on mesh-vertices. In another hand, the virtue of constrained property opens a possibility to encode the shape of video object implicitly, therefore it reduces the amount of transmitted information. With constrained Delaunay mesh, shape information of objects is presented with polygon, therefore lossy. The problem can be alleviated by increasing the number of boundary vertices at the cost of bandwidth. The work also puts a stress on controlling this trade-off. Results of integrating the proposed method into a full VOP codec scheme are encouraging.

show abstract

A binary shape coding method using modified MMR

Cited by 36 publications

References 1 publication

Progressive Contour Coding in the Wavelet Domain

Progressive Contour Coding in the Wavelet Domain

A contour-based approach to binary shape coding using a multiple grid chain code

Deployment of Constrained Delaunay Mesh in Vop Shape Coding

Contact Info

Product

Resources

About