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

Pierre Clarot

dblp:66/9233 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 1

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
Multimedia analysis and retrieval · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Multimedia analysis and retrieval
activity recognition
0.112010
Activity Based Matching in Distributed Camera Networks · IEEE Trans. Image Process. 2010
Multimedia analysis and retrieval
video analysis
0.112010
Activity Based Matching in Distributed Camera Networks · IEEE Trans. Image Process. 2010
Distributed systems › distributed multimedia systems
distributed camera network
0.012010
Activity Based Matching in Distributed Camera Networks · IEEE Trans. Image Process. 2010

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

activity features · 0.2SIFT · 0.2
YearPublicationVenuePosition
2010 Activity Based Matching in Distributed Camera Networks
abstract
In this paper, we consider the problem of finding correspondences between distributed cameras that have partially overlapping field of views. When multiple cameras with adaptable orientations and zooms are deployed, as in many wide area surveillance applications, identifying correspondence between different activities becomes a fundamental issue. We propose a correspondence method based upon activity features that, unlike photometric features, have certain geometry independence properties. The proposed method is robust to pose, illumination and geometric effects, unsupervised (does not require any calibration objects). In addition, these features are amenable to low communication bandwidth and distributed network applications. We present quantitative and qualitative results with synthetic and real life examples, and compare the proposed method with scale invariant feature transform (SIFT) based method. We show that our method significantly outperforms the SIFT method when cameras have significantly different orientations. We then describe extensions of our method in a number of directions including topology reconstruction, camera calibration, and distributed anomaly detection.
Erhan Baki Ermis, Pierre Clarot, Pierre-Marc Jodoin, Venkatesh Saligrama
IEEE Trans. Image Process.2