There are many options to define values for flags, here is a list of known by me: - Hexadecimal: 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, ... - Decimal: 1, 2, 4, 8, 16, 32, 64, 128, ... - Bit Shifting of 1: 1<<0, 1<<1, 1<<2, 1<<3, 1<<4, ... - 2 * previous a=1, b=a*2, c=b*2, d=c*2, e=d*2, ... Do you know any other? Which do you consider as the best, and why? Do you define (give it a name) an empty member (0) in flags?

Yes I did. Error was due to different version of SQLite than I link in system32 directory.

Hi all, I am frustrated after week of searching for reason to unresolved import error from LoadLibrary function trying to load my own DLL compiled with /MD (which uses custom [same computer and same VS2005] compiles of Proj 4, Geos 3.3.1, SpatiaLite 3.0.0 beta1 and SQLite3 - all compiled with /MD as well). I have looked into it using Dependency Walker and the reason surprisingly seems to be kernel32.dll. There are missing following imports: InterlockedCompareExchange InterlockedDecrement InterlockedIncrement InterlockedExchange I do not use those in my code, but for example msvcr80.dll internally does. DLLs work fine on my Vista x64 notebook and also work fine on another x64 Win7, but not on mine - compile machine. I have installed correct redist. and so on, but the main problem is that IT DOES NOT WORK ON DEV MACHINE!!! Did you ever seen this? I can compile it, but can not load it :( I can load separately Proj, Geos and SQLite, but can not load SpatiaLite. My system: Windows 7 x64 Visual Studio 2005 (with needed service packs) Thanks, Dusan

This is exactly what I am looking for. I have it implemented, but there is probably any error in my coding, becouse on borders of result image I have processed pixels from opposite sides of tiles. Do you know about any code that is doing that correctly? Or is it normal? Must be used overlapping of input tiles? Thanks

Some kernels are not separable, some are separable. I would like to make it using FFT, but do not know how...

Yes, for most part are, but exactly that part, where they are not is in my interest. What I need is to understand how to forward transform image and mask, multiply them together and transform result back to 'normal' image. I have made some algorithms, but on borders of tiles I have some errors, so I am interested in any code to look for inspiration...

modified on Monday, August 29, 2011 3:29 PM

Well, Andrew Kirillov has in his library FFT filter, but in convolution filters he does not use them and I need exactly that. Also Christion has made good stuff for beginners, but my question is little more about advanced image processing than about beginner tutorial.

I have not so far, but I'll give it a try... But still, I would prefer any working example programmed in some .Net language or in native C / C++. Thanks...

I am using native C++ to rewrite working stuff, but for testing I use C#. With GDI+ it is nice that BitmapData is same structure in .Net and native GDI+, so it is easy to migrate working code from C# to native C++. Simple convolution is what I have done already, but it is too slow (even wrote in C++) compared to PhotoShop plugins, so I am searching for FFT transform of tiles... Thanks...

EDIT: I have it solved, have found a similar library as that mine and there it is implemented in Java, so I just looked for a way to do it. It is needed to use tile-overlapping, so I modified my code and now it's working... This is that page: http://www.jhlabs.com/[^] Original message: Hi all, does anybody know some good source to learn apply a fast convolution filter to image? I am looking for kernels with 20x20 an bigger and need to process image fast, so I need to learn how to do that using FFT or DFT. I like to use GDI+ in C#. Any suggestion? Thanks in idvance...

modified on Tuesday, August 30, 2011 4:23 AM

Hi all, I am searching the web and can not find any fast way to apply Lens Blur effect like in PhotoShop. For now, I have used convolution matrix with shape drawn to kernel, but it is very slow compared to Photoshop's one. I have read many stuff on net about speeding up 2D Convolution process, but the most interesting seems to be using of GPU, but can not find any example... Another way I can imagine is to use somehow HLSL to modify texture and then convert it back to bitmap, but still do not know how to do that... Can anybody point me into right direction? Thanks in advance...

Aha, OK, thanks, I have overlooked that one...

Hi all, I am working on class to wrapp unmanaged pointer. I am just confused, whether pinning of value struct is needed in C++/CLI, i.e. whether if I will not do it, it can cause some problems. In C#, I am not able to fix structs:

Point pntA = new Point(10, 25);
Point pntB = new Point();

unsafe
{
// Error 4
// You cannot use the fixed statement to take
// the address of an already fixed expression
fixed (Point* ptrA = &pntA, ptrB = &pntB)
{
ptrB->X = ptrA->X;
ptrB->Y = ptrA->Y;
}
}

but, I can simply use address-of operator:

Point pntA = new Point(10, 25);
Point pntB = new Point();

unsafe
{
// Correct
Point* ptrA = &pntA, ptrB = &pntB;
ptrB->X = ptrA->X;
ptrB->Y = ptrA->Y;
}

What is confusing me is that pin_ptr lets me pin structures as well as use address-of operator:

// /clr
generic where T : value struct
T GetValueA(void* ptr)
{
T val = Activator::CreateInstance();

pin_ptr valPtr = &val;
memcpy(valPtr, ptr, sizeof(T));
return val;
}

generic where T : value struct
T GetValueB(void* ptr)
{
T val = Activator::CreateInstance();

memcpy(&val, ptr, sizeof(T));
return val;
}

My questions are: Is pinning needed in C++/CLI functions to fix value struct before using its pointer in unmanaged function? Are value structs allocated in the unmanaged heap? Thanks all, Dusan

Hi all, I am working on class to wrapp unmanaged pointer. I am just confused, whether pinning of value struct is needed in C++/CLI, i.e. whether if I will not do it, it can cause some problems. In C#, I am not able to fix structs:

Point pntA = new Point(10, 25);
Point pntB = new Point();

unsafe
{
// Error 4
// You cannot use the fixed statement to take
// the address of an already fixed expression
fixed (Point* ptrA = &pntA, ptrB = &pntB)
{
ptrB->X = ptrA->X;
ptrB->Y = ptrA->Y;
}
}

but, I can simply use address-of operator:

Point pntA = new Point(10, 25);
Point pntB = new Point();

unsafe
{
// Correct
Point* ptrA = &pntA, ptrB = &pntB;
ptrB->X = ptrA->X;
ptrB->Y = ptrA->Y;
}

What is confusing me is that pin_ptr lets me pin structures as well as use address-of operator:

// /clr
generic where T : value struct
T GetValueA(void* ptr)
{
T val = Activator::CreateInstance();

pin_ptr valPtr = &val;
memcpy(valPtr, ptr, sizeof(T));
return val;
}

generic where T : value struct
T GetValueB(void* ptr)
{
T val = Activator::CreateInstance();

memcpy(&val, ptr, sizeof(T));
return val;
}

My questions are: Is pinning needed in C++/CLI functions to fix value struct before using its pointer in unmanaged function? Are value structs allocated in the unmanaged heap? Thanks all, Dusan

modified on Wednesday, August 3, 2011 12:22 PM