2014
DOI: 10.1109/tits.2013.2283813
|View full text |Cite
|
Sign up to set email alerts
|

Evolving Bayesian Graph for Three-Dimensional Vehicle Model Building From Video

Abstract: Traffic videos often capture slowly changing views of moving vehicles. These different and incrementally related views provide visual cues for 3-D perception of the vehicles from 2-D videos. This paper focuses on 3-D model building of multiple vehicles with different shapes from a single generic 3-D vehicle model by incrementally accumulating evidences in streaming traffic videos collected from a single static uncalibrated camera. When we do not know a priori the class of the following vehicle to be seen (whic… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 44 publications
0
3
0
Order By: Relevance
“…It is worth noting that these probabilistic relationships can be quantified (because they are usually hidden in conditional probability density functions among nodes). Thus, descriptions and reasonings of uncertainty issues can be carried out through a uniform theoretical framework [ 138 ]. Moreover, by judging whether connections among each node are undirected or directed edges, graph methods can be divided into undirected and directed graphs.…”
Section: Applications Of Qualitative Ifd Approach In High-speed Trmentioning
confidence: 99%
“…It is worth noting that these probabilistic relationships can be quantified (because they are usually hidden in conditional probability density functions among nodes). Thus, descriptions and reasonings of uncertainty issues can be carried out through a uniform theoretical framework [ 138 ]. Moreover, by judging whether connections among each node are undirected or directed edges, graph methods can be divided into undirected and directed graphs.…”
Section: Applications Of Qualitative Ifd Approach In High-speed Trmentioning
confidence: 99%
“…The emergence of new groups as well as the growth, split, merge, and death of old groups can occur over time. As compared to the other algorithms, modularity based approaches have been demonstrated to be the most effective in finding good partitions in an efficient manner in large networks, and they can address weighting, overlapping and evolving problems in a network [57], therefore, we adopt modularity-based approach in our work to find the social groups from tracklet interaction networks.…”
Section: Finding Social Groups In Networkmentioning
confidence: 99%
“…The size of a group may change dynamically as people join and leave the group, but a group of any size can always be considered as a set of elementary groups. Therefore, focusing on finding elementary groups instead of the complete group makes our approach capable of modeling flexible group evolution [11] in the real world. Note that the social group in this paper refers to a number of individuals with correlated movements and does not indicate a group of people who know each other.…”
Section: Introductionmentioning
confidence: 99%