Home My Page Projects Code Snippets Project Openings diderot
Summary Activity Tracker Tasks SCM

SCM Repository

[diderot] Diff of /branches/ein16/TODO
ViewVC logotype

Diff of /branches/ein16/TODO

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1167, Tue May 10 13:32:53 2011 UTC revision 1445, Mon Jul 11 16:21:47 2011 UTC
# Line 1  Line 1 
1    THIS TODO HAS BEEN MOVED TO THE DIDEROT WIKI.  PLEASE USE THAT ONE.
2    
3  NOTE: GLK's approximate ranking of 8 most important tagged with  NOTE: GLK's approximate ranking of 8 most important tagged with
4  [GLK:1], [GLK:2], ...  [GLK:1], [GLK:2], ...
5    
# Line 5  Line 7 
7  SHORT TERM ============= (*needed* for streamlines & tractography)  SHORT TERM ============= (*needed* for streamlines & tractography)
8  ========================  ========================
9    
10  [GLK:3] Add sequence types (needed for evals & evecs)  [GLK:2] Add sequence types (needed for evals & evecs)
11      syntax      syntax
12          types: ty '{' INT '}'          types: ty '{' INT '}'
13          value construction: '{' e1 ',' … ',' en '}'          value construction: '{' e1 ',' … ',' en '}'
14          indexing: e '{' e '}'          indexing: e '{' e '}'
15    
16  [GLK:4] evals & evecs for symmetric tensor[2,2] and  [GLK:3] evals & evecs for symmetric tensor[2,2] and
17  tensor[3,3] (requires sequences)  tensor[3,3] (requires sequences)
18    
19  ability to emit/track/record variables into dynamically re-sized  ability to emit/track/record variables into dynamically re-sized
20  runtime buffer  runtime output buffer
21    
22  tensor fields: convolution on general tensor images  [GLK:4] tensor fields from tensor images: Initially need at least
23    convolution on tensor[2,2] and tensor[3,3] (the same component-wise
24    convolution as for vectors).
25    
26  ========================  ========================
27  SHORT-ISH TERM ========= (to make using Diderot less annoying to  SHORT-ISH TERM ========= (to make using Diderot less annoying to
28  ========================  program in, and slow to execute)  ========================  program in, and slow to execute)
29    
 value-numbering optimization [DONE, but needs more testing]  
   
30  Allow ".ddro" file extensions in addition to ".diderot"  Allow ".ddro" file extensions in addition to ".diderot"
31    
32  Be able to output values of type tensor[2,2] and tensor[3,3]  Be able to output values of type tensor[2,2] and tensor[3,3];
33  (currently only scalars & vectors)  (currently only scalars & vectors).  Want to add some regression tests
34    based on this and currently can't
35    
36  [GLK:1] Add a clamp function, which takes three arguments; either  [GLK:1] Proper handling of stabilize method
 three scalars:  
   clamp(lo, hi, x)  = max(lo, min(hi, x))  
 or three vectors of the same size:  
   clamp(lo, hi, [x,y])  = [max(lo[0], min(hi[0], x)),  
                            max(lo[1], min(hi[1], y))]  
 This would be useful in many current Diderot programs.  
 One question: clamp(x, lo, hi) is the argument order used in OpenCL  
 and other places, but clamp(lo, hi, x) is much more consistent with  
 lerp(lo, hi, x), hence GLK's preference  
37    
38  [GLK:2] Proper handling of stabilize method  Convolution on general tensor images (order > 2)
39    
40  allow "*" to represent "modulate": per-component multiplication of  allow "*" to represent "modulate": per-component multiplication of
41  vectors, and vectors only (not tensors of order 2 or higher).  Once  vectors, and vectors only (not tensors of order 2 or higher).  Once
# Line 51  Line 45 
45  implicit type promotion of integers to reals where reals are  implicit type promotion of integers to reals where reals are
46  required (e.g. not exponentiation "^")  required (e.g. not exponentiation "^")
47    
48  [GLK:5] Save Diderot output to nrrd, instead of "mip.txt"  [Nick working on this] Save Diderot output to nrrd, instead of "mip.txt"
49    For grid of strands, save to similarly-shaped array    For grid of strands, save to similarly-shaped array
50    For list of strands, save to long 1-D (or 2-D for non-scalar output) list    For list of strands, save to long 1-D (or 2-D for non-scalar output) list
51    For ragged things (like tractography output), will need to save both    For ragged things (like tractography output), will need to save both
52      complete list of values, as well as list of start indices and lengths      complete list of values, as well as list of start indices and lengths
53      to index into complete list      to index into complete list
54    
55  [GLK:6] Use of Teem's "hest" command-line parser for getting  [GLK:6] ability to declare a field so that probe positions are
 any input variables that are not defined in the source file  
   
 [GLK:7] ability to declare a field so that probe positions are  
