Majorization algorithms for inspecting circles, ellipses, squares, rectangles, and rhombi

Operations Research

Volumn 53, Issue 6, 2005, Pages 957-967

  Van Deun, K ^a   Groenen, P J F ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

Engineering: shape analysis; Facilities: location: continuous; Mathematics: functions: majorizing functions

Indexed keywords

FUNCTIONS; ITERATIVE METHODS; NUMERICAL METHODS; QUALITY CONTROL; SET THEORY;

ENGINERING: SHAPE ANALYSIS; FACILITIES: LOCATION: CONTINUOUS; MATHEMATICS: FUNCTIONS: MAJORIZING FUNCTIONS;

ALGORITHMS;

EID: 30344448299     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1050.0253     Document Type: Article

References (19)

1. Ahn, S. J., W. Rauh, H.-J. Warnecke. 2001. Least-squares orthogonal distances fitting of circle, sphere, ellipse, hyperbola, and parabola. Pattern Recognition 34 2283-2303.
2. De Leeuw, J. 1994. Block relaxation algorithms in statistics. H. H. Bock, W. Lenski, M. M. Richter, eds. Information Systems and Data Analysis. Springer-Verlag, Berlin, Germany, 308-325.
3. De Leeuw, J., W. J. Heiser. 1980. Multidimensional scaling with restrictions on the configuration. P. R. Krishnaiah, ed. Multivariate. Analysis V. North-Holland, Amsterdam, The Netherlands, 501-522.
4. Drezner, Z., S. Steiner, G. O. Wesolowsky. 2002. On the circle closest to a set of points. Comput. Oper. Res. 29 637-650.
5. Eiselt, H. A., G. Laporte. 1995. Objectives in location problems. Z. Drezner, ed. Facility Location: A Survey of Applications and Methods. Springer, New York, 151-180.
6. Fonseca, M. J., J. A. Jorge. 2001. Experimental evaluation of an online scribble recognizer. Pattern Recognition Lett. 22 1311-1319.
7. Groenen, P. J. F. 2002. Iterative majorization algorithms for minimizing loss functions in classification. Working paper, 8th Conf. IFCS. Krakow, Poland.
8. Groenen, P. J. F., W. J. Heiser, J. J. Meulman. 1999. Global optimization in least-squares multidimensional scaling by distance smoothing. J. Classification 16 225-254.
9. Groenen, P. J. F., R. Mathar, W. J. Heiser. 1995. The majorization approach to multidimensional scaling for Minkowski distances. J. Classification 12 3-19.
10. Groenen, P. J. F., B. J. van Os, J. J. Meulman. 2000. Optimal scaling by alternating length-constrained nonnegative least squares, with application to distance-based analysis. Psychometrika 65 511-524.
11. Heiser, W. J. 1995. Convergent computation by iterative majorization: Theory and applications in multidimensional data analysis. W. J. Krzanowski, ed. Recent Advances in Descriptive Multivariate Analysis. Oxford University Press, Oxford, UK, 157-189.
12. Kiers, H. A. L. 2002. Setting up alternating least squares and iterative majorization algorithms for solving various matrix optimization problems. Comput. Statist. Data Anal. 41 157-170.
13. Kiers, H. A. L., P. J. F. Groenen. 1996. A monotonically convergent algorithm for orthogonal congruence rotation. Psychometrika 61 375-389.
14. Langbein, F. C., B. Mills, A. D. Marshall, R. R. Martin. 2001. Approximate geometric shapes. Internat. J. Shape Model. 7 129-162.
15. Lange, K., D. R. Hunter, I. Yang. 2000. Optimization transfer using surrogate objective functions. J. Comput. Graphics Statist. 9 1-20.
16. Rorres, C., D. G. Romano. 1997. Finding the center of a circular starting line in an ancient Greek stadium. SIAM Rev. 39 745-754.
17. Van-Ban, L., D. T. Lee. 1991. Out-of-roundness problem revisited. IEEE Trans. Pattern Anal. 13 217-223.
18. Van Deun, K., P. J. F. Groenen, W. J. Heiser, F. M. T. A. Busing, L. Delbeke. 2005. Interpreting degenerate solutions in unfolding by use of the vector model and the compensatory distance model. Psychometrika 70 45-69.
19. Yeralan, S., J. A. Ventura. 1988. Computerized roundness inspection. Internat. J. Production Res. 26 1921-1935.