---
_id: '18348'
abstract:
- lang: eng
text: "We present a novel method for estimation of articulated motion in depth scans.
The method is based on a framework for regularization of vector- and matrix- valued
functions on parametric surfaces.\r\n\r\nWe extend augmented-Lagrangian total
variation regularization to smooth rigid motion cues on the scanned 3D surface
obtained from a range scanner. We demonstrate the resulting smoothed motion maps
to be a powerful tool in articulated scene understanding, providing a basis for
rigid parts segmentation, with little prior assumptions on the scene, despite
the noisy depth measurements that often appear in commodity depth scanners."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Guy
full_name: Rosman, Guy
last_name: Rosman
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Xue-Cheng
full_name: Tai, Xue-Cheng
last_name: Tai
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
citation:
ama: 'Rosman G, Bronstein AM, Bronstein MM, Tai X-C, Kimmel R. Group-valued regularization
for analysis of articulated motion. In: Computer Vision, ECCV 2012 - Workshops
and Demonstrations. Vol 7583. Springer Nature; 2012:52-62. doi:10.1007/978-3-642-33863-2_6'
apa: 'Rosman, G., Bronstein, A. M., Bronstein, M. M., Tai, X.-C., & Kimmel,
R. (2012). Group-valued regularization for analysis of articulated motion. In
Computer Vision, ECCV 2012 - Workshops and Demonstrations (Vol. 7583, pp.
52–62). Florence, Italy: Springer Nature. https://doi.org/10.1007/978-3-642-33863-2_6'
chicago: Rosman, Guy, Alex M. Bronstein, Michael M. Bronstein, Xue-Cheng Tai, and
Ron Kimmel. “Group-Valued Regularization for Analysis of Articulated Motion.”
In Computer Vision, ECCV 2012 - Workshops and Demonstrations, 7583:52–62.
Springer Nature, 2012. https://doi.org/10.1007/978-3-642-33863-2_6.
ieee: G. Rosman, A. M. Bronstein, M. M. Bronstein, X.-C. Tai, and R. Kimmel, “Group-valued
regularization for analysis of articulated motion,” in Computer Vision, ECCV
2012 - Workshops and Demonstrations, Florence, Italy, 2012, vol. 7583, no.
Part 1, pp. 52–62.
ista: 'Rosman G, Bronstein AM, Bronstein MM, Tai X-C, Kimmel R. 2012. Group-valued
regularization for analysis of articulated motion. Computer Vision, ECCV 2012
- Workshops and Demonstrations. ECCV: European Conference on Computer Vision,
LNCS, vol. 7583, 52–62.'
mla: Rosman, Guy, et al. “Group-Valued Regularization for Analysis of Articulated
Motion.” Computer Vision, ECCV 2012 - Workshops and Demonstrations, vol.
7583, no. Part 1, Springer Nature, 2012, pp. 52–62, doi:10.1007/978-3-642-33863-2_6.
short: G. Rosman, A.M. Bronstein, M.M. Bronstein, X.-C. Tai, R. Kimmel, in:, Computer
Vision, ECCV 2012 - Workshops and Demonstrations, Springer Nature, 2012, pp. 52–62.
conference:
end_date: 2012-10-13
location: Florence, Italy
name: 'ECCV: European Conference on Computer Vision'
start_date: 2012-10-07
date_created: 2024-10-15T11:20:54Z
date_published: 2012-08-31T00:00:00Z
date_updated: 2025-01-16T12:29:07Z
day: '31'
doi: 10.1007/978-3-642-33863-2_6
extern: '1'
intvolume: ' 7583'
issue: Part 1
language:
- iso: eng
month: '08'
oa_version: None
page: 52-62
publication: Computer Vision, ECCV 2012 - Workshops and Demonstrations
publication_identifier:
eisbn:
- '9783642338632'
eissn:
- 1611-3349
isbn:
- '9783642338625'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Group-valued regularization for analysis of articulated motion
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7583
year: '2012'
...
---
_id: '18349'
abstract:
- lang: eng
text: The rapid development of 3D acquisition technology has brought with itself
the need to perform standard signal processing operations such as filters on 3D
data. It has been shown that the eigenfunctions of the Laplace-Beltrami operator
(manifold harmonics) of a surface play the role of the Fourier basis in the Euclidean
space; it is thus possible to formulate signal analysis and synthesis in the manifold
harmonics basis. In particular, geometry filtering can be carried out in the manifold
harmonics domain by decomposing the embedding coordinates of the shape in this
basis. However, since the basis functions depend on the shape itself, such filtering
is valid only for weak (near all-pass) filters, and produces severe artifacts
otherwise. In this paper, we analyze this problem and propose the fractional filtering
approach, wherein we apply iteratively weak fractional powers of the filter, followed
by the update of the basis functions. Experimental results show that such a process
produces more plausible and meaningful results.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Artiom
full_name: Kovnatsky, Artiom
last_name: Kovnatsky
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
citation:
ama: 'Kovnatsky A, Bronstein MM, Bronstein AM. Stable Spectral Mesh Filtering. In:
Computer Vision, ECCV 2012 - Workshops and Demonstrations. Vol 7583. Springer
Nature; 2012:83-91. doi:10.1007/978-3-642-33863-2_9'
apa: 'Kovnatsky, A., Bronstein, M. M., & Bronstein, A. M. (2012). Stable Spectral
Mesh Filtering. In Computer Vision, ECCV 2012 - Workshops and Demonstrations
(Vol. 7583, pp. 83–91). Florence, Italy: Springer Nature. https://doi.org/10.1007/978-3-642-33863-2_9'
chicago: Kovnatsky, Artiom, Michael M. Bronstein, and Alex M. Bronstein. “Stable
Spectral Mesh Filtering.” In Computer Vision, ECCV 2012 - Workshops and Demonstrations,
7583:83–91. Springer Nature, 2012. https://doi.org/10.1007/978-3-642-33863-2_9.
ieee: A. Kovnatsky, M. M. Bronstein, and A. M. Bronstein, “Stable Spectral Mesh
Filtering,” in Computer Vision, ECCV 2012 - Workshops and Demonstrations,
Florence, Italy, 2012, vol. 7583, no. Part 1, pp. 83–91.
ista: 'Kovnatsky A, Bronstein MM, Bronstein AM. 2012. Stable Spectral Mesh Filtering.
Computer Vision, ECCV 2012 - Workshops and Demonstrations. ECCV: European Conference
on Computer Vision, LNCS, vol. 7583, 83–91.'
mla: Kovnatsky, Artiom, et al. “Stable Spectral Mesh Filtering.” Computer Vision,
ECCV 2012 - Workshops and Demonstrations, vol. 7583, no. Part 1, Springer
Nature, 2012, pp. 83–91, doi:10.1007/978-3-642-33863-2_9.
short: A. Kovnatsky, M.M. Bronstein, A.M. Bronstein, in:, Computer Vision, ECCV
2012 - Workshops and Demonstrations, Springer Nature, 2012, pp. 83–91.
conference:
end_date: 2012-10-13
location: Florence, Italy
name: 'ECCV: European Conference on Computer Vision'
start_date: 2012-10-07
date_created: 2024-10-15T11:20:54Z
date_published: 2012-08-31T00:00:00Z
date_updated: 2025-01-16T11:49:13Z
day: '31'
doi: 10.1007/978-3-642-33863-2_9
extern: '1'
intvolume: ' 7583'
issue: Part 1
language:
- iso: eng
month: '08'
oa_version: None
page: 83-91
publication: Computer Vision, ECCV 2012 - Workshops and Demonstrations
publication_identifier:
isbn:
- '9783642338625'
- '9783642338632'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Stable Spectral Mesh Filtering
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7583
year: '2012'
...
---
_id: '18350'
abstract:
- lang: eng
text: We introduce an (equi-)affine invariant geometric structure by which surfaces
that go through squeeze and shear transformations can still be properly analyzed.
The definition of an affine invariant metric enables us to evaluate a new form
of geodesic distances and to construct an invariant Laplacian from which local
and global diffusion geometry is constructed. Applications of the proposed framework
demonstrate its power in generalizing and enriching the existing set of tools
for shape analysis.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Dan
full_name: Raviv, Dan
last_name: Raviv
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
- first_name: Nir
full_name: Sochen, Nir
last_name: Sochen
citation:
ama: 'Raviv D, Bronstein AM, Bronstein MM, Kimmel R, Sochen N. Equi-affine invariant
geometries of articulated objects. In: 15th International Workshop on Theoretical
Foundations of Computer Vision. Vol 7474. Springer Nature; 2012:177-190. doi:10.1007/978-3-642-34091-8_8'
apa: 'Raviv, D., Bronstein, A. M., Bronstein, M. M., Kimmel, R., & Sochen, N.
(2012). Equi-affine invariant geometries of articulated objects. In 15th International
Workshop on Theoretical Foundations of Computer Vision (Vol. 7474, pp. 177–190).
Dagstuhl, Germany: Springer Nature. https://doi.org/10.1007/978-3-642-34091-8_8'
chicago: Raviv, Dan, Alex M. Bronstein, Michael M. Bronstein, Ron Kimmel, and Nir
Sochen. “Equi-Affine Invariant Geometries of Articulated Objects.” In 15th
International Workshop on Theoretical Foundations of Computer Vision, 7474:177–90.
Springer Nature, 2012. https://doi.org/10.1007/978-3-642-34091-8_8.
ieee: D. Raviv, A. M. Bronstein, M. M. Bronstein, R. Kimmel, and N. Sochen, “Equi-affine
invariant geometries of articulated objects,” in 15th International Workshop
on Theoretical Foundations of Computer Vision, Dagstuhl, Germany, 2012, vol.
7474, pp. 177–190.
ista: Raviv D, Bronstein AM, Bronstein MM, Kimmel R, Sochen N. 2012. Equi-affine
invariant geometries of articulated objects. 15th International Workshop on Theoretical
Foundations of Computer Vision. International Workshop on Theoretical Foundations
of Computer Vision, LNCS, vol. 7474, 177–190.
mla: Raviv, Dan, et al. “Equi-Affine Invariant Geometries of Articulated Objects.”
15th International Workshop on Theoretical Foundations of Computer Vision,
vol. 7474, Springer Nature, 2012, pp. 177–90, doi:10.1007/978-3-642-34091-8_8.
short: D. Raviv, A.M. Bronstein, M.M. Bronstein, R. Kimmel, N. Sochen, in:, 15th
International Workshop on Theoretical Foundations of Computer Vision, Springer
Nature, 2012, pp. 177–190.
conference:
end_date: 2011-07-01
location: Dagstuhl, Germany
name: International Workshop on Theoretical Foundations of Computer Vision
start_date: 2011-06-26
date_created: 2024-10-15T11:20:54Z
date_published: 2012-09-01T00:00:00Z
date_updated: 2025-01-16T10:12:48Z
day: '01'
doi: 10.1007/978-3-642-34091-8_8
extern: '1'
intvolume: ' 7474'
language:
- iso: eng
month: '09'
oa_version: None
page: 177-190
publication: 15th International Workshop on Theoretical Foundations of Computer Vision
publication_identifier:
eisbn:
- '9783642340918'
eissn:
- 1611-3349
isbn:
- '9783642340901'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Equi-affine invariant geometries of articulated objects
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7474
year: '2012'
...
---
_id: '10903'
abstract:
- lang: eng
text: We propose a logic-based framework for automated reasoning about sequential
programs manipulating singly-linked lists and arrays with unbounded data. We introduce
the logic SLAD, which allows combining shape constraints, written in a fragment
of Separation Logic, with data and size constraints. We address the problem of
checking the entailment between SLAD formulas, which is crucial in performing
pre-post condition reasoning. Although this problem is undecidable in general
for SLAD, we propose a sound and powerful procedure that is able to solve this
problem for a large class of formulas, beyond the capabilities of existing techniques
and tools. We prove that this procedure is complete, i.e., it is actually a decision
procedure for this problem, for an important fragment of SLAD including known
decidable logics. We implemented this procedure and shown its preciseness and
its efficiency on a significant benchmark of formulas.
acknowledgement: This work has been partially supported by the French ANR project
Veridyc
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Ahmed
full_name: Bouajjani, Ahmed
last_name: Bouajjani
- first_name: Cezara
full_name: Dragoi, Cezara
id: 2B2B5ED0-F248-11E8-B48F-1D18A9856A87
last_name: Dragoi
- first_name: Constantin
full_name: Enea, Constantin
last_name: Enea
- first_name: Mihaela
full_name: Sighireanu, Mihaela
last_name: Sighireanu
citation:
ama: 'Bouajjani A, Dragoi C, Enea C, Sighireanu M. Accurate invariant checking for
programs manipulating lists and arrays with infinite data. In: Automated Technology
for Verification and Analysis. Vol 7561. LNCS. Berlin, Heidelberg: Springer;
2012:167-182. doi:10.1007/978-3-642-33386-6_14'
apa: 'Bouajjani, A., Dragoi, C., Enea, C., & Sighireanu, M. (2012). Accurate
invariant checking for programs manipulating lists and arrays with infinite data.
In Automated Technology for Verification and Analysis (Vol. 7561, pp. 167–182).
Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-33386-6_14'
chicago: 'Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu.
“Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite
Data.” In Automated Technology for Verification and Analysis, 7561:167–82.
LNCS. Berlin, Heidelberg: Springer, 2012. https://doi.org/10.1007/978-3-642-33386-6_14.'
ieee: A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Accurate invariant checking
for programs manipulating lists and arrays with infinite data,” in Automated
Technology for Verification and Analysis, Thiruvananthapuram, India, 2012,
vol. 7561, pp. 167–182.
ista: 'Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Accurate invariant checking
for programs manipulating lists and arrays with infinite data. Automated Technology
for Verification and Analysis. ATVA: Automated Technology for Verification and
AnalysisLNCS, LNCS, vol. 7561, 167–182.'
mla: Bouajjani, Ahmed, et al. “Accurate Invariant Checking for Programs Manipulating
Lists and Arrays with Infinite Data.” Automated Technology for Verification
and Analysis, vol. 7561, Springer, 2012, pp. 167–82, doi:10.1007/978-3-642-33386-6_14.
short: A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Automated Technology
for Verification and Analysis, Springer, Berlin, Heidelberg, 2012, pp. 167–182.
conference:
end_date: 2012-10-06
location: Thiruvananthapuram, India
name: 'ATVA: Automated Technology for Verification and Analysis'
start_date: 2012-10-03
corr_author: '1'
date_created: 2022-03-21T07:58:39Z
date_published: 2012-10-15T00:00:00Z
date_updated: 2024-10-09T21:02:34Z
day: '15'
department:
- _id: ToHe
doi: 10.1007/978-3-642-33386-6_14
intvolume: ' 7561'
language:
- iso: eng
month: '10'
oa_version: None
page: 167-182
place: Berlin, Heidelberg
publication: Automated Technology for Verification and Analysis
publication_identifier:
eisbn:
- '9783642333866'
eissn:
- 1611-3349
isbn:
- '9783642333859'
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: Accurate invariant checking for programs manipulating lists and arrays with
infinite data
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 7561
year: '2012'
...
---
OA_place: repository
OA_type: green
_id: '10904'
abstract:
- lang: eng
text: Multi-dimensional mean-payoff and energy games provide the mathematical foundation
for the quantitative study of reactive systems, and play a central role in the
emerging quantitative theory of verification and synthesis. In this work, we study
the strategy synthesis problem for games with such multi-dimensional objectives
along with a parity condition, a canonical way to express ω-regular conditions.
While in general, the winning strategies in such games may require infinite memory,
for synthesis the most relevant problem is the construction of a finite-memory
winning strategy (if one exists). Our main contributions are as follows. First,
we show a tight exponential bound (matching upper and lower bounds) on the memory
required for finite-memory winning strategies in both multi-dimensional mean-payoff
and energy games along with parity objectives. This significantly improves the
triple exponential upper bound for multi energy games (without parity) that could
be derived from results in literature for games on VASS (vector addition systems
with states). Second, we present an optimal symbolic and incremental algorithm
to compute a finite-memory winning strategy (if one exists) in such games. Finally,
we give a complete characterization of when finite memory of strategies can be
traded off for randomness. In particular, we show that for one-dimension mean-payoff
parity games, randomized memoryless strategies are as powerful as their pure finite-memory
counterparts.
acknowledgement: 'Author supported by Austrian Science Fund (FWF) Grant No P 23499-N23,
FWF NFN Grant No S11407 (RiSE), ERC Start Grant (279307: Graph Games), Microsoft
faculty fellowship.'
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Mickael
full_name: Randour, Mickael
last_name: Randour
- first_name: Jean-François
full_name: Raskin, Jean-François
last_name: Raskin
citation:
ama: 'Chatterjee K, Randour M, Raskin J-F. Strategy synthesis for multi-dimensional
quantitative objectives. In: Koutny M, Ulidowski I, eds. CONCUR 2012 - Concurrency
Theory. Vol 7454. Berlin, Heidelberg: Springer; 2012:115-131. doi:10.1007/978-3-642-32940-1_10'
apa: 'Chatterjee, K., Randour, M., & Raskin, J.-F. (2012). Strategy synthesis
for multi-dimensional quantitative objectives. In M. Koutny & I. Ulidowski
(Eds.), CONCUR 2012 - Concurrency Theory (Vol. 7454, pp. 115–131). Berlin,
Heidelberg: Springer. https://doi.org/10.1007/978-3-642-32940-1_10'
chicago: 'Chatterjee, Krishnendu, Mickael Randour, and Jean-François Raskin. “Strategy
Synthesis for Multi-Dimensional Quantitative Objectives.” In CONCUR 2012 -
Concurrency Theory, edited by Maciej Koutny and Irek Ulidowski, 7454:115–31.
Berlin, Heidelberg: Springer, 2012. https://doi.org/10.1007/978-3-642-32940-1_10.'
ieee: K. Chatterjee, M. Randour, and J.-F. Raskin, “Strategy synthesis for multi-dimensional
quantitative objectives,” in CONCUR 2012 - Concurrency Theory, Newcastle
upon Tyne, United Kingdom, 2012, vol. 7454, pp. 115–131.
ista: 'Chatterjee K, Randour M, Raskin J-F. 2012. Strategy synthesis for multi-dimensional
quantitative objectives. CONCUR 2012 - Concurrency Theory. CONCUR: Conference
on Concurrency Theory, LNCS, vol. 7454, 115–131.'
mla: Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative
Objectives.” CONCUR 2012 - Concurrency Theory, edited by Maciej Koutny
and Irek Ulidowski, vol. 7454, Springer, 2012, pp. 115–31, doi:10.1007/978-3-642-32940-1_10.
short: K. Chatterjee, M. Randour, J.-F. Raskin, in:, M. Koutny, I. Ulidowski (Eds.),
CONCUR 2012 - Concurrency Theory, Springer, Berlin, Heidelberg, 2012, pp. 115–131.
conference:
end_date: 2012-09-07
location: Newcastle upon Tyne, United Kingdom
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2012-09-04
corr_author: '1'
date_created: 2022-03-21T08:00:21Z
date_published: 2012-09-15T00:00:00Z
date_updated: 2025-09-29T11:10:44Z
day: '15'
department:
- _id: KrCh
doi: 10.1007/978-3-642-32940-1_10
ec_funded: 1
editor:
- first_name: Maciej
full_name: Koutny, Maciej
last_name: Koutny
- first_name: Irek
full_name: Ulidowski, Irek
last_name: Ulidowski
external_id:
arxiv:
- '1201.5073'
intvolume: ' 7454'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1201.5073
month: '09'
oa: 1
oa_version: Preprint
page: 115-131
place: Berlin, Heidelberg
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: CONCUR 2012 - Concurrency Theory
publication_identifier:
eisbn:
- '9783642329401'
eissn:
- 1611-3349
isbn:
- '9783642329395'
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
related_material:
record:
- id: '2716'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Strategy synthesis for multi-dimensional quantitative objectives
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7454
year: '2012'
...
---
_id: '10905'
abstract:
- lang: eng
text: "Energy games belong to a class of turn-based two-player infinite-duration
games played on a weighted directed graph. It is one of the rare and intriguing
combinatorial problems that lie in NP ∩ co−NP, but are not known to be in P. While
the existence of polynomial-time algorithms has been a major open problem for
decades, there is no algorithm that solves any non-trivial subclass in polynomial
time.\r\nIn this paper, we give several results based on the weight structures
of the graph. First, we identify a notion of penalty and present a polynomial-time
algorithm when the penalty is large. Our algorithm is the first polynomial-time
algorithm on a large class of weighted graphs. It includes several counter examples
that show that many previous algorithms, such as value iteration and random facet
algorithms, require at least sub-exponential time. Our main technique is developing
the first non-trivial approximation algorithm and showing how to convert it to
an exact algorithm. Moreover, we show that in a practical case in verification
where weights are clustered around a constant number of values, the energy game
problem can be solved in polynomial time. We also show that the problem is still
as hard as in general when the clique-width is bounded or the graph is strongly
ergodic, suggesting that restricting graph structures need not help."
acknowledgement: 'Supported by the Austrian Science Fund (FWF): P23499-N23, the Austrian
Science Fund (FWF): S11407-N23 (RiSE), an ERC Start Grant (279307: Graph Games),
and a Microsoft Faculty Fellows Award'
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: 'Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. Polynomial-time algorithms
for energy games with special weight structures. In: Algorithms – ESA 2012.
Vol 7501. Springer; 2012:301-312. doi:10.1007/978-3-642-33090-2_27'
apa: 'Chatterjee, K., Henzinger, M., Krinninger, S., & Nanongkai, D. (2012).
Polynomial-time algorithms for energy games with special weight structures. In
Algorithms – ESA 2012 (Vol. 7501, pp. 301–312). Ljubljana, Slovenia: Springer.
https://doi.org/10.1007/978-3-642-33090-2_27'
chicago: Chatterjee, Krishnendu, Monika Henzinger, Sebastian Krinninger, and Danupon
Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.”
In Algorithms – ESA 2012, 7501:301–12. Springer, 2012. https://doi.org/10.1007/978-3-642-33090-2_27.
ieee: K. Chatterjee, M. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time
algorithms for energy games with special weight structures,” in Algorithms
– ESA 2012, Ljubljana, Slovenia, 2012, vol. 7501, pp. 301–312.
ista: 'Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. 2012. Polynomial-time
algorithms for energy games with special weight structures. Algorithms – ESA 2012.
ESA: European Symposium on Algorithms, LNCS, vol. 7501, 301–312.'
mla: Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games
with Special Weight Structures.” Algorithms – ESA 2012, vol. 7501, Springer,
2012, pp. 301–12, doi:10.1007/978-3-642-33090-2_27.
short: K. Chatterjee, M. Henzinger, S. Krinninger, D. Nanongkai, in:, Algorithms
– ESA 2012, Springer, 2012, pp. 301–312.
conference:
end_date: 2012-09-12
location: Ljubljana, Slovenia
name: 'ESA: European Symposium on Algorithms'
start_date: 2012-09-10
corr_author: '1'
date_created: 2022-03-21T08:01:45Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2025-09-29T13:18:37Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-33090-2_27
ec_funded: 1
external_id:
arxiv:
- '1604.08234'
intvolume: ' 7501'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.08234
month: '10'
oa: 1
oa_version: Preprint
page: 301-312
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Algorithms – ESA 2012
publication_identifier:
eisbn:
- '9783642330902'
eissn:
- 1611-3349
isbn:
- '9783642330896'
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
related_material:
record:
- id: '535'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Polynomial-time algorithms for energy games with special weight structures
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7501
year: '2012'
...
---
_id: '10906'
abstract:
- lang: eng
text: HSF(C) is a tool that automates verification of safety and liveness properties
for C programs. This paper describes the verification approach taken by HSF(C)
and provides instructions on how to install and use the tool.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Sergey
full_name: Grebenshchikov, Sergey
last_name: Grebenshchikov
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- first_name: Nuno P.
full_name: Lopes, Nuno P.
last_name: Lopes
- first_name: Corneliu
full_name: Popeea, Corneliu
last_name: Popeea
- first_name: Andrey
full_name: Rybalchenko, Andrey
last_name: Rybalchenko
citation:
ama: 'Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. HSF(C): A software
verifier based on Horn clauses. In: Flanagan C, König B, eds. Tools and Algorithms
for the Construction and Analysis of Systems. Vol 7214. LNCS. Berlin, Heidelberg:
Springer; 2012:549-551. doi:10.1007/978-3-642-28756-5_46'
apa: 'Grebenshchikov, S., Gupta, A., Lopes, N. P., Popeea, C., & Rybalchenko,
A. (2012). HSF(C): A software verifier based on Horn clauses. In C. Flanagan &
B. König (Eds.), Tools and Algorithms for the Construction and Analysis of
Systems (Vol. 7214, pp. 549–551). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-28756-5_46'
chicago: 'Grebenshchikov, Sergey, Ashutosh Gupta, Nuno P. Lopes, Corneliu Popeea,
and Andrey Rybalchenko. “HSF(C): A Software Verifier Based on Horn Clauses.” In
Tools and Algorithms for the Construction and Analysis of Systems, edited
by Cormac Flanagan and Barbara König, 7214:549–51. LNCS. Berlin, Heidelberg: Springer,
2012. https://doi.org/10.1007/978-3-642-28756-5_46.'
ieee: 'S. Grebenshchikov, A. Gupta, N. P. Lopes, C. Popeea, and A. Rybalchenko,
“HSF(C): A software verifier based on Horn clauses,” in Tools and Algorithms
for the Construction and Analysis of Systems, Tallinn, Estonia, 2012, vol.
7214, pp. 549–551.'
ista: 'Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. 2012. HSF(C):
A software verifier based on Horn clauses. Tools and Algorithms for the Construction
and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and
Analysis of SystemsLNCS, LNCS, vol. 7214, 549–551.'
mla: 'Grebenshchikov, Sergey, et al. “HSF(C): A Software Verifier Based on Horn
Clauses.” Tools and Algorithms for the Construction and Analysis of Systems,
edited by Cormac Flanagan and Barbara König, vol. 7214, Springer, 2012, pp. 549–51,
doi:10.1007/978-3-642-28756-5_46.'
short: S. Grebenshchikov, A. Gupta, N.P. Lopes, C. Popeea, A. Rybalchenko, in:,
C. Flanagan, B. König (Eds.), Tools and Algorithms for the Construction and Analysis
of Systems, Springer, Berlin, Heidelberg, 2012, pp. 549–551.
conference:
end_date: 2012-04-01
location: Tallinn, Estonia
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2012-03-24
corr_author: '1'
date_created: 2022-03-21T08:03:30Z
date_published: 2012-04-01T00:00:00Z
date_updated: 2024-10-09T21:02:32Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-642-28756-5_46
editor:
- first_name: Cormac
full_name: Flanagan, Cormac
last_name: Flanagan
- first_name: Barbara
full_name: König, Barbara
last_name: König
intvolume: ' 7214'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/978-3-642-28756-5_46
month: '04'
oa: 1
oa_version: Published Version
page: 549-551
place: Berlin, Heidelberg
publication: Tools and Algorithms for the Construction and Analysis of Systems
publication_identifier:
eisbn:
- '9783642287565'
eissn:
- 1611-3349
isbn:
- '9783642287558'
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: 'HSF(C): A software verifier based on Horn clauses'
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 7214
year: '2012'
...
---
OA_place: repository
_id: '5745'
abstract:
- lang: eng
text: Unsatisfiability proofs find many applications in verification. Today, many
SAT solvers are capable of producing resolution proofs of unsatisfiability. For
efficiency smaller proofs are preferred over bigger ones. The solvers apply proof
reduction methods to remove redundant parts of the proofs while and after generating
the proofs. One method of reducing resolution proofs is redundant resolution reduction,
i.e., removing repeated pivots in the paths of resolution proofs (aka Pivot recycle).
The known single pass algorithm only tries to remove redundancies in the parts
of the proof that are trees. In this paper, we present three modifications to
improve the algorithm such that the redundancies can be found in the parts of
the proofs that are DAGs. The first modified algorithm covers greater number of
redundancies as compared to the known algorithm without incurring any additional
cost. The second modified algorithm covers even greater number of the redundancies
but it may have longer run times. Our third modified algorithm is parametrized
and can trade off between run times and the coverage of the redundancies. We have
implemented our algorithms in OpenSMT and applied them on unsatisfiability proofs
of 198 examples from plain MUS track of SAT11 competition. The first and second
algorithm additionally remove 0.89% and 10.57% of clauses respectively as compared
to the original algorithm. For certain value of the parameter, the third algorithm
removes almost as many clauses as the second algorithm but is significantly faster.
acknowledgement: "This work was supported by the ERC Advanced Investigator grant on
Quantitative\r\nReactive Modeling (QUAREM)."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
citation:
ama: 'Gupta A. Improved single pass algorithms for resolution proof reduction. In:
10th International Symposium on Automated Technology for Verification and Analysis.
Vol 7561. Springer Nature; 2012:107-121. doi:10.1007/978-3-642-33386-6_10'
apa: 'Gupta, A. (2012). Improved single pass algorithms for resolution proof reduction.
In 10th International Symposium on Automated Technology for Verification and
Analysis (Vol. 7561, pp. 107–121). Thiruvananthapuram, Kerala, India: Springer
Nature. https://doi.org/10.1007/978-3-642-33386-6_10'
chicago: Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof
Reduction.” In 10th International Symposium on Automated Technology for Verification
and Analysis, 7561:107–21. Springer Nature, 2012. https://doi.org/10.1007/978-3-642-33386-6_10.
ieee: A. Gupta, “Improved single pass algorithms for resolution proof reduction,”
in 10th International Symposium on Automated Technology for Verification and
Analysis, Thiruvananthapuram, Kerala, India, 2012, vol. 7561, pp. 107–121.
ista: 'Gupta A. 2012. Improved single pass algorithms for resolution proof reduction.
10th International Symposium on Automated Technology for Verification and Analysis.
ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 7561, 107–121.'
mla: Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.”
10th International Symposium on Automated Technology for Verification and Analysis,
vol. 7561, Springer Nature, 2012, pp. 107–21, doi:10.1007/978-3-642-33386-6_10.
short: A. Gupta, in:, 10th International Symposium on Automated Technology for Verification
and Analysis, Springer Nature, 2012, pp. 107–121.
conference:
end_date: 2012-10-06
location: Thiruvananthapuram, Kerala, India
name: 'ATVA: Automated Technology for Verification and Analysis'
start_date: 2012-10-03
corr_author: '1'
date_created: 2018-12-18T13:01:46Z
date_published: 2012-09-28T00:00:00Z
date_updated: 2025-04-15T07:56:27Z
day: '28'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-642-33386-6_10
ec_funded: 1
file:
- access_level: open_access
checksum: 68415837a315de3cc4d120f6019d752c
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T13:07:35Z
date_updated: 2020-07-14T12:47:10Z
file_id: '5746'
file_name: 2012_ATVA_Gupta.pdf
file_size: 465502
relation: main_file
file_date_updated: 2020-07-14T12:47:10Z
has_accepted_license: '1'
intvolume: ' 7561'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 107-121
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: 10th International Symposium on Automated Technology for Verification
and Analysis
publication_identifier:
eisbn:
- '9783642333866'
eissn:
- 1611-3349
isbn:
- '9783642333859'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
pubrep_id: '180'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Improved single pass algorithms for resolution proof reduction
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7561
year: '2012'
...
---
_id: '10907'
abstract:
- lang: eng
text: This paper presents a method to create a model of an articulated object using
the planar motion in an initialization video. The model consists of rigid parts
connected by points of articulation. The rigid parts are described by the positions
of salient feature-points tracked throughout the video. Following a filtering
step that identifies points that belong to different objects, rigid parts are
found by a grouping process in a graph pyramid. Valid articulation points are
selected by verifying multiple hypotheses for each pair of parts.
acknowledgement: This work has been partially supported by the Austrian Science Fund
under grants S9103-N13 and P18716-N13.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Nicole M.
full_name: Artner, Nicole M.
last_name: Artner
- first_name: Adrian
full_name: Ion, Adrian
id: 29F89302-F248-11E8-B48F-1D18A9856A87
last_name: Ion
- first_name: Walter G.
full_name: Kropatsch, Walter G.
last_name: Kropatsch
citation:
ama: 'Artner NM, Ion A, Kropatsch WG. Spatio-temporal extraction of articulated
models in a graph pyramid. In: Jiang X, Ferrer M, Torsello A, eds. Graph-Based
Representations in Pattern Recognition. Vol 6658. LNIP. Berlin, Heidelberg:
Springer; 2011:215-224. doi:10.1007/978-3-642-20844-7_22'
apa: 'Artner, N. M., Ion, A., & Kropatsch, W. G. (2011). Spatio-temporal extraction
of articulated models in a graph pyramid. In X. Jiang, M. Ferrer, & A. Torsello
(Eds.), Graph-Based Representations in Pattern Recognition (Vol. 6658,
pp. 215–224). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-20844-7_22'
chicago: 'Artner, Nicole M., Adrian Ion, and Walter G. Kropatsch. “Spatio-Temporal
Extraction of Articulated Models in a Graph Pyramid.” In Graph-Based Representations
in Pattern Recognition, edited by Xiaoyi Jiang, Miquel Ferrer, and Andrea
Torsello, 6658:215–24. LNIP. Berlin, Heidelberg: Springer, 2011. https://doi.org/10.1007/978-3-642-20844-7_22.'
ieee: N. M. Artner, A. Ion, and W. G. Kropatsch, “Spatio-temporal extraction of
articulated models in a graph pyramid,” in Graph-Based Representations in Pattern
Recognition, Münster, Germany, 2011, vol. 6658, pp. 215–224.
ista: 'Artner NM, Ion A, Kropatsch WG. 2011. Spatio-temporal extraction of articulated
models in a graph pyramid. Graph-Based Representations in Pattern Recognition.
GbRPR: Graph-based Representations in Pattern RecognitionLNIP, LNCS, vol. 6658,
215–224.'
mla: Artner, Nicole M., et al. “Spatio-Temporal Extraction of Articulated Models
in a Graph Pyramid.” Graph-Based Representations in Pattern Recognition,
edited by Xiaoyi Jiang et al., vol. 6658, Springer, 2011, pp. 215–24, doi:10.1007/978-3-642-20844-7_22.
short: N.M. Artner, A. Ion, W.G. Kropatsch, in:, X. Jiang, M. Ferrer, A. Torsello
(Eds.), Graph-Based Representations in Pattern Recognition, Springer, Berlin,
Heidelberg, 2011, pp. 215–224.
conference:
end_date: 2011-05-20
location: Münster, Germany
name: 'GbRPR: Graph-based Representations in Pattern Recognition'
start_date: 2011-05-18
corr_author: '1'
date_created: 2022-03-21T08:08:35Z
date_published: 2011-06-01T00:00:00Z
date_updated: 2024-10-09T21:02:32Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/978-3-642-20844-7_22
editor:
- first_name: Xiaoyi
full_name: Jiang, Xiaoyi
last_name: Jiang
- first_name: Miquel
full_name: Ferrer, Miquel
last_name: Ferrer
- first_name: Andrea
full_name: Torsello, Andrea
last_name: Torsello
intvolume: ' 6658'
language:
- iso: eng
month: '06'
oa_version: None
page: 215-224
place: Berlin, Heidelberg
publication: Graph-Based Representations in Pattern Recognition
publication_identifier:
eisbn:
- '9783642208447'
eissn:
- 1611-3349
isbn:
- '9783642208430'
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
series_title: LNIP
status: public
title: Spatio-temporal extraction of articulated models in a graph pyramid
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 6658
year: '2011'
...
---
_id: '9648'
abstract:
- lang: eng
text: In this paper, we establish a correspondence between the incremental algorithm
for computing AT-models [8,9] and the one for computing persistent homology [6,14,15].
We also present a decremental algorithm for computing AT-models that allows to
extend the persistence computation to a wider setting. Finally, we show how to
combine incremental and decremental techniques for persistent homology computation.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Rocio
full_name: Gonzalez-Diaz, Rocio
last_name: Gonzalez-Diaz
- first_name: Adrian
full_name: Ion, Adrian
id: 29F89302-F248-11E8-B48F-1D18A9856A87
last_name: Ion
- first_name: Maria Jose
full_name: Jimenez, Maria Jose
last_name: Jimenez
- first_name: Regina
full_name: Poyatos, Regina
last_name: Poyatos
citation:
ama: 'Gonzalez-Diaz R, Ion A, Jimenez MJ, Poyatos R. Incremental-decremental algorithm
for computing AT-models and persistent homology. In: Computer Analysis of Images
and Patterns. Vol 6854. Springer Nature; 2011:286-293. doi:10.1007/978-3-642-23672-3_35'
apa: 'Gonzalez-Diaz, R., Ion, A., Jimenez, M. J., & Poyatos, R. (2011). Incremental-decremental
algorithm for computing AT-models and persistent homology. In Computer Analysis
of Images and Patterns (Vol. 6854, pp. 286–293). Seville, Spain: Springer
Nature. https://doi.org/10.1007/978-3-642-23672-3_35'
chicago: Gonzalez-Diaz, Rocio, Adrian Ion, Maria Jose Jimenez, and Regina Poyatos.
“Incremental-Decremental Algorithm for Computing AT-Models and Persistent Homology.”
In Computer Analysis of Images and Patterns, 6854:286–93. Springer Nature,
2011. https://doi.org/10.1007/978-3-642-23672-3_35.
ieee: R. Gonzalez-Diaz, A. Ion, M. J. Jimenez, and R. Poyatos, “Incremental-decremental
algorithm for computing AT-models and persistent homology,” in Computer Analysis
of Images and Patterns, Seville, Spain, 2011, vol. 6854, pp. 286–293.
ista: 'Gonzalez-Diaz R, Ion A, Jimenez MJ, Poyatos R. 2011. Incremental-decremental
algorithm for computing AT-models and persistent homology. Computer Analysis of
Images and Patterns. CAIP: International Conference on Computer Analysis of Images
and Patterns, LNCS, vol. 6854, 286–293.'
mla: Gonzalez-Diaz, Rocio, et al. “Incremental-Decremental Algorithm for Computing
AT-Models and Persistent Homology.” Computer Analysis of Images and Patterns,
vol. 6854, Springer Nature, 2011, pp. 286–93, doi:10.1007/978-3-642-23672-3_35.
short: R. Gonzalez-Diaz, A. Ion, M.J. Jimenez, R. Poyatos, in:, Computer Analysis
of Images and Patterns, Springer Nature, 2011, pp. 286–293.
conference:
end_date: 2011-08-31
location: Seville, Spain
name: 'CAIP: International Conference on Computer Analysis of Images and Patterns'
start_date: 2011-08-29
date_created: 2021-07-11T22:01:19Z
date_published: 2011-08-01T00:00:00Z
date_updated: 2026-04-16T10:09:19Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/978-3-642-23672-3_35
intvolume: ' 6854'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://hdl.handle.net/11441/30766
month: '08'
oa: 1
oa_version: Published Version
page: 286-293
publication: Computer Analysis of Images and Patterns
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783642236716'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Incremental-decremental algorithm for computing AT-models and persistent homology
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 6854
year: '2011'
...
---
_id: '18338'
abstract:
- lang: eng
text: Invariant image descriptors play an important role in many computer vision
and pattern recognition problems such as image search and retrieval. A dominant
paradigm today is that of “bags of features”, a representation of images as distributions
of primitive visual elements. The main disadvantage of this approach is the loss
of spatial relations between features, which often carry important information
about the image. In this paper, we show how to construct spatially-sensitive image
descriptors in which both the features and their relation are affine-invariant.
Our construction is based on a vocabulary of pairs of features coupled with a
vocabulary of invariant spatial relations between the features. Experimental results
show the advantage of our approach in image retrieval applications.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
citation:
ama: 'Bronstein AM, Bronstein MM. Spatially-sensitive affine-invariant image descriptors.
In: 11th European Conference on Computer Vision. Vol 6312. Springer Nature;
2010:197–208. doi:10.1007/978-3-642-15552-9_15'
apa: 'Bronstein, A. M., & Bronstein, M. M. (2010). Spatially-sensitive affine-invariant
image descriptors. In 11th European Conference on Computer Vision (Vol.
6312, pp. 197–208). Heraklion, Greece: Springer Nature. https://doi.org/10.1007/978-3-642-15552-9_15'
chicago: Bronstein, Alex M., and Michael M. Bronstein. “Spatially-Sensitive Affine-Invariant
Image Descriptors.” In 11th European Conference on Computer Vision, 6312:197–208.
Springer Nature, 2010. https://doi.org/10.1007/978-3-642-15552-9_15.
ieee: A. M. Bronstein and M. M. Bronstein, “Spatially-sensitive affine-invariant
image descriptors,” in 11th European Conference on Computer Vision, Heraklion,
Greece, 2010, vol. 6312, pp. 197–208.
ista: 'Bronstein AM, Bronstein MM. 2010. Spatially-sensitive affine-invariant image
descriptors. 11th European Conference on Computer Vision. ECCV: European Conference
on Computer Vision, LNCS, vol. 6312, 197–208.'
mla: Bronstein, Alex M., and Michael M. Bronstein. “Spatially-Sensitive Affine-Invariant
Image Descriptors.” 11th European Conference on Computer Vision, vol. 6312,
Springer Nature, 2010, pp. 197–208, doi:10.1007/978-3-642-15552-9_15.
short: A.M. Bronstein, M.M. Bronstein, in:, 11th European Conference on Computer
Vision, Springer Nature, 2010, pp. 197–208.
conference:
end_date: 2010-09-10
location: Heraklion, Greece
name: 'ECCV: European Conference on Computer Vision'
start_date: 2010-09-05
date_created: 2024-10-15T11:20:54Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2024-12-02T14:07:41Z
doi: 10.1007/978-3-642-15552-9_15
extern: '1'
intvolume: ' 6312'
language:
- iso: eng
month: '01'
oa_version: None
page: 197–208
publication: 11th European Conference on Computer Vision
publication_identifier:
eisbn:
- '9783642155529'
eissn:
- 1611-3349
isbn:
- '9783642155512'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Spatially-sensitive affine-invariant image descriptors
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 6312
year: '2010'
...
---
_id: '18339'
abstract:
- lang: eng
text: Automatic detection of symmetries, regularity, and repetitive structures in
3D geometry is a fundamental problem in shape analysis and pattern recognition
with applications in computer vision and graphics. Especially challenging is to
detect intrinsic regularity, where the repetitions are on an intrinsic grid, without
any apparent Euclidean pattern to describe the shape, but rising out of (near)
isometric deformation of the underlying surface. In this paper, we employ multidimensional
scaling to reduce the problem of intrinsic structure detection to a simpler problem
of 2D grid detection. Potential 2D grids are then identified using an autocorrelation
analysis, refined using local fitting, validated, and finally projected back to
the spatial domain. We test the detection algorithm on a variety of scanned plaster
models in presence of imperfections like missing data, noise and outliers. We
also present a range of applications including scan completion, shape editing,
super-resolution, and structural correspondence.
acknowledgement: We thank Helmut Pottmann and the anonymous reviewers for their comments
and helpful suggestions. Niloy Mitra was partially supported by a Microsoft outstanding
young faculty fellowship.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Niloy J.
full_name: Mitra, Niloy J.
last_name: Mitra
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael
full_name: Bronstein, Michael
last_name: Bronstein
citation:
ama: 'Mitra NJ, Bronstein AM, Bronstein M. Intrinsic regularity detection in 3D
geometry. In: 11th European Conference on Computer Vision. Vol 6313. Springer
Nature; 2010:398–410. doi:10.1007/978-3-642-15558-1_29'
apa: 'Mitra, N. J., Bronstein, A. M., & Bronstein, M. (2010). Intrinsic regularity
detection in 3D geometry. In 11th European Conference on Computer Vision
(Vol. 6313, pp. 398–410). Heraklion, Greece: Springer Nature. https://doi.org/10.1007/978-3-642-15558-1_29'
chicago: Mitra, Niloy J., Alex M. Bronstein, and Michael Bronstein. “Intrinsic Regularity
Detection in 3D Geometry.” In 11th European Conference on Computer Vision,
6313:398–410. Springer Nature, 2010. https://doi.org/10.1007/978-3-642-15558-1_29.
ieee: N. J. Mitra, A. M. Bronstein, and M. Bronstein, “Intrinsic regularity detection
in 3D geometry,” in 11th European Conference on Computer Vision, Heraklion,
Greece, 2010, vol. 6313, pp. 398–410.
ista: 'Mitra NJ, Bronstein AM, Bronstein M. 2010. Intrinsic regularity detection
in 3D geometry. 11th European Conference on Computer Vision. ECCV: European Conference
on Computer Vision, LNCS, vol. 6313, 398–410.'
mla: Mitra, Niloy J., et al. “Intrinsic Regularity Detection in 3D Geometry.” 11th
European Conference on Computer Vision, vol. 6313, Springer Nature, 2010,
pp. 398–410, doi:10.1007/978-3-642-15558-1_29.
short: N.J. Mitra, A.M. Bronstein, M. Bronstein, in:, 11th European Conference on
Computer Vision, Springer Nature, 2010, pp. 398–410.
conference:
end_date: 2010-09-10
location: Heraklion, Greece
name: 'ECCV: European Conference on Computer Vision'
start_date: 2010-09-05
date_created: 2024-10-15T11:20:54Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2024-11-18T14:31:56Z
doi: 10.1007/978-3-642-15558-1_29
extern: '1'
intvolume: ' 6313'
language:
- iso: eng
month: '01'
oa_version: None
page: 398–410
publication: 11th European Conference on Computer Vision
publication_identifier:
isbn:
- '9783642155574'
- '9783642155581'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Intrinsic regularity detection in 3D geometry
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 6313
year: '2010'
...
---
_id: '10908'
abstract:
- lang: eng
text: We present ABC, a software tool for automatically computing symbolic upper
bounds on the number of iterations of nested program loops. The system combines
static analysis of programs with symbolic summation techniques to derive loop
invariant relations between program variables. Iteration bounds are obtained from
the inferred invariants, by replacing variables with bounds on their greatest
values. We have successfully applied ABC to a large number of examples. The derived
symbolic bounds express non-trivial polynomial relations over loop variables.
We also report on results to automatically infer symbolic expressions over harmonic
numbers as upper bounds on loop iteration counts.
acknowledgement: This work was supported in part by the Swiss NSF. The fourth author
is supported by an FWF Hertha Firnberg Research grant (T425-N23).
article_processing_charge: No
author:
- first_name: Régis
full_name: Blanc, Régis
last_name: Blanc
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Thibaud
full_name: Hottelier, Thibaud
last_name: Hottelier
- first_name: Laura
full_name: Kovács, Laura
last_name: Kovács
citation:
ama: 'Blanc R, Henzinger TA, Hottelier T, Kovács L. ABC: Algebraic Bound Computation
for loops. In: Clarke EM, Voronkov A, eds. Logic for Programming, Artificial
Intelligence, and Reasoning. Vol 6355. LNCS. Berlin, Heidelberg: Springer
Nature; 2010:103-118. doi:10.1007/978-3-642-17511-4_7'
apa: 'Blanc, R., Henzinger, T. A., Hottelier, T., & Kovács, L. (2010). ABC:
Algebraic Bound Computation for loops. In E. M. Clarke & A. Voronkov (Eds.),
Logic for Programming, Artificial Intelligence, and Reasoning (Vol. 6355,
pp. 103–118). Berlin, Heidelberg: Springer Nature. https://doi.org/10.1007/978-3-642-17511-4_7'
chicago: 'Blanc, Régis, Thomas A Henzinger, Thibaud Hottelier, and Laura Kovács.
“ABC: Algebraic Bound Computation for Loops.” In Logic for Programming, Artificial
Intelligence, and Reasoning, edited by Edmund M Clarke and Andrei Voronkov,
6355:103–18. LNCS. Berlin, Heidelberg: Springer Nature, 2010. https://doi.org/10.1007/978-3-642-17511-4_7.'
ieee: 'R. Blanc, T. A. Henzinger, T. Hottelier, and L. Kovács, “ABC: Algebraic Bound
Computation for loops,” in Logic for Programming, Artificial Intelligence,
and Reasoning, Dakar, Senegal, 2010, vol. 6355, pp. 103–118.'
ista: 'Blanc R, Henzinger TA, Hottelier T, Kovács L. 2010. ABC: Algebraic Bound
Computation for loops. Logic for Programming, Artificial Intelligence, and Reasoning.
LPAR: Logic for Programming, Artificial Intelligence and ReasoningLNCS vol. 6355,
103–118.'
mla: 'Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.” Logic
for Programming, Artificial Intelligence, and Reasoning, edited by Edmund
M Clarke and Andrei Voronkov, vol. 6355, Springer Nature, 2010, pp. 103–18, doi:10.1007/978-3-642-17511-4_7.'
short: R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov
(Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer
Nature, Berlin, Heidelberg, 2010, pp. 103–118.
conference:
end_date: 2010-05-01
location: Dakar, Senegal
name: 'LPAR: Logic for Programming, Artificial Intelligence and Reasoning'
start_date: 2010-04-25
corr_author: '1'
date_created: 2022-03-21T08:14:35Z
date_published: 2010-05-01T00:00:00Z
date_updated: 2025-09-30T09:51:13Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-642-17511-4_7
editor:
- first_name: Edmund M
full_name: Clarke, Edmund M
last_name: Clarke
- first_name: Andrei
full_name: Voronkov, Andrei
last_name: Voronkov
external_id:
isi:
- '000309668000007'
intvolume: ' 6355'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://infoscience.epfl.ch/record/186096
month: '05'
oa: 1
oa_version: Submitted Version
page: 103-118
place: Berlin, Heidelberg
publication: Logic for Programming, Artificial Intelligence, and Reasoning
publication_identifier:
eisbn:
- '9783642175114'
eissn:
- 1611-3349
isbn:
- '9783642175107'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: 'ABC: Algebraic Bound Computation for loops'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 6355
year: '2010'
...
---
_id: '5940'
article_processing_charge: No
author:
- first_name: Gabriel
full_name: Juhás, Gabriel
last_name: Juhás
- first_name: Igor
full_name: Kazlov, Igor
id: 4A997E50-F248-11E8-B48F-1D18A9856A87
last_name: Kazlov
- first_name: Ana
full_name: Juhásová, Ana
last_name: Juhásová
citation:
ama: 'Juhás G, Kazlov I, Juhásová A. Instance Deadlock: A Mystery behind Frozen
Programs. In: Applications and Theory of Petri Nets. Berlin, Heidelberg:
Springer Berlin Heidelberg; 2010:1-17. doi:10.1007/978-3-642-13675-7_1'
apa: 'Juhás, G., Kazlov, I., & Juhásová, A. (2010). Instance Deadlock: A Mystery
behind Frozen Programs. In Applications and Theory of Petri Nets (pp. 1–17).
Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-13675-7_1'
chicago: 'Juhás, Gabriel, Igor Kazlov, and Ana Juhásová. “Instance Deadlock: A Mystery
behind Frozen Programs.” In Applications and Theory of Petri Nets, 1–17.
Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. https://doi.org/10.1007/978-3-642-13675-7_1.'
ieee: 'G. Juhás, I. Kazlov, and A. Juhásová, “Instance Deadlock: A Mystery behind
Frozen Programs,” in Applications and Theory of Petri Nets, Berlin, Heidelberg:
Springer Berlin Heidelberg, 2010, pp. 1–17.'
ista: 'Juhás G, Kazlov I, Juhásová A. 2010.Instance Deadlock: A Mystery behind Frozen
Programs. In: Applications and Theory of Petri Nets. , 1–17.'
mla: 'Juhás, Gabriel, et al. “Instance Deadlock: A Mystery behind Frozen Programs.”
Applications and Theory of Petri Nets, Springer Berlin Heidelberg, 2010,
pp. 1–17, doi:10.1007/978-3-642-13675-7_1.'
short: G. Juhás, I. Kazlov, A. Juhásová, in:, Applications and Theory of Petri Nets,
Springer Berlin Heidelberg, Berlin, Heidelberg, 2010, pp. 1–17.
date_created: 2019-02-08T09:33:41Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2022-04-01T13:45:24Z
doi: 10.1007/978-3-642-13675-7_1
extern: '1'
language:
- iso: eng
oa_version: None
page: 1-17
place: Berlin, Heidelberg
publication: Applications and Theory of Petri Nets
publication_identifier:
isbn:
- '9783642136740'
- '9783642136757'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: 'Instance Deadlock: A Mystery behind Frozen Programs'
type: book_chapter
user_id: 4A997E50-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
---
OA_type: closed access
_id: '18320'
abstract:
- lang: eng
text: Presented here is the problem of recovering a dynamic image superimposed on
a static background. Such a problem is ill-posed and may arise e.g. in imaging
through semireflective media, in separation of an illumination image from a reflectance
image, in imaging with diffraction phenomena, etc. In this work we study regularization
of this problem in spirit of Total Variation and general sparsifying transformations.
alternative_title:
- LNISA
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Michael
full_name: Zibulevsky, Michael
last_name: Zibulevsky
citation:
ama: 'Bronstein AM, Bronstein MM, Zibulevsky M. On separation of semitransparent
dynamic images from static background. In: 6th International Conference on
Independent Component Analysis and Signal Separation. Vol 3889. Springer Nature;
2006:934-940. doi:10.1007/11679363_116'
apa: 'Bronstein, A. M., Bronstein, M. M., & Zibulevsky, M. (2006). On separation
of semitransparent dynamic images from static background. In 6th International
Conference on Independent Component Analysis and Signal Separation (Vol. 3889,
pp. 934–940). Charleston, SC, United States: Springer Nature. https://doi.org/10.1007/11679363_116'
chicago: Bronstein, Alex M., Michael M. Bronstein, and Michael Zibulevsky. “On Separation
of Semitransparent Dynamic Images from Static Background.” In 6th International
Conference on Independent Component Analysis and Signal Separation, 3889:934–40.
Springer Nature, 2006. https://doi.org/10.1007/11679363_116.
ieee: A. M. Bronstein, M. M. Bronstein, and M. Zibulevsky, “On separation of semitransparent
dynamic images from static background,” in 6th International Conference on
Independent Component Analysis and Signal Separation, Charleston, SC, United
States, 2006, vol. 3889, pp. 934–940.
ista: 'Bronstein AM, Bronstein MM, Zibulevsky M. 2006. On separation of semitransparent
dynamic images from static background. 6th International Conference on Independent
Component Analysis and Signal Separation. ICA: International Conference on Independent
Component Analysis and Signal Separation, LNISA, vol. 3889, 934–940.'
mla: Bronstein, Alex M., et al. “On Separation of Semitransparent Dynamic Images
from Static Background.” 6th International Conference on Independent Component
Analysis and Signal Separation, vol. 3889, Springer Nature, 2006, pp. 934–40,
doi:10.1007/11679363_116.
short: A.M. Bronstein, M.M. Bronstein, M. Zibulevsky, in:, 6th International Conference
on Independent Component Analysis and Signal Separation, Springer Nature, 2006,
pp. 934–940.
conference:
end_date: 2006-03-08
location: Charleston, SC, United States
name: 'ICA: International Conference on Independent Component Analysis and Signal
Separation'
start_date: 2006-03-05
date_created: 2024-10-15T11:20:53Z
date_published: 2006-02-13T00:00:00Z
date_updated: 2024-10-22T07:00:45Z
day: '13'
doi: 10.1007/11679363_116
extern: '1'
intvolume: ' 3889'
language:
- iso: eng
month: '02'
oa_version: None
page: 934-940
publication: 6th International Conference on Independent Component Analysis and Signal
Separation
publication_identifier:
eisbn:
- '9783540326311'
eissn:
- 1611-3349
isbn:
- '9783540326304'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: On separation of semitransparent dynamic images from static background
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3889
year: '2006'
...
---
OA_type: closed access
_id: '18321'
abstract:
- lang: eng
text: Recent studies on three-dimensional face recognition proposed to model facial
expressions as isometries of the facial surface. Based on this model, expression-invariant
signatures of the face were constructed by means of approximate isometric embedding
into flat spaces. Here, we apply a new method for measuring isometry-invariant
similarity between faces by embedding one facial surface into another. We demonstrate
that our approach has several significant advantages, one of which is the ability
to handle partially missing data. Promising face recognition results are obtained
in numerical experiments even when the facial surfaces are severely occluded.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
citation:
ama: 'Bronstein AM, Bronstein MM, Kimmel R. Robust expression-invariant face recognition
from partially missing data. In: 9th European Conference on Computer Vision.
Vol 3953. Springer Nature; 2006. doi:10.1007/11744078_31'
apa: 'Bronstein, A. M., Bronstein, M. M., & Kimmel, R. (2006). Robust expression-invariant
face recognition from partially missing data. In 9th European Conference on
Computer Vision (Vol. 3953). Graz, Austria: Springer Nature. https://doi.org/10.1007/11744078_31'
chicago: Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Robust Expression-Invariant
Face Recognition from Partially Missing Data.” In 9th European Conference on
Computer Vision, Vol. 3953. Springer Nature, 2006. https://doi.org/10.1007/11744078_31.
ieee: A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Robust expression-invariant
face recognition from partially missing data,” in 9th European Conference on
Computer Vision, Graz, Austria, 2006, vol. 3953.
ista: 'Bronstein AM, Bronstein MM, Kimmel R. 2006. Robust expression-invariant face
recognition from partially missing data. 9th European Conference on Computer Vision.
ECCV: European Conference on Computer Vision, LNCS, vol. 3953.'
mla: Bronstein, Alex M., et al. “Robust Expression-Invariant Face Recognition from
Partially Missing Data.” 9th European Conference on Computer Vision, vol.
3953, Springer Nature, 2006, doi:10.1007/11744078_31.
short: A.M. Bronstein, M.M. Bronstein, R. Kimmel, in:, 9th European Conference on
Computer Vision, Springer Nature, 2006.
conference:
end_date: 2006-05-13
location: Graz, Austria
name: 'ECCV: European Conference on Computer Vision'
start_date: 2006-05-07
date_created: 2024-10-15T11:20:53Z
date_published: 2006-01-01T00:00:00Z
date_updated: 2024-10-22T06:46:14Z
doi: 10.1007/11744078_31
extern: '1'
intvolume: ' 3953'
language:
- iso: eng
month: '01'
oa_version: None
publication: 9th European Conference on Computer Vision
publication_identifier:
eisbn:
- '9783540338376'
eissn:
- 1611-3349
isbn:
- '9783540338369'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Robust expression-invariant face recognition from partially missing data
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3953
year: '2006'
...
---
OA_type: closed access
_id: '18322'
abstract:
- lang: eng
text: A geometric framework for finding intrinsic correspondence between animated
3D faces is presented. We model facial expressions as isometries of the facial
surface and find the correspondence between two faces as the minimum-distortion
mapping. Generalized multidimensional scaling is used for this goal. We apply
our approach to texture mapping onto 3D video, expression exaggeration and morphing
between faces.
alternative_title:
- LNIP
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
citation:
ama: 'Bronstein AM, Bronstein MM, Kimmel R. Facetoface: An isometric model for facial
animation. In: 4th International Conference on Articulated Motion and Deformable
Objects. Vol 4069. Springer Nature; 2006:38-47. doi:10.1007/11789239_5'
apa: 'Bronstein, A. M., Bronstein, M. M., & Kimmel, R. (2006). Facetoface: An
isometric model for facial animation. In 4th International Conference on Articulated
Motion and Deformable Objects (Vol. 4069, pp. 38–47). Mallorca, Spain: Springer
Nature. https://doi.org/10.1007/11789239_5'
chicago: 'Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Facetoface:
An Isometric Model for Facial Animation.” In 4th International Conference on
Articulated Motion and Deformable Objects, 4069:38–47. Springer Nature, 2006.
https://doi.org/10.1007/11789239_5.'
ieee: 'A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Facetoface: An isometric
model for facial animation,” in 4th International Conference on Articulated
Motion and Deformable Objects, Mallorca, Spain, 2006, vol. 4069, pp. 38–47.'
ista: 'Bronstein AM, Bronstein MM, Kimmel R. 2006. Facetoface: An isometric model
for facial animation. 4th International Conference on Articulated Motion and Deformable
Objects. AMDO: Conference on Articulated Motion and Deformable Objects, LNIP,
vol. 4069, 38–47.'
mla: 'Bronstein, Alex M., et al. “Facetoface: An Isometric Model for Facial Animation.”
4th International Conference on Articulated Motion and Deformable Objects,
vol. 4069, Springer Nature, 2006, pp. 38–47, doi:10.1007/11789239_5.'
short: A.M. Bronstein, M.M. Bronstein, R. Kimmel, in:, 4th International Conference
on Articulated Motion and Deformable Objects, Springer Nature, 2006, pp. 38–47.
conference:
end_date: 2006-07-14
location: Mallorca, Spain
name: 'AMDO: Conference on Articulated Motion and Deformable Objects'
start_date: 2006-07-11
date_created: 2024-10-15T11:20:53Z
date_published: 2006-07-18T00:00:00Z
date_updated: 2024-10-22T06:42:42Z
day: '18'
doi: 10.1007/11789239_5
extern: '1'
intvolume: ' 4069'
language:
- iso: eng
month: '07'
oa_version: None
page: 38-47
publication: 4th International Conference on Articulated Motion and Deformable Objects
publication_identifier:
eisbn:
- '9783540360322'
eissn:
- 1611-3349
isbn:
- '9783540360315'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Facetoface: An isometric model for facial animation'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4069
year: '2006'
...
---
OA_type: closed access
_id: '18323'
abstract:
- lang: eng
text: We present a theoretical and computational framework for matching of two-dimensional
articulated shapes. Assuming that articulations can be modeled as near-isometries,
we show an axiomatic construction of an articulation-invariant distance between
shapes, formulated as a generalized multidimensional scaling (GMDS) problem and
solved efficiently. Some numerical results demonstrating the accuracy of our method
are presented.
alternative_title:
- LNIP
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Alfred M.
full_name: Bruckstein, Alfred M.
last_name: Bruckstein
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
citation:
ama: 'Bronstein AM, Bronstein MM, Bruckstein AM, Kimmel R. Matching two-dimensional
articulated shapes using generalized multidimensional scaling. In: 4th International
Conference on Articulated Motion and Deformable Objects. Vol 4069. Springer
Nature; 2006:48-57. doi:10.1007/11789239_6'
apa: 'Bronstein, A. M., Bronstein, M. M., Bruckstein, A. M., & Kimmel, R. (2006).
Matching two-dimensional articulated shapes using generalized multidimensional
scaling. In 4th International Conference on Articulated Motion and Deformable
Objects (Vol. 4069, pp. 48–57). Mallorca, Spain: Springer Nature. https://doi.org/10.1007/11789239_6'
chicago: Bronstein, Alex M., Michael M. Bronstein, Alfred M. Bruckstein, and Ron
Kimmel. “Matching Two-Dimensional Articulated Shapes Using Generalized Multidimensional
Scaling.” In 4th International Conference on Articulated Motion and Deformable
Objects, 4069:48–57. Springer Nature, 2006. https://doi.org/10.1007/11789239_6.
ieee: A. M. Bronstein, M. M. Bronstein, A. M. Bruckstein, and R. Kimmel, “Matching
two-dimensional articulated shapes using generalized multidimensional scaling,”
in 4th International Conference on Articulated Motion and Deformable Objects,
Mallorca, Spain, 2006, vol. 4069, pp. 48–57.
ista: 'Bronstein AM, Bronstein MM, Bruckstein AM, Kimmel R. 2006. Matching two-dimensional
articulated shapes using generalized multidimensional scaling. 4th International
Conference on Articulated Motion and Deformable Objects. AMDO: Conference on Articulated
Motion and Deformable Objects, LNIP, vol. 4069, 48–57.'
mla: Bronstein, Alex M., et al. “Matching Two-Dimensional Articulated Shapes Using
Generalized Multidimensional Scaling.” 4th International Conference on Articulated
Motion and Deformable Objects, vol. 4069, Springer Nature, 2006, pp. 48–57,
doi:10.1007/11789239_6.
short: A.M. Bronstein, M.M. Bronstein, A.M. Bruckstein, R. Kimmel, in:, 4th International
Conference on Articulated Motion and Deformable Objects, Springer Nature, 2006,
pp. 48–57.
conference:
end_date: 2006-07-14
location: Mallorca, Spain
name: 'AMDO: Conference on Articulated Motion and Deformable Objects'
start_date: 2006-07-11
date_created: 2024-10-15T11:20:53Z
date_published: 2006-07-18T00:00:00Z
date_updated: 2024-10-22T06:35:45Z
day: '18'
doi: 10.1007/11789239_6
extern: '1'
intvolume: ' 4069'
language:
- iso: eng
month: '07'
oa_version: None
page: 48-57
publication: 4th International Conference on Articulated Motion and Deformable Objects
publication_identifier:
eisbn:
- '9783540360322'
eissn:
- 1611-3349
isbn:
- '9783540360315'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Matching two-dimensional articulated shapes using generalized multidimensional
scaling
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4069
year: '2006'
...
---
OA_type: closed access
_id: '18319'
abstract:
- lang: eng
text: "The problem of isometry-invariant representation and comparison of surfaces
is of cardinal importance in pattern recognition applications dealing with deformable
objects. Particularly, in three-dimensional face recognition treating facial expressions
as isometries of the facial surface allows to perform robust recognition insensitive
to expressions.\r\nIsometry-invariant representation of surfaces can be constructed
by isometrically embedding them into some convenient space, and carrying out the
comparison in that space. Presented here is a discussion on isometric embedding
into S3, which appears to be superior over the previously used Euclidean space
in sense of the representation accuracy."
alternative_title:
- LNIP
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
citation:
ama: 'Bronstein AM, Bronstein MM, Kimmel R. Isometric embedding of facial surfaces
into S3. In: 5th International Conference on Scale-Space Theories in Computer
Vision. Vol 3459. Springer Berlin Heidelberg; 2005:622-631. doi:10.1007/11408031_53'
apa: 'Bronstein, A. M., Bronstein, M. M., & Kimmel, R. (2005). Isometric embedding
of facial surfaces into S3. In 5th International Conference on Scale-Space
Theories in Computer Vision (Vol. 3459, pp. 622–631). Hofgeismar, Germany:
Springer Berlin Heidelberg. https://doi.org/10.1007/11408031_53'
chicago: Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Isometric Embedding
of Facial Surfaces into S3.” In 5th International Conference on Scale-Space
Theories in Computer Vision, 3459:622–31. Springer Berlin Heidelberg, 2005.
https://doi.org/10.1007/11408031_53.
ieee: A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Isometric embedding of facial
surfaces into S3,” in 5th International Conference on Scale-Space Theories
in Computer Vision, Hofgeismar, Germany, 2005, vol. 3459, pp. 622–631.
ista: 'Bronstein AM, Bronstein MM, Kimmel R. 2005. Isometric embedding of facial
surfaces into S3. 5th International Conference on Scale-Space Theories in Computer
Vision. Scale Space: Conference on Scale-Space Theories in Computer Vision, LNIP,
vol. 3459, 622–631.'
mla: Bronstein, Alex M., et al. “Isometric Embedding of Facial Surfaces into S3.”
5th International Conference on Scale-Space Theories in Computer Vision,
vol. 3459, Springer Berlin Heidelberg, 2005, pp. 622–31, doi:10.1007/11408031_53.
short: A.M. Bronstein, M.M. Bronstein, R. Kimmel, in:, 5th International Conference
on Scale-Space Theories in Computer Vision, Springer Berlin Heidelberg, 2005,
pp. 622–631.
conference:
end_date: 2005-04-09
location: Hofgeismar, Germany
name: 'Scale Space: Conference on Scale-Space Theories in Computer Vision'
start_date: 2005-04-07
date_created: 2024-10-15T11:12:06Z
date_published: 2005-03-31T00:00:00Z
date_updated: 2024-10-22T06:29:06Z
day: '31'
doi: 10.1007/11408031_53
extern: '1'
intvolume: ' 3459'
language:
- iso: eng
month: '03'
oa_version: None
page: 622-631
publication: 5th International Conference on Scale-Space Theories in Computer Vision
publication_identifier:
eisbn:
- '9783540320128'
eissn:
- 1611-3349
isbn:
- '9783540255475'
issn:
- 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
quality_controlled: '1'
scopus_import: '1'
status: public
title: Isometric embedding of facial surfaces into S3
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3459
year: '2005'
...
---
_id: '11800'
abstract:
- lang: eng
text: "Web search engines have emerged as one of the central applications on the
Internet. In fact, search has become one of the most important activities that
people engage in on the the Internet. Even beyond becoming the number one source
of information, a growing number of businesses are depending on web search engines
for customer acquisition.\r\n\r\nThe first generation of web search engines used
text-only retrieval techniques. Google revolutionized the field by deploying the
PageRank technology – an eigenvector-based analysis of the hyperlink structure
– to analyze the web in order to produce relevant results. Moving forward, our
goal is to achieve a better understanding of a page with a view towards producing
even more relevant results."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: 'Henzinger M. The past, present, and future of web search engines. In: 31st
International Colloquium on Automata, Languages and Programming. Vol 3142.
Springer Nature; 2004:3. doi:10.1007/978-3-540-27836-8_2'
apa: 'Henzinger, M. (2004). The past, present, and future of web search engines.
In 31st International Colloquium on Automata, Languages and Programming
(Vol. 3142, p. 3). Turku, Finland: Springer Nature. https://doi.org/10.1007/978-3-540-27836-8_2'
chicago: Henzinger, Monika. “The Past, Present, and Future of Web Search Engines.”
In 31st International Colloquium on Automata, Languages and Programming,
3142:3. Springer Nature, 2004. https://doi.org/10.1007/978-3-540-27836-8_2.
ieee: M. Henzinger, “The past, present, and future of web search engines,” in 31st
International Colloquium on Automata, Languages and Programming, Turku, Finland,
2004, vol. 3142, p. 3.
ista: 'Henzinger M. 2004. The past, present, and future of web search engines. 31st
International Colloquium on Automata, Languages and Programming. ICALP: International
Colloquium on Automata, Languages, and Programming, LNCS, vol. 3142, 3.'
mla: Henzinger, Monika. “The Past, Present, and Future of Web Search Engines.” 31st
International Colloquium on Automata, Languages and Programming, vol. 3142,
Springer Nature, 2004, p. 3, doi:10.1007/978-3-540-27836-8_2.
short: M. Henzinger, in:, 31st International Colloquium on Automata, Languages and
Programming, Springer Nature, 2004, p. 3.
conference:
end_date: 2004-07-16
location: Turku, Finland
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2004-07-12
date_created: 2022-08-11T12:38:58Z
date_published: 2004-07-01T00:00:00Z
date_updated: 2024-11-06T08:14:51Z
day: '01'
doi: 10.1007/978-3-540-27836-8_2
extern: '1'
intvolume: ' 3142'
language:
- iso: eng
month: '07'
oa_version: None
page: '3'
publication: 31st International Colloquium on Automata, Languages and Programming
publication_identifier:
eissn:
- 1611-3349
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: The past, present, and future of web search engines
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3142
year: '2004'
...