Abstract
We propose a method of optimal morphological decomposition. We first formulate this kind of problem into a set of linear constraints, and then find out the solution to the set of linear constraints by using an integer linear programming technique. Our method has the following three advantages: (1) the size of the factors can be any n/spl times/n (n/spl ges/3), (2) it can be applied to both convex and concave simply-connected images; (3) optimality is selective and flexible.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
