Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Fabrication imperfection analysis and statistics generation using precision and reliability optimization method

Open Access Open Access

Abstract

This paper applies a recently proposed dominant point detection method – precision and reliability optimization (PRO) – for representing shapes in the microscopy images of fabricated structures. This method uses both the local and the global nature of fit for dominant point detection. A smaller value of its control parameter better represents the local curvature properties of the shape while a larger value better indicates the global curvature properties. The applicability of this method to a wide range of microscopy images is demonstrated using four microscopy examples of brightness enhancement films, electromagnetic and photonic band gap materials, and aspherical mirror alignments. It is shown that PRO can clearly highlight several image effects and imperfections which may not be easily identifiable by human eye or may be difficult to analyze and assess. Further, for large scale arrays, it can be used to generate useful fabrication accuracy statistics and detect features with low fidelity or more imperfections.

©2013 Optical Society of America

1. Introduction

In many applications, complicated boundaries or shapes are represented using polygons [14]. In this paper, we consider a new application of the polygonal representation of shapes in the field of analysis and statistic generation for the microscopy images of fabricated structures [58] or optical effects like fringing [9, 10]. The microscopy images are inherently digitized and amenable for digital image processing. Thus methods using polygonal approximation of digital curves can be used for shape analysis in microscopy images as well. While this paper represents shapes as polygons, the use of higher order polynomial curves like cubic splines is also common. It is notable that curves of order 2 or higher are smooth (second order derivatives being continuous) curves. Thus, they are unsuitable for representing shapes with corners and sharp curvature changes. On the other hand, polygonal representation is quite generic and can represent a wide variety of shapes such as used in the fabrication industry. Further, polygonal representation of shapes helps in the determination of geometrical properties like inflexion points, perimeter, and tangent estimation. Lastly, it filters away the effect of digitization and retains the shape characteristics of fabrication.

There are several methods for polygonal representation of digital curves [1117]. However, not all of them are suitable for detecting fabrication imperfections and quantifying them. For example, Nguyen [15] is not suitable for this purpose because it uses the concept of blurred segments to obtain the polygonal representation. It is interesting to note that there are some methods that use smoothing kernels [16, 17], like a Gaussian kernel, to remove the digitization effects while detecting dominant points. Such methods are somewhat similar to the used of Fourier components in [6]. There are relatively more direct methods like [1114] which work in the digital image domain itself and use some form of distance metrics within the digital image domain as control parameters. As discussed in [18], [14] focuses on representing the global nature of the curve better while [13] focuses on representing the local curvature changes better. Nevertheless, both of them are computation expensive. On this account, [11, 12] have better characteristics, since a larger value of control parameter results in a polygonal fit more representing of the global curvature properties and vice versa. However, there is no direct or strict correspondence between the nature of fit and the value of control parameter.

Recently, precision and reliability metrics specifically representing the local and global natures of polygonal fit were proposed [19] and used in precision and reliability optimization (PRO) method [18] for obtaining the polygonal fit. The control parameter of PRO ε0 behaves quite regularly in representing the nature of polygonal fit. PRO provides the user with good flexibility regarding the nature of fit. For example, the user may choose a very close fit, which closely follows the digital curve and retains all the small perturbations in the curve. Or, the user may choose a curvature following fit that removes the local effects (due to noise, etc.) and retains the large scale features of the digital curve. Thus, it is quite suitable to identify the general shape (large/global scale) properties as well as local imperfection (local scale).

This paper applies PRO to microscopy images of various types of fabricated structures in order to analyze and assess the quality of features fabricated in the sample. It is shown that the imperfections can be better analyzed using PRO even in diverse applications like photonic crystal arrays (which are essentially electromagnetic band gap structures, albeit for optical frequencies), brightness enhancement films for CCD arrays, and electromagnetic band gap structures. For example, some imperfections that look visually unobvious can be easily found and located using PRO. Further, optical effects and alignments can also be easily studied, as demonstrated in the images for alignment and inspection of aspherical mirror. Aspects of image qualities like sharpness etc. can also be easily recognized. Using these examples of wide variety, the utility of PRO for analyzing microscopy images and determining and assessing fabrication imperfections is clearly demonstrated. The example images used in this paper are copyright of the authors of [68, 10] and the Optical Society of America. The images have been used with the kind permission of their respective authors and OSA.

