No description available.

No description available.

No description available.

No description available.

Cette thèse s’appuie sur une pratique de la vidéographie, du montage et de la photographie et explore le thème de l’intime. Son hypothèse est que l’espace interrogé de la quotidienneté est identique avec celui de l’exploration des intimes. La réflexion se base sur une analyse des textes théoriques ou des réalisations artistiques de Gaston Bachelard, Roland Barthes, Henri Bergson Sophie Calle, Eliane Chiron, Gilles Deleuze, Georges Didi-Huberman, le Groupe Mu, Pierre Huyghe, Maurice Merleau-Ponty ou encore Agnès Varda, et s’appuie sur un matériel plastique qui permet de cristalliser et situer les déplacements et les objets appartenant aux rituels du quotidien. La première partie explore la sphère intime par l’intermédiaire de photos de famille et d’un medium pictural, le cercle bleu. La seconde partie analyse la sphère intime au travers d’images extraites de films vidéographiques réalisés en suivant des personnes ou dans des espaces privés. La troisième partie est dédiée aux espaces parcourus par les personnages que je filme lorsque je les suis, que je parcours lorsque je marche et par les spectateurs au sein de mon installation. Cette thèse interroge le rôle du corps in situ, au contact des lieux et des situations, dans l’élaboration d’un code narratif et poétique afin d’identifier et d’établir les relations de réciprocité et d’interactions qui lient mon matériel plastique à la durée, au temps et à l’espace, au quotidien qui passe et qui s’étale. Par un jeu de miroirs, ce travail cherche à faire résonner notre mémoire et celle des spectateurs et en hyper-multipliant la banalité du quotidien qui devient extraordinaire. / This thesis is based on a practice of videography, editing and photography and explores the theme of intimacy. Its hypothesis is that the interrogated space of everyday life is identical with that of the exploration of intimates. The reflection is based on an analysis of the theoretical texts or artistic achievements by Gaston Bachelard, Roland Barthes, Henri Bergson Sophie Calle, Eliane Chiron, Gilles Deleuze, George Didi-Huberman, Mu Group, Pierre Huyghe, Maurice Merleau-Ponty or Agnès Varda, and relies on a plastic material that can crystallize and locate the movements and objects belonging to the rituals of everyday life. The first part explores the intimate sphere through family photos and a pictorial medium, the blue circle. The second part analyses the intimate sphere through images extracted from video films made following people or in private spaces. The third part is dedicated to the spaces travelled by the characters that I shadowed, that I walk when I walk and by the spectators within my installation. This thesis questions the in situ role of the body, in con-tact with places and situations, in the development of a narrative and poetic code in order to identify and establish the relations of reciprocity and interactions that bind my plastic material to the duration, the time and the space, the daily life that goes on and spreads. Through a game of mirrors, this work seeks to resonate our memory and that of the audience and hyper-multiplying the banality of everyday life that becomes extraordinary.

Objectives. The objective of this study was to investigate how the characteristics of self-generated and spontaneous images might differ between states of high and low anxiety, as observed in spider phobia. It was not known whether self-generated images could be used, in the same way as spontaneous images, to access core beliefs. The frequency and characteristics of spontaneous images were assessed to determine whether they are negative, recurrent, and link to early memories, as have been reported in social phobia. Design. Participants were recruited into either a spider-anxious group or a control group based upon their response (independent variable) to the Fear of Spiders Questionnaire (Muris & Mercklebach, 1996). A semi-structured interview, incorporating a within and between group design, required participants to rate the characteristics (the dependent variables) of self generated and spontaneous images. Method. A semi-structured interview was administered. Participants rated the characteristics of two images (spider and butterfly) using visual analogue scales. The downward arrow technique was used to access core beliefs associated with the self-generated and spontaneous images. Results. The spider-anxious group's spider image was more vivid, evoked more anxiety, and was perceived as having more intent than both control images. The spider-anxious group reported more negative core beliefs associated with the self-generated image and more spontaneous images, that were recurrent, negative and that linked to early traumatic experiences. Conclusions. The phenomenological characteristics of self-generated images can be reliably assessed and, in the absence of spontaneous images, can be utilised to access core beliefs in anxiety disorders. This study provides some evidence of cognitive biases and thinking errors and calls for a new cognitive model of specific phobia.

