Using Dynamic Programming for Solving Variational Problems in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Curves and surfaces for computer aided geometric design (3rd ed.): a practical guide
Curves and surfaces for computer aided geometric design (3rd ed.): a practical guide
Curve and surface fitting with splines
Curve and surface fitting with splines
Region Competition: Unifying Snakes, Region Growing, and Bayes/MDL for Multiband Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Finite-Element Methods for Active Contour Models and Balloons for 2-D and 3-D Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Snakes and Splines for Tracking Non-Rigid Heart Motion
ECCV '96 Proceedings of the 4th European Conference on Computer Vision-Volume II - Volume II
Adaptive B-Splines and Boundary Estimation
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Communication Systems
Wavelet descriptor of planar curves: theory and applications
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
Shape Tracking Using Centroid-Based Methods
EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
| Hi-index | 0.00 |
We propose a vector representation approach to contour estimation from noisy data. Images are modeled as random fields composed of a set of homogeneous regions; contours (boundaries of homogeneous regions) are assumed to be vectors of a subspace of L2(T) generated by a given finite basis; B-splines, Sinc-type, and Fourier bases are considered. The main contribution of the paper is a smoothing criterion, interpretable as a priori contour probability, based on the Kullback distance between neighboring densities. The maximum a posteriori probability (MAP) estimation criterion is adopted. To solve the optimization problem one is led to (joint estimation of contours, subspace dimension, and model parameters), we propose a gradient projection type algorithm. A set of experiments performed on simulated an real images illustrates the potencial of the proposed methodology