Research Showcase for Postgraduates

Postgraduates by Research (PGRs) presented and showed their research work in the Annual Showcase Event for the School of Computer Science, University of Lincoln. (14th and 15th May). The event spread over all the day on Wed 14th May and featured in the morning of Thursday 15th May, with visitors and companies representatives.

DSC_0480 DSC_0396

DSC_0320 DSC_0445

 

The event was opened by the Head of School and concluded with handing prizes for the Best Presentation, Best Poster and Best Demo.

 

 

Computer Science PGRs in the PG Conference – Lincoln

Today, there has been a good representation from the Computer Science Postgraduate Researchers (PGRs) in the University of Lincoln Postgraduates Conference  (pgconf14.blogs.lincoln.ac.uk/).

Some of the PGRs are captured in the photo, while others just missed it.

PGRs in the PG Conference, April 2014, Lincoln.
PG Conference, April 2014, Lincoln

LSoCS (Lincoln School of Computer Science) PGRs had couple of oral presentations to the conference attendees, in addition to the Posters presented.

Nice to see increasing attendance and representation from LSoCS. Thanks to all contributed. Hope you also enjoyed the food

Best wishes.

New Conference paper presented in the“ World Congress on Engineering 2013”

 Saddam Bekhet presented his accepted paper in “World Congress on Engineering 2013“.

The paper title is “Video Matching Using DC-image and Local Features ”

Abstract:

This paper presents a suggested framework for video matching based on local features extracted from the DC-image of MPEG compressed videos, without decompression. The relevant arguments and supporting evidences are discussed for developing video similarity techniques that works directly on compressed videos, without decompression, and especially utilising small size images. Two experiments are carried to support the above. The first is comparing between the DC-image and I-frame, in terms of matching performance and the corresponding computation complexity. The second experiment compares between using local features and global features in video matching, especially in the compressed domain and with the small size images. The results confirmed that the use of DC-image, despite its highly reduced size, is promising as it produces at least similar (if not better) matching precision, compared to the full I-frame. Also, using SIFT, as a local feature, outperforms precision of most of the standard global features. On the other hand, its computation complexity is relatively higher, but it is still within the real-time margin. There are also various optimisations that can be done to improve this computation complexity.

Well done and congratulations to Saddam Bekhet .

20130704_112542

New Conference paper Accepted to the “ World Congress on Engineering 2013”

New Conference paper accepted for publishing in  “World Congress on Engineering 2013“.

The paper title is “Video Matching Using DC-image and Local Features ”

Abstract:

This paper presents a suggested framework for video matching based on local features extracted from the DC-image of MPEG compressed videos, without decompression. The relevant arguments and supporting evidences are discussed for developing video similarity techniques that works directly on compressed videos, without decompression, and especially utilising small size images. Two experiments are carried to support the above. The first is comparing between the DC-image and I-frame, in terms of matching performance and the corresponding computation complexity. The second experiment compares between using local features and global features in video matching, especially in the compressed domain and with the small size images. The results confirmed that the use of DC-image, despite its highly reduced size, is promising as it produces at least similar (if not better) matching precision, compared to the full I-frame. Also, using SIFT, as a local feature, outperforms precision of most of the standard global features. On the other hand, its computation complexity is relatively higher, but it is still within the real-time margin. There are also various optimisations that can be done to improve this computation complexity.

Well done and congratulations to Saddam Bekhet .