The outline of the paper is as follows. Section 2 presents the PRO method briefly and analyzes the nature of its control parameter. It also demonstrates the applicability of PRO for complicated digital shapes. Section 3 considers various examples of microscopy images and how PRO is applied to these images for analysis and assessment. Section 4 concludes the paper.

2. Precision and reliability optimization method

2.1 The method

The precision and reliability measures were defined for a line segment in [19]. Suppose, for a sequence of connected pixels S={Pi(xi,yi)}, i=1toM, we intend to fit a line ax+by=1. Then, the coefficients of the line, a and b, can be determined by casting the problem of fitting into the following matrix equation as expressed in Eq. (1):

XA¯=J¯,
where X=[[x1x2xM]T[y1y2yM]T], A¯=[ab]T, the superscript T denotes the transpose operation, and J¯ is a column matrix containing M rows, whose every element is 1. The precision of fitting can be modeled using the normalized residue given in Eq. (2):
εp=|J¯XA¯|/|A¯|,
where |·| represents the Euclidean norm of vectors. Since it considers the residue for each pixel, it is a characteristic of the local nature of fitting alone.

On the other hand, for the global characteristics of fit, another measure called the reliability measure is needed. Generally, reliability of a fit refers to how well the fit is expected to satisfy at least two conditions:

  • 1. The fit should be valid for a sufficiently large region (or in this case a long curve).
  • 2. It should not be sensitive to occasional spurious large deviations in the edge.

A combination of both these properties can be sought by defining a reliability measure as shown in Eq. (3):

εr=i|axi+byi1|/smax,
where smax is the maximum Euclidean distance between any two pair of pixels [19]. Here, |·| represents the magnitude or the absolute value.

Let us consider a digital curve e={P1P2PN}, where Pi is the ith edge pixel in the digital curve e. The line passing through a pair of pixels Pa(xa,ya) and Pb(xb,yb) is given by Eq. (4):

x(yayb)+y(xbxa)+ybxayaxb=0.

Then the deviation di of a pixel Pi(xi,yi)e from the line passing through the pair {P1,PN} is given as Eq. (5):

di=|xi(y1yN)+yi(xNx1)+yNx1y1xN|(xNx1)2+(y1yN)2.

Accordingly, the pixel with maximum deviation can be found. Let it be denoted as Pmax. Then considering the pairs {P1,Pmax} and {Pmax,PN}, we find two new pixels from e using the concept expressed in Eqs. (4) and (5). It is evident that the maximum deviation decreases as one chooses newer pixels of maximum deviation between a pair.

For each pair of line segment and its associated curve, the precision and reliability measures εp and εr are computed using Eqs. (2) and (3). Then, for each segmented curve, if the precision and reliability measures are not below a certain threshold given by Eq. (6):

max(εp,εr)<ε0,
then the segmented curve is further segmented into two curves at the point of maximum deviation. ε0 is the chosen tolerance value and is typically less than 1. The pseudocode for the PRO algorithm is provided in Fig. 1. The control parameter ε0 gives the users large freedom in determining the nature of fit. For example, using ε0 close to 0 (like 0.1 or 0.2) results into a very close fit on the curve, where the lines follow even small deviations in the curvature. This may be used to achieve high fidelity fit, where one needs to retain even the smallest deviations in the data, or where one studies the nature of noise in the curve itself. Using ε0 close to 1 (like 0.9 or 1) results into line fit that smoothens over small spurious deviations and retains all significant curvature changes in the line fit.

 figure: Fig. 1

