Abstract
In this paper binary matrices are reconstructed from two orthogonal projections. In the reconstruction process particle swarm optimization is used. Since most of the reconstruction problems are NP-hard, the use of a global optimization process gave promising results. The task is to adjust the particle swarm algorithm to the problem of the reconstruction of binary matrices. The main focus is on the reconstruction of hv-convex matrices which consist of either one or more connected components. At the end of the paper the results are shown and the appropriate conclusions are drawn.
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.
