• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 29
  • 11
  • 7
  • 7
  • 4
  • 3
  • 2
  • 2
  • 1
  • 1
  • Tagged with
  • 86
  • 86
  • 45
  • 28
  • 21
  • 16
  • 15
  • 14
  • 11
  • 9
  • 9
  • 9
  • 9
  • 9
  • 9
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Video/Image Processing on FPGA

Zhao, Jin 29 April 2015 (has links)
Video/Image processing is a fundamental issue in computer science. It is widely used for a broad range of applications, such as weather prediction, computerized tomography (CT), artificial intelligence (AI), and etc. Video-based advanced driver assistance system (ADAS) attracts great attention in recent years, which aims at helping drivers to become more concentrated when driving and giving proper warnings if any danger is insight. Typical ADAS includes lane departure warning, traffic sign detection, pedestrian detection, and etc. Both basic and advanced video/image processing technologies are deployed in video-based driver assistance system. The key requirements of driver assistance system are rapid processing time and low power consumption. We consider Field Programmable Gate Array (FPGA) as the most appropriate embedded platform for ADAS. Owing to the parallel architecture, an FPGA is able to perform high-speed video processing such that it could issue warnings timely and provide drivers longer time to response. Besides, the cost and power consumption of modern FPGAs, particular small size FPGAs, are considerably efficient. Compared to the CPU implementation, the FPGA video/image processing achieves about tens of times speedup for video-based driver assistance system and other applications.
2

Novel entropy coding and its application of the compression of 3D image and video signals

Amal, Mehanna January 2013 (has links)
The broadcast industry is moving future Digital Television towards Super high resolution TV (4k or 8k) and/or 3D TV. This ultimately will increase the demand on data rate and subsequently the demand for highly efficient codecs. One of the techniques that researchers found it one of the promising technologies in the industry in the next few years is 3D Integral Image and Video due to its simplicity and mimics the reality, independently on viewer aid, one of the challenges of the 3D Integral technology is to improve the compression algorithms to adequate the high resolution and exploit the advantages of the characteristics of this technology. The research scope of this thesis includes designing a novel coding for the 3D Integral image and video compression. Firstly to address the compression of 3D Integral imaging the research proposes novel entropy coding which will be implemented first on 2D traditional images content in order to compare it with the other traditional common standards then will be applied on 3D Integra image and video. This approach seeks to achieve high performance represented by high image quality and low bit rate in association with low computational complexity. Secondly, new algorithm will be proposed in an attempt to improve and develop the transform techniques performance, initially by using a new adaptive 3D-DCT algorithm then by proposing a new hybrid 3D DWT-DCT algorithm via exploiting the advantages of each technique and get rid of the artifact that each technique of them suffers from. Finally, the proposed entropy coding will be further implemented to the 3D integral video in association with another proposed algorithm that based on calculating the motion vector on the average viewpoint for each frame. This approach seeks to minimize the complexity and reduce the speed without affecting the Human Visual System (HVS) performance. Number of block matching techniques will be used to investigate the best block matching technique that is adequate for the new proposed 3D integral video algorithm.
3

Video and Image Processing for Identification of Fire and Smoke

Garg, Sushil January 2013 (has links)
No description available.
4

Foreground detection of video through the integration of novel multiple detection algorithims

