A Novel Approach to Fast Image Filtering Algorithm of Infrared Images based on Intro Sort Algorithm

Computer Science – Computer Vision and Pattern Recognition

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

7 pages

Scientific paper

In this study we investigate the fast image filtering algorithm based on Intro sort algorithm and fast noise reduction of infrared images. Main feature of the proposed approach is that no prior knowledge of noise required. It is developed based on Stefan- Boltzmann law and the Fourier law. We also investigate the fast noise reduction approach that has advantage of less computation load. In addition, it can retain edges, details, text information even if the size of the window increases. Intro sort algorithm begins with Quick sort and switches to heap sort when the recursion depth exceeds a level based on the number of elements being sorted. This approach has the advantage of fast noise reduction by reducing the comparison time. It also significantly speed up the noise reduction process and can apply to real-time image processing. This approach will extend the Infrared images applications for medicine and video conferencing.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Novel Approach to Fast Image Filtering Algorithm of Infrared Images based on Intro Sort Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Novel Approach to Fast Image Filtering Algorithm of Infrared Images based on Intro Sort Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Novel Approach to Fast Image Filtering Algorithm of Infrared Images based on Intro Sort Algorithm will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-253653

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.