56  *always* "inside"; with various ways of mapping the known image values  *always* "inside"; with various ways of mapping the known image values
57  to non-existant index locations.  One possible syntax emphasizes that  to non-existant index locations.  One possible syntax emphasizes that
58  there is a index mapping function that logically precedes convolution:  there is a index mapping function that logically precedes convolution:
# Line 84  Line 75 
75      rgb = real{3}      rgb = real{3}
76      rgba = real{4}      rgba = real{4}
77    
78    Revisit how images are created within the language.
79    The "load" operator should probably go away, and its strangs
80    that strings are there only as a way to refer to nrrd filenames
81    
82  ==============================  ==============================
83  MEDIUM TERM ================== (*needed* for particles)  MEDIUM TERM ================== (*needed* for particles)
84  ==============================  ==============================
85    
86  run-time birth of strands  [Lamont working on this] run-time birth of strands
87    
88  "initially" supports lists  "initially" supports lists
89    
90  "initially" supports lists of positions output from  "initially" supports lists of positions output from different
91  different initalization Diderot program  initalization Diderot program (or output from the same program;
92    e.g. using output of iso2d.diderot for one isovalue to seed the input
93  Communication between strands: they have to be able to learn each  to another invocation of the same program)
94  other's state (at the previous iteration).  Early version of this can  
95  have the network of neighbors be completely static (for running one  [Lamont working on this] Communication between strands: they have to
96  strand/pixel image computations).  Later version with strands moving  be able to learn each other's state (at the previous iteration).
97  through the domain will require some spatial data structure to  Early version of this can have the network of neighbors be completely
98  optimize discovery of neighbors.  static (for running one strand/pixel image computations).  Later
99    version with strands moving through the domain will require some
100    spatial data structure to optimize discovery of neighbors.
101    
102  ============================  ============================
103  MEDIUM-ISH TERM ============ (to make Diderot more useful/effective)  MEDIUM-ISH TERM ============ (to make Diderot more useful/effective)
104  ============================  ============================
105    
106    [GLK:5] Want code-generation working for tensors of order three.
107    Order three matters for edge detection in scalar fields (to get
108    second derivatives of gradient magnitude), second derivatives
109    of vector fields (for some feature extraction), and first
110    derivatives of diffusion tensor fields.
111    
112  Python/ctypes interface to run-time  Python/ctypes interface to run-time
113    
114  support for Python interop and GUI  support for Python interop and GUI
# Line 113  Line 116 
116  Allow integer exponentiation ("^2") to apply to square matrices,  Allow integer exponentiation ("^2") to apply to square matrices,
117  to represent repeated matrix multiplication  to represent repeated matrix multiplication
118    
 Alow X *= Y, X /= Y, X += Y, X -= Y to mean what they do in C,  
 provided that X*Y, X/Y, X+Y, X-Y are already supported.  
 Nearly every Diderot program would be simplified by this.  
   
119  Put small 1-D and 2-D fields, when reconstructed specifically by tent  Put small 1-D and 2-D fields, when reconstructed specifically by tent
120  and when differentiation is not needed, into faster texture buffers.  and when differentiation is not needed, into faster texture buffers.
121  test/illust-vr.diderot is good example of program that uses multiple  test/illust-vr.diderot is good example of program that uses multiple
122  such 1-D fields basically as lookup-table-based function evaluation  such 1-D fields basically as lookup-table-based function evaluation
123    
 expand trace in mid to low translation  
   
124  extend norm (|exp|) to all tensor types [DONE for vectors and matrices]  extend norm (|exp|) to all tensor types [DONE for vectors and matrices]
125    
126  determinant ("det") for tensor[3,3]  determinant ("det") for tensor[3,3]
# Line 147  Line 144 
144      tensor construction [DONE]      tensor construction [DONE]
145      tensor indexing [DONE]      tensor indexing [DONE]
146      tensor slicing      tensor slicing
     verify that hessians work correctly [DONE]  
