A maximum likelihood framework for iterative eigendecomposition

Proceedings of the IEEE International Conference on Computer Vision

Volumn 1, Issue , 2001, Pages 654-661

  Robles Kelly, A ^a   Hancock, E R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; IMAGE SEGMENTATION; ITERATIVE METHODS; MAXIMUM LIKELIHOOD ESTIMATION; PARAMETER ESTIMATION; PROBABILITY DISTRIBUTIONS;

ITERATIVE EIGENDECOMPOSITION; MAXIMUM LIKELIHOOD FRAMEWORK; PERCEPTUAL GROUPING; REGION SEGMENTATION;

IMAGE ANALYSIS;

EID: 0034849133     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Training stochastic model recognition algorithms can lead to maximum mutual information estimation of parameters
2. Inferring global perceptual contours from local features
3. A computational model of neural contour processing
4. Pairwise data clustering by deterministic annealing
5. Grouping-line segments using eigenclustering
6. Trace inference, curvature consistency and curve detection
7. Algorithms for straight line fitting using k-means
8. Factorization approach to grouping
9. Quantitative measures of change based on feature organization: Eigenvalues and eigenvectors
10. Structural saliency: The detection of globally salient structures using a locally connected network
11. Normalized cuts and image segmentations
12. Segmentation using eigenvectors: A unifying view
13. Local parallel computation of stochastic completion fields
14. Stochastic completion fields: A neural model of illusory contour shape and salience