Recent Posts

Pages: [1] 2 3 ... 10
1
General Discussion / After update align_image_stack just exits with no output
« Last post by hurleyman77 on September 22, 2018, 21:26:21  »
I have a Python script I've been using to experiment with automating something. Up to now, the following lines worked just fine:

Code: [Select]
final_command = "D:/Hugin/bin/align_image_stack -a "+results_directory+" -v -v -t 3 -g 5 -m -d -i -x -y -z --corr=0.85 -c 5000 "+temp_directory+"*.jpg"
print("executing", final_command)
os.system(final_command)

Before, align_image_stack would run, write to the terminal, and align images (with varying degrees of success, but that's another matter). Then I noticed there was a more recent version so I downloaded the .msi (I'm on Windows) and installed it to the same directory. Manually typing and running the result "final_command" also worked just fine.

Now, when these lines execute, align_image_stack seems to launch, but writes nothing to the screen, produces no output, aligns no images. I've tried uninstalling and reinstalling, but no luck. This is also true when I just execute align_image_stack from a terminal, without going through the script at all.

Even with "-v -v" I get zero feedback from align_image_stack so I don't really have any way to even troubleshoot what's going on. I attempted performing a similar operation (stacking many nearly identical images) through the GUI without success. But this task has always proved impenetrable with Hugin, so I'm not sure that's useful as diagnostic data.

I was just beginning to have some success stacking lots of images! Any suggestions?
2
General Discussion / Re: Expressing Fault Tree Analysis in BBN
« Last post by uppglassmel on June 07, 2018, 12:06:16  »
Hej Anders,

Thank you for the tips, I will try it out!

Appreciate your time

/Mel
3
General Discussion / Re: Expressing Fault Tree Analysis in BBN
« Last post by Anders L Madsen on June 06, 2018, 07:09:52  »
Hi Mel,

The "generalization" of OR / AND is MAX / MIN. If you encode false/correct as 0, true/failure as 1, and defective as 2 using Numbered nodes and use MIN/MAX instead of AND/OR, then you should be able to encode the desired CPTs.

The idea is that there must be an order on the states and this is enforced by the use of the Numbered node where 0 would reflect the absence of a cause and higher values reflect a more significant presence of the cause.

Let me know if this works for you.
Anders
4
General Discussion / Re: Expressing Fault Tree Analysis in BBN
« Last post by uppglassmel on June 02, 2018, 21:12:10  »
Hi Anders,

I would like to find out, if I have a node C4 with three states (Correct, Defective, Failure) can the NOISY-ADD still be used to implement a multi-state node as a Fault Tree encoded in a BBN.

As an AND gate:
How C4 should affect C1 is that when C4 = Defective or C4 =Failure, C1 should be simulated as

and P(C1=true|C2=true,C3=true, C4=Defective)=0.3*0.3*0.0099=0.000891

and P(C1=true|C2=true,C3=true, C4=Failure)=0.3*0.3*0.0001=0.000009

and that P(C1=False) whenever either one of or all of C4, C3, C2 takes on (False, Correct)

e.g. P(C1=False|C2=False,C3=False, C4=correct)=0.7*0.7*0.99=0.4851,



And also, as an OR gate, how should one encode it?

P(C1=False) when either C4,C3 and C2 takes on (Correct, False)
P(C1=True) when either C4,C3 and C2 takes on (Defective, Failure, True)


Thank you for your time
5
FAQ / Re: How can I use HUGIN in Matlab?
« Last post by Anders L Madsen on May 16, 2018, 10:00:09  »
The method
Code: [Select]
enterFindingis used for entering evidence on a node. There is also a selectState method to set the node to a specific state.

To change the CPT of the a node you need access the table for the node and manipulate its content. The documentation has a complete example building a network (here referring to the .NET API documentation):
http://download.hugin.com/webdocs/manuals/CS/html/d4648875-d41a-783b-d5f4-638df39ee413.htm#Example%202
Hope this helps
6
FAQ / Re: How can I use HUGIN in Matlab?
« Last post by Son Nguyen on May 11, 2018, 15:44:39  »
Thank you, that does help me understand more. I have another question: How can we manipulate the table (CPT) of a child node in the network. EnterFinding seems useless in this aspect. The function GetTable does work, but the result is just a data variable with the table type and when I try to access it, I get the "Array formation and indexing are not allowed on .NET objects." error. For short, How could a CPT be modified before we compile the network?
7
FAQ / Re: How can I use HUGIN in Matlab?
« Last post by Anders L Madsen on May 05, 2018, 19:10:51  »
Quote
Is it possible to assign multiple nodes into an array in MATLAB and then call them from there instead of "one-by-one" method?

Yes, this should not be a problem. I'm not certain of the exact syntex, but using the HUGIN .NET API it should be something like this:

Code: [Select]
Node []array;
array = new Node[2];
array[0]=A;
array[1]=B;
hope this helps
8
FAQ / Re: How can I use HUGIN in Matlab?
« Last post by Son Nguyen on April 30, 2018, 14:44:42  »
Is it possible to assign multiple nodes into an array in MATLAB and then call them from there instead of "one-by-one" method?
For example:
A=d.GetNodeByName('A');
B=d.GetNodeByName('B');
Nodes={A;B};
Here we could call out Nodes(i) with i=1:2 in
Nodes(1).EnterFinding(0,0.1); instead of A.EnterFinding(0,0.1);
This is useful in using a "for" loop.
9
General Discussion / Re: Expressing Fault Tree Analysis in BBN
« Last post by uppglassmel on April 10, 2018, 16:49:47  »
Hej Anders,

Thank you for showing me the 'noisy-add' gate, it worked for an OR-gate as well.

Attached it here in case someone else might be interested in it

Very appreciative of your time!

Mel
10
General Discussion / Re: Expressing Fault Tree Analysis in BBN
« Last post by Anders L Madsen on April 07, 2018, 20:53:23  »
Hello,

If you want P(C1=true|P2=true,P3=true)=0.3*0.3=0.09, then you can achieve this using a "noisy-add" gate as demonstrated in the attached model. You set P2_input=true and P3_input=true to get the desire result.

Hope this helps.
Pages: [1] 2 3 ... 10