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

SCM Repository

[diderot] Diff of /trunk/TODO
ViewVC logotype

Diff of /trunk/TODO

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

revision 1389, Fri Jun 24 17:54:44 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 17  Line 19 
19  ability to emit/track/record variables into dynamically re-sized  ability to emit/track/record variables into dynamically re-sized
20  runtime output buffer  runtime output buffer
21    
22  tensor fields: convolution on general tensor images (order > 1)  [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
# Line 31  Line 35 
35    
36  [GLK:1] Proper handling of stabilize method  [GLK:1] Proper handling of stabilize method
37    
38    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
42  sequences are implemented this should be removed: the operation is not  sequences are implemented this should be removed: the operation is not
# Line 39  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:4] 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:5] ability to declare a field so that probe positions are  [GLK:6] 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 77  Line 83 
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    
# Line 86  Line 92 
92  e.g. using output of iso2d.diderot for one isovalue to seed the input  e.g. using output of iso2d.diderot for one isovalue to seed the input
93  to another invocation of the same program)  to another invocation of the same program)
94    
95  Communication between strands: they have to be able to learn each  [Lamont working on this] Communication between strands: they have to
96  other's state (at the previous iteration).  Early version of this can  be able to learn each other's state (at the previous iteration).
97  have the network of neighbors be completely static (for running one  Early version of this can have the network of neighbors be completely
98  strand/pixel image computations).  Later version with strands moving  static (for running one strand/pixel image computations).  Later
99  through the domain will require some spatial data structure to  version with strands moving through the domain will require some
100  optimize discovery of neighbors.  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 128  Line 140 
140  LONG TERM ==================== (make Diderot more interesting/attractive from  LONG TERM ==================== (make Diderot more interesting/attractive from
141  ==============================  a research standpoint)  ==============================  a research standpoint)
142    
 [GLK:6] Want code-generation working for tensors of order three.  
 Order three matters for edge detection in scalar fields (to get  
 second derivatives of gradient magnitude), second derivatives  
 of vector fields (for some feature extraction), and first  
 derivatives of diffusion tensor fields.  
   
143  IL support for higher-order tensor values (matrices, etc).  IL support for higher-order tensor values (matrices, etc).
144      tensor construction [DONE]      tensor construction [DONE]
145      tensor indexing [DONE]      tensor indexing [DONE]
# Line 204  Line 210 
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
212    
 Tensors of order 3 (e.g. gradients of diffusion tensor fields, or  
 hessians of vector fields) and order 4 (e.g. Hessians of diffusion  
 tensor fields).  
   
213  representation of tensor symmetry  representation of tensor symmetry
214  (have to identify the group of index permutations that are symmetries)  (have to identify the group of index permutations that are symmetries)
215    

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

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