.png){kind=icon}
.png){kind=icon}
Return
Regularized quadratic cost function for oriented fringe-pattern filtering
.png){kind=icon}
OA
AI
DOI：10.1364/OL.34.001741.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We use the regularization theory in a Bayesian framework to derive a quadratic cost function for denoising fringe patterns. As prior constraints for the regularization problem, we propose a Markov random field model that includes information about the fringe orientation. In our cost function the regularization term imposes constraints to the solution (i.e., the filtered image) to be smooth only along the fringe's tangent direction. In this way as the fringe information and noise are conveniently separated in the frequency space, our technique avoids blurring the fringes. The attractiveness of the proposed filtering method is that the minimization of the cost function can be easily implemented using iterative methods. To show the performance of the proposed technique we present some results obtained by processing simulated and real fringe patterns. (C) 2009 Optical Society of America
Journal
IF:
3.3
Papers:
4.0W
Citations:
7.6W