Nawaz, Muhammad January 2013 (has links)
The main outcomes of this research are the design of a foreground detection algorithm, which is more accurate and less time consuming than existing algorithms. By the term accuracy we mean an exact mask (which satisfies the respective ground truth value) of the foreground object(s). Motion detection being the prior component of foreground detection process can be achieved via pixel based and block based methods, both of which have their own merits and disadvantages. Pixel based methods are efficient in terms of accuracy but a time consuming process, so cannot be recommended for real time applications. On the other hand block based motion estimation has relatively less accuracy but consumes less time and is thus ideal for real-time applications. In the first proposed algorithm, block based motion estimation technique is opted for timely execution. To overcome the issue of accuracy another morphological based technique was adopted called opening-and-closing by reconstruction, which is a pixel based operation so produces higher accuracy and requires lesser time in execution. Morphological operation opening-and-closing by reconstruction finds the maxima and minima inside the foreground object(s). Thus this novel simultaneous process compensates for the lower accuracy of block based motion estimation. To verify the efficiency of this algorithm a complex video consisting of multiple colours, and fast and slow motions at various places was selected. Based on 11 different performance measures the proposed algorithm achieved an average accuracy of more than 24.73% than four of the well-established algorithms. Background subtraction, being the most cited algorithm for foreground detection, encounters the major problem of proper threshold value at run time. For effective value of the threshold at run time in background subtraction algorithm, the primary component of the foreground detection process, motion is used, in this next proposed algorithm. For the said purpose the smooth histogram peaks and valley of the motion were analyzed, which reflects the high and slow motion areas of the moving object(s) in the given frame and generates the threshold value at run time by exploiting the values of peaks and valley. This proposed algorithm was tested using four recommended video sequences including indoor and outdoor shoots, and were compared with five high ranked algorithms. Based on the values of standard performance measures, the proposed algorithm achieved an average of more than 12.30% higher accuracy results.
5

NON-TRADITIONAL FLIGHT TEST SENSING SYSTEMS

Kilpatrick, Stephen A., Whittington, Austin J. 10 1900 (has links)
Traditional flight test sensing applications require installation of not only the sensor but also supporting cabling and interfacing infrastructure. The cost of this supporting infrastructure increases when it must cross pressure vessel boundaries, extend long distances, or interfere with operation of the aircraft. The continuing cost and schedule pressures on flight test programs demand approaches that minimize installation complexity and reduce the need to modify the aircraft under test. Some emerging approaches have leveraged wireless techniques for data transmission but this can only be used in certain circumstances and does not address the problem of power distribution. This paper describes ongoing research into alternative sensing approaches that utilize a mix of video processing, distributed processing, and power harvesting to provide additional solutions.
6

Inpainting de imagens digitais por estimação de curvas de decaimento dos coeficientes wavelet via regularidade e espaços de Besov. / Digital image inpainting by estimating wavelet coefficients decay from regularity and Besov spaces.

Penedo, Sergio Ricardo Master 08 April 2014 (has links)
Com a crescente veiculação de sinais de informação visual nos meios de comunicação, métodos de inpainting de imagens passaram a ser cada vez mais importantes. Esses métodos, usualmente propostos para minimizar os efeitos de perda de blocos de dados, analisam prioritariamente a correlação espacial entre porções de uma imagem, sem explorar intensivamente a informação no domínio da frequência. Em outra vertente, técnicas que buscam avaliar perdas de blocos em imagens não descrevem localmente uma figura de mérito consistente para aferição da correlação espacial entre os pixels de cada bloco corrompido. No contexto de se explorar o sinal de informação visual em múltiplas resoluções, este trabalho apresenta uma técnica de inpainting de imagens digitais, extensível a aplicações que manipulem sinais de vídeo, a partir da análise da propriedade de regularidade das wavelets na decomposição multi-resolução de imagens, descrita localmente no sentido do espaço vetorial de Besov, um espaço com suavidade generalizada que comporta razoavelmente modificações nos coeficientes wavelet dos quadros visando à correção de informação. O trabalho descreve uma técnica de estimação de curvas de decaimento dos coeficientes wavelet dos pixels, baseada na observação da propriedade de regularidade, objetivando a correção de blocos de pixels contaminados por ruído. A partir da observação de tais características, o trabalho propõe um algoritmo de inpainting, no domínio da transformada wavelet, aplicado a imagens, perfazendo tanto a detecção, baseada em um critério de limiarização de correlação cruzada dos coeficientes wavelet, como a correção dos blocos de pixels danificados, fundamentada na reconstrução de informação a partir de uma função de decaimento projetada para tais coeficientes. Resultados de simulações obtidos para a aplicação do método em imagens corrompidas por diferentes padrões de ruído mostram seu bom desempenho comparativamente a outros recentes métodos. Ao final, são apresentados tópicos que serão explorados no prosseguimento da investigação. / With the growing visual information signals transmission, methods of image inpainting acquired noticeable importance in signal processing area. These methods, usually proposed to minimize the effects of loss of data blocks, analyze primarily the spatial correlation between portions of an image, without intensively exploring the information in the frequency domain. In another aspect, techniques that seek to evaluate losses of blocks in images do not describe locally a figure of merit for consistent measurement of spatial correlation between pixels of each corrupted block. In the context of exploring the visual information signal in multiple resolutions, this work presents a technique of digital image inpainting, extensible to video applications, from the analysis of property of regularity of wavelets in multiresolution analysis of images, described locally in the sense of Besov vectorial spaces, whose generalized smoothness allows widespread changes in wavelet coefficients of image data, aiming to conceal visual information. The study describes a technique for estimation of decay curves of the wavelet coefficients from pixels, based on observation of the property of regularity, aiming to correct blocks of pixels contaminated by noise. From the observation of such characteristics, the study proposes an algorithm for inpainting, in the wavelet transform domain, applied to images, performing as the detection task, based in a criterion of threshold of cross-correlation between wavelet coefficients, as the correction of damaged pixel blocks, stated in the reconstruction of information from a designed decay function for those coefficients. Simulation results obtained for the implementation of the method in images corrupted by different patterns of noise show its good performance compared to other recent methods. At the end of this work, topics to be explored in further research are presented.
7

