---
_id: '3312'
abstract:
- lang: eng
text: We study the 3D reconstruction of plant roots from multiple 2D images. To
meet the challenge caused by the delicate nature of thin branches, we make three
innovations to cope with the sensitivity to image quality and calibration. First,
we model the background as a harmonic function to improve the segmentation of
the root in each 2D image. Second, we develop the concept of the regularized visual
hull which reduces the effect of jittering and refraction by ensuring consistency
with one 2D image. Third, we guarantee connectedness through adjustments to the
3D reconstruction that minimize global error. Our software is part of a biological
phenotype/genotype study of agricultural root systems. It has been tested on more
than 40 plant roots and results are promising in terms of reconstruction quality
and efficiency.
acknowledgement: This research is supported by the National Science Foundation (NSF)
under grant DBI-0820624.
article_number: '6126475'
article_processing_charge: No
author:
- first_name: Ying
full_name: Zheng, Ying
last_name: Zheng
- first_name: Steve
full_name: Gu, Steve
last_name: Gu
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Carlo
full_name: Tomasi, Carlo
last_name: Tomasi
- first_name: Philip
full_name: Benfey, Philip
last_name: Benfey
citation:
ama: Zheng Y, Gu S, Edelsbrunner H, Tomasi C, Benfey P. Detailed Reconstruction
of 3D Plant Root Shape. IEEE; 2011. doi:10.1109/ICCV.2011.6126475
apa: 'Zheng, Y., Gu, S., Edelsbrunner, H., Tomasi, C., & Benfey, P. (2011).
Detailed reconstruction of 3D plant root shape. Proceedings of the IEEE
International Conference on Computer Vision. Barcelona, Spain: IEEE. https://doi.org/10.1109/ICCV.2011.6126475'
chicago: Zheng, Ying, Steve Gu, Herbert Edelsbrunner, Carlo Tomasi, and Philip Benfey.
Detailed Reconstruction of 3D Plant Root Shape. Proceedings of the IEEE
International Conference on Computer Vision. IEEE, 2011. https://doi.org/10.1109/ICCV.2011.6126475.
ieee: Y. Zheng, S. Gu, H. Edelsbrunner, C. Tomasi, and P. Benfey, Detailed reconstruction
of 3D plant root shape. IEEE, 2011.
ista: Zheng Y, Gu S, Edelsbrunner H, Tomasi C, Benfey P. 2011. Detailed reconstruction
of 3D plant root shape, IEEE,p.
mla: Zheng, Ying, et al. “Detailed Reconstruction of 3D Plant Root Shape.” Proceedings
of the IEEE International Conference on Computer Vision, 6126475, IEEE, 2011,
doi:10.1109/ICCV.2011.6126475.
short: Y. Zheng, S. Gu, H. Edelsbrunner, C. Tomasi, P. Benfey, Detailed Reconstruction
of 3D Plant Root Shape, IEEE, 2011.
conference:
end_date: 2011-11-13
location: Barcelona, Spain
name: 'ICCV: International Conference on Computer Vision'
start_date: 2011-11-06
date_created: 2018-12-11T12:02:36Z
date_published: 2011-12-31T00:00:00Z
date_updated: 2020-07-14T23:03:43Z
day: '31'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1109/ICCV.2011.6126475
file:
- access_level: open_access
checksum: 30a33564b7b45a7ee31610898267fd0e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:04Z
date_updated: 2020-07-14T12:46:07Z
file_id: '4727'
file_name: IST-2016-541-v1+1_2011-P-07-RootReconstruction.pdf
file_size: 5622728
relation: main_file
file_date_updated: 2020-07-14T12:46:07Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Submitted Version
publication: Proceedings of the IEEE International Conference on Computer Vision
publication_status: published
publisher: IEEE
publist_id: '3328'
pubrep_id: '541'
quality_controlled: '1'
status: public
title: Detailed reconstruction of 3D plant root shape
type: conference_poster
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3313'
abstract:
- lang: eng
text: Interpreting an image as a function on a compact sub- set of the Euclidean
plane, we get its scale-space by diffu- sion, spreading the image over the entire
plane. This gener- ates a 1-parameter family of functions alternatively defined
as convolutions with a progressively wider Gaussian ker- nel. We prove that the
corresponding 1-parameter family of persistence diagrams have norms that go rapidly
to zero as time goes to infinity. This result rationalizes experimental observations
about scale-space. We hope this will lead to targeted improvements of related
computer vision methods.
article_number: '6126271'
author:
- first_name: Chao
full_name: Chen, Chao
id: 3E92416E-F248-11E8-B48F-1D18A9856A87
last_name: Chen
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: 'Chen C, Edelsbrunner H. Diffusion runs low on persistence fast. In: Proceedings
of the IEEE International Conference on Computer Vision. IEEE; 2011. doi:10.1109/ICCV.2011.6126271'
apa: 'Chen, C., & Edelsbrunner, H. (2011). Diffusion runs low on persistence
fast. In Proceedings of the IEEE International Conference on Computer Vision.
Barcelona, Spain: IEEE. https://doi.org/10.1109/ICCV.2011.6126271'
chicago: Chen, Chao, and Herbert Edelsbrunner. “Diffusion Runs Low on Persistence
Fast.” In Proceedings of the IEEE International Conference on Computer Vision.
IEEE, 2011. https://doi.org/10.1109/ICCV.2011.6126271.
ieee: C. Chen and H. Edelsbrunner, “Diffusion runs low on persistence fast,” in
Proceedings of the IEEE International Conference on Computer Vision, Barcelona,
Spain, 2011.
ista: 'Chen C, Edelsbrunner H. 2011. Diffusion runs low on persistence fast. Proceedings
of the IEEE International Conference on Computer Vision. ICCV: International Conference
on Computer Vision, 6126271.'
mla: Chen, Chao, and Herbert Edelsbrunner. “Diffusion Runs Low on Persistence Fast.”
Proceedings of the IEEE International Conference on Computer Vision, 6126271,
IEEE, 2011, doi:10.1109/ICCV.2011.6126271.
short: C. Chen, H. Edelsbrunner, in:, Proceedings of the IEEE International Conference
on Computer Vision, IEEE, 2011.
conference:
end_date: 2011-11-13
location: Barcelona, Spain
name: 'ICCV: International Conference on Computer Vision'
start_date: 2011-11-06
date_created: 2018-12-11T12:02:37Z
date_published: 2011-11-06T00:00:00Z
date_updated: 2021-01-12T07:42:35Z
day: '06'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1109/ICCV.2011.6126271
file:
- access_level: open_access
checksum: 6984684081ba123808b344f9f2e64a8f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:28Z
date_updated: 2020-07-14T12:46:07Z
file_id: '5282'
file_name: IST-2016-540-v1+1_2011-P-08-RunEmpty.pdf
file_size: 614050
relation: main_file
file_date_updated: 2020-07-14T12:46:07Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
publication: Proceedings of the IEEE International Conference on Computer Vision
publication_status: published
publisher: IEEE
publist_id: '3327'
pubrep_id: '540'
quality_controlled: '1'
scopus_import: 1
status: public
title: Diffusion runs low on persistence fast
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3315'
abstract:
- lang: eng
text: We consider two-player games played in real time on game structures with clocks
where the objectives of players are described using parity conditions. The games
are concurrent in that at each turn, both players independently propose a time
delay and an action, and the action with the shorter delay is chosen. To prevent
a player from winning by blocking time, we restrict each player to play strategies
that ensure that the player cannot be responsible for causing a zeno run. First,
we present an efficient reduction of these games to turn-based (i.e., not concurrent)
finite-state (i.e., untimed) parity games. Our reduction improves the best known
complexity for solving timed parity games. Moreover, the rich class of algorithms
for classical parity games can now be applied to timed parity games. The states
of the resulting game are based on clock regions of the original game, and the
state space of the finite game is linear in the size of the region graph. Second,
we consider two restricted classes of strategies for the player that represents
the controller in a real-time synthesis problem, namely, limit-robust and bounded-robust
winning strategies. Using a limit-robust winning strategy, the controller cannot
choose an exact real-valued time delay but must allow for some nonzero jitter
in each of its actions. If there is a given lower bound on the jitter, then the
strategy is bounded-robust winning. We show that exact strategies are more powerful
than limit-robust strategies, which are more powerful than bounded-robust winning
strategies for any bound. For both kinds of robust strategies, we present efficient
reductions to standard timed automaton games. These reductions provide algorithms
for the synthesis of robust real-time controllers.
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- 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: Vinayak
full_name: Prabhu, Vinayak
last_name: Prabhu
citation:
ama: 'Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: Complexity and robustness.
Logical Methods in Computer Science. 2011;7(4). doi:10.2168/LMCS-7(4:8)2011'
apa: 'Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2011). Timed parity games:
Complexity and robustness. Logical Methods in Computer Science. International
Federation of Computational Logic. https://doi.org/10.2168/LMCS-7(4:8)2011'
chicago: 'Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed
Parity Games: Complexity and Robustness.” Logical Methods in Computer Science.
International Federation of Computational Logic, 2011. https://doi.org/10.2168/LMCS-7(4:8)2011.'
ieee: 'K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity
and robustness,” Logical Methods in Computer Science, vol. 7, no. 4. International
Federation of Computational Logic, 2011.'
ista: 'Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity
and robustness. Logical Methods in Computer Science. 7(4).'
mla: 'Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.”
Logical Methods in Computer Science, vol. 7, no. 4, International Federation
of Computational Logic, 2011, doi:10.2168/LMCS-7(4:8)2011.'
short: K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science
7 (2011).
date_created: 2018-12-11T12:02:37Z
date_published: 2011-12-14T00:00:00Z
date_updated: 2023-02-23T11:46:35Z
day: '14'
ddc:
- '000'
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.2168/LMCS-7(4:8)2011
ec_funded: 1
file:
- access_level: open_access
checksum: 3480e1594bbef25ff7462fa93a8a814e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:42Z
date_updated: 2020-07-14T12:46:07Z
file_id: '5231'
file_name: IST-2016-86-v2+1_1011.0688_3_.pdf
file_size: 588863
relation: main_file
file_date_updated: 2020-07-14T12:46:07Z
has_accepted_license: '1'
intvolume: ' 7'
issue: '4'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
publication: Logical Methods in Computer Science
publication_status: published
publisher: International Federation of Computational Logic
publist_id: '3324'
pubrep_id: '506'
quality_controlled: '1'
related_material:
record:
- id: '3876'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: 'Timed parity games: Complexity and robustness'
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2011'
...
---
_id: '3316'
abstract:
- lang: eng
text: In addition to being correct, a system should be robust, that is, it should
behave reasonably even after receiving unexpected inputs. In this paper, we summarize
two formal notions of robustness that we have introduced previously for reactive
systems. One of the notions is based on assigning costs for failures on a user-provided
notion of incorrect transitions in a specification. Here, we define a system to
be robust if a finite number of incorrect inputs does not lead to an infinite
number of incorrect outputs. We also give a more refined notion of robustness
that aims to minimize the ratio of output failures to input failures. The second
notion is aimed at liveness. In contrast to the previous notion, it has no concept
of recovery from an error. Instead, it compares the ratio of the number of liveness
constraints that the system violates to the number of liveness constraints that
the environment violates.
article_processing_charge: No
author:
- first_name: Roderick
full_name: Bloem, Roderick
last_name: Bloem
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Karin
full_name: Greimel, Karin
last_name: Greimel
- 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: Barbara
full_name: Jobstmann, Barbara
last_name: Jobstmann
citation:
ama: 'Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. Specification-centered
robustness. In: 6th IEEE International Symposium on Industrial and Embedded
Systems. IEEE; 2011:176-185. doi:10.1109/SIES.2011.5953660'
apa: 'Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann,
B. (2011). Specification-centered robustness. In 6th IEEE International Symposium
on Industrial and Embedded Systems (pp. 176–185). Vasteras, Sweden: IEEE.
https://doi.org/10.1109/SIES.2011.5953660'
chicago: Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger,
and Barbara Jobstmann. “Specification-Centered Robustness.” In 6th IEEE International
Symposium on Industrial and Embedded Systems, 176–85. IEEE, 2011. https://doi.org/10.1109/SIES.2011.5953660.
ieee: R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Specification-centered
robustness,” in 6th IEEE International Symposium on Industrial and Embedded
Systems, Vasteras, Sweden, 2011, pp. 176–185.
ista: 'Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2011. Specification-centered
robustness. 6th IEEE International Symposium on Industrial and Embedded Systems. SIES:
International Symposium on Industrial Embedded Systems, 176–185.'
mla: Bloem, Roderick, et al. “Specification-Centered Robustness.” 6th IEEE International
Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–85, doi:10.1109/SIES.2011.5953660.
short: R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, 6th
IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp.
176–185.
conference:
end_date: 2011-06-17
location: Vasteras, Sweden
name: ' SIES: International Symposium on Industrial Embedded Systems'
start_date: 2011-06-15
date_created: 2018-12-11T12:02:38Z
date_published: 2011-07-14T00:00:00Z
date_updated: 2021-01-12T07:42:36Z
day: '14'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1109/SIES.2011.5953660
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://openlib.tugraz.at/download.php?id=5cb57c8a49344&location=browse
month: '07'
oa: 1
oa_version: Published Version
page: 176 - 185
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: 6th IEEE International Symposium on Industrial and Embedded Systems
publication_status: published
publisher: IEEE
publist_id: '3323'
quality_controlled: '1'
scopus_import: 1
status: public
title: Specification-centered robustness
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3318'
abstract:
- lang: eng
text: Parvalbumin is thought to act in a manner similar to EGTA, but how a slow
Ca2+ buffer affects nanodomain-coupling regimes at GABAergic synapses is unclear.
Direct measurements of parvalbumin concentration and paired recordings in rodent
hippocampus and cerebellum revealed that parvalbumin affects synaptic dynamics
only when expressed at high levels. Modeling suggests that, in high concentrations,
parvalbumin may exert BAPTA-like effects, modulating nanodomain coupling via competition
with local saturation of endogenous fixed buffers.
author:
- first_name: Emmanuel
full_name: Eggermann, Emmanuel
last_name: Eggermann
- 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: Eggermann E, Jonas PM. How the “slow” Ca(2+) buffer parvalbumin affects transmitter
release in nanodomain coupling regimes at GABAergic synapses. Nature Neuroscience.
2011;15:20-22. doi:10.1038/nn.3002
apa: Eggermann, E., & Jonas, P. M. (2011). How the “slow” Ca(2+) buffer parvalbumin
affects transmitter release in nanodomain coupling regimes at GABAergic synapses.
Nature Neuroscience. Nature Publishing Group. https://doi.org/10.1038/nn.3002
chicago: Eggermann, Emmanuel, and Peter M Jonas. “How the ‘Slow’ Ca(2+) Buffer Parvalbumin
Affects Transmitter Release in Nanodomain Coupling Regimes at GABAergic Synapses.”
Nature Neuroscience. Nature Publishing Group, 2011. https://doi.org/10.1038/nn.3002.
ieee: E. Eggermann and P. M. Jonas, “How the ‘slow’ Ca(2+) buffer parvalbumin affects
transmitter release in nanodomain coupling regimes at GABAergic synapses,” Nature
Neuroscience, vol. 15. Nature Publishing Group, pp. 20–22, 2011.
ista: Eggermann E, Jonas PM. 2011. How the “slow” Ca(2+) buffer parvalbumin affects
transmitter release in nanodomain coupling regimes at GABAergic synapses. Nature
Neuroscience. 15, 20–22.
mla: Eggermann, Emmanuel, and Peter M. Jonas. “How the ‘Slow’ Ca(2+) Buffer Parvalbumin
Affects Transmitter Release in Nanodomain Coupling Regimes at GABAergic Synapses.”
Nature Neuroscience, vol. 15, Nature Publishing Group, 2011, pp. 20–22,
doi:10.1038/nn.3002.
short: E. Eggermann, P.M. Jonas, Nature Neuroscience 15 (2011) 20–22.
date_created: 2018-12-11T12:02:38Z
date_published: 2011-12-04T00:00:00Z
date_updated: 2021-01-12T07:42:37Z
day: '04'
department:
- _id: PeJo
doi: 10.1038/nn.3002
intvolume: ' 15'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3631701/
month: '12'
oa: 1
oa_version: Submitted Version
page: 20 - 22
publication: Nature Neuroscience
publication_status: published
publisher: Nature Publishing Group
publist_id: '3321'
quality_controlled: '1'
scopus_import: 1
status: public
title: How the “slow” Ca(2+) buffer parvalbumin affects transmitter release in nanodomain
coupling regimes at GABAergic synapses
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2011'
...
---
_id: '3319'
abstract:
- lang: eng
text: We address the problem of metric learning for multi-view data, namely the
construction of embedding projections from data in different representations into
a shared feature space, such that the Euclidean distance in this space provides
a meaningful within-view as well as between-view similarity. Our motivation stems
from the problem of cross-media retrieval tasks, where the availability of a joint
Euclidean distance function is a pre-requisite to allow fast, in particular hashing-based,
nearest neighbor queries. We formulate an objective function that expresses the
intuitive concept that matching samples are mapped closely together in the output
space, whereas non-matching samples are pushed apart, no matter in which view
they are available. The resulting optimization problem is not convex, but it can
be decomposed explicitly into a convex and a concave part, thereby allowing efficient
optimization using the convex-concave procedure. Experiments on an image retrieval
task show that nearest-neighbor based cross-view retrieval is indeed possible,
and the proposed technique improves the retrieval accuracy over baseline techniques.
article_processing_charge: No
author:
- first_name: Novi
full_name: Quadrianto, Novi
last_name: Quadrianto
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Quadrianto N, Lampert C. Learning multi-view neighborhood preserving projections.
In: ML Research Press; 2011:425-432.'
apa: 'Quadrianto, N., & Lampert, C. (2011). Learning multi-view neighborhood
preserving projections (pp. 425–432). Presented at the ICML: International Conference
on Machine Learning, Bellevue, United States: ML Research Press.'
chicago: Quadrianto, Novi, and Christoph Lampert. “Learning Multi-View Neighborhood
Preserving Projections,” 425–32. ML Research Press, 2011.
ieee: 'N. Quadrianto and C. Lampert, “Learning multi-view neighborhood preserving
projections,” presented at the ICML: International Conference on Machine Learning,
Bellevue, United States, 2011, pp. 425–432.'
ista: 'Quadrianto N, Lampert C. 2011. Learning multi-view neighborhood preserving
projections. ICML: International Conference on Machine Learning, 425–432.'
mla: Quadrianto, Novi, and Christoph Lampert. Learning Multi-View Neighborhood
Preserving Projections. ML Research Press, 2011, pp. 425–32.
short: N. Quadrianto, C. Lampert, in:, ML Research Press, 2011, pp. 425–432.
conference:
end_date: 2011-07-02
location: Bellevue, United States
name: 'ICML: International Conference on Machine Learning'
start_date: 2011-06-28
date_created: 2018-12-11T12:02:39Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2023-10-17T11:59:50Z
day: '01'
department:
- _id: ChLa
language:
- iso: eng
month: '01'
oa_version: None
page: 425 - 432
publication_status: published
publisher: ML Research Press
publist_id: '3316'
scopus_import: '1'
status: public
title: Learning multi-view neighborhood preserving projections
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3320'
abstract:
- lang: eng
text: Powerful statistical models that can be learned efficiently from large amounts
of data are currently revolutionizing computer vision. These models possess a
rich internal structure reflecting task-specific relations and constraints. This
monograph introduces the reader to the most popular classes of structured models
in computer vision. Our focus is discrete undirected graphical models which we
cover in detail together with a description of algorithms for both probabilistic
inference and maximum a posteriori inference. We discuss separately recently successful
techniques for prediction in general structured models. In the second part of
this monograph we describe methods for parameter learning where we distinguish
the classic maximum likelihood based methods from the more recent prediction-based
parameter learning methods. We highlight developments to enhance current models
and discuss kernelized models and latent variable models. To make the monograph
more practical and to provide links to further study we provide examples of successful
application of many methods in the computer vision literature.
article_processing_charge: No
article_type: original
author:
- first_name: Sebastian
full_name: Nowozin, Sebastian
last_name: Nowozin
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: Nowozin S, Lampert C. Structured learning and prediction in computer vision.
Foundations and Trends in Computer Graphics and Vision. 2011;6(3-4):185-365.
doi:10.1561/0600000033
apa: Nowozin, S., & Lampert, C. (2011). Structured learning and prediction in
computer vision. Foundations and Trends in Computer Graphics and Vision.
Now Publishers. https://doi.org/10.1561/0600000033
chicago: Nowozin, Sebastian, and Christoph Lampert. “Structured Learning and Prediction
in Computer Vision.” Foundations and Trends in Computer Graphics and Vision.
Now Publishers, 2011. https://doi.org/10.1561/0600000033.
ieee: S. Nowozin and C. Lampert, “Structured learning and prediction in computer
vision,” Foundations and Trends in Computer Graphics and Vision, vol. 6,
no. 3–4. Now Publishers, pp. 185–365, 2011.
ista: Nowozin S, Lampert C. 2011. Structured learning and prediction in computer
vision. Foundations and Trends in Computer Graphics and Vision. 6(3–4), 185–365.
mla: Nowozin, Sebastian, and Christoph Lampert. “Structured Learning and Prediction
in Computer Vision.” Foundations and Trends in Computer Graphics and Vision,
vol. 6, no. 3–4, Now Publishers, 2011, pp. 185–365, doi:10.1561/0600000033.
short: S. Nowozin, C. Lampert, Foundations and Trends in Computer Graphics and Vision
6 (2011) 185–365.
date_created: 2018-12-11T12:02:39Z
date_published: 2011-05-23T00:00:00Z
date_updated: 2023-10-17T11:52:46Z
day: '23'
ddc:
- '000'
department:
- _id: ChLa
doi: 10.1561/0600000033
file:
- access_level: open_access
checksum: f1043ef389f1558e2a226bb51568511f
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T14:34:47Z
date_updated: 2020-07-14T12:46:07Z
file_id: '7837'
file_name: 2011_CompGraphicsVision_Nowozin.pdf
file_size: 3745064
relation: main_file
file_date_updated: 2020-07-14T12:46:07Z
has_accepted_license: '1'
intvolume: ' 6'
issue: 3-4
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 185 - 365
publication: Foundations and Trends in Computer Graphics and Vision
publication_status: published
publisher: Now Publishers
publist_id: '3315'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Structured learning and prediction in computer vision
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2011'
...
---
_id: '3322'
abstract:
- lang: eng
text: We study multi-label prediction for structured output spaces, a problem that
occurs, for example, in object detection in images, secondary structure prediction
in computational biology, and graph matching with symmetries. Conventional multi-label
classification techniques are typically not applicable in this situation, because
they require explicit enumeration of the label space, which is infeasible in case
of structured outputs. Relying on techniques originally designed for single- label
structured prediction, in particular structured support vector machines, results
in reduced prediction accuracy, or leads to infeasible optimization problems.
In this work we derive a maximum-margin training formulation for multi-label structured
prediction that remains computationally tractable while achieving high prediction
accuracy. It also shares most beneficial properties with single-label maximum-margin
approaches, in particular a formulation as a convex optimization problem, efficient
working set training, and PAC-Bayesian generalization bounds.
article_processing_charge: No
author:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: Lampert C. Maximum Margin Multi Label Structured Prediction. Neural
Information Processing Systems Foundation; 2011.
apa: 'Lampert, C. (2011). Maximum margin multi label structured prediction.
NIPS: Neural Information Processing Systems. Neural Information Processing
Systems Foundation.'
chicago: 'Lampert, Christoph. Maximum Margin Multi Label Structured Prediction.
NIPS: Neural Information Processing Systems. Neural Information Processing
Systems Foundation, 2011.'
ieee: C. Lampert, Maximum margin multi label structured prediction. Neural
Information Processing Systems Foundation, 2011.
ista: Lampert C. 2011. Maximum margin multi label structured prediction, Neural
Information Processing Systems Foundation,p.
mla: 'Lampert, Christoph. “Maximum Margin Multi Label Structured Prediction.” NIPS:
Neural Information Processing Systems, Neural Information Processing Systems
Foundation, 2011.'
short: C. Lampert, Maximum Margin Multi Label Structured Prediction, Neural Information
Processing Systems Foundation, 2011.
date_created: 2018-12-11T12:02:40Z
date_published: 2011-12-13T00:00:00Z
date_updated: 2023-10-17T11:47:36Z
day: '13'
department:
- _id: ChLa
language:
- iso: eng
month: '12'
oa_version: None
publication: 'NIPS: Neural Information Processing Systems'
publication_status: published
publisher: Neural Information Processing Systems Foundation
publist_id: '3313'
related_material:
record:
- id: '3163'
relation: earlier_version
status: public
status: public
title: Maximum margin multi label structured prediction
type: conference_poster
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3323'
abstract:
- lang: eng
text: We present a new decidable logic called TREX for expressing constraints about
imperative tree data structures. In particular, TREX supports a transitive closure
operator that can express reachability constraints, which often appear in data
structure invariants. We show that our logic is closed under weakest precondition
computation, which enables its use for automated software verification. We further
show that satisfiability of formulas in TREX is decidable in NP. The low complexity
makes it an attractive alternative to more expensive logics such as monadic second-order
logic (MSOL) over trees, which have been traditionally used for reasoning about
tree data structures.
alternative_title:
- 'LNAI '
author:
- first_name: Thomas
full_name: Wies, Thomas
id: 447BFB88-F248-11E8-B48F-1D18A9856A87
last_name: Wies
- first_name: Marco
full_name: Muñiz, Marco
last_name: Muñiz
- first_name: Viktor
full_name: Kuncak, Viktor
last_name: Kuncak
citation:
ama: 'Wies T, Muñiz M, Kuncak V. An efficient decision procedure for imperative
tree data structures. In: Vol 6803. Springer; 2011:476-491. doi:10.1007/978-3-642-22438-6_36'
apa: 'Wies, T., Muñiz, M., & Kuncak, V. (2011). An efficient decision procedure
for imperative tree data structures (Vol. 6803, pp. 476–491). Presented at the
CADE 23: Automated Deduction , Wrocław, Poland: Springer. https://doi.org/10.1007/978-3-642-22438-6_36'
chicago: Wies, Thomas, Marco Muñiz, and Viktor Kuncak. “An Efficient Decision Procedure
for Imperative Tree Data Structures,” 6803:476–91. Springer, 2011. https://doi.org/10.1007/978-3-642-22438-6_36.
ieee: 'T. Wies, M. Muñiz, and V. Kuncak, “An efficient decision procedure for imperative
tree data structures,” presented at the CADE 23: Automated Deduction , Wrocław,
Poland, 2011, vol. 6803, pp. 476–491.'
ista: 'Wies T, Muñiz M, Kuncak V. 2011. An efficient decision procedure for imperative
tree data structures. CADE 23: Automated Deduction , LNAI , vol. 6803, 476–491.'
mla: Wies, Thomas, et al. An Efficient Decision Procedure for Imperative Tree
Data Structures. Vol. 6803, Springer, 2011, pp. 476–91, doi:10.1007/978-3-642-22438-6_36.
short: T. Wies, M. Muñiz, V. Kuncak, in:, Springer, 2011, pp. 476–491.
conference:
end_date: 2011-08-05
location: Wrocław, Poland
name: 'CADE 23: Automated Deduction '
start_date: 2011-07-31
date_created: 2018-12-11T12:02:40Z
date_published: 2011-07-19T00:00:00Z
date_updated: 2023-02-23T12:23:48Z
day: '19'
department:
- _id: ToHe
doi: 10.1007/978-3-642-22438-6_36
intvolume: ' 6803'
language:
- iso: eng
month: '07'
oa_version: None
page: 476 - 491
publication_status: published
publisher: Springer
publist_id: '3312'
quality_controlled: '1'
related_material:
record:
- id: '5383'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: An efficient decision procedure for imperative tree data structures
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6803
year: '2011'
...
---
_id: '3324'
abstract:
- lang: eng
text: 'Automated termination provers often use the following schema to prove that
a program terminates: construct a relational abstraction of the program''s transition
relation and then show that the relational abstraction is well-founded. The focus
of current tools has been on developing sophisticated techniques for constructing
the abstractions while relying on known decidable logics (such as linear arithmetic)
to express them. We believe we can significantly increase the class of programs
that are amenable to automated termination proofs by identifying more expressive
decidable logics for reasoning about well-founded relations. We therefore present
a new decision procedure for reasoning about multiset orderings, which are among
the most powerful orderings used to prove termination. We show that, using our
decision procedure, one can automatically prove termination of natural abstractions
of programs.'
alternative_title:
- LNCS
author:
- first_name: Ruzica
full_name: Piskac, Ruzica
last_name: Piskac
- first_name: Thomas
full_name: Wies, Thomas
id: 447BFB88-F248-11E8-B48F-1D18A9856A87
last_name: Wies
citation:
ama: 'Piskac R, Wies T. Decision procedures for automating termination proofs. In:
Jhala R, Schmidt D, eds. Vol 6538. Springer; 2011:371-386. doi:10.1007/978-3-642-18275-4_26'
apa: 'Piskac, R., & Wies, T. (2011). Decision procedures for automating termination
proofs. In R. Jhala & D. Schmidt (Eds.) (Vol. 6538, pp. 371–386). Presented
at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas,
USA: Springer. https://doi.org/10.1007/978-3-642-18275-4_26'
chicago: Piskac, Ruzica, and Thomas Wies. “Decision Procedures for Automating Termination
Proofs.” edited by Ranjit Jhala and David Schmidt, 6538:371–86. Springer, 2011.
https://doi.org/10.1007/978-3-642-18275-4_26.
ieee: 'R. Piskac and T. Wies, “Decision procedures for automating termination proofs,”
presented at the VMCAI: Verification Model Checking and Abstract Interpretation,
Texas, USA, 2011, vol. 6538, pp. 371–386.'
ista: 'Piskac R, Wies T. 2011. Decision procedures for automating termination proofs.
VMCAI: Verification Model Checking and Abstract Interpretation, LNCS, vol. 6538,
371–386.'
mla: Piskac, Ruzica, and Thomas Wies. Decision Procedures for Automating Termination
Proofs. Edited by Ranjit Jhala and David Schmidt, vol. 6538, Springer, 2011,
pp. 371–86, doi:10.1007/978-3-642-18275-4_26.
short: R. Piskac, T. Wies, in:, R. Jhala, D. Schmidt (Eds.), Springer, 2011, pp.
371–386.
conference:
end_date: 2011-01-25
location: Texas, USA
name: 'VMCAI: Verification Model Checking and Abstract Interpretation'
start_date: 2011-01-23
date_created: 2018-12-11T12:02:40Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:39Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-642-18275-4_26
editor:
- first_name: Ranjit
full_name: Jhala, Ranjit
last_name: Jhala
- first_name: David
full_name: Schmidt, David
last_name: Schmidt
intvolume: ' 6538'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://infoscience.epfl.ch/record/170697/
month: '01'
oa: 1
oa_version: Submitted Version
page: 371 - 386
publication_status: published
publisher: Springer
publist_id: '3311'
quality_controlled: '1'
scopus_import: 1
status: public
title: Decision procedures for automating termination proofs
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6538
year: '2011'
...
---
_id: '3325'
abstract:
- lang: eng
text: We introduce streaming data string transducers that map input data strings
to output data strings in a single left-to-right pass in linear time. Data strings
are (unbounded) sequences of data values, tagged with symbols from a finite set,
over a potentially infinite data do- main that supports only the operations of
equality and ordering. The transducer uses a finite set of states, a finite set
of variables ranging over the data domain, and a finite set of variables ranging
over data strings. At every step, it can make decisions based on the next in-
put symbol, updating its state, remembering the input data value in its data variables,
and updating data-string variables by concatenat- ing data-string variables and
new symbols formed from data vari- ables, while avoiding duplication. We establish
that the problems of checking functional equivalence of two streaming transducers,
and of checking whether a streaming transducer satisfies pre/post verification
conditions specified by streaming acceptors over in- put/output data-strings,
are in PSPACE. We identify a class of imperative and a class of functional pro-
grams, manipulating lists of data items, which can be effectively translated to
streaming data-string transducers. The imperative pro- grams dynamically modify
a singly-linked heap by changing next- pointers of heap-nodes and by adding new
nodes. The main re- striction specifies how the next-pointers can be used for
traversal. We also identify an expressively equivalent fragment of functional
programs that traverse a list using syntactically restricted recursive calls.
Our results lead to algorithms for assertion checking and for checking functional
equivalence of two programs, written possibly in different programming styles,
for commonly used routines such as insert, delete, and reverse.
article_processing_charge: No
author:
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
citation:
ama: 'Alur R, Cerny P. Streaming transducers for algorithmic verification of single
pass list processing programs. In: Vol 46. ACM; 2011:599-610. doi:10.1145/1926385.1926454'
apa: 'Alur, R., & Cerny, P. (2011). Streaming transducers for algorithmic verification
of single pass list processing programs (Vol. 46, pp. 599–610). Presented at the
POPL: Principles of Programming Languages, Texas, USA: ACM. https://doi.org/10.1145/1926385.1926454'
chicago: Alur, Rajeev, and Pavol Cerny. “Streaming Transducers for Algorithmic Verification
of Single Pass List Processing Programs,” 46:599–610. ACM, 2011. https://doi.org/10.1145/1926385.1926454.
ieee: 'R. Alur and P. Cerny, “Streaming transducers for algorithmic verification
of single pass list processing programs,” presented at the POPL: Principles of
Programming Languages, Texas, USA, 2011, vol. 46, no. 1, pp. 599–610.'
ista: 'Alur R, Cerny P. 2011. Streaming transducers for algorithmic verification
of single pass list processing programs. POPL: Principles of Programming Languages
vol. 46, 599–610.'
mla: Alur, Rajeev, and Pavol Cerny. Streaming Transducers for Algorithmic Verification
of Single Pass List Processing Programs. Vol. 46, no. 1, ACM, 2011, pp. 599–610,
doi:10.1145/1926385.1926454.
short: R. Alur, P. Cerny, in:, ACM, 2011, pp. 599–610.
conference:
end_date: 2011-01-28
location: Texas, USA
name: 'POPL: Principles of Programming Languages'
start_date: 2011-01-26
date_created: 2018-12-11T12:02:41Z
date_published: 2011-01-26T00:00:00Z
date_updated: 2022-03-21T08:12:51Z
day: '26'
department:
- _id: ToHe
doi: 10.1145/1926385.1926454
intvolume: ' 46'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 599 - 610
publication_status: published
publisher: ACM
publist_id: '3310'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Streaming transducers for algorithmic verification of single pass list processing
programs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 46
year: '2011'
...
---
_id: '3326'
abstract:
- lang: eng
text: 'Weighted automata map input words to numerical values. Ap- plications of
weighted automata include formal verification of quantitative properties, as well
as text, speech, and image processing. A weighted au- tomaton is defined with
respect to a semiring. For the tropical semiring, the weight of a run is the sum
of the weights of the transitions taken along the run, and the value of a word
is the minimal weight of an accepting run on it. In the 90’s, Krob studied the
decidability of problems on rational series defined with respect to the tropical
semiring. Rational series are strongly related to weighted automata, and Krob’s
results apply to them. In par- ticular, it follows from Krob’s results that the
universality problem (that is, deciding whether the values of all words are below
some threshold) is decidable for weighted automata defined with respect to the
tropical semir- ing with domain ∪ {∞}, and that the equality problem is undecidable
when the domain is ∪ {∞}. In this paper we continue the study of the borders of
decidability in weighted automata, describe alternative and direct proofs of the
above results, and tighten them further. Unlike the proofs of Krob, which are
algebraic in their nature, our proofs stay in the terrain of state machines, and
the reduction is from the halting problem of a two-counter machine. This enables
us to significantly simplify Krob’s reasoning, make the un- decidability result
accessible to the automata-theoretic community, and strengthen it to apply already
to a very simple class of automata: all the states are accepting, there are no
initial nor final weights, and all the weights on the transitions are from the
set {−1, 0, 1}. The fact we work directly with the automata enables us to tighten
also the decidability re- sults and to show that the universality problem for
weighted automata defined with respect to the tropical semiring with domain ∪
{∞}, and in fact even with domain ≥0 ∪ {∞}, is PSPACE-complete. Our results thus
draw a sharper picture about the decidability of decision problems for weighted
automata, in both the front of containment vs. universality and the front of the
∪ {∞} vs. the ∪ {∞} domains.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Shaull
full_name: Almagor, Shaull
last_name: Almagor
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'Almagor S, Boker U, Kupferman O. What’s decidable about weighted automata
. In: Vol 6996. Springer; 2011:482-491. doi:10.1007/978-3-642-24372-1_37'
apa: 'Almagor, S., Boker, U., & Kupferman, O. (2011). What’s decidable about
weighted automata (Vol. 6996, pp. 482–491). Presented at the ATVA: Automated
Technology for Verification and Analysis, Taipei, Taiwan: Springer. https://doi.org/10.1007/978-3-642-24372-1_37'
chicago: Almagor, Shaull, Udi Boker, and Orna Kupferman. “What’s Decidable about
Weighted Automata ,” 6996:482–91. Springer, 2011. https://doi.org/10.1007/978-3-642-24372-1_37.
ieee: 'S. Almagor, U. Boker, and O. Kupferman, “What’s decidable about weighted
automata ,” presented at the ATVA: Automated Technology for Verification and Analysis,
Taipei, Taiwan, 2011, vol. 6996, pp. 482–491.'
ista: 'Almagor S, Boker U, Kupferman O. 2011. What’s decidable about weighted automata
. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6996, 482–491.'
mla: Almagor, Shaull, et al. What’s Decidable about Weighted Automata . Vol.
6996, Springer, 2011, pp. 482–91, doi:10.1007/978-3-642-24372-1_37.
short: S. Almagor, U. Boker, O. Kupferman, in:, Springer, 2011, pp. 482–491.
conference:
end_date: 2011-10-14
location: Taipei, Taiwan
name: 'ATVA: Automated Technology for Verification and Analysis'
start_date: 2011-10-11
date_created: 2018-12-11T12:02:41Z
date_published: 2011-10-14T00:00:00Z
date_updated: 2021-01-12T07:42:40Z
day: '14'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-642-24372-1_37
file:
- access_level: open_access
checksum: a7ca08a2cb1b6925f4c18a3034ae5659
content_type: application/pdf
creator: dernst
date_created: 2020-05-19T16:08:32Z
date_updated: 2020-07-14T12:46:07Z
file_id: '7868'
file_name: 2011_LNCS_Almagor.pdf
file_size: 182309
relation: main_file
file_date_updated: 2020-07-14T12:46:07Z
has_accepted_license: '1'
intvolume: ' 6996'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 482 - 491
publication_status: published
publisher: Springer
publist_id: '3309'
quality_controlled: '1'
status: public
title: 'What’s decidable about weighted automata '
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6996
year: '2011'
...
---
_id: '3327'
abstract:
- lang: eng
text: We solve the open problems of translating, when possible, all common classes
of nondeterministic word automata to deterministic and nondeterministic co-Büchi
word automata. The handled classes include Büchi, parity, Rabin, Streett and Muller
automata. The translations follow a unified approach and are all asymptotically
tight. The problem of translating Büchi automata to equivalent co-Büchi automata
was solved in [2], leaving open the problems of translating automata with richer
acceptance conditions. For these classes, one cannot easily extend or use the
construction in [2]. In particular, going via an intermediate Büchi automaton
is not optimal and might involve a blow-up exponentially higher than the known
lower bound. Other known translations are also not optimal and involve a doubly
exponential blow-up. We describe direct, simple, and asymptotically tight constructions,
involving a 2Θ(n) blow-up. The constructions are variants of the subset construction,
and allow for symbolic implementations. Beyond the theoretical importance of the
results, the new constructions have various applications, among which is an improved
algorithm for translating, when possible, LTL formulas to deterministic Büchi
word automata.
alternative_title:
- LNCS
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'Boker U, Kupferman O. Co-Büching them all. In: Hofmann M, ed. Vol 6604. Springer;
2011:184-198. doi:10.1007/978-3-642-19805-2_13'
apa: 'Boker, U., & Kupferman, O. (2011). Co-Büching them all. In M. Hofmann
(Ed.) (Vol. 6604, pp. 184–198). Presented at the FoSSaCS: Foundations of Software
Science and Computation Structures, Saarbrücken, Germany: Springer. https://doi.org/10.1007/978-3-642-19805-2_13'
chicago: Boker, Udi, and Orna Kupferman. “Co-Büching Them All.” edited by Martin
Hofmann, 6604:184–98. Springer, 2011. https://doi.org/10.1007/978-3-642-19805-2_13.
ieee: 'U. Boker and O. Kupferman, “Co-Büching them all,” presented at the FoSSaCS:
Foundations of Software Science and Computation Structures, Saarbrücken, Germany,
2011, vol. 6604, pp. 184–198.'
ista: 'Boker U, Kupferman O. 2011. Co-Büching them all. FoSSaCS: Foundations of
Software Science and Computation Structures, LNCS, vol. 6604, 184–198.'
mla: Boker, Udi, and Orna Kupferman. Co-Büching Them All. Edited by Martin
Hofmann, vol. 6604, Springer, 2011, pp. 184–98, doi:10.1007/978-3-642-19805-2_13.
short: U. Boker, O. Kupferman, in:, M. Hofmann (Ed.), Springer, 2011, pp. 184–198.
conference:
end_date: 2011-04-03
location: Saarbrücken, Germany
name: 'FoSSaCS: Foundations of Software Science and Computation Structures'
start_date: 2011-03-26
date_created: 2018-12-11T12:02:41Z
date_published: 2011-03-29T00:00:00Z
date_updated: 2021-01-12T07:42:41Z
day: '29'
doi: 10.1007/978-3-642-19805-2_13
editor:
- first_name: Martin
full_name: Hofmann, Martin
last_name: Hofmann
extern: '1'
intvolume: ' 6604'
language:
- iso: eng
month: '03'
oa_version: None
page: 184 - 198
publication_status: published
publisher: Springer
publist_id: '3308'
quality_controlled: '1'
status: public
title: Co-Büching them all
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6604
year: '2011'
...
---
_id: '3328'
abstract:
- lang: eng
text: 'We report on a generic uni- and bivariate algebraic kernel that is publicly
available with CGAL 3.7. It comprises complete, correct, though efficient state-of-the-art
implementations on polynomials, roots of polynomial systems, and the support to
analyze algebraic curves defined by bivariate polynomials. The kernel design is
generic, that is, various number types and substeps can be exchanged. It is accompanied
with a ready-to-use interface to enable arrangements induced by algebraic curves,
that have already been used as basis for various geometric applications, as arrangements
on Dupin cyclides or the triangulation of algebraic surfaces. We present two novel
applications: arrangements of rotated algebraic curves and Boolean set operations
on polygons bounded by segments of algebraic curves. We also provide experiments
showing that our general implementation is competitive and even often clearly
outperforms existing implementations that are explicitly tailored for specific
types of non-linear curves that are available in CGAL.'
article_processing_charge: No
author:
- first_name: Eric
full_name: Berberich, Eric
last_name: Berberich
- first_name: Michael
full_name: Hemmer, Michael
last_name: Hemmer
- first_name: Michael
full_name: Kerber, Michael
id: 36E4574A-F248-11E8-B48F-1D18A9856A87
last_name: Kerber
orcid: 0000-0002-8030-9299
citation:
ama: 'Berberich E, Hemmer M, Kerber M. A generic algebraic kernel for non linear
geometric applications. In: ACM; 2011:179-186. doi:10.1145/1998196.1998224'
apa: 'Berberich, E., Hemmer, M., & Kerber, M. (2011). A generic algebraic kernel
for non linear geometric applications (pp. 179–186). Presented at the SCG: Symposium
on Computational Geometry, Paris, France: ACM. https://doi.org/10.1145/1998196.1998224'
chicago: Berberich, Eric, Michael Hemmer, and Michael Kerber. “A Generic Algebraic
Kernel for Non Linear Geometric Applications,” 179–86. ACM, 2011. https://doi.org/10.1145/1998196.1998224.
ieee: 'E. Berberich, M. Hemmer, and M. Kerber, “A generic algebraic kernel for non
linear geometric applications,” presented at the SCG: Symposium on Computational
Geometry, Paris, France, 2011, pp. 179–186.'
ista: 'Berberich E, Hemmer M, Kerber M. 2011. A generic algebraic kernel for non
linear geometric applications. SCG: Symposium on Computational Geometry, 179–186.'
mla: Berberich, Eric, et al. A Generic Algebraic Kernel for Non Linear Geometric
Applications. ACM, 2011, pp. 179–86, doi:10.1145/1998196.1998224.
short: E. Berberich, M. Hemmer, M. Kerber, in:, ACM, 2011, pp. 179–186.
conference:
end_date: 2011-06-15
location: Paris, France
name: 'SCG: Symposium on Computational Geometry'
start_date: 2011-06-13
date_created: 2018-12-11T12:02:42Z
date_published: 2011-06-13T00:00:00Z
date_updated: 2021-01-12T07:42:41Z
day: '13'
department:
- _id: HeEd
doi: 10.1145/1998196.1998224
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.inria.fr/inria-00480031/file/RR-7274.pdf
month: '06'
oa: 1
oa_version: Published Version
page: 179 - 186
publication_status: published
publisher: ACM
publist_id: '3307'
quality_controlled: '1'
scopus_import: 1
status: public
title: A generic algebraic kernel for non linear geometric applications
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3329'
abstract:
- lang: eng
text: 'We consider the offset-deconstruction problem: Given a polygonal shape Q
with n vertices, can it be expressed, up to a tolerance µ in Hausdorff distance,
as the Minkowski sum of another polygonal shape P with a disk of fixed radius?
If it does, we also seek a preferably simple-looking solution shape P; then, P''s
offset constitutes an accurate, vertex-reduced, and smoothened approximation of
Q. We give an O(n log n)-time exact decision algorithm that handles any polygonal
shape, assuming the real-RAM model of computation. An alternative algorithm, based
purely on rational arithmetic, answers the same deconstruction problem, up to
an uncertainty parameter, and its running time depends on the parameter δ (in
addition to the other input parameters: n, δ and the radius of the disk). If the
input shape is found to be approximable, the rational-arithmetic algorithm also
computes an approximate solution shape for the problem. For convex shapes, the
complexity of the exact decision algorithm drops to O(n), which is also the time
required to compute a solution shape P with at most one more vertex than a vertex-minimal
one. Our study is motivated by applications from two different domains. However,
since the offset operation has numerous uses, we anticipate that the reverse question
that we study here will be still more broadly applicable. We present results obtained
with our implementation of the rational-arithmetic algorithm.'
author:
- first_name: Eric
full_name: Berberich, Eric
last_name: Berberich
- first_name: Dan
full_name: Halperin, Dan
last_name: Halperin
- first_name: Michael
full_name: Kerber, Michael
id: 36E4574A-F248-11E8-B48F-1D18A9856A87
last_name: Kerber
orcid: 0000-0002-8030-9299
- first_name: Roza
full_name: Pogalnikova, Roza
last_name: Pogalnikova
citation:
ama: 'Berberich E, Halperin D, Kerber M, Pogalnikova R. Deconstructing approximate
offsets. In: Proceedings of the Twenty-Seventh Annual Symposium on Computational
Geometry. ACM; 2011:187-196. doi:10.1145/1998196.1998225'
apa: 'Berberich, E., Halperin, D., Kerber, M., & Pogalnikova, R. (2011). Deconstructing
approximate offsets. In Proceedings of the twenty-seventh annual symposium
on Computational geometry (pp. 187–196). Paris, France: ACM. https://doi.org/10.1145/1998196.1998225'
chicago: Berberich, Eric, Dan Halperin, Michael Kerber, and Roza Pogalnikova. “Deconstructing
Approximate Offsets.” In Proceedings of the Twenty-Seventh Annual Symposium
on Computational Geometry, 187–96. ACM, 2011. https://doi.org/10.1145/1998196.1998225.
ieee: E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing
approximate offsets,” in Proceedings of the twenty-seventh annual symposium
on Computational geometry, Paris, France, 2011, pp. 187–196.
ista: 'Berberich E, Halperin D, Kerber M, Pogalnikova R. 2011. Deconstructing approximate
offsets. Proceedings of the twenty-seventh annual symposium on Computational geometry.
SCG: Symposium on Computational Geometry, 187–196.'
mla: Berberich, Eric, et al. “Deconstructing Approximate Offsets.” Proceedings
of the Twenty-Seventh Annual Symposium on Computational Geometry, ACM, 2011,
pp. 187–96, doi:10.1145/1998196.1998225.
short: E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, in:, Proceedings of
the Twenty-Seventh Annual Symposium on Computational Geometry, ACM, 2011, pp.
187–196.
conference:
end_date: 2011-06-15
location: Paris, France
name: 'SCG: Symposium on Computational Geometry'
start_date: 2011-06-13
date_created: 2018-12-11T12:02:42Z
date_published: 2011-06-13T00:00:00Z
date_updated: 2023-02-23T11:12:57Z
day: '13'
department:
- _id: HeEd
doi: 10.1145/1998196.1998225
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1109.2158
month: '06'
oa: 1
oa_version: Preprint
page: 187 - 196
publication: Proceedings of the twenty-seventh annual symposium on Computational geometry
publication_status: published
publisher: ACM
publist_id: '3306'
quality_controlled: '1'
related_material:
record:
- id: '3115'
relation: later_version
status: public
scopus_import: 1
status: public
title: Deconstructing approximate offsets
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3330'
abstract:
- lang: eng
text: We consider the problem of approximating all real roots of a square-free polynomial
f. Given isolating intervals, our algorithm refines each of them to a width at
most 2-L, that is, each of the roots is approximated to L bits after the binary
point. Our method provides a certified answer for arbitrary real polynomials,
only requiring finite approximations of the polynomial coefficient and choosing
a suitable working precision adaptively. In this way, we get a correct algorithm
that is simple to implement and practically efficient. Our algorithm uses the
quadratic interval refinement method; we adapt that method to be able to cope
with inaccuracies when evaluating f, without sacrificing its quadratic convergence
behavior. We prove a bound on the bit complexity of our algorithm in terms of
degree, coefficient size and discriminant. Our bound improves previous work on
integer polynomials by a factor of deg f and essentially matches best known theoretical
bounds on root approximation which are obtained by very sophisticated algorithms.
article_processing_charge: No
arxiv: 1
author:
- first_name: Michael
full_name: Kerber, Michael
id: 36E4574A-F248-11E8-B48F-1D18A9856A87
last_name: Kerber
orcid: 0000-0002-8030-9299
- first_name: Michael
full_name: Sagraloff, Michael
last_name: Sagraloff
citation:
ama: 'Kerber M, Sagraloff M. Root refinement for real polynomials. In: Springer;
2011:209-216. doi:10.1145/1993886.1993920'
apa: 'Kerber, M., & Sagraloff, M. (2011). Root refinement for real polynomials
(pp. 209–216). Presented at the ISSAC: International Symposium on Symbolic and
Algebraic Computation, California, USA: Springer. https://doi.org/10.1145/1993886.1993920'
chicago: Kerber, Michael, and Michael Sagraloff. “Root Refinement for Real Polynomials,”
209–16. Springer, 2011. https://doi.org/10.1145/1993886.1993920.
ieee: 'M. Kerber and M. Sagraloff, “Root refinement for real polynomials,” presented
at the ISSAC: International Symposium on Symbolic and Algebraic Computation, California,
USA, 2011, pp. 209–216.'
ista: 'Kerber M, Sagraloff M. 2011. Root refinement for real polynomials. ISSAC:
International Symposium on Symbolic and Algebraic Computation, 209–216.'
mla: Kerber, Michael, and Michael Sagraloff. Root Refinement for Real Polynomials.
Springer, 2011, pp. 209–16, doi:10.1145/1993886.1993920.
short: M. Kerber, M. Sagraloff, in:, Springer, 2011, pp. 209–216.
conference:
end_date: 2011-06-11
location: California, USA
name: 'ISSAC: International Symposium on Symbolic and Algebraic Computation'
start_date: 2011-06-08
date_created: 2018-12-11T12:02:43Z
date_published: 2011-06-08T00:00:00Z
date_updated: 2021-01-12T07:42:42Z
day: '08'
department:
- _id: HeEd
doi: 10.1145/1993886.1993920
external_id:
arxiv:
- '1104.1362'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1104.1362
month: '06'
oa: 1
oa_version: Preprint
page: 209 - 216
publication_status: published
publisher: Springer
publist_id: '3304'
quality_controlled: '1'
scopus_import: 1
status: public
title: Root refinement for real polynomials
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3332'
abstract:
- lang: eng
text: Given an algebraic hypersurface O in ℝd, how many simplices are necessary
for a simplicial complex isotopic to O? We address this problem and the variant
where all vertices of the complex must lie on O. We give asymptotically tight
worst-case bounds for algebraic plane curves. Our results gradually improve known
bounds in higher dimensions; however, the question for tight bounds remains unsolved
for d ≥ 3.
article_processing_charge: No
article_type: original
author:
- first_name: Michael
full_name: Kerber, Michael
id: 36E4574A-F248-11E8-B48F-1D18A9856A87
last_name: Kerber
orcid: 0000-0002-8030-9299
- first_name: Michael
full_name: Sagraloff, Michael
last_name: Sagraloff
citation:
ama: Kerber M, Sagraloff M. A note on the complexity of real algebraic hypersurfaces.
Graphs and Combinatorics. 2011;27(3):419-430. doi:10.1007/s00373-011-1020-7
apa: Kerber, M., & Sagraloff, M. (2011). A note on the complexity of real algebraic
hypersurfaces. Graphs and Combinatorics. Springer. https://doi.org/10.1007/s00373-011-1020-7
chicago: Kerber, Michael, and Michael Sagraloff. “A Note on the Complexity of Real
Algebraic Hypersurfaces.” Graphs and Combinatorics. Springer, 2011. https://doi.org/10.1007/s00373-011-1020-7.
ieee: M. Kerber and M. Sagraloff, “A note on the complexity of real algebraic hypersurfaces,”
Graphs and Combinatorics, vol. 27, no. 3. Springer, pp. 419–430, 2011.
ista: Kerber M, Sagraloff M. 2011. A note on the complexity of real algebraic hypersurfaces.
Graphs and Combinatorics. 27(3), 419–430.
mla: Kerber, Michael, and Michael Sagraloff. “A Note on the Complexity of Real Algebraic
Hypersurfaces.” Graphs and Combinatorics, vol. 27, no. 3, Springer, 2011,
pp. 419–30, doi:10.1007/s00373-011-1020-7.
short: M. Kerber, M. Sagraloff, Graphs and Combinatorics 27 (2011) 419–430.
date_created: 2018-12-11T12:02:43Z
date_published: 2011-03-17T00:00:00Z
date_updated: 2021-01-12T07:42:43Z
day: '17'
ddc:
- '500'
department:
- _id: HeEd
doi: 10.1007/s00373-011-1020-7
file:
- access_level: open_access
checksum: a63a1e3e885dcc68f1e3dea68dfbe213
content_type: application/pdf
creator: dernst
date_created: 2020-05-19T16:11:36Z
date_updated: 2020-07-14T12:46:08Z
file_id: '7869'
file_name: 2011_GraphsCombi_Kerber.pdf
file_size: 143976
relation: main_file
file_date_updated: 2020-07-14T12:46:08Z
has_accepted_license: '1'
intvolume: ' 27'
issue: '3'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 419 - 430
publication: Graphs and Combinatorics
publication_status: published
publisher: Springer
publist_id: '3301'
quality_controlled: '1'
scopus_import: 1
status: public
title: A note on the complexity of real algebraic hypersurfaces
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 27
year: '2011'
...
---
_id: '3334'
article_type: letter_note
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: János
full_name: Pach, János
last_name: Pach
- first_name: Günter
full_name: Ziegler, Günter
last_name: Ziegler
citation:
ama: Edelsbrunner H, Pach J, Ziegler G. Letter from the new editors-in-chief. Discrete
& Computational Geometry. 2011;45(1):1-2. doi:10.1007/s00454-010-9313-9
apa: Edelsbrunner, H., Pach, J., & Ziegler, G. (2011). Letter from the new editors-in-chief.
Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-010-9313-9
chicago: Edelsbrunner, Herbert, János Pach, and Günter Ziegler. “Letter from the
New Editors-in-Chief.” Discrete & Computational Geometry. Springer,
2011. https://doi.org/10.1007/s00454-010-9313-9.
ieee: H. Edelsbrunner, J. Pach, and G. Ziegler, “Letter from the new editors-in-chief,”
Discrete & Computational Geometry, vol. 45, no. 1. Springer, pp. 1–2,
2011.
ista: Edelsbrunner H, Pach J, Ziegler G. 2011. Letter from the new editors-in-chief.
Discrete & Computational Geometry. 45(1), 1–2.
mla: Edelsbrunner, Herbert, et al. “Letter from the New Editors-in-Chief.” Discrete
& Computational Geometry, vol. 45, no. 1, Springer, 2011, pp. 1–2, doi:10.1007/s00454-010-9313-9.
short: H. Edelsbrunner, J. Pach, G. Ziegler, Discrete & Computational Geometry
45 (2011) 1–2.
date_created: 2018-12-11T12:02:44Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:44Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/s00454-010-9313-9
intvolume: ' 45'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 1 - 2
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '3297'
quality_controlled: '1'
scopus_import: 1
status: public
title: Letter from the new editors-in-chief
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 45
year: '2011'
...
---
_id: '3335'
abstract:
- lang: eng
text: We study the topology of the Megaparsec Cosmic Web in terms of the scale-dependent
Betti numbers, which formalize the topological information content of the cosmic
mass distribution. While the Betti numbers do not fully quantify topology, they
extend the information beyond conventional cosmological studies of topology in
terms of genus and Euler characteristic. The richer information content of Betti
numbers goes along the availability of fast algorithms to compute them. For continuous
density fields, we determine the scale-dependence of Betti numbers by invoking
the cosmologically familiar filtration of sublevel or superlevel sets defined
by density thresholds. For the discrete galaxy distribution, however, the analysis
is based on the alpha shapes of the particles. These simplicial complexes constitute
an ordered sequence of nested subsets of the Delaunay tessellation, a filtration
defined by the scale parameter, α. As they are homotopy equivalent to the sublevel
sets of the distance field, they are an excellent tool for assessing the topological
structure of a discrete point distribution. In order to develop an intuitive understanding
for the behavior of Betti numbers as a function of α, and their relation to the
morphological patterns in the Cosmic Web, we first study them within the context
of simple heuristic Voronoi clustering models. These can be tuned to consist of
specific morphological elements of the Cosmic Web, i.e. clusters, filaments, or
sheets. To elucidate the relative prominence of the various Betti numbers in different
stages of morphological evolution, we introduce the concept of alpha tracks. Subsequently,
we address the topology of structures emerging in the standard LCDM scenario and
in cosmological scenarios with alternative dark energy content. The evolution
of the Betti numbers is shown to reflect the hierarchical evolution of the Cosmic
Web. We also demonstrate that the scale-dependence of the Betti numbers yields
a promising measure of cosmological parameters, with a potential to help in determining
the nature of dark energy and to probe primordial non-Gaussianities. We also discuss
the expected Betti numbers as a function of the density threshold for superlevel
sets of a Gaussian random field. Finally, we introduce the concept of persistent
homology. It measures scale levels of the mass distribution and allows us to separate
small from large scale features. Within the context of the hierarchical cosmic
structure formation, persistence provides a natural formalism for a multiscale
topology study of the Cosmic Web.
alternative_title:
- LNCS
arxiv: 1
author:
- first_name: Rien
full_name: Van De Weygaert, Rien
last_name: Van De Weygaert
- first_name: Gert
full_name: Vegter, Gert
last_name: Vegter
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Bernard
full_name: Jones, Bernard
last_name: Jones
- first_name: Pratyush
full_name: Pranav, Pratyush
last_name: Pranav
- first_name: Changbom
full_name: Park, Changbom
last_name: Park
- first_name: Wojciech
full_name: Hellwing, Wojciech
last_name: Hellwing
- first_name: Bob
full_name: Eldering, Bob
last_name: Eldering
- first_name: Nico
full_name: Kruithof, Nico
last_name: Kruithof
- first_name: Patrick
full_name: Bos, Patrick
last_name: Bos
- first_name: Johan
full_name: Hidding, Johan
last_name: Hidding
- first_name: Job
full_name: Feldbrugge, Job
last_name: Feldbrugge
- first_name: Eline
full_name: Ten Have, Eline
last_name: Ten Have
- first_name: Matti
full_name: Van Engelen, Matti
last_name: Van Engelen
- first_name: Manuel
full_name: Caroli, Manuel
last_name: Caroli
- first_name: Monique
full_name: Teillaud, Monique
last_name: Teillaud
citation:
ama: 'Van De Weygaert R, Vegter G, Edelsbrunner H, et al. Alpha, Betti and the Megaparsec
Universe: On the topology of the Cosmic Web. In: Gavrilova M, Tan K, Mostafavi
M, eds. Transactions on Computational Science XIV. Vol 6970. Special Issue
on Voronoi Diagrams and Delaunay Triangulation. Springer; 2011:60-101. doi:10.1007/978-3-642-25249-5_3'
apa: 'Van De Weygaert, R., Vegter, G., Edelsbrunner, H., Jones, B., Pranav, P.,
Park, C., … Teillaud, M. (2011). Alpha, Betti and the Megaparsec Universe: On
the topology of the Cosmic Web. In M. Gavrilova, K. Tan, & M. Mostafavi (Eds.),
Transactions on Computational Science XIV (Vol. 6970, pp. 60–101). Springer.
https://doi.org/10.1007/978-3-642-25249-5_3'
chicago: 'Van De Weygaert, Rien, Gert Vegter, Herbert Edelsbrunner, Bernard Jones,
Pratyush Pranav, Changbom Park, Wojciech Hellwing, et al. “Alpha, Betti and the
Megaparsec Universe: On the Topology of the Cosmic Web.” In Transactions on
Computational Science XIV, edited by Marina Gavrilova, Kenneth Tan, and Mir
Mostafavi, 6970:60–101. Special Issue on Voronoi Diagrams and Delaunay Triangulation.
Springer, 2011. https://doi.org/10.1007/978-3-642-25249-5_3.'
ieee: 'R. Van De Weygaert et al., “Alpha, Betti and the Megaparsec Universe:
On the topology of the Cosmic Web,” in Transactions on Computational Science
XIV, vol. 6970, M. Gavrilova, K. Tan, and M. Mostafavi, Eds. Springer, 2011,
pp. 60–101.'
ista: 'Van De Weygaert R, Vegter G, Edelsbrunner H, Jones B, Pranav P, Park C, Hellwing
W, Eldering B, Kruithof N, Bos P, Hidding J, Feldbrugge J, Ten Have E, Van Engelen
M, Caroli M, Teillaud M. 2011.Alpha, Betti and the Megaparsec Universe: On the
topology of the Cosmic Web. In: Transactions on Computational Science XIV. LNCS,
vol. 6970, 60–101.'
mla: 'Van De Weygaert, Rien, et al. “Alpha, Betti and the Megaparsec Universe: On
the Topology of the Cosmic Web.” Transactions on Computational Science XIV,
edited by Marina Gavrilova et al., vol. 6970, Springer, 2011, pp. 60–101, doi:10.1007/978-3-642-25249-5_3.'
short: R. Van De Weygaert, G. Vegter, H. Edelsbrunner, B. Jones, P. Pranav, C. Park,
W. Hellwing, B. Eldering, N. Kruithof, P. Bos, J. Hidding, J. Feldbrugge, E. Ten
Have, M. Van Engelen, M. Caroli, M. Teillaud, in:, M. Gavrilova, K. Tan, M. Mostafavi
(Eds.), Transactions on Computational Science XIV, Springer, 2011, pp. 60–101.
date_created: 2018-12-11T12:02:44Z
date_published: 2011-11-09T00:00:00Z
date_updated: 2021-01-12T07:42:44Z
day: '09'
department:
- _id: HeEd
doi: 10.1007/978-3-642-25249-5_3
editor:
- first_name: Marina
full_name: Gavrilova, Marina
last_name: Gavrilova
- first_name: Kenneth
full_name: Tan, Kenneth
last_name: Tan
- first_name: Mir
full_name: Mostafavi, Mir
last_name: Mostafavi
external_id:
arxiv:
- '1306.3640'
intvolume: ' 6970'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1306.3640
month: '11'
oa: 1
oa_version: Preprint
page: 60 - 101
publication: Transactions on Computational Science XIV
publication_status: published
publisher: Springer
publist_id: '3295'
quality_controlled: '1'
scopus_import: 1
series_title: Special Issue on Voronoi Diagrams and Delaunay Triangulation
status: public
title: 'Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web'
type: book_chapter
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6970
year: '2011'
...
---
_id: '3336'
abstract:
- lang: eng
text: 'We introduce TopoCut: a new way to integrate knowledge about topological
properties (TPs) into random field image segmentation model. Instead of including
TPs as additional constraints during minimization of the energy function, we devise
an efficient algorithm for modifying the unary potentials such that the resulting
segmentation is guaranteed with the desired properties. Our method is more flexible
in the sense that it handles more topology constraints than previous methods,
which were only able to enforce pairwise or global connectivity. In particular,
our method is very fast, making it for the first time possible to enforce global
topological properties in practical image segmentation tasks.'
acknowledgement: The first author is supported by the Austrian Science Fund (FWF)
grant No. P20134-N13. The authors would like to thank Sebastian Nowozin for helpful
discussions.
article_processing_charge: No
author:
- first_name: Chao
full_name: Chen, Chao
id: 3E92416E-F248-11E8-B48F-1D18A9856A87
last_name: Chen
- first_name: Daniel
full_name: Freedman, Daniel
last_name: Freedman
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Chen C, Freedman D, Lampert C. Enforcing topological constraints in random
field image segmentation. In: CVPR: Computer Vision and Pattern Recognition.
IEEE; 2011:2089-2096. doi:10.1109/CVPR.2011.5995503'
apa: 'Chen, C., Freedman, D., & Lampert, C. (2011). Enforcing topological constraints
in random field image segmentation. In CVPR: Computer Vision and Pattern Recognition
(pp. 2089–2096). Colorado Springs, CO, United States: IEEE. https://doi.org/10.1109/CVPR.2011.5995503'
chicago: 'Chen, Chao, Daniel Freedman, and Christoph Lampert. “Enforcing Topological
Constraints in Random Field Image Segmentation.” In CVPR: Computer Vision and
Pattern Recognition, 2089–96. IEEE, 2011. https://doi.org/10.1109/CVPR.2011.5995503.'
ieee: 'C. Chen, D. Freedman, and C. Lampert, “Enforcing topological constraints
in random field image segmentation,” in CVPR: Computer Vision and Pattern Recognition,
Colorado Springs, CO, United States, 2011, pp. 2089–2096.'
ista: 'Chen C, Freedman D, Lampert C. 2011. Enforcing topological constraints in
random field image segmentation. CVPR: Computer Vision and Pattern Recognition.
CVPR: Conference on Computer Vision and Pattern Recognition, 2089–2096.'
mla: 'Chen, Chao, et al. “Enforcing Topological Constraints in Random Field Image
Segmentation.” CVPR: Computer Vision and Pattern Recognition, IEEE, 2011,
pp. 2089–96, doi:10.1109/CVPR.2011.5995503.'
short: 'C. Chen, D. Freedman, C. Lampert, in:, CVPR: Computer Vision and Pattern
Recognition, IEEE, 2011, pp. 2089–2096.'
conference:
end_date: 2011-06-25
location: Colorado Springs, CO, United States
name: 'CVPR: Conference on Computer Vision and Pattern Recognition'
start_date: 2011-06-20
date_created: 2018-12-11T12:02:45Z
date_published: 2011-07-22T00:00:00Z
date_updated: 2023-02-23T12:23:56Z
day: '22'
department:
- _id: HeEd
- _id: ChLa
doi: 10.1109/CVPR.2011.5995503
language:
- iso: eng
month: '07'
oa_version: None
page: 2089 - 2096
publication: 'CVPR: Computer Vision and Pattern Recognition'
publication_identifier:
eisbn:
- 978-1-4577-0395-9
isbn:
- 978-1-4577-0394-2
publication_status: published
publisher: IEEE
publist_id: '3294'
quality_controlled: '1'
related_material:
record:
- id: '5386'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Enforcing topological constraints in random field image segmentation
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...