All Stories

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