---
_id: '18344'
abstract:
- lang: eng
  text: 'Analysis of intrinsic symmetries of non-rigid and articulated shapes is an
    important problem in pattern recognition with numerous applications ranging from
    medicine to computational aesthetics. Considering articulated planar shapes as
    closed curves, we show how to represent their extrinsic and intrinsic symmetries
    as self-similarities of local descriptor sequences, which in turn have simple
    interpretation in the frequency domain. The problem of symmetry detection and
    analysis thus boils down to analysis of descriptor sequence patterns. For that
    purpose, we show two efficient computational methods: one based on Fourier analysis,
    and another on dynamic programming.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Amit
  full_name: Hooda, Amit
  last_name: Hooda
- 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
- first_name: Radu P.
  full_name: Horaud, Radu P.
  last_name: Horaud
citation:
  ama: 'Hooda A, Bronstein MM, Bronstein AM, Horaud RP. Shape palindromes: Analysis
    of intrinsic symmetries in 2D articulated shapes. In: <i>Scale Space and Variational
    Methods in Computer Vision</i>. Vol 6667. Springer Nature; 2012:665–676. doi:<a
    href="https://doi.org/10.1007/978-3-642-24785-9_56">10.1007/978-3-642-24785-9_56</a>'
  apa: 'Hooda, A., Bronstein, M. M., Bronstein, A. M., &#38; Horaud, R. P. (2012).
    Shape palindromes: Analysis of intrinsic symmetries in 2D articulated shapes.
    In <i>Scale Space and Variational Methods in Computer Vision</i> (Vol. 6667, pp.
    665–676). Ein-Gedi, Israel: Springer Nature. <a href="https://doi.org/10.1007/978-3-642-24785-9_56">https://doi.org/10.1007/978-3-642-24785-9_56</a>'
  chicago: 'Hooda, Amit, Michael M. Bronstein, Alex M. Bronstein, and Radu P. Horaud.
    “Shape Palindromes: Analysis of Intrinsic Symmetries in 2D Articulated Shapes.”
    In <i>Scale Space and Variational Methods in Computer Vision</i>, 6667:665–676.
    Springer Nature, 2012. <a href="https://doi.org/10.1007/978-3-642-24785-9_56">https://doi.org/10.1007/978-3-642-24785-9_56</a>.'
  ieee: 'A. Hooda, M. M. Bronstein, A. M. Bronstein, and R. P. Horaud, “Shape palindromes:
    Analysis of intrinsic symmetries in 2D articulated shapes,” in <i>Scale Space
    and Variational Methods in Computer Vision</i>, Ein-Gedi, Israel, 2012, vol. 6667,
    pp. 665–676.'
  ista: 'Hooda A, Bronstein MM, Bronstein AM, Horaud RP. 2012. Shape palindromes:
    Analysis of intrinsic symmetries in 2D articulated shapes. Scale Space and Variational
    Methods in Computer Vision. Third International Conference on Scale Space and
    Variational Methods in Computer Vision, LNCS, vol. 6667, 665–676.'
  mla: 'Hooda, Amit, et al. “Shape Palindromes: Analysis of Intrinsic Symmetries in
    2D Articulated Shapes.” <i>Scale Space and Variational Methods in Computer Vision</i>,
    vol. 6667, Springer Nature, 2012, pp. 665–676, doi:<a href="https://doi.org/10.1007/978-3-642-24785-9_56">10.1007/978-3-642-24785-9_56</a>.'
  short: A. Hooda, M.M. Bronstein, A.M. Bronstein, R.P. Horaud, in:, Scale Space and
    Variational Methods in Computer Vision, Springer Nature, 2012, pp. 665–676.
conference:
  end_date: 2012-06-02
  location: Ein-Gedi, Israel
  name: Third International Conference on Scale Space and Variational Methods in Computer
    Vision
  start_date: 2012-05-29
date_created: 2024-10-15T11:20:54Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2024-12-02T13:51:51Z
doi: 10.1007/978-3-642-24785-9_56
extern: '1'
intvolume: '      6667'
language:
- iso: eng
month: '01'
oa_version: None
page: 665–676
publication: Scale Space and Variational Methods in Computer Vision
publication_identifier:
  eisbn:
  - '9783642247859'
  eissn:
  - 1611-3349
  isbn:
  - '9783642247842'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Shape palindromes: Analysis of intrinsic symmetries in 2D articulated shapes'
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 6667
year: '2012'
...
---
_id: '18345'
abstract:
- lang: eng
  text: In classical signal processing, it is common to analyze and process signals
    in the frequency domain, by representing the signal in the Fourier basis, and
    filtering it by applying a transfer function on the Fourier coefficients. In some
    applications, it is possible to design an optimal filter. A classical example
    is the Wiener filter that achieves a minimum mean squared error estimate for signal
    denoising. Here, we adopt similar concepts to construct optimal diffusion geometric
    shape descriptors. The analogy of Fourier basis are the eigenfunctions of the
    Laplace-Beltrami operator, in which many geometric constructions such as diffusion
    metrics, can be represented. By designing a filter of the Laplace-Beltrami eigenvalues,
    it is theoretically possible to achieve invariance to different shape transformations,
    like scaling. Given a set of shape classes with different transformations, we
    learn the optimal filter by minimizing the ratio between knowingly similar and
    knowingly dissimilar diffusion distances it induces. The output of the proposed
    framework is a filter that is optimally tuned to handle transformations that characterize
    the training set.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Yonathan
  full_name: Aflalo, Yonathan
  last_name: Aflalo
- 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: 'Aflalo Y, Bronstein AM, Bronstein MM, Kimmel R. Deformable shape retrieval
    by learning diffusion kernels. In: <i>3rd International Conference on Scale Space
    and Variational Methods in Computer Vision</i>. Vol 6667. Springer Nature; 2012:689-700.
    doi:<a href="https://doi.org/10.1007/978-3-642-24785-9_58">10.1007/978-3-642-24785-9_58</a>'
  apa: 'Aflalo, Y., Bronstein, A. M., Bronstein, M. M., &#38; Kimmel, R. (2012). Deformable
    shape retrieval by learning diffusion kernels. In <i>3rd International Conference
    on Scale Space and Variational Methods in Computer Vision</i> (Vol. 6667, pp.
    689–700). Ein-Gedi, Israel: Springer Nature. <a href="https://doi.org/10.1007/978-3-642-24785-9_58">https://doi.org/10.1007/978-3-642-24785-9_58</a>'
  chicago: Aflalo, Yonathan, Alex M. Bronstein, Michael M. Bronstein, and Ron Kimmel.
    “Deformable Shape Retrieval by Learning Diffusion Kernels.” In <i>3rd International
    Conference on Scale Space and Variational Methods in Computer Vision</i>, 6667:689–700.
    Springer Nature, 2012. <a href="https://doi.org/10.1007/978-3-642-24785-9_58">https://doi.org/10.1007/978-3-642-24785-9_58</a>.
  ieee: Y. Aflalo, A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Deformable shape
    retrieval by learning diffusion kernels,” in <i>3rd International Conference on
    Scale Space and Variational Methods in Computer Vision</i>, Ein-Gedi, Israel,
    2012, vol. 6667, pp. 689–700.
  ista: 'Aflalo Y, Bronstein AM, Bronstein MM, Kimmel R. 2012. Deformable shape retrieval
    by learning diffusion kernels. 3rd International Conference on Scale Space and
    Variational Methods in Computer Vision. SSVM: Scale Space and Variational Methods
    in Computer Vision, LNCS, vol. 6667, 689–700.'
  mla: Aflalo, Yonathan, et al. “Deformable Shape Retrieval by Learning Diffusion
    Kernels.” <i>3rd International Conference on Scale Space and Variational Methods
    in Computer Vision</i>, vol. 6667, Springer Nature, 2012, pp. 689–700, doi:<a
    href="https://doi.org/10.1007/978-3-642-24785-9_58">10.1007/978-3-642-24785-9_58</a>.
  short: Y. Aflalo, A.M. Bronstein, M.M. Bronstein, R. Kimmel, in:, 3rd International
    Conference on Scale Space and Variational Methods in Computer Vision, Springer
    Nature, 2012, pp. 689–700.
conference:
  end_date: 2011-06-02
  location: Ein-Gedi, Israel
  name: 'SSVM: Scale Space and Variational Methods in Computer Vision'
  start_date: 2011-05-29
date_created: 2024-10-15T11:20:54Z
date_published: 2012-01-09T00:00:00Z
date_updated: 2025-01-16T12:42:32Z
day: '09'
doi: 10.1007/978-3-642-24785-9_58
extern: '1'
intvolume: '      6667'
language:
- iso: eng
month: '01'
oa_version: None
page: 689-700
publication: 3rd International Conference on Scale Space and Variational Methods in
  Computer Vision
publication_identifier:
  eissn:
  - 1611-3349
  - '9783642247859'
  isbn:
  - '9783642247842'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Deformable shape retrieval by learning diffusion kernels
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 6667
year: '2012'
...
---
_id: '18346'
abstract:
- lang: eng
  text: Understanding of articulated shape motion plays an important role in many
    applications in the mechanical engineering, movie industry, graphics, and vision
    communities. In this paper, we study motion-based segmentation of articulated
    3D shapes into rigid parts. We pose the problem as finding a group-valued map
    between the shapes describing the motion, forcing it to favor piecewise rigid
    motions. Our computation follows the spirit of the Ambrosio-Tortorelli scheme
    for Mumford-Shah segmentation, with a diffusion component suited for the group
    nature of the motion model. Experimental results demonstrate the effectiveness
    of the proposed method in non-rigid motion segmentation.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Guy
  full_name: Rosman, Guy
  last_name: Rosman
- 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
- first_name: Alon
  full_name: Wolf, Alon
  last_name: Wolf
