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.

Charles Galambos

dblp:37/3110 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2000
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author

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
1 paper
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing › feature detection
hough transform
0.011999
Progressive Probabilistic Hough Transform for Line Detection · CVPR 1999
Image and video processing › edge detection
line detection
0.011999
Progressive Probabilistic Hough Transform for Line Detection · CVPR 1999
Image and video processing
real-time image processing
0.011999
Progressive Probabilistic Hough Transform for Line Detection · CVPR 1999

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

progressive line detection · 0.0probabilistic voting · 0.0
YearPublicationVenuePosition
2000 Using Gradient Information to Enhance the Progressive Probabilistic Hough Transform
abstract
We look at the benefits to be gained in using gradient information to enhance the progressive probabilistic Hough transform (PPHT). It is shown how using the angle information in controlling the voting process and in assigning pixels correctly to a line, PPHT's performance can be significantly improved. The improved algorithm gives results very close to that of the standard Hough transform, but requires significantly less computation.
Charles Galambos, Josef Kittler, Jiri Matas
ICPR1
2000 Robust Detection of Lines Using the Progressive Probabilistic Hough Transform
Jiri Matas, Charles Galambos, Josef Kittler
Comput. Vis. Image Underst.2
1999 Progressive Probabilistic Hough Transform for Line Detection
abstract
We present a novel Hough Transform algorithm referred to as Progressive Probabilistic Hough Transform (PPHT). Unlike the Probabilistic HT where Standard HT is performed on a pre-selected fraction of input points, PPHT minimises the amount of computation needed to detect lines by exploiting the difference an the fraction of votes needed to detect reliably lines with different numbers of supporting points. The fraction of points used for voting need not be specified ad hoc or using a priori knowledge, as in the probabilistic HT; it is a function of the inherent complexity of the input data. The algorithm is ideally suited for real-time applications with a fixed amount of available processing time, since voting and line detection is interleaved. The most salient features are likely to be detected first. Experiments show that in many circumstances PPHT has advantages over the Standard HT.
Charles Galambos, Josef Kittler, Jiri Matas
CVPR1
1998 Progressive Probabilistic Hough Transform
abstract
In the paper we present the Progressive Probabilistic Hough Transform (PPHT). Unlike the Probabilistic Hough Transform [4] where Standard Hough Transform is performed on a pre-selected fraction of input points, PPHT minimises the amount of computation needed to detect lines by exploiting the difference in the fraction of votes needed to reliably detect lines with different numbers of supporting points. The fraction of points used for voting need not be specified ad hoc or using a priori knowledge, as in the Probabilistic Hough Transform; it is a function of the inherent complexity of data. The algorithm is ideally suited for real-time applications with a fixed amount of available processing time, since voting and line detection is interleaved. The most salient features are likely to be detected first. Experiments show PPHT has, in many circumstances, advantages over the Standard Hough Transform. 1 Introduction The Hough Transform (HT) is a popular method for the extracti...
Jiri Matas, Charles Galambos, Josef Kittler
BMVC2