本論文工作的主題是圖像反卷積問題。在很多實際應用，例如生物醫學成像，地震學，天文學，遙感和光學成像中，觀測數據經常會出現令人不愉快的退化現象，這種退化一般由模糊效應(例如光學衍射限條件)和噪聲汙染(比如光子計數噪聲和讀出噪聲)造成的，這兩者都是物理儀器自身的條件限制造成的。作為一個標准的線性反問題，圖像反卷積經常被用作恢複觀測到的模糊的有噪點的圖像。我們旨在基于無偏差風險估計准則研究新的反卷積算法。本論文工作主要分為以下兩大部分。 / 首先，我們考慮在加性高斯白噪聲條件下的圖像非盲反卷積問題，即准確的點擴散函數已知。我們的研究准則是最小化均方誤差的無偏差估計，即SURE. SURE- LET方法最初被應用于圖像降噪問題。本論文工作擴展該方法至討論圖像反卷積問題.我們提出了一個新的SURE-LET算法，用于快速有效地實現圖像複原功能。具體而言，我們將反卷積過程參數化表示為有限個基本函數的線性組合，稱作LET方法。反卷積問題最終簡化為求解該線性組合的最優線性系數。由于SURE的二次項本質和線性參數化表示，求解線性系數可由求解線性方程組而得。實驗結果顯示該論文提出的方法在信噪比，圖像的視覺質量和運算時間等方面均優于其他迄今最優秀的算法。 / 論文的第二部分討論圖像盲複原中的點擴散函數估計問題。我們提出了blur-SURE -一個均方誤差修正版的無偏差估計 - 作為點擴散函數估計的最新准則，即點擴散函數由最小化這個新的目標函數獲得。然後我們利用這個估計的點擴散函數，用第一部分所提出的SURE-LET算法進行圖像的非盲複原。我們以一些典型的點擴散函數形式(高斯函數最為典型)為例詳細闡述該blur-SURE理論框架。實驗結果顯示最小化blur-SURE能夠更准確的估計點擴散函數，從而獲得更加優越的反卷積佳能。相比于圖像非盲複原，盲複原所得的圖片的視覺質量損失可忽略不計。 / 本論文所提出的基于無偏差估計的算法可擴展至其他噪聲模型。由于本論文以SURE基礎的方法在理論上並不僅限于卷積問題，該方法可用于解決數據的其他線性失真問題。 / The subject of this thesis is image deconvolution. In many real applications, e.g. biomedical imaging, seismology, astronomy, remote sensing and optical imaging, undesirable degradations by blurring effect (e.g. optical diffraction-limited condition) and noise corruption (e.g. photon-counting noise and readout noise) are inherent to any physical acquisition device. Image deconvolution, as a standard linear inverse problem, is often applied to recover the images from their blurred and noisy observations. Our interest lies in novel deconvolution algorithms based on unbiased risk estimate. This thesis is organized in two main parts as briefly summarized below. / We first consider non-blind image deconvolution with the corruption of additive white Gaussian noise (AWGN), where the point spread function (PSF) is exactly known. Our driving principle is the minimization of an unbiased estimate of mean squared error (MSE) between observed and clean data, known as "Stein's unbiased risk estimate" (SURE). The SURE-LET approach, which was originally developed for denoising, is extended to the deconvolution problem: a new SURE-LET deconvolution algorithm for fast and efficient implementation is proposed. More specifically, we parametrize the deconvolution process as a linear combination of a small number of known basic processings, which we call the linear expansion of thresholds (LET), and then minimize the SURE over the unknown linear coefficients. Due to the quadratic nature of SURE and the linear parametrization, the optimal linear weights of the combination is finally achieved by solving a linear system of equations. Experiments show that the proposed approach outperforms other state-of-the-art methods in terms of PSNR, SSIM, visual quality, as well as computation time. / The second part of this thesis is concerned with PSF estimation for blind deconvolution. We propose a "blur-SURE" - an unbiased estimate of a filtered version of MSE - as a novel criterion for estimating the PSF, from the observed image only, i.e. the PSF is identified by minimizing this new objective functional, whose validity has been theoretically verified. The blur-SURE framework is exemplified with a number of parametric forms of the PSF, most typically, the Gaussian kernel. Experiments show that the blur-SURE minimization yields highly accurate estimate of PSF parameters. We then perform non-blind deconvolution using the SURE-LET algorithm proposed in Part I, with the estimated PSF. Experiments show that the estimated PSF results in superior deconvolution performance, with a negligible quality loss, compared to the deconvolution with the exact PSF. / One may extend the algorithms based on unbiased risk estimate to other noise model. Since the SURE-based approaches does not restrict themselves to convolution operation, it is possible to extend them to other distortion scenarios. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Xue, Feng. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2013. / Includes bibliographical references (leaves 119-130). / Abstracts also in Chinese. / Dedication --- p.i / Acknowledgments --- p.iii / Abstract --- p.ix / List of Notations --- p.xi / Contents --- p.xvi / List of Figures --- p.xx / List of Tables --- p.xxii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivations and objectives --- p.1 / Chapter 1.2 --- Mathematical formulation for problem statement --- p.2 / Chapter 1.3 --- Survey of non-blind deconvolution approaches --- p.2 / Chapter 1.3.1 --- Regularization --- p.2 / Chapter 1.3.2 --- Regularized inversion followed by denoising --- p.4 / Chapter 1.3.3 --- Bayesian approach --- p.4 / Chapter 1.3.4 --- Remark --- p.5 / Chapter 1.4 --- Survey of blind deconvolution approaches --- p.5 / Chapter 1.4.1 --- Non-parametric blind deconvolution --- p.5 / Chapter 1.4.2 --- Parametric blind deconvolution --- p.7 / Chapter 1.5 --- Objective assessment of the deconvolution quality --- p.8 / Chapter 1.5.1 --- Peak Signal-to-Noise Ratio (PSNR) --- p.8 / Chapter 1.5.2 --- Structural Similarity Index (SSIM) --- p.8 / Chapter 1.6 --- Thesis contributions --- p.9 / Chapter 1.6.1 --- Theoretical contributions --- p.9 / Chapter 1.6.2 --- Algorithmic contributions --- p.10 / Chapter 1.7 --- Organization --- p.11 / Chapter I --- The SURE-LET Approach to Non-blind Deconvolution --- p.13 / Chapter 2 --- The SURE-LET Framework for Deconvolution --- p.15 / Chapter 2.1 --- Motivations --- p.15 / Chapter 2.2 --- Related work --- p.15 / Chapter 2.3 --- Problem statement --- p.17 / Chapter 2.4 --- Stein's Unbiased Risk Estimate (SURE) for deconvolution --- p.17 / Chapter 2.4.1 --- Original SURE --- p.17 / Chapter 2.4.2 --- Regularized approximation of SURE --- p.18 / Chapter 2.5 --- The SURE-LET approach --- p.19 / Chapter 2.6 --- Summary --- p.20 / Chapter 3 --- Multi-Wiener SURE-LET Approach --- p.23 / Chapter 3.1 --- Problem statement --- p.23 / Chapter 3.2 --- Linear deconvolution: multi-Wiener filtering --- p.23 / Chapter 3.3 --- SURE-LET in orthonormal wavelet representation --- p.24 / Chapter 3.3.1 --- Mathematical formulation --- p.24 / Chapter 3.3.2 --- SURE minimization in orthonormal wavelet domain --- p.26 / Chapter 3.3.3 --- Computational issues --- p.27 / Chapter 3.4 --- SURE-LET approach for redundant wavelet representation --- p.30 / Chapter 3.5 --- Computational aspects --- p.32 / Chapter 3.5.1 --- Periodic boundary extensions --- p.33 / Chapter 3.5.2 --- Symmetric convolution --- p.36 / Chapter 3.5.3 --- Half-point symmetric boundary extensions --- p.36 / Chapter 3.5.4 --- Whole-point symmetric boundary extensions --- p.43 / Chapter 3.6 --- Results and discussions --- p.46 / Chapter 3.6.1 --- Experimental setting --- p.46 / Chapter 3.6.2 --- Influence of the number of Wiener lters --- p.47 / Chapter 3.6.3 --- Influence of the parameters on the deconvolution performance --- p.48 / Chapter 3.6.4 --- Influence of the boundary conditions: periodic vs symmetric --- p.52 / Chapter 3.6.5 --- Comparison with the state-of-the-art --- p.52 / Chapter 3.6.6 --- Analysis of computational complexity --- p.59 / Chapter 3.7 --- Conclusion --- p.60 / Chapter II --- The SURE-based Approach to Blind Deconvolution --- p.63 / Chapter 4 --- The Blur-SURE Framework to PSF Estimation --- p.65 / Chapter 4.1 --- Introduction --- p.65 / Chapter 4.2 --- Problem statement --- p.66 / Chapter 4.3 --- The blur-SURE framework for general linear model --- p.66 / Chapter 4.3.1 --- Blur-MSE: a modified version of MSE --- p.66 / Chapter 4.3.2 --- Blur-MSE minimization --- p.67 / Chapter 4.3.3 --- Blur-SURE: an unbiased estimate of the blur-MSE --- p.67 / Chapter 4.4 --- Application of blur-SURE framework for PSF estimation --- p.68 / Chapter 4.4.1 --- Problem statement in the context of convolution --- p.68 / Chapter 4.4.2 --- Blur-MSE minimization for PSF estimation --- p.69 / Chapter 4.4.3 --- Approximation of exact Wiener filtering --- p.70 / Chapter 4.4.4 --- Blur-SURE minimization for PSF estimation --- p.72 / Chapter 4.5 --- Concluding remarks --- p.72 / Chapter 5 --- The Blur-SURE Approach to Parametric PSF Estimation --- p.75 / Chapter 5.1 --- Introduction --- p.75 / Chapter 5.1.1 --- Overview of parametric PSF estimation --- p.75 / Chapter 5.1.2 --- Gaussian PSF as a typical example --- p.75 / Chapter 5.1.3 --- Outline of this chapter --- p.76 / Chapter 5.2 --- Parametric estimation: problem formulation --- p.77 / Chapter 5.3 --- Examples of PSF parameter estimation --- p.77 / Chapter 5.3.1 --- Gaussian kernel --- p.77 / Chapter 5.3.2 --- Non-Gaussian PSF with scaling factor s --- p.78 / Chapter 5.4 --- Minimization via the approximated function λ = λ (s) --- p.79 / Chapter 5.5 --- Results and discussions --- p.82 / Chapter 5.5.1 --- Experimental setting --- p.82 / Chapter 5.5.2 --- Non-Gaussian functions: estimation of scaling factor s --- p.83 / Chapter 5.5.3 --- Gaussian function: estimation of standard deviation s --- p.84 / Chapter 5.5.4 --- Comparison of deconvolution performance with the state-of-the-art --- p.84 / Chapter 5.5.5 --- Application to real images --- p.87 / Chapter 5.6 --- Conclusion --- p.90 / Chapter 6 --- The Blur-SURE Approach to Motion Deblurring --- p.93 / Chapter 6.1 --- Introduction --- p.93 / Chapter 6.1.1 --- Background of motion deblurring --- p.93 / Chapter 6.1.2 --- Related work: parametric estimation of motion blur --- p.93 / Chapter 6.1.3 --- Outline of this chapter --- p.94 / Chapter 6.2 --- Parametric estimation of motion blur: problem formulation --- p.94 / Chapter 6.2.1 --- Parametrized form of linear motion blur --- p.94 / Chapter 6.2.2 --- The blur-SURE framework to motion blur estimation --- p.94 / Chapter 6.3 --- An example of the blur-SURE approach to motion blur estimation --- p.95 / Chapter 6.4 --- Implementation issues --- p.96 / Chapter 6.4.1 --- Estimation of motion direction --- p.97 / Chapter 6.4.2 --- Estimation of blur length --- p.97 / Chapter 6.4.3 --- Short summary --- p.98 / Chapter 6.5 --- Results and discussions --- p.98 / Chapter 6.5.1 --- Experimental setting --- p.98 / Chapter 6.5.2 --- Estimations of blur direction and length --- p.99 / Chapter 6.5.3 --- Motion deblurring: the synthetic experiments --- p.99 / Chapter 6.5.4 --- Motion deblurring: the real experiment --- p.101 / Chapter 6.6 --- Conclusion --- p.103 / Chapter 7 --- Epilogue --- p.107 / Chapter 7.1 --- Summary --- p.107 / Chapter 7.2 --- Perspectives --- p.108 / Chapter A --- Proof --- p.109 / Chapter A.1 --- Proof of Theorem 2.1 --- p.109 / Chapter A.2 --- Proof of Eq.(2.6) in Section 2.4.2 --- p.110 / Chapter A.3 --- Proof of Eq.(3.5) in Section 3.3.1 --- p.110 / Chapter A.4 --- Proof of Theorem 3.6 --- p.112 / Chapter A.5 --- Proof of Theorem 3.12 --- p.112 / Chapter A.6 --- Derivation of noise variance in 2-D case (Section 3.5.4) --- p.114 / Chapter A.7 --- Proof of Theorem 4.1 --- p.116 / Chapter A.8 --- Proof of Theorem 4.2 --- p.116