- first_name: Ron
  full_name: Kimmel, Ron
  last_name: Kimmel
citation:
  ama: 'Rosman G, Bronstein MM, Bronstein AM, Wolf A, Kimmel R. Group-valued regularization
    framework for motion segmentation of dynamic non-rigid shapes. In: <i>3rd International
    Conference on Scale Space and Variational Methods in Computer Vision</i>. Vol
    6667. Springer Nature; 2012:725-736. doi:<a href="https://doi.org/10.1007/978-3-642-24785-9_61">10.1007/978-3-642-24785-9_61</a>'
  apa: 'Rosman, G., Bronstein, M. M., Bronstein, A. M., Wolf, A., &#38; Kimmel, R.
    (2012). Group-valued regularization framework for motion segmentation of dynamic
    non-rigid shapes. In <i>3rd International Conference on Scale Space and Variational
    Methods in Computer Vision</i> (Vol. 6667, pp. 725–736). Ein-Gedi, Israel: Springer
    Nature. <a href="https://doi.org/10.1007/978-3-642-24785-9_61">https://doi.org/10.1007/978-3-642-24785-9_61</a>'
  chicago: Rosman, Guy, Michael M. Bronstein, Alex M. Bronstein, Alon Wolf, and Ron
    Kimmel. “Group-Valued Regularization Framework for Motion Segmentation of Dynamic
    Non-Rigid Shapes.” In <i>3rd International Conference on Scale Space and Variational
    Methods in Computer Vision</i>, 6667:725–36. Springer Nature, 2012. <a href="https://doi.org/10.1007/978-3-642-24785-9_61">https://doi.org/10.1007/978-3-642-24785-9_61</a>.
  ieee: G. Rosman, M. M. Bronstein, A. M. Bronstein, A. Wolf, and R. Kimmel, “Group-valued
    regularization framework for motion segmentation of dynamic non-rigid shapes,”
    in <i>3rd International Conference on Scale Space and Variational Methods in Computer
    Vision</i>, Ein-Gedi, Israel, 2012, vol. 6667, pp. 725–736.
  ista: 'Rosman G, Bronstein MM, Bronstein AM, Wolf A, Kimmel R. 2012. Group-valued
    regularization framework for motion segmentation of dynamic non-rigid shapes.
    3rd International Conference on Scale Space and Variational Methods in Computer
    Vision. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol.
    6667, 725–736.'
  mla: Rosman, Guy, et al. “Group-Valued Regularization Framework for Motion Segmentation
    of Dynamic Non-Rigid Shapes.” <i>3rd International Conference on Scale Space and
    Variational Methods in Computer Vision</i>, vol. 6667, Springer Nature, 2012,
    pp. 725–36, doi:<a href="https://doi.org/10.1007/978-3-642-24785-9_61">10.1007/978-3-642-24785-9_61</a>.
  short: G. Rosman, M.M. Bronstein, A.M. Bronstein, A. Wolf, R. Kimmel, in:, 3rd International
    Conference on Scale Space and Variational Methods in Computer Vision, Springer
    Nature, 2012, pp. 725–736.
conference:
  end_date: 2011-06-02
  location: Ein-Gedi, Israel
  name: 'SSVM: Scale Space and Variational Methods in Computer Vision'
  start_date: 2011-05-29
date_created: 2024-10-15T11:20:54Z
date_published: 2012-01-09T00:00:00Z
date_updated: 2025-01-16T13:26:39Z
day: '09'
doi: 10.1007/978-3-642-24785-9_61
extern: '1'
intvolume: '      6667'
language:
- iso: eng
month: '01'
oa_version: None
page: 725-736
publication: 3rd International Conference on Scale Space and Variational Methods in
  Computer Vision
publication_identifier:
  eisbn:
  - '9783642247859'
  eissn:
  - 1611-3349
  isbn:
  - '9783642247842'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Group-valued regularization framework for motion segmentation of dynamic non-rigid
  shapes
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 6667
year: '2012'
...
---
_id: '18347'
abstract:
- lang: eng
  text: Multi-part shape matching is an important class of problems, arising in many
    fields such as computational archaeology, biology, geometry processing, computer
    graphics and vision. In this paper, we address the problem of simultaneous matching
    and segmentation of multiple shapes. We assume to be given a reference shape and
    multiple parts partially matching the reference. Each of these parts can have
    additional clutter, have overlap with other parts, or there might be missing parts.
    We show experimental results of efficient and accurate assembly of fractured synthetic
    and real objects.
article_processing_charge: No
author:
- first_name: Or
  full_name: Litany, Or
  last_name: Litany
- 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: 'Litany O, Bronstein AM, Bronstein MM. Putting the pieces together: Regularized
    multi-part shape matching. In: <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>.
    Vol 7583. Springer Nature; 2012:1-11. doi:<a href="https://doi.org/10.1007/978-3-642-33863-2_1">10.1007/978-3-642-33863-2_1</a>'
  apa: 'Litany, O., Bronstein, A. M., &#38; Bronstein, M. M. (2012). Putting the pieces
    together: Regularized multi-part shape matching. In <i>Computer Vision, ECCV 2012
    - Workshops and Demonstrations</i> (Vol. 7583, pp. 1–11). Florence, Italy: Springer
    Nature. <a href="https://doi.org/10.1007/978-3-642-33863-2_1">https://doi.org/10.1007/978-3-642-33863-2_1</a>'
  chicago: 'Litany, Or, Alex M. Bronstein, and Michael M. Bronstein. “Putting the
    Pieces Together: Regularized Multi-Part Shape Matching.” In <i>Computer Vision,
    ECCV 2012 - Workshops and Demonstrations</i>, 7583:1–11. Springer Nature, 2012.
    <a href="https://doi.org/10.1007/978-3-642-33863-2_1">https://doi.org/10.1007/978-3-642-33863-2_1</a>.'
  ieee: 'O. Litany, A. M. Bronstein, and M. M. Bronstein, “Putting the pieces together:
    Regularized multi-part shape matching,” in <i>Computer Vision, ECCV 2012 - Workshops
    and Demonstrations</i>, Florence, Italy, 2012, vol. 7583, no. Part 1, pp. 1–11.'
  ista: 'Litany O, Bronstein AM, Bronstein MM. 2012. Putting the pieces together:
    Regularized multi-part shape matching. Computer Vision, ECCV 2012 - Workshops
    and Demonstrations. ECCV: European Conference on Computer Vision vol. 7583, 1–11.'
  mla: 'Litany, Or, et al. “Putting the Pieces Together: Regularized Multi-Part Shape
    Matching.” <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>, vol.
    7583, no. Part 1, Springer Nature, 2012, pp. 1–11, doi:<a href="https://doi.org/10.1007/978-3-642-33863-2_1">10.1007/978-3-642-33863-2_1</a>.'
  short: O. Litany, A.M. Bronstein, M.M. Bronstein, in:, Computer Vision, ECCV 2012
    - Workshops and Demonstrations, Springer Nature, 2012, pp. 1–11.
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:30:30Z
day: '31'
doi: 10.1007/978-3-642-33863-2_1
extern: '1'
intvolume: '      7583'
issue: Part 1
language:
- iso: eng
month: '08'
oa_version: None
page: 1-11
publication: Computer Vision, ECCV 2012 - Workshops and Demonstrations
publication_identifier:
  eissn:
  - 1611-3349
  - '9783642338632'
  isbn:
  - '9783642338625'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: 'Putting the pieces together: Regularized multi-part shape matching'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7583
