Hello all, I'm happy to announce a new primary seam generator that was recently integrated into the Enblend mainline. It was developed as part of the Google Summer of Code 2011 program.
The algorithm is based on the idea of Graph-Cuts : http://en.wikipedia.org/wiki/Graph_cuts_in_computer_vision The implementation does not utilize max-flow algorithms, which are relatively slow and memory-heavy. The new seam generator takes into account feature frequency as well as image dissimilarity, and therefore is less likely to cross elements which would make the seam line more apparent, such as beams, fences, railings etc.. This should produce better results than the old seam generator in many cases. The Graph Cut seam generator works best with a fine mask (--fine-mask command line option). It requires more memory and time than the old Nearest Feature Transform algorithm, so it is best to use NFT where efficiency is essential. Graph-cut on the other hand should produce an overall better seam in most cases. For more information on usage and current limitations please refer to the Enblend manual. Special thanks to Thomas Modes and Christoph Spiel for great help and guidance. Also a big thank you for everyone who sent me photos for testing. Regards, Mikolaj -- You received this message because you are subscribed to the Google Groups "Hugin and other free panoramic software" group. A list of frequently asked questions is available at: http://wiki.panotools.org/Hugin_FAQ To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/hugin-ptx
