Phenalenone-type phytoalexins mediate resistance of banana plants (Musa spp.) to the burrowing nematode Radopholus similis

The global yield of bananas, one of the most important food crops is severely hampered by parasites, such as nematodes, which cause yield losses up to 75%. Plant nematode interactions of two banana cultivars differing in susceptibility to Radopholus similis were investigated by combining the conventional and spatially resolved analytical techniques 1H NMR spectroscopy, matrix-free UV-laser desorption/ionization mass spectrometric imaging, and Raman microspectroscopy. This innovative combination of analytical techniques was applied to isolate, identify, and locate the banana-specific type of phytoalexins, phenylphenalenones, in the R. similis-caused lesions of the plants. The striking antinematode activity of the phenylphenalenone anigorufone, its ingestion by the nematode, and its subsequent localization in lipid droplets within the nematode is reported. The importance of varying local concentrations of these specialized metabolites in infected plant tissues, their involvement in the plant's defense system, and derived strategies for improving banana resistance are highlighted

Tree-serial parametric dynamic programming with flexible prior model for image denoising

We consider here image denoising procedures, based on computationally effective tree-serial parametric dynamic programming procedures, different representations of an image lattice by the set of acyclic graphs and non-convex regularization of a new type which allows to flexibly set a priori preferences. Experimental results in image denoising, as well as comparison with related methods, are provided. A new extended version of multi quadratic dynamic programming procedures for image denoising, proposed here, shows an improved accuracy for images of a different type

Supplementary Material: Optical Flow Estimation on Sequences with Differently Exposed Frames

Estimation on Sequences with Differently Exposed Frames". It is not fully self-contained and should therefore be read with the paper at hand. Some references are given to the original paper for further details of certain expressions and experimental setups. Many authors that publish on variational Optical Flow estimation methods provide the Euler-Lagrange (E-L) equations that correspond to their specific cost functional, one influential example being Brox et al. [1]. In this document, we derive the E-L equations with more detail than what is customary. Our specific cost functional is stated as the starting point. Then, the contributions of each of its terms to the overall E-L equations are derived. The document is concluded with details on how to iteratively solve the E-L equations, including a pseudo-algorithm and numerical aspects. 2 Cost funtional, corresponding Euler-Lagrange equations, and implementation details In order to estimate a given flow field, the objective is to find the horizontal and vertical flow functions of wf = (uf, vf), ∀f ∈ {1,...,F − 1}, assuming without loss of generality that the first frame included is indexed f = 1, that minimize the cost functional E({wf}) =

초점 스택에서 3D 깊이 재구성 및 깊이 개선