Fig. 1 Pseudocode for PRO algorithm.

Download Full Size | PDF

2.2 Demonstration of the nature of PRO and the control parameter ε0

We consider the 17 examples used in [19] for illustrating the nature of the control parameter ε0. Such analysis is helpful for choosing a suitable value of PRO’s control parameter for various images and applications. Each example is a snippet of 20 pixels dimensions containing only one digital curve, which may be similar to a digital line or a more complicated curve. The images are kept small so that the performance can be seen in close up for various curvature conditions of the digital curves. The proposed method is called PRO<number>, where <number> denotes the value of ε0. For example, PRO0.2 refers to the use of ε0=0.2 in the PRO method. Comparison with a very popular method, RDP [11, 12], and two recent methods, Carmona-Poyato [14] (referred to as Carmona for simplicity) and Masood [13] is also given. For RDP, we use the notation RDP<tol>, where tol indicates the value of the control parameter of RDP. The value of control parameter for Carmona [14] and Masood [13] are 0.4 and 0.9 respectively, as suggested in [14] and [13] respectively. Carmona and Masood are chosen for comparison because of two reasons. The first reason is that they are quite recent and represent the state-of-the-art method for dominant point detection problem. The second reason is that while Masood uses local nature of fit as the main criterion for dominant point detection, Carmona uses the global nature of fit as the main criterion. Thus, it is interesting to compare the performance of these methods against PRO, which considers both the local and global natures of fit.

The actual lines fitted by various algorithms are shown in Fig. 2. Further, several performance parameters are listed in Table 1. It can be seen in the row PRO0.2 of Fig. 2 that PRO0.2 tends to follow the digital curves very closely. As a consequence it generates numerous small line segments to represent the curve, strongly evident in columns (e-h) of Fig. 2. Next, we see that PRO0.6 tends to follow the curvature of the digital curve, better than PRO0.2. We highlight the results in column (m) of Fig. 2. While PRO0.2 generated many line segments for the right side of the curve, PRO0.6 is more selective in fitting the line segments and fits the line segments focusing at the location of changes in curvature, rather than following every small-scale feature of the curve. This is significantly evident in the results in columns (i), (j), and (q) of Fig. 2. In PRO1.0, instead of focusing on the small features in the digital curve, it tends to follow the general characteristics of the digital curve on a relatively larger-scale, see columns (m) and (n) of Fig. 2. As a consequence of this characteristic, PRO1.0 has significantly better dimensionality reduction as compared to other PRO algorithms (see dimensionality reduction ratio in Table 1). PRO algorithms demonstrate at least two well-defined patterns in terms of performance and the nature of fit. The first pattern is that small value of ε0 provides very close fits that are highly precise. The second pattern is that large value of ε0 tends to smooth out small variations and retain large scale curvature changes. Based on this analysis, depending on the requirements, a suitable value of ε0 can be chosen or PRO with more than one values of ε0 can be executed.

 figure: Fig. 2

Fig. 2 Results for the 17 snippets used in [19]. The lines fitted by various algorithms are shown for each snippet.

Download Full Size | PDF

Tables Icon

Table 1. The values of performance parameters for various algorithms. The entries with gray background are the minimum values of the performance parameters in a group of algorithms.

RDP1 algorithm gives a performance comparable to PRO0.6, both qualitatively (specifically note the columns (i), (m), and (o) of Fig. 2) and quantitatively (see Table 1). RDP2 and RDP3 perform poorer than RDP1 for all the parameters except the dimensionality reduction ratio. Even RDP does not give a well-defined performance for fitting polygons on digital curves with various shapes and curvature. The results of Masood [13] show a mixed performance which cannot be classified as either adhering to local shape variations or global shape variations. Carmona’s method [14] attempts to fit the line segments using a relative measure such that the allowable maximum deviation increases with the length of the digital curve. This results in over-fitting for small digital curves and under-fitting for large digital curves.

