The DOI matches its Crossref record; 104 of the 104 references it cites were found in a registry or an index.
Playing with Duality: An overview of recent primal?dual approaches for solving large-scale optimization problems
Open accessAbstract
Optimization methods are at the core of many problems in signal/image processing, computer vision, and machine learning. For a long time, it has been recognized that looking at the dual of an optimization problem may drastically simplify its solution. However, deriving efficient strategies that jointly bring into play the primal and dual problems is a more recent idea that has generated many important new contributions in recent years. These novel developments are grounded in the recent advances in convex analysis, discrete optimization, parallel processing, and nonsmooth optimization with an emphasis on sparsity issues. In this article, we aim to present the principles of primal-dual approaches while providing an overview of the numerical methods that have been proposed in different contexts. Last but not least, primal-dual methods lead to algorithms that are easily parallelizable. Today, such parallel algorithms are becoming increasingly important for efficiently handling high-dimensional problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
(1988) · Cited by 16,582
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
An Introduction To Compressive Sampling
Candes, E. J., & Wakin, M. B. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914731 · Cited by 10,017
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.969114 · Cited by 6,988
Nonrigid registration using free-form deformations: application to breast mr images
Rueckert, D., Sonoda, L. I., Hayes, C., Hill, D. L. G., Leach, M. O., & Hawkes, D. J. (1999) · IEEE Transactions on Medical Imaging · doi:10.1109/42.796284 · Cited by 5,265
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging
Chambolle, A., & Pock, T. (2011) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-010-0251-1 · Cited by 4,336
The Split Bregman Method for L1-Regularized Problems
Goldstein, T., & Osher, S. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080725891 · Cited by 4,282
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Combinatorial optimization:Algorithms and complexity
Rabiner, L. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164450 · Cited by 3,576
What energy functions can be minimized via graph cuts?
Kolmogorov, V., & Zabih, R. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1262177 · Cited by 3,127
Approximation Algorithms for NP-Hard Problems
(1997) · ACM SIGACT News · doi:10.1145/261342.571216 · Cited by 3,103
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Bauschke, H. H., & Combettes, P. L. (2011) · CMS Books in Mathematics · doi:10.1007/978-1-4419-9467-7 · Cited by 2,962
Eckstein, J., & Bertsekas, D. P. (1992) · Mathematical Programming · doi:10.1007/bf01581204 · Cited by 2,791
Introduction to linear optimization
Bertsimas, D., & Tsitsiklis, J. N. (1997) · Cited by 2,705
Signal Recovery by Proximal Forward-Backward Splitting
Combettes, P. L., & Wajs, V. R. (2005) · Multiscale Modeling & Simulation · doi:10.1137/050626090 · Cited by 2,678
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Gabay, D., & Mercier, B. (1976) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(76)90003-1 · Cited by 2,514
Proximal Splitting Methods in Signal Processing
Combettes, P. L., & Pesquet, J.-C. (2011) · Springer Optimization and Its Applications · doi:10.1007/978-1-4419-9569-8_10 · Cited by 2,183
Self-citationProximité et dualité dans un espace hilbertien
Moreau, J. J. (1965) · Bulletin de la Société mathématique de France · doi:10.24033/bsmf.1625 · Cited by 1,462
A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
Tseng, P. (2000) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012998338806 · Cited by 1,223
Convergent Tree-Reweighted Message Passing for Energy Minimization
Kolmogorov, V. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.200 · Cited by 1,095
Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., & Rother, C. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70844 · Cited by 966
Afonso, M. V., Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2076294 · Cited by 938
Condat, L. (2013) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-012-0245-9 · Cited by 912
Optimization for Machine Learning
(2011) · The MIT Press eBooks · doi:10.7551/mitpress/8996.001.0001 · Cited by 875
Boros, E., & Hammer, P. L. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00341-9 · Cited by 827
Markov Random Field Modeling in Image Analysis
(2009) · Advances in Pattern Recognition · doi:10.1007/978-1-84800-279-1 · Cited by 823
Afonso, M. V., Bioucas‐Dias, J. M., & Figueiredo, M. A. T. (2011) · Cited by 783
Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems
(1983) · Studies in Mathematics and Its Applications · doi:10.1016/s0168-2024(08)x7003-1 · Cited by 760
Optimization with Sparsity-Inducing Penalties
Bach, F., Jenatton, R., Mairal, J., & Obozinski, G. (2025) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000015 · Cited by 730
Esser, E., Zhang, X., & Chan, T. F. (2010) · SIAM Journal on Imaging Sciences · doi:10.1137/09076934x · Cited by 695
On the linear convergence of the alternating direction method of multipliers
Hong, M., & Luo, Z.-Q. (2017) · Mathematical Programming · doi:10.1007/s10107-016-1034-2 · Cited by 690
Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction
Zhang, X., Burger, M., Bresson, X., & Osher, S. (2010) · SIAM Journal on Imaging Sciences · doi:10.1137/090746379 · Cited by 688
MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
Wainwright, M. J., Jaakkola, T. S., & Willsky, A. S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.856938 · Cited by 654
Korte, B., & Vygen, J. (2000) · Algorithms and Combinatorics · doi:10.1007/978-3-662-21708-5_16 · Cited by 579
Machine Learning: A Bayesian and Optimization Perspective
Theodoridis, S. (2015) · Cited by 524
A Douglas–Rachford Splitting Approach to Nonsmooth Convex Variational Signal Recovery
Combettes, P. L., & Pesquet, J.-C. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910264 · Cited by 490
Self-citationSubgradient Methods for Saddle-Point Problems
Nedić, A., & Ozdaglar, A. (2009) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-009-9522-7 · Cited by 438
Dense image registration through MRFs and efficient linear programming
Glocker, B., Komodakis, N., Tziritas, G., Navab, N., & Paragios, N. (2008) · Medical Image Analysis · doi:10.1016/j.media.2008.03.006 · Cited by 427
Self-citationDiagonal preconditioning for first order primal-dual algorithms in convex optimization
Pock, T., & Chambolle, A. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126441 · Cited by 393
A proximal-based decomposition method for convex minimization problems
Chen, G., & Teboulle, M. (1994) · Mathematical Programming · doi:10.1007/bf01582566 · Cited by 392
He, B., & Yuan, X. (2012) · SIAM Journal on Imaging Sciences · doi:10.1137/100814494 · Cited by 378
Restoration of Poissonian Images Using Alternating Direction Optimization
Figueiredo, M. A. T., & Bioucas-Dias, J. M. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2053941 · Cited by 372
Combettes, P. L., & Pesquet, J.-C. (2011) · Set-Valued and Variational Analysis · doi:10.1007/s11228-011-0191-y · Cited by 371
Self-citationA Linear Programming Approach to Max-Sum Problem: A Review
Werner, T. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1036 · Cited by 342
Deblurring Poissonian images by split Bregman techniques
Setzer, S., Steidl, G., & Teuber, T. (2010) · Journal of Visual Communication and Image Representation · doi:10.1016/j.jvcir.2009.10.006 · Cited by 336
Restoration of Poissonian images using alternating direction optimization
Figueiredo, M. A. T., & Bioucas‐Dias, J. M. (2010) · Cited by 325
Markov Random Fields for Vision and Image Processing
(2011) · The MIT Press eBooks · doi:10.7551/mitpress/8579.001.0001 · Cited by 290
MRF Energy Minimization and Beyond via Dual Decomposition
Komodakis, N., Paragios, N., & Tziritas, G. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.108 · Cited by 277
Self-citationMRF Optimization via Dual Decomposition: Message-Passing Revisited
Komodakis, N., Paragios, N., & Tziritas, G. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408890 · Cited by 256
Self-citationA convex relaxation approach for computing minimal partitions
Pock, T., Chambolle, A., Cremers, D., & Bischof, H. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206604 · Cited by 253
A variational formulation for frame-based inverse problems
Chaux, C., Combettes, P. L., Pesquet, J.-C., & Wajs, V. R. (2007) · Inverse Problems · doi:10.1088/0266-5611/23/4/008 · Cited by 249
Self-citationApproximate Labeling via Graph Cuts Based on Linear Programming
Komodakis, N., & Tziritas, G. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1061 · Cited by 227
Self-citationChen, P., Huang, J., & Zhang, X. (2013) · Inverse Problems · doi:10.1088/0266-5611/29/2/025011 · Cited by 224
Motion Coherent Tracking Using Multi-label MRF Optimization
Tsai, D., Flagg, M., Nakazawa, A., & Rehg, J. M. (2012) · International Journal of Computer Vision · doi:10.1007/s11263-011-0512-5 · Cited by 216
Joint 3D Scene Reconstruction and Class Segmentation
Hane, C., Zach, C., Cohen, A., Angst, R., & Pollefeys, M. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.20 · Cited by 213
Wang, C., Komodakis, N., & Paragios, N. (2013) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2013.07.004 · Cited by 208
Self-citationA proximal decomposition method for solving convex variational inverse problems
Combettes, P. L., & Pesquet, J.-C. (2008) · Inverse Problems · doi:10.1088/0266-5611/24/6/065014 · Cited by 207
Self-citation9 A PROXIMAL DECOMPOSITION METHOD FOR SOLVING CONVEX VARIATIONAL INVERSE PROBLEMS∗
Combettes, P. L., Pesquet, J.-C., & Paris-est, U. (2009) · Cited by 203
Self-citationA Convex Formulation of Continuous Multi-label Problems
Pock, T., Schoenemann, T., Graber, G., Bischof, H., & Cremers, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88690-7_59 · Cited by 196
Deformable Medical Image Registration: Setting the State of the Art with Discrete Methods
Glocker, B., Sotiras, A., Komodakis, N., & Paragios, N. (2011) · Annual Review of Biomedical Engineering · doi:10.1146/annurev-bioeng-071910-124649 · Cited by 193
Self-citationA Comparative Study of Modern Inference Techniques for Discrete Energy Minimization Problems
Kappes, J. H., Andres, B., Hamprecht, F. A., Schnorr, C., Nowozin, S., Batra, D., Kim, S., Kausler, B. X., Lellmann, J., Komodakis, N., et al. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.175 · Cited by 187
Self-citationKomodakis, N., Tziritas, G., & Paragios, N. (2008) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2008.06.007 · Cited by 183
Self-citationBeyond pairwise energies: Efficient optimization for higher-order MRFs
Komodakis, N., & Paragios, N. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206846 · Cited by 179
Self-citationOptimal Transport with Proximal Splitting
Papadakis, N., Peyré, G., & Oudet, E. (2014) · SIAM Journal on Imaging Sciences · doi:10.1137/130920058 · Cited by 178
Diverse M-Best Solutions in Markov Random Fields
Batra, D., Yadollahpour, P., Guzman-Rivera, A., & Shakhnarovich, G. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33715-4_1 · Cited by 176
Linear Programming Relaxations and Belief Propagation -- An Empirical Study
Yanover, C., Meltzer, T., & Weiss, Y. (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248615 · Cited by 153
Parallel Proximal Algorithm for Image Restoration Using Hybrid Regularization
Pustelnik, N., Chaux, C., & Pesquet, J.-C. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2128335 · Cited by 150
Self-citationEfficiently selecting regions for scene understanding
Kumar, M., & Koller, D. (2010) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2010.5540072 · Cited by 128
Norm-Product Belief Propagation: Primal-Dual Message-Passing for Approximate Inference
Hazan, T., & Shashua, A. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2079014 · Cited by 124
Loris, I. (2011) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 122
Dualization of Signal Recovery Problems
Combettes, P. L., Dũng, Ð., & Vũ, B. C. (2010) · Set-Valued and Variational Analysis · doi:10.1007/s11228-010-0147-7 · Cited by 116
Loris, I., & Verhoeven, C. (2011) · Inverse Problems · doi:10.1088/0266-5611/27/12/125007 · Cited by 112
Chaâri, L., Pesquet, J.-C., Benazza‐Benyahia, A., & Ciuciu, P. (2010) · Medical Image Analysis · doi:10.1016/j.media.2010.08.001 · Cited by 112
Self-citationBoţ, R. I., & Hendrich, C. (2013) · SIAM Journal on Optimization · doi:10.1137/120901106 · Cited by 109
A Parallel Inertial Proximal Optimization Method
Pesquet, J.-C., & Pustelnik, N. (2012) · HAL · Cited by 97
Self-citationA Dual Decomposition Approach to Feature Correspondence
Torresani, L., Kolmogorov, V., & Rother, C. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.105 · Cited by 95
Beyond Loose LP-Relaxations: Optimizing MRFs by Repairing Cycles
Nikos Komodakis, A., & Nikos Paragios, A. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88690-7_60 · Cited by 86
On the Convergence of Primal–Dual Hybrid Gradient Algorithms for Total Variation Image Restoration
Bonettini, S., & Ruggiero, V. (2012) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-011-0324-9 · Cited by 86
Dual Constrained TV-based Regularization on Graphs
Couprie, C., Grady, L. J., Najman, L. A., Pesquet, J.-C., & Talbot, H. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/120895068 · Cited by 78
Self-citationBoţ, R. I., & Hendrich, C. (2014) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-013-0486-8 · Cited by 75
Reflection methods for user-friendly submodular optimizationPreprint
Jegelka, S., Bach, F., & Sra, S. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1311.4296 · Cited by 72
Optical flow estimation with uncertainties through dynamic MRFs
Glocker, B., Paragios, N., Komodakis, N., Tziritas, G., & Navab, N. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587562 · Cited by 69
Systems of Structured Monotone Inclusions: Duality, Algorithms, and Applications
Combettes, P. L. (2013) · SIAM Journal on Optimization · doi:10.1137/130904160 · Cited by 59
Empirical mode decomposition revisited by multicomponent non-smooth convex optimization
Pustelnik, N., Borgnat, P., & Flandrin, P. (2014) · Signal Processing · doi:10.1016/j.sigpro.2014.03.014 · Cited by 57
Deconvolution of Poissonian images using variable splitting and augmented Lagrangian optimization
Figueiredo, M. A. T., & Bioucas‐Dias, J. M. (2009) · IEEE Statistical Signal Processing Workshop (SSP) · doi:10.1109/ssp.2009.5278459 · Cited by 57
Proximal Reinforcement Learning: A New Theory of Sequential Decision Making in Primal-Dual SpacesPreprint
Mahadevan, S., Liu, B., Thomas, P. S., Dabney, W., Giguere, S., Jacek, N., Gemp, I., & Liu, J. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1405.6757 · Cited by 55
Stability and Performance Limits of Adaptive Primal-Dual Networks
Towfic, Z. J., & Sayed, A. H. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2415759 · Cited by 49
A Majorize-Minimize Memory Gradient method for complex-valued inverse problems
Florescu, A., Chouzenoux, É., Pesquet, J.-C., Ciuciu, P., & Ciochină, S. (2013) · Signal Processing · doi:10.1016/j.sigpro.2013.09.026 · Cited by 45
Self-citationNew algorithms for convex cost tension problem with application to computer vision
Kolmogorov, V., & Shioura, A. (2009) · Discrete Optimization · doi:10.1016/j.disopt.2009.04.006 · Cited by 41
Convergence Rate Analysis of the Forward-Douglas-Rachford Splitting Scheme
Davis, D. (2015) · SIAM Journal on Optimization · doi:10.1137/140992291 · Cited by 37
Harizanov, S., Pesquet, J.-C., & Steidl, G. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38267-3_11 · Cited by 35
Self-citationKahl, F., & Strandmark, P. (2012) · Discrete Applied Mathematics · doi:10.1016/j.dam.2012.06.009 · Cited by 31
Generalized roof duality and bisubmodular functions
Kolmogorov, V. (2011) · Discrete Applied Mathematics · doi:10.1016/j.dam.2011.10.026 · Cited by 27
MRF-Based Blind Image Deconvolution
Komodakis, N., & Nikos Paragios, A. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37431-9_28 · Cited by 23
Self-citationA Penalized Weighted Least Squares Approach For Restoring Data Corrupted With Signal-Dependent Noise
Chouzenoux, É., Pesquet, J.-C., & Repetti, A. (2012) · HAL (Le Centre pour la Communication Scientifique Directe) · doi:10.5281/zenodo.43154 · Cited by 22
Self-citationIntrinsic dense 3D surface tracking
Zeng, Y., Wang, C., Wang, Y., Gu, X., Samaras, D., & Paragios, N. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995513 · Cited by 19 · cited 1×
“More generally, due to the very wide applicability of MRF mod els to computer vision or image analysis problems, primal-dual approaches can and have been applied to a broad c lass of both low-level and high-level problems from these domains, including image segmentation [112]–[115], stereo matching and 3D multi-view r…”
Generic Cuts: An Efficient Algorithm for Optimal Inference in Higher Order MRF-MAP
Arora, C., Banerjee, S., Kalra, P. K., & Maheshwari, S. N. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33715-4_2 · Cited by 13
Osokin, A., Vetrov, D., & Kolmogorov, V. (2011) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2011.5995361 · Cited by 11
Cited by
Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
O’Donoghue, B., Chu, E., Parikh, N., & Boyd, S. (2016) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-016-0892-3 · Cited by 664
Visualizing big data with augmented and virtual reality: Challenges and research agenda
Olshannikova, E., Ometov, A., Koucheryavy, Y., & Olsson, T. (2015) · Journal of Big Data · doi:10.1186/s40537-015-0031-2 · Cited by 315
On the convergence of approximate message passing with arbitrary matrices
Rangan, S., Schniter, P., & Fletcher, A. (2014) · 2014 IEEE International Symposium on Information Theory · doi:10.1109/isit.2014.6874830 · Cited by 279
Flexible mobility on-demand: an environmental scan
Liyanage, S., Dia, H., Abduljabbar, R., & Bagloee, S. (2019) · Sustainability · doi:10.3390/su11051262 · Cited by 111
EMG-Based Automatic Gesture Recognition Using Lipschitz-Regularized Neural Networks
Neacşu, A., Pesquet, J.-C., & Burileanu, C. (2024) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3635159 · Cited by 15
Self-citation
Metadata
- Authors
- Komodakis, N., & Pesquet, J.-C.
- Venue
- IEEE Signal Processing Magazine
- Published
- 2015-11
- Volume
- 32
- Issue
- 6
- Pages
- 31-54
- ISSN
- 1053-5888 (ISSN-L)
- OpenAlex
- W1922442141
- Cited by
- 419
- References
- 104
- FWCI
- 41.74
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.