Rangarajan / Yuille / Vemuri | Energy Minimization Methods in Computer Vision and Pattern Recognition | Buch | 978-3-540-30287-2 | sack.de

Buch, Englisch, 666 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1013 g

Reihe: Image Processing, Computer Vision, Pattern Recognition, and Graphics

Rangarajan / Yuille / Vemuri

Energy Minimization Methods in Computer Vision and Pattern Recognition

5th International Workshop, EMMCVPR 2005, St. Augustine, FL, USA, November 9-11, 2005, Proceedings
2005
ISBN: 978-3-540-30287-2
Verlag: Springer Berlin Heidelberg

5th International Workshop, EMMCVPR 2005, St. Augustine, FL, USA, November 9-11, 2005, Proceedings

Buch, Englisch, 666 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1013 g

Reihe: Image Processing, Computer Vision, Pattern Recognition, and Graphics

ISBN: 978-3-540-30287-2
Verlag: Springer Berlin Heidelberg


setting.

Rangarajan / Yuille / Vemuri Energy Minimization Methods in Computer Vision and Pattern Recognition jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Probabilistic and Informational Approaches.- Adaptive Simulated Annealing for Energy Minimization Problem in a Marked Point Process Application.- A Computational Approach to Fisher Information Geometry with Applications to Image Analysis.- Optimizing the Cauchy-Schwarz PDF Distance for Information Theoretic, Non-parametric Clustering.- Concurrent Stereo Matching: An Image Noise-Driven Model.- Color Correction of Underwater Images for Aquatic Robot Inspection.- Bayesian Image Segmentation Using Gaussian Field Priors.- Handling Missing Data in the Computation of 3D Affine Transformations.- Maximum-Likelihood Estimation of Biological Growth Variables.- Deformable-Model Based Textured Object Segmentation.- Total Variation Minimization and a Class of Binary MRF Models.- Exploiting Inference for Approximate Parameter Learning in Discriminative Fields: An Empirical Study.- Combinatorial Approaches.- Probabilistic Subgraph Matching Based on Convex Relaxation.- Relaxation of Hard Classification Targets for LSE Minimization.- Linear Programming Matching and Appearance-Adaptive Object Tracking.- Extraction of Layers of Similar Motion Through Combinatorial Techniques.- Object Categorization by Compositional Graphical Models.- Learning Hierarchical Shape Models from Examples.- Discontinuity Preserving Phase Unwrapping Using Graph Cuts.- Retrieving Articulated 3-D Models Using Medial Surfaces and Their Graph Spectra.- Spatio-temporal Segmentation Using Dominant Sets.- Stable Bounded Canonical Sets and Image Matching.- Coined Quantum Walks Lift the Cospectrality of Graphs and Trees.- Variational Approaches.- Geodesic Image Matching: A Wavelet Based Energy Minimization Scheme.- Geodesic Shooting and Diffeomorphic Matching Via Textured Meshes.- An Adaptive Variational Model for Image Decomposition.- Segmentation Informed by Manifold Learning.- One-Shot Integral Invariant Shape Priors for Variational Segmentation.- Dynamic Shape and Appearance Modeling Via Moving and Deforming Layers.- Energy Minimization Based Segmentation and Denoising Using a Multilayer Level Set Approach.- Constrained Total Variation Minimization and Application in Computerized Tomography.- Some New Results on Non-rigid Correspondence and Classification of Curves.- Edge Strength Functions as Shape Priors in Image Segmentation.- Spatio-temporal Prior Shape Constraint for Level Set Segmentation.- A New Implicit Method for Surface Segmentation by Minimal Paths: Applications in 3D Medical Images.- Other Approaches and Applications.- Increasing Efficiency of SVM by Adaptively Penalizing Outliers.- Locally Linear Isometric Parameterization.- A Constrained Hybrid Optimization Algorithm for Morphable Appearance Models.- Kernel Methods for Nonlinear Discriminative Data Analysis.- Reverse-Convex Programming for Sparse Image Codes.- Stereo for Slanted Surfaces: First Order Disparities and Normal Consistency.- Brain Image Analysis Using Spherical Splines.- High-Order Differential Geometry of Curves for Multiview Reconstruction and Matching.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.