links to look at:
- graph cut matching in computer vision. (toby collins)
- introduction to min-cut/max-flow algorithms. (hong chen)
- graph cut algorithms in vision, graphics and machine learning. (sudipta n. sinha)
- graph cuts. (many)
orig
dark outlines with shadings
lightened shadings
need a way to follow outlines and build texture swaths. we're not going to track the texture or points in the texture (features) as SIFT might. instead, we're tracking and following what swaths are adjoined... we're going to expand on the unwrap mosaics, allowing for more dynamic scenes and removing the assumption of cylindrical topology. it will only take many, many intermediate steps to get there. the idea thus far will parallelize very easily! might even run decently on a GPU...
using statistics to aid tracking. histograms, gradients, mean/median, standard deviation.
build a "flattened" image of dynamic resolution... that's the "trick!"
No comments:
Post a Comment