1993
DOI: 10.1016/0167-8655(93)90111-p
|View full text |Cite
|
Sign up to set email alerts
|

Acquiring information from cues

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

1993
1993
2019
2019

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…Previous work can be classified into two categories, namely, minimizing the algebraic distance and minimizing the geometric distance, according to their error distance definitions. (11)(12)(13)(14)(15)(16)(17)(18)(19) The problems with geometric fitting (i.e., ineffective initialization, nonuniform point sampling, and heavy noise) are likely to result in an ineffective local minimum solution. Furthermore, it is challenging to deduce the geometric error in high-dimensional spaces.…”
Section: Introductionmentioning
confidence: 99%
“…Previous work can be classified into two categories, namely, minimizing the algebraic distance and minimizing the geometric distance, according to their error distance definitions. (11)(12)(13)(14)(15)(16)(17)(18)(19) The problems with geometric fitting (i.e., ineffective initialization, nonuniform point sampling, and heavy noise) are likely to result in an ineffective local minimum solution. Furthermore, it is challenging to deduce the geometric error in high-dimensional spaces.…”
Section: Introductionmentioning
confidence: 99%
“…Many image features between a sharp change to rounded or blunted corners are commonly underutilized in computer vision [17] since…”
Section: Introductionmentioning
confidence: 99%