|
kabirbdboy wrote: As i want to make the rectangle,so,i think i need to find the x,y axis of detected area.
How can i detect the x,y axis of detected area
Areas don't have axes, coordinate systems do. What you primarily need are the x and y centroids, extents, possibly area and moments. OpenCV provides a function for calculating the moments of an area, check into it.
You measure democracy by the freedom it gives its dissidents, not the freedom it gives its assimilated conformists.
|
|
|
|
|
my friend sent me a message and I have no idea how to decode it...he claims it's an extension of binary, but this only confuses me more...can anyone help?
363336313645323036383631373636332303734 3638363532303633364637353732363136373635 3230363136453634323037343638363532303646
i apologize if this is in the wrong forum, I tried my best to get it in the right place!
thanks in advance
|
|
|
|
|
I don't see any 9's in the string. Base 9?
You measure democracy by the freedom it gives its dissidents, not the freedom it gives its assimilated conformists.
|
|
|
|
|
Haven't been able to crack it, but some observations:
1) The three parts are almost the same size - Are you sure you aren't missing a digit in the first part? The next observation also seems to suggest that the "3323" near the end should really be "33323"
2) With the exception of a few "45" and "46" occurrences, with with the change mentioned above, the entire message could be read as a series of 3x pairs (30-38). The fact that there are 45s and 46s, but no pairs 40-44, suggest that the 4x values might be separators of some kind. With those taken out, and the leading "3" in each pair removed, the remaining message might be further decoded into something readable.
|
|
|
|
|
I've seen stuff like that when hex files get loaded as binary. I think you're missing a "5" between the two consecutive "3"'s near the end of the first group, though.
Take pairs of characters as hex, translate to ASCII, take pairs of those characters as hex, and translate to ASCII. "can have the courage and the o".
|
|
|
|
|
Wow... What can I say, but...
3734363836313734323737333230363132
3037323635363136433643373932303633
36463646364332303633364636343635
|
|
|
|
|
Wow! You got it!!! Thanks so much!! I couldn't figure it out, I was so lost. This board is the best! I was racking my brain trying to figure this code out!
|
|
|
|
|
Hi,
I am developing a website to actually specific an incoming data (in a form of sms) and then validate it.
It is like some sms registering service that u see on television.
for example they will say something like "SMS < Name>space< NRIC>space< Message> to 7800 and be the first to win attractive prizes!"
I actually have a sms server/gateway that will receive the SMS send by the people and the data will be stored in the database
Some people might sms < Name>space< Message>space< NRIC> instead of < Name>space< NRIC>space< Message>
So, how can i keep a fix format and create an algorithms that will check that the message is in correct format?
For now, i have a database table that stores the keyword of each sms. For example, the keyword stored in the database is "Quiz".
and people will send an SMS with the text "Quiz NRIC answer"
Then i got a script to check the text make sure it tally with the keyword table.
But i cant allow it to check whether NRIC come first or the answer come first.
Sorry for the long message. But trying to explain as detailed as possible
|
|
|
|
|
Assuming NRIC stands for National Registration identity[^].
Do you want to allow users to send SMS in any format or a fixed format? I'd suggest to stick with a specific format something like <Name> space <NRIC> space <Message> . In such case, the following algorithm can be used.
ProcessMessage(Message)
Tokens = Split message with space
name = Token 0
nric = Token 1
message = Token 2
if ValidateName(name) = true and ValidateNric(nric) = true and ValidateMessage(message) = true then
do processing
else
inform user or do other actions
end If you want to have messages in any format, then algorithm like the below will work.
ProcessMessage(Message)
Tokens = Split message with space
for each token in tokens
if token is name then
name = token
else if token is nric then
nric = token
else
message = token
do processing You may need to modify this to handle exceptional situations.
|
|
|
|
|
Hi Navaneeth,
Really appreciate for your reply
Okay mostly likely i would want the messages to be in any format, because I want to create a generic system that allows the staff in the company to use my system if they need any form of SMS registration from people outside.
So i would like my staff to define their own sms format. So which is the best way i can do that?
For example, i am from the HR Department and would like to recruit more staff. So i want an SMS services that interested applicants can register. So the HR will define their sms format through my website.
<pre>Eg . <RECRUIT>space<NRIC>space<Name>space<PositionInterested>
</pre>
The staff defined the above format. So any incoming sms will be check against that format.
And also another department wants to give away lucky draw prizes thru sms as well, so they define their sms format
<pre>eg <LUCKY>space<Name>space<NRIC>space<DateOfBirth></pre>
So now there are 2 defined format. So whatever message that comes in will check whether which message it belongs to.
Okay so for now, do i store the whole strong of sms format into an sms table? If so, how do i check if which message fits which format?
Sorry for another long message
|
|
|
|
|
benjamin yap wrote: So i would like my staff to define their own sms format. So which is the best way i can do that?
In such cases you may need ask senders to prefix an identifier string with the SMS. So if it is recruitment SMS, format will be REC <RECRUIT> space <NRIC> space <Name> space <PositionInterested> . Here, REC is the identifier. You can look at the starting of message and this identifier will help you to determine the type of message. You can have a valid set of identifiers and validate against it.
When user defines their own SMS format, you need to build a regular-expression and keep that in the database. Once you identified the message type using the identifier, you can match the remaining text against the pattern and extract contents.
|
|
|
|
|
Hi Navaneeth,
once again thanks for your reply.
In such cases you may need ask senders to prefix an identifier string with the SMS. So if it is recruitment SMS, format will be REC <RECRUIT> space <NRIC> space <Name> space <PositionInterested>. Here, REC is the identifier. You can look at the starting of message and this identifier will help you to determine the type of message. You can have a valid set of identifiers and validate against it.
Currently this is what i have. I have a database table called "userapp". Below is the schema and the sample data
Userapp
userid(int)
keyword(varchar(50))
103 | Temp
132 | Quiz
150 | Lucky
For each keyword, i have a seperate for them called app_KEYWORD. So it will be app_Temp, app_Quiz, app_Lucky.
try {
ArrayList<String> array = new ArrayList<String>();
String firstword = null;
ResultSet rs1 = null;
ResultSet rs2 = null;
int id = 0;
String sql1 = "SELECT * from userapp";
String sql3 = null;
rs1 = db.SelectDB(sql1);
while (rs1.next()) {
array.add(rs1.getString("keyword"));
}
for (String i : array) {
sql3 = "SELECT * FROM SMSSERVER_IN WHERE TEXT LIKE '" + i + "%'";
ResultSet rs3 = db.SelectDB(sql3);
while (rs3.next()) {
out.print(i);
String sql4 = "Insert into app_" + i + "(originator,text)values(" + rs3.getString("originator") + ",'" + rs3.getString("text") + "')";
db.InsertDB(sql4);
}
String sql5 = "DELETE FROM SMSSERVER_IN WHERE TEXT LIKE'" + i + "%'";
db.DeleteDB(sql5);
}
} catch (Exception ex) {
}
Above is my code to check the identifier and then store it into the correct database.
So instead of storing just 1 keyword, I have to store the whole sms format in it as well?
Also, u mention building a regular expression, how can i create an interface that allows the user who define the format to have their own expression? What kind of form or fields should i display in order to build it.
Thanks
|
|
|
|
|
benjamin yap wrote: Also, u mention building a regular expression, how can i create an interface that allows the user who define the format to have their own expression? What kind of form or fields should i display in order to build it.
I'd create a form with one drop-down list, text-box and a button. User will select the available identifiers from the drop-down and enter expected message format in the text-box. You need to define placeholders like <name>, <NRIC> and <message> etc. Assume user entered <name> space <NRIC> space <message>, you need to find the placeholders in this and convert the string into a valid regular expression and keep in database.
I am very bad at GUI designs and there may be much better way to design GUI than what I suggested.
|
|
|
|
|
Hello,
I have a project from the university to implement the fax protocol (in any language I want).
The idea is to write a software that will be able to receive a fax from a real fax machine. It can be done in any way I want - any language/environment , via modem or some other idea.
I know how the fax protocol works and I wrote a simple implementation already. The problem is actually running it.
I tried writing a C# program using SerialPort class and to access the modem's received data. The problem is that the modem does its own thing upon connecting and doesn't give me control over the received data.
I ran out of ideas at this point.
What else can I do?
Thank you very much.
|
|
|
|
|
ran9 wrote: the modem does its own thing upon connecting and doesn't give me control over the received data.
Can you be more specific about what "its own thing" might be? Is it doing things that other modems don't?
Using modem control strings you can change the behavior of any modem quite a bit, but they aren't as standardized as they used to be. Once upon a time these strings were well defined (the Hayes or AT protocol) and universally implemented, but that's no longer the case. You may need to provide setup routines for each type of modem you plan to use. Your program should initalize the modem to behave as you need it to before the answering mode is enabled.
"A Journey of a Thousand Rest Stops Begins with a Single Movement"
|
|
|
|
|
Roger Wright wrote: Can you be more specific about what "its own thing" might be? Is it doing things that other modems don't?
Thanks for your relpy.
The modem tries to send a connection [data] signal and I would like it to do nothing. Just to give me access to an incoming stream of data.
My program needs to work only my computer which has an Agere HDA modem.
Thanks again.
|
|
|
|
|
Hi,
I think a found a way that might work.
I connected my Nokia phone to the computer and it works as kind of voice modem.
When I answer a call the phone just answers without any processing since it knows to handle only voice.
My problem now is to read the voice samples from the phone/modem.
Any ideas on that?
I tried reading using a SerialPort class but I only get the modem status messages (RING, CONNECTED, etc.) and not the data itself.
Thank you.
|
|
|
|
|
Hi. Could you tell me where I could find information concerning how fax data is encoded?
A friend, who shares my interest in sailing, has suggested I write a program that interprets weatherfax data. (When you're offshore in a small boat, being able to predict the weather is pretty important.) His idea is to receive the weatherfax data on his SSB, route it to his laptop via the modem and and generate a weather map (There already are commercial programs around that do this but he's obviously too cheap to buy one!). As weatherfax transmissions are simplex, there's no handshaking or active error correction involved, so it should be somewhat simpler to program compared to phone-based fax transmissions. Not that I know much about that, I'm just interested in investigating this problem.
Thanks for any suggestions anyone can offer.
|
|
|
|
|
Hello,
I havent found much information about cuckoo hashing apart from the official papers..
I have some questions about it,
1. What would be two good random functions for this type of hashing?
2. What about the rehashing algorithm? Because i'm having troubles with the official specification of it.. which kinda loops between inserting and rehashing infinitely
|
|
|
|
|
I have no experience with cuckoo hashing, so I can't help you there.
If you need to manage hash collisions and have problems with cuckoo or are worried about infinite loops and rehashing, you may consider using chaining[^]. While it's not as performing as cuckoo, it's very simple to implement, scalable, and works like a charm.
2+2=5 for very large amounts of 2
(always loved that one hehe!)
|
|
|
|
|
How about using a modified Jenkins One a at a Time[^]
Instead of starting the hash from zero, I tried getting the first hash using root 0 and the second using the first as a root. The two resulting hash's are pretty well distributed.
Panic, Chaos, Destruction.
My work here is done.
|
|
|
|
|
I'd never heard of cuckoo hashing before; it seems like an interesting concept, though I would be paranoid about worst-case behavior if hash functions are poorly chosen (most hash table algorithms will run in bounded time even with the worst possible hash functions; the worst-case time to add an item to a cuckoo-hash table would seem to be unbounded).
At the expense of some extra book-keeping (probably O(1) in typical cases, but bounded even in the worst case), I would think one could implement a variation of cuckoo hash in which every item was stored at location (H1+k*H2) mod N (as with double hashing), but which provided that if the cell targeted by an item with a certain 'k' contained an item with a sufficiently smaller 'k', the latter item would be displaced. That would tend to balance out the number of search steps required to find any particular item. Provided that H2 is always relatively prime to N, the algorithm should always terminate. If there are never any deletions, the extra book-keeping would be minimal; deletions could complicate things, though.
|
|
|
|
|
How can i calculate space cimplexity
i need explanation more
|
|
|
|
|
i got a tutorial from internate on Space complexity.i show the important part
of this tutorial below. it's may be help u to calculate space complexity.
The space complexity of a program is the number of elementary objects that
this program needs to store during its execution.
For an algorithm T and an input x, DSPACE(T, x) denotes the
number of cells used during the (deterministic) computation T(x).
We will note DSPACE(T) = O(f (n)) if DSPACE(T, x) = O(f (n))
with n = |x | (length of x).
EXAMPLE:1- note: x is an unsorted array
int findMin(int[] x) {
int k = 0; int n = x.length;
for (int i = 1; i < n; i++) {
if (x[i] < x[k]) {
k = i;
}
}
return k;
}
T(findMin, n) = n + 2
T(findMin, n) = O(n)
EXAMPLE:2- note: x is an unsorted array
void multVect(int[] x, int[][] a) {
int k = 0; int n = x.length;
for (int i = 1; i < n; i++) {
for (int j = 1; j < n; j++) {
a[i][j] = x[i] * x[j]
}
}
}
T(multVect, n) = n × n + 2
T(multVect, n) = O(n2)
|
|
|
|
|
hello everybody,i have find a source code of a skin color detection.this program is run well.but i need the explanation of this code.can any body explain this code.i code is given below.....
void Color(IplImage *img);
struct num
{
unsigned char H;
unsigned char S;
unsigned char V;
};
int main( int argc, char** argv )
{
IplImage* pFrame = NULL;
CvCapture* pCapture = NULL;
cvNamedWindow("video",1);
pCapture = cvCaptureFromCAM(-1);
if(pCapture)
{
for(;;)
{
pFrame = cvQueryFrame(pCapture);
Color(pFrame);
// Color_Guass(pFrame);
cvShowImage("video",pFrame);
if(cvWaitKey(10)>=0)
break;
}
cvReleaseCapture(&pCapture);
}
cvDestroyWindow("video");
cvReleaseImage(&pFrame);
return 0;
}
void Color(IplImage *img)
{
int i,j;
IplImage *img_hsv = 0;
img_hsv = cvCreateImage(cvGetSize(img),8,3);
cvCvtColor(img,img_hsv,CV_BGR2HSV);
struct num **bmpdata;
struct num **bmpdata1;
bmpdata = new num*[img->height];
bmpdata1 = new num*[img->height];
//from here i dont understand.please replay me if anybody can understand..........................
for(i=0;i<img->height;i++)
{
bmpdata[i] = new num[img->width];
bmpdata1[i] = new num[img->width];
}
for(i=0;i<img->height;i++)
for(j=0;j<img->width;j++)
{
bmpdata[i][j].H=((uchar*)(img_hsv->imageData + img_hsv->widthStep*i))[j*3];
bmpdata[i][j].S=((uchar*)(img_hsv->imageData + img_hsv->widthStep*i))[j*3+1] ;
bmpdata[i][j].V=((uchar*)(img_hsv->imageData + img_hsv->widthStep*i))[j*3+2];
}
for (i=0;i<img->height;i++)
{
for (j=0;j<img->width;j++)
{
if(bmpdata[i][j].H<=19&&bmpdata[i][j].S>=48)
bmpdata[i][j].H+=0;
else bmpdata[i][j].H=bmpdata[i][j].S=bmpdata[i][j].V=0;
}
}
for (i=1;i<img->height-1;i++)
for (j=1;j<img->width-1;j++)
{
if(bmpdata[i][j].H!=0)
if(bmpdata[i][j-1].H==0||bmpdata[i][j+1].H==0||
bmpdata[i+1][j].H==0||bmpdata[i-1][j].H==0
){
bmpdata1[i][j].H=0;
bmpdata1[i][j].S=0;
bmpdata1[i][j].V=0;
}
else{
bmpdata1[i][j].H+=0;
bmpdata1[i][j].S+=0;
bmpdata1[i][j].V+=0;
}
}
for (i=0;i<img->height;i++)
for (j=0;j<img->width;j++)
{
((uchar*)(img_hsv->imageData + img_hsv->widthStep*i))[j*3]=bmpdata[i][j].H;
((uchar*)(img_hsv->imageData + img_hsv->widthStep*i))[j*3+1]=bmpdata[i][j].S;
((uchar*)(img_hsv->imageData + img_hsv->widthStep*i))[j*3+2]=bmpdata[i][j].V;
}
cvCvtColor(img_hsv,img,CV_HSV2BGR);
cvErode(img,img,NULL,1);
cvDilate(img,img,NULL,1);
}
|
|
|
|
|