As compared to RDP, Carmona, and Masood, the controlled and well-behaved nature of PRO is evident for all the examples. In addition, we note that the time complexities of Carmona and Masood are significantly higher than RDP and PRO due to the iterative optimization procedure conducted for each dominant point. The capability of PRO in representing the local and global features of diverse digital curves is demonstrated in Fig. 3 for 7 standard curves used in the image processing community [1315].

 figure: Fig. 3

Fig. 3 The digital curves used in Masood [13] and Carmona-Poyato [14] and the lines fitted using PRO0.2, PRO0.6, and PRO1.0.

Download Full Size | PDF

3. Fabrication analysis using PRO

3.1 High resolution SEM images of 2D planar slab photonic crystal arrays

Statistical analysis of imperfections in the fabrication of 2D planar slab photonic crystal arrays of circular shape was done in [6] using high resolution SEM images and representing the shape in terms of Fourier components. We denote the circular elements in the image as e=1toE. Here, we demonstrate our approach for this example.

First the images are binarized using simple threshold on the gray level (user-specified) from a range 0-255. The digital contours are obtained from the boundaries in the binarized images. Then PRO is applied on the digital contours using the following values of control parameter ε00.2n,n=1to5. The vertices of the polygons obtained using PRO are used in an ellipse-fitting method. Here, we have used recently proposed ElliFit method [20] for its selectivity of elliptic shapes. Let the parameters of ellipses be denoted as: ae,n,be,n,xe,n,ye,n,θe,n, which represents the lengths of semi-major and semi-minor axes, the x and y-coordinates of the center of ellipse, and the orientation (the counter-clockwise angle from x-axis to the semi-major axis).

The ellipses found for all elements of the crystal array and all values of ε0 are used to generate the statistical average size of the elements, i.e. a=e,nae,n/(5e), b=e,nbe,n/(5e). The average coordinate and orientation of each element is determined by taking the averages for all value of ε0, i.e. xe=nxe,n/5, ye=nye,n/5, θe=nθe,n/5. Then the normal distance of each digital curve from the corresponding average ellipse [a,b,xe,ye,θe] is computed and used as the measure of the fabrication imperfection of the circular photonic crystal array. Let us denote the normal distance of pth pixel in a digital curve from the average ellipse be denoted as dp, then we use mean(dp/a;p), max(dp/a;p), and std(dp/a;p) as the statistics of imperfections, where these expressions denote the average, maximum, and standard deviation of the normal distances of the pixels from the ellipse corresponding to their digital curve.

We note that the above procedure works for both partially and completely present elements in the image. However, the digital curves of partially present elements will result into large normal distance for the chord of the partial element. So, they are neglected in the computation of imperfection. A simple example shown in Fig. 4 illustrates the procedure.

 figure: Fig. 4

Fig. 4 Illustration of the computing average feature and statistics of a 2D planar array of circular photonic crystals. The original images are the copyright of the authors of [6] and have been used with their permission.

Download Full Size | PDF

Two more elaborate examples are shown in Fig. 5, where the first to third columns respectively showing the actual microscopy image, its digital curves, and the detected features. In addition, the top 10 features with the highest value of mean(dp/a;p) are highlighted in the middle column using red triangles.

 figure: Fig. 5

Fig. 5 Two examples of photonic crystal array. In the middle column, the triangles denote the top 10 features with highest values of mean(dp/a;p). The average ellipses are shown in white (overlapped with the original image) in the third column. The original images are the copyright of the authors of [6] and have been used with their permission.

Download Full Size | PDF

The statistics of the features in these two examples are plotted in Fig. 6. The comparison shows that the features in the second example have lesser imperfections (lesser value of max(dp/a;p) as well as mean(dp/a;p)). Also the distribution of imperfections is more uniform in the second example. It is seen that though the distribution of dp/a;e,p can be approximated using Gaussian distribution, the fit is closer for example 2. These statistics allow for identifying the features with more imperfections as illustrated using the triangles in the middle column of Fig. 5.

 figure: Fig. 6

Fig. 6 The statistics of the two examples of photonic crystal array shown in Fig. 5. (a) statistics of individual features in example 1. (b) histogram and equivalent Gaussian distribution for the values of dp/a;e,p for example 1. (c) and (d): same as (a) and (b) but for example 2.

Download Full Size | PDF

3.2 Fabrication fidelity in brightness enhancement films with prism arrays fabricated using roll-to-roll process

Wang and Tseng [7] demonstrated the use of roll-to-roll process for fabricating brightness enhancement films (for CCD arrays) in the form of prism arrays fabricated on a PET substrate. In [7], SEM images of the fabricated prism arrays were shown to demonstrate the good quality of fabricated array. However, minor edge defects did exist which may or may not be easily perceivable by naked eye using the microscopy image. Here, we use PRO to highlight these effects. The edges in the image are detected using Canny edge detector [21] and the PRO 1.0 is applied. Two images and their PRO results are shown in Fig. 7. The first image shows a SEM image with good contrast and sharpness. The PRO result shows the boundaries of the prisms very well. However, the upper side (towards left) shows a lot of clutter which occurs due to the darker shadowed region in the upper left side. Further, besides the clean edges of the prisms, the defects can also be easily identified. The second image is a good example of a low contrast blur image. While the image looks visually acceptable, it is not suitable for identifying or localizing the defects or even finding the edges of the fringes. This can be easily seen in the PRO result. While the Canny edge detector does not identify any edges in the lower half of the image, the PRO result shows several dominant points along most edges. Nevertheless, a big defect (highlighted using an ellipse) can still be identified from the image easily.

 figure: Fig. 7

Fig. 7 Two examples of fabrication fidelity in brightness enhancement films with prism arrays fabricated using roll-to-roll process. The defects are highlighted using red arrows and red ellipse. The example images are taken from [7] with the permission of its authors.

Download Full Size | PDF

3.3 Electromagnetic band gap structures and their fabrication quality

Wu et. al [8] demonstrated a fast and inexpensive technique for fabricating electromagnetic band gap structures using a polymer-jetting technique. While the advantages of this fabrication technique are easily identified, it is of significant practical interest to assess the fabrication quality. Two images reported in [8] are considered here in Fig. 8. The features in the images appear reasonably well-fabricated. However, use of PRO1.0 shows some anomalies as shown using red arrows in Fig. 8. We highlight that some of the anomalies are the structures from the lower layer. We note that it may also indicate the need of better image quality.

 figure: Fig. 8

Fig. 8 Two examples of electromagnetic band gap structures. The defects not easily visible are highlighted using red arrows. The example images are taken from [8] with the permission of its authors.

Download Full Size | PDF

3.4 Aspherical mirror quality and alignment

Pan et. al [10] reported some methods for assessing the quality and alignment of aspheric mirrors. Some images were presented in [10] to demonstrate the fringes, the aberrations, misalignments, etc. Here, PRO1.0 is used to analyze those images as shown in Fig. 9. Image 1 in Fig. 9 shows the fringes obtained using interferogram. The result is identified as good due to good contrast. Notwithstanding this fact, the result of PRO1.0 showed in Fig. 9 indicates that the fringes are non-uniform and irregular. Image 2 in Fig. 9 shows a difference image obtained by removing lower order coma and astigmatism. The PRO1.0 result (and the center of the outer circle computed using [20]) show that the inner circles are shifted from the geometric center of outer circle. This indicates the misalignment of the mirror.

 figure: Fig. 9

Fig. 9 Example images from [10] (taken with the authors’ permission) and the results of PRO. The images are shown in the upper row and PRO1.0 results are shown in the lower row. For the images 2 and 4, the center of the outer circle computed using [20] is shown in a red colored ‘ + ’ sign.

