---
_id: '3180'
abstract:
- lang: eng
text: 'One of the most exciting advances in early vision has been the development
of efficient energy minimization algorithms. Many early vision tasks require labeling
each pixel with some quantity such as depth or texture. While many such problems
can be elegantly expressed in the language of Markov Random Fields (MRF''s), the
resulting energy minimization problems were widely viewed as intractable. Recently,
algorithms such as graph cuts and loopy belief propagation (LBP) have proven to
be very powerful: for example, such methods form the basis for almost all the
top-performing stereo methods. Unfortunately, most papers define their own energy
function, which is minimized with a specific algorithm of their choice. As a result,
the tradeoffs among different energy minimization algorithms are not well understood.
In this paper we describe a set of energy minimization benchmarks, which we use
to compare the solution quality and running time of several common energy minimization
algorithms. We investigate three promising recent methods - graph cuts, LBP, and
tree-reweighted message passing - as well as the well-known older iterated conditional
modes (ICM) algorithm. Our benchmark problems are drawn from published energy
functions used for stereo, image stitching and interactive segmentation. We also
provide a general-purpose software interface that allows vision researchers to
easily switch between optimization methods with minimal overhead. We expect that
the availability of our benchmarks and interface will make it significantly easier
for vision researchers to adopt the best method for their specific problems. Benchmarks,
code, results and images are available at http://vision.middlebury.edu/MRF.'
author:
- first_name: Richard
full_name: Szeliski, Richard S
last_name: Szeliski
- first_name: Ramin
full_name: Zabih, Ramin
last_name: Zabih
- first_name: Daniel
full_name: Scharstein, Daniel
last_name: Scharstein
- first_name: Olga
full_name: Veksler, Olga
last_name: Veksler
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Aseem
full_name: Agarwala, Aseem
last_name: Agarwala
- first_name: Marshall
full_name: Tappen, Marshall F
last_name: Tappen
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
citation:
ama: 'Szeliski R, Zabih R, Scharstein D, et al. A comparative study of energy minimization
methods for Markov random fields. In: Vol 3952. Springer; 2006:16-29. doi:10.1007/11744047_2'
apa: 'Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala,
A., … Rother, C. (2006). A comparative study of energy minimization methods for
Markov random fields (Vol. 3952, pp. 16–29). Presented at the ECCV: European Conference
on Computer Vision, Springer. https://doi.org/10.1007/11744047_2'
chicago: Szeliski, Richard, Ramin Zabih, Daniel Scharstein, Olga Veksler, Vladimir
Kolmogorov, Aseem Agarwala, Marshall Tappen, and Carsten Rother. “A Comparative
Study of Energy Minimization Methods for Markov Random Fields,” 3952:16–29. Springer,
2006. https://doi.org/10.1007/11744047_2.
ieee: 'R. Szeliski et al., “A comparative study of energy minimization methods
for Markov random fields,” presented at the ECCV: European Conference on Computer
Vision, 2006, vol. 3952, pp. 16–29.'
ista: 'Szeliski R, Zabih R, Scharstein D, Veksler O, Kolmogorov V, Agarwala A, Tappen
M, Rother C. 2006. A comparative study of energy minimization methods for Markov
random fields. ECCV: European Conference on Computer Vision vol. 3952, 16–29.'
mla: Szeliski, Richard, et al. A Comparative Study of Energy Minimization Methods
for Markov Random Fields. Vol. 3952, Springer, 2006, pp. 16–29, doi:10.1007/11744047_2.
short: R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala,
M. Tappen, C. Rother, in:, Springer, 2006, pp. 16–29.
conference:
name: 'ECCV: European Conference on Computer Vision'
date_created: 2018-12-11T12:01:51Z
date_published: 2006-05-03T00:00:00Z
date_updated: 2021-01-12T07:41:37Z
day: '03'
doi: 10.1007/11744047_2
extern: 1
intvolume: ' 3952'
main_file_link:
- open_access: '0'
url: http://research-srv.microsoft.com/pubs/67896/szsvkatr-eccv06.pdf
month: '05'
page: 16 - 29
publication_status: published
publisher: Springer
publist_id: '3499'
quality_controlled: 0
status: public
title: A comparative study of energy minimization methods for Markov random fields
type: conference
volume: 3952
year: '2006'
...
---
_id: '3184'
abstract:
- lang: eng
text: 'Algorithms for discrete energy minimization play a fundamental role for low-level
vision. Known techniques include graph cuts, belief propagation (BP) and recently
introduced tree-reweighted message passing (TRW). So far, the standard benchmark
for their comparison has been a 4-connected grid-graph arising in pixel-labelling
stereo. This minimization problem, however, has been largely solved: recent work
shows that for many scenes TRW finds the global optimum. Furthermore, it is known
that a 4-connecled grid-graph is a poor stereo model since it does not take occlusions
into account. We propose the problem of stereo with occlusions as a new test bed
for minimization algorithms. This is a more challenging graph since it has much
larger connectivity, and it also serves as a better stereo model. An attractive
feature of this problem is that increased connectivity does not result in increased
complexity of message passing algorithms. Indeed, one contribution of this paper
is to show that sophisticated implementations of BP and TRW have the same time
and memory complexity as that of 4-connecled grid-graph stereo. The main conclusion
of our experimental study is that for our problem graph cut outperforms both TRW
and BP considerably. TRW achieves consistently a lower energy than BP. However,
as connectivity increases the speed of convergence of TRW becomes slower. Unlike
4-connected grids, the difference between the energy of the best optimization
method and the lower bound of TRW appears significant. This shows the hardness
of the problem and motivates future research.'
alternative_title:
- LNCS
author:
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
citation:
ama: 'Kolmogorov V, Rother C. Comparison of energy minimization algorithms for highly
connected graphs. In: Vol 3952 LNCS. Springer; 2006:1-15. doi:10.1007/11744047_1'
apa: 'Kolmogorov, V., & Rother, C. (2006). Comparison of energy minimization
algorithms for highly connected graphs (Vol. 3952 LNCS, pp. 1–15). Presented at
the ECCV: European Conference on Computer Vision, Springer. https://doi.org/10.1007/11744047_1'
chicago: Kolmogorov, Vladimir, and Carsten Rother. “Comparison of Energy Minimization
Algorithms for Highly Connected Graphs,” 3952 LNCS:1–15. Springer, 2006. https://doi.org/10.1007/11744047_1.
ieee: 'V. Kolmogorov and C. Rother, “Comparison of energy minimization algorithms
for highly connected graphs,” presented at the ECCV: European Conference on Computer
Vision, 2006, vol. 3952 LNCS, pp. 1–15.'
ista: 'Kolmogorov V, Rother C. 2006. Comparison of energy minimization algorithms
for highly connected graphs. ECCV: European Conference on Computer Vision, LNCS,
vol. 3952 LNCS, 1–15.'
mla: Kolmogorov, Vladimir, and Carsten Rother. Comparison of Energy Minimization
Algorithms for Highly Connected Graphs. Vol. 3952 LNCS, Springer, 2006, pp.
1–15, doi:10.1007/11744047_1.
short: V. Kolmogorov, C. Rother, in:, Springer, 2006, pp. 1–15.
conference:
name: 'ECCV: European Conference on Computer Vision'
date_created: 2018-12-11T12:01:52Z
date_published: 2006-05-03T00:00:00Z
date_updated: 2021-01-12T07:41:39Z
day: '03'
doi: 10.1007/11744047_1
extern: 1
main_file_link:
- open_access: '0'
url: http://research.microsoft.com/pubs/67889/paper_eccv06-trw.pdf
month: '05'
page: 1 - 15
publication_status: published
publisher: Springer
publist_id: '3498'
quality_controlled: 0
status: public
title: Comparison of energy minimization algorithms for highly connected graphs
type: conference
volume: 3952 LNCS
year: '2006'
...
---
_id: '3185'
abstract:
- lang: eng
text: This paper describes models and algorithms for the real-time segmentation
of foreground from background layers in stereo video sequences. Automatic separation
of layers from color/contrast or from stereo alone is known to be error-prone.
Here, color, contrast, and stereo matching information are fused to infer layers
accurately and efficiently. The first algorithm, Layered Dynamic Programming (LDP),
solves stereo in an extended six-state space that represents both foreground/background
layers and occluded regions. The stereo-match likelihood is then fused with a
contrast-sensitive color model that is learned on-the-fly and stereo disparities
are obtained by dynamic programming. The second algorithm, Layered Graph Cut (LGC),
does not directly solve stereo. Instead, the stereo match likelihood is marginalized
over disparities to evaluate foreground and background hypotheses and then fused
with a contrast-sensitive color model like the one used in LDP. Segmentation is
solved efficiently by ternary graph cut. Both algorithms are evaluated with respect
to ground truth data and found to have similar performance, substantially better
than either stereo or color/contrast alone. However, their characteristics with
respect to computational efficiency are rather different. The algorithms are demonstrated
in the application of background substitution and shown to give good quality composite
video output.
author:
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Antonio
full_name: Criminisi, Antonio
last_name: Criminisi
- first_name: Andrew
full_name: Blake, Andrew
last_name: Blake
- first_name: Geoffrey
full_name: Cross, Geoffrey
last_name: Cross
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
citation:
ama: Kolmogorov V, Criminisi A, Blake A, Cross G, Rother C. Probabilistic fusion
of stereo with color and contrast for bilayer segmentation. IEEE Transactions
on Pattern Analysis and Machine Intelligence. 2006;28(9):1480-1492. doi:10.1109/TPAMI.2006.193
apa: Kolmogorov, V., Criminisi, A., Blake, A., Cross, G., & Rother, C. (2006).
Probabilistic fusion of stereo with color and contrast for bilayer segmentation.
IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2006.193
chicago: Kolmogorov, Vladimir, Antonio Criminisi, Andrew Blake, Geoffrey Cross,
and Carsten Rother. “Probabilistic Fusion of Stereo with Color and Contrast for
Bilayer Segmentation.” IEEE Transactions on Pattern Analysis and Machine Intelligence.
IEEE, 2006. https://doi.org/10.1109/TPAMI.2006.193.
ieee: V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, and C. Rother, “Probabilistic
fusion of stereo with color and contrast for bilayer segmentation,” IEEE Transactions
on Pattern Analysis and Machine Intelligence, vol. 28, no. 9. IEEE, pp. 1480–1492,
2006.
ista: Kolmogorov V, Criminisi A, Blake A, Cross G, Rother C. 2006. Probabilistic
fusion of stereo with color and contrast for bilayer segmentation. IEEE Transactions
on Pattern Analysis and Machine Intelligence. 28(9), 1480–1492.
mla: Kolmogorov, Vladimir, et al. “Probabilistic Fusion of Stereo with Color and
Contrast for Bilayer Segmentation.” IEEE Transactions on Pattern Analysis and
Machine Intelligence, vol. 28, no. 9, IEEE, 2006, pp. 1480–92, doi:10.1109/TPAMI.2006.193.
short: V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, C. Rother, IEEE Transactions
on Pattern Analysis and Machine Intelligence 28 (2006) 1480–1492.
date_created: 2018-12-11T12:01:53Z
date_published: 2006-09-01T00:00:00Z
date_updated: 2021-01-12T07:41:39Z
day: '01'
doi: 10.1109/TPAMI.2006.193
extern: 1
intvolume: ' 28'
issue: '9'
main_file_link:
- open_access: '0'
url: http://research.microsoft.com/pubs/67414/criminisi_pami2006.pdf
month: '09'
page: 1480 - 1492
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_status: published
publisher: IEEE
publist_id: '3496'
quality_controlled: 0
status: public
title: Probabilistic fusion of stereo with color and contrast for bilayer segmentation
type: journal_article
volume: 28
year: '2006'
...
---
_id: '3186'
abstract:
- lang: eng
text: We introduce a new approach to modelling gradient flows of contours and surfaces.
While standard variational methods (e.g. level sets) compute local interface motion
in a differential fashion by estimating local contour velocity via energy derivatives,
we propose to solve surface evolution PDEs by explicitly estimating integral motion
of the whole surface. We formulate an optimization problem directly based on an
integral characterization of gradient flow as an infinitesimal move of the (whole)
surface giving the largest energy decrease among all moves of equal size. We show
that this problem can be efficiently solved using recent advances in algorithms
for global hypersurface optimization [4, 2, 11]. In particular, we employ the
geo-cuts method [4] that uses ideas from integral geometry to represent continuous
surfaces as cuts on discrete graphs. The resulting interface evolution algorithm
is validated on some 2D and 3D examples similar to typical demonstrations of level-set
methods. Our method can compute gradient flows of hypersurfaces with respect to
a fairly general class of continuous functional and it is flexible with respect
to distance metrics on the space of contours/surfaces. Preliminary tests for standard
L2 distance metric demonstrate numerical stability, topological changes and an
absence of any oscillatory motion.
alternative_title:
- LNCS
author:
- first_name: Yuri
full_name: Boykov, Yuri
last_name: Boykov
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Daniel
full_name: Cremers, Daniel
last_name: Cremers
- first_name: Andrew
full_name: Delong, Andrew
last_name: Delong
citation:
ama: 'Boykov Y, Kolmogorov V, Cremers D, Delong A. An integral solution to surface
evolution PDEs via geo cuts. In: Vol 3953. Springer; 2006:409-422. doi:10.1007/11744078_32'
apa: 'Boykov, Y., Kolmogorov, V., Cremers, D., & Delong, A. (2006). An integral
solution to surface evolution PDEs via geo cuts (Vol. 3953, pp. 409–422). Presented
at the ECCV: European Conference on Computer Vision, Springer. https://doi.org/10.1007/11744078_32'
chicago: Boykov, Yuri, Vladimir Kolmogorov, Daniel Cremers, and Andrew Delong. “An
Integral Solution to Surface Evolution PDEs via Geo Cuts,” 3953:409–22. Springer,
2006. https://doi.org/10.1007/11744078_32.
ieee: 'Y. Boykov, V. Kolmogorov, D. Cremers, and A. Delong, “An integral solution
to surface evolution PDEs via geo cuts,” presented at the ECCV: European Conference
on Computer Vision, 2006, vol. 3953, pp. 409–422.'
ista: 'Boykov Y, Kolmogorov V, Cremers D, Delong A. 2006. An integral solution to
surface evolution PDEs via geo cuts. ECCV: European Conference on Computer Vision,
LNCS, vol. 3953, 409–422.'
mla: Boykov, Yuri, et al. An Integral Solution to Surface Evolution PDEs via
Geo Cuts. Vol. 3953, Springer, 2006, pp. 409–22, doi:10.1007/11744078_32.
short: Y. Boykov, V. Kolmogorov, D. Cremers, A. Delong, in:, Springer, 2006, pp.
409–422.
conference:
name: 'ECCV: European Conference on Computer Vision'
date_created: 2018-12-11T12:01:53Z
date_published: 2006-04-28T00:00:00Z
date_updated: 2021-01-12T07:41:39Z
day: '28'
doi: 10.1007/11744078_32
extern: 1
intvolume: ' 3953'
month: '04'
page: 409 - 422
publication_status: published
publisher: Springer
publist_id: '3497'
quality_controlled: 0
status: public
title: An integral solution to surface evolution PDEs via geo cuts
type: conference
volume: 3953
year: '2006'
...
---
_id: '3188'
abstract:
- lang: eng
text: 'We introduce the term cosegmentation which denotes the task of segmenting
simultaneously the common parts of an image pair. A generative model for cosegmentation
is presented. Inference in the model leads to minimizing an energy with an MRF
term encoding spatial coherency and a global constraint which attempts to match
the appearance histograms of the common parts. This energy has not been proposed
previously and its optimization is challenging and NP-hard. For this problem a
novel optimization scheme which we call trust region graph cuts is presented.
We demonstrate that this framework has the potential to improve a wide range of
research: Object driven image retrieval, video tracking and segmentation, and
interactive image editing. The power of the framework lies in its generality,
the common part can be a rigid/non-rigid object (or scene), observed from different
viewpoints or even similar objects of the same class.'
author:
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Thomas
full_name: Minka, Thomas P
last_name: Minka
- first_name: Andrew
full_name: Blake, Andrew
last_name: Blake
citation:
ama: 'Rother C, Kolmogorov V, Minka T, Blake A. Cosegmentation of image pairs by
histogram matching - Incorporating a global constraint into MRFs. In: IEEE; 2006:993-1000.
doi:10.1109/CVPR.2006.91'
apa: 'Rother, C., Kolmogorov, V., Minka, T., & Blake, A. (2006). Cosegmentation
of image pairs by histogram matching - Incorporating a global constraint into
MRFs (pp. 993–1000). Presented at the CVPR: Computer Vision and Pattern Recognition,
IEEE. https://doi.org/10.1109/CVPR.2006.91'
chicago: Rother, Carsten, Vladimir Kolmogorov, Thomas Minka, and Andrew Blake. “Cosegmentation
of Image Pairs by Histogram Matching - Incorporating a Global Constraint into
MRFs,” 993–1000. IEEE, 2006. https://doi.org/10.1109/CVPR.2006.91.
ieee: 'C. Rother, V. Kolmogorov, T. Minka, and A. Blake, “Cosegmentation of image
pairs by histogram matching - Incorporating a global constraint into MRFs,” presented
at the CVPR: Computer Vision and Pattern Recognition, 2006, pp. 993–1000.'
ista: 'Rother C, Kolmogorov V, Minka T, Blake A. 2006. Cosegmentation of image pairs
by histogram matching - Incorporating a global constraint into MRFs. CVPR: Computer
Vision and Pattern Recognition, 993–1000.'
mla: Rother, Carsten, et al. Cosegmentation of Image Pairs by Histogram Matching
- Incorporating a Global Constraint into MRFs. IEEE, 2006, pp. 993–1000, doi:10.1109/CVPR.2006.91.
short: C. Rother, V. Kolmogorov, T. Minka, A. Blake, in:, IEEE, 2006, pp. 993–1000.
conference:
name: 'CVPR: Computer Vision and Pattern Recognition'
date_created: 2018-12-11T12:01:54Z
date_published: 2006-07-05T00:00:00Z
date_updated: 2021-01-12T07:41:40Z
day: '05'
doi: 10.1109/CVPR.2006.91
extern: 1
month: '07'
page: 993 - 1000
publication_status: published
publisher: IEEE
publist_id: '3493'
quality_controlled: 0
status: public
title: Cosegmentation of image pairs by histogram matching - Incorporating a global
constraint into MRFs
type: conference
year: '2006'
...
---
_id: '3189'
abstract:
- lang: eng
text: This paper presents an algorithm capable of real-time separation of foreground
from background in monocular video sequences. Automatic segmentation of layers
from colour/contrast or from motion alone is known to be error-prone. Here motion,
colour and contrast cues are probabilistically fused together with spatial and
temporal priors to infer layers accurately and efficiently. Central to our algorithm
is the fact that pixel velocities are not needed, thus removing the need for optical
flow estimation, with its tendency to error and computational expense. Instead,
an efficient motion vs non-motion classifier is trained to operate directly and
jointly on intensity-change and contrast. Its output is then fused with colour
information. The prior on segmentation is represented by a second order, temporal,
Hidden Markov Model, together with a spatial MRF favouring coherence except where
contrast is high. Finally, accurate layer segmentation and explicit occlusion
detection are efficiently achieved by binary graph cut. The segmentation accuracy
of the proposed algorithm is quantitatively evaluated with respect to existing
ground-truth data and found to be comparable to the accuracy of a state of the
art stereo segmentation algorithm. Fore-ground/background segmentation is demonstrated
in the application of live background substitution and shown to generate convincingly
good quality composite video.
author:
- first_name: Antonio
full_name: Criminisi, Antonio
last_name: Criminisi
- first_name: Geoffrey
full_name: Cross, Geoffrey
last_name: Cross
- first_name: Andrew
full_name: Blake, Andrew
last_name: Blake
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Criminisi A, Cross G, Blake A, Kolmogorov V. Bilayer segmentation of live
video. In: Vol 1. IEEE; 2006:53-60. doi:10.1109/CVPR.2006.69'
apa: 'Criminisi, A., Cross, G., Blake, A., & Kolmogorov, V. (2006). Bilayer
segmentation of live video (Vol. 1, pp. 53–60). Presented at the CVPR: Computer
Vision and Pattern Recognition, IEEE. https://doi.org/10.1109/CVPR.2006.69'
chicago: Criminisi, Antonio, Geoffrey Cross, Andrew Blake, and Vladimir Kolmogorov.
“Bilayer Segmentation of Live Video,” 1:53–60. IEEE, 2006. https://doi.org/10.1109/CVPR.2006.69.
ieee: 'A. Criminisi, G. Cross, A. Blake, and V. Kolmogorov, “Bilayer segmentation
of live video,” presented at the CVPR: Computer Vision and Pattern Recognition,
2006, vol. 1, pp. 53–60.'
ista: 'Criminisi A, Cross G, Blake A, Kolmogorov V. 2006. Bilayer segmentation of
live video. CVPR: Computer Vision and Pattern Recognition vol. 1, 53–60.'
mla: Criminisi, Antonio, et al. Bilayer Segmentation of Live Video. Vol.
1, IEEE, 2006, pp. 53–60, doi:10.1109/CVPR.2006.69.
short: A. Criminisi, G. Cross, A. Blake, V. Kolmogorov, in:, IEEE, 2006, pp. 53–60.
conference:
name: 'CVPR: Computer Vision and Pattern Recognition'
date_created: 2018-12-11T12:01:54Z
date_published: 2006-07-05T00:00:00Z
date_updated: 2021-01-12T07:41:40Z
day: '05'
doi: 10.1109/CVPR.2006.69
extern: 1
intvolume: ' 1'
main_file_link:
- open_access: '0'
url: http://research.microsoft.com/en-us/um/people/ablake/papers/ablake/criminisi_cvpr06.pdf
month: '07'
page: 53 - 60
publication_status: published
publisher: IEEE
publist_id: '3494'
quality_controlled: 0
status: public
title: Bilayer segmentation of live video
type: conference
volume: 1
year: '2006'
...
---
_id: '3190'
abstract:
- lang: eng
text: Algorithms for discrete energy minimization are of fundamental importance
in computer vision. In this paper, we focus on the recent technique proposed by
Wainwright et al. (Nov. 2005)- tree-reweighted max-product message passing (TRW).
It was inspired by the problem of maximizing a lower bound on the energy. However,
the algorithm is not guaranteed to increase this bound - it may actually go down.
In addition, TRW does not always converge. We develop a modification of this algorithm
which we call sequential tree-reweighted message passing. Its main property is
that the bound is guaranteed not to decrease. We also give a weak tree agreement
condition which characterizes local maxima of the bound with respect to TRW algorithms.
We prove that our algorithm has a limit point that achieves weak tree agreement.
Finally, we show that, our algorithm requires half as much memory as traditional
message passing approaches. Experimental results demonstrate that on certain synthetic
and real problems, our algorithm outperforms both the ordinary belief propagation
and tree-reweighted algorithm in (M. J. Wainwright, et al., Nov. 2005). In addition,
on stereo problems with Potts interactions, we obtain a lower energy than graph
cuts.
author:
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Kolmogorov V. Convergent tree reweighted message passing for energy minimization.
IEEE Transactions on Pattern Analysis and Machine Intelligence. 2006;28(10):1568-1583.
doi:10.1109/TPAMI.2006.200
apa: Kolmogorov, V. (2006). Convergent tree reweighted message passing for energy
minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence.
IEEE. https://doi.org/10.1109/TPAMI.2006.200
chicago: Kolmogorov, Vladimir. “Convergent Tree Reweighted Message Passing for Energy
Minimization.” IEEE Transactions on Pattern Analysis and Machine Intelligence.
IEEE, 2006. https://doi.org/10.1109/TPAMI.2006.200.
ieee: V. Kolmogorov, “Convergent tree reweighted message passing for energy minimization,”
IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28,
no. 10. IEEE, pp. 1568–1583, 2006.
ista: Kolmogorov V. 2006. Convergent tree reweighted message passing for energy
minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence.
28(10), 1568–1583.
mla: Kolmogorov, Vladimir. “Convergent Tree Reweighted Message Passing for Energy
Minimization.” IEEE Transactions on Pattern Analysis and Machine Intelligence,
vol. 28, no. 10, IEEE, 2006, pp. 1568–83, doi:10.1109/TPAMI.2006.200.
short: V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence
28 (2006) 1568–1583.
date_created: 2018-12-11T12:01:55Z
date_published: 2006-08-21T00:00:00Z
date_updated: 2021-01-12T07:41:41Z
day: '21'
doi: 10.1109/TPAMI.2006.200
extern: 1
intvolume: ' 28'
issue: '10'
main_file_link:
- open_access: '0'
url: http://research.microsoft.com/pubs/67371/trw_maxproduct_aistats05.pdf
month: '08'
page: 1568 - 1583
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_status: published
publisher: IEEE
publist_id: '3495'
quality_controlled: 0
status: public
title: Convergent tree reweighted message passing for energy minimization
type: journal_article
volume: 28
year: '2006'
...
---
_id: '3214'
abstract:
- lang: eng
text: |-
The Feistel-network is a popular structure underlying many block-ciphers where the cipher is constructed from many simpler rounds, each defined by some function which is derived from the secret key.
Luby and Rackoff showed that the three-round Feistel-network – each round instantiated with a pseudorandom function secure against adaptive chosen plaintext attacks (CPA) – is a CPA secure pseudorandom permutation, thus giving some confidence in the soundness of using a Feistel-network to design block-ciphers.
But the round functions used in actual block-ciphers are – for efficiency reasons – far from being pseudorandom. We investigate the security of the Feistel-network against CPA distinguishers when the only security guarantee we have for the round functions is that they are secure against non-adaptive chosen plaintext attacks (nCPA). We show that in the information-theoretic setting, four rounds with nCPA secure round functions are sufficient (and necessary) to get a CPA secure permutation. Unfortunately, this result does not translate into the more interesting pseudorandom setting. In fact, under the so-called Inverse Decisional Diffie-Hellman assumption the Feistel-network with four rounds, each instantiated with a nCPA secure pseudorandom function, is in general not a CPA secure pseudorandom permutation.
acknowledgement: Most of this work was done while the K. Pietrzak was a PhD student
at ETH where he was supported by the Swiss National Science Foundation, project
No. 200020- 103847/1. Currently he is partially supported by the Commission of the
European Communities through the IST program under contract IST-2002-507932 ECRYPT.
alternative_title:
- LNCS
author:
- first_name: Ueli
full_name: Maurer, Ueli M
last_name: Maurer
- first_name: Yvonne
full_name: Oswald, Yvonne A
last_name: Oswald
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Johan
full_name: Sjödin, Johan
last_name: Sjödin
citation:
ama: 'Maurer U, Oswald Y, Pietrzak KZ, Sjödin J. Luby Rackoff ciphers from weak
round functions . In: Vol 4004. Springer; 2006:391-408. doi:10.1007/11761679_24'
apa: 'Maurer, U., Oswald, Y., Pietrzak, K. Z., & Sjödin, J. (2006). Luby Rackoff
ciphers from weak round functions (Vol. 4004, pp. 391–408). Presented at the
EUROCRYPT: Theory and Applications of Cryptographic Techniques, Springer. https://doi.org/10.1007/11761679_24'
chicago: Maurer, Ueli, Yvonne Oswald, Krzysztof Z Pietrzak, and Johan Sjödin. “Luby
Rackoff Ciphers from Weak Round Functions ,” 4004:391–408. Springer, 2006. https://doi.org/10.1007/11761679_24.
ieee: 'U. Maurer, Y. Oswald, K. Z. Pietrzak, and J. Sjödin, “Luby Rackoff ciphers
from weak round functions ,” presented at the EUROCRYPT: Theory and Applications
of Cryptographic Techniques, 2006, vol. 4004, pp. 391–408.'
ista: 'Maurer U, Oswald Y, Pietrzak KZ, Sjödin J. 2006. Luby Rackoff ciphers from
weak round functions . EUROCRYPT: Theory and Applications of Cryptographic Techniques,
LNCS, vol. 4004, 391–408.'
mla: Maurer, Ueli, et al. Luby Rackoff Ciphers from Weak Round Functions .
Vol. 4004, Springer, 2006, pp. 391–408, doi:10.1007/11761679_24.
short: U. Maurer, Y. Oswald, K.Z. Pietrzak, J. Sjödin, in:, Springer, 2006, pp.
391–408.
conference:
name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
date_created: 2018-12-11T12:02:03Z
date_published: 2006-07-11T00:00:00Z
date_updated: 2021-01-12T07:41:51Z
day: '11'
doi: 10.1007/11761679_24
extern: 1
intvolume: ' 4004'
month: '07'
page: 391 - 408
publication_status: published
publisher: Springer
publist_id: '3465'
quality_controlled: 0
status: public
title: 'Luby Rackoff ciphers from weak round functions '
type: conference
volume: 4004
year: '2006'
...
---
_id: '3215'
abstract:
- lang: eng
text: 'Most cryptographic primitives such as encryption, authentication or secret
sharing require randomness. Usually one assumes that perfect randomness is available,
but those primitives might also be realized under weaker assumptions. In this
work we continue the study of building secure cryptographic primitives from imperfect
random sources initiated by Dodis and Spencer (FOCS’02). Their main result shows
that there exists a (high-entropy) source of randomness allowing for perfect encryption
of a bit, and yet from which one cannot extract even a single weakly random bit,
separating encryption from extraction. Our main result separates encryption from
2-out-2 secret sharing (both in the information-theoretic and in the computational
settings): any source which can be used to achieve one-bit encryption also can
be used for 2-out-2 secret sharing of one bit, but the converse is false, even
for high-entropy sources. Therefore, possibility of extraction strictly implies
encryption, which in turn strictly implies 2-out-2 secret sharing.'
acknowledgement: Supported in part by NSF career award CCR-0133806 and NSF grant CCR-0311095.
Supported by the Swiss National Science Foundation, project No. 200020-103847/1.
alternative_title:
- LNCS
author:
- first_name: Yevgeniy
full_name: Dodis, Yevgeniy
last_name: Dodis
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Bartosz
full_name: Przydatek, Bartosz
last_name: Przydatek
citation:
ama: 'Dodis Y, Pietrzak KZ, Przydatek B. Separating sources for encryption and secret
sharing. In: Vol 3876. Springer; 2006:601-616. doi:10.1007/11681878_31'
apa: 'Dodis, Y., Pietrzak, K. Z., & Przydatek, B. (2006). Separating sources
for encryption and secret sharing (Vol. 3876, pp. 601–616). Presented at the TCC:
Theory of Cryptography Conference, Springer. https://doi.org/10.1007/11681878_31'
chicago: Dodis, Yevgeniy, Krzysztof Z Pietrzak, and Bartosz Przydatek. “Separating
Sources for Encryption and Secret Sharing,” 3876:601–16. Springer, 2006. https://doi.org/10.1007/11681878_31.
ieee: 'Y. Dodis, K. Z. Pietrzak, and B. Przydatek, “Separating sources for encryption
and secret sharing,” presented at the TCC: Theory of Cryptography Conference,
2006, vol. 3876, pp. 601–616.'
ista: 'Dodis Y, Pietrzak KZ, Przydatek B. 2006. Separating sources for encryption
and secret sharing. TCC: Theory of Cryptography Conference, LNCS, vol. 3876, 601–616.'
mla: Dodis, Yevgeniy, et al. Separating Sources for Encryption and Secret Sharing.
Vol. 3876, Springer, 2006, pp. 601–16, doi:10.1007/11681878_31.
short: Y. Dodis, K.Z. Pietrzak, B. Przydatek, in:, Springer, 2006, pp. 601–616.
conference:
name: 'TCC: Theory of Cryptography Conference'
date_created: 2018-12-11T12:02:04Z
date_published: 2006-04-11T00:00:00Z
date_updated: 2021-01-12T07:41:51Z
day: '11'
doi: 10.1007/11681878_31
extern: 1
intvolume: ' 3876'
month: '04'
page: 601 - 616
publication_status: published
publisher: Springer
publist_id: '3466'
quality_controlled: 0
status: public
title: Separating sources for encryption and secret sharing
type: conference
volume: 3876
year: '2006'
...
---
_id: '3216'
abstract:
- lang: eng
text: |-
We prove a new upper bound on the advantage of any adversary for distinguishing the encrypted CBC-MAC (EMAC) based on random permutations from a random function. Our proof uses techniques recently introduced in [BPR05], which again were inspired by [DGH + 04].
The bound we prove is tight — in the sense that it matches the advantage of known attacks up to a constant factor — for a wide range of the parameters: let n denote the block-size, q the number of queries the adversary is allowed to make and ℓ an upper bound on the length (i.e. number of blocks) of the messages, then for ℓ ≤ 2 n/8 and q≥ł2 the advantage is in the order of q 2/2 n (and in particular independent of ℓ). This improves on the previous bound of q 2ℓΘ(1/ln ln ℓ)/2 n from [BPR05] and matches the trivial attack (which thus is basically optimal) where one simply asks random queries until a collision is found.
acknowledgement: Part of this work is supported by the Commission of the European
Communities through the IST program under contract IST-2002-507932 ECRYPT.
alternative_title:
- LNCS
author:
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Pietrzak KZ. A tight bound for EMAC. In: Vol 4052. Springer; 2006:168-179.
doi:10.1007/11787006_15'
apa: 'Pietrzak, K. Z. (2006). A tight bound for EMAC (Vol. 4052, pp. 168–179). Presented
at the ICALP: Automata, Languages and Programming, Springer. https://doi.org/10.1007/11787006_15'
chicago: Pietrzak, Krzysztof Z. “A Tight Bound for EMAC,” 4052:168–79. Springer,
2006. https://doi.org/10.1007/11787006_15.
ieee: 'K. Z. Pietrzak, “A tight bound for EMAC,” presented at the ICALP: Automata,
Languages and Programming, 2006, vol. 4052, pp. 168–179.'
ista: 'Pietrzak KZ. 2006. A tight bound for EMAC. ICALP: Automata, Languages and
Programming, LNCS, vol. 4052, 168–179.'
mla: Pietrzak, Krzysztof Z. A Tight Bound for EMAC. Vol. 4052, Springer,
2006, pp. 168–79, doi:10.1007/11787006_15.
short: K.Z. Pietrzak, in:, Springer, 2006, pp. 168–179.
conference:
name: 'ICALP: Automata, Languages and Programming'
date_created: 2018-12-11T12:02:04Z
date_published: 2006-07-28T00:00:00Z
date_updated: 2021-01-12T07:41:52Z
day: '28'
doi: 10.1007/11787006_15
extern: 1
intvolume: ' 4052'
month: '07'
page: 168 - 179
publication_status: published
publisher: Springer
publist_id: '3463'
quality_controlled: 0
status: public
title: A tight bound for EMAC
type: conference
volume: 4052
year: '2006'
...
---
_id: '3217'
abstract:
- lang: eng
text: |-
To prove that a secure key-agreement protocol exists one must at least show P ≠NP. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom functions is secure against at least two adaptive queries must falsify the decisional Diffie-Hellman assumption, a standard assumption from public-key cryptography. Hence proving any of this two seemingly unrelated statements would require a significant breakthrough. We show that at least one of the two statements is true.
To our knowledge this gives the first positive cryptographic result (namely that composition implies some weak adaptive security) which holds in Minicrypt, but not in Cryptomania, i.e. under the assumption that one-way functions exist, but public-key cryptography does not.
acknowledgement: Author was supported during the writing of this work by the Swiss
National Science Foundation, project No. 200020-103847/1. Part of this work is supported
by the Commission of the European Communities through the IST program under contract
IST-2002-507932
alternative_title:
- LNCS
author:
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Pietrzak KZ. Composition implies adaptive security in minicrypt. In: Vol 4004.
Springer; 2006:328-338. doi:10.1007/11761679_20'
apa: 'Pietrzak, K. Z. (2006). Composition implies adaptive security in minicrypt
(Vol. 4004, pp. 328–338). Presented at the EUROCRYPT: Theory and Applications
of Cryptographic Techniques, Springer. https://doi.org/10.1007/11761679_20'
chicago: Pietrzak, Krzysztof Z. “Composition Implies Adaptive Security in Minicrypt,”
4004:328–38. Springer, 2006. https://doi.org/10.1007/11761679_20.
ieee: 'K. Z. Pietrzak, “Composition implies adaptive security in minicrypt,” presented
at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2006, vol.
4004, pp. 328–338.'
ista: 'Pietrzak KZ. 2006. Composition implies adaptive security in minicrypt. EUROCRYPT:
Theory and Applications of Cryptographic Techniques, LNCS, vol. 4004, 328–338.'
mla: Pietrzak, Krzysztof Z. Composition Implies Adaptive Security in Minicrypt.
Vol. 4004, Springer, 2006, pp. 328–38, doi:10.1007/11761679_20.
short: K.Z. Pietrzak, in:, Springer, 2006, pp. 328–338.
conference:
name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
date_created: 2018-12-11T12:02:04Z
date_published: 2006-07-11T00:00:00Z
date_updated: 2021-01-12T07:41:52Z
day: '11'
doi: 10.1007/11761679_20
extern: 1
intvolume: ' 4004'
month: '07'
page: 328 - 338
publication_status: published
publisher: Springer
publist_id: '3464'
quality_controlled: 0
status: public
title: Composition implies adaptive security in minicrypt
type: conference
volume: 4004
year: '2006'
...
---
_id: '11117'
abstract:
- lang: eng
text: Over the last years it has become evident that the nuclear envelope (NE) is
more than a passive membrane barrier that separates the nucleus from the cytoplasm.
The NE not only controls the trafficking of macromolecules between the nucleoplasm
and the cytosol, but also provides anchoring sites for chromosomes and cytoskeleton
to the nuclear periphery. Targeting of chromatin to the NE might actually be part
of gene expression regulation in eukaryotes. Mutations in certain NE proteins
are associated with a diversity of human diseases, including muscular dystrophy,
neuropathy, lipodistrophy, torsion dystonia and the premature aging condition
progeria. Despite the importance of the NE for cell division and differentiation,
relatively little is known about its biogenesis and its role in human diseases.
It is our goal to provide a comprehensive view of the NE and to discuss possible
implications of NE-associated changes for gene expression, chromatin organization
and signal transduction.
article_processing_charge: No
article_type: review
author:
- first_name: M. A.
full_name: D’Angelo, M. A.
last_name: D’Angelo
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: D’Angelo MA, Hetzer M. The role of the nuclear envelope in cellular organization.
Cellular and Molecular Life Sciences. 2006;63(3):316-332. doi:10.1007/s00018-005-5361-3
apa: D’Angelo, M. A., & Hetzer, M. (2006). The role of the nuclear envelope
in cellular organization. Cellular and Molecular Life Sciences. Springer
Nature. https://doi.org/10.1007/s00018-005-5361-3
chicago: D’Angelo, M. A., and Martin Hetzer. “The Role of the Nuclear Envelope in
Cellular Organization.” Cellular and Molecular Life Sciences. Springer
Nature, 2006. https://doi.org/10.1007/s00018-005-5361-3.
ieee: M. A. D’Angelo and M. Hetzer, “The role of the nuclear envelope in cellular
organization,” Cellular and Molecular Life Sciences, vol. 63, no. 3. Springer
Nature, pp. 316–332, 2006.
ista: D’Angelo MA, Hetzer M. 2006. The role of the nuclear envelope in cellular
organization. Cellular and Molecular Life Sciences. 63(3), 316–332.
mla: D’Angelo, M. A., and Martin Hetzer. “The Role of the Nuclear Envelope in Cellular
Organization.” Cellular and Molecular Life Sciences, vol. 63, no. 3, Springer
Nature, 2006, pp. 316–32, doi:10.1007/s00018-005-5361-3.
short: M.A. D’Angelo, M. Hetzer, Cellular and Molecular Life Sciences 63 (2006)
316–332.
date_created: 2022-04-07T07:56:22Z
date_published: 2006-01-02T00:00:00Z
date_updated: 2022-07-18T08:56:58Z
day: '02'
doi: 10.1007/s00018-005-5361-3
extern: '1'
external_id:
pmid:
- '16389459'
intvolume: ' 63'
issue: '3'
keyword:
- Cell Biology
- Cellular and Molecular Neuroscience
- Pharmacology
- Molecular Biology
- Molecular Medicine
language:
- iso: eng
month: '01'
oa_version: None
page: 316-332
pmid: 1
publication: Cellular and Molecular Life Sciences
publication_identifier:
eissn:
- 1420-9071
issn:
- 1420-682X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: The role of the nuclear envelope in cellular organization
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 63
year: '2006'
...
---
_id: '11118'
abstract:
- lang: eng
text: Nuclear pore complexes are multiprotein channels that span the double lipid
bilayer of the nuclear envelope. How new pores are inserted into the intact nuclear
envelope of proliferating and differentiating eukaryotic cells is unknown. We
found that the Nup107-160 complex was incorporated into assembly sites in the
nuclear envelope from both the nucleoplasmic and the cytoplasmic sides. Nuclear
pore insertion required the generation of Ran guanosine triphosphate in the nuclear
and cytoplasmic compartments. Newly formed nuclear pore complexes did not contain
structural components of preexisting pores, suggesting that they can form de novo.
article_processing_charge: No
article_type: original
author:
- first_name: Maximiliano A.
full_name: D'Angelo, Maximiliano A.
last_name: D'Angelo
- first_name: Daniel J.
full_name: Anderson, Daniel J.
last_name: Anderson
- first_name: Erin
full_name: Richard, Erin
last_name: Richard
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: D’Angelo MA, Anderson DJ, Richard E, Hetzer M. Nuclear pores form de novo from
both sides of the nuclear envelope. Science. 2006;312(5772):440-443. doi:10.1126/science.1124196
apa: D’Angelo, M. A., Anderson, D. J., Richard, E., & Hetzer, M. (2006). Nuclear
pores form de novo from both sides of the nuclear envelope. Science. American
Association for the Advancement of Science. https://doi.org/10.1126/science.1124196
chicago: D’Angelo, Maximiliano A., Daniel J. Anderson, Erin Richard, and Martin
Hetzer. “Nuclear Pores Form de Novo from Both Sides of the Nuclear Envelope.”
Science. American Association for the Advancement of Science, 2006. https://doi.org/10.1126/science.1124196.
ieee: M. A. D’Angelo, D. J. Anderson, E. Richard, and M. Hetzer, “Nuclear pores
form de novo from both sides of the nuclear envelope,” Science, vol. 312,
no. 5772. American Association for the Advancement of Science, pp. 440–443, 2006.
ista: D’Angelo MA, Anderson DJ, Richard E, Hetzer M. 2006. Nuclear pores form de
novo from both sides of the nuclear envelope. Science. 312(5772), 440–443.
mla: D’Angelo, Maximiliano A., et al. “Nuclear Pores Form de Novo from Both Sides
of the Nuclear Envelope.” Science, vol. 312, no. 5772, American Association
for the Advancement of Science, 2006, pp. 440–43, doi:10.1126/science.1124196.
short: M.A. D’Angelo, D.J. Anderson, E. Richard, M. Hetzer, Science 312 (2006) 440–443.
date_created: 2022-04-07T07:56:32Z
date_published: 2006-04-21T00:00:00Z
date_updated: 2022-07-18T08:57:04Z
day: '21'
doi: 10.1126/science.1124196
extern: '1'
external_id:
pmid:
- '16627745'
intvolume: ' 312'
issue: '5772'
keyword:
- Multidisciplinary
language:
- iso: eng
month: '04'
oa_version: None
page: 440-443
pmid: 1
publication: Science
publication_identifier:
issn:
- 0036-8075
- 1095-9203
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nuclear pores form de novo from both sides of the nuclear envelope
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 312
year: '2006'
...
---
_id: '11119'
article_processing_charge: No
author:
- first_name: J. Robin
full_name: Harris, J. Robin
last_name: Harris
- first_name: Geneviève
full_name: Almouzni, Geneviève
last_name: Almouzni
- first_name: Doris
full_name: Kirschner, Doris
last_name: Kirschner
- first_name: Daniela
full_name: Dimitrova, Daniela
last_name: Dimitrova
- first_name: Jeffrey A.
full_name: Nickerson, Jeffrey A.
last_name: Nickerson
- first_name: Jean
full_name: Underwood, Jean
last_name: Underwood
- first_name: Stefan
full_name: Wagner, Stefan
last_name: Wagner
- first_name: Barbara
full_name: Korbei, Barbara
last_name: Korbei
- first_name: Roland
full_name: Foisner, Roland
last_name: Foisner
- first_name: Tobias C.
full_name: Walther, Tobias C.
last_name: Walther
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
- first_name: Reiner
full_name: Peters, Reiner
last_name: Peters
- first_name: Ivan
full_name: Walev, Ivan
last_name: Walev
- first_name: Anton I. P. M.
full_name: de Kroon, Anton I. P. M.
last_name: de Kroon
- first_name: Rutger W. H. M.
full_name: Staffhorst, Rutger W. H. M.
last_name: Staffhorst
- first_name: Ben
full_name: de Kruijff, Ben
last_name: de Kruijff
- first_name: Koert N. J.
full_name: Burger, Koert N. J.
last_name: Burger
- first_name: Luis Eduardo Soares
full_name: Netto, Luis Eduardo Soares
last_name: Netto
- first_name: Eric
full_name: Bertrand, Eric
last_name: Bertrand
- first_name: Judie B.
full_name: Alimonti, Judie B.
last_name: Alimonti
- first_name: Arnold H.
full_name: Greenberg, Arnold H.
last_name: Greenberg
- first_name: Jinnan
full_name: Xiao, Jinnan
last_name: Xiao
- first_name: Anuradha
full_name: Pradhan, Anuradha
last_name: Pradhan
- first_name: Yuechueng
full_name: Liu, Yuechueng
last_name: Liu
- first_name: Jacques
full_name: Paiement, Jacques
last_name: Paiement
- first_name: Robin
full_name: Young, Robin
last_name: Young
- first_name: Félix M.
full_name: Goñi, Félix M.
last_name: Goñi
- first_name: Ana-Victoria
full_name: Villar, Ana-Victoria
last_name: Villar
- first_name: F.-Xabier
full_name: Contreras, F.-Xabier
last_name: Contreras
- first_name: Alicia
full_name: Alonso, Alicia
last_name: Alonso
- first_name: Brian J.
full_name: Peter, Brian J.
last_name: Peter
- first_name: Ian G.
full_name: Mills, Ian G.
last_name: Mills
- first_name: Matthew K.
full_name: Higgins, Matthew K.
last_name: Higgins
- first_name: William J.
full_name: Brown, William J.
last_name: Brown
- first_name: K.
full_name: Chambers, K.
last_name: Chambers
- first_name: A.
full_name: Doody, A.
last_name: Doody
- first_name: C. Yan
full_name: Cheng, C. Yan
last_name: Cheng
- first_name: Dolores D.
full_name: Mruk, Dolores D.
last_name: Mruk
- first_name: Chunhong
full_name: Yang, Chunhong
last_name: Yang
- first_name: Helmut
full_name: Kirchhoff, Helmut
last_name: Kirchhoff
- first_name: Winfried
full_name: Haase, Winfried
last_name: Haase
- first_name: Stephanie
full_name: Boggasch, Stephanie
last_name: Boggasch
- first_name: Harald
full_name: Paulsen, Harald
last_name: Paulsen
- first_name: Julie
full_name: Benesova, Julie
last_name: Benesova
- first_name: Sven-T.
full_name: Liffers, Sven-T.
last_name: Liffers
- first_name: Matthias
full_name: Rögner, Matthias
last_name: Rögner
- first_name: Ya-sheng
full_name: Gao, Ya-sheng
last_name: Gao
- first_name: Elizabeth
full_name: Sztul, Elizabeth
last_name: Sztul
- first_name: Meinolf
full_name: Thiemann, Meinolf
last_name: Thiemann
- first_name: H. Dariush
full_name: Fahimi, H. Dariush
last_name: Fahimi
- first_name: Robert
full_name: Gniadecki, Robert
last_name: Gniadecki
- first_name: Barbara
full_name: Gajkowska, Barbara
last_name: Gajkowska
- first_name: Susan L.
full_name: Bane, Susan L.
last_name: Bane
- first_name: John F.
full_name: Hess, John F.
last_name: Hess
- first_name: John C.
full_name: Voss, John C.
last_name: Voss
- first_name: Paul G.
full_name: Fitzgerald, Paul G.
last_name: Fitzgerald
- first_name: Shin-ichi
full_name: Hisanaga, Shin-ichi
last_name: Hisanaga
- first_name: Takahiro
full_name: Sasaki, Takahiro
last_name: Sasaki
- first_name: Kenji
full_name: Uéda, Kenji
last_name: Uéda
- first_name: Terrence
full_name: Town, Terrence
last_name: Town
- first_name: Jun
full_name: Tan, Jun
last_name: Tan
- first_name: Nathaniel G. N.
full_name: Milton, Nathaniel G. N.
last_name: Milton
- first_name: Richard
full_name: Chi, Richard
last_name: Chi
- first_name: Thomas C. S.
full_name: Keller, Thomas C. S.
last_name: Keller
- first_name: Marina
full_name: Kriajevska, Marina
last_name: Kriajevska
- first_name: Igor
full_name: Bronstein, Igor
last_name: Bronstein
- first_name: Eugene
full_name: Lukanidin, Eugene
last_name: Lukanidin
- first_name: David F.
full_name: Holmes, David F.
last_name: Holmes
- first_name: Karl E.
full_name: Kadler, Karl E.
last_name: Kadler
citation:
ama: 'Harris JR, Almouzni G, Kirschner D, et al. In Vitro Techniques. In: Harris
R, Graham J, Rickwood D, eds. Cell Biology Protocols. Chichester, UK: Wiley;
2006:201-378. doi:10.1002/0470033487.ch6'
apa: 'Harris, J. R., Almouzni, G., Kirschner, D., Dimitrova, D., Nickerson, J. A.,
Underwood, J., … Kadler, K. E. (2006). In Vitro Techniques. In R. Harris, J. Graham,
& D. Rickwood (Eds.), Cell Biology Protocols (pp. 201–378). Chichester,
UK: Wiley. https://doi.org/10.1002/0470033487.ch6'
chicago: 'Harris, J. Robin, Geneviève Almouzni, Doris Kirschner, Daniela Dimitrova,
Jeffrey A. Nickerson, Jean Underwood, Stefan Wagner, et al. “In Vitro Techniques.”
In Cell Biology Protocols, edited by Robin Harris, John Graham, and David
Rickwood, 201–378. Chichester, UK: Wiley, 2006. https://doi.org/10.1002/0470033487.ch6.'
ieee: 'J. R. Harris et al., “In Vitro Techniques,” in Cell Biology Protocols,
R. Harris, J. Graham, and D. Rickwood, Eds. Chichester, UK: Wiley, 2006, pp. 201–378.'
ista: 'Harris JR, Almouzni G, Kirschner D, Dimitrova D, Nickerson JA, Underwood
J, Wagner S, Korbei B, Foisner R, Walther TC, Hetzer M, Peters R, Walev I, de
Kroon AIPM, Staffhorst RWHM, de Kruijff B, Burger KNJ, Netto LES, Bertrand E,
Alimonti JB, Greenberg AH, Xiao J, Pradhan A, Liu Y, Paiement J, Young R, Goñi
FM, Villar A-V, Contreras F-X, Alonso A, Peter BJ, Mills IG, Higgins MK, Brown
WJ, Chambers K, Doody A, Cheng CY, Mruk DD, Yang C, Kirchhoff H, Haase W, Boggasch
S, Paulsen H, Benesova J, Liffers S-T, Rögner M, Gao Y, Sztul E, Thiemann M, Fahimi
HD, Gniadecki R, Gajkowska B, Bane SL, Hess JF, Voss JC, Fitzgerald PG, Hisanaga
S, Sasaki T, Uéda K, Town T, Tan J, Milton NGN, Chi R, Keller TCS, Kriajevska
M, Bronstein I, Lukanidin E, Holmes DF, Kadler KE. 2006.In Vitro Techniques. In:
Cell Biology Protocols. , 201–378.'
mla: Harris, J. Robin, et al. “In Vitro Techniques.” Cell Biology Protocols,
edited by Robin Harris et al., Wiley, 2006, pp. 201–378, doi:10.1002/0470033487.ch6.
short: J.R. Harris, G. Almouzni, D. Kirschner, D. Dimitrova, J.A. Nickerson, J.
Underwood, S. Wagner, B. Korbei, R. Foisner, T.C. Walther, M. Hetzer, R. Peters,
I. Walev, A.I.P.M. de Kroon, R.W.H.M. Staffhorst, B. de Kruijff, K.N.J. Burger,
L.E.S. Netto, E. Bertrand, J.B. Alimonti, A.H. Greenberg, J. Xiao, A. Pradhan,
Y. Liu, J. Paiement, R. Young, F.M. Goñi, A.-V. Villar, F.-X. Contreras, A. Alonso,
B.J. Peter, I.G. Mills, M.K. Higgins, W.J. Brown, K. Chambers, A. Doody, C.Y.
Cheng, D.D. Mruk, C. Yang, H. Kirchhoff, W. Haase, S. Boggasch, H. Paulsen, J.
Benesova, S.-T. Liffers, M. Rögner, Y. Gao, E. Sztul, M. Thiemann, H.D. Fahimi,
R. Gniadecki, B. Gajkowska, S.L. Bane, J.F. Hess, J.C. Voss, P.G. Fitzgerald,
S. Hisanaga, T. Sasaki, K. Uéda, T. Town, J. Tan, N.G.N. Milton, R. Chi, T.C.S.
Keller, M. Kriajevska, I. Bronstein, E. Lukanidin, D.F. Holmes, K.E. Kadler, in:,
R. Harris, J. Graham, D. Rickwood (Eds.), Cell Biology Protocols, Wiley, Chichester,
UK, 2006, pp. 201–378.
date_created: 2022-04-07T07:56:42Z
date_published: 2006-01-27T00:00:00Z
date_updated: 2022-07-18T08:57:08Z
day: '27'
doi: 10.1002/0470033487.ch6
editor:
- first_name: Robin
full_name: Harris, Robin
last_name: Harris
- first_name: John
full_name: Graham, John
last_name: Graham
- first_name: David
full_name: Rickwood, David
last_name: Rickwood
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 201-378
place: Chichester, UK
publication: Cell Biology Protocols
publication_identifier:
eisbn:
- '9780470033487 '
isbn:
- '9780470847589 '
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: In Vitro Techniques
type: book_chapter
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
year: '2006'
...
---
_id: '8488'
abstract:
- lang: eng
text: We demonstrate for different protein samples that three-dimensional HNCO and
HNCA correlation spectra may be recorded in a few minutes acquisition time using
the band-selective excitation short-transient sequences presented here. This opens
new perspectives for the NMR structural investigation of unstable protein samples
and real-time site-resolved studies of protein kinetics.
article_processing_charge: No
article_type: original
author:
- first_name: Paul
full_name: Schanda, Paul
id: 7B541462-FAF6-11E9-A490-E8DFE5697425
last_name: Schanda
orcid: 0000-0002-9350-7606
- first_name: Hélène
full_name: Van Melckebeke, Hélène
last_name: Van Melckebeke
- first_name: Bernhard
full_name: Brutscher, Bernhard
last_name: Brutscher
citation:
ama: Schanda P, Van Melckebeke H, Brutscher B. Speeding up three-dimensional protein
NMR experiments to a few minutes. Journal of the American Chemical Society.
2006;128(28):9042-9043. doi:10.1021/ja062025p
apa: Schanda, P., Van Melckebeke, H., & Brutscher, B. (2006). Speeding up three-dimensional
protein NMR experiments to a few minutes. Journal of the American Chemical
Society. American Chemical Society. https://doi.org/10.1021/ja062025p
chicago: Schanda, Paul, Hélène Van Melckebeke, and Bernhard Brutscher. “Speeding
up Three-Dimensional Protein NMR Experiments to a Few Minutes.” Journal of
the American Chemical Society. American Chemical Society, 2006. https://doi.org/10.1021/ja062025p.
ieee: P. Schanda, H. Van Melckebeke, and B. Brutscher, “Speeding up three-dimensional
protein NMR experiments to a few minutes,” Journal of the American Chemical
Society, vol. 128, no. 28. American Chemical Society, pp. 9042–9043, 2006.
ista: Schanda P, Van Melckebeke H, Brutscher B. 2006. Speeding up three-dimensional
protein NMR experiments to a few minutes. Journal of the American Chemical Society.
128(28), 9042–9043.
mla: Schanda, Paul, et al. “Speeding up Three-Dimensional Protein NMR Experiments
to a Few Minutes.” Journal of the American Chemical Society, vol. 128,
no. 28, American Chemical Society, 2006, pp. 9042–43, doi:10.1021/ja062025p.
short: P. Schanda, H. Van Melckebeke, B. Brutscher, Journal of the American Chemical
Society 128 (2006) 9042–9043.
date_created: 2020-09-18T10:13:36Z
date_published: 2006-06-21T00:00:00Z
date_updated: 2021-01-12T08:19:37Z
day: '21'
doi: 10.1021/ja062025p
extern: '1'
intvolume: ' 128'
issue: '28'
keyword:
- Colloid and Surface Chemistry
- Biochemistry
- General Chemistry
- Catalysis
language:
- iso: eng
month: '06'
oa_version: None
page: 9042-9043
publication: Journal of the American Chemical Society
publication_identifier:
issn:
- 0002-7863
- 1520-5126
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
status: public
title: Speeding up three-dimensional protein NMR experiments to a few minutes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 128
year: '2006'
...
---
_id: '8489'
abstract:
- lang: eng
text: Structure elucidation of proteins by either NMR or X‐ray crystallography often
requires the screening of a large number of samples for promising protein constructs
and optimum solution conditions. For large‐scale screening of protein samples
in solution, robust methods are needed that allow a rapid assessment of the folding
of a polypeptide under diverse sample conditions. Here we present HET‐SOFAST NMR,
a highly sensitive new method for semi‐quantitative characterization of the structural
compactness and heterogeneity of polypeptide chains in solution. On the basis
of one‐dimensional 1H HET‐SOFAST NMR data, obtained on well‐folded, molten globular,
partially‐ and completely unfolded proteins, we define empirical thresholds that
can be used as quantitative benchmarks for protein compactness. For 15N‐enriched
protein samples, two‐dimensional 1H‐15N HET‐SOFAST correlation spectra provide
site‐specific information about the structural heterogeneity along the polypeptide
chain.
article_processing_charge: No
article_type: original
author:
- first_name: Paul
full_name: Schanda, Paul
id: 7B541462-FAF6-11E9-A490-E8DFE5697425
last_name: Schanda
orcid: 0000-0002-9350-7606
- first_name: Vincent
full_name: Forge, Vincent
last_name: Forge
- first_name: Bernhard
full_name: Brutscher, Bernhard
last_name: Brutscher
citation:
ama: Schanda P, Forge V, Brutscher B. HET-SOFAST NMR for fast detection of structural
compactness and heterogeneity along polypeptide chains. Magnetic Resonance
in Chemistry. 2006;44(S1):S177-S184. doi:10.1002/mrc.1825
apa: Schanda, P., Forge, V., & Brutscher, B. (2006). HET-SOFAST NMR for fast
detection of structural compactness and heterogeneity along polypeptide chains.
Magnetic Resonance in Chemistry. Wiley. https://doi.org/10.1002/mrc.1825
chicago: Schanda, Paul, Vincent Forge, and Bernhard Brutscher. “HET-SOFAST NMR for
Fast Detection of Structural Compactness and Heterogeneity along Polypeptide Chains.”
Magnetic Resonance in Chemistry. Wiley, 2006. https://doi.org/10.1002/mrc.1825.
ieee: P. Schanda, V. Forge, and B. Brutscher, “HET-SOFAST NMR for fast detection
of structural compactness and heterogeneity along polypeptide chains,” Magnetic
Resonance in Chemistry, vol. 44, no. S1. Wiley, pp. S177–S184, 2006.
ista: Schanda P, Forge V, Brutscher B. 2006. HET-SOFAST NMR for fast detection of
structural compactness and heterogeneity along polypeptide chains. Magnetic Resonance
in Chemistry. 44(S1), S177–S184.
mla: Schanda, Paul, et al. “HET-SOFAST NMR for Fast Detection of Structural Compactness
and Heterogeneity along Polypeptide Chains.” Magnetic Resonance in Chemistry,
vol. 44, no. S1, Wiley, 2006, pp. S177–84, doi:10.1002/mrc.1825.
short: P. Schanda, V. Forge, B. Brutscher, Magnetic Resonance in Chemistry 44 (2006)
S177–S184.
date_created: 2020-09-18T10:13:42Z
date_published: 2006-07-06T00:00:00Z
date_updated: 2021-01-12T08:19:37Z
day: '06'
doi: 10.1002/mrc.1825
extern: '1'
intvolume: ' 44'
issue: S1
language:
- iso: eng
month: '07'
oa_version: None
page: S177-S184
publication: Magnetic Resonance in Chemistry
publication_identifier:
issn:
- 0749-1581
- 1097-458X
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: HET-SOFAST NMR for fast detection of structural compactness and heterogeneity
along polypeptide chains
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 44
year: '2006'
...
---
_id: '8490'
abstract:
- lang: eng
text: We demonstrate the feasibility of recording 1H–15N correlation spectra of
proteins in only one second of acquisition time. The experiment combines recently
proposed SOFAST-HMQC with Hadamard-type 15N frequency encoding. This allows site-resolved
real-time NMR studies of kinetic processes in proteins with an increased time
resolution. The sensitivity of the experiment is sufficient to be applicable to
a wide range of molecular systems available at millimolar concentration on a high
magnetic field spectrometer.
article_processing_charge: No
article_type: original
author:
- first_name: Paul
full_name: Schanda, Paul
id: 7B541462-FAF6-11E9-A490-E8DFE5697425
last_name: Schanda
orcid: 0000-0002-9350-7606
- first_name: Bernhard
full_name: Brutscher, Bernhard
last_name: Brutscher
citation:
ama: Schanda P, Brutscher B. Hadamard frequency-encoded SOFAST-HMQC for ultrafast
two-dimensional protein NMR. Journal of Magnetic Resonance. 2006;178(2):334-339.
doi:10.1016/j.jmr.2005.10.007
apa: Schanda, P., & Brutscher, B. (2006). Hadamard frequency-encoded SOFAST-HMQC
for ultrafast two-dimensional protein NMR. Journal of Magnetic Resonance.
Elsevier. https://doi.org/10.1016/j.jmr.2005.10.007
chicago: Schanda, Paul, and Bernhard Brutscher. “Hadamard Frequency-Encoded SOFAST-HMQC
for Ultrafast Two-Dimensional Protein NMR.” Journal of Magnetic Resonance.
Elsevier, 2006. https://doi.org/10.1016/j.jmr.2005.10.007.
ieee: P. Schanda and B. Brutscher, “Hadamard frequency-encoded SOFAST-HMQC for ultrafast
two-dimensional protein NMR,” Journal of Magnetic Resonance, vol. 178,
no. 2. Elsevier, pp. 334–339, 2006.
ista: Schanda P, Brutscher B. 2006. Hadamard frequency-encoded SOFAST-HMQC for ultrafast
two-dimensional protein NMR. Journal of Magnetic Resonance. 178(2), 334–339.
mla: Schanda, Paul, and Bernhard Brutscher. “Hadamard Frequency-Encoded SOFAST-HMQC
for Ultrafast Two-Dimensional Protein NMR.” Journal of Magnetic Resonance,
vol. 178, no. 2, Elsevier, 2006, pp. 334–39, doi:10.1016/j.jmr.2005.10.007.
short: P. Schanda, B. Brutscher, Journal of Magnetic Resonance 178 (2006) 334–339.
date_created: 2020-09-18T10:13:51Z
date_published: 2006-02-01T00:00:00Z
date_updated: 2021-01-12T08:19:38Z
day: '01'
doi: 10.1016/j.jmr.2005.10.007
extern: '1'
intvolume: ' 178'
issue: '2'
keyword:
- Nuclear and High Energy Physics
- Biophysics
- Biochemistry
- Condensed Matter Physics
language:
- iso: eng
month: '02'
oa_version: None
page: 334-339
publication: Journal of Magnetic Resonance
publication_identifier:
issn:
- 1090-7807
publication_status: published
publisher: Elsevier
status: public
title: Hadamard frequency-encoded SOFAST-HMQC for ultrafast two-dimensional protein
NMR
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 178
year: '2006'
...
---
_id: '8513'
article_processing_charge: No
article_type: original
author:
- first_name: Vadim
full_name: Kaloshin, Vadim
id: FE553552-CDE8-11E9-B324-C0EBE5697425
last_name: Kaloshin
orcid: 0000-0002-6051-2628
- first_name: Maria
full_name: Saprykina, Maria
last_name: Saprykina
citation:
ama: Kaloshin V, Saprykina M. Generic 3-dimensional volume-preserving diffeomorphisms
with superexponential growth of number of periodic orbits. Discrete & Continuous
Dynamical Systems - A. 2006;15(2):611-640. doi:10.3934/dcds.2006.15.611
apa: Kaloshin, V., & Saprykina, M. (2006). Generic 3-dimensional volume-preserving
diffeomorphisms with superexponential growth of number of periodic orbits. Discrete
& Continuous Dynamical Systems - A. American Institute of Mathematical
Sciences (AIMS). https://doi.org/10.3934/dcds.2006.15.611
chicago: Kaloshin, Vadim, and Maria Saprykina. “Generic 3-Dimensional Volume-Preserving
Diffeomorphisms with Superexponential Growth of Number of Periodic Orbits.” Discrete
& Continuous Dynamical Systems - A. American Institute of Mathematical
Sciences (AIMS), 2006. https://doi.org/10.3934/dcds.2006.15.611.
ieee: V. Kaloshin and M. Saprykina, “Generic 3-dimensional volume-preserving diffeomorphisms
with superexponential growth of number of periodic orbits,” Discrete &
Continuous Dynamical Systems - A, vol. 15, no. 2. American Institute of Mathematical
Sciences (AIMS), pp. 611–640, 2006.
ista: Kaloshin V, Saprykina M. 2006. Generic 3-dimensional volume-preserving diffeomorphisms
with superexponential growth of number of periodic orbits. Discrete & Continuous
Dynamical Systems - A. 15(2), 611–640.
mla: Kaloshin, Vadim, and Maria Saprykina. “Generic 3-Dimensional Volume-Preserving
Diffeomorphisms with Superexponential Growth of Number of Periodic Orbits.” Discrete
& Continuous Dynamical Systems - A, vol. 15, no. 2, American Institute
of Mathematical Sciences (AIMS), 2006, pp. 611–40, doi:10.3934/dcds.2006.15.611.
short: V. Kaloshin, M. Saprykina, Discrete & Continuous Dynamical Systems -
A 15 (2006) 611–640.
date_created: 2020-09-18T10:48:43Z
date_published: 2006-05-01T00:00:00Z
date_updated: 2021-01-12T08:19:48Z
day: '01'
doi: 10.3934/dcds.2006.15.611
extern: '1'
intvolume: ' 15'
issue: '2'
language:
- iso: eng
month: '05'
oa_version: None
page: 611-640
publication: Discrete & Continuous Dynamical Systems - A
publication_identifier:
issn:
- 1553-5231
publication_status: published
publisher: American Institute of Mathematical Sciences (AIMS)
quality_controlled: '1'
status: public
title: Generic 3-dimensional volume-preserving diffeomorphisms with superexponential
growth of number of periodic orbits
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2006'
...
---
_id: '8514'
abstract:
- lang: eng
text: We study the extent to which the Hausdorff dimension of a compact subset of
an infinite-dimensional Banach space is affected by a typical mapping into a finite-dimensional
space. It is possible that the dimension drops under all such mappings, but the
amount by which it typically drops is controlled by the ‘thickness exponent’ of
the set, which was defined by Hunt and Kaloshin (Nonlinearity12 (1999), 1263–1275).
More precisely, let $X$ be a compact subset of a Banach space $B$ with thickness
exponent $\tau$ and Hausdorff dimension $d$. Let $M$ be any subspace of the (locally)
Lipschitz functions from $B$ to $\mathbb{R}^{m}$ that contains the space of bounded
linear functions. We prove that for almost every (in the sense of prevalence)
function $f \in M$, the Hausdorff dimension of $f(X)$ is at least $\min\{ m, d
/ (1 + \tau) \}$. We also prove an analogous result for a certain part of the
dimension spectra of Borel probability measures supported on $X$. The factor $1
/ (1 + \tau)$ can be improved to $1 / (1 + \tau / 2)$ if $B$ is a Hilbert space.
Since dimension cannot increase under a (locally) Lipschitz function, these theorems
become dimension preservation results when $\tau = 0$. We conjecture that many
of the attractors associated with the evolution equations of mathematical physics
have thickness exponent zero. We also discuss the sharpness of our results in
the case $\tau > 0$.
article_processing_charge: No
article_type: original
author:
- first_name: WILLIAM
full_name: OTT, WILLIAM
last_name: OTT
- first_name: BRIAN
full_name: HUNT, BRIAN
last_name: HUNT
- first_name: Vadim
full_name: Kaloshin, Vadim
id: FE553552-CDE8-11E9-B324-C0EBE5697425
last_name: Kaloshin
orcid: 0000-0002-6051-2628
citation:
ama: OTT W, HUNT B, Kaloshin V. The effect of projections on fractal sets and measures
in Banach spaces. Ergodic Theory and Dynamical Systems. 2006;26(3):869-891.
doi:10.1017/s0143385705000714
apa: OTT, W., HUNT, B., & Kaloshin, V. (2006). The effect of projections on
fractal sets and measures in Banach spaces. Ergodic Theory and Dynamical Systems.
Cambridge University Press. https://doi.org/10.1017/s0143385705000714
chicago: OTT, WILLIAM, BRIAN HUNT, and Vadim Kaloshin. “The Effect of Projections
on Fractal Sets and Measures in Banach Spaces.” Ergodic Theory and Dynamical
Systems. Cambridge University Press, 2006. https://doi.org/10.1017/s0143385705000714.
ieee: W. OTT, B. HUNT, and V. Kaloshin, “The effect of projections on fractal sets
and measures in Banach spaces,” Ergodic Theory and Dynamical Systems, vol.
26, no. 3. Cambridge University Press, pp. 869–891, 2006.
ista: OTT W, HUNT B, Kaloshin V. 2006. The effect of projections on fractal sets
and measures in Banach spaces. Ergodic Theory and Dynamical Systems. 26(3), 869–891.
mla: OTT, WILLIAM, et al. “The Effect of Projections on Fractal Sets and Measures
in Banach Spaces.” Ergodic Theory and Dynamical Systems, vol. 26, no. 3,
Cambridge University Press, 2006, pp. 869–91, doi:10.1017/s0143385705000714.
short: W. OTT, B. HUNT, V. Kaloshin, Ergodic Theory and Dynamical Systems 26 (2006)
869–891.
date_created: 2020-09-18T10:48:52Z
date_published: 2006-06-01T00:00:00Z
date_updated: 2021-01-12T08:19:48Z
day: '01'
doi: 10.1017/s0143385705000714
extern: '1'
intvolume: ' 26'
issue: '3'
language:
- iso: eng
month: '06'
oa_version: None
page: 869-891
publication: Ergodic Theory and Dynamical Systems
publication_identifier:
issn:
- 0143-3857
- 1469-4417
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
status: public
title: The effect of projections on fractal sets and measures in Banach spaces
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 26
year: '2006'
...
---
_id: '8515'
abstract:
- lang: eng
text: "We consider the evolution of a set carried by a space periodic incompressible
stochastic flow in a Euclidean space. We\r\nreport on three main results obtained
in [8, 9, 10] concerning long time behaviour for a typical realization of the
stochastic flow. First, at time t most of the particles are at a distance of order
√t away from the origin. Moreover, we prove a Central Limit Theorem for the evolution
of a measure carried by the flow, which holds for almost every realization of
the flow. Second, we show the existence of a zero measure full Hausdorff dimension
set of points, which\r\nescape to infinity at a linear rate. Third, in the 2-dimensional
case, we study the set of points visited by the original set by time t. Such a
set, when scaled down by the factor of t, has a limiting non random shape."
article_processing_charge: No
author:
- first_name: Vadim
full_name: Kaloshin, Vadim
id: FE553552-CDE8-11E9-B324-C0EBE5697425
last_name: Kaloshin
orcid: 0000-0002-6051-2628
- first_name: D.
full_name: DOLGOPYAT, D.
last_name: DOLGOPYAT
- first_name: L.
full_name: KORALOV, L.
last_name: KORALOV
citation:
ama: 'Kaloshin V, DOLGOPYAT D, KORALOV L. Long time behaviour of periodic stochastic
flows. In: XIVth International Congress on Mathematical Physics. World
Scientific; 2006:290-295. doi:10.1142/9789812704016_0026'
apa: 'Kaloshin, V., DOLGOPYAT, D., & KORALOV, L. (2006). Long time behaviour
of periodic stochastic flows. In XIVth International Congress on Mathematical
Physics (pp. 290–295). Lisbon, Portugal: World Scientific. https://doi.org/10.1142/9789812704016_0026'
chicago: Kaloshin, Vadim, D. DOLGOPYAT, and L. KORALOV. “Long Time Behaviour of
Periodic Stochastic Flows.” In XIVth International Congress on Mathematical
Physics, 290–95. World Scientific, 2006. https://doi.org/10.1142/9789812704016_0026.
ieee: V. Kaloshin, D. DOLGOPYAT, and L. KORALOV, “Long time behaviour of periodic
stochastic flows,” in XIVth International Congress on Mathematical Physics,
Lisbon, Portugal, 2006, pp. 290–295.
ista: Kaloshin V, DOLGOPYAT D, KORALOV L. 2006. Long time behaviour of periodic
stochastic flows. XIVth International Congress on Mathematical Physics. International
Congress on Mathematical Physics, 290–295.
mla: Kaloshin, Vadim, et al. “Long Time Behaviour of Periodic Stochastic Flows.”
XIVth International Congress on Mathematical Physics, World Scientific,
2006, pp. 290–95, doi:10.1142/9789812704016_0026.
short: V. Kaloshin, D. DOLGOPYAT, L. KORALOV, in:, XIVth International Congress
on Mathematical Physics, World Scientific, 2006, pp. 290–295.
conference:
end_date: 2003-08-02
location: Lisbon, Portugal
name: International Congress on Mathematical Physics
start_date: 2003-07-28
date_created: 2020-09-18T10:48:59Z
date_published: 2006-03-01T00:00:00Z
date_updated: 2021-01-12T08:19:49Z
day: '01'
doi: 10.1142/9789812704016_0026
extern: '1'
language:
- iso: eng
month: '03'
oa_version: None
page: 290-295
publication: XIVth International Congress on Mathematical Physics
publication_identifier:
isbn:
- '9789812562012'
- '9789812704016'
publication_status: published
publisher: World Scientific
quality_controlled: '1'
status: public
title: Long time behaviour of periodic stochastic flows
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2006'
...