CFP last date
20 March 2024
Reseach Article

Role of Threshold Value and CSF to Simplify and Render an Image

Published on None 2011 by Vishal Dahiya, Priti Srinivas Sajja
Intelligent Systems and Data Processing
Foundation of Computer Science USA
ICISD - Number 1
None 2011
Authors: Vishal Dahiya, Priti Srinivas Sajja
238c937a-6f7a-449e-8ebe-68e12487e2b6

Vishal Dahiya, Priti Srinivas Sajja . Role of Threshold Value and CSF to Simplify and Render an Image. Intelligent Systems and Data Processing. ICISD, 1 (None 2011), 44-49.

@article{
author = { Vishal Dahiya, Priti Srinivas Sajja },
title = { Role of Threshold Value and CSF to Simplify and Render an Image },
journal = { Intelligent Systems and Data Processing },
issue_date = { None 2011 },
volume = { ICISD },
number = { 1 },
month = { None },
year = { 2011 },
issn = 0975-8887,
pages = { 44-49 },
numpages = 6,
url = { /specialissues/icisd/number1/2317-27/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Special Issue Article
%1 Intelligent Systems and Data Processing
%A Vishal Dahiya
%A Priti Srinivas Sajja
%T Role of Threshold Value and CSF to Simplify and Render an Image
%J Intelligent Systems and Data Processing
%@ 0975-8887
%V ICISD
%N 1
%P 44-49
%D 2011
%I International Journal of Computer Applications
Abstract

In this paper, we present new efficient algorithms that simplify and render an image effectively on the screen. Simplification is required to reduce the complexity of an image and facilitate efficient rendering. First algorithm is based upon the threshold value simplification that is if there will be minor changes in the threshold value produces different percentage of simplification in the same image. The threshold value used here is based on the pixel values of an image. Second algorithm is based on Contrast Sensitivity Function (CSF), where the CSF is determined using luminance value of the image. Both these algorithms produce a simplified image which can be analyzed, processed and communicated efficiently and result in reduced cost of operation based on the images. The article concludes with the comparative results of both the algorithms.

References
  1. Schroeder, W. J., Zarge, J. A., and Lorensen, W. E. “Decimation of Triangle Meshes”. Proceedings of SIGGRAPH 92. In Computer Graphics 26(2) (July 1992), pp. 65–70.
  2. Moenning, C., and Dodgson, N. A. 2003. “A new point cloud simplification algorithm”. Proc. 3rd Int. Conf. on Visualization, Imaging and Image Processing, 1027–1033.
  3. Ciampalini, A., Cignoni, P., Montani, C., and Scopigno, R. “Multiresolution Decimation Based on Global Error”. The Visual Computer, Springer International, 13(5), 1997, pp. 228–246.
  4. Cohen, J., Varshney, A.,Manocha, D., Turk, G.,Weber, H., Agarwal, P., Brooks, F., and WRIGHT, W. “Simplification Envelopes”. Proceedings of SIGGRAPH 96. In Computer Graphics Proceedings, Annual Conference Series, 1996, ACM SIGGRAPH, pp. 119–128.
  5. Peyr´e, G., and Cohen, L. 2003. “Geodesic re-meshing and parameterization using front propagation”. In Proc. 2nd IEEE Workshop on Variational, Geometric and Level Set Methods in Computer Vision.
  6. Hoppe, H., Derose, T., Duchamp, T., Mcdonald, J., and Stuetzle, W. “Mesh Optimization”. Proceedings of SIGGRAPH 93. In Computer Graphics Proceedings, Annual Conference Series,1993, ACM SIGGRAPH, pp. 19–26.
  7. Hoppe, H. “View-Dependent Refinement of Progressive Meshes”. Proceedings of SIGGRAPH 97. In Computer Graphics Proceedings, Annual Conference Series, 1997, ACMSIGGRAPH, pp. 189–198.
  8. Ronfard, R. and Rossignac, J. “Full-Range Approximation of Triangulated Polyhedra”. Proceedings of Eurographics 96. In Computer Graphics Forum, 15(3), August 1996, pp. 67–76.
  9. Garland, M. and Heckbert, P. S. “Surface Simplification using Quadric Error Metrics”. Proceedings of SIGGRAPH 97. In Computer Graphics Proceedings, Annual Conference Series, 1997, ACM SIGGRAPH, pp. 209–216.
  10. LUEBKE, D. and ERIKSON, C. “View-Dependent Simplification of Arbitrary Polygonal Environments”. Proceedings of SIGGRAPH 97. In Computer Graphics Proceedings, Annual Conference Series, 1997, ACM SIGGRAPH, pp. 199–208.
  11. Nebras N. Hasson, S. A. Aljunid, R. Badishah Ahmad, “Simplification of Raster Images to Extract Visual Information” IJCSNS International Journal of Computer Science and Network Security, VOL.6 No.11, November 2006, pp. 49-52.
  12. Rafael C. Gonzalez, Richard E. Woods, Steven L. Eddins, “Digital Image Processing Using MATLAB”. Pearson Education, Inc., 2004.pp.511-529.
  13. Luebke, D., and Hallen, B. 2001. “Perceptually Driven Simplification for Interactive Rendering”. Proceedings of 2001 Eurographics Rendering Workshop, 223-234.
  14. J. Cohen, M. Olano, and D. Manocha, “Appearance Preserving Simplification,” Computer Graphics (Proc. Siggraph 98), vol. 32, ACM Press, New York, 1998, pp. 115-122.
  15. P. Lindstrom and G. Turk, “Image-Driven Simplification,” ACM Trans. Graphics. vol. 19, no. 3, July 2000, pp. 204-241.
Index Terms

Computer Science
Information Sciences

Keywords

CSF simplification Rendering Threshold value