year: '2012'
...
---
_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: <i>Computer Vision, ECCV 2012 - Workshops
    and Demonstrations</i>. Vol 7583. Springer Nature; 2012:52-62. doi:<a href="https://doi.org/10.1007/978-3-642-33863-2_6">10.1007/978-3-642-33863-2_6</a>'
  apa: 'Rosman, G., Bronstein, A. M., Bronstein, M. M., Tai, X.-C., &#38; Kimmel,
    R. (2012). Group-valued regularization for analysis of articulated motion. In
    <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i> (Vol. 7583, pp.
    52–62). Florence, Italy: Springer Nature. <a href="https://doi.org/10.1007/978-3-642-33863-2_6">https://doi.org/10.1007/978-3-642-33863-2_6</a>'
  chicago: Rosman, Guy, Alex M. Bronstein, Michael M. Bronstein, Xue-Cheng Tai, and
    Ron Kimmel. “Group-Valued Regularization for Analysis of Articulated Motion.”
    In <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>, 7583:52–62.
    Springer Nature, 2012. <a href="https://doi.org/10.1007/978-3-642-33863-2_6">https://doi.org/10.1007/978-3-642-33863-2_6</a>.
  ieee: G. Rosman, A. M. Bronstein, M. M. Bronstein, X.-C. Tai, and R. Kimmel, “Group-valued
    regularization for analysis of articulated motion,” in <i>Computer Vision, ECCV
    2012 - Workshops and Demonstrations</i>, 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.” <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>, vol.
    7583, no. Part 1, Springer Nature, 2012, pp. 52–62, doi:<a href="https://doi.org/10.1007/978-3-642-33863-2_6">10.1007/978-3-642-33863-2_6</a>.
  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:
    <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>. Vol 7583. Springer
    Nature; 2012:83-91. doi:<a href="https://doi.org/10.1007/978-3-642-33863-2_9">10.1007/978-3-642-33863-2_9</a>'
  apa: 'Kovnatsky, A., Bronstein, M. M., &#38; Bronstein, A. M. (2012). Stable Spectral
    Mesh Filtering. In <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>
    (Vol. 7583, pp. 83–91). Florence, Italy: Springer Nature. <a href="https://doi.org/10.1007/978-3-642-33863-2_9">https://doi.org/10.1007/978-3-642-33863-2_9</a>'
  chicago: Kovnatsky, Artiom, Michael M. Bronstein, and Alex M. Bronstein. “Stable
    Spectral Mesh Filtering.” In <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>,
    7583:83–91. Springer Nature, 2012. <a href="https://doi.org/10.1007/978-3-642-33863-2_9">https://doi.org/10.1007/978-3-642-33863-2_9</a>.
  ieee: A. Kovnatsky, M. M. Bronstein, and A. M. Bronstein, “Stable Spectral Mesh
    Filtering,” in <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>,
    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.” <i>Computer Vision,
    ECCV 2012 - Workshops and Demonstrations</i>, vol. 7583, no. Part 1, Springer
    Nature, 2012, pp. 83–91, doi:<a href="https://doi.org/10.1007/978-3-642-33863-2_9">10.1007/978-3-642-33863-2_9</a>.
  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: <i>15th International Workshop on Theoretical
    Foundations of Computer Vision</i>. Vol 7474. Springer Nature; 2012:177-190. doi:<a
    href="https://doi.org/10.1007/978-3-642-34091-8_8">10.1007/978-3-642-34091-8_8</a>'
  apa: 'Raviv, D., Bronstein, A. M., Bronstein, M. M., Kimmel, R., &#38; Sochen, N.
    (2012). Equi-affine invariant geometries of articulated objects. In <i>15th International
    Workshop on Theoretical Foundations of Computer Vision</i> (Vol. 7474, pp. 177–190).
    Dagstuhl, Germany: Springer Nature. <a href="https://doi.org/10.1007/978-3-642-34091-8_8">https://doi.org/10.1007/978-3-642-34091-8_8</a>'
  chicago: Raviv, Dan, Alex M. Bronstein, Michael M. Bronstein, Ron Kimmel, and Nir
    Sochen. “Equi-Affine Invariant Geometries of Articulated Objects.” In <i>15th
    International Workshop on Theoretical Foundations of Computer Vision</i>, 7474:177–90.
    Springer Nature, 2012. <a href="https://doi.org/10.1007/978-3-642-34091-8_8">https://doi.org/10.1007/978-3-642-34091-8_8</a>.
  ieee: D. Raviv, A. M. Bronstein, M. M. Bronstein, R. Kimmel, and N. Sochen, “Equi-affine
    invariant geometries of articulated objects,” in <i>15th International Workshop
    on Theoretical Foundations of Computer Vision</i>, 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.”
    <i>15th International Workshop on Theoretical Foundations of Computer Vision</i>,
    vol. 7474, Springer Nature, 2012, pp. 177–90, doi:<a href="https://doi.org/10.1007/978-3-642-34091-8_8">10.1007/978-3-642-34091-8_8</a>.
  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: '18364'
abstract:
- lang: eng
  text: Region feature detectors and descriptors have become a successful and popular
    alternative to point descriptors in image analysis due to their high robustness
    and repeatability, leading to a significant interest in the shape analysis community
    in finding analogous approaches in the 3D world. Recent works have successfully
    extended the maximally stable extremal region (MSER) detection algorithm to surfaces.
    In many applications, however, a volumetric shape model is more appropriate, and
    modeling shape deformations as approximate isometries of the volume of an object,
    rather than its boundary, better captures natural behavior of non-rigid deformations.
    In this paper, we formulate a diffusion-geometric framework for volumetric stable
    component detection and description in deformable shapes. An evaluation of our
    method on the SHREC'11 feature detection benchmark and SCAPE human body scans
    shows its potential as a source of high-quality features. Examples demonstrating
    the drawbacks of surface stable components and the advantage of their volumetric
    counterparts are also presented.
article_processing_charge: No
article_type: original
author:
- first_name: R.
  full_name: Litman, R.
  last_name: Litman
- first_name: Alexander
  full_name: Bronstein, Alexander
  id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
  last_name: Bronstein
  orcid: 0000-0001-9699-8730
- first_name: M.M.
  full_name: Bronstein, M.M.
  last_name: Bronstein
citation:
  ama: Litman R, Bronstein AM, Bronstein MM. Stable volumetric features in deformable
    shapes. <i>Computers &#38; Graphics</i>. 2012;36(5):569-576. doi:<a href="https://doi.org/10.1016/j.cag.2012.03.034">10.1016/j.cag.2012.03.034</a>
  apa: Litman, R., Bronstein, A. M., &#38; Bronstein, M. M. (2012). Stable volumetric
    features in deformable shapes. <i>Computers &#38; Graphics</i>. Elsevier. <a href="https://doi.org/10.1016/j.cag.2012.03.034">https://doi.org/10.1016/j.cag.2012.03.034</a>
  chicago: Litman, R., Alex M. Bronstein, and M.M. Bronstein. “Stable Volumetric Features
    in Deformable Shapes.” <i>Computers &#38; Graphics</i>. Elsevier, 2012. <a href="https://doi.org/10.1016/j.cag.2012.03.034">https://doi.org/10.1016/j.cag.2012.03.034</a>.
  ieee: R. Litman, A. M. Bronstein, and M. M. Bronstein, “Stable volumetric features
    in deformable shapes,” <i>Computers &#38; Graphics</i>, vol. 36, no. 5. Elsevier,
    pp. 569–576, 2012.
  ista: Litman R, Bronstein AM, Bronstein MM. 2012. Stable volumetric features in
    deformable shapes. Computers &#38; Graphics. 36(5), 569–576.
  mla: Litman, R., et al. “Stable Volumetric Features in Deformable Shapes.” <i>Computers
    &#38; Graphics</i>, vol. 36, no. 5, Elsevier, 2012, pp. 569–76, doi:<a href="https://doi.org/10.1016/j.cag.2012.03.034">10.1016/j.cag.2012.03.034</a>.
  short: R. Litman, A.M. Bronstein, M.M. Bronstein, Computers &#38; Graphics 36 (2012)
    569–576.
