2011
DOI: 10.1364/ao.50.001482
|View full text |Cite
|
Sign up to set email alerts
|

Object-image-based method to construct an unweighted quality map for phase extraction and phase unwrapping

Abstract: A method to construct an unweighted quality map for phase extraction and phase unwrapping is proposed, based on an object image pattern. The object image pattern must be recorded under the same conditions as that of the corresponding interference patterns, except that the lights coming from the reference arm of the interferometer are hidden. An unweighted quality map that can represent the valid and invalid regions in the interference patterns is completed successfully, based on two factors: the fact that the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(13 citation statements)
references
References 19 publications
0
13
0
Order By: Relevance
“…Each fringe of the sinusoidal patterns was identified by a binary sequence q n . Then we constructed a (10,5) shorten extended Hamming code with a minimum Hamming distance d H at 4, with which the q n were embedded into 2M frames of binary stripes. With a colorprojection technique, the sinusoidal fringe patterns and binary stripes were projected simultaneously using RGB.…”
Section: Discussionmentioning
confidence: 99%
See 4 more Smart Citations
“…Each fringe of the sinusoidal patterns was identified by a binary sequence q n . Then we constructed a (10,5) shorten extended Hamming code with a minimum Hamming distance d H at 4, with which the q n were embedded into 2M frames of binary stripes. With a colorprojection technique, the sinusoidal fringe patterns and binary stripes were projected simultaneously using RGB.…”
Section: Discussionmentioning
confidence: 99%
“…Consider an example where the number of fringe patterns is 20, the shortest message length will be k 5. As the length of C n is even, we considered (6,5), (8,5), (10,5) and (12,5) binary linear block codes. The corresponding upper bounds on the minimum Hamming distances are 2, 2, 4, and 4.…”
Section: B Composite Fringe Patterns Projectionmentioning
confidence: 99%
See 3 more Smart Citations