Download Full Size | PDF

The averages images obtained using 168 independent images are shown as images 3 and 4 in Fig. 9. Image 3 corresponds to a prior traditional method and image 4 corresponds to a the CGH method proposed in [10], and it is reported in [10] that the CGH method is better for alignment. PRO1.0 and the center of the outer circle computed using [20] show more conclusively that the CGH method is better for alignment while the traditional methods do not provide any cursor (in the form of inner circles) for alignment.

7. Conclusion

This paper has demonstrated that the precision and reliability optimization (PRO) method, that uses precision and reliability measures in the optimization goals, is a useful tool for assessing fabrication or feature qualities from the microscopy images for a variety of applications. The PRO method explicitly considers both local and global qualities of fit and its control parameter ε0 behaves in a very regular manner. Smaller values of ε0 result in very close fitting of polygons such that small local features can be represented well. On the other hand, larger values of ε0 result in better representation of the large scale features. An elaborate example of photonics crystal array with circular elements shows how PRO can be used for identifying imperfect features and generating statistics for large arrays. Other examples of prism arrays for brightness enhancement in CCD arrays, electromagnetic band gap structures, and imaging based assessment techniques for aspherical mirrors are also considered and PRO is used for detecting the image quality, fabrication defects, and misalignments. It is seen that PRO aids in assessing the image quality easily and identify the effects that are not easily obvious to human eye. Further, PRO also assists in easily assessing and/or quantifying the fabrication quality and localizing the imperfections. Thus, PRO is shown to be a useful tool for analysis and image processing of microscopy images. Nevertheless, if the shape information is known a priori, methods dedicated to those shape priors are expected to perform better (for example [20] for elliptic shapes).

Two interesting future directions of this work are discussed here. Developing quantitative criteria for the measurement of fabrication error is an important future direction. For developing such criteria, the knowledge of the structures, geometries, and positions of the features to be fabricated is essential. Further, Jaccard index and other shape overlap measurement techniques are some possible approaches suitable for quantifying the fabrication errors. The second future direction is to combine the proposed method with inverse reconstruction approaches. It is well-known that the microscopy image is never a true one-to-one map of the object being imaged. It is rather a complicated map of the object which combines the input illumination and the response of the microscopy system. Further, unless confocal system is used, the image is always a 2-dimensional projection of the 3-dimensional object features (thus we see the features from lower layer in Fig. 8). The mapping from focal plane to the image is approximately linear if the microscopy system is paraxial and confocal. In such a case, the proposed method is expected to represent the fabrication details and errors quite realistically. However, in general, for separating the optical response of the microscope from the fabricated structure, it is essential to solve an optical or electromagnetic inverse (object reconstruction) problem (for example, using deconvolution, holography, etc [2225].). It is therefore an interesting future direction to combine the proposed method with a reconstruction approach. In this regard, a possible motivation is to detect the shapes using the proposed method and use them as initial guess or a deformable shape [26] which gets adapted in the iterative procedure of reconstruction.

Acknowledgment

The example images used in this paper are copyright of the authors of [68, 10] and the Optical Society of America. The images have been used with the kind permission of their respective authors and OSA. The author of this paper is thankful to the concerned researchers and the publication house.

References and links

1. I. Kallioniemi, J. Saarinen, K. Blomstedt, and J. Turunen, “Polygon approximation of the fringes of diffractive elements,” Appl. Opt. 36(28), 7217–7223 (1997). [CrossRef]   [PubMed]  

2. P. A. Medennikov, “Algorithm for constructing a convex envelope and evaluating the convexity characteristics of objects on digital images,” J. Opt. Technol. 77(3), 198–200 (2010). [CrossRef]  

3. Y. Pan, Y. Wang, J. Liu, X. Li, and J. Jia, “Fast polygon-based method for calculating computer-generated holograms in three-dimensional display,” Appl. Opt. 52(1), A290–A299 (2013). [CrossRef]   [PubMed]  

