Difference between revisions of "Talk:Segmentation/Autoselected Segmentation"
(yeah) |
(multiple choice as mentioned in the article could be good too) |
||
Line 16: | Line 16: | ||
: This strategy has caught me attention before (and still on my must-do list, only at nearly bottom of it) so I know it before. Old wiki is really messy, isn't it? =) » <span style="font-size:0.9em;color:darkgreen;">[[User:Nat|Nat]] | [[User_talk:Nat|Talk]]</span> » 09:22, 12 September 2009 (UTC) | : This strategy has caught me attention before (and still on my must-do list, only at nearly bottom of it) so I know it before. Old wiki is really messy, isn't it? =) » <span style="font-size:0.9em;color:darkgreen;">[[User:Nat|Nat]] | [[User_talk:Nat|Talk]]</span> » 09:22, 12 September 2009 (UTC) | ||
+ | |||
+ | :: In my implementation I've gotten decent results without the [[Multiple Choice|multiple choice]] analysis [[User:Vuen|Vuen]] mentions in the original article. I've been restructuring things so I can try that out, at least on the gun, but so far just picking a good segment seems to work well. I don't think it's a golden bullet, but it was easy to understand once I grokked [[Wave Surfing|wave surfing]] and has gotten good results so far. -- [[User:Synapse|<font style="font-size:0.8em;font-variant:small-caps;">Synapse</font>]] 11:01, 12 September 2009 (UTC) |
Revision as of 12:01, 12 September 2009
I think we should define new term for this things. The "Automatic Segmentation" word make me feel like "Dynamic Segmentation". Perhaps the "Auto-Choose Segmentation Set"? » Nat | Talk » 12:45, 15 June 2009 (UTC)
Excellent thought - you can see I've moved the page. Thanks! -- Synapse 22:36, 15 June 2009 (UTC)
Shouldn't this be on the actual page, not on the talk page? Or are you writing it here, perfecting it, then posting it? --Jacob Litewski 22:59, 15 June 2009 (UTC)
I'm writing it here in small installments while I'm on my breaks at work, then once I'm happy with it I'll move it to the main page. If there's some better way to save "drafts" of a page I'm open to suggestions. -- Synapse 02:09, 16 June 2009 (UTC)
I change something above, especially the math fomula. Hope is isn't too ugly. The first section will be complete later. Some though, I don't think you should post the code here. If you want to post the code, do it in the Free code sub-page of either your user page or the robot's page. The code here should be pseudo-code. And the first implementation thing, I do think that everyone here do know about Polymorphism so I don't think you need to wrote that. » Nat | Talk » 03:20, 16 June 2009 (UTC)
I've updated the math formulas with the images from the main Wikipedia article on crest factor and root-mean-squared calculations. Thanks for the improvements, Nat! You can also see specific code for the assembly of the segments on Watermelon/Code. -- Synapse 06:55, 16 June 2009 (UTC)
Thanks for noticing, Nat. I just noticed the same thing rereading the old article! :) -- Synapse 09:13, 12 September 2009 (UTC)
- This strategy has caught me attention before (and still on my must-do list, only at nearly bottom of it) so I know it before. Old wiki is really messy, isn't it? =) » Nat | Talk » 09:22, 12 September 2009 (UTC)
- In my implementation I've gotten decent results without the multiple choice analysis Vuen mentions in the original article. I've been restructuring things so I can try that out, at least on the gun, but so far just picking a good segment seems to work well. I don't think it's a golden bullet, but it was easy to understand once I grokked wave surfing and has gotten good results so far. -- Synapse 11:01, 12 September 2009 (UTC)