All Stories

  1. State of the Art and Potentialities of Graph-level Learning
  2. Fused lasso for feature selection using structural information
  3. Network edge entropy decomposition with spin statistics
  4. Multimodal fusion for indoor sound source localization
  5. Internet financing credit risk evaluation using multiple structural interacting elastic net feature selection
  6. Thermodynamic motif analysis for directed stock market networks
  7. Erratum: Wang, J., et al. Microcanonical and Canonical Ensembles for fMRI Brain Networks in Alzheimer’s Disease. Entropy 2021, 23, 216
  8. Entropic Dynamic Time Warping Kernels for Co-Evolving Financial Time Series Analysis
  9. Learning Aligned Vertex Convolutional Networks for Graph Classification
  10. Learning Graph Convolutional Networks based on Quantum Vertex Information Propagation
  11. Semi-Supervised Face Frontalization in the Wild
  12. The Entropy of Graph Embeddings: A Proxy of Potential Mobility in Covid19 Outbreaks
  13. Uncalibrated, Two Source Photo-Polarimetric Stereo
  14. Directed and undirected network evolution from Euler–Lagrange dynamics
  15. Local-global nested graph kernels using nested complexity traces
  16. Early Detection of Alzheimer’s Disease: Detecting Asymmetries with a Return Random Walk Link Predictor
  17. A Quantum-Inspired Similarity Measure for the Analysis of Complete Weighted Graphs
  18. Special issue on recent advances in statistical, structural and syntactic pattern recognition
  19. Learning binary code for fast nearest subspace search
  20. Estimating Material Parameters Using Light Scattering Model and Polarization
  21. Graph Motif Entropy for Understanding Time-Evolving Networks
  22. Learning Backtrackless Aligned-Spatial Graph Convolutional Networks for Graph Classification
  23. Seeking affinity structure: Strategies for improving m-best graph matching
  24. Subspace Structure Regularized Nonnegative Matrix Factorization for Hyperspectral Unmixing
  25. Deep Hashing by Discriminating Hard Examples
  26. Deep supervised hashing using symmetric relative entropy
  27. Dirichlet densifier bounds: Densifying beyond the spectral gap constraint
  28. Dirichlet densifiers for improved commute times estimation
  29. Single image super resolution via neighbor reconstruction
  30. Structural network inference from time-series data using a generative model and transfer entropy
  31. Depth-based subgraph convolutional auto-encoder for network representation learning
  32. Cross-modal hashing with semantic deep embedding
  33. Deep depth-based representations of graphs through deep learning networks
  34. Identifying the most informative features using a structurally interacting elastic net
  35. Quantum-based subgraph convolutional neural networks
  36. The low-rank decomposition of correlation-enhanced superpixels for video segmentation
  37. Polar Transformation on Image Features for Orientation-Invariant Representations
  38. Graph Edge Entropy in Maxwell-Boltzmann Statistics for Alzheimer’s Disease Analysis
  39. Network Embedding by Walking on the Line Graph
  40. Network Time Series Analysis Using Transfer Entropy
  41. Editorial: Special Issue on Machine Vision
  42. Leveraging Shannon Entropy to Validate the Transition between ICD-10 and ICD-11
  43. A wave packet signature for complex networks
  44. A Deep Hybrid Graph Kernel Through Deep Learning Networks
  45. A Unified Neighbor Reconstruction Method for Embeddings
  46. Depth-based Subgraph Convolutional Neural Networks
  47. Directed Graph Evolution from Euler-Lagrange Dynamics
  48. Local Binary Patterns for Graph Characterization
  49. net4Lap: Neural Laplacian Regularization for Ranking and Re-Ranking
  50. Semi-supervised Graph Rewiring with the Dirichlet Principle
  51. Adaptive hash retrieval with kernel based similarity
  52. Recovering variations in facial albedo from low resolution images
  53. Vertex-Level Three-Dimensional Shape Deformability Measurement Based on Line Segment Advection
  54. A Mixed Entropy Local-Global Reproducing Kernel for Attributed Graphs
  55. A Preliminary Survey of Analyzing Dynamic Time-Varying Financial Networks Using Graph Kernels
  56. Bragg Diffraction Patterns as Graph Characteristics
  57. Deep Supervised Hashing with Information Loss
  58. Directed Network Analysis Using Transfer Entropy Component Analysis
  59. Dirichlet Densifiers: Beyond Constraining the Spectral Gap
  60. Euler-Lagrange Network Dynamics
  61. Graph Time Series Analysis Using Transfer Entropy
  62. Iterative Deep Subspace Clustering
  63. Plenoptic Imaging for Seeing Through Turbulence
  64. Quantum Edge Entropy for Alzheimer’s Disease Analysis
  65. Erratum to “Network analysis using entropy component analysis”
  66. Linear Differential Constraints for Photo-Polarimetric Height Estimation
  67. Network analysis using entropy component analysis
  68. Spin statistics, partition functions and network entropy
  69. Joint hypergraph learning and sparse regression for feature selection
  70. High-order covariate interacted Lasso for feature selection
  71. Quantum kernels for unattributed graphs using discrete-time quantum walks
  72. The mutual information between graphs
  73. A Nested Alignment Graph Kernel Through the Dynamic Time Warping Framework
  74. Adaptive Feature Selection Based on the Most Informative Graph-Based Features
  75. Deep Face Model Compression Using Entropy-Based Filter Selection
  76. Detecting Alzheimer’s Disease Using Directed Graphs
  77. Graph Similarity through Entropic Manifold Alignment
  78. Minimising Entropy Changes in Dynamic Network Evolution
  79. Network Edge Entropy from Maxwell-Boltzmann Statistics
  80. Shape Simplification Through Graph Sparsification
  81. A novel entropy-based graph signature from the average mixing matrix
  82. A transitive aligned Weisfeiler-Lehman subtree kernel
  83. Absorptive scattering model for rough laminar surfaces
  84. An edge-based matching kernel on commute-time spanning trees
  85. Analyzing graph time series using a generative model
  86. Face image super-resolution via weighted patches regression
  87. Network entropy analysis using the Maxwell-Boltzmann partition function
  88. Quantum thermodynamics of time evolving networks
  89. Reflectance-aware optical flow
  90. Shape classification with a vertex clustering graph kernel
  91. Symmetry-Aware Mesh Segmentation into Uniform Overlapping Patches
  92. Depth-based hypergraph complexity traces from directed line graphs
  93. Guest Editorial Special Section on Learning in Non-(geo)metric Spaces
  94. Discriminative Lasso
  95. Concentric network symmetry
  96. Fast depth-based subgraph kernels for unattributed graphs
  97. A Jensen-Shannon Divergence Kernel for Directed Graphs
  98. Commute Times in Dense Graphs
  99. Correlation Network Evolution Using Mean Reversion Autoregression
  100. Graph Entropy from Closed Walk and Cycle Functionals
  101. P2P Lending Analysis Using the Most Relevant Graph-Based Features
  102. Thermodynamic Characterization of Temporal Networks
  103. Thermodynamic Network Analysis with Quantum Spin Statistics
  104. fMRI Activation Network Analysis Using Bose-Einstein Entropy
  105. Discriminative sparse representation for face recognition
  106. Example-Based Modeling of Facial Texture from Deficient Data
  107. High-order graph matching kernel for early carcinoma EUS image classification
  108. Editorial
  109. Unfolding Kernel embeddings of graphs: Enhancing class separation through manifold learning
  110. Generative Graph Prototypes from Information Theory
  111. Thermodynamic characterization of networks using graph polynomials
  112. Heat Kernel Embeddings, Differential Geometry and Graph Structure
  113. Corrigendum to “Coined quantum walks lift the cospectrality of graphs and trees” [Pattern Recognition 42 (9) (2009) 1988–2002]
  114. Measuring graph similarity through continuous-time quantum walks and the quantum Jensen-Shannon divergence
  115. A quantum Jensen–Shannon graph kernel for unattributed graphs
  116. A High-Order Depth-Based Graph Matching Method
  117. A Quantum Jensen-Shannon Graph Kernel Using Discrete-Time Quantum Walks
  118. Adaptive Graph Learning for Unsupervised Feature Selection
  119. An Edge-Based Matching Kernel Through Discrete-Time Quantum Walks
  120. An Edge-Based Matching Kernel for Graphs Through the Directed Line Graphs
  121. An Entropic Edge Assortativity Measure
  122. Coupled-Feature Hypergraph Representation for Feature Selection
  123. Similarity Analysis from Limiting Quantum Walks
  124. Skeletal Graphs from Schrödinger Magnitude and Phase
  125. Thermodynamics of Time Evolving Networks
  126. Unsupervised Feature Selection by Graph Optimization
  127. Guest Editorial Special Issue on Facial Biometrics in the Wild
  128. Ricci flow embedding for rectifying non-Euclidean dissimilarity data
  129. Spherical and Hyperbolic Embeddings of Data
  130. Celebrating the life and work of Maria Petrou
  131. Obstacle detection by means of stereo feature matching
  132. Seamless texture stitching on a 3D mesh by poisson blending in patches
  133. A Hypergraph Kernel from Isomorphism Tests
  134. An Attributed Graph Kernel from the Jensen-Shannon Divergence
  135. Curvature Estimation for Ricci Flow Embedding
  136. Directed Depth-Based Complexity Traces of Hypergraphs from Directed Line Graphs
  137. Graph Characterization from Entropy Component Analysis
  138. Graph Characterization Using Wave Kernel Trace
  139. The Mutual Information between Graphs
  140. Approximate von Neumann entropy for directed graphs
  141. Depth-based complexity traces of graphs
  142. Quantum vs Classical Ranking in Segment Grouping
  143. A Graph Kernel from the Depth-Based Representation
  144. Attributed Graph Kernels Using the Jensen-Tsallis q-Differences
  145. Commute Time for a Gaussian Wave Packet on a Graph
  146. Entropic Graph Embedding via Multivariate Degree Distributions
  147. Node Centrality for Continuous-Time Quantum Walks
  148. Pattern Recognition with Non-Euclidean Similarities
  149. Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
  150. Transitive State Alignment for the Quantum Jensen-Shannon Kernel
  151. Characterizing graph symmetries through quantum Jensen-Shannon divergence
  152. Co-evolution of networks and quantum dynamics: a generalization of preferential attachment
  153. Thermodynamic Depth in Undirected and Directed Networks
  154. Maria Petrou (1953–2012)
  155. Backtrackless Walks on a Graph
  156. Eigenfunctions of the edge-based Laplacian on a graph
  157. Robust estimation of shape and polarisation using blind source separation
  158. Advances in pattern recognition methodology and applications
  159. Graph Characteristics from the Schrödinger Operator
  160. TurboTensors for Entropic Image Comparison
  161. A Continuous-Time Quantum Walk Kernel for Unattributed Graphs
  162. A Fast Jensen-Shannon Subgraph Kernel
  163. A Graph Embedding Method Using the Jensen-Shannon Divergence
  164. A Quantum Jensen-Shannon Graph Kernel Using the Continuous-Time Quantum Walk
  165. Analysis of the Schrödinger Operator in the Context of Graph Characterization
  166. Analysis of Wave Packet Signature of a Graph
  167. Attributed Graph Similarity from the Quantum Jensen-Shannon Divergence
  168. Complexity Fusion for Indexing Reeb Digraphs
  169. Eigenvector Sign Correction for Spectral Correspondence Matching
  170. Entropy and Heterogeneity Measures for Directed Graphs
  171. Estimating Complex Refractive Index Using Ellipsometry
  172. Gaussian Wave Packet on a Graph
  173. Graph Characterization Using Gaussian Wave Packet Signature
  174. Heterogeneity Index for Directed Graphs
  175. Information-Theoretic Dissimilarities for Graphs
  176. Similarity-Based Pattern Recognition
  177. Computer Analysis of Images and Patterns
  178. Computer Analysis of Images and Patterns
  179. Manifold Learning and the Quantum Jensen-Shannon Divergence Kernel
  180. Graph-Based Methods in Computer Vision
  181. Graph characterizations from von Neumann entropy
  182. Hypergraph based information-theoretic feature selection
  183. Editorial: Invited papers from Editorial Board Members
  184. Graph Kernels from the Jensen-Shannon Divergence
  185. Computing Gender Difference Using Fisher-Rao Metric from Facial Surface Normals
  186. KERNEL ENTROPY-BASED UNSUPERVISED SPECTRAL FEATURE SELECTION
  187. Shape and Refractive Index from Single-View Spectro-Polarimetric Images
  188. Pattern analysis with graphs: Parallel work at Bern and York
  189. Heat diffusion: Thermodynamic depth complexity of networks
  190. Efficient computation of Ihara coefficients using the Bell polynomial recursion
  191. 3D Shape Classification Using Commute Time
  192. A Jensen-Shannon Kernel for Hypergraphs
  193. A Statistical Operator for Detecting Weak Edges in Low Contrast Images
  194. An Efficient Scheme for Color Edge Detection in Uniform Color Space
  195. Approximate Axial Symmetries from Continuous Time Quantum Walks
  196. Detection of Edges in Color Images: A Review and Evaluative Comparison of State-of-the-Art Techniques
  197. Estimating Surface Characteristics and Extracting Features from Polarisation
  198. Graph Complexity from the Jensen-Shannon Divergence
  199. Heat Flow-Thermodynamic Depth Complexity in Directed Networks
  200. Hypergraph Spectra for Semi-supervised Feature Selection
  201. Hypergraph Spectra for Unsupervised Feature Selection
  202. Information Theoretic Prototype Selection for Unattributed Graphs
  203. Localized Graph-Based Feature Selection for Clustering
  204. Shape Analysis Using the Edge-Based Laplacian
  205. Unsupervised Clustering of Human Pose Using Spectral Embedding
  206. Unsupervised Feature Selection Via Hypergraph Embedding
  207. Gender discriminating models from facial surface normals
  208. An information theoretic approach to gender feature selection
  209. Information theoretic methods for learning generative models for relational structures
  210. Tensor-based total bregman divergences between graphs
  211. Generalized SOM with Application to Facial Gender Identification
  212. Special edition on semi-supervised learning for visual content analysis and understanding
  213. Refractive index estimation using photometric stereo
  214. A polynomial characterization of hypergraphs using the Ihara zeta function
  215. Special issue on Graph-Based Representations in Computer Vision
  216. Graph matching through entropic manifold alignment
  217. Supervised relevance maps for increasing the distinctiveness of facial images
  218. Graph Characterization via Ihara Coefficients
  219. A Graph-Based Approach to Feature Selection
  220. A Hypergraph-Based Approach to Feature Selection
  221. An Information Theoretic Approach to Learning Generative Graph Prototypes
  222. Characterizing Graphs Using Approximate von Neumann Entropy
  223. Determining the Cause of Negative Dissimilarity Eigenvalues
  224. Entropy versus Heterogeneity for Graphs
  225. Facial Expression Recognition Using Nonrigid Motion Parameters and Shape-from-Shading
  226. Feature Point Matching Using a Hermitian Property Matrix
  227. Feature Selection for Gender Classification
  228. From Points to Nodes: Inverse Graph Embedding through a Lagrangian Formulation
  229. Fusion of Multiple Candidate Orientations in Fingerprints
  230. Graph Characterization via Backtrackless Paths
  231. Graph Clustering Using the Jensen-Shannon Kernel
  232. High Order Structural Matching Using Dominant Cluster Analysis
  233. Improved Content-Based Watermarking Using Scale-Invariant Feature Points
  234. Kernelising the Ihara Zeta Function
  235. Learning Generative Graph Prototypes Using Simplified von Neumann Entropy
  236. Mutual Information Criteria for Feature Selection
  237. Natural Material Segmentation and Classification Using Polarisation
  238. Rectifying Non-euclidean Similarity Data through Tangent Space Reprojection
  239. Reflection Component Separation Using Statistical Analysis and Polarisation
  240. Refractive Index Estimation of Naturally Occurring Surfaces Using Photometric Stereo
  241. Refractive Index Estimation Using Polarisation and Photometric Stereo
  242. Robust Shape and Polarisation Estimation Using Blind Source Separation
  243. Quantum walks, Ihara zeta functions and cospectrality in regular graphs
  244. Coupled Prediction Classification for Robust Visual Tracking
  245. Detection of skin lesions using diffuse polarisation
  246. Distinguishing facial expression using the Fisher-Rao metric
  247. Robust Computation of the Polarisation Image
  248. A Supergraph-based Generative Model
  249. Characterising Facial Gender Difference Using Fisher-Rao Metric
  250. Heat Flow-Thermodynamic Depth Complexity in Networks
  251. Mining Exemplars for Object Modelling Using Affinity Propagation
  252. Recovering 3D Shape Using an Improved Fast Marching Method
  253. Rectifying Non-Euclidean Similarity Data Using Ricci Flow Embedding
  254. Robust Shape from Polarisation and Shading
  255. Facial gender classification using shape-from-shading
  256. Geometric characterization and clustering of graphs using heat kernel embeddings
  257. Manifold embedding for shape analysis
  258. Shape and refractive index recovery from single-view polarisation images
  259. Spherical embeddings for non-Euclidean dissimilarities
  260. New Riemannian techniques for directional and tensorial image data
  261. Affinity Propagation for Class Exemplar Mining
  262. Associating Minutiae between Distorted Fingerprints Using Minimal Spanning Tree
  263. Commute-Time Convolution Kernels for Graph Clustering
  264. Face Recognition Using Simplicial Complexes
  265. Graph Embedding Using an Edge-Based Wave Kernel
  266. Ihara Coefficients: A Flexible Tool for Higher Order Learning
  267. Incrementally Discovering Object Classes Using Similarity Propagation and Graph Clustering
  268. Regularising the Ricci Flow Embedding
  269. Semi-supervised Feature Selection for Gender Classification
  270. Spherical Embedding and Classification
  271. Surface Material Segmentation Using Polarisation
  272. Using the Fisher-Rao Metric to Compute Facial Similarity
  273. What Is the Complexity of a Network? The Heat Flow-Thermodynamic Depth Approach
  274. Extracting gender discriminating features from facial needle-maps
  275. Graph characteristics from the heat kernel trace
  276. Specular and diffuse reflectance in microfacet models
  277. Weakly supervised specific object modelling for recognition
  278. Coined quantum walks lift the cospectrality of graphs and trees
  279. Erratum to: Graph matching using the interference of continuous-time quantum walks [Pattern Recognition 42 (5) 985-1002]
  280. Learning Large Scale Class Specific Hyper Graphs for Object Recognition
  281. Weighted graph characteristics from oriented line graph polynomials
  282. A generative model for graph matching and embedding
  283. Graph matching using the interference of discrete-time quantum walks
  284. Graph matching using the interference of continuous-time quantum walks
  285. Probabilistic white matter fiber tracking using particle filtering and von Mises–Fisher sampling
  286. A Riemannian Self-Organizing Map
  287. Characteristic Polynomial Analysis on Matrix Representations of Graphs
  288. Characterizing Graphs Using Spherical Triangles
  289. Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering
  290. Geometric Characterizations of Graphs Using Heat Kernel Embeddings
  291. Graph Regularisation Using Gaussian Curvature
  292. Graph-Based Object Class Discovery
  293. Hypergraphs, Characteristic Polynomials and the Ihara Zeta Function
  294. Learning a Self-organizing Map Model on a Riemannian Manifold
  295. Learning Class Specific Graph Prototypes
  296. Pairwise Similarity Propagation Based Graph Clustering for Scalable Object Indexing and Retrieval
  297. Reconstructing 3D Facial Shape Using Spherical Harmonics
  298. Estimating Facial Reflectance Properties Using Shape-from-Shading
  299. Graph spectral image smoothing using the heat kernel
  300. Probabilistic relaxation labelling using the Fokker–Planck equation
  301. Two-dimensional BRDF estimation from polarisation
  302. Isotree: Tree clustering via metric embedding
  303. Quasi-isometric parameterization for texture mapping
  304. 3D Object Recognition Using Hyper-Graphs and Ranked Local Invariant Features
  305. Clustering Using Class Specific Hyper Graphs
  306. Graph Characteristic from the Gauss-Bonnet Theorem
  307. Graph Characteristics from the Ihara Zeta Function
  308. Graph Edit Distance without Correspondence from Continuous-Time Quantum Walks
  309. Polytopal Graph Complexity, Matrix Permanents, and Embedding
  310. Quantitative Evaluation on Heat Kernel Permutation Invariants
  311. Recognising Facial Expressions Using Spherical Harmonics
  312. Spectral Embedding of Feature Hypergraphs
  313. Supervised Principal Geodesic Analysis on Facial Surface Normals for Gender Classification
  314. A Light Scattering Model for Layered Dielectrics with Rough Surface Boundaries
  315. Facial Shape Spaces from Surface Normals and Geodesic Distance
  316. Clustering and Embedding Using Commute Times
  317. Shape Estimation Using Polarization and Shading from Two Views
  318. Graph simplification and matching using commute times
  319. A statistical approach to sparse multi-scale phase-based stereo
  320. Kernelised Relaxation Labelling using Fokker-Planck Diffusion
  321. Surface Integration: Two Statistical Approaches
  322. Template Trackingwith Observation Relevance Determination
  323. Facial Shape-from-shading and Recognition Using Principal Geodesic Analysis and Robust Statistics
  324. The modified Beckmann–Kirchhoff scattering theory for rough surface analysis
  325. Regression tracking with data relevance determination
  326. Regression-Based Template Tracking in Presence of Occlusions
  327. The M170 Reflects a Viewpoint-Dependent Representation for Both Familiar and Unfamiliar Faces
  328. Graph embedding using tree edit-union
  329. A Coupled Statistical Model for Face Shape Recovery From Brightness Images
  330. A Riemannian approach to graph embedding
  331. Gender Classification using Shape from Shading
  332. Shape-From-Shading Using the Heat Equation
  333. Recovering Facial Shape Using a Statistical Model of Surface Normal Direction
  334. Edge Detection and Anisotropic Diffusion for Tensor-Valued Images
  335. Heat Kernel Smoothing of Scalar and Vector Image Data
  336. ESTIMATING FACIAL ALBEDO FROM A SINGLE IMAGE
  337. Acquiring height data from a single image of a face using local shape indicators
  338. Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering
  339. A spectral approach to learning structural variations in graphs
  340. Correspondence matching using kernel principal components analysis and label consistency constraints
  341. Learning shape-classes using a mixture of tree-unions
  342. Recovery of surface orientation from diffuse polarization
  343. Reflectance Modeling for Layered Dielectrics with Rough Surface Boundaries
  344. Testing new variants of the Beckmann–Kirchhoff model against radiance data
  345. Correcting Curvature-Density Effects in the Hamilton–Jacobi Skeleton
  346. A Facial Statistical Model from Complex Numbers
  347. Ensemble of Piecewise FDA Based on Spatial Histograms of Local (Gabor) Binary Patterns for Face Recognition
  348. A Simple Coupled Statistical Model for 3D Face Shape Recovery
  349. Combinatorial Surface Integration
  350. Estimating Cast Shadows using SFS and Class-based Surface Completion
  351. Face Recognition using Patch-based Spin Images
  352. Graph matching and clustering using spectral partitions
  353. Graph Matching using Commute Time Spanning Trees
  354. Graph Matching using Interference of Coined Quantum Walks
  355. Probabilistic Relaxation using the Heat Equation
  356. Reflectance from Surfaces with Layers of Variable Roughness
  357. Robust Multi-body Motion Tracking Using Commute Time Clustering
  358. String Kernels for Matching Seriated Graphs
  359. Estimating the surface radiance function from single images
  360. Surface radiance correction for shape from shading
  361. A graph-spectral method for surface height recovery
  362. Vector transport for shape-from-shading
  363. Pattern vectors from algebraic graph theory
  364. Graph edit distance from spectral seriation
  365. A comparison of Cartesian coordinate-based representations for building three-dimensional models of faces
  366. Analysis of Directional Reflectance and Surface Orientation Using Fresnel Theory
  367. Characterising Graphs using the Heat Kernel
  368. Clustering shapes using heat content invariants
  369. Coined Quantum Walks Lift the Cospectrality of Graphs and Trees
  370. Commute Times for Graph Spectral Clustering
  371. Commute Times, Discrete Green’s Functions and Graph Matching
  372. Comparing Variants of the Beckmann Model
  373. Estimating the albedo map of a face from a single image
  374. Estimation of Facial Angular Information Using a Complex-Number-Based Statistical Model
  375. Fast Isometric Parametrization of 3D Triangular Mesh
  376. Geometric Characterisation of Graphs
  377. Image Segmentation using Commute times
  378. Incorporating subsurface attenuation into the Beckmann model
  379. Locally Linear Isometric Parameterization
  380. Manifold Embedding of Graphs Using the Heat Kernel
  381. Modelling Surface Normal Distribution Using the Azimuthal Equidistant Projection
  382. Multi-view surface reconstruction using polarization
  383. Recovering facial shape and albedo using a statistical model of surface normal direction
  384. Recovering facial shape using a statistical surface normal model
  385. Recovery of Surface Height Using Polarization from Two Views
  386. Single Image Estimation of Facial Albedo Maps
  387. A Graph-Spectral Approach to Shape-From-Shading
  388. A probabilistic spectral framework for grouping and segmentation
  389. A skeletal measure of 2D shape similarity
  390. STRING EDIT DISTANCE, RANDOM WALKS AND GRAPH MATCHING
  391. Guest editors' introduction to the special section on energy minimization methods in computer vision and pattern recognition
  392. Face recognition using shading-based curvature attributes
  393. Graph manifolds from spectral polynomials
  394. Graph matching using spectral embedding and alignment
  395. Levenshtein distance for graph spectral features
  396. Probabilistic phase based sparse stereo
  397. Skin reflectance modelling for face recognition
  398. Vector field smoothing via heat flow
  399. Learning mixtures of point distribution models with the EM algorithm
  400. Correspondence matching with modal clusters
  401. Guest editors' Introduction to the special section on energy minimization methods in computer vision and pattern recognition
  402. A unified framework for alignment and correspondence
  403. Spectral embedding of graphs
  404. Terrain analysis using radar shape-from-shading
  405. A study of pattern recovery in recurrent correlation associative memories
  406. Computing approximate tree edit distance using relaxation labeling
  407. A probabilistic framework for specular shape-from-shading
  408. Coarse view synthesis using shape-from-shading
  409. Darboux smoothing for shape-from-shading
  410. Graph Based Representations in Pattern Recognition
  411. Spectral correspondence for point pattern matching
  412. Estimating the perspective pose of texture planes using spectral analysis on the unit sphere
  413. Recovering facial pose with the EM algorithm
  414. Relational object recognition from large structural libraries
  415. An expectation–maximisation framework for segmentation and grouping
  416. Detecting multiple texture planes using local spectral distortion
  417. Eigenspaces for graphs from spectral features
  418. EIGENSPACES FOR GRAPHS
  419. Iterative Procrustes alignment with the EM algorithm
  420. Estimating facial pose using shape-from-shading
  421. Empirical Modelling of Genetic Algorithms
  422. GABOR POPULATION CODES FOR ORIENTATION SELECTION
  423. Object recognition using shape-from-shading
  424. A Bayesian framework for 3D surface estimation
  425. Surface topography using shape-from-shading
  426. Least-commitment graph matching with genetic algorithms
  427. A Maximum Likelihood Framework for Grouping and Segmentation
  428. Efficiently Computing Weighted Tree Edit Distance Using Relaxation Labeling
  429. Shape from periodic texture using the eigenvectors of local affine distortion
  430. Structural graph matching using the EM algorithm and singular value decomposition
  431. Convergence of a hill-climbing genetic algorithm for graph matching
  432. Improved orientation estimation for texture planes using multiple vanishing points
  433. Bayesian graph edit distance
  434. Estimating the 3D orientation of texture planes using local spectral analysis
  435. Genetic algorithms for ambiguous labelling problems
  436. Bias–Variance Analysis for Controlling Adaptive Surface Meshes
  437. Tangent Fields from Population Coding
  438. A mixture model for pose clustering
  439. Shape recognition from large image libraries by inexact graph matching
  440. Graph matching with hierarchical discrete relaxation
  441. Consistent topographic surface labelling
  442. Deterministic search for relational graph matching
  443. Corner detection via topographic analysis of vector-potential
  444. Needle map recovery using robust regularizers
  445. Scale space vector fields for symmetry detection
  446. Convergence of a Hill Climbing Genetic Algorithm for Graph Matching
  447. New constraints on data-closeness and needle map consistency for shape-from-shading
  448. Energy Minimization Methods in Computer Vision and Pattern Recognition
  449. Storage capacity of the exponential correlation associative memory
  450. Topographic Surface Structure from 2D Images Using Shape-from-Shading
  451. SYMBOLIC GRAPH MATCHING WITH THE EM ALGORITHM
  452. An Energy Function and Continuous Edit Process for Graph Matching
  453. Structural Matching with Active Triangulations
  454. Recognising building patterns using matched filters and genetic search
  455. A Bayesian interpretation for the exponential correlation associative memory
  456. Density propagation for surface tracking
  457. Bias-variance tradeoff for adaptive surface meshes
  458. Graph matching with a dual-step EM algorithm
  459. Holistic matching
  460. Genetic algorithm parameter sets for line labelling
  461. Multiple graph matching with Bayesian inference
  462. Multiple line-template matching with the EM algorithm
  463. Inexact graph matching using genetic search
  464. Structural matching by discrete relaxation
  465. Iterative curve organisation with the EM algorithm
  466. An expectation-maximisation approach to graph matching
  467. Deterministic search strategies for relational graph matching
  468. Genetic algorithms for ambiguous labelling problems
  469. Image registration with shape mixtures
  470. Matching delaunay graphs
  471. Multi-sensor fusion with Bayesian inference
  472. Perspective matching using the EM algorithm
  473. Energy Minimization Methods in Computer Vision and Pattern Recognition
  474. Refining surface curvature with relaxation labeling
  475. A Bayesian compatibility model for graph matching
  476. An EM-like relaxation operator
  477. An analysis of the exponential correlation associative memory
  478. Hierarchical discrete relaxation
  479. Inexact graph matching with genetic search
  480. Iterative spline relaxation with the EM algorithm
  481. Relational matching with mean field annealing
  482. Sensitivity analysis for structural matching
  483. Feature tracking by multi-frame relaxation
  484. Relational matching by discrete relaxation
  485. Graph matching by discrete relaxation
  486. Feature Tracking by Multi-frame Relaxation
  487. Relaxation matching of road networks in aerial images using topological constraints
  488. Photoproduction of an isovector ρπ state at 1775 MeV
  489. 1st European Conference on Computer Vision (ECCV 90)
  490. Charge-exchange photoproduction of thea2−(1320)in association withΔ++at 19.3 GeV/c
  491. Discrete relaxation
  492. Edge-labeling using dictionary-based relaxation
  493. Production and decay properties of the ωπ0state at 1250 MeV/c2produced by 20-GeV polarized photons on hydrogen
  494. Forward charge asymmetry in 20-GeVgammapreactions
  495. Contextual decision rule for region analysis
  496. Lifetimes, cross sections, and production mechanisms of charmed particles produced by 20-GeV photons
  497. Inclusive photoproduction of strange baryons at 20 GeV
  498. Test ofs-channel helicity conservation in inelasticρ0diffraction in 20-GeV photoproduction
  499. Study of theρ′(1600)Mass Region Usingγp→π+π−pat 20 GeV
  500. Search for a threshold enhancement in theγp→charmed baryon + charmed meson cross section
  501. Charm photoproduction at 20 GeV
  502. Inclusive photoproduction of neutral strange particles at 20 GeV
  503. Charm Photoproduction Cross Section at 20 GeV
  504. Lifetimes of Charmed Particles Produced in a 20-GeVγpExperiment
  505. Facial Gender Classification Using Shape from Shading and Weighted Principal Geodesic Analysis
  506. Facial Shape Spaces from Surface Normals
  507. Measuring Graph Similarity Using Spectral Geometry
  508. Testing Viewpoint Invariance in the Neural Representation of Faces: An MEG Study
  509. Face Recognition using 2.5D Shape Information
  510. Polarization-based Surface Reconstruction via Patch Matching
  511. Correction of underexposed images using scene radiance estimation
  512. Estimating the surface radiance function from single images
  513. Facial view synthesis from a single image using shape from shading
  514. Surface height recovery from surface normals using manifold embedding
  515. Surface height recovery using heat flow and manifold embedding
  516. Surface normals and height from non-lambertian image data
  517. Surface radiance empirical data against model predictions
  518. Testing reflectance models against radiance data
  519. An eigenvector method for shape-from-shading
  520. Improving shape recovery by estimating properties of slightly-rough surfaces
  521. Pattern spaces from graph polynomials
  522. A hierarchical framework for modal correspondence matching
  523. A robust eigendecomposition framework for inexact graph-matching
  524. Maximum likelihood motion segmentation using eigendecomposition
  525. A radar reflectance model for terrain analysis using shape from shading
  526. A scale adaptive method for estimating the perspective pose of texture planes
  527. Bayesian graph edit distance
  528. Inexact graph retrieval
  529. Shape-from-shading using a curvature consistency constraint
  530. Surface topography using shape-from-shading
  531. Estimating vanishing point from the angular correlation of spectral texture distribution
  532. Noise models for linear feature detection in SAR images
  533. Pyramidal hierarchical relaxation
  534. Multiresolution edge labelling using hierarchical relaxation
  535. Relaxational refinement of intensity ridges