Video surveillance systems obtain a great interest as application-oriented studies that have been growing rapidly in the past decade. The most recent studies attempt to integrate computer vision, image processing, and artificial intelligence capabilities into video surveillance applications. Although there are so many achievements in the acquisition of datasets, methods, and frameworks published, there are not many papers that can provide a comprehensive picture of the current state of video surveillance system research. This paper provides a comprehensive and systematic review on the literature from various video surveillance system studies published from 2010 through 2019. Within a selected study extraction process, 220 journal-based publications were identified and analyzed to illustrate the research trends, datasets, methods, and frameworks used in the field of video surveillance, to provide an in-depth explanation about research trends that many topics raised by researchers as a focus in their researches, to provide references on public datasets that are often used by researchers as a comparison and a means of developing a test method, and to give accounts on the improvement and integration of network infrastructure design to meet the demand for multimedia data. In the end of this paper, several opportunities and challenges related to researches in the video surveillance system are mentioned.
1 December 2019 in Computer Methods and Programs in Biomedicine
Currently mobile digital image applications transmit a lot of images back and forth. Image compression is needed to reduce transmission payload at the expense of lower quality. At the same time, mobile devices are only expected to be equipped with lower computing power and storage. They need an efficient compression scheme especially for small images. The standard JPEG using discrete Cosine transform is a popular lossy image compression. Alternatively, this paper introduces 2×2 Tchebichef moments transform for the efficient image compression. In the previous research, larger sub-block discrete Tchebichef moments have been used extensively for image compression. The comparisons between JPEG compression and 2×2 Tchebichef moments image compressions shall be done. The preliminary experiment results show that 2×2 Tchebichef moments transform has the potential to easily perform better than JPEG image compression. The 2×2 Tchebichef moments provides an efficient and compact support for image compression.
Traditionally, speech recognition requires large computational windows. This paper proposes an approach based on 256 discrete orthonormal Tchebichef polynomials for efficient speech recognition. The method uses a simplified set of recurrence relation matrix to compute within each window. Unlike the Fast Fourier Transform (FFT), discrete orthonormal Tchebichef transform (DTT) provides simpler matrix setting which involves real coefficient number only. The comparison among 256 DTT, 1024 DTT and 1024 FFT has been done to recognize five vowels and five consonants. The experimental results show the practical advantage of 256 Discrete Tchebichef Transform in term of spectral frequency and time taken of speech recognition performance. 256 DTT produces frequency formants relatively identical similar output with 1024 DTT and 1024 FFT in term of speech recognition. The 256 DTT has a potential to be a competitive candidate for computationally efficient dynamic speech recognition.