Search

This paper presents a new approach to represent an image by "verge points," which are defined as high-curvature points on the image surface. This representation offers a compact and reversible way to preserve the essence of the original image. Various applications, such as compression, edge detection, image enhancement, and image editing, can be achieved based on this representation. In this paper, the whole procedure for verge point representation is presented. Based on these verge points, image reconstruction can be easily achieved via iterative linear interpolation. These extracted verge points with compatible properties are further linked into verge curves to offer more compact representation. Progressive representation is also developed based on a multiscale extraction scheme. Some potential applications are then presented to demonstrate the versatility of this representation. [ABSTRACT FROM AUTHOR]

The logarithmic image processing (LIP) model is a mathematical theory that provides new operations for image processing. The contrast definition has been shown to be consistent with some important physical laws and characteristics of human visual system. In this paper, we establish an information-theoretic interpretation of the contrast definition. We show that it can be expressed as a combination of the relative entropy and Shannon's information content. Based on this new interpretation, we propose an adaptive algorithm for enhancing the contrast and sharpness of noisy images. [ABSTRACT FROM AUTHOR]

One of the fastest methods of localizing edges in images is based on small gradient kernels, such as Sobel, Prewitt, and Roberts. Although small gradient kernels provide a fast way of computing the gradients, they have little control over noise, edge location, and edge orientation. They are known to be only sensitive to step edges and fail to detect smooth boundaries, On the other hand, large kernels provide superior noise suppression characteristics, but they suffer from wide response area around edges. They cause edges of neighboring objects to merge due to their wide support. Problems associated with large gradient kernels prevent their widespread usage. This paper presents a fuzzy topology-based method to facilitate the use of larger gradient kernels. The new method effectively limits the response area around the edge and prevents neighboring objects to affect each other. Synthetic images are used to show the superior noise suppression properties and response characteristics to both step and ramp edges. Natural images are also used to assess the performance of the newly proposed topological gradient estimation qualitatively. [ABSTRACT FROM AUTHOR]

This paper introduces a new edge-grouping method to detect perceptually salient structures in noisy images. Specifically, we define a new grouping cost function in a ratio form, where the numerator measures the boundary proximity of the resulting structure and the denominator measures the area of the resulting structure. This area term introduces a preference towards detecting larger-size structures and, therefore, makes the resulting edge grouping more robust to image noise. To find the optimal edge grouping with the minimum grouping cost, we develop a special graph model with two different kinds of edges and then reduce the grouping problem to finding a special kind of cycle in this graph with a minimum cost in ratio form. This optimal cycle-finding problem can be solved in polynomial time by a previously developed graph algorithm. We implement this edge-grouping method, test it on both synthetic data and real images, and compare its performance against several available edge-grouping and edge-linking methods. Furthermore, we discuss several extensions of the proposed method, including the incorporation of the well-known grouping cues of continuity and intensity homogeneity, introducing a factor to balance the contributions from the boundary and region information, and the prevention of detecting self-intersecting boundaries. [ABSTRACT FROM AUTHOR]

Self-similar random fields are of interest in various areas of image processing since they fit certain types of natural pat- terns and textures. Current treatments of self-similarity in continuous two-dimensional (2-D) space use a definition that is a direct extension of the one-dimensional definition, which requires invariance of the statistics of a random process to time scaling. Current discrete-space 2-D approaches do not consider scaling, but, instead, are based on ad hoc formulations, such as digitizing continuous random fields. In this paper, we show that the current statistical self-similarity definition in continuous space is restrictive and provide an alternative, more general definition. We also provide a formalism for discrete-space statistical self-similarity that relies on a new scaling operator for discrete images. Within the new framework, it is possible to synthesize a wider class of discrete-space self-similar random fields and texture images. [ABSTRACT FROM AUTHOR]

