On Integer Programming Approaches for Morphological Template Decomposition Problems in Computer Vision
نویسندگان
چکیده
In morphological image processing and analysis, a template or structuring element is applied to an image. Often savings in computation time and a better fit to the given computer architecture can be achieved by using the technique of template decomposition. Researchers have written a multitude of papers on finding such decompositions for special classes of templates. Justifying recent integer programming approaches to the morphological template decomposition problem in its general form, this paper proves the NP-completeness of this problem.
منابع مشابه
RESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملExploiting skeletal structure in computer vision annotation with Benders decomposition
Many annotation problems in computer vision can be phrased as integer linear programs (ILPs). The use of standard industrial solvers does not to exploit the underlying structure of such problems e.g., the skeleton in pose estimation. The leveraging of the underlying structure in conjunction with industrial solvers promises increases in both speed and accuracy. Such structure can be exploited us...
متن کاملGlobal Optimization Problems in Computer Vision*
In the field of computer vision, computer scientists extract knowledge from an image by manipulating it through image transforms. In the mathematical language of image algebra an image transformation often corresponds to an image-template product. When performing this operation on a computer, savings in time and memory as well as a better fit to the specific computer architecture can often be a...
متن کاملA Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...
متن کاملA REVIEW ON SEQUENCING APPROACHES FOR MIXED-MODEL JUST-IN-TIME PRODUCTION SYSTEM
Research interests have been focused on the concept of penalizing jobs both for being early and for being tardy because not only of modern competitive industrial challenges of providing a variety of products at a very low cost by smoothing productions but also of its increasing and exciting computer applications. Here, sequencing approaches of the mixed- model just-in-time production systems is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Optim.
دوره 1 شماره
صفحات -
تاریخ انتشار 1997