Inpainting de imagens digitais por estimação de curvas de decaimento dos coeficientes wavelet via regularidade e espaços de Besov. / Digital image inpainting by estimating wavelet coefficients decay from regularity and Besov spaces.

Sergio Ricardo Master Penedo 08 April 2014 (has links)
Com a crescente veiculação de sinais de informação visual nos meios de comunicação, métodos de inpainting de imagens passaram a ser cada vez mais importantes. Esses métodos, usualmente propostos para minimizar os efeitos de perda de blocos de dados, analisam prioritariamente a correlação espacial entre porções de uma imagem, sem explorar intensivamente a informação no domínio da frequência. Em outra vertente, técnicas que buscam avaliar perdas de blocos em imagens não descrevem localmente uma figura de mérito consistente para aferição da correlação espacial entre os pixels de cada bloco corrompido. No contexto de se explorar o sinal de informação visual em múltiplas resoluções, este trabalho apresenta uma técnica de inpainting de imagens digitais, extensível a aplicações que manipulem sinais de vídeo, a partir da análise da propriedade de regularidade das wavelets na decomposição multi-resolução de imagens, descrita localmente no sentido do espaço vetorial de Besov, um espaço com suavidade generalizada que comporta razoavelmente modificações nos coeficientes wavelet dos quadros visando à correção de informação. O trabalho descreve uma técnica de estimação de curvas de decaimento dos coeficientes wavelet dos pixels, baseada na observação da propriedade de regularidade, objetivando a correção de blocos de pixels contaminados por ruído. A partir da observação de tais características, o trabalho propõe um algoritmo de inpainting, no domínio da transformada wavelet, aplicado a imagens, perfazendo tanto a detecção, baseada em um critério de limiarização de correlação cruzada dos coeficientes wavelet, como a correção dos blocos de pixels danificados, fundamentada na reconstrução de informação a partir de uma função de decaimento projetada para tais coeficientes. Resultados de simulações obtidos para a aplicação do método em imagens corrompidas por diferentes padrões de ruído mostram seu bom desempenho comparativamente a outros recentes métodos. Ao final, são apresentados tópicos que serão explorados no prosseguimento da investigação. / With the growing visual information signals transmission, methods of image inpainting acquired noticeable importance in signal processing area. These methods, usually proposed to minimize the effects of loss of data blocks, analyze primarily the spatial correlation between portions of an image, without intensively exploring the information in the frequency domain. In another aspect, techniques that seek to evaluate losses of blocks in images do not describe locally a figure of merit for consistent measurement of spatial correlation between pixels of each corrupted block. In the context of exploring the visual information signal in multiple resolutions, this work presents a technique of digital image inpainting, extensible to video applications, from the analysis of property of regularity of wavelets in multiresolution analysis of images, described locally in the sense of Besov vectorial spaces, whose generalized smoothness allows widespread changes in wavelet coefficients of image data, aiming to conceal visual information. The study describes a technique for estimation of decay curves of the wavelet coefficients from pixels, based on observation of the property of regularity, aiming to correct blocks of pixels contaminated by noise. From the observation of such characteristics, the study proposes an algorithm for inpainting, in the wavelet transform domain, applied to images, performing as the detection task, based in a criterion of threshold of cross-correlation between wavelet coefficients, as the correction of damaged pixel blocks, stated in the reconstruction of information from a designed decay function for those coefficients. Simulation results obtained for the implementation of the method in images corrupted by different patterns of noise show its good performance compared to other recent methods. At the end of this work, topics to be explored in further research are presented.
8