A dynamic texture (DT) is an extension of the texture to the temporal domain. How to segment a DT is a challenging problem. In this paper, we address the problem of segmenting a DT into disjoint regions. A DT might be different from its spatial mode (i.e., appearance) and/or temporal mode (i.e., motion field). To this end, we develop a framework based on the appearance and motion modes. For the appearance mode, we use a new local spatial texture descriptor to describe the spatial mode of the DT; for the motion mode, we use the optical flow and the local temporal texture descriptor to represent the temporal variations of the DT. In addition, for the optical flow, we use the histogram of oriented optical flow (HOOF) to organize them. To compute the distance between two HOOFs, we develop a simple effective and efficient distance measure based on Weber's law. Furthermore, we also address the problem of threshold selection by proposing a method for determining thresholds for the segmentation method by an offline supervised statistical learning. The experimental results show that our method provides very good segmentation results compared to the state-of-the-art methods in segmenting regions that differ in their dynamics. [ABSTRACT FROM PUBLISHER]

Level set methods have been widely used in image processing and computer vision. In conventional level set formulations, the level set function typically develops irregularities during its evolution, which may cause numerical errors and eventually destroy the stability of the evolution. Therefore, a numerical remedy, called reinitialization, is typically applied to periodically replace the degraded level set function with a signed distance function. However, the practice of reinitialization not only raises serious problems as when and how it should be performed, but also affects numerical accuracy in an undesirable way. This paper proposes a new variational level set formulation in which the regularity of the level set function is intrinsically maintained during the level set evolution. The level set evolution is derived as the gradient flow that minimizes an energy functional with a distance regularization term and an external energy that drives the motion of the zero level set toward desired locations. The distance regularization term is defined with a potential function such that the derived level set evolution has a unique forward-and-backward (FAB) diffusion effect, which is able to maintain a desired shape of the level set function, particularly a signed distance profile near the zero level set. This yields a new type of level set evolution called distance regularized level set evolution (DRLSE). The distance regularization effect eliminates the need for reinitialization and thereby avoids its induced numerical errors. In contrast to complicated implementations of conventional level set formulations, a simpler and more efficient finite difference scheme can be used to implement the DRLSE formulation. DRLSE also allows the use of more general and efficient initialization of the level set function. In its numerical implementation, relatively large time steps can be used in the finite difference scheme to reduce the number of iterations, while ensuring sufficient numerical accuracy. To demonstrate the effectiveness of the DRLSE formulation, we apply it to an edge-based active contour model for image segmentation, and provide a simple narrowband implementation to greatly reduce computational cost. [ABSTRACT FROM AUTHOR]

In this paper, a total variation (TV) based approach is proposed for pixel-level fusion to fuse images acquired using multiple sensors. In this approach, fusion is posed as an inverse problem and a locally affine model is used as the forward model. A TV seminorm based approach in conjunction with principal component analysis is used iteratively to estimate the fused image. The feasibility of the proposed algorithm is demonstrated on images from computed tomography (CT) and magnetic resonance imaging (MRI) as well as visible-band and infrared sensors. The results clearly indicate the feasibility of the proposed approach. [ABSTRACT FROM AUTHOR]

It is well known that the wavelet transform provides a very effective framework for analysis of multiscale edges. In this paper, we propose a novel approach based on the shearlet transform: a multiscale directional transform with a greater ability to localize distributed discontinuities such as edges. Indeed, unlike traditional wavelets, shearlets are theoretically optimal in representing images with edges and, in particular, have the ability to fully capture directional and other geometrical features. Numerical examples demonstrate that the shearlet approach is highly effective at detecting both the location and orientation of edges, and outperforms methods based on wavelets as well as other standard methods. Furthermore, the shearlet approach is useful to design simple and effective algorithms for the detection of corners and junctions. [ABSTRACT FROM AUTHOR]

