Cluster Deletion and Cluster Editing ask to transform a graph by at most k edge deletions or edge edits, respectively, into a cluster graph, i.e., disjoint union of cliques. Equivalently, a cluster graph has no conflict triples, i.e., two incident edges without a transitive edge. We solve the two problems in time O∗(1.415k) and O∗(1.76k), respectively. These results round off our earlier work b...

We present an effective method for defocus map estimation from a single natural image. It is inspired by the observation that defocusing can significantly affect the spectrum amplitude at the object edge locations in an image. By establishing the relationship between the amount of spatially varying defocus blur and spectrum contrast at edge locations, we first estimate the blur amount at these ...

Color-filter-array demosaicking is an essential step in rendering full color images from single-sensor digital cameras. Because each pixel only records one color value, estimates of the missing color information at each pixel must be made. In this paper, extrapolation equations based on higher orders of the Taylor series are proposed for accurate, direction-oriented estimations of missing color...

Introduction: The most popular algorithm for the VLSI implementation of motion estimation is the block-based full-search algorithm [1–3]. However, the full-search algorithm notoriously needs high computation load and large memory size. The high computational cost has become a major problem in the implementation of motion estimation. Many papers have proposed different ways to reduce the computa...

Forest’s ecosystem is one of the most important carbon sink of the terrestrial ecosystem. Remote sensing technology provides robust techniques to estimate biomass and solve challenges in forest resource assessment. The present study explored the potential of Sentinel-2 bands to estimate biomass and comparatively analyzed of red-edge band based and broadband derived vegetation indices. Broadband...

One of the most fundamental features of digital image and the basic steps in image processing, analysis, pattern recognition and computer vision is the edge of an image where the preciseness and reliability of its results will affect directly on the comprehension machine system made objective world. Several edge detectors have been developed in the past decades, although no single edge detector...

Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...

We present a theoretical study of the anisotropy and collection angle dependence of the oxygen K ELNES in V2O5. Ab initio band-structure calculations were performed with WIEN97, a program package based on the full potential linearised augmented plane waves (FP-LAPW) method. An analysis of the site and angular momentum projected DOS allowed the identification of differently coordinated oxygens a...

Topological insulators are a new class of materials that exhibit robust and scatter-free transport along their edges - independently of the fine details of the system and of the edge - due to topological protection. To classify the topological character of two-dimensional systems without additional symmetries, one commonly uses Chern numbers, as their sum computed from all bands below a specifi...

Edge detection and edge enhancement techniques play an essential role in interpreting potential field data. This paper describes the application of various edge detection techniques to gravity data in order to delineate the edges of subsurface structures. The edge detection methods comprise analytic signal, total horizontal derivative (THDR), theta angle, tilt angle, hyperbolic of tilt angle (H...