2008
DOI: 10.1016/j.cag.2007.10.002
|View full text |Cite
|
Sign up to set email alerts
|

An efficient technique for capturing 2D objects

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 35 publications
0
5
0
Order By: Relevance
“…13d, the approximation is shown with algorithm. 37 It consists of 81 control points. Both the maximum error and average error are higher with values of 2.21 and 1.38, respectively.…”
Section: Results Analysis and Comparative Studymentioning
confidence: 99%
See 1 more Smart Citation
“…13d, the approximation is shown with algorithm. 37 It consists of 81 control points. Both the maximum error and average error are higher with values of 2.21 and 1.38, respectively.…”
Section: Results Analysis and Comparative Studymentioning
confidence: 99%
“…A variety of corner detection algorithms are available in the literature. 16,24,36,37 An algorithm by Sarfraz et al 35 is selected for its accuracy and efficiency. Summary of algorithm 35 is given below.…”
Section: Boundary Segmentationmentioning
confidence: 99%
“…Paper [10] describes solving the optimal approximation task via exhaustive search. Masood et al [11] and Kolesnikov [12] suggest more practical near-optimal algorithms with some heuristics including detection of corners and inflection points.…”
Section: Related Workmentioning
confidence: 99%
“…5 illustrates some principles which are used in contour tracing. At first, we do polygonal approximation of initial contour polygon instead of fitting by splines directly taking into account the following considerations: -near optimal approximation by curves for a lot of vertices has high computational complexity [11,13]; less number of vertices is preferable; -noise and outliers on boundary caused by scanning process leads to nonsmooth outline; so, some filtration vertices of initial polygon is required; -polygon is a graphical path that consists of line segments only; on next stage we convert to curves only part of the segments. We solve min-# problem, that is we approximate N-vertex polygon P by another one Q: {q , .…”
Section: Contour Tracingmentioning
confidence: 99%
“…There are a lot of studies in reconstruction of 2D images especially font and character images. Non-Roman character digitization such as Chinese [6,7] and Arabic [8,9] are the common application of 2D images curve fitting that are most researcher prefer to do on their research. According to [10], this type of character known as cursive, complex and needs more attentions.…”
Section: Introductionmentioning
confidence: 99%