In this paper, we address the problems of unreliable motion vectors that cause visual artifacts but cannot be detected by high residual energy or bidirectional prediction difference in motion-compensated frame interpolation. A correlation-based motion vector processing method is proposed to detect and correct those unreliable motion vectors by explicitly considering motion vector correlation in the motion vector reliability classification, motion vector correction, and frame interpolation stages. Since our method gradually corrects unreliable motion vectors based on their reliability, we can effectively discover the areas where no motion is reliable to be used, such as occlusions and deformed structures. We also propose an adaptive frame interpolation scheme for the occlusion areas based on the analysis of their surrounding motion distribution. As a result, the interpolated frames using the proposed scheme have clearer structure edges and ghost artifacts are also greatly reduced. Experimental results show that our interpolated results have better visual quality than other methods. In addition, the proposed scheme is robust even for those video sequences that contain multiple and fast motions. [ABSTRACT FROM AUTHOR]

Real images can contain geometric distortions as well as photometric degradations. Analysis and characterization of those images without recourse to either restoration or geometric standardization is of great importance for the computer vision community as those two processes are often ill-posed problems. To this end, it is necessary to implement image descriptors that make it possible to identify the original image in a simple way independently of the imaging system and imaging conditions. Ideally, descriptors that capture image characteristics must be invariant to the whole range of geometric distortions and photometric degradations, such as blur, that may affect the image. In this paper, we introduce two new classes of radiometric and/or geometric invariant descriptors. The first class contains two types of radiometric invariant descriptors. The first of these type is based on the Mellin transform and the second one is based on central moments. Both descriptors are invariant to contrast changes and to convolution with any kernel having a symmetric form with respect to the diagonals. The second class contains two subclasses of combined invariant descriptors. The first subclass includes central-moment-based descriptors invariant simultaneously to horizontal and vertical translations, to uniform and anisotropic scaling, to stretching, to convolution, and to contrast changes. The second subclass contains central-complex-moment-based descriptors that are simultaneously invariant to similarity transformation and to contrast changes. We apply these invariant descriptors to the matching of geometric transformed and/or blurred images. Experimental results confirm both the robustness and the effectiveness of the proposed invariants. [ABSTRACT FROM AUTHOR]

Gabor filters are widely applied in image analysis and computer vision applications. This paper describes a fast algorithm for isotropic complex Gabor filtering that outperforms existing implementations. The main computational improvement arises from the decomposition of Gabor filtering into more efficient Gaussian filtering and sinusoidal modulations. Appropriate filter initial conditions are derived to avoid boundary transients, without requiring explicit image border extension. Our proposal reduces up to 39% the number of required operations with respect to state-of-the-art approaches. A full C++ implementation of the method is publicly available. [ABSTRACT FROM AUTHOR]

The problem of determining the location and orientation of straight lines in images is of great importance in the fields of computer vision and image processing. Traditionally the Hough transform, (a special case of the Radon transform) has been widely used to solve this problem for binary images. In this paper, we pose the problem of detecting straight lines in gray-scale images as an inverse problem. Our formulation is based on use of the inverse Radon operator, which relates the parameters determining the location and orientation of the lines in the image to the noisy input image. The advantage of this formulation is that we can then approach the problem of line detection within a regularization framework and enhance the performance of the Hough-based line detector through the incorporation of prior information in the form of regularization. We discuss the type of regularizers that are useful for this problem and derive efficient computational schemes to solve the resulting optimization problems enabling their use in large applications. Finally, we show how our new approach can be alternatively viewed as one of finding an optimal representation of the noisy image in terms of elements chosen from a dictionary of lines. This interpretation relates the problem of Hough-based line finding to the body of work on adaptive signal representation. [ABSTRACT FROM AUTHOR]

