• Communication, Networking, Signal and Image Processing (CS)
    5 KB (726 words) - 10:35, 10 March 2015
  • Communication, Networking, Signal and Image Processing (CS)
    4 KB (632 words) - 11:05, 10 March 2015
  • Communication, Networking, Signal and Image Processing (CS)
    4 KB (643 words) - 11:16, 10 March 2015
  • Communication, Networking, Signal and Image Processing (CS)
    4 KB (616 words) - 10:19, 13 September 2013
  • Communication, Networking, Signal and Image Processing (CS)
    4 KB (572 words) - 10:24, 10 March 2015
  • Communication, Networking, Signal and Image Processing (CS)
    5 KB (748 words) - 01:01, 10 March 2015
  • Communication, Networking, Signal and Image Processing (CS)
    2 KB (358 words) - 10:33, 13 September 2013
  • Communication, Networking, Signal and Image Processing (CS)
    4 KB (638 words) - 10:34, 13 September 2013
  • Communication, Networking, Signal and Image Processing (CS)
    2 KB (248 words) - 10:34, 13 September 2013
  • Communication, Networking, Signal and Image Processing (CS)
    2 KB (282 words) - 10:34, 13 September 2013
  • Communication, Networking, Signal and Image Processing (CS) [[Image:ECE600 Note Chebyshev inequality1.jpg]]
    3 KB (532 words) - 10:36, 13 September 2013
  • Communication, Networking, Signal and Image Processing (CS)
    4 KB (655 words) - 10:36, 13 September 2013
  • Communication, Networking, Signal and Image Processing (CS)
    2 KB (357 words) - 10:36, 13 September 2013
  • Communication, Networking, Signal and Image Processing (CS)
    2 KB (234 words) - 10:37, 13 September 2013
  • Communication, Networking, Signal and Image Processing (CS)
    3 KB (496 words) - 10:37, 13 September 2013
  • Communication, Networking, Signal and Image Processing (CS)
    4 KB (547 words) - 16:40, 30 March 2015
  • [[Category:image processing]] Communication, Networking, Signal and Image Processing (CS)
    4 KB (665 words) - 10:25, 13 September 2013
  • ...ECE Ph.D. Qualifying Exam]] in "Communication, Networks, Signal, and Image Processing" (CS) = "Communication, Networks, Signal, and Image Processing" (CS)- Question 1, August 2011
    5 KB (711 words) - 09:05, 27 July 2012
  • Communication, Networking, Signal and Image Processing (CS) "Communication, Networks, Signal, and Image Processing" (CS)- Question 1, August 2011
    8 KB (1,247 words) - 10:29, 13 September 2013
  • Communication, Networking, Signal and Image Processing (CS) "Communication, Networks, Signal, and Image Processing" (CS)- Question 1, August 2011
    6 KB (932 words) - 10:30, 13 September 2013
  • [[Category:image processing]] Communication, Networking, Signal and Image Processing (CS)
    8 KB (1,206 words) - 10:31, 13 September 2013
  • [[Category:image processing]] Communication, Networking, Signal and Image Processing (CS)
    17 KB (2,783 words) - 01:51, 31 March 2015
  • =[[ECE438|ECE 438]] Digital Signal Processing with Applications= ...can be ordered from: [http://www.lulu.com/product/paperback/digital-signal-processing-in-a-nutshell-%28volume-i%29/18805904 lulu.com].
    24 KB (3,522 words) - 07:28, 24 August 2012
  • ...w, the error of each implementation is relatively small. However, because processing time is the primary constraint for my application, the I opted for the LUT [[Image:Atan_discretization2.png | 720x560px]]
    8 KB (1,176 words) - 15:15, 1 May 2016
  • [[Image:Reg_transfer_diagram.JPG | 720x560px]] [[Image:RGB565_transfer.PNG | 720x560px]]
    3 KB (533 words) - 15:17, 1 May 2016
  • File:BonusLab.zip
    To be used in multirate image processing lab (ECE 438).
    (950 KB) - 02:24, 1 December 2012
  • [[Category:image processing]]
    16 members (0 subcategories, 0 files) - 08:00, 9 April 2013
  • [[Category:Image ProcessingECE 637Spring2013Bouman]] =[[ECE637]]: Digital Image Processing I, [[Intro_Prof_Charles_Bouman|Prof. Bouman]], Spring 2013=
    3 KB (370 words) - 11:22, 29 May 2013
  • * FIR: consider a sliding window pass through the entire image defined as h(m,n) that could be transformed to H(u,v) * Rule of thumb:If your image doesn't look like it is doing what it is supposed to do, it is probably wro
    3 KB (555 words) - 08:09, 9 April 2013
  • ...se the (0,0) frequency component, and thus giving us the illusion that the image is smoother.''' :A2 - As mentioned from A1. Given X~U(-0.5,0.5), to correctly display the image using 8bit gray scale, you have to make the best out of your quantization l
    5 KB (957 words) - 08:11, 9 April 2013
  • ...to make the actual component and push and pop the pixels from the original image. ...i][j] which contains 0 or 1. My question is that how to print it out as an image.
    2 KB (377 words) - 08:10, 9 April 2013
  • ;'''Q: My image looks really dark after correction. [[Category:Image ProcessingECE 637Spring2013Bouman]]
    1 KB (218 words) - 08:11, 9 April 2013
  • ...t is to be produced in section 4 for the projection coefficients. It is an image or a regular plot? The paragraph describing that procedure is not too clear ...gray scale, compared to the example. And in this case when you project an image onto this eigenvector, the projection coefficient will have the opposite si
    3 KB (496 words) - 08:12, 9 April 2013
  • [[Category:image processing]] =Digital Image Processing 1 ([[ECE637]])=
    618 B (72 words) - 12:51, 26 January 2013
  • ...e finished the lecture with a short illustration of a research-level image processing problem for which discrete distributions are useful.
    2 KB (307 words) - 10:26, 4 February 2013
  • '''Post Processing''' The image to the right shows the various components of a patten recognition system.
    4 KB (691 words) - 16:46, 15 February 2013
  • Digital Image Processing I - Lecture 2 - CTFT and CSFT [[Category:Image ProcessingECE 637Spring2013Bouman]]
    233 B (29 words) - 10:06, 13 February 2013
  • Digital Image Processing I - Lecture 3 - CSFT and Rep and Comb Relations [[Category:Image ProcessingECE 637Spring2013Bouman]]
    251 B (34 words) - 10:07, 13 February 2013
  • Digital Image Processing I - Lecture 4 - Optical Imaging Systems [[Category:Image ProcessingECE 637Spring2013Bouman]]
    243 B (29 words) - 10:07, 13 February 2013
  • Digital Image Processing I - Lecture 5 - Helical Scan Multislice CT and PET [[Category:Image ProcessingECE 637Spring2013Bouman]]
    254 B (33 words) - 10:07, 13 February 2013
  • Digital Image Processing I - Lecture 6 - Tomographic Reconstruction [[Category:Image ProcessingECE 637Spring2013Bouman]]
    246 B (30 words) - 10:08, 13 February 2013
  • Digital Image Processing I - Lecture 7 - FPB and Magnetic Resonance Imaging [[Category:Image ProcessingECE 637Spring2013Bouman]]
    254 B (33 words) - 10:09, 13 February 2013
  • Digital Image Processing I - Lecture 8 - MRI Reconstruction [[Category:Image ProcessingECE 637Spring2013Bouman]]
    238 B (29 words) - 10:11, 13 February 2013
  • Digital Image Processing I - Lecture 9 - MRI and C-programming [[Category:Image ProcessingECE 637Spring2013Bouman]]
    241 B (29 words) - 10:12, 13 February 2013
  • Digital Image Processing I - Lecture 10 - C-programming [[Category:Image ProcessingECE 637Spring2013Bouman]]
    235 B (29 words) - 10:13, 13 February 2013
  • Digital Image Processing I - Lecture 11 - DTFT, DSFT, Sampling, and Reconstruction [[Category:Image ProcessingECE 637Spring2013Bouman]]
    261 B (33 words) - 10:14, 13 February 2013
  • [[Category:image processing]] Communication, Networking, Signal and Image Processing (CS)
    3 KB (471 words) - 10:25, 13 September 2013
  • [[Category:image processing]] ...ams|ECE Ph.D. Qualifying Exam]] in Communication Networks Signal and Image processing (CS) =
    4 KB (739 words) - 10:07, 13 September 2013
  • ...lectures_Image_Processing_sLecture_mhossain| "The Bouman Lectures on Image Processing", slectures]]
    1 KB (178 words) - 18:23, 23 March 2014
  • [[Category:image processing]] ...ams|ECE Ph.D. Qualifying Exam]] in Communication Networks Signal and Image processing (CS) =
    2 KB (462 words) - 17:54, 1 May 2017

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood