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

Ian Martin

dblp:59/3948 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · unresolved

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

Artificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 2Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

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
2 papers
Trustworthy machine learning · 39% Kernel, tree and ensemble methods · 39% Segmentation and scene understanding · 22%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › Segmentation and scene understanding › image segmentation
texture segmentation
0.112006
Patch-Based Texture Edges and Segmentation · ECCV (2) 2006
Machine learning › Kernel, tree and ensemble methods › ensemble learning
boosting
0.112005
Robust Boosting for Learning from Few Examples · CVPR (1) 2005
Machine learning › Kernel, tree and ensemble methods
ensemble learning
0.112005
Robust Boosting for Learning from Few Examples · CVPR (1) 2005
Machine learning › Trustworthy machine learning › robustness › robust learning
robust classification
0.112005
Robust Boosting for Learning from Few Examples · CVPR (1) 2005
Machine learning › Trustworthy machine learning
robustness
0.112005
Robust Boosting for Learning from Few Examples · CVPR (1) 2005
Coding theory › error-correcting codes › decoding › decoding algorithms › optimal decoding
maximum-likelihood decoding
0.011999
On the Rectangularity of Nonlinear Block Codes · IEEE Trans. Inf. Theory 1999
Coding theory › error-correcting codes › convolutional codes › trellis complexity
minimal trellis
0.011999
On the Rectangularity of Nonlinear Block Codes · IEEE Trans. Inf. Theory 1999
Coding theory › error-correcting codes › block codes
nonlinear block code
0.011999
On the Rectangularity of Nonlinear Block Codes · IEEE Trans. Inf. Theory 1999
Coding theory › error-correcting codes › decoding
soft-decision decoding
0.011999
On the Rectangularity of Nonlinear Block Codes · IEEE Trans. Inf. Theory 1999

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

patch-based texture edges · 0.1gentle boosting · 0.1data augmentation · 0.1
YearPublicationVenuePosition
2024 Multisatellite Altimetry Calibration and Validation Using a GNSS Wave Glider in the North Sea
abstract
The concept of in situ multisatellite altimetry calibration and validation in the absolute sense using ocean autonomous surface vehicles as global navigation satellite systems (GNSS) platforms is demonstrated through an experiment in the North Sea during 2016. A Wave Glider (WG) equipped with geodetic GNSS traveled to locations ranging from 21 to 78 km from the coast to be directly under four Jason-series tracks and two CryoSat-2 tracks. 5-Hz sea surface heights (SSHs) were estimated from precise point positioning (PPP) mode processing of GPS+GLONASS data, together with hourly zenith wet tropospheric delays (ZWDs), and used as reference values for altimetry satellite measured SSH, tropospheric delay, and significant wave height (SWH). SSH biases obtained were −30 to −8 mm for Jason-2 using geophysical data record (GDR)-D products, −40 to +1 mm for Jason-3 using GDR-F products, and −29 and +18 mm for CryoSat-2 using SAR mode GOP baseline C products. These biases are almost commensurate with results from previous studies in other regions that used GNSS buoys or onshore GNSS reference stations with geoid and tide extrapolation. The Jason-2 and Jason-3 microwave radiometer (MWR)-measured ZWDs differed, respectively, by −15 and −10 mm on average from those measured by the GNSS WG. Root-mean-square SWH differences of 2–6 cm were obtained between Jason-2/3 and the co-located GNSS WG, and equivalent differences of 19–21 cm for CryoSat-2.
Nigel T. Penna, Philip Moore 0004, Miguel A. Morales Maqueda, Ian Martin, Paolo Cipollini, Jing Guo 0005, Peter R. Foden, David E. Gregg
IEEE Trans. Geosci. Remote. Sens.4
2006 Patch-Based Texture Edges and Segmentation
Lior Wolf, Sharon X. Huang, Ian Martin, Dimitris N. Metaxas
ECCV (2)3
2005 Robust Boosting for Learning from Few Examples
abstract
We present and analyze a novel regularization technique based on enhancing our dataset with corrupted copies of our original data. The motivation is that since the learning algorithm lacks information about which parts of the data are reliable, it has to make more robust classification functions. Using this framework, we propose a simple addition to the gentle boosting algorithm which enables it to work with only a few examples. We test this new algorithm on a variety of datasets and show convincing results.
Lior Wolf, Ian Martin
CVPR (1)2
1999 On the Rectangularity of Nonlinear Block Codes
abstract
We give simple sufficient conditions for a code to be rectangular and show that large families of well-known nonlinear codes are rectangular. These include Hadamard (1893), Levenshtein (1964), Delsarte-Goethals (1975), Kerdock (1972), and Nordstrom-Robinson (1967) codes. Being rectangular, each of these codes has a unique minimal trellis that can be used for soft-decision maximum-likelihood decoding.
Vladimir Sidorenko, Ian Martin, Bahram Honary
IEEE Trans. Inf. Theory2