How is it better to substitute list of random combination of 1 and 0 (binary image) so that only first (or central) instance of 1 left in each group.

`list = {0,1,1,0,0,1,0,1,1,1,0}` should be `{0,1,0,0,0,1,0,1,0,0,0}`

There should be a kind of `Erosion` but keeping `1`s. I'm thinking about replacement rule.