The inverse halftoning algorithm is used to reconstruct a gray image from an input halftone image. Based on the recently published lookup table (LUT) technique, this paper presents a novel edge-based LUT method for inverse halftoning which improves the quality of the reconstructed gray image. The proposed method first uses the LUT-based inverse halftoning method as a Preprocessing step to transform the given halftone image to a base gray image, and then the edges are extracted and classified from the base gray image. According to these classified edges, a novel edge-based LUT is built up to reconstruct the gray image. Based on a set of 30 real training images with both low- and high-frequency contents, experimental results demonstrated that the proposed method achieves a better image quality when compared to the currently published two methods, by Chang et al. and Meşe and Vaidyanathan. [ABSTRACT FROM AUTHOR]

We propose an image deconvolution algorithm when the data is contaminated by Poisson noise. The image to restore is assumed to be sparsely represented in a dictionary of waveforms such as the wavelet or curvelet transforms. Our key contributions are as follows. First, we handle the Poisson noise properly by using the Anscombe variance stabilizing transform leading to a nonlinear degradation equation with additive Gaussian noise. Second, the deconvolution problem is formulated as the minimization of a convex functional with a data-fidelity term reflecting the noise properties, and a nonsmooth sparsity-promoting penalty over the image representation coefficients (e.g., l1-norm). An additional term is also included in the functional to ensure positivity of the restored image. Third, a fast iterative forward-backward splitting algorithm is proposed to solve the minimization problem. We derive existence and uniqueness conditions of the solution, and establish convergence of the iterative algorithm. Finally, a GCV-based model selection procedure is proposed to objectively select the regularization parameter. Experimental results are carried out to show the striking benefits gained from taking into account the Poisson statistics of the noise. These results also suggest that using sparse-domain regularization may be tractable in many deconvolution applications with Poisson noise such as astronomy and microscopy. [ABSTRACT FROM AUTHOR]

Classification of plants based on a multi-organ approach is very challenging. Although additional data provide more information that might help to disambiguate between species, the variability in shape and appearance in plant organs also raises the degree of complexity of the problem. Despite promising solutions built using deep learning enable representative features to be learned for plant images, the existing approaches focus mainly on generic features for species classification, disregarding the features representing plant organs. In fact, plants are complex living organisms sustained by a number of organ systems. In our approach, we introduce a hybrid generic-organ convolutional neural network (HGO-CNN), which takes into account both organ and generic information, combining them using a new feature fusion scheme for species classification. Next, instead of using a CNN-based method to operate on one image with a single organ, we extend our approach. We propose a new framework for plant structural learning using the recurrent neural network-based method. This novel approach supports classification based on a varying number of plant views, capturing one or more organs of a plant, by optimizing the contextual dependencies between them. We also present the qualitative results of our proposed models based on feature visualization techniques and show that the outcomes of visualizations depict our hypothesis and expectation. Finally, we show that by leveraging and combining the aforementioned techniques, our best network outperforms the state of the art on the PlantClef2015 benchmark. The source code and models are available at https://github.com/cs-chan/Deep-Plant. [ABSTRACT FROM AUTHOR]

Estimation of local orientations in multivariate signals is an important problem in image processing and computer vision. This general problem formulation also covers optical flow estimation, which can be regarded as orientation estimation in space-time-volumes. Modelling a signal using only a single orientation, however, is often too restrictive, since occlusions and transparencies occur frequently, thus necessitating the modelling and analysis of multiple orientations. We, therefore, develop a unifying mathematical model for multiple orientations: Beyond describing an arbitrary number of orientations in scalar- and vector-valued image data such as color image sequences, it allows the unified treatment of additively and occludingly superimposed oriented structures as well as of combinations of these. Based on this model, we describe estimation schemes for an arbitrary number of additively or occludingly superimposed orientations in images. We confirm the performance of our framework on both synthetic and real image data. [ABSTRACT FROM AUTHOR]

A novel preferential image segmentation method is proposed that performs image segmentation and object recognition using mathematical morphologies. The method preferentially segments objects that have intensities and boundaries similar to those of objects in a database of prior images. A tree of shapes is utilized to represent the content distributions in images, and curve matching is applied to compare the boundaries. The algorithm is invariant to contrast change and similarity transformations of translation, rotation and scale. A performance evaluation of the proposed method using a large image dataset is provided. Experimental results show that the proposed approach is promising for applications such as object segmentation and video tracking with cluttered backgrounds. [ABSTRACT FROM AUTHOR]

