3D shape representation by contours
Computer Vision, Graphics, and Image Processing
Trace Inference, Curvature Consistency, and Curve Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
On minimal energy trajectories
Computer Vision, Graphics, and Image Processing
Perceptual grouping of curved lines
Proceedings of a workshop on Image understanding workshop
Inferring global perceptual contours from local features
International Journal of Computer Vision - Special issue on computer vision research at the University of Southern California
Local parallel computation of stochastic completion fields
Neural Computation
Extracting Salient Curves from Images: An Analysis of the Saliency Network
International Journal of Computer Vision
Fast Calculation of Multiple Line Integrals
SIAM Journal on Scientific Computing
ACM Transactions on Mathematical Software (TOMS)
Figure-Ground Discrimination: A Combinatorial Optimization Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
EMMCVPR '97 Proceedings of the First International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Quantitative Measures of Change based on Feature Organization: Eigenvalues and Eigenvectors
CVPR '96 Proceedings of the 1996 Conference on Computer Vision and Pattern Recognition (CVPR '96)
A Probabilistic Multi-scale Model for Contour Completion Based on Image Statistics
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part I
Sketches with Curvature: The Curve Indicator Random Field and Markov Processes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Euler Spiral for Shape Completion
International Journal of Computer Vision - Special Issue on Computational Vision at Brown University
Fragment-based image completion
ACM SIGGRAPH 2003 Papers
Salient Closed Boundary Extraction with Ratio Contour
IEEE Transactions on Pattern Analysis and Machine Intelligence
Contour Inferences for Image Understanding
International Journal of Computer Vision
Global Detection of Salient Convex Boundaries
International Journal of Computer Vision
Fast multiscale clustering and manifold identification
Pattern Recognition
Iterated tensor voting and curvature improvement
Signal Processing
Higher-Order Active Contour Energies for Gap Closure
Journal of Mathematical Imaging and Vision
Learning Probabilistic Models for Contour Completion in Natural Images
International Journal of Computer Vision
International Journal of Computer Vision
General Geometric Good Continuation: From Taylor to Laplace via Level Sets
International Journal of Computer Vision
Generalizing edge detection to contour detection for image segmentation
Computer Vision and Image Understanding
Robust guidewire segmentation through boosting, clustering and linear programming
ISBI'10 Proceedings of the 2010 IEEE international conference on Biomedical imaging: from nano to Macro
Guide-wire extraction through perceptual organization of local segments in fluoroscopic images
MICCAI'10 Proceedings of the 13th international conference on Medical image computing and computer-assisted intervention: Part III
Adaptive smoothness based robust active contours
Image and Vision Computing
A biologically-inspired theory for non-axiomatic parametric curve completion
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part II
Inference and Learning with Hierarchical Shape Models
International Journal of Computer Vision
On similarity-invariant fairness measures
Scale-Space'05 Proceedings of the 5th international conference on Scale Space and PDE Methods in Computer Vision
Tangent bundle curve completion with locally connected parallel networks
Neural Computation
| Hi-index | 0.14 |
The detection of smooth curves in images and their completion over gaps are two important problems in perceptual grouping. In this study, we examine the notion of completion energy of curve elements, showing, and exploiting its intrinsic dependence on length and width scales. We introduce a fast method for computing the most likely completion between two elements, by developing novel analytic approximations and a fast numerical procedure for computing the curve of least energy. We then use our newly developed energies to find the most likely completions in images through a generalized summation of induction fields. This is done through multiscale procedures, i.e., separate processing at different scales with some interscale interactions. Such procedures allow the summation of all induction fields to be done in a total of only $O(N \log N)$ operations, where $N$ is the number of pixels in the image. More important, such procedures yield a more realistic dependence of the induction field on the length and width scales: The field of a long element is very different from the sum of the fields of its composing short segments.