![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
SCVMA 2004: Prague, Czech Republic
- W. James MacLean:
Spatial Coherence for Visual Motion Analysis, First International Workshop, SCVMA 2004, Prague, Czech Republic, May 15, 2004, Revised Papers. Lecture Notes in Computer Science 3667, Springer 2006, ISBN 3-540-32533-6 - Patrick Bouthemy:
2D Motion Description and Contextual Motion Analysis: Issues and New Models. 1-15 - Serge J. Belongie
, Josh Wills:
Structure from Periodic Motion. 16-24 - Dana Cobzas, Martin Jägersand:
3D SSD Tracking from Uncalibrated Video. 25-37 - Hendrik Dahlkamp, Artur Ottlik, Hans-Hellmut Nagel:
Comparison of Edge-Driven Algorithms for Model-Based Motion Estimation. 38-50 - Adrian Barbu, Song Chun Zhu:
On the Relationship Between Image and Motion Segmentation. 51-63 - Cédric Demonceaux
, Djemâa Kachi-Akkouche:
Motion Detection Using Wavelet Analysis and Hierarchical Markov Models. 64-75 - Vishal Jain, Benjamin B. Kimia, Joseph L. Mundy:
Segregation of Moving Objects Using Elastic Matching. 76-90 - Ivan Laptev, Tony Lindeberg
:
Local Descriptors for Spatio-temporal Recognition. 91-103 - Anitha Kannan, Brendan J. Frey, Nebojsa Jojic:
A Generative Model of Dense Optical Flow in Layers. 104-114 - Mircea Nicolescu, Changki Min, Gérard G. Medioni:
Analysis and Interpretation of Multiple Motions Through Surface Saliency. 115-126 - Kevin Köser, Christian Perwass, Gerald Sommer:
Dense Optic Flow with a Bayesian Occlusion Model. 127-139
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.