From: Zach Bartels Date: 2010-02-14T11:40:07+09:00 Subject: Re: Generating all possible combinations of a 5 digit pattern. Yes that is it. I played around with it but I got a lot of dupes, and I'm not entirely sure I got all possible sequences of the two letter's C and N (but I'd have to mess around again to double check) Expanding on the idea about simply storing unique patterns as I come across them, I didn't explain it fully I think. The idea is basically to iterate through the project file, processing every frame in blocks of 5. At the end I would then have a finite list of every unique pattern in the video, and at that point I could define the frame I want to decimate in each unique pattern. OR I could just have it process each block of 5 frames, counting the number of times C and N appears, and what their position is.. This is mostly where my proof of concept lies, based on some observations I made (but have no coraborated with different source files) that when you have an N frame that immediately proceeds a C frame, that N frame is almost certainly a visual duplicate 99% of the time. Or in the case of a group of N frames, or more than one N frame in the pattern, the final and last occuring N proceeding a C frame, likewise is the duplicate that needs to be removed. I am thinking it would be perhaps be easier to write the program to do this, and simply ID the position and frame number of the last occuring N frame in a 5 frame pattern, and mark that frame number for decimation. That way no need to generate all these combinations, and set up a matching algorithm to check every single one. But this all hinges on the theory that I need to prove, that the final N frame proceeding a C frame (even if its the 5th frame and the next group of 5 begins with a C) is almost certain to be the duplicate. I think it would make a good proof of concept, and even if it varried by source, I would think I could find ways to make it easily adaptable depending on the stream and where the dupes are occuring.. What do you think? -Zach On Sat, 13 Feb 2010 20:39:26 -0500, Reid Thompson wrote: >On 2/13/2010 7:05 PM, Zach Bartels wrote: > >> I saw a very basic one or two line example where a range of 3 letters >> was given, equal to abc (I forgot how it was written) and it pretty >> much spat out all the combos of those 3 letters. >> >> I'm wondering if I made a big stink about nothing with my post now, if >> there is a gem out there I could get, heh. >> >> -Zach >> >This must be what you were talking about???? >http://flori.github.com/permutation/doc/index.html >http://flori.github.com/permutation/