4. O. Ruch and P. Réfrégier, “Minimal-complexity segmentation with a polygonal snake adapted to different optical noise models,” Opt. Lett. 26(13), 977–979 (2001). [CrossRef]   [PubMed]  

5. Y. Lin, J. Cardenas, S. Kim, and G. P. Nordin, “Reduced loss through improved fabrication for single air interface bends in polymer waveguides,” Opt. Express 14(26), 12803–12813 (2006). [CrossRef]   [PubMed]  

6. M. Skorobogatiy, G. Bégin, and A. Talneau, “Statistical analysis of geometrical imperfections from the images of 2D photonic crystals,” Opt. Express 13(7), 2487–2502 (2005). [CrossRef]   [PubMed]  

7. M.-W. Wang and C.-C. Tseng, “Analysis and fabrication of a prism film with roll-to-roll fabrication process,” Opt. Express 17(6), 4718–4725 (2009). [CrossRef]   [PubMed]  

8. Z. Wu, J. Kinast, M. E. Gehm, and H. Xin, “Rapid and inexpensive fabrication of terahertz electromagnetic bandgap structures,” Opt. Express 16(21), 16442–16451 (2008). [CrossRef]   [PubMed]  

9. S. Gai and F. Da, “Fringe image analysis based on the amplitude modulation method,” Opt. Express 18(10), 10704–10719 (2010). [CrossRef]   [PubMed]  

10. F. Y. Pan, J. Burge, D. Anderson, and A. Poleshchuk, “Efficient Testing of Segmented Aspherical Mirrors by Use of a Reference Plate and Computer-Generated Holograms. II. Case Study, Error Analysis, and Experimental Validation,” Appl. Opt. 43(28), 5313–5322 (2004). [CrossRef]   [PubMed]  

11. U. Ramer, “An iterative procedure for the polygonal approximation of plane curves,” Comput. Graph. Image Process. 1(3), 244–256 (1972). [CrossRef]  

12. D. H. Douglas and T. K. Peucker, “Algorithms for the reduction of the number of points required to represent a digitized line or its caricature,” Cartographica: Int. J. Geograph. Inf. Geovisualization 10(2), 112–122 (1973). [CrossRef]  

13. A. Masood, “Dominant point detection by reverse polygonization of digital curves,” Image Vis. Comput. 26(5), 702–715 (2008). [CrossRef]  

14. A. Carmona-Poyato, F. J. Madrid-Cuevas, R. Medina-Carnicer, and R. Muñoz-Salinas, “Polygonal approximation of digital planar curves through break point suppression,” Pattern Recognit. 43(1), 14–25 (2010). [CrossRef]  

15. T. P. Nguyen and I. Debled-Rennesson, “A discrete geometry approach for dominant point detection,” Pattern Recognit. 44(1), 32–44 (2011). [CrossRef]  

16. T. M. Cronin, “A boundary concavity code to support dominant point detection,” Pattern Recognit. Lett. 20(6), 617–634 (1999). [CrossRef]  

17. B. K. Ray and K. S. Ray, “Detection of significant points and polygonal approximation of digitized curves,” Pattern Recognit. Lett. 13(6), 443–452 (1992). [CrossRef]  

18. D. K. Prasad and M. K. H. Leung, “Polygonal representation of digital curves,” in Digital Image Processing, S. G. Stanciu, ed. (InTech, 2012), 71–90.

19. D. K. Prasad and M. K. H. Leung, “Reliability/Precision Uncertainty in Shape Fitting Problems,” in IEEE International Conference on Image Processing(Hong Kong, 2010), 4277–4280.

20. D. K. Prasad, M. K. H. Leung, and C. Quek, “ElliFit: An unconstrained, non-iterative, least squares based geometric Ellipse Fitting method,” Pattern Recognit. 46(5), 1449–1465 (2013). [CrossRef]  

