public class ClusterArrivalTimes extends Object implements stream.Processor
3. Find all flagged neighbor pixel for the 'current' pixel. 4. Search for the flagged pixel which has the smallest difference in arrival time. 5. Check if the smallest difference is under a threshold (hardcode at the moment, could be variable, maybe std of all arrival times in cluster so far?) 6. difference < threshold: current pixel gets the same cluster id as the neighbor pixel with this difference difference > threshold: current pixel gets a new cluster ID 7. Search for the next current or seed pixel to cluster. Keep in mind that only shower pixels should be clustered. --> iterate step 3. - 7. until all shower pixels have a cluster ID
Created by lena on 09.02.16.
Modifier and Type | Field and Description |
---|---|
String |
arrivaltimePosKey |
String |
photonchargeKey |
String |
showerKey |
double |
threshold |
Constructor and Description |
---|
ClusterArrivalTimes() |
@Parameter(required=false, description="Threshold to decide whether a pixel belongs to a cluster or not", defaultValue="3") public double threshold
@Parameter(required=true, description="Input key for pixel set (aka shower pixel)") public String showerKey
@Parameter(required=false, description="Input key for arrivaltime positions", defaultValue="arrivalTimePos") public String arrivaltimePosKey
@Parameter(required=false, description="Input key for calculated photon charge", defaultValue="photoncharge") public String photonchargeKey
Copyright © 2019. All rights reserved.