147    
148  Better handling of variables that determines the scope of a variable  Better handling of variables that determines the scope of a variable
149  based on its actual use, instead of where the user defined it.  So,  based on its actual use, instead of where the user defined it.  So,
# Line 161  Line 157 
157  (but we should only duplicate over the live-range of the result of the  (but we should only duplicate over the live-range of the result of the
158  conditional.  conditional.
159    
160  [GLK:8] Want: non-trivial field expressions & functions.  [GLK:7] Want: non-trivial field expressions & functions.
161  scalar fields from scalar fields F and G:  scalar fields from scalar fields F and G:
162    field#0(2)[] X = (sin(F) + 1.0)/2;    field#0(2)[] X = (sin(F) + 1.0)/2;
163    field#0(2)[] X = F*G;    field#0(2)[] X = F*G;
# Line 180  Line 176 
176  There is value in having these, even if the differentiation of them is  There is value in having these, even if the differentiation of them is
177  not supported (hence the indication of "field#0" for these above)  not supported (hence the indication of "field#0" for these above)
178    
179    Introduce region types (syntax region(d), where d is the dimension of the
180    region.  One useful operator would be
181            dom : field#k(d)[s] -> region(d)
182    Then the inside test could be written as
183            pos ∈ dom(F)
184    We could further extend this approach to allow geometric definitions of
185    regions.  It might also be useful to do inside tests in world space,
186    instead of image space.
187    
188  co- vs contra- index distinction  co- vs contra- index distinction
189    
190  Permit field composition:  Permit field composition:
# Line 195  Line 200 
200    field#2(3)[] F = bspln3 ⊛ img;    field#2(3)[] F = bspln3 ⊛ img;
201  or, as a tensor product of kernels, one for each axis, e.g.  or, as a tensor product of kernels, one for each axis, e.g.
202    field#0(3)[] F = (bspln3 ⊗ bspln3 ⊗ tent) ⊛ img;    field#0(3)[] F = (bspln3 ⊗ bspln3 ⊗ tent) ⊛ img;
203  This is especially important for things like time-varying data, or  This is especially important for things like time-varying fields
204  other multi-dimensional fields where one axis of the domain is very  and the use of scale-space in field visualization: one axis of the
205  different from the rest, and hence must be treated separately when  must be convolved with a different kernel during probing.
206  it comes to convolution.  What is very unclear is how, in such cases,  What is very unclear is how, in such cases, we should notate the
207  we should notate the gradient, when we only want to differentiate with  gradient, when we only want to differentiate with respect to some
208  respect to some subset of the axes.  One ambitious idea would be:  subset of the axes.  One ambitious idea would be:
209    field#0(3)[] Ft = (bspln3 ⊗ bspln3 ⊗ tent) ⊛ img; // 2D time-varying field    field#0(3)[] Ft = (bspln3 ⊗ bspln3 ⊗ tent) ⊛ img; // 2D time-varying field
210    field#0(2)[] F = lambda([x,y], Ft([x,y,42.0]))    // restriction to time=42.0    field#0(2)[] F = lambda([x,y], Ft([x,y,42.0]))    // restriction to time=42.0
211    vec2 grad = ∇F([x,y]);                            // 2D gradient    vec2 grad = ∇F([x,y]);                            // 2D gradient
# Line 212  Line 217 
217    
218  outer works on all tensors  outer works on all tensors
219    
220    Help for debugging Diderot programs: need to be able to uniquely
221    identify strands, and for particular strands that are known to behave
222    badly, do something like printf or other logging of their computations
223    and updates.
224    
225    Permit writing dimensionally general code: Have some statement of the
226    dimension of the world "W" (or have it be learned from one particular
227    field of interest), and then able to write "vec" instead of
228    "vec2/vec3", and perhaps "tensor[W,W]" instead of
229    "tensor[2,2]/tensor[3,3]"
230    
231    Traits: all things things that have boilerplate code (especially
232    volume rendering) should be expressed in terms of the unique
233    computational core.  Different kinds of streamline/tractography
234    computation will be another example, as well as particle systems.
235    
236  Einstein summation notation  Einstein summation notation
237    
238  "tensor comprehension" (like list comprehension)  "tensor comprehension" (like list comprehension)
239    
240    Fields coming from different sources of data:
241    * triangular or tetrahedral meshes over 2D or 3D domains (of the
242      source produced by finite-element codes; these will come with their
243      own specialized kinds of reconstruction kernels, called "basis
244      functions" in this context)
245    * Large point clouds, with some radial basis function around each point,
246      which will be tuned by parameters of the point (at least one parameter
247      giving some notion of radius)
248    
249  ======================  ======================
250  BUGS =================  BUGS =================
251  ======================  ======================
# Line 225  Line 255 
255  //  uncaught exception Size [size]  //  uncaught exception Size [size]
256  //    raised at c-target/c-target.sml:47.15-47.19  //    raised at c-target/c-target.sml:47.15-47.19
257  //field#4(3)[] F = img ⊛ bspln5;  //field#4(3)[] F = img ⊛ bspln5;
258    

Legend:
Removed from v.1167  
changed lines
  Added in v.1445

root@smlnj-gforge.cs.uchicago.edu
ViewVC Help
Powered by ViewVC 1.0.0