The MIN PFS problem and piecewise linear model estimation

Discrete Applied Mathematics

Volumn 118, Issue 1-2, 2002, Pages 115-143

  Amaldi, Edoardo ^a   Mattavelli, Marco ^b  

^a POLITECNICO DI MILANO   (Italy)

^b EPFL   (Switzerland)

Author keywords

Feasible subsystems; Infeasible linear systems; Minimum partition; Piecewise linear model estimation; Relaxation methods

Indexed keywords

EID: 84867956834     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00260-8     Document Type: Article

References (44)

1. E. Aarts, and J. Korst Simulated Annealing and Boltzmannn Machines 1989 Wiley and Sons New York
2. S. Agmon The relaxation method for linear inequalities Canadian J. Math. 6 1954 382 392
3. E. Amaldi, From finding maximum feasible subsystems of linear systems to feedforward neural network design, Ph.D. Thesis No. 1272, Department of Mathematics, Swiss Federal Institute of Technology, Lausanne, 1994.
4. E. Amaldi, R. Hauser, Randomized relaxation methods for the maximum feasible subsystem problem, Technical Report, N. 2001-90, DEI, Politecnico di Milano, Italy, 2001.
5. E. Amaldi, and V. Kann The complexity and approximability of finding maximum feasible subsystems of linear relations Theoret. Comput. Sci. 147 1-2 1995 181 210
6. E. Amaldi, M. Mattavelli, A combinatorial optimization approach to extract piecewise linear structure from non-linear data and an application to optical flow segmentation, Technical Report 97-12, Cornell Computational Optimization project, Cornell University, Ithaca NY, 1997.
7. E. Amaldi, M. Pfetsch, and L. Trotter Jr. Some structural and algorithmic properties of the maximum feasible subsystem problem G. Cornuéjols, R. Burkard, G. Woeginger, Proceeding of the 10th Integer Programming and Combinatorial Optimization conference (IPCO'99) Lecture Notes in Computer Science Vol. 1610 1999 Springer Berlin 45 59
8. J. Argyris, G. Faust, and M. Haase An Exploration of Chaos 1994 North-Holland Amsterdam
9. A. Blumer, A. Ehrenfeucht, D. Haussler, and M.K. Warmuth Occam's razor Inform. Process. Lett. 24 1987 377 380
10. P.S. Bradley, and O.L. Mangasarian k-Plane clustering J. Global Optim. 16 2000 23 32
11. Y. Censor, and S.A. Zenios Parallel Optimization: Theory, Algorithms and Applications 1997 Oxford University Press Oxford
12. J. Chinneck Fast heuristics for the maximum feasible subsystem problem INFORMS J. Comput. 13 2001 210 213
13. M. Frean A "thermal" perceptron learning rule Neural Comput. 4 6 1992 946 957
14. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 W.H. Freeman and Company San Francisco
15. J.L. Goffin The relaxation method for solving systems of linear inequalities Math. Oper. Res. 5 1980 388 414 (Pubitemid 11438184)
16. R. Greer Trees and Hills: Methodology for Maximizing Functions of Systems of Linear Relations Annals of Discrete Mathematics Vol. 22 1984 Elsevier science publishers B.V Amsterdam
17. P. Hansen, and B. Jaumard Clustering analysis and mathematical programming Math. Programming B 79 1997 191 216
18. J. Illingworth, and J. Kittler The adaptive Hough transform IEEE Trans. Pattern Anal. Mach. Intell. PAMI-9 5 1987 690 698
19. J. Illingworth, and J. Kittler A survey of the Hough transform Comput. Vision Graphics Image Process. 44 1988 87 116
20. T. Kohonen The self organizing map Proc. IEEE 78 1990 1464 1480
21. P. Kultaken, L. Xu, and E. Oja A new curve detection method: randomized Hough transform Pattern Recognition Lett. 11 1995 331 338
22. V.F. Leavers Which Hough transform? CVGIP: Image Understanding 58 2 1993 250 264 (Pubitemid 24395437)
23. E.K. Lee, R.J. Gallagher, and M. Zaider Planning implants of radionuclides for the treatment of prostate cancer: an application of mixed integer programming Optima 61 1999 1 7
24. O.L. Mangasarian Misclassification minimization J. Global Optim. 5 1994 309 323
25. M. Mattavelli, Motion analysis and estimation: from ill-posed discrete inverse linear problems to MPEG-2 coding, Ph.D. Thesis No. 1597, Communication Systems Division, Swiss Federal Institute of Technology, Lausanne, 1997.
26. M. Mattavelli, V. Noel, E. Amaldi, A new efficient line detection algorithm based on combinatorial optimization techniques, Proceedings of the 1998 International Conference on Image Processing (ICIP98), Chicago, Illinois, October 4-7 1998, IEEE Signal Processing Society.
27. M. Mattavelli, V. Noel, E. Amaldi, A new approach for fast line detection based on combinatorial optimization, Proceedings of ICIAP99, International Conference on Image Analysis and Processing, Venice, Italy, September 27-29, 1999, pp. 168-173.
28. M. Mattavelli, V. Noel, E. Amaldi, Fast line detection algorithms based on combinatorial optimization, Proceedings of the 4th International Workshop on Visual Form (IWVF4), Capri, Italy, Lecture Notes in Computer Science, eds. C. Arcelli and L.P. Cordella and G. Sanniti di Baja, Springer, Berlin, 2001, pp. 410-419. (Pubitemid 33276045)
29. M.L. Minsky, and S. Papert Perceptrons: An Introduction to Computational Geometry Expanded Edition 1988 MIT Press Cambridge, MA
30. T.S. Motzkin, and I.J. Schoenberg The relaxation method for linear inequalities Canadian J. Math. 6 1954 393 404
31. E. Oja, H. Kalviainen, P. Hirvonen, Houghtool a software package for Hough transform calculation, Ninth Scandinavian Conference on Image Analysis, Uppsala, Sweden, 1995, pp. 841-848, http://www.lut.fi/dep/tite/XHoughtool/ xhoughtool.html.
32. P. Palmer, M. Petrou, J. Kittler, A Hough transform algorithm with a 2-D hypothesis testing kernel, CVGIP 58(2)(Image Understanding) (1993) 221-234. (Pubitemid 24395438)
33. M. Parker, A set covering approach to infeasibility analysis of linear programming problems and related issues, Ph.D. Thesis, Dep. of Mathematics, University of Colorado at Denver, 1995.
34. B.T. Polyak Random algorithms for solving convex inequalities D. Butnariu, Y. Censor, S. Reich, Inherently Parallel Algorithms in Feasibility and Other Applications Studies in Computational Mathematics 2001 Elsevier Amsterdam
35. P.J. Rousseeuw, and L. Kaufman Finding Groups in Data 1990 Wiley New York
36. P.J. Rousseeuw, and A.M. Leroy Robust Regression and Outlier Detection 1987 Wiley New York
37. J. Ryan Transversals of IIS-hypergraphs Congr. Numer. 81 1991 17 22
38. J. Telgen On relaxation methods for systems of linear inequalities European J. Oper. Res. 9 1982 184 189 (Pubitemid 12500623)
39. H. Tong Threshold Models in Nonlinear Time Series Analysis 1983 Springer New York
40. H. Tong Nonlinear Time Series 1990 Oxford University Press Oxford
41. J.-M. Vesin, A common generalization framework for two classical nonlinear models, Proceedings of International Workshop on Nonlinear Digital Signal Processing, Tampere, Finland, 1993, pp. 6-2.3.
42. J.-M. Vesin, M. Mattavelli, E. Amaldi, A new approach to piecewise linear modeling based on a combinatorial optimization formulation, Physica D, under revision.
43. L. Xu, E. Oja, and P. Kultanen A new curve detection method: randomized Hough transform Pattern Recognition Lett. 11 5 1990 334 344
44. E. Zapata, N. Guil, and J. Villalba A fast Hough transform for segment detection IEEE Trans. Image Process. 4-11 1995 1541 1548