Cette thèse, commencée fin 1989, est consacrée à l'étude de l'influence pratique de nouvelles propriétés mathématiques apportées par la théorie des {\em ondelettes\/} dans le domaine du codage en sous-bandes, en vue d'application à la compression d'images fixes. On montre, par une analyse théorique de la décomposition multi-résolution de signaux à temps discret, que l'apport pratique essentiel de la théorie des ondelettes, dans ce cadre, est la propriété de {\em régularité\/} des bancs de filtres itérés en octaves utilisés pour le codage en sous-bandes. On développe ensuite un certain nombre d'outils, qui vont rendre possible une étude exhaustive du rôle de la régularité pour des applications en compression d'images: Une étude mathématique détaillée de la notion de régularité est menée; elle permet d'obtenir des algorithmes d'estimation optimale de régularité. Ensuite, on développe plusieurs méthodes de calcul de bancs de filtres, permettant de réaliser des bons compromis entre la régularité et les autres propriétés des filtres généralement considérées comme utiles pour le codage d'images (orthogonalité, phase linéaire, sélectivité en fréquence, etc.). On propose également des algorithmes rapides permettant, à peu de frais, de réduire notablement la charge de calcul nécessaire à la réalisation d'un banc de filtres itéré en octaves. Finalement, on mène une étude expérimentale du rôle des propriétés des filtres calculés, pour un schéma simple de compression d'images fixes, où la transformée en ondelettes est séparable. Dans le cadre restreint choisi, on met en avant l'intérêt potentiel du critère de régularité par rapport à ceux de sélectivité en fréquence et de phase linéaire.

L'objectif de la thèse est d'étudier l'application de propriétés perceptives au traitement d'images numérisées. Ce projet confronte deux mondes fort éloignés: l'étude du système visuel humain (HVS) qui se rattache à la neurophysiologie et à la psychophysique et le traitement d'images qui fait partie du domaine de l'informatique et des télécommunications.

Thesis (Ph. D.)--University of Texas at Dallas, 2007. / Includes vita. Includes bibliographical references (leaves 119-126)