Implementation

 

We deciphered the Shah algorithm, and coded up the Shah snake.  We also implemented an initial point insertion program.

 

After preliminary testing, it became apparent that the Shah snake wasn’t optimized for practical use. 

            Noise problem

                        Snakes couldn’t get past noise

                        Sometimes edges were too far to affect the snake

                        Solved by applying a prefiltering blur

            Irregular distance between node points

                        C1 continuity function causes collapsing of snake

                        Introduced the distance constraint coefficient to counteract this

 

We then developed a metric to do a ratio analysis of the performance of snakes.