|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM160315786 |
| 003 |
DE-627 |
| 005 |
20231223085851.0 |
| 007 |
tu |
| 008 |
231223s2006 xx ||||| 00| ||eng c |
| 028 |
5 |
2 |
|a pubmed24n0535.xml
|
| 035 |
|
|
|a (DE-627)NLM160315786
|
| 035 |
|
|
|a (NLM)16435551
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Jacob, Mathews
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a 3-D shape estimation of DNA molecules from stereo cryo-electron micro-graphs using a projection-steerable snake
|
| 264 |
|
1 |
|c 2006
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ohne Hilfsmittel zu benutzen
|b n
|2 rdamedia
|
| 338 |
|
|
|a Band
|b nc
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 28.02.2006
|
| 500 |
|
|
|a Date Revised 10.12.2019
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status MEDLINE
|
| 520 |
|
|
|a We introduce a three-dimensional (3-D) parametric active contour algorithm for the shape estimation of DNA molecules from stereo cryo-electron micrographs. We estimate the shape by matching the projections of a 3-D global shape model with the micrographs; we choose the global model as a 3-D filament with a B-spline skeleton and a specified radial profile. The active contour algorithm iteratively updates the B-spline coefficients, which requires us to evaluate the projections and match them with the micrographs at every iteration. Since the evaluation of the projections of the global model is computationally expensive, we propose a fast algorithm based on locally approximating it by elongated blob-like templates. We introduce the concept of projection-steerability and derive a projection-steerable elongated template. Since the two-dimensional projections of such a blob at any 3-D orientation can be expressed as a linear combination of a few basis functions, matching the projections of such a 3-D template involves evaluating a weighted sum of inner products between the basis functions and the micrographs. The weights are simple functions of the 3-D orientation and the inner-products are evaluated efficiently by separable filtering. We choose an internal energy term that penalizes the average curvature magnitude. Since the exact length of the DNA molecule is known a priori, we introduce a constraint energy term that forces the curve to have this specified length. The sum of these energies along with the image energy derived from the matching process is minimized using the conjugate gradients algorithm. We validate the algorithm using real, as well as simulated, data and show that it performs well
|
| 650 |
|
4 |
|a Evaluation Study
|
| 650 |
|
4 |
|a Journal Article
|
| 650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
| 650 |
|
7 |
|a DNA
|2 NLM
|
| 650 |
|
7 |
|a 9007-49-2
|2 NLM
|
| 700 |
1 |
|
|a Blu, Thierry
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Vaillant, Cedric
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Maddocks, John H
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Unser, Michael
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
|d 1992
|g 15(2006), 1 vom: 19. Jan., Seite 214-27
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
| 773 |
1 |
8 |
|g volume:15
|g year:2006
|g number:1
|g day:19
|g month:01
|g pages:214-27
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 15
|j 2006
|e 1
|b 19
|c 01
|h 214-27
|