학위논문 (박사) -- 서울대학교 대학원 : 공과대학 전기·컴퓨터공학부, 2021. 2. 신영길.Three-dimensional (3D) depth recovery from two-dimensional images is a fundamental and challenging objective in computer vision, and is one of the most important prerequisites for many applications such as 3D measurement, robot location and navigation, self-driving, and so on. Depth-from-focus (DFF) is one of the important methods to reconstruct a 3D depth in the use of focus information. Reconstructing a 3D depth from texture-less regions is a typical issue associated with the conventional DFF. Further more, it is difficult for the conventional DFF reconstruction techniques to preserve depth edges and fine details while maintaining spatial consistency. In this dissertation, we address these problems and propose an DFF depth recovery framework which is robust over texture-less regions, and can reconstruct a depth image with clear edges and fine details. The depth recovery framework proposed in this dissertation is composed of two processes: depth reconstruction and depth refinement. To recovery an accurate 3D depth, We first formulate the depth reconstruction as a maximum a posterior (MAP) estimation problem with the inclusion of matting Laplacian prior. The nonlocal principle is adopted during the construction stage of the matting Laplacian matrix to preserve depth edges and fine details. Additionally, a depth variance based confidence measure with the combination of the reliability measure of focus measure is proposed to maintain the spatial smoothness, such that the smooth depth regions in initial depth could have high confidence value and the reconstructed depth could be more derived from the initial depth. As the nonlocal principle breaks the spatial consistency, the reconstructed depth image is spatially inconsistent. Meanwhile, it suffers from texture-copy artifacts. To smooth the noise and suppress the texture-copy artifacts introduced in the reconstructed depth image, we propose a closed-form edge-preserving depth refinement algorithm that formulates the depth refinement as a MAP estimation problem using Markov random fields (MRFs). With the incorporation of pre-estimated depth edges and mutual structure information into our energy function and the specially designed smoothness weight, the proposed refinement method can effectively suppress noise and texture-copy artifacts while preserving depth edges. Additionally, with the construction of undirected weighted graph representing the energy function, a closed-form solution is obtained by using the Laplacian matrix corresponding to the graph. The proposed framework presents a novel method of 3D depth recovery from a focal stack. The proposed algorithm shows the superiority in depth recovery over texture-less regions owing to the effective variance based confidence level computation and the matting Laplacian prior. Additionally, this proposed reconstruction method can obtain a depth image with clear edges and fine details due to the adoption of nonlocal principle in the construct]ion of matting Laplacian matrix. The proposed closed-form depth refinement approach shows that the ability in noise removal while preserving object structure with the usage of common edges. Additionally, it is able to effectively suppress texture-copy artifacts by utilizing mutual structure information. The proposed depth refinement provides a general idea for edge-preserving image smoothing, especially for depth related refinement such as stereo vision. Both quantitative and qualitative experimental results show the supremacy of the proposed method in terms of robustness in texture-less regions, accuracy, and ability to preserve object structure while maintaining spatial smoothness.Chapter 1 Introduction 1 1.1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3 Contribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.4 Organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 Chapter 2 Related Works 9 2.1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.2 Principle of depth-from-focus . . . . . . . . . . . . . . . . . . . . 9 2.2.1 Focus measure operators . . . . . . . . . . . . . . . . . . . 12 2.3 Depth-from-focus reconstruction . . . . . . . . . . . . . . . . . . 14 2.4 Edge-preserving image denoising . . . . . . . . . . . . . . . . . . 23 Chapter 3 Depth-from-Focus Reconstruction using Nonlocal Matting Laplacian Prior 38 3.1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 3.2 Image matting and matting Laplacian . . . . . . . . . . . . . . . 40 3.3 Depth-from-focus . . . . . . . . . . . . . . . . . . . . . . . . . . . 43 3.4 Depth reconstruction . . . . . . . . . . . . . . . . . . . . . . . . . 47 3.4.1 Problem statement . . . . . . . . . . . . . . . . . . . . . . 47 3.4.2 Likelihood model . . . . . . . . . . . . . . . . . . . . . . . 48 3.4.3 Nonlocal matting Laplacian prior model . . . . . . . . . . 50 3.5 Experimental results . . . . . . . . . . . . . . . . . . . . . . . . . 55 3.5.1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . 55 3.5.2 Data configuration . . . . . . . . . . . . . . . . . . . . . . 55 3.5.3 Reconstruction results . . . . . . . . . . . . . . . . . . . . 56 3.5.4 Comparison between reconstruction using local and nonlocal matting Laplacian . . . . . . . . . . . . . . . . . . . 56 3.5.5 Spatial consistency analysis . . . . . . . . . . . . . . . . . 59 3.5.6 Parameter setting and analysis . . . . . . . . . . . . . . . 59 3.6 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62 Chapter 4 Closed-form MRF-based Depth Refinement 63 4.1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 4.2 Problem statement . . . . . . . . . . . . . . . . . . . . . . . . . . 65 4.3 Closed-form solution . . . . . . . . . . . . . . . . . . . . . . . . . 69 4.4 Edge preservation . . . . . . . . . . . . . . . . . . . . . . . . . . . 72 4.5 Texture-copy artifacts suppression . . . . . . . . . . . . . . . . . 73 4.6 Experimental results . . . . . . . . . . . . . . . . . . . . . . . . . 76 4.7 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80 Chapter 5 Evaluation 82 5.1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82 5.2 Evaluation metrics . . . . . . . . . . . . . . . . . . . . . . . . . . 83 5.3 Evaluation on synthetic datasets . . . . . . . . . . . . . . . . . . 84 5.4 Evaluation on real scene datasets . . . . . . . . . . . . . . . . . . 89 5.5 Limitations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92 5.6 Computational performances . . . . . . . . . . . . . . . . . . . . 93 Chapter 6 Conclusion 96 Bibliography 99Docto