date_created: 2024-10-15T11:20:54Z
date_published: 2012-08-01T00:00:00Z
date_updated: 2024-11-12T08:42:27Z
day: '01'
doi: 10.1016/j.cag.2012.03.034
extern: '1'
intvolume: '        36'
issue: '5'
language:
- iso: eng
month: '08'
oa_version: None
page: 569-576
publication: Computers & Graphics
publication_identifier:
  issn:
  - 0097-8493
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Stable volumetric features in deformable shapes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2012'
...
---
_id: '18378'
abstract:
- lang: eng
  text: 'In this work, we present intrinsic shape context (ISC) descriptors for 3D
    shapes. We generalize to surfaces the polar sampling of the image domain used
    in shape contexts: for this purpose, we chart the surface by shooting geodesic
    outwards from the point being analyzed; `angle'' is treated as tantamount to geodesic
    shooting direction, and radius as geodesic distance. To deal with orientation
    ambiguity, we exploit properties of the Fourier transform. Our charting method
    is intrinsic, i.e., invariant to isometric shape transformations. The resulting
    descriptor is a meta-descriptor that can be applied to any photometric or geometric
    property field defined on the shape, in particular, we can leverage recent developments
    in intrinsic shape analysis and construct ISC based on state-of-the-art dense
    shape descriptors such as heat kernel signatures. Our experiments demonstrate
    a notable improvement in shape matching on standard benchmarks.'
article_number: '6247671'
article_processing_charge: No
author:
- first_name: I.
  full_name: Kokkinos, I.
  last_name: Kokkinos
- first_name: M. M.
  full_name: Bronstein, M. M.
  last_name: Bronstein
- first_name: R.
  full_name: Litman, R.
  last_name: Litman
- first_name: Alexander
  full_name: Bronstein, Alexander
  id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
  last_name: Bronstein
  orcid: 0000-0001-9699-8730
citation:
  ama: 'Kokkinos I, Bronstein MM, Litman R, Bronstein AM. Intrinsic shape context
    descriptors for deformable shapes. In: <i>2012 IEEE Conference on Computer Vision
    and Pattern Recognition</i>. IEEE; 2012. doi:<a href="https://doi.org/10.1109/cvpr.2012.6247671">10.1109/cvpr.2012.6247671</a>'
  apa: 'Kokkinos, I., Bronstein, M. M., Litman, R., &#38; Bronstein, A. M. (2012).
    Intrinsic shape context descriptors for deformable shapes. In <i>2012 IEEE Conference
    on Computer Vision and Pattern Recognition</i>. Providence, RI, United States:
    IEEE. <a href="https://doi.org/10.1109/cvpr.2012.6247671">https://doi.org/10.1109/cvpr.2012.6247671</a>'
  chicago: Kokkinos, I., M. M. Bronstein, R. Litman, and Alex M. Bronstein. “Intrinsic
    Shape Context Descriptors for Deformable Shapes.” In <i>2012 IEEE Conference on
    Computer Vision and Pattern Recognition</i>. IEEE, 2012. <a href="https://doi.org/10.1109/cvpr.2012.6247671">https://doi.org/10.1109/cvpr.2012.6247671</a>.
  ieee: I. Kokkinos, M. M. Bronstein, R. Litman, and A. M. Bronstein, “Intrinsic shape
    context descriptors for deformable shapes,” in <i>2012 IEEE Conference on Computer
    Vision and Pattern Recognition</i>, Providence, RI, United States, 2012.
  ista: Kokkinos I, Bronstein MM, Litman R, Bronstein AM. 2012. Intrinsic shape context
    descriptors for deformable shapes. 2012 IEEE Conference on Computer Vision and
    Pattern Recognition. IEEE Conference on Computer Vision and Pattern Recognition,
    6247671.
  mla: Kokkinos, I., et al. “Intrinsic Shape Context Descriptors for Deformable Shapes.”
    <i>2012 IEEE Conference on Computer Vision and Pattern Recognition</i>, 6247671,
    IEEE, 2012, doi:<a href="https://doi.org/10.1109/cvpr.2012.6247671">10.1109/cvpr.2012.6247671</a>.
  short: I. Kokkinos, M.M. Bronstein, R. Litman, A.M. Bronstein, in:, 2012 IEEE Conference
    on Computer Vision and Pattern Recognition, IEEE, 2012.
conference:
  end_date: 2012-06-21
  location: Providence, RI, United States
  name: IEEE Conference on Computer Vision and Pattern Recognition
  start_date: 2012-06-16
date_created: 2024-10-15T11:20:54Z
date_published: 2012-07-26T00:00:00Z
date_updated: 2024-12-04T12:27:48Z
day: '26'
doi: 10.1109/cvpr.2012.6247671
extern: '1'
language:
- iso: eng
month: '07'
oa_version: None
publication: 2012 IEEE Conference on Computer Vision and Pattern Recognition
publication_identifier:
  eissn:
  - 1063-6919
  isbn:
  - '9781467312264'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Intrinsic shape context descriptors for deformable shapes
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '18379'
abstract:
- lang: eng
  text: We consider the problem of minimum distortion intrinsic correspondence between
    deformable shapes, many useful formulations of which give rise to the NP-hard
    quadratic assignment problem (QAP). Previous attempts to use the spectral relaxation
    have had limited success due to the lack of sparsity of the obtained “fuzzy” solution.
    In this paper, we adopt the recently introduced alternative L 1 relaxation of
    the QAP based on the principles of game theory. We relate it to the Gromov and
    Lipschitz metrics between metric spaces and demonstrate on state-of-the-art benchmarks
    that the proposed approach is capable of finding very accurate sparse correspondences
    between deformable shapes.
article_number: '6247674'
article_processing_charge: No
author:
- first_name: E.
  full_name: Rodola, E.
  last_name: Rodola
- first_name: Alexander
  full_name: Bronstein, Alexander
  id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
  last_name: Bronstein
  orcid: 0000-0001-9699-8730
- first_name: A.
  full_name: Albarelli, A.
  last_name: Albarelli
- first_name: F.
  full_name: Bergamasco, F.
  last_name: Bergamasco
- first_name: A.
  full_name: Torsello, A.
  last_name: Torsello
citation:
  ama: 'Rodola E, Bronstein AM, Albarelli A, Bergamasco F, Torsello A. A game-theoretic
    approach to deformable shape matching. In: <i>2012 IEEE Conference on Computer
    Vision and Pattern Recognition</i>. IEEE; 2012. doi:<a href="https://doi.org/10.1109/cvpr.2012.6247674">10.1109/cvpr.2012.6247674</a>'
  apa: 'Rodola, E., Bronstein, A. M., Albarelli, A., Bergamasco, F., &#38; Torsello,
    A. (2012). A game-theoretic approach to deformable shape matching. In <i>2012
    IEEE Conference on Computer Vision and Pattern Recognition</i>. Providence, RI,
    United States: IEEE. <a href="https://doi.org/10.1109/cvpr.2012.6247674">https://doi.org/10.1109/cvpr.2012.6247674</a>'
  chicago: Rodola, E., Alex M. Bronstein, A. Albarelli, F. Bergamasco, and A. Torsello.
    “A Game-Theoretic Approach to Deformable Shape Matching.” In <i>2012 IEEE Conference
    on Computer Vision and Pattern Recognition</i>. IEEE, 2012. <a href="https://doi.org/10.1109/cvpr.2012.6247674">https://doi.org/10.1109/cvpr.2012.6247674</a>.
  ieee: E. Rodola, A. M. Bronstein, A. Albarelli, F. Bergamasco, and A. Torsello,
    “A game-theoretic approach to deformable shape matching,” in <i>2012 IEEE Conference
    on Computer Vision and Pattern Recognition</i>, Providence, RI, United States,
    2012.
  ista: Rodola E, Bronstein AM, Albarelli A, Bergamasco F, Torsello A. 2012. A game-theoretic
    approach to deformable shape matching. 2012 IEEE Conference on Computer Vision
    and Pattern Recognition. IEEE Conference on Computer Vision and Pattern Recognition,
    6247674.
  mla: Rodola, E., et al. “A Game-Theoretic Approach to Deformable Shape Matching.”
    <i>2012 IEEE Conference on Computer Vision and Pattern Recognition</i>, 6247674,
    IEEE, 2012, doi:<a href="https://doi.org/10.1109/cvpr.2012.6247674">10.1109/cvpr.2012.6247674</a>.
  short: E. Rodola, A.M. Bronstein, A. Albarelli, F. Bergamasco, A. Torsello, in:,
    2012 IEEE Conference on Computer Vision and Pattern Recognition, IEEE, 2012.
conference:
  end_date: 2012-06-21
  location: Providence, RI, United States
  name: IEEE Conference on Computer Vision and Pattern Recognition
  start_date: 2012-06-16
date_created: 2024-10-15T11:20:54Z
date_published: 2012-07-26T00:00:00Z
date_updated: 2024-12-04T12:22:03Z
day: '26'
doi: 10.1109/cvpr.2012.6247674
extern: '1'
language:
- iso: eng
month: '07'
oa_version: None
publication: 2012 IEEE Conference on Computer Vision and Pattern Recognition
publication_identifier:
  eissn:
  - 1063-6919
  isbn:
  - 978-1-4673-1226-4
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: A game-theoretic approach to deformable shape matching
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '18412'
abstract:
- lang: eng
  text: SIFT-like local feature descriptors are ubiquitously employed in computer
    vision applications such as content-based retrieval, video analysis, copy detection,
    object recognition, photo tourism, and 3D reconstruction. Feature descriptors
    can be designed to be invariant to certain classes of photometric and geometric
    transformations, in particular, affine and intensity scale transformations. However,
    real transformations that an image can undergo can only be approximately modeled
    in this way, and thus most descriptors are only approximately invariant in practice.
    Second, descriptors are usually high dimensional (e.g., SIFT is represented as
    a 128--dimensional vector). In large-scale retrieval and matching problems, this
    can pose challenges in storing and retrieving descriptor data. We map the descriptor
    vectors into the Hamming space in which the Hamming metric is used to compare
    the resulting representations. This way, we reduce the size of the descriptors
    by representing them as short binary strings and learn descriptor invariance from
    examples. We show extensive experimental validation, demonstrating the advantage
    of the proposed approach.
article_processing_charge: No
article_type: original
author:
- first_name: C.
  full_name: Strecha, C.
  last_name: Strecha
- first_name: Alexander
  full_name: Bronstein, Alexander
  id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
  last_name: Bronstein
  orcid: 0000-0001-9699-8730
- first_name: M. M.
  full_name: Bronstein, M. M.
  last_name: Bronstein
- first_name: P.
  full_name: Fua, P.
  last_name: Fua
citation:
  ama: 'Strecha C, Bronstein AM, Bronstein MM, Fua P. LDAHash: Improved matching with
    smaller descriptors. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>.
    2012;34(1):66-78. doi:<a href="https://doi.org/10.1109/tpami.2011.103">10.1109/tpami.2011.103</a>'
  apa: 'Strecha, C., Bronstein, A. M., Bronstein, M. M., &#38; Fua, P. (2012). LDAHash:
    Improved matching with smaller descriptors. <i>IEEE Transactions on Pattern Analysis
    and Machine Intelligence</i>. Institute of Electrical and Electronics Engineers.
    <a href="https://doi.org/10.1109/tpami.2011.103">https://doi.org/10.1109/tpami.2011.103</a>'
  chicago: 'Strecha, C., Alex M. Bronstein, M. M. Bronstein, and P. Fua. “LDAHash:
    Improved Matching with Smaller Descriptors.” <i>IEEE Transactions on Pattern Analysis
    and Machine Intelligence</i>. Institute of Electrical and Electronics Engineers,
    2012. <a href="https://doi.org/10.1109/tpami.2011.103">https://doi.org/10.1109/tpami.2011.103</a>.'
  ieee: 'C. Strecha, A. M. Bronstein, M. M. Bronstein, and P. Fua, “LDAHash: Improved
    matching with smaller descriptors,” <i>IEEE Transactions on Pattern Analysis and
    Machine Intelligence</i>, vol. 34, no. 1. Institute of Electrical and Electronics
    Engineers, pp. 66–78, 2012.'
  ista: 'Strecha C, Bronstein AM, Bronstein MM, Fua P. 2012. LDAHash: Improved matching
    with smaller descriptors. IEEE Transactions on Pattern Analysis and Machine Intelligence.
    34(1), 66–78.'
  mla: 'Strecha, C., et al. “LDAHash: Improved Matching with Smaller Descriptors.”
    <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 34,
    no. 1, Institute of Electrical and Electronics Engineers, 2012, pp. 66–78, doi:<a
    href="https://doi.org/10.1109/tpami.2011.103">10.1109/tpami.2011.103</a>.'
  short: C. Strecha, A.M. Bronstein, M.M. Bronstein, P. Fua, IEEE Transactions on
    Pattern Analysis and Machine Intelligence 34 (2012) 66–78.
date_created: 2024-10-15T11:20:54Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2024-11-12T08:34:48Z
day: '01'
doi: 10.1109/tpami.2011.103
extern: '1'
external_id:
  pmid:
  - '21576750 '
intvolume: '        34'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 66-78
pmid: 1
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_identifier:
  eissn:
  - 2160-9292
  issn:
  - 0162-8828
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'LDAHash: Improved matching with smaller descriptors'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2012'
...
---
OA_place: repository
OA_type: green
_id: '22056'
abstract:
- lang: eng
  text: We consider the mass-critical generalized Korteweg{de Vries equation (∂t +
    ∂xxx)u = ±∂ x(u 5) for real-valued functions u(t; x). We prove that if the global
    well-posedness and scattering conjecture for this equation failed, then, conditional
    on a positive answer to the global well-posedness and scattering conjecture for
    the masscritical nonlinear Schrffodinger equation (-i∂ t + ∂xx)u = ±(|u| 4u),
    there exists a minimal-mass blowup solution to the mass-critical generalized KdV
    equation which is almost periodic modulo the symmetries of the equation. Moreover,
    we can guarantee that this minimal-mass blowup solution is either a self-similar
    solution, a soliton-like solution, or a double high-to-low frequency cascade solution.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Rowan
  full_name: Killip, Rowan
  last_name: Killip
- first_name: Soonsik
  full_name: Kwon, Soonsik
  last_name: Kwon
- first_name: Shuanglin
  full_name: Shao, Shuanglin
  last_name: Shao
- first_name: Monica
  full_name: Visan, Monica
  id: 056daca0-b8d1-11f0-964f-f91054abf8ca
  last_name: Visan
citation:
  ama: Killip R, Kwon S, Shao S, Vişan M. On the mass-critical generalized KdV equation.
    <i>Discrete and Continuous Dynamical Systems</i>. 2012;32(1):191-221. doi:<a href="https://doi.org/10.3934/dcds.2012.32.191">10.3934/dcds.2012.32.191</a>
  apa: Killip, R., Kwon, S., Shao, S., &#38; Vişan, M. (2012). On the mass-critical
    generalized KdV equation. <i>Discrete and Continuous Dynamical Systems</i>. American
    Institute of Mathematical Sciences. <a href="https://doi.org/10.3934/dcds.2012.32.191">https://doi.org/10.3934/dcds.2012.32.191</a>
  chicago: Killip, Rowan, Soonsik Kwon, Shuanglin Shao, and Monica Vişan. “On the
    Mass-Critical Generalized KdV Equation.” <i>Discrete and Continuous Dynamical
    Systems</i>. American Institute of Mathematical Sciences, 2012. <a href="https://doi.org/10.3934/dcds.2012.32.191">https://doi.org/10.3934/dcds.2012.32.191</a>.
  ieee: R. Killip, S. Kwon, S. Shao, and M. Vişan, “On the mass-critical generalized
    KdV equation,” <i>Discrete and Continuous Dynamical Systems</i>, vol. 32, no.
    1. American Institute of Mathematical Sciences, pp. 191–221, 2012.
  ista: Killip R, Kwon S, Shao S, Vişan M. 2012. On the mass-critical generalized
    KdV equation. Discrete and Continuous Dynamical Systems. 32(1), 191–221.
  mla: Killip, Rowan, et al. “On the Mass-Critical Generalized KdV Equation.” <i>Discrete
    and Continuous Dynamical Systems</i>, vol. 32, no. 1, American Institute of Mathematical
    Sciences, 2012, pp. 191–221, doi:<a href="https://doi.org/10.3934/dcds.2012.32.191">10.3934/dcds.2012.32.191</a>.
  short: R. Killip, S. Kwon, S. Shao, M. Vişan, Discrete and Continuous Dynamical
    Systems 32 (2012) 191–221.
das_tickbox: '1'
date_created: 2026-06-19T07:57:09Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2026-06-29T09:59:46Z
day: '01'
doi: 10.3934/dcds.2012.32.191
extern: '1'
external_id:
  arxiv:
  - '0907.5412'
intvolume: '        32'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.0907.5412
mathsc:
- 35Q53
month: '01'
oa: 1
oa_version: Preprint
page: 191-221
publication: Discrete and Continuous Dynamical Systems
publication_identifier:
  eissn:
  - 1553-5231
  issn:
  - 1078-0947
publication_status: published
publisher: American Institute of Mathematical Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the mass-critical generalized KdV equation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2012'
...
---
OA_place: repository
OA_type: green
_id: '22075'
abstract:
- lang: eng
  text: 'In this short note, we present a new proof of the global well-posedness and
    scattering result for the defocusing energy-critical nonlinear Schrödinger equation
    (NLS) in four space dimensions obtained previously by Ryckman and Visan [“Global
    well-posedness and scattering for the defocusing energycritical nonlinear Schrödinger
    equation in R^1+4⁠.” American Journal of Mathematics 129 (2007): 1–60. MR2288737].
    The argument is inspired by the recent work of Dodson [“Global well-posedness
    and scattering for the defocusing, L2-critical, nonlinear Schrödinger equation
    when d≥3.” (2009): preprint arXiv:0912.2467.] on the mass-critical NLS.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Monica
  full_name: Visan, Monica
  id: 056daca0-b8d1-11f0-964f-f91054abf8ca
  last_name: Visan
citation:
  ama: Vişan M. Global well-posedness and scattering for the defocusing cubic nonlinear
    Schrödinger equation in four dimensions. <i>International Mathematics Research
    Notices</i>. 2012;2012(5):1037-1067. doi:<a href="https://doi.org/10.1093/imrn/rnr051">10.1093/imrn/rnr051</a>
  apa: Vişan, M. (2012). Global well-posedness and scattering for the defocusing cubic
    nonlinear Schrödinger equation in four dimensions. <i>International Mathematics
    Research Notices</i>. Oxford University Press. <a href="https://doi.org/10.1093/imrn/rnr051">https://doi.org/10.1093/imrn/rnr051</a>
  chicago: Vişan, Monica. “Global Well-Posedness and Scattering for the Defocusing
    Cubic Nonlinear Schrödinger Equation in Four Dimensions.” <i>International Mathematics
    Research Notices</i>. Oxford University Press, 2012. <a href="https://doi.org/10.1093/imrn/rnr051">https://doi.org/10.1093/imrn/rnr051</a>.
  ieee: M. Vişan, “Global well-posedness and scattering for the defocusing cubic nonlinear
    Schrödinger equation in four dimensions,” <i>International Mathematics Research
    Notices</i>, vol. 2012, no. 5. Oxford University Press, pp. 1037–1067, 2012.
  ista: Vişan M. 2012. Global well-posedness and scattering for the defocusing cubic
    nonlinear Schrödinger equation in four dimensions. International Mathematics Research
    Notices. 2012(5), 1037–1067.
  mla: Vişan, Monica. “Global Well-Posedness and Scattering for the Defocusing Cubic
    Nonlinear Schrödinger Equation in Four Dimensions.” <i>International Mathematics
    Research Notices</i>, vol. 2012, no. 5, Oxford University Press, 2012, pp. 1037–67,
    doi:<a href="https://doi.org/10.1093/imrn/rnr051">10.1093/imrn/rnr051</a>.
  short: M. Vişan, International Mathematics Research Notices 2012 (2012) 1037–1067.
das_tickbox: '1'
date_created: 2026-06-19T08:23:13Z
date_published: 2012-05-01T00:00:00Z
date_updated: 2026-06-30T11:21:51Z
day: '01'
doi: 10.1093/imrn/rnr051
extern: '1'
external_id:
  arxiv:
  - '1011.1526'
intvolume: '      2012'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.1011.1526
month: '05'
oa: 1
oa_version: Preprint
page: 1037-1067
publication: International Mathematics Research Notices
publication_identifier:
  eissn:
  - 1687-0247
  issn:
  - 1073-7928
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Global well-posedness and scattering for the defocusing cubic nonlinear Schrödinger
  equation in four dimensions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2012
year: '2012'
...
---
_id: '2318'
abstract:
- lang: eng
  text: 'We show that bosons interacting via pair potentials with negative scattering
    length form bound states for a suitable number of particles. In other words, the
    absence of many-particle bound states of any kind implies the non-negativity of
    the scattering length of the interaction potential. '
acknowledgement: 'Partial financial support by NSERC '
article_processing_charge: No
arxiv: 1
author:
- first_name: Robert
  full_name: Seiringer, Robert
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
citation:
  ama: Seiringer R. Absence of bound states implies non-negativity of the scattering
    length. <i>Journal of Spectral Theory</i>. 2012;2(3):321-328. doi:<a href="https://doi.org/10.4171/JST/31">10.4171/JST/31</a>
  apa: Seiringer, R. (2012). Absence of bound states implies non-negativity of the
    scattering length. <i>Journal of Spectral Theory</i>. EMS Press. <a href="https://doi.org/10.4171/JST/31">https://doi.org/10.4171/JST/31</a>
  chicago: Seiringer, Robert. “Absence of Bound States Implies Non-Negativity of the
    Scattering Length.” <i>Journal of Spectral Theory</i>. EMS Press, 2012. <a href="https://doi.org/10.4171/JST/31">https://doi.org/10.4171/JST/31</a>.
  ieee: R. Seiringer, “Absence of bound states implies non-negativity of the scattering
    length,” <i>Journal of Spectral Theory</i>, vol. 2, no. 3. EMS Press, pp. 321–328,
    2012.
  ista: Seiringer R. 2012. Absence of bound states implies non-negativity of the scattering
    length. Journal of Spectral Theory. 2(3), 321–328.
  mla: Seiringer, Robert. “Absence of Bound States Implies Non-Negativity of the Scattering
    Length.” <i>Journal of Spectral Theory</i>, vol. 2, no. 3, EMS Press, 2012, pp.
    321–28, doi:<a href="https://doi.org/10.4171/JST/31">10.4171/JST/31</a>.
  short: R. Seiringer, Journal of Spectral Theory 2 (2012) 321–328.
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T11:56:58Z
date_published: 2012-06-24T00:00:00Z
date_updated: 2026-07-06T11:57:04Z
day: '24'
department:
- _id: RoSe
doi: 10.4171/JST/31
external_id:
  arxiv:
  - '1204.0435'
  isi:
  - '000209021900004'
intvolume: '         2'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1204.0435
month: '06'
oa: 1
oa_version: Preprint
page: 321-328
publication: Journal of Spectral Theory
publication_status: published
publisher: EMS Press
publist_id: '4609'
quality_controlled: '1'
status: public
title: Absence of bound states implies non-negativity of the scattering length
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2012'
...
---
_id: '2954'
abstract:
- lang: eng
  text: Spontaneous postsynaptic currents (PSCs) provide key information about the
    mechanisms of synaptic transmission and the activity modes of neuronal networks.
    However, detecting spontaneous PSCs in vitro and in vivo has been challenging,
    because of the small amplitude, the variable kinetics, and the undefined time
    of generation of these events. Here, we describe a, to our knowledge, new method
    for detecting spontaneous synaptic events by deconvolution, using a template that
    approximates the average time course of spontaneous PSCs. A recorded PSC trace
    is deconvolved from the template, resulting in a series of delta-like functions.
    The maxima of these delta-like events are reliably detected, revealing the precise
    onset times of the spontaneous PSCs. Among all detection methods, the deconvolution-based
    method has a unique temporal resolution, allowing the detection of individual
    events in high-frequency bursts. Furthermore, the deconvolution-based method has
    a high amplitude resolution, because deconvolution can substantially increase
    the signal/noise ratio. When tested against previously published methods using
    experimental data, the deconvolution-based method was superior for spontaneous
    PSCs recorded in vivo. Using the high-resolution deconvolution-based detection
    algorithm, we show that the frequency of spontaneous excitatory postsynaptic currents
    in dentate gyrus granule cells is 4.5 times higher in vivo than in vitro.
acknowledgement: "This work was supported by the Deutsche Forschungsgemeinschaft (TR3/B10)
  and a European Research Council Advanced grant to P.J.\r\nWe thank H. Hu, S. J.
  Guzman, and C. Schmidt-Hieber for critically reading the manuscript, I. Koeva and
  F. Marr for technical support, and E. Kramberger for editorial assistance.\r\n"
article_processing_charge: No
author:
- first_name: Alejandro
  full_name: Pernia-Andrade, Alejandro
  id: 36963E98-F248-11E8-B48F-1D18A9856A87
  last_name: Pernia-Andrade
- first_name: Sarit
  full_name: Goswami, Sarit
  id: 3A578F32-F248-11E8-B48F-1D18A9856A87
  last_name: Goswami
- first_name: Yvonne
  full_name: Stickler, Yvonne
  id: 63B76600-E9CC-11E9-9B5F-82450873F7A1
  last_name: Stickler
- first_name: Ulrich
  full_name: Fröbe, Ulrich
  last_name: Fröbe
- first_name: Alois
  full_name: Schlögl, Alois
  id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
  last_name: Schlögl
  orcid: 0000-0002-5621-8100
- first_name: Peter M
  full_name: Jonas, Peter M
  id: 353C1B58-F248-11E8-B48F-1D18A9856A87
  last_name: Jonas
  orcid: 0000-0001-5001-4804
citation:
  ama: Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. A deconvolution
    based method with high sensitivity and temporal resolution for detection of spontaneous
    synaptic currents in vitro and in vivo. <i>Biophysical Journal</i>. 2012;103(7):1429-1439.
    doi:<a href="https://doi.org/10.1016/j.bpj.2012.08.039">10.1016/j.bpj.2012.08.039</a>
  apa: Pernia-Andrade, A., Goswami, S., Stickler, Y., Fröbe, U., Schlögl, A., &#38;
    Jonas, P. M. (2012). A deconvolution based method with high sensitivity and temporal
    resolution for detection of spontaneous synaptic currents in vitro and in vivo.
    <i>Biophysical Journal</i>. Biophysical Society. <a href="https://doi.org/10.1016/j.bpj.2012.08.039">https://doi.org/10.1016/j.bpj.2012.08.039</a>
  chicago: Pernia-Andrade, Alejandro, Sarit Goswami, Yvonne Stickler, Ulrich Fröbe,
    Alois Schlögl, and Peter M Jonas. “A Deconvolution Based Method with High Sensitivity
    and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro
    and in Vivo.” <i>Biophysical Journal</i>. Biophysical Society, 2012. <a href="https://doi.org/10.1016/j.bpj.2012.08.039">https://doi.org/10.1016/j.bpj.2012.08.039</a>.
  ieee: A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, and P. M.
    Jonas, “A deconvolution based method with high sensitivity and temporal resolution
    for detection of spontaneous synaptic currents in vitro and in vivo,” <i>Biophysical
    Journal</i>, vol. 103, no. 7. Biophysical Society, pp. 1429–1439, 2012.
  ista: Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. 2012.
    A deconvolution based method with high sensitivity and temporal resolution for
    detection of spontaneous synaptic currents in vitro and in vivo. Biophysical Journal.
    103(7), 1429–1439.
  mla: Pernia-Andrade, Alejandro, et al. “A Deconvolution Based Method with High Sensitivity
    and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro
    and in Vivo.” <i>Biophysical Journal</i>, vol. 103, no. 7, Biophysical Society,
    2012, pp. 1429–39, doi:<a href="https://doi.org/10.1016/j.bpj.2012.08.039">10.1016/j.bpj.2012.08.039</a>.
  short: A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, P.M. Jonas,
    Biophysical Journal 103 (2012) 1429–1439.
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T12:00:32Z
date_published: 2012-10-03T00:00:00Z
date_updated: 2026-07-06T12:32:51Z
day: '03'
department:
- _id: PeJo
- _id: ScienComp
doi: 10.1016/j.bpj.2012.08.039
external_id:
  isi:
  - '000309571400005'
  pmid:
  - '23062335'
intvolume: '       103'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3471482/
month: '10'
oa: 1
oa_version: Submitted Version
page: 1429 - 1439
pmid: 1
project:
- _id: 25BDE9A4-B435-11E9-9278-68D0E5697425
  grant_number: SFB-TR3-TP10B
  name: "Glutamaterge synaptische Ã\x9Cbertragung und PlastizitÃ¤t in hippocampalen
    Mikroschaltkreisen"
publication: Biophysical Journal
publication_status: published
publisher: Biophysical Society
publist_id: '3774'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A deconvolution based method with high sensitivity and temporal resolution
  for detection of spontaneous synaptic currents in vitro and in vivo
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 103
year: '2012'
...
---
_id: '3160'
abstract:
- lang: eng
  text: There is a long-running controversy about how early cell fate decisions are
    made in the developing mammalian embryo. 1,2 In particular, it is controversial
    when the first events that can predict the establishment of the pluripotent and
    extra-embryonic lineages in the blastocyst of the pre-implantation embryo occur.
    It has long been proposed that the position and polarity of cells at the 16- to
    32-cell stage embryo influence their decision to either give rise to the pluripotent
    cell lineage that eventually contributes to the inner cell mass (ICM), comprising
    the primitive endoderm (PE) and the epiblast (EPI), or the extra-embryonic trophectoderm
    (TE) surrounding the blastocoel. The positioning of cells in the embryo at this
    developmental stage could largely be the result of random events, making this
    a stochastic model of cell lineage allocation. Contrary to such a stochastic model,
    some studies have detected putative differences in the lineage potential of individual
    blastomeres before compaction, indicating that the first cell fate decisions may
    occur as early as at the 4-cell stage. Using a non-invasive, quantitative in vivo
    imaging assay to study the kinetic behavior of Oct4 (also known as POU5F1), a
    key transcription factor (TF) controlling pre-implantation development in the
    mouse embryo, 3-5 a recent study identifies Oct4 kinetics as a predictive measure
    of cell lineage patterning in the early mouse embryo. 6 Here, we discuss the implications
    of such molecular heterogeneities in early development and offer potential avenues
    toward a mechanistic understanding of these observations, contributing to the
    resolution of the controversy of developmental cell lineage allocation.
article_processing_charge: No
author:
- first_name: Periklis
  full_name: Pantazis, Periklis
  last_name: Pantazis
- first_name: Tobias
  full_name: Bollenbach, Tobias
  id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
  last_name: Bollenbach
  orcid: 0000-0003-4398-476X
citation:
  ama: Pantazis P, Bollenbach MT. Transcription factor kinetics and the emerging asymmetry
    in the early mammalian embryo. <i>Cell Cycle</i>. 2012;11(11):2055-2058. doi:<a
    href="https://doi.org/10.4161/cc.20118">10.4161/cc.20118</a>
  apa: Pantazis, P., &#38; Bollenbach, M. T. (2012). Transcription factor kinetics
    and the emerging asymmetry in the early mammalian embryo. <i>Cell Cycle</i>. Taylor
    &#38; Francis. <a href="https://doi.org/10.4161/cc.20118">https://doi.org/10.4161/cc.20118</a>
  chicago: Pantazis, Periklis, and Mark Tobias Bollenbach. “Transcription Factor Kinetics
    and the Emerging Asymmetry in the Early Mammalian Embryo.” <i>Cell Cycle</i>.
    Taylor &#38; Francis, 2012. <a href="https://doi.org/10.4161/cc.20118">https://doi.org/10.4161/cc.20118</a>.
  ieee: P. Pantazis and M. T. Bollenbach, “Transcription factor kinetics and the emerging
    asymmetry in the early mammalian embryo,” <i>Cell Cycle</i>, vol. 11, no. 11.
    Taylor &#38; Francis, pp. 2055–2058, 2012.
  ista: Pantazis P, Bollenbach MT. 2012. Transcription factor kinetics and the emerging
    asymmetry in the early mammalian embryo. Cell Cycle. 11(11), 2055–2058.
  mla: Pantazis, Periklis, and Mark Tobias Bollenbach. “Transcription Factor Kinetics
    and the Emerging Asymmetry in the Early Mammalian Embryo.” <i>Cell Cycle</i>,
    vol. 11, no. 11, Taylor &#38; Francis, 2012, pp. 2055–58, doi:<a href="https://doi.org/10.4161/cc.20118">10.4161/cc.20118</a>.
  short: P. Pantazis, M.T. Bollenbach, Cell Cycle 11 (2012) 2055–2058.
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T12:01:44Z
date_published: 2012-06-01T00:00:00Z
date_updated: 2026-07-07T05:34:50Z
day: '01'
department:
- _id: ToBo
doi: 10.4161/cc.20118
external_id:
  isi:
  - '000304770100011'
intvolume: '        11'
isi: 1
issue: '11'
language:
- iso: eng
month: '06'
oa_version: None
page: 2055 - 2058
publication: Cell Cycle
publication_status: published
publisher: Taylor & Francis
publist_id: '3531'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Transcription factor kinetics and the emerging asymmetry in the early mammalian
  embryo
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2012'
...
---
_id: '2048'
abstract:
- lang: eng
  text: Leakage resilient cryptography attempts to incorporate side-channel leakage
    into the black-box security model and designs cryptographic schemes that are provably
    secure within it. Informally, a scheme is leakage-resilient if it remains secure
    even if an adversary learns a bounded amount of arbitrary information about the
    schemes internal state. Unfortunately, most leakage resilient schemes are unnecessarily
    complicated in order to achieve strong provable security guarantees. As advocated
    by Yu et al. [CCS’10], this mostly is an artefact of the security proof and in
    practice much simpler construction may already suffice to protect against realistic
    side-channel attacks. In this paper, we show that indeed for simpler constructions
    leakage-resilience can be obtained when we aim for relaxed security notions where
    the leakage-functions and/or the inputs to the primitive are chosen non-adaptively.
    For example, we show that a three round Feistel network instantiated with a leakage
    resilient PRF yields a leakage resilient PRP if the inputs are chosen non-adaptively
    (This complements the result of Dodis and Pietrzak [CRYPTO’10] who show that if
    a adaptive queries are allowed, a superlogarithmic number of rounds is necessary.)
    We also show that a minor variation of the classical GGM construction gives a
    leakage resilient PRF if both, the leakage-function and the inputs, are chosen
    non-adaptively.
acknowledgement: "Sebastian Faust acknowledges support from the Danish National Research
  Foundation and The National Science Foundation of China (under the grant 61061130540)
  for the Sino-Danish Center for the Theory of Interactive Computation, within part
  of this work was performed; and from the CFEM research center, supported by the
  Danish Strategic Research Council. \r\nSupported by the European Research Council/ERC
  Starting Grant 259668-PSPC.\r\n"
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Sebastian
  full_name: Faust, Sebastian
  last_name: Faust
- first_name: Krzysztof Z
  full_name: Pietrzak, Krzysztof Z
  id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
  last_name: Pietrzak
  orcid: 0000-0002-9139-1654
- first_name: Joachim
  full_name: Schipper, Joachim
  id: 7BE863D4-E9CF-11E9-9EDB-90527418172C
  last_name: Schipper
citation:
  ama: 'Faust S, Pietrzak KZ, Schipper J. Practical leakage-resilient symmetric cryptography.
    In: <i>Conference Proceedings CHES 2012</i>. Vol 7428. Springer; 2012:213-232.
    doi:<a href="https://doi.org/10.1007/978-3-642-33027-8_13">10.1007/978-3-642-33027-8_13</a>'
  apa: 'Faust, S., Pietrzak, K. Z., &#38; Schipper, J. (2012). Practical leakage-resilient
    symmetric cryptography. In <i>Conference proceedings CHES 2012</i> (Vol. 7428,
    pp. 213–232). Leuven, Belgium: Springer. <a href="https://doi.org/10.1007/978-3-642-33027-8_13">https://doi.org/10.1007/978-3-642-33027-8_13</a>'
  chicago: Faust, Sebastian, Krzysztof Z Pietrzak, and Joachim Schipper. “Practical
    Leakage-Resilient Symmetric Cryptography.” In <i>Conference Proceedings CHES 2012</i>,
    7428:213–32. Springer, 2012. <a href="https://doi.org/10.1007/978-3-642-33027-8_13">https://doi.org/10.1007/978-3-642-33027-8_13</a>.
  ieee: S. Faust, K. Z. Pietrzak, and J. Schipper, “Practical leakage-resilient symmetric
    cryptography,” in <i>Conference proceedings CHES 2012</i>, Leuven, Belgium, 2012,
    vol. 7428, pp. 213–232.
  ista: 'Faust S, Pietrzak KZ, Schipper J. 2012. Practical leakage-resilient symmetric
    cryptography. Conference proceedings CHES 2012. CHES: Cryptographic Hardware and
    Embedded Systems, LNCS, vol. 7428, 213–232.'
  mla: Faust, Sebastian, et al. “Practical Leakage-Resilient Symmetric Cryptography.”
    <i>Conference Proceedings CHES 2012</i>, vol. 7428, Springer, 2012, pp. 213–32,
    doi:<a href="https://doi.org/10.1007/978-3-642-33027-8_13">10.1007/978-3-642-33027-8_13</a>.
  short: S. Faust, K.Z. Pietrzak, J. Schipper, in:, Conference Proceedings CHES 2012,
    Springer, 2012, pp. 213–232.
conference:
  end_date: 2012-09-12
  location: Leuven, Belgium
  name: 'CHES: Cryptographic Hardware and Embedded Systems'
  start_date: 2012-09-09
das_tickbox: '1'
date_created: 2018-12-11T11:55:25Z
date_published: 2012-09-01T00:00:00Z
date_updated: 2026-07-07T13:05:30Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-642-33027-8_13
ec_funded: 1
intvolume: '      7428'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://www.iacr.org/archive/ches2012/74280211/74280211.pdf
month: '09'
oa: 1
oa_version: Preprint
page: 213 - 232
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '259668'
  name: Provable Security for Physical Cryptography
publication: Conference proceedings CHES 2012
publication_status: published
publisher: Springer
publist_id: '5003'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Practical leakage-resilient symmetric cryptography
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7428
year: '2012'
...
---
_id: '2049'
abstract:
- lang: eng
  text: "We propose a new authentication protocol that is provably secure based on
    a ring variant of the learning parity with noise (LPN) problem. The protocol follows
    the design principle of the LPN-based protocol from Eurocrypt’11 (Kiltz et al.),
    and like it, is a two round protocol secure against active attacks. Moreover,
    our protocol has small communication complexity and a very small footprint which
    makes it applicable in scenarios that involve low-cost, resource-constrained devices.\r\n\r\nPerformance-wise,
    our protocol is more efficient than previous LPN-based schemes, such as the many
    variants of the Hopper-Blum (HB) protocol and the aforementioned protocol from
    Eurocrypt’11. Our implementation results show that it is even comparable to the
    standard challenge-and-response protocols based on the AES block-cipher. Our basic
    protocol is roughly 20 times slower than AES, but with the advantage of having
    10 times smaller code size. Furthermore, if a few hundred bytes of non-volatile
    memory are available to allow the storage of some off-line pre-computations, then
    the online phase of our protocols is only twice as slow as AES.\r\n"
acknowledgement: "Supported by the European Research Council / ERC Starting Grant
  (259668- PSPC)\r\nWe would like to thank the anonymous referees of this confer-
  ence and those of the ECRYPT Workshop on Lightweight Cryptography for very useful
  comments, and in particular for the suggestion that the scheme is somewhat vulnerable
  to a man-in-the-middle attack whenever an adversary observes two reader challenges
  that are the same. We hope that the attack we described in Appendix A corresponds
  to what the reviewer had in mind. We also thank Tanja Lange for pointing us to the
  pa- per of [Kir11] and for discussions of some of her recent work. "
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Stefan
  full_name: Heyse, Stefan
  last_name: Heyse
- first_name: Eike
  full_name: Kiltz, Eike
  last_name: Kiltz
- first_name: Vadim
  full_name: Lyubashevsky, Vadim
  last_name: Lyubashevsky
- first_name: Christof
  full_name: Paar, Christof
  last_name: Paar
- first_name: Krzysztof Z
  full_name: Pietrzak, Krzysztof Z
  id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
  last_name: Pietrzak
  orcid: 0000-0002-9139-1654
citation:
  ama: 'Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. Lapin: An efficient
    authentication protocol based on ring-LPN. In: <i>Conference Proceedings FSE 2012</i>.
    Vol 7549. Springer; 2012:346-365. doi:<a href="https://doi.org/10.1007/978-3-642-34047-5_20">10.1007/978-3-642-34047-5_20</a>'
  apa: 'Heyse, S., Kiltz, E., Lyubashevsky, V., Paar, C., &#38; Pietrzak, K. Z. (2012).
    Lapin: An efficient authentication protocol based on ring-LPN. In <i>Conference
    proceedings FSE 2012</i> (Vol. 7549, pp. 346–365). Washington, DC, USA: Springer.
    <a href="https://doi.org/10.1007/978-3-642-34047-5_20">https://doi.org/10.1007/978-3-642-34047-5_20</a>'
  chicago: 'Heyse, Stefan, Eike Kiltz, Vadim Lyubashevsky, Christof Paar, and Krzysztof
    Z Pietrzak. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.” In
    <i>Conference Proceedings FSE 2012</i>, 7549:346–65. Springer, 2012. <a href="https://doi.org/10.1007/978-3-642-34047-5_20">https://doi.org/10.1007/978-3-642-34047-5_20</a>.'
  ieee: 'S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, and K. Z. Pietrzak, “Lapin:
    An efficient authentication protocol based on ring-LPN,” in <i>Conference proceedings
    FSE 2012</i>, Washington, DC, USA, 2012, vol. 7549, pp. 346–365.'
  ista: 'Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. 2012. Lapin: An efficient
    authentication protocol based on ring-LPN. Conference proceedings FSE 2012. FSE:
    Fast Software Encryption, LNCS, vol. 7549, 346–365.'
  mla: 'Heyse, Stefan, et al. “Lapin: An Efficient Authentication Protocol Based on
    Ring-LPN.” <i>Conference Proceedings FSE 2012</i>, vol. 7549, Springer, 2012,
    pp. 346–65, doi:<a href="https://doi.org/10.1007/978-3-642-34047-5_20">10.1007/978-3-642-34047-5_20</a>.'
  short: S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, K.Z. Pietrzak, in:, Conference
    Proceedings FSE 2012, Springer, 2012, pp. 346–365.
conference:
  end_date: 2012-03-21
  location: Washington, DC, USA
  name: 'FSE: Fast Software Encryption'
  start_date: 2012-03-19
das_tickbox: '1'
date_created: 2018-12-11T11:55:25Z
date_published: 2012-03-01T00:00:00Z
date_updated: 2026-07-07T13:06:19Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-642-34047-5_20
ec_funded: 1
intvolume: '      7549'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://www.iacr.org/archive/fse2012/75490350/75490350.pdf
month: '03'
oa: 1
oa_version: Preprint
page: 346 - 365
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '259668'
  name: Provable Security for Physical Cryptography
publication: Conference proceedings FSE 2012
publication_status: published
publisher: Springer
publist_id: '5002'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Lapin: An efficient authentication protocol based on ring-LPN'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7549
year: '2012'
...
---
_id: '2942'
abstract:
- lang: eng
  text: Interface theories provide a formal framework for component-based development
    of software and hardware which supports the incremental design of systems and
    the independent implementability of components. These capabilities are ensured
    through mathematical properties of the parallel composition operator and the refinement
    relation for components. More recently, a conjunction operation was added to interface
    theories in order to provide support for handling multiple viewpoints, requirements
    engineering, and component reuse. Unfortunately, the conjunction operator does
    not allow independent implementability in general. In this paper, we study conditions
    that need to be imposed on interface models in order to enforce independent implementability
    with respect to conjunction. We focus on multiple viewpoint specifications and
    propose a new compatibility criterion between two interfaces, which we call orthogonality.
    We show that orthogonal interfaces can be refined separately, while preserving
    both orthogonality and composability with other interfaces. We illustrate the
    independent implementability of different viewpoints with a FIFO buffer example.
acknowledgement: ERC Advanced Grant QUAREM (Quantitative Reactive Modeling), FWF National
  Research Network RISE (Rigorous Systems Engineering)
alternative_title:
- LNCS
article_processing_charge: No
author:
- 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: Dejan
  full_name: Nickovic, Dejan
  id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
  last_name: Nickovic
citation:
  ama: 'Henzinger TA, Nickovic D. Independent implementability of viewpoints. In:
    <i>Conference Proceedings Monterey Workshop 2012</i>. Vol 7539. Springer; 2012:380-395.
    doi:<a href="https://doi.org/10.1007/978-3-642-34059-8_20">10.1007/978-3-642-34059-8_20</a>'
  apa: 'Henzinger, T. A., &#38; Nickovic, D. (2012). Independent implementability
    of viewpoints. In <i>Conference proceedings Monterey Workshop 2012</i> (Vol. 7539,
    pp. 380–395). Oxford, UK: Springer. <a href="https://doi.org/10.1007/978-3-642-34059-8_20">https://doi.org/10.1007/978-3-642-34059-8_20</a>'
  chicago: Henzinger, Thomas A, and Dejan Nickovic. “Independent Implementability
    of Viewpoints.” In <i>Conference Proceedings Monterey Workshop 2012</i>, 7539:380–95.
    Springer, 2012. <a href="https://doi.org/10.1007/978-3-642-34059-8_20">https://doi.org/10.1007/978-3-642-34059-8_20</a>.
  ieee: T. A. Henzinger and D. Nickovic, “Independent implementability of viewpoints,”
    in <i>Conference proceedings Monterey Workshop 2012</i>, Oxford, UK, 2012, vol.
    7539, pp. 380–395.
  ista: Henzinger TA, Nickovic D. 2012. Independent implementability of viewpoints.
    Conference proceedings Monterey Workshop 2012. Monterey Workshop 2012, LNCS, vol.
    7539, 380–395.
  mla: Henzinger, Thomas A., and Dejan Nickovic. “Independent Implementability of
    Viewpoints.” <i>Conference Proceedings Monterey Workshop 2012</i>, vol. 7539,
    Springer, 2012, pp. 380–95, doi:<a href="https://doi.org/10.1007/978-3-642-34059-8_20">10.1007/978-3-642-34059-8_20</a>.
  short: T.A. Henzinger, D. Nickovic, in:, Conference Proceedings Monterey Workshop
    2012, Springer, 2012, pp. 380–395.
conference:
  end_date: 2012-03-21
  location: Oxford, UK
  name: Monterey Workshop 2012
  start_date: 2012-03-19
das_tickbox: '1'
date_created: 2018-12-11T12:00:28Z
date_published: 2012-09-16T00:00:00Z
date_updated: 2026-07-07T13:08:58Z
day: '16'
department:
- _id: ToHe
doi: 10.1007/978-3-642-34059-8_20
ec_funded: 1
intvolume: '      7539'
language:
- iso: eng
month: '09'
oa_version: None
page: 380 - 395
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
publication: Conference proceedings Monterey Workshop 2012
publication_status: published
publisher: Springer
publist_id: '3791'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Independent implementability of viewpoints
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7539
year: '2012'
...
---
_id: '3274'
abstract:
- lang: eng
  text: A boundary element model of a tunnel running through horizontally layered
    soil with anisotropic material properties is presented. Since there is no analytical
    fundamental solution for wave propagation inside a layered orthotropic medium
    in 3D, the fundamental displacements and stresses have to be calculated numerically.
    In our model this is done in the Fourier domain with respect to space and time.
    The assumption of a straight tunnel with infinite extension in the x direction
    makes it possible to decouple the system for every wave number kx, leading to
    a 2.5D-problem, which is suited for parallel computation. The special form of
    the fundamental solution, resulting from our Fourier ansatz, and the fact, that
    the calculation of the boundary integral equation is performed in the Fourier
    domain, enhances the stability and efficiency of the numerical calculations.
acknowledgement: This work was supported by the Austrian Federal Ministry of Transport,
  Innovation and Technology under the Grant Bmvit-isb2 and the FFG under the project
  Pr. Nr. 809089.
article_processing_charge: No
author:
- first_name: Georg
  full_name: Rieckh, Georg
  id: 34DA8BD6-F248-11E8-B48F-1D18A9856A87
  last_name: Rieckh
- first_name: Wolfgang
  full_name: Kreuzer, Wolfgang
  last_name: Kreuzer
- first_name: Holger
  full_name: Waubke, Holger
  last_name: Waubke
- first_name: Peter
  full_name: Balazs, Peter
  last_name: Balazs
citation:
  ama: Rieckh G, Kreuzer W, Waubke H, Balazs P. A 2.5D-Fourier-BEM model for vibrations
    in a tunnel running through layered anisotropic soil. <i>Engineering Analysis
    with Boundary Elements</i>. 2012;36(6):960-967. doi:<a href="https://doi.org/10.1016/j.enganabound.2011.12.014">10.1016/j.enganabound.2011.12.014</a>
  apa: Rieckh, G., Kreuzer, W., Waubke, H., &#38; Balazs, P. (2012). A 2.5D-Fourier-BEM
    model for vibrations in a tunnel running through layered anisotropic soil. <i>Engineering
    Analysis with Boundary Elements</i>. Elsevier. <a href="https://doi.org/10.1016/j.enganabound.2011.12.014">https://doi.org/10.1016/j.enganabound.2011.12.014</a>
  chicago: Rieckh, Georg, Wolfgang Kreuzer, Holger Waubke, and Peter Balazs. “A 2.5D-Fourier-BEM
    Model for Vibrations in a Tunnel Running through Layered Anisotropic Soil.” <i>Engineering
    Analysis with Boundary Elements</i>. Elsevier, 2012. <a href="https://doi.org/10.1016/j.enganabound.2011.12.014">https://doi.org/10.1016/j.enganabound.2011.12.014</a>.
  ieee: G. Rieckh, W. Kreuzer, H. Waubke, and P. Balazs, “A 2.5D-Fourier-BEM model
    for vibrations in a tunnel running through layered anisotropic soil,” <i>Engineering
    Analysis with Boundary Elements</i>, vol. 36, no. 6. Elsevier, pp. 960–967, 2012.
  ista: Rieckh G, Kreuzer W, Waubke H, Balazs P. 2012. A 2.5D-Fourier-BEM model for
    vibrations in a tunnel running through layered anisotropic soil. Engineering Analysis
    with Boundary Elements. 36(6), 960–967.
  mla: Rieckh, Georg, et al. “A 2.5D-Fourier-BEM Model for Vibrations in a Tunnel
    Running through Layered Anisotropic Soil.” <i>Engineering Analysis with Boundary
    Elements</i>, vol. 36, no. 6, Elsevier, 2012, pp. 960–67, doi:<a href="https://doi.org/10.1016/j.enganabound.2011.12.014">10.1016/j.enganabound.2011.12.014</a>.
  short: G. Rieckh, W. Kreuzer, H. Waubke, P. Balazs, Engineering Analysis with Boundary
    Elements 36 (2012) 960–967.
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T12:02:24Z
date_published: 2012-06-01T00:00:00Z
date_updated: 2026-07-07T13:10:10Z
day: '01'
department:
- _id: GaTk
doi: 10.1016/j.enganabound.2011.12.014
external_id:
  isi:
  - '000301691600005'
intvolume: '        36'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa_version: None
page: 960 - 967
publication: Engineering Analysis with Boundary Elements
publication_status: published
publisher: Elsevier
publist_id: '3372'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered
  anisotropic soil
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2012'
...
