Changes between Version 2 and Version 3 of GPC1_New_Dither
- Timestamp:
- Jul 9, 2009, 10:23:28 PM (17 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
GPC1_New_Dither
v2 v3 7 7 8 8 The image below shows the dither pattern used to image the Fornax cluster in 2008. In this six-pointing dither, regions with no contribution from bad pixels are coded white. Regions with 1-6 bad pointings are colored blue, green, yellow, orange, red, and black. 9 9 [[Image(fornax_dither.png)]] 10 10 11 11 ---- … … 14 14 The above dark image can be used as a map of bad regions on GPC1; this information can be used in turn to engineer dither patterns which minimize the number of bad-pixel overlaps. One such dither pattern is shown here: 15 15 16 [[Image(anneal_3_dither.png)]] 17 18 19 To construct it, I minimized the number of overlapping hotspots in the central 50% of the array. The minimization was achieved using a simulated annealing algorithm. The results of this are shown below. The left plot shows the evaluation function as a function of Temperature (or iteration); low values indicate minimal hotspot overlap. The right plot shows the position of the 6 dither offsets throughout the simulation (one dither point is constrained to lie at 0,0). The red points show the random starting dithers, while the green points show the final, optimized dither locations. 20 16 21 [[Image(anneal.png)]] 22 23 The pointings of this dither pattern are given by 24 25 {{{ 26 N dx (arcmin) dy(arcmin) 27 1 0 0 28 2 0.918 1.137 29 3 3.391 -7.052 30 4 3.900 9.364 31 5 0.745 2.718 32 6 7.522 -16.083 33 }}}