Robust Feature Detection and Local Classification for Surfaces Based on Moment Analysis

The stable local classification of discrete surfaces with respect to features such as edges and corners or concave and convex regions, respectively, is as quite difficult as well as indispensable for many surface processing applications. Usually, the feature detection is done via a local curvature analysis. If concerned with large triangular and irregular grids, e.g., generated via a marching cube algorithm, the detectors are tedious to treat and a robust classification is hard to achieve. Here, a local classification method on surfaces is presented which avoids the evaluation of discretized curvature quantities. Moreover, it provides an indicator for smoothness of a given discrete surface and comes together with a built-in multiscale. The proposed classification tool is based on local zero and first moments on the discrete surface. The corresponding integral quantities are stable to compute and they give less noisy results compared to discrete curvature quantities. The stencil width for the integration of the moments turns out to be the scale parameter. Prospective surface processing applications are the segmentation on surfaces, surface comparison, and matching and surface modeling. Here, a method for feature preserving fairing of surfaces is discussed to underline the applicability of the presented approach.

Analisis Pengaruh Citra Gelap, Normal, Terang Terhadap Wavelet Orthogonal

Abstract. An image is classified into dark, normal, and bright image. The images are grouped in the dark images according to the histogram and the mu value. An image consists of information and redundancies. The use of wavelet is considered effective in image compression and it does not only cut down the memory usage but also it makes devices work faster. In this study, an analysis in conducted on the influence of dark, normal, and bright images on the orthogonal wavelet. Peak Signal to Noise Ratio (PSNR) is used to compare 17 functions of wavelet orthogonal in the image compression of dark, normal, and bright images. PSNR is a measurement parameter commonly used for measuring the quality of image reconstruction which is then compared with the original image. Compression ratio is used to measure the reduction of the data size after the compression process. Based on the research on the dark, normal, and bright image, the findings reveal that bright image has got the lowest PNSR value at all image testing while the normal image has the highest PSNR value at the wavelet orthogonal application. Keywords : Image compression, Orthogonal wavelet, PSNR, compression ratio.Abstrak. Suatu citra dikelompokkan menjadi citra gelap, citra normal, dan citra terang. Pengelompokan citra menjadi warna gelap terlihat dari histogram dan nilai rerata intensitas (mu). Citra terdiri atas informasi dan redudansi. Penggunaan wavelet dinilai efektif dalam kompresi citra dan menurunkan penggunaan memori serta membuat perangkat menjadi lebih cepat. Pada penelitian ini, dilakukan analisis pengaruh citra gelap, citra normal, dan citra terang terhadap wavelet orthogonal. Peak Signal to Noise Ratio (PSNR) digunakan untuk membandingkan 17 fungsi wavelet orthogonal dalam kompresi citra gelap, citra normal, dan citra terang. PSNR adalah parameter ukur yang sering digunakan untuk pengukuran kualitas gambar rekonstruksi, yang lalu dibandingkan dengan gambar asli. Rasio kompresi digunakan untuk mengukur pengurangan ukuran data setelah proses kompresi. Berdasarkan penelitian pada citra gelap, citra normal, dan citra terang diperoleh bahwa citra terang menghasilkan nilai PSNR paling kecil untuk seluruh citra uji dan citra normal menghasilkan nilai PSNR paling besar dalam penerapan wavelet orthogonal. Kata kunci : Kompresi citra, Wavelet orthogonal, PSNR, rasio kompresi

Quality assessment metrics for edge detection and edge-aware filtering: A tutorial review

The quality assessment of edges in an image is an important topic as it helps to benchmark the performance of edge detectors, and edge-aware filters that are used in a wide range of image processing tasks. The most popular image quality metrics such as Mean squared error (MSE), Peak signal-to-noise ratio (PSNR) and Structural similarity (SSIM) metrics for assessing and justifying the quality of edges. However, they do not address the structural and functional accuracy of edges in images with a wide range of natural variabilities. In this review, we provide an overview of all the most relevant performance metrics that can be used to benchmark the quality performance of edges in images. We identify four major groups of metrics and also provide a critical insight into the evaluation protocol and governing equations