The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Image intensity inhomogeneity and low contrast aretwo substantial challengesfor image segmentation. In this work, we propose a new active contour method forsegmenting images with inhomogeneous intensity and low contrast. To deal with the intensity inhomogeneity, we use a local image fitting term. To deal with low contrast, we use a strictly convex and differential function as the data fidelity measure...
Block-matching and 3D filtering (BM3D) has showngreat power for image denoising. By decomposing the BM3Drestored image into three orthogonal subbands, we find thatthe subband of the high-frequency component, of which thewavelet coefficients are less than a given threshold, has madesome true textures of the original image lost and, the PSNR ofthe restored image is pulled down. Therefore, in this paper,...
Active Contour method has been shown very effective in detecting the contour of region(s)-of-interest(ROI) and is widely used in image processing and computer vision. In this work, we aim to improve the performance of Zhang's method in detecting boundary of ROIs. Specifically, we will generalize the CV energy functional and give a new special case. The new energy functional penalize the approximation...
This paper proposes a new model to remove the multiplicative noise. We incorporate the cartoon-texture decomposition into a multiplicative denoising model, and design a new convex optimization model. The superiority of the proposed model lies in adding the H−1 norm of texture component, which can help to recover more image information. We solve the model numerically by Douglas-Rachford splitting algorithm...
Subspace clustering aims to reveal the latent subspace structure underlying high dimensional data by segmenting the data into corresponding subspaces. It has found wide applications in machine learning and computer vision. Most recent works on subspace segmentation focus on subspace representation based methods, which constructs the affinity matrix from the subspace representation of data points....
Traditional escalator used to be controlled by relay and contactor, the control system of which was relatively cheap, but had disadvantages of multiple contact, complicated wiring, more fault, poor reliability and son on. If it is controlled by PLC, the hardware cost is higher. In order to reduce costs, simplify programming, make maintenance convenient, the energy-saving control system on escalator,...
The proposed image denoising method investigates a novel similar block searching strategy based on non-local Markov-Chain Monte Carlo (MCMC) sampling with alterable direction. Firstly, observed image is decomposed with 2-D wavelet transform to obtain a series sub-band images in spatial Following, the similar matching block clusters of each sub-band image in spatial are obtained by taking the different...
The non-local means method (NLM) is widely used in image denoising. However, the performance of this method heavily depends on the choice of smoothness parameters. In this paper, we present a novel multi-scale non-local means method (MNLM) for image denoising. By introducing the multi-scale decomposition of images, our method can avoid the difficulty of choosing the smoothness parameters. Compared...
This paper describes an image inpainting algorithm based on two tight frame systems that can sparsely represent cartoons and textures respectively. The proposed minimization formulation adopts nonconvex approximation via balanced approach, and an iterative algorithm is derived to find its solution. Numerical simulations demonstrate that the proposed nonconvex algorithm can significantly improve the...
This paper proposes a new model for image decomposition by nonconvex functional minimization. Instead of using the Banach norm as the fidelity term, we use the integral of the square of residual component divided by its gradient as the fidelity term. This nonconvex fidelity term has very low value for the texture image and high value for the geometric image, so it is appropriate for image decomposition...
Referred to a process based model, with Web development tool and advanced object-oriented approach, a universal Web-based simulation system for greenhouse crops was developed, it can be accessed by users in different places by Internet exploring, which provides much convenient way to simulate the growth of greenhouse crops such as tomato, cucumber, etc. With the Web-based model, optimal environmental...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.