Information theoretic methods in distributed compression and visual quality assessment

Soundararajan, Rajiv 11 July 2012 (has links)
Distributed compression and quality assessment (QA) are essential ingredients in the design and analysis of networked signal processing systems with voluminous data. Distributed source coding techniques enable the efficient utilization of available resources and are extremely important in a multitude of data intensive applications including image and video. The quality analysis of such systems is also equally important in providing benchmarks on performance leading to improved design and control. This dissertation approaches the complementary problems of distributed compression and quality assessment using information theoretic methods. While such an approach provides intuition on designing practical coding schemes for distributed compression, it directly yields image and video QA algorithms with excellent performance that can be employed in practice. This dissertation considers the information theoretic study of sophisticated problems in distributed compression including, multiterminal multiple description coding, multiterminal source coding through relays and joint source channel coding of correlated sources over wireless channels. Random and/or structured codes are developed and shown to be optimal or near optimal through novel bounds on performance. While lattices play an important role in designing near optimal codes for multiterminal source coding through relays and joint source channel coding over multiple access channels, time sharing random Gaussian codebooks is optimal for a wide range of system parameters in the multiterminal multiple description coding problem. The dissertation also addresses the challenging problem of reduced reference image and video QA. A family of novel reduced reference image and video QA algorithms are developed based on spatial and temporal entropic differences. While the QA algorithms for still images only compute spatial entropic differences, the video QA algorithms compute both spatial and temporal entropic differences and combine them in a perceptually relevant manner. These algorithms attain excellent performances in terms of correlation with human judgments of quality on large QA databases. The framework developed also enables the study of the degradation in performance of QA algorithms from full reference information to almost no information from the reference image or video. / text
9

Real-time content aware resizing of video

Grundmann, Matthias 19 November 2008 (has links)
In this thesis, we propose a new method for content-aware resizing of videos in real- time. Our approach consists of two steps. First, we compute a set of non-salient pixels in linear time which, when being removed or duplicated, do not alter the general appearance of the video. This is an extension of Avidan and Shamir's [3] greedy seam-carving approach to video. Second, we generate a new representation of the video, so called multi-view videos that allow us to resize the video in real-time, i.e. while being watched. This representation can be computed very effciently, the complexity is linear in the number of frames and linear in the number of pixels in a video. Our technique works on a broad variety of videos and is computationally inexpensive enough to be executed by a vast range of devices. We compare our technique to our own implementation of a current state-of-the-art approach and show several convincing results obtained by our technique.
10

Systém pre sledovanie pohybujúcich sa objektov / Moving objects monitoring system

Orolin, Jakub January 2019 (has links)
The presented thesis deals with the design of a system capable of tracking the moving objects. The output of the thesis is the prototype layout of the device. Facility will be physically placed between the camera and the tripod in the dissertation and tested in real conditions. The role of this system is to automatically rolling the camera up the selected moving object.

Page generated in 0.1186 seconds