21. R. C. Gonzalez and R. E. Woods, Digital Image Processing (Pearson Prentice Hall, Delhi, 2008).

22. Y. Cotte, M. F. Toy, N. Pavillon, and C. Depeursinge, “Microscopy image resolution improvement by deconvolution of complex fields,” Opt. Express 18(19), 19462–19478 (2010). [CrossRef]   [PubMed]  

23. B. Kouskousis, D. J. Kitcher, S. Collins, A. Roberts, and G. W. Baxter, “Quantitative phase and refractive index analysis of optical fibers using differential interference contrast microscopy,” Appl. Opt. 47(28), 5182–5189 (2008). [CrossRef]   [PubMed]  

24. G. Bao and P. Li, “Numerical solution of inverse scattering for near-field optics,” Opt. Lett. 32(11), 1465–1467 (2007). [CrossRef]   [PubMed]  

25. E. Y. Lam, X. Zhang, H. Vo, T.-C. Poon, and G. Indebetouw, “Three-dimensional microscopy and sectional image reconstruction using optical scanning holography,” Appl. Opt. 48(34), H113–H119 (2009). [CrossRef]   [PubMed]  

26. D. K. Prasad and M. S. Brown, “Online tracking of deformable objects under occlusion using dominant points,” J. Opt. Soc. Am. A 30(8), 1484–1491 (2013). [CrossRef]  

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (9)

Fig. 1
Fig. 1 Pseudocode for PRO algorithm.
Fig. 2
Fig. 2 Results for the 17 snippets used in [19]. The lines fitted by various algorithms are shown for each snippet.
Fig. 3
Fig. 3 The digital curves used in Masood [13] and Carmona-Poyato [14] and the lines fitted using PRO0.2, PRO0.6, and PRO1.0.
Fig. 4
Fig. 4 Illustration of the computing average feature and statistics of a 2D planar array of circular photonic crystals. The original images are the copyright of the authors of [6] and have been used with their permission.
Fig. 5
Fig. 5 Two examples of photonic crystal array. In the middle column, the triangles denote the top 10 features with highest values of mean( d p /a ;p ) . The average ellipses are shown in white (overlapped with the original image) in the third column. The original images are the copyright of the authors of [6] and have been used with their permission.
Fig. 6
Fig. 6 The statistics of the two examples of photonic crystal array shown in Fig. 5. (a) statistics of individual features in example 1. (b) histogram and equivalent Gaussian distribution for the values of d p /a ;e,p for example 1. (c) and (d): same as (a) and (b) but for example 2.
Fig. 7
Fig. 7 Two examples of fabrication fidelity in brightness enhancement films with prism arrays fabricated using roll-to-roll process. The defects are highlighted using red arrows and red ellipse. The example images are taken from [7] with the permission of its authors.
Fig. 8
Fig. 8 Two examples of electromagnetic band gap structures. The defects not easily visible are highlighted using red arrows. The example images are taken from [8] with the permission of its authors.
Fig. 9
Fig. 9 Example images from [10] (taken with the authors’ permission) and the results of PRO. The images are shown in the upper row and PRO1.0 results are shown in the lower row. For the images 2 and 4, the center of the outer circle computed using [20] is shown in a red colored ‘ + ’ sign.

Tables (1)

Tables Icon

Table 1 The values of performance parameters for various algorithms. The entries with gray background are the minimum values of the performance parameters in a group of algorithms.

Equations (6)

Equations on this page are rendered with MathJax. Learn more.

X A ¯ = J ¯ ,
ε p = | J ¯ X A ¯ | / | A ¯ | ,
ε r = i | a x i +b y i 1 | / s max ,
x( y a y b )+y( x b x a )+ y b x a y a x b =0.
d i = | x i ( y 1 y N )+ y i ( x N x 1 )+ y N x 1 y 1 x N | ( x N x 1 ) 2 + ( y 1 y N ) 2 .
max( ε p , ε r )< ε 0 ,
Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.