i'm struggling with this filter, and i really need someone to show me how i can do it...
just the idea, maybe i'm getting it right or wrong
i need someone to tell me even the idea of it how to go through it
i just noticed that there is no much fuzzy logic questions here & even most of them regarding this area are not answered
Please Please Help me in that
i have those rules
R1: If more of xi are Very High Then En(xi) is Very High.
R2: If more of xi are High Then En(xi) is High.
R3: If more of xi are Medium Then En(xi) is Medium.
R4: If more of xi are Low Then En(xi) is Low.
R5: If more of xi are Very Low Then En(xi) is Very Low.
more is an S function 1/ 1 + exp ^ - (axi -b)
En = sum of all rules multiplied by a constant vector [1 0.8 0.6 0.4 0.2]
xi a pixel in na image ...
how can i do something like this using FIS
i wrote my own code but i see that the En output depends on all the five rules, and the En should be calculates from the rules but how can i apply the IF ... Then ...
it's like recursive ....
this is a fuzzy filter .... and this is the part i cant do, more details are in this paper
what i have done was to find the 3x3 window pixel and i loop through every 9 pixel and i make it the i/p of my FIS filter which i'm not sure of the way i implemented it
and that's my question
i made a matrix which each colum in it represents 9 pixels which is the 3x3 neighborhood so the matrix for my 64x64 image is m x n
m is 9 pixel & i have n =4096
[m,n] = size(NFC);
tri_param = [0.2 0.4 0.6;
0.4 0.6 0.8;
0.6 0.8 1];
trap_param = [-inf -0.2 0.2 0.4;
0.8 1 1.4 inf]
% Applying the Fuzzy inference algorithm
% take the pixel 3x3 window and determine the memership
% degree of each of the pixels within the 5 i/p memebership
for i = 1:1:n
ante_mf = zeros(5,9);
R = zeros(5,1);
xi = NFC(:,i);
ante_mf(1, :) = trapmf(xi',trap_param(1,:));
ante_mf(2, :) = trimf(xi',tri_param(1,:));
ante_mf(3, :) = trimf(xi',tri_param(2,:));
ante_mf(4, :) = trimf(xi',tri_param(3,:));
ante_mf(5, :) = trapmf(xi',trap_param(2,:));
z = xi ./ 9; % the more i/p of xi/total number of xi
for j = 1:5
min_mf = min(min(ante_mf(j,:)));
%indx = find(ante_mf(j,:)==min_mf);
sigValue = sigmf(z(5),[alpha beta]);
MoreMF = S_More(z(5),alpha, beta);
R(j) = min_mf .* MoreMF ;
En(i) = sum (Ck.*R);
please tell me how can i modify this code so it will fit the logic i nthe paper cause this is incomplete cause i didnt apply the Rules on the output,
If more of Xj are Very High, then En (xj) is Very High.
En(xj) is very high is not computed
i really dunno how to explain it ....
i hope i explain it fully
thank you for any help ...
know it's very valuable for me
with hope to receive any help in that with god well
You can think of your watch list as threads that you have bookmarked.
You can add tags, authors, threads, and even search results to your watch list. This way you can easily keep track of topics that you're interested in. To view your watch list, click on the "My Newsreader" link.
To add items to your watch list, click the "add to watch list" link at the bottom of any page.
To add search criteria to your watch list, search for the desired term in the search box. Click on the "Add this search to my watch list" link on the search results page.
You can also add a tag to your watch list by searching for the tag with the directive "tag:tag_name" where tag_name is the name of the tag you would like to watch.
To add an author to your watch list, go to the author's profile page and click on the "Add this author to my watch list" link at the top of the page. You can also add an author to your watch list by going to a thread that the author has posted to and clicking on the "Add this author to my watch list" link. You will be notified whenever the author makes a post.
To add a thread to your watch list, go to the thread page and click the "Add this thread to my watch list" link at the top of the page.
The newsgroups are a worldwide forum that is open to everyone. Newsgroups are used to discuss a huge range of topics, make announcements, and trade files.
Discussions are threaded, or grouped in a way that allows you to read a posted message and all of its replies in chronological order. This makes it easy to follow the thread of the conversation, and to see what’s already been said before you post your own reply or make a new posting.
Newsgroup content is distributed by servers hosted by various organizations on the Internet. Messages are exchanged and managed using open-standard protocols. No single entity “owns” the newsgroups.
There are thousands of newsgroups, each addressing a single topic or area of interest. The MATLAB Central Newsreader posts and displays messages in the comp.soft-sys.matlab newsgroup.
You can use the integrated newsreader at the MATLAB Central website to read and post messages in this newsgroup. MATLAB Central is hosted by MathWorks.
Messages posted through the MATLAB Central Newsreader are seen by everyone using the newsgroups, regardless of how they access the newsgroups. There are several advantages to using MATLAB Central.
Your MATLAB Central account is tied to your MathWorks Account for easy access.
Use the Email Address of Your Choice
The MATLAB Central Newsreader allows you to define an alternative email address as your posting address, avoiding clutter in your primary mailbox and reducing spam.
Most newsgroup spam is filtered out by the MATLAB Central Newsreader.
Messages can be tagged with a relevant label by any signed-in user. Tags can be used as keywords to find particular files of interest, or as a way to categorize your bookmarked postings. You may choose to allow others to view your tags, and you can view or search others’ tags as well as those of the community at large. Tagging provides a way to see both the big trends and the smaller, more obscure ideas and applications.
Setting up watch lists allows you to be notified of updates made to postings selected by author, thread, or any search variable. Your watch list notifications can be sent by email (daily digest or immediate), displayed in My Newsreader, or sent via RSS feed.
You can also select a location from the following list: