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

Jeff Ford

dblp:38/4385 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
1since 2021 · last 2023
—ORCID · none

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

Theory of computation · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%
Artificial intelligence
1 paper
3D vision · 100%
Theoretical computer science
1 paper
Computational complexity · 67% Combinatorics and discrete mathematics · 33%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › point cloud processing
LiDAR data processing
0.712023
Lossless SIMD Compression of LiDAR Range and Attribute Scan Sequences · ICRA 2023
Storage systems
data compression
0.712023
Lossless SIMD Compression of LiDAR Range and Attribute Scan Sequences · ICRA 2023
Storage systems › data compression
lossless compression
0.712023
Lossless SIMD Compression of LiDAR Range and Attribute Scan Sequences · ICRA 2023
Computational complexity
communication complexity
0.112005
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity · ICALP 2005
Computational complexity › communication complexity
multiparty communication complexity
0.112005
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity · ICALP 2005

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

spatiotemporal redundancy exploitation · 1.3SIMD instructions · 1.3
YearPublicationVenuePosition
2023 Lossless SIMD Compression of LiDAR Range and Attribute Scan Sequences
abstract
As LiDAR sensors have become ubiquitous, the need for an efficient LiDAR data compression algorithm has increased. Modern LiDARs produce gigabytes of scan data per hour (Fig. 1) and are often used in applications with limited compute, bandwidth, and storage resources. We present a fast, lossless compression algorithm for Li-DAR range and attribute scan sequences including multiple-return range, signal, reflectivity, and ambient infrared. Our algorithm—dubbed “Jiffy”—achieves substantial compression by exploiting spatiotemporal redundancy and sparsity. Speed is accomplished by maximizing use of single-instruction-multiple-data (SIMD) instructions. In autonomous driving, infrastructure monitoring, drone inspection, and handheld mapping benchmarks, the Jiffy algorithm consistently outcompresses competing lossless codecs while operating at speeds in excess of 65M points/sec on a single core. In a typical autonomous vehicle use case, single-threaded Jiffy achieves 6x compression of centimeter-precision range scans at 500+ scans per second. To ensure reproducibility and enable adoption, the software is freely available as an open source library33Software is available here: http://github.com/jsford64/jiffy-compression.
Jeff Ford, Jordan Ford
ICRA1
2013 Hadamard tensors and lower bounds on multiparty communication complexity
Jeff Ford, Anna Gál
Comput. Complex.1
2005 Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity
Jeff Ford, Anna Gál
ICALP1