Fringe Pattern Analysis 1989
DOI: 10.1117/12.962782
|View full text |Cite
|
Sign up to set email alerts
|

Fringe Location By Means Of A Zero Crossing Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1993
1993
2014
2014

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…The output intensities from the two sets of interference fringes were sub-divided into 8 levels by using the "bucket-bin" method [22]. Their respective peaks and valleys were also taken into account to confirm the quadrature condition.…”
Section: Modified Zero-crossing Fringe Counting Techniquementioning
confidence: 99%
“…The output intensities from the two sets of interference fringes were sub-divided into 8 levels by using the "bucket-bin" method [22]. Their respective peaks and valleys were also taken into account to confirm the quadrature condition.…”
Section: Modified Zero-crossing Fringe Counting Techniquementioning
confidence: 99%
“…The skeletons form by lines with one pixel wide which are the local maximum of the fringe pattern. The skeletons can be identified by different methods including the adaptive digital filter [113], the least-squares fitting [114], the nonlinear regression [115], the fast Fourier transform [116], the zero crossing algorithm [117] or the Yatagai matrix [118].…”
Section: 2laser Interferometrymentioning
confidence: 99%