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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daniel Munoz

dblp:95/7658 · DBLP profile ↗
← Back
13ranked-venue papers
5as first author
0since 2021 · last 2014
—ORCID · none

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

Artificial intelligence and machine learning · 9 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 5 · 3 first-authorSystems, architecture and hardware · 4 · 1 first-authorComputer networks · 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.

Artificial intelligence
9 papers
3D vision · 36% Segmentation and scene understanding · 14% Face, body and person analysis · 11%
Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 24 heaviest of 25, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › point cloud analysis
point cloud classification
0.542013
Efficient 3-D scene analysis from streaming data · ICRA 2013
Learning message-passing inference machines for structured prediction · CVPR 2011
Onboard contextual classification of 3-D point clouds with learned high-order Markov Random Fields · ICRA 2009
Computer vision › 3D vision
3d scene understanding
0.432013
Efficient 3-D scene analysis from streaming data · ICRA 2013
3-D scene analysis via sequenced predictions over points and regions · ICRA 2011
Onboard contextual classification of 3-D point clouds with learned high-order Markov Random Fields · ICRA 2009
Computer vision › Segmentation and scene understanding
semantic segmentation
0.332013
Efficient temporal consistency for streaming video scene analysis · ICRA 2013
3-D scene analysis via sequenced predictions over points and regions · ICRA 2011
Stacked Hierarchical Labeling · ECCV (6) 2010
Computer vision › Face, body and person analysis › human pose estimation
articulated pose estimation
0.212014
Pose Machines: Articulated Pose Estimation via Inference Machines · ECCV (2) 2014
Computer vision › Image recognition and object detection › image classification
contextual classification
0.222009
Onboard contextual classification of 3-D point clouds with learned high-order Markov Random Fields · ICRA 2009
Contextual classification with functional Max-Margin Markov Networks · CVPR 2009
Computer vision › Face, body and person analysis
human pose estimation
0.212014
Pose Machines: Articulated Pose Estimation via Inference Machines · ECCV (2) 2014
Machine learning › Efficient and distributed learning
inference systems
0.212014
Pose Machines: Articulated Pose Estimation via Inference Machines · ECCV (2) 2014
Machine learning › Time series and sequential data
streaming data
0.212013
Efficient 3-D scene analysis from streaming data · ICRA 2013
Computer vision › Video understanding and tracking › temporal modeling
temporal consistency
0.212013
Efficient temporal consistency for streaming video scene analysis · ICRA 2013
Computer vision › Segmentation and scene understanding › video segmentation
video semantic segmentation
0.212013
Efficient temporal consistency for streaming video scene analysis · ICRA 2013
Computer vision › 3D vision
multimodal scene understanding
0.112012
Co-inference for Multi-modal Scene Analysis · ECCV (6) 2012
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
approximate inference
0.112011
Learning message-passing inference machines for structured prediction · CVPR 2011
Machine learning › Graph learning › graph neural network › message passing
message passing inference
0.112011
Learning message-passing inference machines for structured prediction · CVPR 2011
Computer vision › 3D vision › point cloud segmentation
point cloud semantic segmentation
0.112011
3-D scene analysis via sequenced predictions over points and regions · ICRA 2011
Machine learning › Probabilistic and Bayesian machine learning
structured prediction
0.112011
Learning message-passing inference machines for structured prediction · CVPR 2011
Computer vision › Image recognition and object detection › image classification
hierarchical classification
0.112010
Stacked Hierarchical Labeling · ECCV (6) 2010
Physical-layer communications
channel estimation
0.112010
Pilot Designs for Channel Estimation of MIMO OFDM Systems with Frequency-Dependent I/Q Imbalances · IEEE Trans. Commun. 2010
Physical-layer communications › channel estimation › OFDM channel estimation
MIMO-OFDM channel estimation
0.112010
Pilot Designs for Channel Estimation of MIMO OFDM Systems with Frequency-Dependent I/Q Imbalances · IEEE Trans. Commun. 2010
Physical-layer communications › receiver design
RF impairment compensation
0.112010
Pilot Designs for Channel Estimation of MIMO OFDM Systems with Frequency-Dependent I/Q Imbalances · IEEE Trans. Commun. 2010
Robotics › Robot navigation and mapping › robot mapping
environment modeling
0.112009
Onboard contextual classification of 3-D point clouds with learned high-order Markov Random Fields · ICRA 2009
Computer vision › Vision and language
multimodal fusion
0.012012
Co-inference for Multi-modal Scene Analysis · ECCV (6) 2012
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
belief propagation
0.012011
Learning message-passing inference machines for structured prediction · CVPR 2011
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
graphical model inference
0.012011
Learning message-passing inference machines for structured prediction · CVPR 2011
Computer vision › 3D vision › 3d shape reconstruction
surface recovery
0.012009
Contextual classification with functional Max-Margin Markov Networks · CVPR 2009

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

