Hi, I need to do some comparison of those algorithms and Im wondering if there are some good books that I should read to know more about it. Can You recommend som titles? -- ________ Pawe Wooszyn http://www.**--****.com/

2 posts
• Page **1** of **1**

- firewall
- MS WORD
- Windows Media
- MS OFFICE OUTLOOK
- graphics
- c
- MS WORD
- Exchange 2000
- Windows
- pocket pc

- 1. DLI Image Compression v2.1

Hello all, A new version of DLI is now available for download. This update has significant compression improvements in both objective measure (up to 10% on MS-SSIM scale) and visually (reduced compression artifacts around edges). More details and comparison results for v2.1 are available on the DLI site. For those interested, the link is sites.google.com/site/dlimagecomp Thank you, Dennis - 2. Does this problem have a name

Hello there, please note that this is NOT a homework assignment question. I am trying to solve this problem, and I cannot believe I do not find it already solved in the literature: I must be looking with the wrong keywords in the wrong place, so thanks in advance to all that will take the time to give me an answer. Let P be a set of N points in the 3d euclidean space (x_i,y_i,z_i), and d_ij the distance of point P_i to point P_j for j not equal to i. Let H_P be the distribution (say the histogram) of d_ij. Problem: given a histogram H_P, find a set of points Q (of arbitrary size) such that norm(H_Q-H_P)< eps in some norm. Question: does this problem have a name at all? can somebody point me to the relevant literature/existing software? Thanks again and sorry if the question is so stupid, but I am banging my head on this one for a couple of weeks already trying to find an efficient solution and am still at a loss. -A

Hi, I need to do some comparison of those algorithms and Im wondering if there are some good books that I should read to know more about it. Can You recommend som titles? -- ________ Pawe Wooszyn http://www.**--****.com/

> I need to do some comparison of those algorithms and Im wondering if In Graphics Gems III: Schumacher, Dale A., General Filtered Image Rescaling.

1.Interpolation algorithms of image resizing

2.GDI+ bilinear interpolation/resizing algorithm

3.resize an image using linear or bicubic spline interpolation not glPixelZoom

Hi, The OpenGL function glPizelZoom allows to use the graphics pipeline to resize a mxn size image to m*k x n*l image using glPixelZoom, which just duplicates the values of the pixels for the fragments. Sometimes this type of magnification is ugly and we would like to magnify an image instead with linear interpolation of nearest neighboring pixel values (I think that this is done in effect when you draw a line with antialiasing). Or perhaps want to magnify nicer with bicubic splines in a smoother way. I am displaying CT and MR image data and want to rapidly display a stack of 1000 images, each 512x512 matrix say, at multiple sizes like 1600x1200 and would like to have smooth faster magnification (interpolation). Can I get this calculation to be done on the graphics card via the opengl api or do I have to implement it on the main cpu with my own algorithm, before the data is sent to the pipeline? Can an algorithm for some kind of filter like this be moved to the graphics pipeline? Thanks Mitchell

4.Is this image resizing algorithm already known?

Hi , I am totally new in image resize algorithm . Please anyone help me to know if there any existing good algorithm or link is there for image resize. I have to do scalling down and colour depth is 24bpp with 480*234 pixels. I woule appreciate if someone help me asap . Thanks Chang

2 posts
• Page **1** of **1**

Users browsing this forum: No registered users and 86 guest