2000
DOI: 10.1016/s0923-5965(99)00046-6
|View full text |Cite
|
Sign up to set email alerts
|

A new vertex-based binary shape coder for high coding efficiency

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
12
0

Year Published

2000
2000
2011
2011

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 11 publications
(12 citation statements)
references
References 17 publications
0
12
0
Order By: Relevance
“…The procedure is iterative until the vertices are not changing, or the maximum iterations are reached. In [10], the vertex is adjusted by the local error distortion, which is the average error distance between the contour and the corresponding approximated straight segments. Compared to this technique, the new technique is more computational efficient.…”
Section: Vertex Selectionmentioning
confidence: 99%
See 3 more Smart Citations
“…The procedure is iterative until the vertices are not changing, or the maximum iterations are reached. In [10], the vertex is adjusted by the local error distortion, which is the average error distance between the contour and the corresponding approximated straight segments. Compared to this technique, the new technique is more computational efficient.…”
Section: Vertex Selectionmentioning
confidence: 99%
“…This is because when we adjust the vertex in the admissible region, the calculating of D ave is only on the new location, but the method in [10] need to recalculate the entire contour between the segments.…”
Section: Vertex Selectionmentioning
confidence: 99%
See 2 more Smart Citations
“…Vertex-based encoding schemes (O'Connell 1997, Chung et al 2000, Kuo et al 2007) are proposed to eliminate the staircase effects which (Chung et al 2000) result from context-based encoding. Vertices at crucial positions are selected and connected with straight lines to make a polygonal approximation of an object.…”
Section: Introductionmentioning
confidence: 99%