markov random field · 0.2inference machines · 0.2visual similarity learning · 0.2structured prediction · 0.2filtering · 0.2co-inference · 0.1predictor composition · 0.1multi-stage inference · 0.1message-passing algorithm · 0.1graphical model · 0.1pilot design · 0.1mean-squared error optimization · 0.1
YearPublicationVenuePosition
2014 Pose Machines: Articulated Pose Estimation via Inference Machines
Varun Ramakrishna, Daniel Munoz, Martial Hebert, J. Andrew Bagnell, Yaser Sheikh
ECCV (2)2
2013 Efficient 3-D scene analysis from streaming data
abstract
Rich scene understanding from 3-D point clouds is a challenging task that requires contextual reasoning, which is typically computationally expensive. The task is further complicated when we expect the scene analysis algorithm to also efficiently handle data that is continuously streamed from a sensor on a mobile robot. Hence, we are typically forced to make a choice between 1) using a precise representation of the scene at the cost of speed, or 2) making fast, though inaccurate, approximations at the cost of increased misclassifications. In this work, we demonstrate that we can achieve the best of both worlds by using an efficient and simple representation of the scene in conjunction with recent developments in structured prediction in order to obtain both efficient and state-of-the-art classifications. Furthermore, this efficient scene representation naturally handles streaming data and provides a 300% to 500% speedup over more precise representations.
Hanzhang Hu, Daniel Munoz, J. Andrew Bagnell, Martial Hebert
ICRA2
2013 Efficient temporal consistency for streaming video scene analysis
abstract
We address the problem of image-based scene analysis from streaming video, as would be seen from a moving platform, in order to efficiently generate spatially and temporally consistent predictions of semantic categories over time. In contrast to previous techniques which typically address this problem in batch and/or through graphical models, we demonstrate that by learning visual similarities between pixels across frames, a simple filtering algorithfiltering algorithmm is able to achieve high performance predictions in an efficient and online/causal manner. Our technique is a meta-algorithm that can be efficiently wrapped around any scene analysis technique that produces a per-pixel semantic category distribution. We validate our approach over three different scene analysis techniques on three different datasets that contain different semantic object categories. Our experiments demonstrate that our approach is very efficient in practice and substantially improves the consistency of the predictions over time.
Ondrej Miksik, Daniel Munoz, J. Andrew Bagnell, Martial Hebert
ICRA2
2012 Co-inference for Multi-modal Scene Analysis
Daniel Munoz, J. Andrew Bagnell, Martial Hebert
ECCV (6)1
2011 Learning message-passing inference machines for structured prediction
abstract
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models provide a clean separation between modeling and inference, learning these models with approximate inference is not well understood. Furthermore, even if a good model is learned, predictions are often inaccurate due to approximations. In this work, instead of performing inference over a graphical model, we instead consider the inference procedure as a composition of predictors. Specifically, we focus on message-passing algorithms, such as Belief Propagation, and show how they can be viewed as procedures that sequentially predict label distributions at each node over a graph. Given labeled graphs, we can then train the sequence of predictors to output the correct labeling s. The result no longer corresponds to a graphical model but simply defines an inference procedure, with strong theoretical properties, that can be used to classify new graphs. We demonstrate the scalability and efficacy of our approach on 3D point cloud classification and 3D surface estimation from single images.
Stéphane Ross, Daniel Munoz, Martial Hebert, J. Andrew Bagnell
CVPR2
2011 3-D scene analysis via sequenced predictions over points and regions
abstract
We address the problem of understanding scenes from 3-D laser scans via per-point assignment of semantic labels. In order to mitigate the difficulties of using a graphical model for modeling the contextual relationships among the 3-D points, we instead propose a multi-stage inference procedure to capture these relationships. More specifically, we train this procedure to use point cloud statistics and learn relational information (e.g., tree-trunks are below vegetation) over fine (point-wise) and coarse (region-wise) scales. We evaluate our approach on three different datasets, that were obtained from different sensors, and demonstrate improved performance.
Xuehan Xiong, Daniel Munoz, J. Andrew Bagnell, Martial Hebert
ICRA2
2010 Stacked Hierarchical Labeling
Daniel Munoz, J. Andrew Bagnell, Martial Hebert
ECCV (6)1
2010 Pilot Designs for Channel Estimation of MIMO OFDM Systems with Frequency-Dependent I/Q Imbalances
abstract
Multiple input multiple output (MIMO) orthogonal frequency division multiplexing (OFDM) systems facilitate high data rate wireless communications, and require reliable channel estimates to fully materialize their advantages. The semiconductor downscaling trend has exacerbated device impairments such as inphase and quadrature (I/Q) imbalances which cause inter-carrier interferences in OFDM systems which cannot be remedied by increasing signal power. Different RF chains of MIMO branches can cause different I/Q imbalances which further complicates MIMO OFDM channel estimation. This paper proposes several pilot designs for the estimation of the combined responses of MIMO frequency-selective channels and frequency-dependent I/Q imbalances. The proposed designs require much smaller pilot overhead than the existing designs, and also provide estimation mean-squares error optimality (under white noise) and general applicability to preamble as well as pilot-data-multiplexed symbols in MIMO systems with or without null guard tones. Performance analyses and simulation results corroborate advantages of the proposed designs.
Hlaing Minn, Daniel Munoz
IEEE Trans. Commun.2
2009 Contextual classification with functional Max-Margin Markov Networks
abstract
We address the problem of label assignment in computer vision: given a novel 3D or 2D scene, we wish to assign a unique label to every site (voxel, pixel, superpixel, etc.). To this end, the Markov Random Field framework has proven to be a model of choice as it uses contextual information to yield improved classification results over locally independent classifiers. In this work we adapt a functional gradient approach for learning high-dimensional parameters of random fields in order to perform discrete, multi-label classification. With this approach we can learn robust models involving high-order interactions better than the previously used learning method. We validate the approach in the context of point cloud classification and improve the state of the art. In addition, we successfully demonstrate the generality of the approach on the challenging vision problem of recovering 3-D geometric surfaces from images.
Daniel Munoz, J. Andrew Bagnell, Nicolas Vandapel, Martial Hebert
CVPR1
2009 Effect of I/Q Imbalance on Pilot Design for MIMO OFDM Channel Estimation
abstract
Efficient pilot designs are vital as they improve system performance and resource utilization, especially in multi-input multi-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems. Most of the existing pilot designs do not consider in-phase and quadrature (I/Q) imbalance whose detrimental effects become more severe since the technology and applications are pushing towards smaller semiconductor node, smaller chip, cheaper equipment, and larger modulation order. This paper studies the impact of I/Q imbalance on the pilot designs, and presents several new pilot designs for equivalent channel estimation of MIMO OFDM systems with frequency-dependent I/Q imbalances. Advantages of the proposed designs are illustrated through simulation and analytical results in terms of estimation accuracy, error rate, overhead efficiency, and generality with the transmission formats (preamble-based or pilot-data-multiplexed systems, with or without null guard tones).
Hlaing Minn, Daniel Munoz
GLOBECOM2
2009 Onboard contextual classification of 3-D point clouds with learned high-order Markov Random Fields
abstract
Contextual reasoning through graphical models such as Markov random fields often show superior performance against local classifiers in many domains. Unfortunately, this performance increase is often at the cost of time consuming, memory intensive learning and slow inference at testing time. Structured prediction for 3-D point cloud classification is one example of such an application. In this paper we present two contributions. First we show how efficient learning of a random field with higher-order cliques can be achieved using subgradient optimization. Second, we present a context approximation using random fields with high-order cliques designed to make this model usable online, onboard a mobile vehicle for environment modeling. We obtained results with the mobile vehicle on a variety of terrains, at 1/3 Hz for a map 25 times 50 meters and a vehicle speed of 1-2 m/s.
Daniel Munoz, Nicolas Vandapel, Martial Hebert
ICRA1
2009 Pilot Designs with Guard Bands for Channel Estimation of MIMOOFDM Systems with Frequency-Dependent I/Q Imbalances
abstract
All practical OFDM systems insert null guard bands to facilitate easy filter implementation and emission spectrum control. The null guard bands introduce a constraint for optimal pilot designs in MIMO OFDM systems. Semiconductor downscaling and the use of high modulation order have signified the importance of pilot designs for OFDM systems in the presence of I/Q imbalances, but existing designs have not addressed the use of guard bands, the overhead efficiency, the estimation optimality, and general applicability in pilot data multiplexed format and/or MIMO setup. This paper proposes a pilot design for channel estimation of MIMO OFDM systems with guard bands and both transmit and receive frequency-dependent I/Q imbalances, which overcomes the limitations of the existing designs. Simulation and numerical results corroborate better performance, overhead advantage and applicability in pilot-data-multiplexed MIMO setup of the proposed design over the existing MIMO OFDM pilot design with I/Q imbalances.
Daniel Munoz, Hlaing Minn
VTC Fall1
2009 Pilot designs for channel estimation of OFDM systems with frequency-dependent I/Q imbalances
abstract
The advances in semiconductor downscaling have empowered communication devices with significantly enhanced signal processing capability, but with the side effect of larger device impairments. Among those impairments, the I/Q imbalance is a critical one as it causes intercarrier interferences in orthogonal frequency division multiplexing (OFDM) systems. The I/Q imbalances in general exist at both transmitter and receiver, and they can be frequency-dependent. They may vary over time (e.g. due to sudden changes in temperature or the dynamics of the cooperating/relaying users). Under such scenarios, estimation and compensation of the combined effect of the channel and I/Q imbalances are crucial. This paper presents efficient pilot designs for such tasks. The advantages of the proposed designs over the existing ones in terms of estimation performance and overhead efficiency are corroborated by analysis and simulation results.
Hlaing Minn, Daniel Munoz
WCNC2