Loading...
  • Home
  • Search Results
1267-1268 of 4327 Papers

A NOVEL BLENDING METHOD FOR AUTOMATIC SEAMLESS IMAGE MOSAICING

Published In: INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTER AND ELECTRONICS TECHNOLOGY
Author(s): AHMET HAMDI VAROL , EMRE SUMER

Abstract: An image mosaic is a panoramic image generated by assembling sequential images belong to the same scene . This method is mainly used in mapping applications, the evaluation of the images acquired from unmanned aerial vehicles, and various computer vision applications. In this study, we proposed a novel blending method for automatic seamless image mosaicing from ground level photos taken by an digital camera. For the correction of consistent seams occurred during the mosaicing, we measured the color differences around the overlapping regions. For this purpose, first, we determined the intensity values of image pixels inside and outside the overlapping region boundary within a 1 pixel wide zone. Secondly, the intensity values were averaged and finally, the average values of color differences were applied to overlapping regions. Besides, a motion blur filter was performed for the same boundary regions in order to reduce the seams. In order to test the accuracy, a subjective evaluation met

  • Publication Date: 27-Aug-2014
  • DOI: 10.15224/978-1-63248-024-8-12
  • Views: 0
  • Downloads: 0

AN AUTOMATIC SCHEDULING OF ACADEMIC TIME TABLE BY USING GENETIC ALGORITHMS

Published In: INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTER AND ELECTRONICS TECHNOLOGY
Author(s): CHINNAKRIT SITTIHA , PANUWAT KETWONG , SITTICHAI BUSSAMAN

Abstract: Time Table Scheduling is one of optimization problems. It use a skillful human and take a long time for each constraint. Many of researchers try to use computers to manage them automatically. There are two main goals in this research: to schedule the academic time-table of Surin Poly-technical College automatically by using Genetic Algorithms and to find the best condition of Genetic operators for solving the scheduling problem. The best condition was found from 24 experiments; two point crossover followed by position base mutation is the best condition sequence. Having got the sequence, a computer program was implemented by using that condition. The application was useful after testing with the constraints of Surin Poly-technical College

  • Publication Date: 27-Aug-2014
  • DOI: 10.15224/978-1-63248-024-8-13
  • Views: 0
  • Downloads: 0