Symmetry Measure Computation for Convex PolyhedraJournal of Mathematical Imaging and Vision - - 2002
Alexander V. Tuzikov, Stanislav A. Sheynin
The paper discusses measures and indices of different kind of symmetry (central, reflection, rotation, mirror rotation) for 3D convex shapes. The measures are based on Minkowski addition and inequalities for volume and mixed volume and are valid for convex shapes only. Symmetry index computation in 3D case is a complicated optimization problem. Taking advantage of convex polyhedra we investigate t...... hiện toàn bộ
EditorialJournal of Mathematical Imaging and Vision - Tập 7 - Trang 5-5 - 1997
Gerhard X. Ritter
An Algebraic Proof of the Necessary and Sufficient Condition for a P3P Problem Having a Pair of Point-Sharing SolutionsJournal of Mathematical Imaging and Vision - Tập 63 - Trang 1179-1184 - 2021
Lihua Hu, Jifu Zhang, Xiaoming Li
Recently in this journal, Wang et al. (J Math Imaging Vis 62(5): 1214–1226, 2020) reported an interesting multi-solution phenomenon in P3P (perspective-3-point) problem: A pair of point-sharing solutions appears always in companionship with a pair of side-sharing solutions, and they also gave the necessary and sufficient condition for the existence of such solution pairs. Although the conclusions ...... hiện toàn bộ
Component-Trees and Multivalued Images: Structural PropertiesJournal of Mathematical Imaging and Vision - Tập 49 - Trang 37-50 - 2013
Nicolas Passat, Benoît Naegel
Component-trees model the structure of grey-level images by considering their binary level-sets obtained from successive thresholdings. They also enable to define anti-extensive filtering procedures for such images. In order to extend this image processing approach to any (grey-level or multivalued) images, both the notion of component-tree, and its associated filtering framework, have to be gener...... hiện toàn bộ
A Multi-Orientation Analysis Approach to Retinal Vessel TrackingJournal of Mathematical Imaging and Vision - Tập 49 - Trang 583-610 - 2014
Erik Bekkers, Remco Duits, Tos Berendschot, Bart ter Haar Romeny
This paper presents a method for retinal vasculature extraction based on biologically inspired multi-orientation analysis. We apply multi-orientation analysis via so-called invertible orientation scores, modeling the cortical columns in the visual system of higher mammals. This allows us to generically deal with many hitherto complex problems inherent to vessel tracking, such as crossings, bifurca...... hiện toàn bộ
EditorialJournal of Mathematical Imaging and Vision - Tập 1 - Trang 5-5 - 1992
Two-Dimensional Compact Variational Mode DecompositionJournal of Mathematical Imaging and Vision - Tập 58 - Trang 294-320 - 2017
Dominique Zosso, Konstantin Dragomiretskiy, Andrea L. Bertozzi, Paul S. Weiss
Decomposing multidimensional signals, such as images, into spatially compact, potentially overlapping modes of essentially wavelike nature makes these components accessible for further downstream analysis. This decomposition enables space–frequency analysis, demodulation, estimation of local orientation, edge and corner detection, texture analysis, denoising, inpainting, or curvature estimation. O...... hiện toàn bộ
Temporal Huber Regularization for DCE-MRIJournal of Mathematical Imaging and Vision - Tập 62 - Trang 1334-1346 - 2020
Matti Hanhela, Mikko Kettunen, Olli Gröhn, Marko Vauhkonen, Ville Kolehmainen
Dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI) is used to study microvascular structure and tissue perfusion. In DCE-MRI, a bolus of gadolinium-based contrast agent is injected into the blood stream and spatiotemporal changes induced by the contrast agent flow are estimated from a time series of MRI data. Sufficient time resolution can often only be obtained by using an imaging pro...... hiện toàn bộ
Explicit Embeddings for Nearest Neighbor Search with Mercer KernelsJournal of Mathematical Imaging and Vision - Tập 52 - Trang 459-468 - 2015
Anthony Bourrier, Florent Perronnin, Rémi Gribonval, Patrick Pérez, Hervé Jégou
Many approximate nearest neighbor search algorithms operate under memory constraints, by computing short signatures for database vectors while roughly keeping the neighborhoods for the distance of interest. Encoding procedures designed for the Euclidean distance have attracted much attention in the last decade. In the case where the distance of interest is based on a Mercer kernel, we propose a si...... hiện toàn bộ