Abstract
Photo typesetting belongs to the rectangular packing problems, currently the algorithms of rectangular packing problems can be divided into two categories: heuristic methods and modern intelligent based methods. For both of these methods, the similarity of contents do not be well considered, the packing order of the rectangular pieces are chaos. Therefore, this drawback will cause problems for photo typesetting. In this paper we propose a hybrid algorithm for the photo typesetting problem based on kinship. According to our algorithm, the kinship of difierent photos is calculated by their absolute paths, and then all photos are packed based on the distance of their kinship. Compared with the existing methods, according to the computation of difierent scales of tests, our algorithm shows faster typesetting speed and higher utilization ratios. This algorithm could solve the sort problem caused by chaos typesetting photos of difierent customers after lots of photos were typeset. Our algorithm could greatly improve the practical application of photo typesetting.
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.