Detection of moving objects in video streams is the first relevant step of information extraction in many computer vision applications. Aside from the intrinsic usefulness of being able to segment video streams into moving and background components, detecting moving objects provides a focus of attention for recognition, classification, and activity analysis, making these later steps more efficient. We propose an approach based on self organization through artificial neural networks, widely applied in human image processing systems and more generally in cognitive science. The proposed approach can handle scenes containing moving backgrounds, gradual illumination variations and camouflage, has no bootstrapping limitations, can include into the background model shadows cast by moving objects, and achieves robust detection for different types of videos taken with stationary cameras. We compare our method with other modeling techniques and report experimental results, both in terms of detection accuracy and in terms of processing speed, for color video sequences that represent typical situations critical for video surveillance systems. [ABSTRACT FROM AUTHOR]

We introduce a nonlocal discrete regularization framework on weighted graphs of the arbitrary topologies for image and manifold processing. The approach considers the problem as a variational one, which consists of minimizing a weighted sum of two energy terms: a regularization one that uses a discrete weighted p-Dirichlet energy and an approximation one. This is the discrete analogue of recent continuous Euclidean nonlocal regularization functionals. The proposed formulation leads to a family of simple and fast nonlinear processing methods based on the weighted p-Laplace operator, parameterized by the degree p of regularity, the graph structure and the graph weight function. These discrete processing methods provide a graph-based version of recently proposed semi-local or nonlocal processing methods used in image and mesh processing, such as the bilateral filter, the TV digital filter or the nonlocal means filter. It works with equal ease on regular 2-D and 3-D images, manifolds or any data. We illustrate the abilities of the approach by applying it to various types of images, meshes, manifolds, and data represented as graphs. [ABSTRACT FROM AUTHOR]

In contrast to holistic methods, local matching methods extract facial features from different levels of locality and quantify them precisely. To determine how they can be best used for face recognition, we conducted a comprehensive comparative study at each step of the local matching process. The conclusions from our experiments include: 1) additional evidence that Gabor features are effective local feature representations and are robust to illumination changes; 2) discrimination based only on a small portion of the face area is surprisingly good; 3) the configuration of facial components does contain rich discriminating information and comparing corresponding local regions utilizes shape features more effectively than comparing corresponding facial components; 4) spatial multiresolution analysis leads to better classification performance; 5) combining local regions with Borda count classifier combination method alleviates the curse of dimensionality. We implemented a complete face recognition system by integrating the best option of each step. Without training, illumination compensation and without any parameter tuning, it achieves superior performance on every category of the FERET test: near perfect classification accuracy (99.5%) on pictures taken on the same day regardless of indoor illumination variations, and significantly better than any other reported performance on pictures taken several days to more than a year apart. The most significant experiments were repeated on the AR database, with similar results. [ABSTRACT FROM AUTHOR]

Various applications such as mosaicing and object insertion require stitching of image parts. The stitching quality is measured visually by the similarity of the stitched image to each of the input images, and by the visibility of the seam between the stitched images. In order to define and get the best possible stitching, we introduce several formal cost functions for the evaluation of the stitching quality. In these cost functions the similarity to the input images and the visibility of the seam are defined in the gradient domain, minimizing the disturbing edges along the seam. A good image stitching will optimize these cost functions, overcoming both photometric inconsistencies and geometric misalignments between the stitched images. We study the cost functions and compare their performance for different scenarios both theoretically and practically. Our approach is demonstrated in various applications including generation of panoramic images, object blending and removal of compression artifacts. Comparisons with existing methods show the benefits of optimizing the measures in the gradient domain. [ABSTRACT FROM AUTHOR]