Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Luis Pizarro

dblp:00/6768 · DBLP profile ↗
← Back
12ranked-venue papers
3as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 8 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 6 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
4 papers
Image and video processing · 85% Geometric modeling and processing · 15%
Theoretical computer science
1 paper
Approximation and online algorithms · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing › mathematical morphology
adaptive mathematical morphology
0.112011
Adaptive Continuous-Scale Morphology for Matrix Fields · Int. J. Comput. Vis. 2011
Image and video processing
mathematical morphology
0.112011
Adaptive Continuous-Scale Morphology for Matrix Fields · Int. J. Comput. Vis. 2011
Image and video processing
perceptual grouping
0.112011
On Improving the Efficiency of Tensor Voting · IEEE Trans. Pattern Anal. Mach. Intell. 2011
Geometric modeling and processing
tensor voting
0.112011
On Improving the Efficiency of Tensor Voting · IEEE Trans. Pattern Anal. Mach. Intell. 2011
Approximation and online algorithms
approximation algorithms
0.112011
On Improving the Efficiency of Tensor Voting · IEEE Trans. Pattern Anal. Mach. Intell. 2011
Image and video processing › image filtering
image smoothing
0.112010
Generalised Nonlocal Image Smoothing · Int. J. Comput. Vis. 2010
Image and video processing › image restoration › image denoising
neighborhood filter denoising
0.112008
A Generic Neighbourhood Filtering Framework for Matrix Fields · ECCV (3) 2008

Methods — techniques the papers use, named apart from their topics

tensor voting · 0.2numerical approximation · 0.2continuous-scale morphology · 0.1variational method · 0.1non-local means · 0.1
YearPublicationVenuePosition
2016 PET Reconstruction With an Anatomical MRI Prior Using Parallel Level Sets
abstract
The combination of positron emission tomography (PET) and magnetic resonance imaging (MRI) offers unique possibilities. In this paper we aim to exploit the high spatial resolution of MRI to enhance the reconstruction of simultaneously acquired PET data. We propose a new prior to incorporate structural side information into a maximum a posteriori reconstruction. The new prior combines the strengths of previously proposed priors for the same problem: it is very efficient in guiding the reconstruction at edges available from the side information and it reduces locally to edge-preserving total variation in the degenerate case when no structural information is available. In addition, this prior is segmentation-free, convex and no a priori assumptions are made on the correlation of edge directions of the PET and MRI images. We present results for a simulated brain phantom and for real data acquired by the Siemens Biograph mMR for a hardware phantom and a clinical scan. The results from simulations show that the new prior has a better trade-off between enhancing common anatomical boundaries and preserving unique features than several other priors. Moreover, it has a better mean absolute bias-to-mean standard deviation trade-off and yields reconstructions with superior relative$\ell ^{2}$-error and structural similarity index. These findings are underpinned by the real data results from a hardware phantom and a clinical patient confirming that the new prior is capable of promoting well-defined anatomical boundaries.
Matthias J. Ehrhardt, Pawel J. Markiewicz, Maria Liljeroth, Anna Barnes, Ville Kolehmainen, John S. Duncan, Luis Pizarro, David Atkinson, Brian F. Hutton, Sébastien Ourselin, Kris Thielemans, Simon R. Arridge
IEEE Trans. Medical Imaging7
2015 Evaluating Imputation Techniques for Missing Data in ADNI: A Patient Classification Study
Sergio Campos, Luis Pizarro, Carlos Valle, Katherine R. Gray, Daniel Rueckert, Héctor Allende
CIARP2
2013 Temporal sparse free-form deformations
Wenzhe Shi, Martin Jantsch, Paul Aljabar, Luis Pizarro, Wenjia Bai, Haiyan Wang 0018, Declan P. O'Regan, Xiahai Zhuang, Daniel Rueckert
Medical Image Anal.4
2012 Registration Using Sparse Free-Form Deformations
Wenzhe Shi, Xiahai Zhuang, Luis Pizarro, Wenjia Bai, Haiyan Wang 0018, Kai-Pin Tung, Philip J. Edwards, Daniel Rueckert
MICCAI (2)3
2011 Adaptive Continuous-Scale Morphology for Matrix Fields
Bernhard Burgeth, Luis Pizarro, Michael Breuß, Joachim Weickert
Int. J. Comput. Vis.2
2011 On Improving the Efficiency of Tensor Voting
abstract
This paper proposes two alternative formulations to reduce the high computational complexity of tensor voting, a robust perceptual grouping technique used to extract salient information from noisy data. The first scheme consists of numerical approximations of the votes, which have been derived from an in-depth analysis of the plate and ball voting processes. The second scheme simplifies the formulation while keeping the same perceptual meaning of the original tensor voting: The stick tensor voting and the stick component of the plate tensor voting must reinforce surfaceness, the plate components of both the plate and ball tensor voting must boost curveness, whereas junctionness must be strengthened by the ball component of the ball tensor voting. Two new parameters have been proposed for the second formulation in order to control the potentially conflictive influence of the stick component of the plate vote and the ball component of the ball vote. Results show that the proposed formulations can be used in applications where efficiency is an issue since they have a complexity of order O(1). Moreover, the second proposed formulation has been shown to be more appropriate than the original tensor voting for estimating saliencies by appropriately setting the two new parameters.
Rodrigo Moreno, Miguel Ángel García, Domenec Puig, Luis Pizarro, Bernhard Burgeth, Joachim Weickert
IEEE Trans. Pattern Anal. Mach. Intell.4
2010 Dense Multi-frame Optic Flow for Non-rigid Objects Using Subspace Constraints
Ravi Garg, Luis Pizarro, Daniel Rueckert, Lourdes Agapito
ACCV (4)2
2010 Generalised Nonlocal Image Smoothing
Luis Pizarro, Pavel Mrázek, Stephan Didas, Sven Grewenig, Joachim Weickert
Int. J. Comput. Vis.1
2008 A Generic Neighbourhood Filtering Framework for Matrix Fields
Luis Pizarro, Bernhard Burgeth, Stephan Didas, Joachim Weickert
ECCV (3)1
2008 Robust automated multiple view inspection
Luis Pizarro, Domingo Mery, Rafael Delpiano, Miguel Carrasco
Pattern Anal. Appl.1
2007 Bimodal Biometric Person Identification System Under Perturbations
Miguel Carrasco, Luis Pizarro, Domingo Mery
PSIVT2
2003 Robust Estimation of Roughness Parameter in SAR Amplitude Images
Héctor Allende, Luis Pizarro
CIARP2