---
OA_place: publisher
OA_type: hybrid
_id: '17962'
abstract:
- lang: eng
text: We examine structure–function relationships in a series of N-phenylbenzamide
(NPBA) derivatives by using computational modeling to identify molecular structures
that exhibit both rectification and good conductance together with experimental
studies of bias-dependent single molecule conductance and rectification behavior
using the scanning tunneling microscopy break-junction technique. From a large
number of computationally screened molecular diode structures, we have identified
NPBA as a promising candidate, relative to the other structures that were screened.
We demonstrate experimentally that conductance and rectification are both enhanced
by functionalization of the NPBA 4-carboxamido-aniline moiety with electron donating
methoxy groups, and are strongly correlated with the energy of the conducting
frontier orbital relative to the Fermi level of the gold leads used in break-junction
experiments.
article_processing_charge: No
article_type: original
author:
- first_name: Christopher
full_name: Koenigsmann, Christopher
last_name: Koenigsmann
- first_name: Wendu
full_name: Ding, Wendu
last_name: Ding
- first_name: Matthieu
full_name: Koepf, Matthieu
last_name: Koepf
- first_name: Arunabh
full_name: Batra, Arunabh
last_name: Batra
- first_name: Latha
full_name: Venkataraman, Latha
id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf
last_name: Venkataraman
orcid: 0000-0002-6957-6089
- first_name: Christian F. A.
full_name: Negre, Christian F. A.
last_name: Negre
- first_name: Gary W.
full_name: Brudvig, Gary W.
last_name: Brudvig
- first_name: Robert H.
full_name: Crabtree, Robert H.
last_name: Crabtree
- first_name: Victor S.
full_name: Batista, Victor S.
last_name: Batista
- first_name: Charles A.
full_name: Schmuttenmaer, Charles A.
last_name: Schmuttenmaer
citation:
ama: Koenigsmann C, Ding W, Koepf M, et al. Structure–function relationships in
single molecule rectification by N-phenylbenzamide derivatives. New Journal
of Chemistry. 2016;40(9):7373-7378. doi:10.1039/c6nj00870d
apa: Koenigsmann, C., Ding, W., Koepf, M., Batra, A., Venkataraman, L., Negre, C.
F. A., … Schmuttenmaer, C. A. (2016). Structure–function relationships in single
molecule rectification by N-phenylbenzamide derivatives. New Journal of Chemistry.
Royal Society of Chemistry. https://doi.org/10.1039/c6nj00870d
chicago: Koenigsmann, Christopher, Wendu Ding, Matthieu Koepf, Arunabh Batra, Latha
Venkataraman, Christian F. A. Negre, Gary W. Brudvig, Robert H. Crabtree, Victor
S. Batista, and Charles A. Schmuttenmaer. “Structure–Function Relationships in
Single Molecule Rectification by N-Phenylbenzamide Derivatives.” New Journal
of Chemistry. Royal Society of Chemistry, 2016. https://doi.org/10.1039/c6nj00870d.
ieee: C. Koenigsmann et al., “Structure–function relationships in single
molecule rectification by N-phenylbenzamide derivatives,” New Journal of Chemistry,
vol. 40, no. 9. Royal Society of Chemistry, pp. 7373–7378, 2016.
ista: Koenigsmann C, Ding W, Koepf M, Batra A, Venkataraman L, Negre CFA, Brudvig
GW, Crabtree RH, Batista VS, Schmuttenmaer CA. 2016. Structure–function relationships
in single molecule rectification by N-phenylbenzamide derivatives. New Journal
of Chemistry. 40(9), 7373–7378.
mla: Koenigsmann, Christopher, et al. “Structure–Function Relationships in Single
Molecule Rectification by N-Phenylbenzamide Derivatives.” New Journal of Chemistry,
vol. 40, no. 9, Royal Society of Chemistry, 2016, pp. 7373–78, doi:10.1039/c6nj00870d.
short: C. Koenigsmann, W. Ding, M. Koepf, A. Batra, L. Venkataraman, C.F.A. Negre,
G.W. Brudvig, R.H. Crabtree, V.S. Batista, C.A. Schmuttenmaer, New Journal of
Chemistry 40 (2016) 7373–7378.
date_created: 2024-09-09T09:36:47Z
date_published: 2016-06-30T00:00:00Z
date_updated: 2024-12-18T09:37:58Z
day: '30'
doi: 10.1039/c6nj00870d
extern: '1'
intvolume: ' 40'
issue: '9'
language:
- iso: eng
month: '06'
oa_version: Published Version
page: 7373-7378
publication: New Journal of Chemistry
publication_identifier:
eissn:
- 1369-9261
issn:
- 1144-0546
publication_status: published
publisher: Royal Society of Chemistry
quality_controlled: '1'
scopus_import: '1'
status: public
title: Structure–function relationships in single molecule rectification by N-phenylbenzamide
derivatives
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/3.0/legalcode
name: Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)
short: CC BY-NC (3.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 40
year: '2016'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '17963'
abstract:
- lang: eng
text: Here we examine the impact of ring conformation on the charge transport characteristics
of cyclic pentasilane structures bound to gold electrodes in single molecule junctions.
We investigate the conductance properties of alkylated cyclopentasilane cis and
trans stereoisomers substituted in the 1,3-position with methylthiomethyl electrode
binding groups using both the scanning tunneling microscope-based break junction
technique and density functional theory based ab initio calculations. In contrast
with the linear ones, these cyclic silanes yield lower conductance values; calculations
reveal that the constrained dihedral geometries occurring within the ring are
suboptimal for σ-orbital delocalization, and therefore, conductance. Theoretical
calculations reproduce the measured conductance trends for both cis and trans
isomers and find several distinct conformations that are likely to form stable
molecular junctions at room temperature. Due to the weakened σ-conjugation in
the molecule, through-space interactions are found to contribute significantly
to the conductance. This manuscript details the vast conformational flexibility
in cyclopentasilanes and the tremendous impact it has on controlling conductance.
article_processing_charge: Yes
article_type: original
author:
- first_name: Haixing
full_name: Li, Haixing
last_name: Li
- first_name: Marc H.
full_name: Garner, Marc H.
last_name: Garner
- first_name: Zhichun
full_name: Shangguan, Zhichun
last_name: Shangguan
- first_name: Qianwen
full_name: Zheng, Qianwen
last_name: Zheng
- first_name: Timothy A.
full_name: Su, Timothy A.
last_name: Su
- first_name: Madhav
full_name: Neupane, Madhav
last_name: Neupane
- first_name: Panpan
full_name: Li, Panpan
last_name: Li
- first_name: Alexandra
full_name: Velian, Alexandra
last_name: Velian
- first_name: Michael L.
full_name: Steigerwald, Michael L.
last_name: Steigerwald
- first_name: Shengxiong
full_name: Xiao, Shengxiong
last_name: Xiao
- first_name: Colin
full_name: Nuckolls, Colin
last_name: Nuckolls
- first_name: Gemma C.
full_name: Solomon, Gemma C.
last_name: Solomon
- first_name: Latha
full_name: Venkataraman, Latha
id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf
last_name: Venkataraman
orcid: 0000-0002-6957-6089
citation:
ama: Li H, Garner MH, Shangguan Z, et al. Conformations of cyclopentasilane stereoisomers
control molecular junction conductance. Chemical Science. 2016;7(9):5657-5662.
doi:10.1039/c6sc01360k
apa: Li, H., Garner, M. H., Shangguan, Z., Zheng, Q., Su, T. A., Neupane, M., …
Venkataraman, L. (2016). Conformations of cyclopentasilane stereoisomers control
molecular junction conductance. Chemical Science. Royal Society of Chemistry.
https://doi.org/10.1039/c6sc01360k
chicago: Li, Haixing, Marc H. Garner, Zhichun Shangguan, Qianwen Zheng, Timothy
A. Su, Madhav Neupane, Panpan Li, et al. “Conformations of Cyclopentasilane Stereoisomers
Control Molecular Junction Conductance.” Chemical Science. Royal Society
of Chemistry, 2016. https://doi.org/10.1039/c6sc01360k.
ieee: H. Li et al., “Conformations of cyclopentasilane stereoisomers control
molecular junction conductance,” Chemical Science, vol. 7, no. 9. Royal
Society of Chemistry, pp. 5657–5662, 2016.
ista: Li H, Garner MH, Shangguan Z, Zheng Q, Su TA, Neupane M, Li P, Velian A, Steigerwald
ML, Xiao S, Nuckolls C, Solomon GC, Venkataraman L. 2016. Conformations of cyclopentasilane
stereoisomers control molecular junction conductance. Chemical Science. 7(9),
5657–5662.
mla: Li, Haixing, et al. “Conformations of Cyclopentasilane Stereoisomers Control
Molecular Junction Conductance.” Chemical Science, vol. 7, no. 9, Royal
Society of Chemistry, 2016, pp. 5657–62, doi:10.1039/c6sc01360k.
short: H. Li, M.H. Garner, Z. Shangguan, Q. Zheng, T.A. Su, M. Neupane, P. Li, A.
Velian, M.L. Steigerwald, S. Xiao, C. Nuckolls, G.C. Solomon, L. Venkataraman,
Chemical Science 7 (2016) 5657–5662.
date_created: 2024-09-09T09:37:59Z
date_published: 2016-05-30T00:00:00Z
date_updated: 2024-12-18T09:51:40Z
day: '30'
doi: 10.1039/c6sc01360k
extern: '1'
intvolume: ' 7'
issue: '9'
language:
- iso: eng
month: '05'
oa_version: Published Version
page: 5657-5662
publication: Chemical Science
publication_identifier:
eissn:
- 2041-6539
issn:
- 2041-6520
publication_status: published
publisher: Royal Society of Chemistry
quality_controlled: '1'
scopus_import: '1'
status: public
title: Conformations of cyclopentasilane stereoisomers control molecular junction
conductance
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/3.0/legalcode
name: Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)
short: CC BY-NC (3.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2016'
...
---
OA_place: publisher
OA_type: hybrid
_id: '17964'
abstract:
- lang: eng
text: Charge transfer rates at metal/organic interfaces affect the efficiencies
of devices for organic based electronics and photovoltaics. A quantitative study
of electron transfer rates, which take place on the femtosecond timescale, is
often difficult, especially since in most systems the molecular adsorption geometry
is unknown. Here, we use X-ray resonant photoemission spectroscopy to measure
ultrafast charge transfer rates across pyridine/Au(111) interfaces while also
controlling the molecular orientation on the metal. We demonstrate that a bi-directional
charge transfer across the molecule/metal interface is enabled upon creation of
a core-exciton on the molecule with a rate that has a strong dependence on the
molecular adsorption angle. Through density functional theory calculations, we
show that the alignment of molecular levels relative to the metal Fermi level
is dramatically altered when a core-hole is created on the molecule, allowing
the lowest unoccupied molecular orbital to fall partially below the metal Fermi
level. We also calculate charge transfer rates as a function of molecular adsorption
geometry and find a trend that agrees with the experiment. These findings thus
give insight into the charge transfer dynamics of a photo-excited molecule on
a metal surface.
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Dean
full_name: Cvetko, Dean
last_name: Cvetko
- first_name: Guido
full_name: Fratesi, Guido
last_name: Fratesi
- first_name: Gregor
full_name: Kladnik, Gregor
last_name: Kladnik
- first_name: Albano
full_name: Cossaro, Albano
last_name: Cossaro
- first_name: Gian Paolo
full_name: Brivio, Gian Paolo
last_name: Brivio
- first_name: Latha
full_name: Venkataraman, Latha
id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf
last_name: Venkataraman
orcid: 0000-0002-6957-6089
- first_name: Alberto
full_name: Morgante, Alberto
last_name: Morgante
citation:
ama: Cvetko D, Fratesi G, Kladnik G, et al. Ultrafast electron injection into photo-excited
organic molecules. Physical Chemistry Chemical Physics. 2016;18(32):22140-22145.
doi:10.1039/c6cp04099c
apa: Cvetko, D., Fratesi, G., Kladnik, G., Cossaro, A., Brivio, G. P., Venkataraman,
L., & Morgante, A. (2016). Ultrafast electron injection into photo-excited
organic molecules. Physical Chemistry Chemical Physics. Royal Society of
Chemistry. https://doi.org/10.1039/c6cp04099c
chicago: Cvetko, Dean, Guido Fratesi, Gregor Kladnik, Albano Cossaro, Gian Paolo
Brivio, Latha Venkataraman, and Alberto Morgante. “Ultrafast Electron Injection
into Photo-Excited Organic Molecules.” Physical Chemistry Chemical Physics.
Royal Society of Chemistry, 2016. https://doi.org/10.1039/c6cp04099c.
ieee: D. Cvetko et al., “Ultrafast electron injection into photo-excited
organic molecules,” Physical Chemistry Chemical Physics, vol. 18, no. 32.
Royal Society of Chemistry, pp. 22140–22145, 2016.
ista: Cvetko D, Fratesi G, Kladnik G, Cossaro A, Brivio GP, Venkataraman L, Morgante
A. 2016. Ultrafast electron injection into photo-excited organic molecules. Physical
Chemistry Chemical Physics. 18(32), 22140–22145.
mla: Cvetko, Dean, et al. “Ultrafast Electron Injection into Photo-Excited Organic
Molecules.” Physical Chemistry Chemical Physics, vol. 18, no. 32, Royal
Society of Chemistry, 2016, pp. 22140–45, doi:10.1039/c6cp04099c.
short: D. Cvetko, G. Fratesi, G. Kladnik, A. Cossaro, G.P. Brivio, L. Venkataraman,
A. Morgante, Physical Chemistry Chemical Physics 18 (2016) 22140–22145.
date_created: 2024-09-09T09:39:29Z
date_published: 2016-07-14T00:00:00Z
date_updated: 2024-12-18T10:17:35Z
day: '14'
doi: 10.1039/c6cp04099c
extern: '1'
external_id:
pmid:
- '27444572'
intvolume: ' 18'
issue: '32'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1039/C6CP04099C
month: '07'
oa: 1
oa_version: Published Version
page: 22140-22145
pmid: 1
publication: Physical Chemistry Chemical Physics
publication_identifier:
eissn:
- 1463-9084
issn:
- 1463-9076
publication_status: published
publisher: Royal Society of Chemistry
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ultrafast electron injection into photo-excited organic molecules
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2016'
...
---
OA_type: closed access
_id: '18328'
abstract:
- lang: eng
text: We present a novel sparse modeling approach to non-rigid shape matching using
only the ability to detect repeatable regions. As the input to our algorithm,
we are given only two sets of regions in two shapes; no descriptors are provided
so the correspondence between the regions is not know, nor do we know how many
regions correspond in the two shapes. We show that even with such scarce information,
it is possible to establish very accurate correspondence between the shapes by
using methods from the field of sparse modeling, being this, the first non-trivial
use of sparse models in shape correspondence. We formulate the problem of permuted
sparse coding, in which we solve simultaneously for an unknown permutation ordering
the regions on two shapes and for an unknown correspondence in functional representation.
We also propose a robust variant capable of handling incomplete matches. Numerically,
the problem is solved efficiently by alternating the solution of a linear assignment
and a sparse coding problem. The proposed methods are evaluated qualitatively
and quantitatively on standard benchmarks containing both synthetic and scanned
objects.
alternative_title:
- Mathematics and Visualization
article_processing_charge: No
author:
- first_name: Jonathan
full_name: Pokrass, Jonathan
last_name: Pokrass
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Pablo
full_name: Sprechmann, Pablo
last_name: Sprechmann
- first_name: Guillermo
full_name: Sapiro, Guillermo
last_name: Sapiro
citation:
ama: 'Pokrass J, Bronstein AM, Bronstein MM, Sprechmann P, Sapiro G. Sparse Models
for Intrinsic Shape Correspondence. In: Breuß M, Bruckstein A, Maragos P, Wuhrer
S, eds. Perspectives in Shape Analysis. 1st ed. Cham: Springer International
Publishing; 2016:211-230. doi:10.1007/978-3-319-24726-7_10'
apa: 'Pokrass, J., Bronstein, A. M., Bronstein, M. M., Sprechmann, P., & Sapiro,
G. (2016). Sparse Models for Intrinsic Shape Correspondence. In M. Breuß, A. Bruckstein,
P. Maragos, & S. Wuhrer (Eds.), Perspectives in Shape Analysis (1st
ed., pp. 211–230). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-24726-7_10'
chicago: 'Pokrass, Jonathan, Alex M. Bronstein, Michael M. Bronstein, Pablo Sprechmann,
and Guillermo Sapiro. “Sparse Models for Intrinsic Shape Correspondence.” In Perspectives
in Shape Analysis, edited by Michael Breuß, Alfred Bruckstein, Petros Maragos,
and Stefanie Wuhrer, 1st ed., 211–30. Cham: Springer International Publishing,
2016. https://doi.org/10.1007/978-3-319-24726-7_10.'
ieee: 'J. Pokrass, A. M. Bronstein, M. M. Bronstein, P. Sprechmann, and G. Sapiro,
“Sparse Models for Intrinsic Shape Correspondence,” in Perspectives in Shape
Analysis, 1st ed., M. Breuß, A. Bruckstein, P. Maragos, and S. Wuhrer, Eds.
Cham: Springer International Publishing, 2016, pp. 211–230.'
ista: 'Pokrass J, Bronstein AM, Bronstein MM, Sprechmann P, Sapiro G. 2016.Sparse
Models for Intrinsic Shape Correspondence. In: Perspectives in Shape Analysis.
Mathematics and Visualization, , 211–230.'
mla: Pokrass, Jonathan, et al. “Sparse Models for Intrinsic Shape Correspondence.”
Perspectives in Shape Analysis, edited by Michael Breuß et al., 1st ed.,
Springer International Publishing, 2016, pp. 211–30, doi:10.1007/978-3-319-24726-7_10.
short: J. Pokrass, A.M. Bronstein, M.M. Bronstein, P. Sprechmann, G. Sapiro, in:,
M. Breuß, A. Bruckstein, P. Maragos, S. Wuhrer (Eds.), Perspectives in Shape Analysis,
1st ed., Springer International Publishing, Cham, 2016, pp. 211–230.
date_created: 2024-10-15T11:20:53Z
date_published: 2016-10-01T00:00:00Z
date_updated: 2024-10-22T08:17:06Z
day: '01'
doi: 10.1007/978-3-319-24726-7_10
edition: '1'
editor:
- first_name: Michael
full_name: Breuß, Michael
last_name: Breuß
- first_name: Alfred
full_name: Bruckstein, Alfred
last_name: Bruckstein
- first_name: Petros
full_name: Maragos, Petros
last_name: Maragos
- first_name: Stefanie
full_name: Wuhrer, Stefanie
last_name: Wuhrer
extern: '1'
language:
- iso: eng
month: '10'
oa_version: None
page: 211-230
place: Cham
publication: Perspectives in Shape Analysis
publication_identifier:
eisbn:
- '9783319247267'
eissn:
- 2197-666X
isbn:
- '9783319247243'
issn:
- 1612-3786
publication_status: published
publisher: Springer International Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sparse Models for Intrinsic Shape Correspondence
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '1833'
abstract:
- lang: eng
text: 'Relational models for contingency tables are generalizations of log-linear
models, allowing effects associated with arbitrary subsets of cells in the table,
and not necessarily containing the overall effect, that is, a common parameter
in every cell. Similarly to log-linear models, relational models can be extended
to non-negative distributions, but the extension requires more complex methods.
An extended relational model is defined as an algebraic variety, and it turns
out to be the closure of the original model with respect to the Bregman divergence.
In the extended relational model, the MLE of the cell parameters always exists
and is unique, but some of its properties may be different from those of the MLE
under log-linear models. The MLE can be computed using a generalized iterative
scaling procedure based on Bregman projections. '
article_processing_charge: No
arxiv: 1
author:
- first_name: Anna
full_name: Klimova, Anna
id: 31934120-F248-11E8-B48F-1D18A9856A87
last_name: Klimova
- first_name: Tamás
full_name: Rudas, Tamás
last_name: Rudas
citation:
ama: Klimova A, Rudas T. On the closure of relational models. Journal of Multivariate
Analysis. 2016;143:440-452. doi:10.1016/j.jmva.2015.10.005
apa: Klimova, A., & Rudas, T. (2016). On the closure of relational models. Journal
of Multivariate Analysis. Elsevier. https://doi.org/10.1016/j.jmva.2015.10.005
chicago: Klimova, Anna, and Tamás Rudas. “On the Closure of Relational Models.”
Journal of Multivariate Analysis. Elsevier, 2016. https://doi.org/10.1016/j.jmva.2015.10.005.
ieee: A. Klimova and T. Rudas, “On the closure of relational models,” Journal
of Multivariate Analysis, vol. 143. Elsevier, pp. 440–452, 2016.
ista: Klimova A, Rudas T. 2016. On the closure of relational models. Journal of
Multivariate Analysis. 143, 440–452.
mla: Klimova, Anna, and Tamás Rudas. “On the Closure of Relational Models.” Journal
of Multivariate Analysis, vol. 143, Elsevier, 2016, pp. 440–52, doi:10.1016/j.jmva.2015.10.005.
short: A. Klimova, T. Rudas, Journal of Multivariate Analysis 143 (2016) 440–452.
corr_author: '1'
date_created: 2018-12-11T11:54:15Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2025-09-18T10:47:32Z
day: '01'
department:
- _id: CaUh
doi: 10.1016/j.jmva.2015.10.005
external_id:
arxiv:
- '1501.00600'
isi:
- '000366885300029'
intvolume: ' 143'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1501.00600
month: '01'
oa: 1
oa_version: Preprint
page: 440 - 452
publication: Journal of Multivariate Analysis
publication_status: published
publisher: Elsevier
publist_id: '5270'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the closure of relational models
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 143
year: '2016'
...
---
_id: '18361'
abstract:
- lang: eng
text: 3D models of humans are commonly used within computer graphics and vision,
and so the ability to distinguish between body shapes is an important shape retrieval
problem. We extend our recent paper which provided a benchmark for testing non-rigid
3D shape retrieval algorithms on 3D human models. This benchmark provided a far
stricter challenge than previous shape benchmarks. We have added 145 new models
for use as a separate training set, in order to standardise the training data
used and provide a fairer comparison. We have also included experiments with the
FAUST dataset of human scans. All participants of the previous benchmark study
have taken part in the new tests reported here, many providing updated results
using the new data. In addition, further participants have also taken part, and
we provide extra analysis of the retrieval results. A total of 25 different shape
retrieval methods are compared.
article_processing_charge: No
author:
- first_name: D.
full_name: Pickup, D.
last_name: Pickup
- first_name: X.
full_name: Sun, X.
last_name: Sun
- first_name: P. L.
full_name: Rosin, P. L.
last_name: Rosin
- first_name: R. R.
full_name: Martin, R. R.
last_name: Martin
- first_name: Z.
full_name: Cheng, Z.
last_name: Cheng
- first_name: Z.
full_name: Lian, Z.
last_name: Lian
- first_name: M.
full_name: Aono, M.
last_name: Aono
- first_name: A. Ben
full_name: Hamza, A. Ben
last_name: Hamza
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: M.
full_name: Bronstein, M.
last_name: Bronstein
- first_name: S.
full_name: Bu, S.
last_name: Bu
- first_name: U.
full_name: Castellani, U.
last_name: Castellani
- first_name: S.
full_name: Cheng, S.
last_name: Cheng
- first_name: V.
full_name: Garro, V.
last_name: Garro
- first_name: A.
full_name: Giachetti, A.
last_name: Giachetti
- first_name: A.
full_name: Godil, A.
last_name: Godil
- first_name: L.
full_name: Isaia, L.
last_name: Isaia
- first_name: J.
full_name: Han, J.
last_name: Han
- first_name: H.
full_name: Johan, H.
last_name: Johan
- first_name: L.
full_name: Lai, L.
last_name: Lai
- first_name: B.
full_name: Li, B.
last_name: Li
- first_name: C.
full_name: Li, C.
last_name: Li
- first_name: H.
full_name: Li, H.
last_name: Li
- first_name: R.
full_name: Litman, R.
last_name: Litman
- first_name: X.
full_name: Liu, X.
last_name: Liu
- first_name: Z.
full_name: Liu, Z.
last_name: Liu
- first_name: Y.
full_name: Lu, Y.
last_name: Lu
- first_name: L.
full_name: Sun, L.
last_name: Sun
- first_name: G.
full_name: Tam, G.
last_name: Tam
- first_name: A.
full_name: Tatsuma, A.
last_name: Tatsuma
- first_name: J.
full_name: Ye, J.
last_name: Ye
citation:
ama: Pickup D, Sun X, Rosin PL, et al. Shape retrieval of non-rigid 3D human models.
International Journal of Computer Vision. 2016;120(2):169-193. doi:10.1007/s11263-016-0903-8
apa: Pickup, D., Sun, X., Rosin, P. L., Martin, R. R., Cheng, Z., Lian, Z., … Ye,
J. (2016). Shape retrieval of non-rigid 3D human models. International Journal
of Computer Vision. Springer Nature. https://doi.org/10.1007/s11263-016-0903-8
chicago: Pickup, D., X. Sun, P. L. Rosin, R. R. Martin, Z. Cheng, Z. Lian, M. Aono,
et al. “Shape Retrieval of Non-Rigid 3D Human Models.” International Journal
of Computer Vision. Springer Nature, 2016. https://doi.org/10.1007/s11263-016-0903-8.
ieee: D. Pickup et al., “Shape retrieval of non-rigid 3D human models,” International
Journal of Computer Vision, vol. 120, no. 2. Springer Nature, pp. 169–193,
2016.
ista: Pickup D, Sun X, Rosin PL, Martin RR, Cheng Z, Lian Z, Aono M, Hamza AB, Bronstein
AM, Bronstein M, Bu S, Castellani U, Cheng S, Garro V, Giachetti A, Godil A, Isaia
L, Han J, Johan H, Lai L, Li B, Li C, Li H, Litman R, Liu X, Liu Z, Lu Y, Sun
L, Tam G, Tatsuma A, Ye J. 2016. Shape retrieval of non-rigid 3D human models.
International Journal of Computer Vision. 120(2), 169–193.
mla: Pickup, D., et al. “Shape Retrieval of Non-Rigid 3D Human Models.” International
Journal of Computer Vision, vol. 120, no. 2, Springer Nature, 2016, pp. 169–93,
doi:10.1007/s11263-016-0903-8.
short: D. Pickup, X. Sun, P.L. Rosin, R.R. Martin, Z. Cheng, Z. Lian, M. Aono, A.B.
Hamza, A.M. Bronstein, M. Bronstein, S. Bu, U. Castellani, S. Cheng, V. Garro,
A. Giachetti, A. Godil, L. Isaia, J. Han, H. Johan, L. Lai, B. Li, C. Li, H. Li,
R. Litman, X. Liu, Z. Liu, Y. Lu, L. Sun, G. Tam, A. Tatsuma, J. Ye, International
Journal of Computer Vision 120 (2016) 169–193.
date_created: 2024-10-15T11:20:54Z
date_published: 2016-11-01T00:00:00Z
date_updated: 2024-12-18T15:13:03Z
day: '01'
doi: 10.1007/s11263-016-0903-8
extern: '1'
intvolume: ' 120'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/s11263-016-0903-8
month: '11'
oa: 1
oa_version: Published Version
page: 169-193
publication: International Journal of Computer Vision
publication_identifier:
eissn:
- 1573-1405
issn:
- 0920-5691
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Shape retrieval of non-rigid 3D human models
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 120
year: '2016'
...
---
_id: '18374'
abstract:
- lang: eng
text: The L 1 norm has been tremendously popular in signal and image processing
in the past two decades due to its sparsity-promoting properties. More recently,
its generalization to non-Euclidean domains has been found useful in shape analysis
applications. For example, in conjunction with the minimization of the Dirichlet
energy, it was shown to produce a compactly supported quasi-harmonic orthonormal
basis, dubbed as compressed manifold modes [14]. The continuous L 1 norm on the
manifold is often replaced by the vector ℓ 1 norm applied to sampled functions.
We show that such an approach is incorrect in the sense that it does not consistently
discretize the continuous norm and warn against its sensitivity to the specific
sampling. We propose two alternative discretizations resulting in an iteratively-reweighed
ℓ 2 norm. We demonstrate the proposed strategy on the compressed modes problem,
which reduces to a sequence of simple eigendecomposition problems not requiring
non-convex optimization on Stiefel manifolds and producing more stable and accurate
results.
article_number: '7785118'
article_processing_charge: No
arxiv: 1
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Yoni
full_name: Choukroun, Yoni
last_name: Choukroun
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
- first_name: Matan
full_name: Sela, Matan
last_name: Sela
citation:
ama: 'Bronstein AM, Choukroun Y, Kimmel R, Sela M. Consistent discretization and
minimization of the L1 norm on manifolds. In: 2016 Fourth International Conference
on 3D Vision (3DV). IEEE; 2016. doi:10.1109/3dv.2016.53'
apa: 'Bronstein, A. M., Choukroun, Y., Kimmel, R., & Sela, M. (2016). Consistent
discretization and minimization of the L1 norm on manifolds. In 2016 Fourth
International Conference on 3D Vision (3DV). Stanford, CA, United States:
IEEE. https://doi.org/10.1109/3dv.2016.53'
chicago: Bronstein, Alex M., Yoni Choukroun, Ron Kimmel, and Matan Sela. “Consistent
Discretization and Minimization of the L1 Norm on Manifolds.” In 2016 Fourth
International Conference on 3D Vision (3DV). IEEE, 2016. https://doi.org/10.1109/3dv.2016.53.
ieee: A. M. Bronstein, Y. Choukroun, R. Kimmel, and M. Sela, “Consistent discretization
and minimization of the L1 norm on manifolds,” in 2016 Fourth International
Conference on 3D Vision (3DV), Stanford, CA, United States, 2016.
ista: Bronstein AM, Choukroun Y, Kimmel R, Sela M. 2016. Consistent discretization
and minimization of the L1 norm on manifolds. 2016 Fourth International Conference
on 3D Vision (3DV). 4th International Conference on 3D Vision, 7785118.
mla: Bronstein, Alex M., et al. “Consistent Discretization and Minimization of the
L1 Norm on Manifolds.” 2016 Fourth International Conference on 3D Vision (3DV),
7785118, IEEE, 2016, doi:10.1109/3dv.2016.53.
short: A.M. Bronstein, Y. Choukroun, R. Kimmel, M. Sela, in:, 2016 Fourth International
Conference on 3D Vision (3DV), IEEE, 2016.
conference:
end_date: 2016-10-28
location: ' Stanford, CA, United States'
name: 4th International Conference on 3D Vision
start_date: 2016-10-25
date_created: 2024-10-15T11:20:54Z
date_published: 2016-12-19T00:00:00Z
date_updated: 2024-12-05T14:19:34Z
day: '19'
doi: 10.1109/3dv.2016.53
extern: '1'
external_id:
arxiv:
- '1609.05434'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1609.05434
month: '12'
oa: 1
oa_version: Preprint
publication: 2016 Fourth International Conference on 3D Vision (3DV)
publication_identifier:
isbn:
- '9781509054084'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Consistent discretization and minimization of the L1 norm on manifolds
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '18375'
abstract:
- lang: eng
text: We present a method to approximate pairwise distance on a graph, having an
amortized sub-linear complexity in its size. The proposed method follows the so
called heat method due to Crane et al. The only additional input are the values
of the eigenfunctions of the graph Laplacian at a subset of the vertices. Using
these values we estimate a random walk from the source points, and normalize the
result into a unit gradient function. The eigenfunctions are then used to synthesize
distance values abiding by these constraints at desired locations. We show that
this method works in practice on different types of inputs ranging from triangular
meshes to general graphs. We also demonstrate that the resulting approximate distance
is accurate enough to be used as the input to a recent method for intrinsic shape
correspondence computation.
article_number: '7785125'
article_processing_charge: No
arxiv: 1
author:
- first_name: Roee
full_name: Litman, Roee
last_name: Litman
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
citation:
ama: 'Litman R, Bronstein AM. SpectroMeter: Amortized sublinear spectral approximation
of distance on graphs. In: 2016 Fourth International Conference on 3D Vision
(3DV). IEEE; 2016. doi:10.1109/3dv.2016.60'
apa: 'Litman, R., & Bronstein, A. M. (2016). SpectroMeter: Amortized sublinear
spectral approximation of distance on graphs. In 2016 Fourth International
Conference on 3D Vision (3DV). Stanford, CA, United States: IEEE. https://doi.org/10.1109/3dv.2016.60'
chicago: 'Litman, Roee, and Alex M. Bronstein. “SpectroMeter: Amortized Sublinear
Spectral Approximation of Distance on Graphs.” In 2016 Fourth International
Conference on 3D Vision (3DV). IEEE, 2016. https://doi.org/10.1109/3dv.2016.60.'
ieee: 'R. Litman and A. M. Bronstein, “SpectroMeter: Amortized sublinear spectral
approximation of distance on graphs,” in 2016 Fourth International Conference
on 3D Vision (3DV), Stanford, CA, United States, 2016.'
ista: 'Litman R, Bronstein AM. 2016. SpectroMeter: Amortized sublinear spectral
approximation of distance on graphs. 2016 Fourth International Conference on 3D
Vision (3DV). 4th International Conference on 3D Vision, 7785125.'
mla: 'Litman, Roee, and Alex M. Bronstein. “SpectroMeter: Amortized Sublinear Spectral
Approximation of Distance on Graphs.” 2016 Fourth International Conference
on 3D Vision (3DV), 7785125, IEEE, 2016, doi:10.1109/3dv.2016.60.'
short: R. Litman, A.M. Bronstein, in:, 2016 Fourth International Conference on 3D
Vision (3DV), IEEE, 2016.
conference:
end_date: 2016-10-28
location: Stanford, CA, United States
name: 4th International Conference on 3D Vision
start_date: 2016-10-25
date_created: 2024-10-15T11:20:54Z
date_published: 2016-12-19T00:00:00Z
date_updated: 2024-12-05T14:17:16Z
day: '19'
doi: 10.1109/3dv.2016.60
extern: '1'
external_id:
arxiv:
- '1609.05715'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1609.05715
month: '12'
oa: 1
oa_version: Preprint
publication: 2016 Fourth International Conference on 3D Vision (3DV)
publication_identifier:
isbn:
- '9781509054084'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'SpectroMeter: Amortized sublinear spectral approximation of distance on graphs'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '18388'
abstract:
- lang: eng
text: The pursuit of smaller pixel sizes at ever increasing resolution in digital
image sensors is mainly driven by the stringent price and form-factor requirements
of sensors and optics in the cellular phone market. Recently, Eric Fossum proposed
a novel concept of an image sensor with dense sub-diffraction limit one-bit pixels
(jots), which can be considered a digital emulation of silver halide photographic
film. This idea has been recently embodied as the EPFL Gigavision camera. A major
bottleneck in the design of such sensors is the image reconstruction process,
producing a continuous high dynamic range image from oversampled binary measurements.
The extreme quantization of the Poisson statistics is incompatible with the assumptions
of most standard image processing and enhancement frameworks. The recently proposed
maximum-likelihood (ML) approach addresses this difficulty, but suffers from image
artefacts and has impractically high computational complexity. In this work, we
study a variant of a sensor with binary threshold pixels and propose a reconstruction
algorithm combining an ML data fitting term with a sparse synthesis prior. We
also show an efficient hardware-friendly real-time approximation of this inverse
operator. Promising results are shown on synthetic data as well as on HDR data
emulated using multiple exposures of a regular CMOS sensor.
article_number: '7492874'
article_processing_charge: No
arxiv: 1
author:
- first_name: Tal
full_name: Remez, Tal
last_name: Remez
- first_name: Or
full_name: Litany, Or
last_name: Litany
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
citation:
ama: 'Remez T, Litany O, Bronstein AM. A picture is worth a billion bits: Real-time
image reconstruction from dense binary threshold pixels. In: 2016 IEEE International
Conference on Computational Photography (ICCP). IEEE; 2016. doi:10.1109/iccphot.2016.7492874'
apa: 'Remez, T., Litany, O., & Bronstein, A. M. (2016). A picture is worth a
billion bits: Real-time image reconstruction from dense binary threshold pixels.
In 2016 IEEE International Conference on Computational Photography (ICCP).
Evanston, IL, United States: IEEE. https://doi.org/10.1109/iccphot.2016.7492874'
chicago: 'Remez, Tal, Or Litany, and Alex M. Bronstein. “A Picture Is Worth a Billion
Bits: Real-Time Image Reconstruction from Dense Binary Threshold Pixels.” In 2016
IEEE International Conference on Computational Photography (ICCP). IEEE, 2016.
https://doi.org/10.1109/iccphot.2016.7492874.'
ieee: 'T. Remez, O. Litany, and A. M. Bronstein, “A picture is worth a billion bits:
Real-time image reconstruction from dense binary threshold pixels,” in 2016
IEEE International Conference on Computational Photography (ICCP), Evanston,
IL, United States, 2016.'
ista: 'Remez T, Litany O, Bronstein AM. 2016. A picture is worth a billion bits:
Real-time image reconstruction from dense binary threshold pixels. 2016 IEEE International
Conference on Computational Photography (ICCP). IEEE International Conference
on Computational Photography, 7492874.'
mla: 'Remez, Tal, et al. “A Picture Is Worth a Billion Bits: Real-Time Image Reconstruction
from Dense Binary Threshold Pixels.” 2016 IEEE International Conference on
Computational Photography (ICCP), 7492874, IEEE, 2016, doi:10.1109/iccphot.2016.7492874.'
short: T. Remez, O. Litany, A.M. Bronstein, in:, 2016 IEEE International Conference
on Computational Photography (ICCP), IEEE, 2016.
conference:
end_date: 2016-05-15
location: Evanston, IL, United States
name: IEEE International Conference on Computational Photography
start_date: 2016-05-13
date_created: 2024-10-15T11:20:54Z
date_published: 2016-06-16T00:00:00Z
date_updated: 2024-12-05T14:16:11Z
day: '16'
doi: 10.1109/iccphot.2016.7492874
extern: '1'
external_id:
arxiv:
- '1510.04601'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1510.04601
month: '06'
oa: 1
oa_version: Preprint
publication: 2016 IEEE International Conference on Computational Photography (ICCP)
publication_identifier:
eisbn:
- '9781467386234'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'A picture is worth a billion bits: Real-time image reconstruction from dense
binary threshold pixels'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '18419'
abstract:
- lang: eng
text: Three important properties of a classification machinery are i) the system
preserves the core information of the input data; ii) the training examples convey
information about unseen data; and iii) the system is able to treat differently
points from different classes. In this paper, we show that these fundamental properties
are satisfied by the architecture of deep neural networks. We formally prove that
these networks with random Gaussian weights perform a distance-preserving embedding
of the data, with a special treatment for in-class and out-of-class data. Similar
points at the input of the network are likely to have a similar output. The theoretical
analysis of deep networks here presented exploits tools used in the compressed
sensing and dictionary learning literature, thereby making a formal connection
between these important topics. The derived results allow drawing conclusions
on the metric learning properties of the network and their relation to its structure,
as well as providing bounds on the required size of the training set such that
the training examples would represent faithfully the unseen data. The results
are validated with state-of-the-art trained networks.
article_processing_charge: No
arxiv: 1
author:
- first_name: Raja
full_name: Giryes, Raja
last_name: Giryes
- first_name: Guillermo
full_name: Sapiro, Guillermo
last_name: Sapiro
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
citation:
ama: 'Giryes R, Sapiro G, Bronstein AM. Deep neural networks with random Gaussian
weights: A universal classification strategy? IEEE Transactions on Signal Processing.
2016;64(13):3444-3457. doi:10.1109/tsp.2016.2546221'
apa: 'Giryes, R., Sapiro, G., & Bronstein, A. M. (2016). Deep neural networks
with random Gaussian weights: A universal classification strategy? IEEE Transactions
on Signal Processing. IEEE. https://doi.org/10.1109/tsp.2016.2546221'
chicago: 'Giryes, Raja, Guillermo Sapiro, and Alex M. Bronstein. “Deep Neural Networks
with Random Gaussian Weights: A Universal Classification Strategy?” IEEE Transactions
on Signal Processing. IEEE, 2016. https://doi.org/10.1109/tsp.2016.2546221.'
ieee: 'R. Giryes, G. Sapiro, and A. M. Bronstein, “Deep neural networks with random
Gaussian weights: A universal classification strategy?,” IEEE Transactions
on Signal Processing, vol. 64, no. 13. IEEE, pp. 3444–3457, 2016.'
ista: 'Giryes R, Sapiro G, Bronstein AM. 2016. Deep neural networks with random
Gaussian weights: A universal classification strategy? IEEE Transactions on Signal
Processing. 64(13), 3444–3457.'
mla: 'Giryes, Raja, et al. “Deep Neural Networks with Random Gaussian Weights: A
Universal Classification Strategy?” IEEE Transactions on Signal Processing,
vol. 64, no. 13, IEEE, 2016, pp. 3444–57, doi:10.1109/tsp.2016.2546221.'
short: R. Giryes, G. Sapiro, A.M. Bronstein, IEEE Transactions on Signal Processing
64 (2016) 3444–3457.
date_created: 2024-10-15T11:20:55Z
date_published: 2016-07-01T00:00:00Z
date_updated: 2024-12-18T11:49:18Z
day: '01'
doi: 10.1109/tsp.2016.2546221
extern: '1'
external_id:
arxiv:
- '1504.08291'
intvolume: ' 64'
issue: '13'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1504.08291
month: '07'
oa: 1
oa_version: Preprint
page: 3444-3457
publication: IEEE Transactions on Signal Processing
publication_identifier:
eissn:
- 1941-0476
issn:
- 1053-587X
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1109/TSP.2019.2961228
scopus_import: '1'
status: public
title: 'Deep neural networks with random Gaussian weights: A universal classification
strategy?'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 64
year: '2016'
...
---
_id: '18426'
abstract:
- lang: eng
text: Shape correspondence is a fundamental problem in computer graphics and vision,
with applications in various problems including animation, texture mapping, robotic
vision, medical imaging, archaeology and many more. In settings where the shapes
are allowed to undergo non-rigid deformations and only partial views are available,
the problem becomes very challenging. To this end, we present a non-rigid multi-part
shape matching algorithm. We assume to be given a reference shape and its multiple
parts undergoing a non-rigid deformation. Each of these query parts can be additionally
contaminated by clutter, may overlap with other parts, and there might be missing
parts or redundant ones. Our method simultaneously solves for the segmentation
of the reference model, and for a dense correspondence to (subsets of) the parts.
Experimental results on synthetic as well as real scans demonstrate the effectiveness
of our method in dealing with this challenging matching scenario.
article_processing_charge: No
author:
- first_name: O.
full_name: Litany, O.
last_name: Litany
- first_name: E.
full_name: Rodolà, E.
last_name: Rodolà
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: M. M.
full_name: Bronstein, M. M.
last_name: Bronstein
- first_name: D.
full_name: Cremers, D.
last_name: Cremers
citation:
ama: Litany O, Rodolà E, Bronstein AM, Bronstein MM, Cremers D. Non‐rigid puzzles.
Computer Graphics Forum. 2016;35(5):135-143. doi:10.1111/cgf.12970
apa: Litany, O., Rodolà, E., Bronstein, A. M., Bronstein, M. M., & Cremers,
D. (2016). Non‐rigid puzzles. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.12970
chicago: Litany, O., E. Rodolà, Alex M. Bronstein, M. M. Bronstein, and D. Cremers.
“Non‐rigid Puzzles.” Computer Graphics Forum. Wiley, 2016. https://doi.org/10.1111/cgf.12970.
ieee: O. Litany, E. Rodolà, A. M. Bronstein, M. M. Bronstein, and D. Cremers, “Non‐rigid
puzzles,” Computer Graphics Forum, vol. 35, no. 5. Wiley, pp. 135–143,
2016.
ista: Litany O, Rodolà E, Bronstein AM, Bronstein MM, Cremers D. 2016. Non‐rigid
puzzles. Computer Graphics Forum. 35(5), 135–143.
mla: Litany, O., et al. “Non‐rigid Puzzles.” Computer Graphics Forum, vol.
35, no. 5, Wiley, 2016, pp. 135–43, doi:10.1111/cgf.12970.
short: O. Litany, E. Rodolà, A.M. Bronstein, M.M. Bronstein, D. Cremers, Computer
Graphics Forum 35 (2016) 135–143.
date_created: 2024-10-15T11:20:55Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2024-12-19T14:29:56Z
day: '01'
doi: 10.1111/cgf.12970
extern: '1'
intvolume: ' 35'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2011.13076
month: '08'
oa: 1
oa_version: Preprint
page: 135-143
publication: Computer Graphics Forum
publication_identifier:
eissn:
- 1467-8659
issn:
- 0167-7055
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Non‐rigid puzzles
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2016'
...
---
_id: '18430'
abstract:
- lang: eng
text: Sparse models in dictionary learning have been successfully applied in a wide
variety of machine learning and computer vision problems, and as a result have
recently attracted increased research interest. Another interesting related problem
based on linear equality constraints, namely the sparse null space (SNS) problem,
first appeared in 1986 and has since inspired results on sparse basis pursuit.
In this paper, we investigate the relation between the SNS problem and the analysis
dictionary learning (ADL) problem, and show that the SNS problem plays a central
role, and may be utilized to solve dictionary learning problems. Moreover, we
propose an efficient algorithm of sparse null space basis pursuit (SNS-BP) and
extend it to a solution of ADL. Experimental results on numerical synthetic data
and real-world data are further presented to validate the performance of our method.
article_processing_charge: No
author:
- first_name: Xiao
full_name: Bian, Xiao
last_name: Bian
- first_name: Hamid
full_name: Krim, Hamid
last_name: Krim
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Liyi
full_name: Dai, Liyi
last_name: Dai
citation:
ama: 'Bian X, Krim H, Bronstein AM, Dai L. Sparsity and nullity: Paradigms for analysis
dictionary learning. SIAM Journal on Imaging Sciences. 2016;9(3):1107-1126.
doi:10.1137/15m1030376'
apa: 'Bian, X., Krim, H., Bronstein, A. M., & Dai, L. (2016). Sparsity and nullity:
Paradigms for analysis dictionary learning. SIAM Journal on Imaging Sciences.
Society for Industrial & Applied Mathematics. https://doi.org/10.1137/15m1030376'
chicago: 'Bian, Xiao, Hamid Krim, Alex M. Bronstein, and Liyi Dai. “Sparsity and
Nullity: Paradigms for Analysis Dictionary Learning.” SIAM Journal on Imaging
Sciences. Society for Industrial & Applied Mathematics, 2016. https://doi.org/10.1137/15m1030376.'
ieee: 'X. Bian, H. Krim, A. M. Bronstein, and L. Dai, “Sparsity and nullity: Paradigms
for analysis dictionary learning,” SIAM Journal on Imaging Sciences, vol.
9, no. 3. Society for Industrial & Applied Mathematics, pp. 1107–1126, 2016.'
ista: 'Bian X, Krim H, Bronstein AM, Dai L. 2016. Sparsity and nullity: Paradigms
for analysis dictionary learning. SIAM Journal on Imaging Sciences. 9(3), 1107–1126.'
mla: 'Bian, Xiao, et al. “Sparsity and Nullity: Paradigms for Analysis Dictionary
Learning.” SIAM Journal on Imaging Sciences, vol. 9, no. 3, Society for
Industrial & Applied Mathematics, 2016, pp. 1107–26, doi:10.1137/15m1030376.'
short: X. Bian, H. Krim, A.M. Bronstein, L. Dai, SIAM Journal on Imaging Sciences
9 (2016) 1107–1126.
date_created: 2024-10-15T11:20:55Z
date_published: 2016-08-09T00:00:00Z
date_updated: 2024-12-19T13:05:21Z
day: '09'
doi: 10.1137/15m1030376
extern: '1'
intvolume: ' 9'
issue: '3'
language:
- iso: eng
month: '08'
oa_version: None
page: 1107-1126
publication: SIAM Journal on Imaging Sciences
publication_identifier:
eissn:
- 1936-4954
publication_status: published
publisher: Society for Industrial & Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Sparsity and nullity: Paradigms for analysis dictionary learning'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2016'
...
---
OA_place: repository
OA_type: green
_id: '18434'
abstract:
- lang: eng
text: "Notions of similarity and correspondence between geometric shapes and images
are central to many tasks in geometry processing, computer vision, and computer
graphics. The goal of this course is to familiarize the audience with a set of
recent techniques that greatly facilitate the computation of mappings or correspondences
between geometric datasets, such as 3D shapes or 2D images by formulating them
as mappings between functions rather than points or triangles.\r\nMethods based
on the functional map framework have recently led to state-of-the-art results
in problems as diverse as non-rigid shape matching, image co-segmentation and
even some aspects of tangent vector field design. One challenge in adopting these
methods in practice, however, is that their exposition often assumes a significant
amount of background in geometry processing, spectral methods and functional analysis,
which can make it difficult to gain an intuition about their performance or about
their applicability to real-life problems. In this course, we try to provide all
the tools necessary to appreciate and use these techniques, while assuming very
little background knowledge. We also give a unifying treatment of these techniques,
which may be difficult to extract from the individual publications and, at the
same time, hint at the generality of this point of view, which can help tackle
many problems in the analysis and creation of visual content.\r\nThis course is
structured as a half day course. We will assume that the participants have knowledge
of basic linear algebra and some knowledge of differential geometry, to the extent
of being familiar with the concepts of a manifold and a tangent vector space.
We will discuss in detail the functional approach to finding correspondences between
non-rigid shapes, the design and analysis of tangent vector fields on surfaces,
consistent map estimation in networks of shapes and applications to shape and
image segmentation, shape variability analysis, and other areas."
article_number: '9'
article_processing_charge: No
author:
- first_name: Maks
full_name: Ovsjanikov, Maks
last_name: Ovsjanikov
- first_name: Etienne
full_name: Corman, Etienne
last_name: Corman
- first_name: Michael
full_name: Bronstein, Michael
last_name: Bronstein
- first_name: Emanuele
full_name: Rodolà, Emanuele
last_name: Rodolà
- first_name: Mirela
full_name: Ben-Chen, Mirela
last_name: Ben-Chen
- first_name: Leonidas
full_name: Guibas, Leonidas
last_name: Guibas
- first_name: Frederic
full_name: Chazal, Frederic
last_name: Chazal
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
citation:
ama: 'Ovsjanikov M, Corman E, Bronstein M, et al. Computing and processing correspondences
with functional maps. In: SIGGRAPH ASIA 2016 Courses. ACM; 2016. doi:10.1145/2988458.2988494'
apa: 'Ovsjanikov, M., Corman, E., Bronstein, M., Rodolà, E., Ben-Chen, M., Guibas,
L., … Bronstein, A. M. (2016). Computing and processing correspondences with functional
maps. In SIGGRAPH ASIA 2016 Courses. Macau: ACM. https://doi.org/10.1145/2988458.2988494'
chicago: Ovsjanikov, Maks, Etienne Corman, Michael Bronstein, Emanuele Rodolà, Mirela
Ben-Chen, Leonidas Guibas, Frederic Chazal, and Alex M. Bronstein. “Computing
and Processing Correspondences with Functional Maps.” In SIGGRAPH ASIA 2016
Courses. ACM, 2016. https://doi.org/10.1145/2988458.2988494.
ieee: M. Ovsjanikov et al., “Computing and processing correspondences with
functional maps,” in SIGGRAPH ASIA 2016 Courses, Macau, 2016.
ista: 'Ovsjanikov M, Corman E, Bronstein M, Rodolà E, Ben-Chen M, Guibas L, Chazal
F, Bronstein AM. 2016. Computing and processing correspondences with functional
maps. SIGGRAPH ASIA 2016 Courses. SA ’16: SIGGRAPH ASIA 2016 Courses, 9.'
mla: Ovsjanikov, Maks, et al. “Computing and Processing Correspondences with Functional
Maps.” SIGGRAPH ASIA 2016 Courses, 9, ACM, 2016, doi:10.1145/2988458.2988494.
short: M. Ovsjanikov, E. Corman, M. Bronstein, E. Rodolà, M. Ben-Chen, L. Guibas,
F. Chazal, A.M. Bronstein, in:, SIGGRAPH ASIA 2016 Courses, ACM, 2016.
conference:
end_date: 2016-12-08
location: Macau
name: 'SA ''16: SIGGRAPH ASIA 2016 Courses'
start_date: 2016-12-05
date_created: 2024-10-15T11:20:55Z
date_published: 2016-11-28T00:00:00Z
date_updated: 2025-02-04T15:03:47Z
day: '28'
doi: 10.1145/2988458.2988494
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://inria.hal.science/hal-01664767/
month: '11'
oa: 1
oa_version: Preprint
publication: SIGGRAPH ASIA 2016 Courses
publication_identifier:
isbn:
- '9781450345385'
publication_status: published
publisher: ACM
quality_controlled: '1'
scopus_import: '1'
status: public
title: Computing and processing correspondences with functional maps
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
OA_place: repository
OA_type: green
_id: '22051'
abstract:
- lang: eng
text: "We construct solutions with prescribed scattering state to the cubic-quintic
NLS (mathematical formular)in three spatial dimensions in the class of solutions
with (mathematical formular). This models disturbances in an infinite expanse
of (quantum) fluid in its quiescent state— the limiting modulus c corresponds
to a local minimum in the energy density.\r\nOur arguments build on work of Gustafson,
Nakanishi, and Tsai on the (defocusing) Gross–Pitaevskii equation. The presence
of an energy-critical nonlinearity and changes in the geometry of the energy\r\nfunctional
add several new complexities. One new ingredient in our argument is a demonstration
that\r\nsolutions of such (perturbed) energy-critical equations exhibit continuous
dependence on the initial data\r\nwith respect to the weak topology on H1/x."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Rowan
full_name: Killip, Rowan
last_name: Killip
- first_name: Jason
full_name: Murphy, Jason
last_name: Murphy
- first_name: Monica
full_name: Visan, Monica
id: 056daca0-b8d1-11f0-964f-f91054abf8ca
last_name: Visan
citation:
ama: Killip R, Murphy J, Vişan M. The final-state problem for the cubic-quintic
NLS with nonvanishing boundary conditions. Analysis & PDE. 2016;9(7):1523-1574.
doi:10.2140/apde.2016.9.1523
apa: Killip, R., Murphy, J., & Vişan, M. (2016). The final-state problem for
the cubic-quintic NLS with nonvanishing boundary conditions. Analysis &
PDE. Mathematical Sciences Publishers. https://doi.org/10.2140/apde.2016.9.1523
chicago: Killip, Rowan, Jason Murphy, and Monica Vişan. “The Final-State Problem
for the Cubic-Quintic NLS with Nonvanishing Boundary Conditions.” Analysis
& PDE. Mathematical Sciences Publishers, 2016. https://doi.org/10.2140/apde.2016.9.1523.
ieee: R. Killip, J. Murphy, and M. Vişan, “The final-state problem for the cubic-quintic
NLS with nonvanishing boundary conditions,” Analysis & PDE, vol. 9,
no. 7. Mathematical Sciences Publishers, pp. 1523–1574, 2016.
ista: Killip R, Murphy J, Vişan M. 2016. The final-state problem for the cubic-quintic
NLS with nonvanishing boundary conditions. Analysis & PDE. 9(7), 1523–1574.
mla: Killip, Rowan, et al. “The Final-State Problem for the Cubic-Quintic NLS with
Nonvanishing Boundary Conditions.” Analysis & PDE, vol. 9, no. 7, Mathematical
Sciences Publishers, 2016, pp. 1523–74, doi:10.2140/apde.2016.9.1523.
short: R. Killip, J. Murphy, M. Vişan, Analysis & PDE 9 (2016) 1523–1574.
das_tickbox: '1'
date_created: 2026-06-19T07:54:01Z
date_published: 2016-11-07T00:00:00Z
date_updated: 2026-06-25T08:23:10Z
day: '07'
doi: 10.2140/apde.2016.9.1523
extern: '1'
external_id:
arxiv:
- '1506.06151'
intvolume: ' 9'
issue: '7'
keyword:
- final-state problem
- wave operators
- cubic-quintic NLS
- nonvanishing boundary conditions
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1506.06151
mathsc:
- 35Q55
month: '11'
oa: 1
oa_version: Preprint
page: 1523-1574
publication: Analysis & PDE
publication_identifier:
eissn:
- 1948-206X
issn:
- 2157-5045
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: The final-state problem for the cubic-quintic NLS with nonvanishing boundary
conditions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2016'
...
---
OA_place: repository
OA_type: green
_id: '22052'
abstract:
- lang: eng
text: 'We consider the focusing cubic nonlinear Schrödinger equation (NLS) in the
exterior Ω of a smooth, compact, strictly convex obstacle in three dimensions.
We prove that the threshold for global existence and scattering is the same as
for the problem posed on Euclidean space. Specifically, we prove that if E(u0)M(u0)Applied Mathematics Research eXpress. 2016;2016(1):146-180.
doi:10.1093/amrx/abv012
apa: Killip, R., Vişan, M., & Zhang, X. (2016). The focusing cubic NLS on exterior
domains in three dimensions. Applied Mathematics Research EXpress. Oxford
University Press. https://doi.org/10.1093/amrx/abv012
chicago: Killip, Rowan, Monica Vişan, and Xiaoyi Zhang. “The Focusing Cubic NLS
on Exterior Domains in Three Dimensions.” Applied Mathematics Research EXpress.
Oxford University Press, 2016. https://doi.org/10.1093/amrx/abv012.
ieee: R. Killip, M. Vişan, and X. Zhang, “The focusing cubic NLS on exterior domains
in three dimensions,” Applied Mathematics Research eXpress, vol. 2016,
no. 1. Oxford University Press, pp. 146–180, 2016.
ista: Killip R, Vişan M, Zhang X. 2016. The focusing cubic NLS on exterior domains
in three dimensions. Applied Mathematics Research eXpress. 2016(1), 146–180.
mla: Killip, Rowan, et al. “The Focusing Cubic NLS on Exterior Domains in Three
Dimensions.” Applied Mathematics Research EXpress, vol. 2016, no. 1, Oxford
University Press, 2016, pp. 146–80, doi:10.1093/amrx/abv012.
short: R. Killip, M. Vişan, X. Zhang, Applied Mathematics Research EXpress 2016
(2016) 146–180.
das_tickbox: '1'
date_created: 2026-06-19T07:54:24Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2026-06-25T08:30:19Z
day: '01'
doi: 10.1093/amrx/abv012
extern: '1'
external_id:
arxiv:
- '1501.05062'
intvolume: ' 2016'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1501.05062
month: '01'
oa: 1
oa_version: Preprint
page: 146-180
publication: Applied Mathematics Research eXpress
publication_identifier:
eissn:
- 1687-1197
issn:
- 1687-1200
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The focusing cubic NLS on exterior domains in three dimensions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2016
year: '2016'
...
---
OA_place: repository
OA_type: green
_id: '22073'
abstract:
- lang: eng
text: We prove scale-invariant Strichartz inequalities for the Schrödinger equation
on rectangular tori (rational or irrational) in all dimensions. We use these estimates
to give a simpler treatment of local well-posedness of the energy-critical nonlinear
Schrödinger equation in dimensions three and four.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Rowan
full_name: Killip, Rowan
last_name: Killip
- first_name: Monica
full_name: Visan, Monica
id: 056daca0-b8d1-11f0-964f-f91054abf8ca
last_name: Visan
citation:
ama: Killip R, Vişan M. Scale-invariant Strichartz estimates on tori and applications.
Mathematical Research Letters. 2016;23(2):445-472. doi:10.4310/mrl.2016.v23.n2.a8
apa: Killip, R., & Vişan, M. (2016). Scale-invariant Strichartz estimates on
tori and applications. Mathematical Research Letters. International Press.
https://doi.org/10.4310/mrl.2016.v23.n2.a8
chicago: Killip, Rowan, and Monica Vişan. “Scale-Invariant Strichartz Estimates
on Tori and Applications.” Mathematical Research Letters. International
Press, 2016. https://doi.org/10.4310/mrl.2016.v23.n2.a8.
ieee: R. Killip and M. Vişan, “Scale-invariant Strichartz estimates on tori and
applications,” Mathematical Research Letters, vol. 23, no. 2. International
Press, pp. 445–472, 2016.
ista: Killip R, Vişan M. 2016. Scale-invariant Strichartz estimates on tori and
applications. Mathematical Research Letters. 23(2), 445–472.
mla: Killip, Rowan, and Monica Vişan. “Scale-Invariant Strichartz Estimates on Tori
and Applications.” Mathematical Research Letters, vol. 23, no. 2, International
Press, 2016, pp. 445–72, doi:10.4310/mrl.2016.v23.n2.a8.
short: R. Killip, M. Vişan, Mathematical Research Letters 23 (2016) 445–472.
das_tickbox: '1'
date_created: 2026-06-19T08:22:27Z
date_published: 2016-06-06T00:00:00Z
date_updated: 2026-06-30T10:59:10Z
day: '06'
doi: 10.4310/mrl.2016.v23.n2.a8
extern: '1'
external_id:
arxiv:
- '1409.3603'
intvolume: ' 23'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: 'https://doi.org/10.48550/arXiv.1409.3603 '
month: '06'
oa: 1
oa_version: Preprint
page: 445-472
publication: Mathematical Research Letters
publication_identifier:
eissn:
- 1945-001X
issn:
- 1073-2780
publication_status: published
publisher: International Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Scale-invariant Strichartz estimates on tori and applications
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2016'
...
---
_id: '1223'
abstract:
- lang: eng
text: We consider a random Schrödinger operator on the binary tree with a random
potential which is the sum of a random radially symmetric potential, Qr, and a
random transversally periodic potential, κQt, with coupling constant κ. Using
a new one-dimensional dynamical systems approach combined with Jensen's inequality
in hyperbolic space (our key estimate) we obtain a fractional moment estimate
proving localization for small and large κ. Together with a previous result we
therefore obtain a model with two Anderson transitions, from localization to delocalization
and back to localization, when increasing κ. As a by-product we also have a partially
new proof of one-dimensional Anderson localization at any disorder.
article_processing_charge: No
arxiv: 1
author:
- first_name: Richard
full_name: Froese, Richard
last_name: Froese
- first_name: Darrick
full_name: Lee, Darrick
last_name: Lee
- first_name: Christian
full_name: Sadel, Christian
id: 4760E9F8-F248-11E8-B48F-1D18A9856A87
last_name: Sadel
orcid: 0000-0001-8255-3968
- first_name: Wolfgang
full_name: Spitzer, Wolfgang
last_name: Spitzer
- first_name: Günter
full_name: Stolz, Günter
last_name: Stolz
citation:
ama: Froese R, Lee D, Sadel C, Spitzer W, Stolz G. Localization for transversally
periodic random potentials on binary trees. Journal of Spectral Theory.
2016;6(3):557-600. doi:10.4171/JST/132
apa: Froese, R., Lee, D., Sadel, C., Spitzer, W., & Stolz, G. (2016). Localization
for transversally periodic random potentials on binary trees. Journal of Spectral
Theory. EMS Press. https://doi.org/10.4171/JST/132
chicago: Froese, Richard, Darrick Lee, Christian Sadel, Wolfgang Spitzer, and Günter
Stolz. “Localization for Transversally Periodic Random Potentials on Binary Trees.”
Journal of Spectral Theory. EMS Press, 2016. https://doi.org/10.4171/JST/132.
ieee: R. Froese, D. Lee, C. Sadel, W. Spitzer, and G. Stolz, “Localization for transversally
periodic random potentials on binary trees,” Journal of Spectral Theory,
vol. 6, no. 3. EMS Press, pp. 557–600, 2016.
ista: Froese R, Lee D, Sadel C, Spitzer W, Stolz G. 2016. Localization for transversally
periodic random potentials on binary trees. Journal of Spectral Theory. 6(3),
557–600.
mla: Froese, Richard, et al. “Localization for Transversally Periodic Random Potentials
on Binary Trees.” Journal of Spectral Theory, vol. 6, no. 3, EMS Press,
2016, pp. 557–600, doi:10.4171/JST/132.
short: R. Froese, D. Lee, C. Sadel, W. Spitzer, G. Stolz, Journal of Spectral Theory
6 (2016) 557–600.
das_tickbox: '1'
date_created: 2018-12-11T11:50:48Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2026-07-06T11:55:04Z
day: '01'
department:
- _id: LaEr
doi: 10.4171/JST/132
external_id:
arxiv:
- '1408.3961'
isi:
- '000388627000004'
intvolume: ' 6'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1408.3961
month: '01'
oa: 1
oa_version: Preprint
page: 557 - 600
publication: Journal of Spectral Theory
publication_status: published
publisher: EMS Press
publist_id: '6112'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Localization for transversally periodic random potentials on binary trees
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2016'
...
---
OA_place: repository
OA_type: green
_id: '1170'
abstract:
- lang: eng
text: The increasing complexity of dynamic models in systems and synthetic biology
poses computational challenges especially for the identification of model parameters.
While modularization of the corresponding optimization problems could help reduce
the “curse of dimensionality,” abundant feedback and crosstalk mechanisms prohibit
a simple decomposition of most biomolecular networks into subnetworks, or modules.
Drawing on ideas from network modularization and multiple-shooting optimization,
we present here a modular parameter identification approach that explicitly allows
for such interdependencies. Interfaces between our modules are given by the experimentally
measured molecular species. This definition allows deriving good (initial) estimates
for the inter-module communication directly from the experimental data. Given
these estimates, the states and parameter sensitivities of different modules can
be integrated independently. To achieve consistency between modules, we iteratively
adjust the estimates for inter-module communication while optimizing the parameters.
After convergence to an optimal parameter set---but not during earlier iterations---the
intermodule communication as well as the individual modules\' state dynamics agree
with the dynamics of the nonmodularized network. Our modular parameter identification
approach allows for easy parallelization; it can reduce the computational complexity
for larger networks and decrease the probability to converge to suboptimal local
minima. We demonstrate the algorithm\'s performance in parameter estimation for
two biomolecular networks, a synthetic genetic oscillator and a mammalian signaling
pathway.
article_processing_charge: No
article_type: original
author:
- first_name: Moritz
full_name: Lang, Moritz
id: 29E0800A-F248-11E8-B48F-1D18A9856A87
last_name: Lang
- first_name: Jörg
full_name: Stelling, Jörg
last_name: Stelling
citation:
ama: Lang M, Stelling J. Modular parameter identification of biomolecular networks.
SIAM Journal on Scientific Computing. 2016;38(6):B988-B1008. doi:10.1137/15M103306X
apa: Lang, M., & Stelling, J. (2016). Modular parameter identification of biomolecular
networks. SIAM Journal on Scientific Computing. Society for Industrial
and Applied Mathematics. https://doi.org/10.1137/15M103306X
chicago: Lang, Moritz, and Jörg Stelling. “Modular Parameter Identification of Biomolecular
Networks.” SIAM Journal on Scientific Computing. Society for Industrial
and Applied Mathematics, 2016. https://doi.org/10.1137/15M103306X.
ieee: M. Lang and J. Stelling, “Modular parameter identification of biomolecular
networks,” SIAM Journal on Scientific Computing, vol. 38, no. 6. Society
for Industrial and Applied Mathematics, pp. B988–B1008, 2016.
ista: Lang M, Stelling J. 2016. Modular parameter identification of biomolecular
networks. SIAM Journal on Scientific Computing. 38(6), B988–B1008.
mla: Lang, Moritz, and Jörg Stelling. “Modular Parameter Identification of Biomolecular
Networks.” SIAM Journal on Scientific Computing, vol. 38, no. 6, Society
for Industrial and Applied Mathematics, 2016, pp. B988–1008, doi:10.1137/15M103306X.
short: M. Lang, J. Stelling, SIAM Journal on Scientific Computing 38 (2016) B988–B1008.
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T11:50:31Z
date_published: 2016-11-15T00:00:00Z
date_updated: 2026-07-06T14:00:20Z
day: '15'
ddc:
- '003'
- '518'
- '570'
- '621'
department:
- _id: CaGu
- _id: GaTk
doi: 10.1137/15M103306X
external_id:
isi:
- '000391853100010'
file:
- access_level: open_access
checksum: 781bc3ffd30b2dd65b7727c5a285fc78
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:41Z
date_updated: 2025-06-25T11:26:45Z
file_id: '5095'
file_name: IST-2017-811-v1+1_modular_parameter_identification.pdf
file_size: 871964
relation: main_file
file_date_updated: 2025-06-25T11:26:45Z
has_accepted_license: '1'
intvolume: ' 38'
isi: 1
issue: '6'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
page: B988 - B1008
publication: SIAM Journal on Scientific Computing
publication_status: published
publisher: Society for Industrial and Applied Mathematics
publist_id: '6186'
pubrep_id: '811'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Modular parameter identification of biomolecular networks
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 38
year: '2016'
...
---
_id: '1377'
abstract:
- lang: eng
text: We consider the problem of minimizing the continuous valued total variation
subject to different unary terms on trees and propose fast direct algorithms based
on dynamic programming to solve these problems. We treat both the convex and the
nonconvex case and derive worst-case complexities that are equal to or better
than existing methods. We show applications to total variation based two dimensional
image processing and computer vision problems based on a Lagrangian decomposition
approach. The resulting algorithms are very effcient, offer a high degree of parallelism,
and come along with memory requirements which are only in the order of the number
of image pixels.
article_processing_charge: No
arxiv: 1
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Thomas
full_name: Pock, Thomas
last_name: Pock
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
citation:
ama: Kolmogorov V, Pock T, Rolinek M. Total variation on a tree. SIAM Journal
on Imaging Sciences. 2016;9(2):605-636. doi:10.1137/15M1010257
apa: Kolmogorov, V., Pock, T., & Rolinek, M. (2016). Total variation on a tree.
SIAM Journal on Imaging Sciences. Society for Industrial and Applied Mathematics.
https://doi.org/10.1137/15M1010257
chicago: Kolmogorov, Vladimir, Thomas Pock, and Michal Rolinek. “Total Variation
on a Tree.” SIAM Journal on Imaging Sciences. Society for Industrial and
Applied Mathematics, 2016. https://doi.org/10.1137/15M1010257.
ieee: V. Kolmogorov, T. Pock, and M. Rolinek, “Total variation on a tree,” SIAM
Journal on Imaging Sciences, vol. 9, no. 2. Society for Industrial and Applied
Mathematics, pp. 605–636, 2016.
ista: Kolmogorov V, Pock T, Rolinek M. 2016. Total variation on a tree. SIAM Journal
on Imaging Sciences. 9(2), 605–636.
mla: Kolmogorov, Vladimir, et al. “Total Variation on a Tree.” SIAM Journal on
Imaging Sciences, vol. 9, no. 2, Society for Industrial and Applied Mathematics,
2016, pp. 605–36, doi:10.1137/15M1010257.
short: V. Kolmogorov, T. Pock, M. Rolinek, SIAM Journal on Imaging Sciences 9 (2016)
605–636.
das_tickbox: '1'
date_created: 2018-12-11T11:51:40Z
date_published: 2016-05-03T00:00:00Z
date_updated: 2026-07-06T13:59:54Z
day: '03'
department:
- _id: VlKo
doi: 10.1137/15M1010257
ec_funded: 1
external_id:
arxiv:
- '1502.07770'
isi:
- '000385275400005'
intvolume: ' 9'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1502.07770
month: '05'
oa: 1
oa_version: Preprint
page: 605 - 636
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: SIAM Journal on Imaging Sciences
publication_status: published
publisher: Society for Industrial and Applied Mathematics
publist_id: '5834'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Total variation on a tree
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2016'
...
---
_id: '1272'
abstract:
- lang: eng
text: We study different means to extend offsetting based on skeletal structures
beyond the well-known constant-radius and mitered offsets supported by Voronoi
diagrams and straight skeletons, for which the orthogonal distance of offset elements
to their respective input elements is constant and uniform over all input elements.
Our main contribution is a new geometric structure, called variable-radius Voronoi
diagram, which supports the computation of variable-radius offsets, i.e., offsets
whose distance to the input is allowed to vary along the input. We discuss properties
of this structure and sketch a prototype implementation that supports the computation
of variable-radius offsets based on this new variant of Voronoi diagrams.
acknowledgement: 'This work was supported by Austrian Science Fund (FWF): P25816-N15.'
article_processing_charge: No
author:
- first_name: Martin
full_name: Held, Martin
last_name: Held
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
- first_name: Peter
full_name: Palfrader, Peter
last_name: Palfrader
citation:
ama: Held M, Huber S, Palfrader P. Generalized offsetting of planar structures using
skeletons. Computer-Aided Design and Applications. 2016;13(5):712-721.
doi:10.1080/16864360.2016.1150718
apa: Held, M., Huber, S., & Palfrader, P. (2016). Generalized offsetting of
planar structures using skeletons. Computer-Aided Design and Applications.
Taylor & Francis. https://doi.org/10.1080/16864360.2016.1150718
chicago: Held, Martin, Stefan Huber, and Peter Palfrader. “Generalized Offsetting
of Planar Structures Using Skeletons.” Computer-Aided Design and Applications.
Taylor & Francis, 2016. https://doi.org/10.1080/16864360.2016.1150718.
ieee: M. Held, S. Huber, and P. Palfrader, “Generalized offsetting of planar structures
using skeletons,” Computer-Aided Design and Applications, vol. 13, no.
5. Taylor & Francis, pp. 712–721, 2016.
ista: Held M, Huber S, Palfrader P. 2016. Generalized offsetting of planar structures
using skeletons. Computer-Aided Design and Applications. 13(5), 712–721.
mla: Held, Martin, et al. “Generalized Offsetting of Planar Structures Using Skeletons.”
Computer-Aided Design and Applications, vol. 13, no. 5, Taylor & Francis,
2016, pp. 712–21, doi:10.1080/16864360.2016.1150718.
short: M. Held, S. Huber, P. Palfrader, Computer-Aided Design and Applications 13
(2016) 712–721.
das_tickbox: '1'
date_created: 2018-12-11T11:51:04Z
date_published: 2016-09-02T00:00:00Z
date_updated: 2026-07-07T05:34:31Z
day: '02'
ddc:
- '004'
- '516'
department:
- _id: HeEd
doi: 10.1080/16864360.2016.1150718
file:
- access_level: open_access
checksum: c746f3a48edb62b588d92ea5d0fd2c0e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:20Z
date_updated: 2020-07-14T12:44:42Z
file_id: '5206'
file_name: IST-2016-694-v1+1_Generalized_offsetting_of_planar_structures_using_skeletons.pdf
file_size: 1678369
relation: main_file
file_date_updated: 2020-07-14T12:44:42Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '5'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 712 - 721
publication: Computer-Aided Design and Applications
publication_status: published
publisher: Taylor & Francis
publist_id: '6048'
pubrep_id: '694'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Generalized offsetting of planar structures using skeletons
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2016'
...