---
_id: '3159'
abstract:
- lang: eng
text: The structure of hierarchical networks in biological and physical systems
has long been characterized using the Horton-Strahler ordering scheme. The scheme
assigns an integer order to each edge in the network based on the topology of
branching such that the order increases from distal parts of the network (e.g.,
mountain streams or capillaries) to the "root" of the network (e.g.,
the river outlet or the aorta). However, Horton-Strahler ordering cannot be applied
to networks with loops because they they create a contradiction in the edge ordering
in terms of which edge precedes another in the hierarchy. Here, we present a generalization
of the Horton-Strahler order to weighted planar reticular networks, where weights
are assumed to correlate with the importance of network edges, e.g., weights estimated
from edge widths may correlate to flow capacity. Our method assigns hierarchical
levels not only to edges of the network, but also to its loops, and classifies
the edges into reticular edges, which are responsible for loop formation, and
tree edges. In addition, we perform a detailed and rigorous theoretical analysis
of the sensitivity of the hierarchical levels to weight perturbations. In doing
so, we show that the ordering of the reticular edges is more robust to noise in
weight estimation than is the ordering of the tree edges. We discuss applications
of this generalized Horton-Strahler ordering to the study of leaf venation and
other biological networks.
acknowledgement: "his work was supported by the National Science Foundation Plant
Genome Research Program (grant 0820624 to H.E. and J.S.W.), the Defense Advanced
Projects Research Agency (grant HR0011-09-1-0055 to H.E. and J.S.W.), and the European
Science Foundation (under the Research Networking Programme on “Applied and Computational
Algebraic Topology” run by H.E.). Joshua S. Weitz, Ph.D., holds a Career Award at
the Scientific Interface from the Burroughs Wellcome Fund.\r\n\r\n\r\n\r\nDuring
preparation of this manuscript the authors became aware of a related work by Katifori
and Magnasco (arXiv:1110.1412v1), concurrently submitted and accepted for publication
in PLoS ONE."
article_number: e36715
author:
- first_name: Yuriy
full_name: Mileyko, Yuriy
last_name: Mileyko
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Charles
full_name: Price, Charles
last_name: Price
- first_name: Joshua
full_name: Weitz, Joshua
last_name: Weitz
citation:
ama: Mileyko Y, Edelsbrunner H, Price C, Weitz J. Hierarchical ordering of reticular
networks. PLoS One. 2012;7(6). doi:10.1371/journal.pone.0036715
apa: Mileyko, Y., Edelsbrunner, H., Price, C., & Weitz, J. (2012). Hierarchical
ordering of reticular networks. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0036715
chicago: Mileyko, Yuriy, Herbert Edelsbrunner, Charles Price, and Joshua Weitz.
“Hierarchical Ordering of Reticular Networks.” PLoS One. Public Library
of Science, 2012. https://doi.org/10.1371/journal.pone.0036715.
ieee: Y. Mileyko, H. Edelsbrunner, C. Price, and J. Weitz, “Hierarchical ordering
of reticular networks,” PLoS One, vol. 7, no. 6. Public Library of Science,
2012.
ista: Mileyko Y, Edelsbrunner H, Price C, Weitz J. 2012. Hierarchical ordering of
reticular networks. PLoS One. 7(6), e36715.
mla: Mileyko, Yuriy, et al. “Hierarchical Ordering of Reticular Networks.” PLoS
One, vol. 7, no. 6, e36715, Public Library of Science, 2012, doi:10.1371/journal.pone.0036715.
short: Y. Mileyko, H. Edelsbrunner, C. Price, J. Weitz, PLoS One 7 (2012).
date_created: 2018-12-11T12:01:44Z
date_published: 2012-06-06T00:00:00Z
date_updated: 2021-01-12T07:41:28Z
day: '06'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1371/journal.pone.0036715
file:
- access_level: open_access
checksum: 515a98ad72e470752f03f13663dcaff8
content_type: application/pdf
creator: kschuh
date_created: 2019-02-05T12:38:43Z
date_updated: 2020-07-14T12:46:01Z
file_id: '5922'
file_name: 2012_PLoS_Mileyko.PDF
file_size: 541583
relation: main_file
file_date_updated: 2020-07-14T12:46:01Z
has_accepted_license: '1'
intvolume: ' 7'
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '3530'
pubrep_id: '385'
quality_controlled: '1'
scopus_import: 1
status: public
title: Hierarchical ordering of reticular networks
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2012'
...
---
_id: '3256'
abstract:
- lang: eng
text: We use a distortion to define the dual complex of a cubical subdivision of
ℝ n as an n-dimensional subcomplex of the nerve of the set of n-cubes. Motivated
by the topological analysis of high-dimensional digital image data, we consider
such subdivisions defined by generalizations of quad- and oct-trees to n dimensions.
Assuming the subdivision is balanced, we show that mapping each vertex to the
center of the corresponding n-cube gives a geometric realization of the dual complex
in ℝ n.
acknowledgement: This research is partially supported by the Defense Advanced Research
Projects Agency (DARPA) under grants HR0011-05-1-0057 and HR0011-09-0065 as well
as the National Science Foundation (NSF) under grant DBI-0820624.
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Michael
full_name: Kerber, Michael
id: 36E4574A-F248-11E8-B48F-1D18A9856A87
last_name: Kerber
orcid: 0000-0002-8030-9299
citation:
ama: Edelsbrunner H, Kerber M. Dual complexes of cubical subdivisions of ℝn. Discrete
& Computational Geometry. 2012;47(2):393-414. doi:10.1007/s00454-011-9382-4
apa: Edelsbrunner, H., & Kerber, M. (2012). Dual complexes of cubical subdivisions
of ℝn. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-011-9382-4
chicago: Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions
of ℝn.” Discrete & Computational Geometry. Springer, 2012. https://doi.org/10.1007/s00454-011-9382-4.
ieee: H. Edelsbrunner and M. Kerber, “Dual complexes of cubical subdivisions of
ℝn,” Discrete & Computational Geometry, vol. 47, no. 2. Springer, pp.
393–414, 2012.
ista: Edelsbrunner H, Kerber M. 2012. Dual complexes of cubical subdivisions of
ℝn. Discrete & Computational Geometry. 47(2), 393–414.
mla: Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions
of ℝn.” Discrete & Computational Geometry, vol. 47, no. 2, Springer,
2012, pp. 393–414, doi:10.1007/s00454-011-9382-4.
short: H. Edelsbrunner, M. Kerber, Discrete & Computational Geometry 47 (2012)
393–414.
date_created: 2018-12-11T12:02:17Z
date_published: 2012-03-01T00:00:00Z
date_updated: 2021-01-12T07:42:10Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1007/s00454-011-9382-4
file:
- access_level: open_access
checksum: 76486f3b2c9e7fd81342f3832ca387e7
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:15Z
date_updated: 2020-07-14T12:46:05Z
file_id: '4675'
file_name: IST-2016-543-v1+1_2012-J-08-HierarchyCubeComplex.pdf
file_size: 203636
relation: main_file
file_date_updated: 2020-07-14T12:46:05Z
has_accepted_license: '1'
intvolume: ' 47'
issue: '2'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 393 - 414
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '3398'
pubrep_id: '543'
quality_controlled: '1'
scopus_import: 1
status: public
title: Dual complexes of cubical subdivisions of ℝn
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 47
year: '2012'
...
---
_id: '3265'
abstract:
- lang: eng
text: We propose a mid-level statistical model for image segmentation that composes
multiple figure-ground hypotheses (FG) obtained by applying constraints at different
locations and scales, into larger interpretations (tilings) of the entire image.
Inference is cast as optimization over sets of maximal cliques sampled from a
graph connecting all non-overlapping figure-ground segment hypotheses. Potential
functions over cliques combine unary, Gestalt-based figure qualities, and pairwise
compatibilities among spatially neighboring segments, constrained by T-junctions
and the boundary interface statistics of real scenes. Learning the model parameters
is based on maximum likelihood, alternating between sampling image tilings and
optimizing their potential function parameters. State of the art results are reported
on the Berkeley and Stanford segmentation datasets, as well as VOC2009, where
a 28% improvement was achieved.
article_number: '6126486'
author:
- first_name: Adrian
full_name: Ion, Adrian
id: 29F89302-F248-11E8-B48F-1D18A9856A87
last_name: Ion
- first_name: Joao
full_name: Carreira, Joao
last_name: Carreira
- first_name: Cristian
full_name: Sminchisescu, Cristian
last_name: Sminchisescu
citation:
ama: 'Ion A, Carreira J, Sminchisescu C. Image segmentation by figure-ground composition
into maximal cliques. In: IEEE; 2012. doi:10.1109/ICCV.2011.6126486'
apa: 'Ion, A., Carreira, J., & Sminchisescu, C. (2012). Image segmentation by
figure-ground composition into maximal cliques. Presented at the ICCV: International
Conference on Computer Vision, Barcelona, Spain: IEEE. https://doi.org/10.1109/ICCV.2011.6126486'
chicago: Ion, Adrian, Joao Carreira, and Cristian Sminchisescu. “Image Segmentation
by Figure-Ground Composition into Maximal Cliques.” IEEE, 2012. https://doi.org/10.1109/ICCV.2011.6126486.
ieee: 'A. Ion, J. Carreira, and C. Sminchisescu, “Image segmentation by figure-ground
composition into maximal cliques,” presented at the ICCV: International Conference
on Computer Vision, Barcelona, Spain, 2012.'
ista: 'Ion A, Carreira J, Sminchisescu C. 2012. Image segmentation by figure-ground
composition into maximal cliques. ICCV: International Conference on Computer Vision,
6126486.'
mla: Ion, Adrian, et al. Image Segmentation by Figure-Ground Composition into
Maximal Cliques. 6126486, IEEE, 2012, doi:10.1109/ICCV.2011.6126486.
short: A. Ion, J. Carreira, C. Sminchisescu, in:, IEEE, 2012.
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:21Z
date_published: 2012-01-12T00:00:00Z
date_updated: 2021-01-12T07:42:15Z
day: '12'
department:
- _id: HeEd
doi: 10.1109/ICCV.2011.6126486
language:
- iso: eng
month: '01'
oa_version: None
publication_status: published
publisher: IEEE
publist_id: '3382'
quality_controlled: '1'
status: public
title: Image segmentation by figure-ground composition into maximal cliques
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '3310'
abstract:
- lang: eng
text: The theory of persistent homology opens up the possibility to reason about
topological features of a space or a function quantitatively and in combinatorial
terms. We refer to this new angle at a classical subject within algebraic topology
as a point calculus, which we present for the family of interlevel sets of a real-valued
function. Our account of the subject is expository, devoid of proofs, and written
for non-experts in algebraic topology.
acknowledgement: Research by the third author is partially supported by the National
Science Foundation (NSF) under grant DBI-0820624.
author:
- first_name: Paul
full_name: Bendich, Paul
id: 43F6EC54-F248-11E8-B48F-1D18A9856A87
last_name: Bendich
- first_name: Sergio
full_name: Cabello, Sergio
last_name: Cabello
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: Bendich P, Cabello S, Edelsbrunner H. A point calculus for interlevel set homology.
Pattern Recognition Letters. 2012;33(11):1436-1444. doi:10.1016/j.patrec.2011.10.007
apa: Bendich, P., Cabello, S., & Edelsbrunner, H. (2012). A point calculus for
interlevel set homology. Pattern Recognition Letters. Elsevier. https://doi.org/10.1016/j.patrec.2011.10.007
chicago: Bendich, Paul, Sergio Cabello, and Herbert Edelsbrunner. “A Point Calculus
for Interlevel Set Homology.” Pattern Recognition Letters. Elsevier, 2012.
https://doi.org/10.1016/j.patrec.2011.10.007.
ieee: P. Bendich, S. Cabello, and H. Edelsbrunner, “A point calculus for interlevel
set homology,” Pattern Recognition Letters, vol. 33, no. 11. Elsevier,
pp. 1436–1444, 2012.
ista: Bendich P, Cabello S, Edelsbrunner H. 2012. A point calculus for interlevel
set homology. Pattern Recognition Letters. 33(11), 1436–1444.
mla: Bendich, Paul, et al. “A Point Calculus for Interlevel Set Homology.” Pattern
Recognition Letters, vol. 33, no. 11, Elsevier, 2012, pp. 1436–44, doi:10.1016/j.patrec.2011.10.007.
short: P. Bendich, S. Cabello, H. Edelsbrunner, Pattern Recognition Letters 33 (2012)
1436–1444.
date_created: 2018-12-11T12:02:36Z
date_published: 2012-08-01T00:00:00Z
date_updated: 2021-01-12T07:42:34Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1016/j.patrec.2011.10.007
file:
- access_level: open_access
checksum: d65f79775b51258a604ca5ec741297cc
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:00Z
date_updated: 2020-07-14T12:46:06Z
file_id: '5116'
file_name: IST-2016-542-v1+1_2012-J-01-Poinculus.pdf
file_size: 280280
relation: main_file
file_date_updated: 2020-07-14T12:46:06Z
has_accepted_license: '1'
intvolume: ' 33'
issue: '11'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 1436 - 1444
publication: Pattern Recognition Letters
publication_status: published
publisher: Elsevier
publist_id: '3330'
pubrep_id: '542'
quality_controlled: '1'
scopus_import: 1
status: public
title: A point calculus for interlevel set homology
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2012'
...
---
_id: '3331'
abstract:
- lang: eng
text: Computing the topology of an algebraic plane curve C means computing a combinatorial
graph that is isotopic to C and thus represents its topology in R2. We prove that,
for a polynomial of degree n with integer coefficients bounded by 2ρ, the topology
of the induced curve can be computed with bit operations ( indicates that we
omit logarithmic factors). Our analysis improves the previous best known complexity
bounds by a factor of n2. The improvement is based on new techniques to compute
and refine isolating intervals for the real roots of polynomials, and on the consequent
amortized analysis of the critical fibers of the algebraic curve.
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 worst case bound for topology computation of algebraic
curves. Journal of Symbolic Computation. 2012;47(3):239-258. doi:10.1016/j.jsc.2011.11.001
apa: Kerber, M., & Sagraloff, M. (2012). A worst case bound for topology computation
of algebraic curves. Journal of Symbolic Computation. Elsevier. https://doi.org/10.1016/j.jsc.2011.11.001
chicago: Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology
Computation of Algebraic Curves.” Journal of Symbolic Computation. Elsevier,
2012. https://doi.org/10.1016/j.jsc.2011.11.001.
ieee: M. Kerber and M. Sagraloff, “A worst case bound for topology computation of
algebraic curves,” Journal of Symbolic Computation, vol. 47, no. 3. Elsevier,
pp. 239–258, 2012.
ista: Kerber M, Sagraloff M. 2012. A worst case bound for topology computation of
algebraic curves. Journal of Symbolic Computation. 47(3), 239–258.
mla: Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation
of Algebraic Curves.” Journal of Symbolic Computation, vol. 47, no. 3,
Elsevier, 2012, pp. 239–58, doi:10.1016/j.jsc.2011.11.001.
short: M. Kerber, M. Sagraloff, Journal of Symbolic Computation 47 (2012) 239–258.
date_created: 2018-12-11T12:02:43Z
date_published: 2012-03-01T00:00:00Z
date_updated: 2021-01-12T07:42:43Z
day: '01'
department:
- _id: HeEd
doi: 10.1016/j.jsc.2011.11.001
intvolume: ' 47'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1104.1510
month: '03'
oa: 1
oa_version: Preprint
page: 239 - 258
publication: ' Journal of Symbolic Computation'
publication_status: published
publisher: Elsevier
publist_id: '3303'
quality_controlled: '1'
scopus_import: 1
status: public
title: A worst case bound for topology computation of algebraic curves
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 47
year: '2012'
...
---
_id: '9648'
abstract:
- lang: eng
text: In this paper, we establish a correspondence between the incremental algorithm
for computing AT-models [8,9] and the one for computing persistent homology [6,14,15].
We also present a decremental algorithm for computing AT-models that allows to
extend the persistence computation to a wider setting. Finally, we show how to
combine incremental and decremental techniques for persistent homology computation.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Rocio
full_name: Gonzalez-Diaz, Rocio
last_name: Gonzalez-Diaz
- first_name: Adrian
full_name: Ion, Adrian
id: 29F89302-F248-11E8-B48F-1D18A9856A87
last_name: Ion
- first_name: Maria Jose
full_name: Jimenez, Maria Jose
last_name: Jimenez
- first_name: Regina
full_name: Poyatos, Regina
last_name: Poyatos
citation:
ama: 'Gonzalez-Diaz R, Ion A, Jimenez MJ, Poyatos R. Incremental-decremental algorithm
for computing AT-models and persistent homology. In: Computer Analysis of Images
and Patterns. Vol 6854. Springer Nature; 2011:286-293. doi:10.1007/978-3-642-23672-3_35'
apa: 'Gonzalez-Diaz, R., Ion, A., Jimenez, M. J., & Poyatos, R. (2011). Incremental-decremental
algorithm for computing AT-models and persistent homology. In Computer Analysis
of Images and Patterns (Vol. 6854, pp. 286–293). Seville, Spain: Springer
Nature. https://doi.org/10.1007/978-3-642-23672-3_35'
chicago: Gonzalez-Diaz, Rocio, Adrian Ion, Maria Jose Jimenez, and Regina Poyatos.
“Incremental-Decremental Algorithm for Computing AT-Models and Persistent Homology.”
In Computer Analysis of Images and Patterns, 6854:286–93. Springer Nature,
2011. https://doi.org/10.1007/978-3-642-23672-3_35.
ieee: R. Gonzalez-Diaz, A. Ion, M. J. Jimenez, and R. Poyatos, “Incremental-decremental
algorithm for computing AT-models and persistent homology,” in Computer Analysis
of Images and Patterns, Seville, Spain, 2011, vol. 6854, pp. 286–293.
ista: 'Gonzalez-Diaz R, Ion A, Jimenez MJ, Poyatos R. 2011. Incremental-decremental
algorithm for computing AT-models and persistent homology. Computer Analysis of
Images and Patterns. CAIP: International Conference on Computer Analysis of Images
and Patterns, LNCS, vol. 6854, 286–293.'
mla: Gonzalez-Diaz, Rocio, et al. “Incremental-Decremental Algorithm for Computing
AT-Models and Persistent Homology.” Computer Analysis of Images and Patterns,
vol. 6854, Springer Nature, 2011, pp. 286–93, doi:10.1007/978-3-642-23672-3_35.
short: R. Gonzalez-Diaz, A. Ion, M.J. Jimenez, R. Poyatos, in:, Computer Analysis
of Images and Patterns, Springer Nature, 2011, pp. 286–293.
conference:
end_date: 2011-08-31
location: Seville, Spain
name: 'CAIP: International Conference on Computer Analysis of Images and Patterns'
start_date: 2011-08-29
date_created: 2021-07-11T22:01:19Z
date_published: 2011-08-01T00:00:00Z
date_updated: 2021-08-12T13:53:17Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/978-3-642-23672-3_35
intvolume: ' 6854'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://hdl.handle.net/11441/30766
month: '08'
oa: 1
oa_version: Published Version
page: 286-293
publication: Computer Analysis of Images and Patterns
publication_identifier:
eissn:
- '16113349'
isbn:
- '9783642236716'
issn:
- '03029743'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Incremental-decremental algorithm for computing AT-models and persistent homology
type: conference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 6854
year: '2011'
...
---
_id: '10907'
abstract:
- lang: eng
text: This paper presents a method to create a model of an articulated object using
the planar motion in an initialization video. The model consists of rigid parts
connected by points of articulation. The rigid parts are described by the positions
of salient feature-points tracked throughout the video. Following a filtering
step that identifies points that belong to different objects, rigid parts are
found by a grouping process in a graph pyramid. Valid articulation points are
selected by verifying multiple hypotheses for each pair of parts.
acknowledgement: This work has been partially supported by the Austrian Science Fund
under grants S9103-N13 and P18716-N13.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Nicole M.
full_name: Artner, Nicole M.
last_name: Artner
- first_name: Adrian
full_name: Ion, Adrian
id: 29F89302-F248-11E8-B48F-1D18A9856A87
last_name: Ion
- first_name: Walter G.
full_name: Kropatsch, Walter G.
last_name: Kropatsch
citation:
ama: 'Artner NM, Ion A, Kropatsch WG. Spatio-temporal extraction of articulated
models in a graph pyramid. In: Jiang X, Ferrer M, Torsello A, eds. Graph-Based
Representations in Pattern Recognition. Vol 6658. LNIP. Berlin, Heidelberg:
Springer; 2011:215-224. doi:10.1007/978-3-642-20844-7_22'
apa: 'Artner, N. M., Ion, A., & Kropatsch, W. G. (2011). Spatio-temporal extraction
of articulated models in a graph pyramid. In X. Jiang, M. Ferrer, & A. Torsello
(Eds.), Graph-Based Representations in Pattern Recognition (Vol. 6658,
pp. 215–224). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-20844-7_22'
chicago: 'Artner, Nicole M., Adrian Ion, and Walter G. Kropatsch. “Spatio-Temporal
Extraction of Articulated Models in a Graph Pyramid.” In Graph-Based Representations
in Pattern Recognition, edited by Xiaoyi Jiang, Miquel Ferrer, and Andrea
Torsello, 6658:215–24. LNIP. Berlin, Heidelberg: Springer, 2011. https://doi.org/10.1007/978-3-642-20844-7_22.'
ieee: N. M. Artner, A. Ion, and W. G. Kropatsch, “Spatio-temporal extraction of
articulated models in a graph pyramid,” in Graph-Based Representations in Pattern
Recognition, Münster, Germany, 2011, vol. 6658, pp. 215–224.
ista: 'Artner NM, Ion A, Kropatsch WG. 2011. Spatio-temporal extraction of articulated
models in a graph pyramid. Graph-Based Representations in Pattern Recognition.
GbRPR: Graph-based Representations in Pattern RecognitionLNIP, LNCS, vol. 6658,
215–224.'
mla: Artner, Nicole M., et al. “Spatio-Temporal Extraction of Articulated Models
in a Graph Pyramid.” Graph-Based Representations in Pattern Recognition,
edited by Xiaoyi Jiang et al., vol. 6658, Springer, 2011, pp. 215–24, doi:10.1007/978-3-642-20844-7_22.
short: N.M. Artner, A. Ion, W.G. Kropatsch, in:, X. Jiang, M. Ferrer, A. Torsello
(Eds.), Graph-Based Representations in Pattern Recognition, Springer, Berlin,
Heidelberg, 2011, pp. 215–224.
conference:
end_date: 2011-05-20
location: Münster, Germany
name: 'GbRPR: Graph-based Representations in Pattern Recognition'
start_date: 2011-05-18
date_created: 2022-03-21T08:08:35Z
date_published: 2011-06-01T00:00:00Z
date_updated: 2023-09-05T14:10:15Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/978-3-642-20844-7_22
editor:
- first_name: Xiaoyi
full_name: Jiang, Xiaoyi
last_name: Jiang
- first_name: Miquel
full_name: Ferrer, Miquel
last_name: Ferrer
- first_name: Andrea
full_name: Torsello, Andrea
last_name: Torsello
intvolume: ' 6658'
language:
- iso: eng
month: '06'
oa_version: None
page: 215-224
place: Berlin, Heidelberg
publication: Graph-Based Representations in Pattern Recognition
publication_identifier:
eisbn:
- '9783642208447'
eissn:
- 1611-3349
isbn:
- '9783642208430'
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
series_title: LNIP
status: public
title: Spatio-temporal extraction of articulated models in a graph pyramid
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 6658
year: '2011'
...
---
_id: '3266'
abstract:
- lang: eng
text: We present a joint image segmentation and labeling model (JSL) which, given
a bag of figure-ground segment hypotheses extracted at multiple image locations
and scales, constructs a joint probability distribution over both the compatible
image interpretations (tilings or image segmentations) composed from those segments,
and over their labeling into categories. The process of drawing samples from the
joint distribution can be interpreted as first sampling tilings, modeled as maximal
cliques, from a graph connecting spatially non-overlapping segments in the bag
[1], followed by sampling labels for those segments, conditioned on the choice
of a particular tiling. We learn the segmentation and labeling parameters jointly,
based on Maximum Likelihood with a novel Incremental Saddle Point estimation procedure.
The partition function over tilings and labelings is increasingly more accurately
approximated by including incorrect configurations that a not-yet-competent model
rates probable during learning. We show that the proposed methodologymatches the
current state of the art in the Stanford dataset [2], as well as in VOC2010, where
41.7% accuracy on the test set is achieved.
author:
- first_name: Adrian
full_name: Ion, Adrian
id: 29F89302-F248-11E8-B48F-1D18A9856A87
last_name: Ion
- first_name: Joao
full_name: Carreira, Joao
last_name: Carreira
- first_name: Cristian
full_name: Sminchisescu, Cristian
last_name: Sminchisescu
citation:
ama: 'Ion A, Carreira J, Sminchisescu C. Probabilistic joint image segmentation
and labeling. In: NIPS Proceedings. Vol 24. Neural Information Processing
Systems Foundation; 2011:1827-1835.'
apa: 'Ion, A., Carreira, J., & Sminchisescu, C. (2011). Probabilistic joint
image segmentation and labeling. In NIPS Proceedings (Vol. 24, pp. 1827–1835).
Granada, Spain: Neural Information Processing Systems Foundation.'
chicago: Ion, Adrian, Joao Carreira, and Cristian Sminchisescu. “Probabilistic Joint
Image Segmentation and Labeling.” In NIPS Proceedings, 24:1827–35. Neural
Information Processing Systems Foundation, 2011.
ieee: A. Ion, J. Carreira, and C. Sminchisescu, “Probabilistic joint image segmentation
and labeling,” in NIPS Proceedings, Granada, Spain, 2011, vol. 24, pp.
1827–1835.
ista: 'Ion A, Carreira J, Sminchisescu C. 2011. Probabilistic joint image segmentation
and labeling. NIPS Proceedings. NIPS: Neural Information Processing Systems vol.
24, 1827–1835.'
mla: Ion, Adrian, et al. “Probabilistic Joint Image Segmentation and Labeling.”
NIPS Proceedings, vol. 24, Neural Information Processing Systems Foundation,
2011, pp. 1827–35.
short: A. Ion, J. Carreira, C. Sminchisescu, in:, NIPS Proceedings, Neural Information
Processing Systems Foundation, 2011, pp. 1827–1835.
conference:
end_date: 2011-12-14
location: Granada, Spain
name: 'NIPS: Neural Information Processing Systems'
start_date: 2011-12-12
date_created: 2018-12-11T12:02:21Z
date_published: 2011-12-01T00:00:00Z
date_updated: 2021-01-12T07:42:15Z
day: '01'
department:
- _id: HeEd
intvolume: ' 24'
language:
- iso: eng
month: '12'
oa_version: None
page: 1827 - 1835
publication: NIPS Proceedings
publication_status: published
publisher: Neural Information Processing Systems Foundation
publist_id: '3381'
quality_controlled: '1'
scopus_import: 1
status: public
title: Probabilistic joint image segmentation and labeling
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '2011'
...
---
_id: '3267'
abstract:
- lang: eng
text: 'We address the problem of localizing homology classes, namely, finding the
cycle representing a given class with the most concise geometric measure. We study
the problem with different measures: volume, diameter and radius. For volume,
that is, the 1-norm of a cycle, two main results are presented. First, we prove
that the problem is NP-hard to approximate within any constant factor. Second,
we prove that for homology of dimension two or higher, the problem is NP-hard
to approximate even when the Betti number is O(1). The latter result leads to
the inapproximability of the problem of computing the nonbounding cycle with the
smallest volume and computing cycles representing a homology basis with the minimal
total volume. As for the other two measures defined by pairwise geodesic distance,
diameter and radius, we show that the localization problem is NP-hard for diameter
but is polynomial for radius. Our work is restricted to homology over the ℤ2 field.'
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
citation:
ama: Chen C, Freedman D. Hardness results for homology localization. Discrete
& Computational Geometry. 2011;45(3):425-448. doi:10.1007/s00454-010-9322-8
apa: Chen, C., & Freedman, D. (2011). Hardness results for homology localization.
Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-010-9322-8
chicago: Chen, Chao, and Daniel Freedman. “Hardness Results for Homology Localization.”
Discrete & Computational Geometry. Springer, 2011. https://doi.org/10.1007/s00454-010-9322-8.
ieee: C. Chen and D. Freedman, “Hardness results for homology localization,” Discrete
& Computational Geometry, vol. 45, no. 3. Springer, pp. 425–448, 2011.
ista: Chen C, Freedman D. 2011. Hardness results for homology localization. Discrete
& Computational Geometry. 45(3), 425–448.
mla: Chen, Chao, and Daniel Freedman. “Hardness Results for Homology Localization.”
Discrete & Computational Geometry, vol. 45, no. 3, Springer, 2011,
pp. 425–48, doi:10.1007/s00454-010-9322-8.
short: C. Chen, D. Freedman, Discrete & Computational Geometry 45 (2011) 425–448.
date_created: 2018-12-11T12:02:21Z
date_published: 2011-01-14T00:00:00Z
date_updated: 2023-02-21T16:07:10Z
day: '14'
department:
- _id: HeEd
doi: 10.1007/s00454-010-9322-8
intvolume: ' 45'
issue: '3'
language:
- iso: eng
month: '01'
oa_version: None
page: 425 - 448
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '3379'
quality_controlled: '1'
related_material:
record:
- id: '10909'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Hardness results for homology localization
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 45
year: '2011'
...
---
_id: '3269'
abstract:
- lang: eng
text: The unintentional scattering of light between neighboring surfaces in complex
projection environments increases the brightness and decreases the contrast, disrupting
the appearance of the desired imagery. To achieve satisfactory projection results,
the inverse problem of global illumination must be solved to cancel this secondary
scattering. In this paper, we propose a global illumination cancellation method
that minimizes the perceptual difference between the desired imagery and the actual
total illumination in the resulting physical environment. Using Gauss-Newton and
active set methods, we design a fast solver for the bound constrained nonlinear
least squares problem raised by the perceptual error metrics. Our solver is further
accelerated with a CUDA implementation and multi-resolution method to achieve
1–2 fps for problems with approximately 3000 variables. We demonstrate the global
illumination cancellation algorithm with our multi-projector system. Results show
that our method preserves the color fidelity of the desired imagery significantly
better than previous methods.
article_processing_charge: No
article_type: original
author:
- first_name: Yu
full_name: Sheng, Yu
last_name: Sheng
- first_name: Barbara
full_name: Cutler, Barbara
last_name: Cutler
- first_name: Chao
full_name: Chen, Chao
id: 3E92416E-F248-11E8-B48F-1D18A9856A87
last_name: Chen
- first_name: Joshua
full_name: Nasman, Joshua
last_name: Nasman
citation:
ama: Sheng Y, Cutler B, Chen C, Nasman J. Perceptual global illumination cancellation
in complex projection environments. Computer Graphics Forum. 2011;30(4):1261-1268.
doi:10.1111/j.1467-8659.2011.01985.x
apa: Sheng, Y., Cutler, B., Chen, C., & Nasman, J. (2011). Perceptual global
illumination cancellation in complex projection environments. Computer Graphics
Forum. Wiley-Blackwell. https://doi.org/10.1111/j.1467-8659.2011.01985.x
chicago: Sheng, Yu, Barbara Cutler, Chao Chen, and Joshua Nasman. “Perceptual Global
Illumination Cancellation in Complex Projection Environments.” Computer Graphics
Forum. Wiley-Blackwell, 2011. https://doi.org/10.1111/j.1467-8659.2011.01985.x.
ieee: Y. Sheng, B. Cutler, C. Chen, and J. Nasman, “Perceptual global illumination
cancellation in complex projection environments,” Computer Graphics Forum,
vol. 30, no. 4. Wiley-Blackwell, pp. 1261–1268, 2011.
ista: Sheng Y, Cutler B, Chen C, Nasman J. 2011. Perceptual global illumination
cancellation in complex projection environments. Computer Graphics Forum. 30(4),
1261–1268.
mla: Sheng, Yu, et al. “Perceptual Global Illumination Cancellation in Complex Projection
Environments.” Computer Graphics Forum, vol. 30, no. 4, Wiley-Blackwell,
2011, pp. 1261–68, doi:10.1111/j.1467-8659.2011.01985.x.
short: Y. Sheng, B. Cutler, C. Chen, J. Nasman, Computer Graphics Forum 30 (2011)
1261–1268.
date_created: 2018-12-11T12:02:22Z
date_published: 2011-07-19T00:00:00Z
date_updated: 2021-01-12T07:42:16Z
day: '19'
department:
- _id: HeEd
doi: 10.1111/j.1467-8659.2011.01985.x
intvolume: ' 30'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.cs.cmu.edu/%7Eshengyu/download/egsr2011_paper.pdf
month: '07'
oa: 1
oa_version: Published Version
page: 1261 - 1268
publication: Computer Graphics Forum
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3377'
quality_controlled: '1'
scopus_import: 1
status: public
title: Perceptual global illumination cancellation in complex projection environments
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2011'
...
---
_id: '3270'
abstract:
- lang: eng
text: 'The persistence diagram of a filtered simplicial com- plex is usually computed
by reducing the boundary matrix of the complex. We introduce a simple op- timization
technique: by processing the simplices of the complex in decreasing dimension,
we can “kill” columns (i.e., set them to zero) without reducing them. This technique
completely avoids reduction on roughly half of the columns. We demonstrate that
this idea significantly improves the running time of the reduction algorithm in
practice. We also give an output-sensitive complexity analysis for the new al-
gorithm which yields to sub-cubic asymptotic bounds under certain assumptions.'
author:
- first_name: Chao
full_name: Chen, Chao
id: 3E92416E-F248-11E8-B48F-1D18A9856A87
last_name: Chen
- first_name: Michael
full_name: Kerber, Michael
id: 36E4574A-F248-11E8-B48F-1D18A9856A87
last_name: Kerber
orcid: 0000-0002-8030-9299
citation:
ama: 'Chen C, Kerber M. Persistent homology computation with a twist. In: TU Dortmund;
2011:197-200.'
apa: 'Chen, C., & Kerber, M. (2011). Persistent homology computation with a
twist (pp. 197–200). Presented at the EuroCG: European Workshop on Computational
Geometry, Morschach, Switzerland: TU Dortmund.'
chicago: Chen, Chao, and Michael Kerber. “Persistent Homology Computation with a
Twist,” 197–200. TU Dortmund, 2011.
ieee: 'C. Chen and M. Kerber, “Persistent homology computation with a twist,” presented
at the EuroCG: European Workshop on Computational Geometry, Morschach, Switzerland,
2011, pp. 197–200.'
ista: 'Chen C, Kerber M. 2011. Persistent homology computation with a twist. EuroCG:
European Workshop on Computational Geometry, 197–200.'
mla: Chen, Chao, and Michael Kerber. Persistent Homology Computation with a Twist.
TU Dortmund, 2011, pp. 197–200.
short: C. Chen, M. Kerber, in:, TU Dortmund, 2011, pp. 197–200.
conference:
end_date: 2011-03-30
location: Morschach, Switzerland
name: 'EuroCG: European Workshop on Computational Geometry'
start_date: 2011-03-28
date_created: 2018-12-11T12:02:22Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:17Z
day: '01'
department:
- _id: HeEd
language:
- iso: eng
month: '01'
oa_version: None
page: 197 - 200
publication_status: published
publisher: TU Dortmund
publist_id: '3376'
quality_controlled: '1'
status: public
title: Persistent homology computation with a twist
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3271'
abstract:
- lang: eng
text: In this paper we present an efficient framework for computation of persis-
tent homology of cubical data in arbitrary dimensions. An existing algorithm using
simplicial complexes is adapted to the setting of cubical complexes. The proposed
approach enables efficient application of persistent homology in domains where
the data is naturally given in a cubical form. By avoiding triangulation of the
data, we significantly reduce the size of the complex. We also present a data-structure
de- signed to compactly store and quickly manipulate cubical complexes. By means
of numerical experiments, we show high speed and memory efficiency of our ap-
proach. We compare our framework to other available implementations, showing its
superiority. Finally, we report performance on selected 3D and 4D data-sets.
alternative_title:
- Theory, Algorithms, and Applications
author:
- first_name: Hubert
full_name: Wagner, Hubert
last_name: Wagner
- first_name: Chao
full_name: Chen, Chao
id: 3E92416E-F248-11E8-B48F-1D18A9856A87
last_name: Chen
- first_name: Erald
full_name: Vuçini, Erald
last_name: Vuçini
citation:
ama: 'Wagner H, Chen C, Vuçini E. Efficient computation of persistent homology for
cubical data. In: Peikert R, Hauser H, Carr H, Fuchs R, eds. Topological Methods
in Data Analysis and Visualization II. Springer; 2011:91-106. doi:10.1007/978-3-642-23175-9_7'
apa: Wagner, H., Chen, C., & Vuçini, E. (2011). Efficient computation of persistent
homology for cubical data. In R. Peikert, H. Hauser, H. Carr, & R. Fuchs (Eds.),
Topological Methods in Data Analysis and Visualization II (pp. 91–106).
Springer. https://doi.org/10.1007/978-3-642-23175-9_7
chicago: Wagner, Hubert, Chao Chen, and Erald Vuçini. “Efficient Computation of
Persistent Homology for Cubical Data.” In Topological Methods in Data Analysis
and Visualization II, edited by Ronald Peikert, Helwig Hauser, Hamish Carr,
and Raphael Fuchs, 91–106. Springer, 2011. https://doi.org/10.1007/978-3-642-23175-9_7.
ieee: H. Wagner, C. Chen, and E. Vuçini, “Efficient computation of persistent homology
for cubical data,” in Topological Methods in Data Analysis and Visualization
II, R. Peikert, H. Hauser, H. Carr, and R. Fuchs, Eds. Springer, 2011, pp.
91–106.
ista: 'Wagner H, Chen C, Vuçini E. 2011.Efficient computation of persistent homology
for cubical data. In: Topological Methods in Data Analysis and Visualization II.
Theory, Algorithms, and Applications, , 91–106.'
mla: Wagner, Hubert, et al. “Efficient Computation of Persistent Homology for Cubical
Data.” Topological Methods in Data Analysis and Visualization II, edited
by Ronald Peikert et al., Springer, 2011, pp. 91–106, doi:10.1007/978-3-642-23175-9_7.
short: H. Wagner, C. Chen, E. Vuçini, in:, R. Peikert, H. Hauser, H. Carr, R. Fuchs
(Eds.), Topological Methods in Data Analysis and Visualization II, Springer, 2011,
pp. 91–106.
date_created: 2018-12-11T12:02:23Z
date_published: 2011-11-14T00:00:00Z
date_updated: 2021-01-12T07:42:18Z
day: '14'
department:
- _id: HeEd
doi: 10.1007/978-3-642-23175-9_7
editor:
- first_name: Ronald
full_name: Peikert, Ronald
last_name: Peikert
- first_name: Helwig
full_name: Hauser, Helwig
last_name: Hauser
- first_name: Hamish
full_name: Carr, Hamish
last_name: Carr
- first_name: Raphael
full_name: Fuchs, Raphael
last_name: Fuchs
language:
- iso: eng
month: '11'
oa_version: None
page: 91 - 106
publication: Topological Methods in Data Analysis and Visualization II
publication_status: published
publisher: Springer
publist_id: '3375'
quality_controlled: '1'
scopus_import: 1
status: public
title: Efficient computation of persistent homology for cubical data
type: book_chapter
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3311'
abstract:
- lang: eng
text: Alpha shapes have been conceived in 1981 as an attempt to define the shape
of a finite set of point in the plane. Since then, connections to diverse areas
in the sciences and engineering have developed, including to pattern recognition,
digital shape sampling and processing, and structural molecular biology. This
survey begins with a historical account and discusses geometric, algorithmic,
topological, and combinatorial aspects of alpha shapes in this sequence.
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: 'Edelsbrunner H. Alpha shapes - a survey. In: van de Weygaert R, Vegter G,
Ritzerveld J, Icke V, eds. Tessellations in the Sciences: Virtues, Techniques
and Applications of Geometric Tilings. Springer.'
apa: 'Edelsbrunner, H. (n.d.). Alpha shapes - a survey. In R. van de Weygaert, G.
Vegter, J. Ritzerveld, & V. Icke (Eds.), Tessellations in the Sciences:
Virtues, Techniques and Applications of Geometric Tilings. Springer.'
chicago: 'Edelsbrunner, Herbert. “Alpha Shapes - a Survey.” In Tessellations
in the Sciences: Virtues, Techniques and Applications of Geometric Tilings,
edited by R van de Weygaert, G Vegter, J Ritzerveld, and V Icke. Springer, n.d.'
ieee: 'H. Edelsbrunner, “Alpha shapes - a survey,” in Tessellations in the Sciences:
Virtues, Techniques and Applications of Geometric Tilings, R. van de Weygaert,
G. Vegter, J. Ritzerveld, and V. Icke, Eds. Springer.'
ista: 'Edelsbrunner H.Alpha shapes - a survey. In: Tessellations in the Sciences:
Virtues, Techniques and Applications of Geometric Tilings. .'
mla: 'Edelsbrunner, Herbert. “Alpha Shapes - a Survey.” Tessellations in the
Sciences: Virtues, Techniques and Applications of Geometric Tilings, edited
by R van de Weygaert et al., Springer.'
short: 'H. Edelsbrunner, in:, R. van de Weygaert, G. Vegter, J. Ritzerveld, V. Icke
(Eds.), Tessellations in the Sciences: Virtues, Techniques and Applications of
Geometric Tilings, Springer, n.d.'
date_created: 2018-12-11T12:02:36Z
date_published: 2011-12-31T00:00:00Z
date_updated: 2022-05-24T07:56:30Z
day: '31'
ddc:
- '510'
department:
- _id: HeEd
editor:
- first_name: R
full_name: van de Weygaert, R
last_name: van de Weygaert
- first_name: G
full_name: Vegter, G
last_name: Vegter
- first_name: J
full_name: Ritzerveld, J
last_name: Ritzerveld
- first_name: V
full_name: Icke, V
last_name: Icke
file:
- access_level: open_access
checksum: a592ea438351e7280eea993a7713ab8f
content_type: application/pdf
creator: dernst
date_created: 2022-05-24T07:55:05Z
date_updated: 2022-05-24T07:55:05Z
file_id: '11408'
file_name: 2010_AlphaShapes.pdf
file_size: 475254
relation: main_file
success: 1
file_date_updated: 2022-05-24T07:55:05Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Submitted Version
publication: 'Tessellations in the Sciences: Virtues, Techniques and Applications
of Geometric Tilings'
publication_status: inpress
publisher: Springer
publist_id: '3329'
quality_controlled: '1'
status: public
title: Alpha shapes - a survey
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_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: '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'
...